| Publication | Date of Publication | Type |
|---|
Evaluation of an MSO-Solver
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Discrete Applied Mathematics | 2018-12-03 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Fast biclustering by dual parameterization
(available as arXiv preprint) | 2017-09-29 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Finite integer index of pathwidth and treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Practical algorithms for MSO model-checking on tree-decomposable graphs
Computer Science Review | 2014-11-24 | Paper |
A faster parameterized algorithm for treedepth
Automata, Languages, and Programming | 2014-07-01 | Paper |
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
The parameterized complexity of unique coverage and its variants
Algorithmica | 2013-08-05 | Paper |
FPT algorithms for connected feedback vertex set
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
On the directed full degree spanning tree problem
Discrete Optimization | 2012-10-16 | Paper |
| Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking | 2012-08-23 | Paper |
The parameterized complexity of stabbing rectangles
Algorithmica | 2012-04-26 | Paper |
The complexity of König subgraph problems and above-guarantee vertex cover
Algorithmica | 2011-12-14 | Paper |
Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
Parameterized complexity of the induced subgraph problem in directed graphs
Information Processing Letters | 2010-03-24 | Paper |
FPT algorithms for connected feedback vertex set
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On the directed degree-preserving spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
Simpler parameterized algorithm for OCT
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The Budgeted Unique Coverage Problem and Color-Coding
Computer Science - Theory and Applications | 2009-08-18 | Paper |
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics | 2009-06-30 | Paper |
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences | 2009-03-11 | Paper |
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Frontiers in Algorithmics | 2009-03-10 | Paper |
König Deletion Sets and Vertex Covers above the Matching Size
Algorithms and Computation | 2009-01-29 | Paper |
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
Frontiers in Algorithmics | 2008-06-19 | Paper |
Parameterizing MAX SNP Problems Above Guaranteed Values
Parameterized and Exact Computation | 2008-06-03 | Paper |
The Parameterized Complexity of the Unique Coverage Problem
Algorithms and Computation | 2008-05-27 | Paper |
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Algorithms and Computation | 2008-05-27 | Paper |
Efficient exact algorithms through enumerating maximal independent sets and other techniques
Theory of Computing Systems | 2007-12-19 | Paper |
Progress in Cryptology - INDOCRYPT 2003
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
