| Publication | Date of Publication | Type |
|---|
A piecewise approach for the analysis of exact algorithms
Theoretical Computer Science | 2026-03-20 | Paper |
| Quantum algorithms for graph coloring and other partitioning, covering, and packing problems | 2026-01-14 | Paper |
| Strong backdoors to bounded treewidth SAT | 2025-05-20 | Paper |
Cluster editing with vertex splitting
Discrete Applied Mathematics | 2025-05-19 | Paper |
| A piecewise approach for the analysis of exact algorithms | 2025-04-15 | Paper |
Faster graph coloring in polynomial space
Algorithmica | 2023-02-16 | Paper |
scientific article; zbMATH DE number 7650292 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Extremal vertex-sets | 2022-12-21 | Paper |
Enumeration of preferred extensions in almost oriented digraphs
(available as arXiv preprint) | 2022-07-21 | Paper |
Stable matching with uncertain pairwise preferences
Theoretical Computer Science | 2022-03-01 | Paper |
On the complexity of the smallest grammar problem over fixed alphabets
Theory of Computing Systems | 2021-06-24 | Paper |
| Backdoor sets for CSP | 2021-06-15 | Paper |
Barrier coverage with non-uniform lengths to minimize aggregate movements
(available as arXiv preprint) | 2020-11-25 | Paper |
| Colouring square-free graphs without long induced paths | 2020-08-05 | Paper |
The parameterized complexity of positional games
(available as arXiv preprint) | 2020-05-27 | Paper |
Exact algorithms via multivariate subroutines
(available as arXiv preprint) | 2020-05-27 | Paper |
Stable matching with uncertain linear preferences
Algorithmica | 2020-04-01 | Paper |
| When is red-blue nonblocker fixed-parameter tractable? | 2020-02-12 | Paper |
Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs
Journal of Graph Theory | 2019-12-30 | Paper |
Exact algorithms via monotone local search
Journal of the ACM | 2019-11-21 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
\((2P_2,K_4)\)-free graphs are 4-colorable
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Enumeration of Preferred Extensions in Almost Oriented Digraphs
(available as arXiv preprint) | 2019-07-01 | Paper |
| A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between | 2019-05-06 | Paper |
Turbocharging treewidth heuristics
Algorithmica | 2019-02-14 | Paper |
Fixing balanced knockout and double elimination tournaments
Artificial Intelligence | 2019-01-18 | Paper |
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
ACM Transactions on Algorithms | 2018-11-12 | Paper |
A note on the eternal dominating set problem
International Journal of Game Theory | 2018-10-04 | Paper |
On the number of minimal separators in graphs
Journal of Graph Theory | 2018-04-27 | Paper |
| Turbocharging treewidth heuristics | 2018-04-10 | Paper |
On satisfiability problems with a linear structure
(available as arXiv preprint) | 2018-04-10 | Paper |
| Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs | 2018-01-04 | Paper |
| On the complexity of grammar-based compression over fixed alphabets | 2017-12-19 | Paper |
Faster graph coloring in polynomial space
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Exact algorithms via monotone local search
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences | 2016-12-28 | Paper |
On the number of minimal separators in graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Stable Matching with Uncertain Linear Preferences
Algorithmic Game Theory | 2016-09-29 | Paper |
Faster Algorithms to Enumerate Hypergraph Transversals
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Backdoors to q-Horn
Algorithmica | 2016-03-23 | Paper |
Myhill-Nerode methods for hypergraphs
Algorithmica | 2016-02-19 | Paper |
Fair assignment of indivisible objects under ordinal preferences
Artificial Intelligence | 2015-12-21 | Paper |
Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
Automata, Languages, and Programming | 2015-10-27 | Paper |
On finding optimal polytrees
Theoretical Computer Science | 2015-10-08 | Paper |
Augmenting graphs to minimize the diameter
Algorithmica | 2015-09-02 | Paper |
Complexity of splits reconstruction for low-degree trees
Discrete Applied Mathematics | 2014-11-28 | Paper |
Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Artificial Intelligence | 2014-10-13 | Paper |
| A branch-and-reduce algorithm for finding a minimum independent dominating set | 2014-03-25 | Paper |
Multivariate complexity theory
Computer Science | 2014-02-21 | Paper |
Augmenting graphs to minimize the diameter
Lecture Notes in Computer Science | 2014-01-14 | Paper |
Myhill-Nerode methods for hypergraphs
Lecture Notes in Computer Science | 2014-01-14 | Paper |
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science | 2014-01-13 | Paper |
Backdoors to acyclic SAT
Automata, Languages, and Programming | 2013-08-12 | Paper |
Strong backdoors to nested satisfiability
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Exact exponential-time algorithms for finding bicliques
Information Processing Letters | 2013-04-04 | Paper |
Feedback vertex sets in tournaments
Journal of Graph Theory | 2013-03-07 | Paper |
Feedback vertex sets in tournaments
Journal of Graph Theory | 2013-03-07 | Paper |
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
Algorithmica | 2013-03-05 | Paper |
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Parameterizing by the number of numbers
Theory of Computing Systems | 2012-12-06 | Paper |
| Kernels for feedback arc set in tournaments | 2012-10-24 | Paper |
Backdoors to satisfaction
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
k-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences | 2012-05-11 | Paper |
| Strong Backdoors to Bounded Treewidth SAT | 2012-04-27 | Paper |
On independent sets and bicliques in graphs
Algorithmica | 2012-04-26 | Paper |
| From edge-disjoint paths to independent paths | 2012-03-20 | Paper |
Parameterized algorithm for eternal vertex cover
Information Processing Letters | 2012-03-19 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Complexity of splits reconstruction for low-degree trees
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Parameterizing by the number of numbers
Lecture Notes in Computer Science | 2010-12-07 | Paper |
Feedback vertex sets in tournaments
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Clean the graph before you draw it!
Information Processing Letters | 2010-08-16 | Paper |
Parallel cleaning of a network with brushes
Discrete Applied Mathematics | 2010-05-05 | Paper |
Iterative compression and exact algorithms
Theoretical Computer Science | 2010-03-09 | Paper |
Exact and parameterized algorithms for Max Internal Spanning Tree
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
An exponential time 2-approximation algorithm for bandwidth
Parameterized and Exact Computation | 2010-01-14 | Paper |
A linear vertex kernel for Maximum Internal Spanning Tree
Algorithms and Computation | 2009-12-17 | Paper |
On two techniques of combining branching and treewidth
Algorithmica | 2009-06-22 | Paper |
Improved Exact Algorithms for Counting 3- and 4-Colorings
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Iterative Compression and Exact Algorithms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Algorithmica | 2008-12-02 | Paper |
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
Parameterized and Exact Computation | 2008-06-03 | Paper |
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Branching and Treewidth Based Exact Algorithms
Algorithms and Computation | 2008-04-24 | Paper |
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
