| Publication | Date of Publication | Type |
|---|
Independent set in \(P_5\)-free graphs in polynomial time
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Large induced subgraphs via triangulations and CMSO
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| scientific article; zbMATH DE number 7053390 (Why is no real title available?) | 2019-05-10 | Paper |
FPT algorithms for domination in sparse graphs and beyond
Theoretical Computer Science | 2019-05-02 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Algorithmica | 2018-04-06 | Paper |
Exploring subexponential parameterized complexity of completion problems
(available as arXiv preprint) | 2017-03-03 | Paper |
| On the parameterised complexity of string morphism problems | 2017-02-21 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
| Searching for better fill-in | 2017-01-30 | Paper |
Large Induced Subgraphs via Triangulations and CMSO
SIAM Journal on Computing | 2017-01-13 | Paper |
Treewidth and pathwidth parameterized by the vertex cover number
Discrete Applied Mathematics | 2016-11-24 | Paper |
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics | 2016-11-24 | Paper |
Maximal induced matchings in triangle-free graphs
Journal of Graph Theory | 2016-11-16 | Paper |
Exploring the subexponential complexity of completion problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Largest chordal and interval subgraphs faster than \(2^n\)
Algorithmica | 2016-10-21 | Paper |
On the parameterised complexity of string morphism problems
Theory of Computing Systems | 2016-09-21 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Maximal induced matchings in triangle-free graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Algorithmica | 2015-09-02 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Algorithmica | 2015-09-02 | Paper |
Minimum fill-in of sparse graphs: kernelization and approximation
Algorithmica | 2015-03-02 | Paper |
A multi-parameter analysis of hard problems on deterministic finite automata
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Induced subgraph isomorphism on proper interval and bipartite permutation graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Enumerating minimal subset feedback vertex sets
Algorithmica | 2014-11-19 | Paper |
| Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) | 2014-10-13 | Paper |
Kernel(s) for problems with no kernel
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Searching for better fill-in
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Subexponential parameterized algorithm for minimum fill-in
SIAM Journal on Computing | 2014-04-11 | Paper |
A Polynomial Kernel for Proper Interval Vertex Deletion
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
Discrete Applied Mathematics | 2014-04-02 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science | 2014-01-13 | Paper |
Connecting Terminals and 2-Disjoint Connected Subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Largest Chordal and Interval Subgraphs Faster Than 2 n
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Treewidth computation and extremal combinatorics
Combinatorica | 2013-08-06 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Automata, Languages, and Programming | 2013-08-06 | Paper |
Proper interval vertex deletion
Algorithmica | 2013-05-16 | Paper |
A multivariate analysis of some DFA problems
Language and Automata Theory and Applications | 2013-03-18 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A polynomial kernel for \textsc{Proper Interval Vertex Deletion}
Algorithms – ESA 2012 | 2012-09-25 | Paper |
FPT algorithms for domination in biclique-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2012-08-31 | Paper |
Local search: is brute-force avoidable?
Journal of Computer and System Sciences | 2012-08-17 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
| \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves | 2012-04-24 | Paper |
| Finding induced subgraphs via minimal triangulations | 2012-01-23 | Paper |
Faster parameterized algorithms for \textsc{Minimum Fill-in}
Algorithmica | 2011-12-14 | Paper |
Exact algorithm for the maximum induced planar subgraph problem
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Enumerating minimal subset feedback vertex sets
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Induced subgraph isomorphism on interval and proper interval graphs
Algorithms and Computation | 2010-12-09 | Paper |
Proper Interval Vertex Deletion
Parameterized and Exact Computation | 2010-12-07 | Paper |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
A quartic kernel for pathwidth-one vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
A parameterized algorithm for chordal sandwich
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Computing Pathwidth Faster Than 2 n
Parameterized and Exact Computation | 2010-01-14 | Paper |
Interval Completion Is Fixed Parameter Tractable
SIAM Journal on Computing | 2009-11-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing | 2009-06-22 | Paper |
Improved Algorithms for the Feedback Vertex Set Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Faster Parameterized Algorithms for Minimum Fill-In
Algorithms and Computation | 2009-01-29 | Paper |
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
| scientific article; zbMATH DE number 5485472 (Why is no real title available?) | 2009-01-05 | Paper |
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences | 2008-11-19 | Paper |
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Treewidth Computation and Extremal Combinatorics
Automata, Languages and Programming | 2008-08-28 | Paper |
Capacitated Domination and Covering: A Parameterized Perspective
Parameterized and Exact Computation | 2008-06-05 | Paper |
Characterizing Minimal Interval Completions
STACS 2007 | 2007-09-03 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms | 2006-04-28 | Paper |
A vertex incremental approach for maintaining chordality
Discrete Mathematics | 2006-03-29 | Paper |
Lex M versus MCS-M
Discrete Mathematics | 2006-03-29 | Paper |
| scientific article; zbMATH DE number 1947421 (Why is no real title available?) | 2003-07-08 | Paper |
