| Publication | Date of Publication | Type |
|---|
| Faster graph coloring in polynomial space | 2023-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875627 | 2023-02-03 | Paper |
| Extremal vertex-sets | 2022-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092437 | 2022-07-21 | Paper |
| Stable matching with uncertain pairwise preferences | 2022-03-01 | Paper |
| On the complexity of the smallest grammar problem over fixed alphabets | 2021-06-24 | Paper |
| Backdoor Sets for CSP. | 2021-06-15 | Paper |
| Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements | 2020-11-25 | Paper |
| Colouring square-free graphs without long induced paths. | 2020-08-05 | Paper |
| The Parameterized Complexity of Positional Games | 2020-05-27 | Paper |
| Exact Algorithms via Multivariate Subroutines | 2020-05-27 | Paper |
| Stable matching with uncertain linear preferences | 2020-04-01 | Paper |
| When is red-blue nonblocker fixed-parameter tractable? | 2020-02-12 | Paper |
| Linearly χ‐bounding (P6, C4)‐free graphs* | 2019-12-30 | Paper |
| Exact Algorithms via Monotone Local Search | 2019-11-21 | Paper |
| Colouring square-free graphs without long induced paths | 2019-08-30 | Paper |
| $(2P_2,K_4)$-Free Graphs are 4-Colorable | 2019-08-29 | Paper |
| Enumeration of Preferred Extensions in Almost Oriented Digraphs | 2019-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633872 | 2019-05-06 | Paper |
| Turbocharging treewidth heuristics | 2019-02-14 | Paper |
| Fixing balanced knockout and double elimination tournaments | 2019-01-18 | Paper |
| Separate, Measure and Conquer | 2018-11-12 | Paper |
| A note on the eternal dominating set problem | 2018-10-04 | Paper |
| On the number of minimal separators in graphs | 2018-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634396 | 2018-04-10 | Paper |
| On Satisfiability Problems with a Linear Structure | 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 | 2017-10-23 | Paper |
| Exact Algorithms via Monotone Local Search | 2017-09-29 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| Backdoors into heterogeneous classes of SAT and CSP | 2016-12-28 | Paper |
| On the Number of Minimal Separators in Graphs | 2016-10-21 | Paper |
| Stable Matching with Uncertain Linear Preferences | 2016-09-29 | Paper |
| Faster Algorithms to Enumerate Hypergraph Transversals | 2016-05-03 | Paper |
| Backdoors to q-Horn | 2016-03-23 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2016-02-19 | Paper |
| Fair assignment of indivisible objects under ordinal preferences | 2015-12-21 | Paper |
| Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets | 2015-10-27 | Paper |
| On finding optimal polytrees | 2015-10-08 | Paper |
| Augmenting graphs to minimize the diameter | 2015-09-02 | Paper |
| Complexity of splits reconstruction for low-degree trees | 2014-11-28 | Paper |
| Exponential time algorithms for the minimum dominating set problem on some graph classes | 2014-11-18 | Paper |
| Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes | 2014-11-18 | Paper |
| Guarantees and limits of preprocessing in constraint satisfaction and reasoning | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403013 | 2014-03-25 | Paper |
| Multivariate Complexity Theory | 2014-02-21 | Paper |
| Augmenting graphs to minimize the diameter | 2014-01-14 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2014-01-14 | Paper |
| An exponential time 2-approximation algorithm for bandwidth | 2014-01-13 | Paper |
| Backdoors to Acyclic SAT | 2013-08-12 | Paper |
| Strong Backdoors to Nested Satisfiability | 2013-08-12 | Paper |
| Exact exponential-time algorithms for finding bicliques | 2013-04-04 | Paper |
| Feedback Vertex Sets in Tournaments | 2013-03-07 | Paper |
| Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} | 2013-03-05 | Paper |
| A linear vertex kernel for maximum internal spanning tree | 2013-02-21 | Paper |
| Parameterizing by the number of numbers | 2012-12-06 | Paper |
| Kernels for feedback arc set in tournaments | 2012-10-24 | Paper |
| Backdoors to Satisfaction | 2012-09-05 | Paper |
| k-Gap Interval Graphs | 2012-06-29 | Paper |
| A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between | 2012-05-11 | Paper |
| Strong Backdoors to Bounded Treewidth SAT | 2012-04-27 | Paper |
| On independent sets and bicliques in graphs | 2012-04-26 | Paper |
| From edge-disjoint paths to independent paths | 2012-03-20 | Paper |
| Parameterized algorithm for eternal vertex cover | 2012-03-19 | Paper |
| Kernels for feedback arc set in tournaments | 2012-01-11 | Paper |
| Complexity of Splits Reconstruction for Low-Degree Trees | 2011-12-16 | Paper |
| Parameterizing by the number of numbers | 2010-12-07 | Paper |
| Feedback Vertex Sets in Tournaments | 2010-09-06 | Paper |
| Clean the graph before you draw it! | 2010-08-16 | Paper |
| Parallel cleaning of a network with brushes | 2010-05-05 | Paper |
| Iterative compression and exact algorithms | 2010-03-09 | Paper |
| Exact and Parameterized Algorithms for Max Internal Spanning Tree | 2010-01-21 | Paper |
| An Exponential Time 2-Approximation Algorithm for Bandwidth | 2010-01-14 | Paper |
| A Linear Vertex Kernel for Maximum Internal Spanning Tree | 2009-12-17 | Paper |
| On two techniques of combining branching and treewidth | 2009-06-22 | Paper |
| Improved Exact Algorithms for Counting 3- and 4-Colorings | 2009-03-06 | Paper |
| Iterative Compression and Exact Algorithms | 2009-02-03 | Paper |
| On Independent Sets and Bicliques in Graphs | 2009-01-20 | Paper |
| On the minimum feedback vertex set problem: Exact and enumeration algorithms | 2008-12-02 | Paper |
| A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs | 2008-09-04 | Paper |
| Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ | 2008-06-03 | Paper |
| A Moderately Exponential Time Algorithm for Full Degree Spanning Tree | 2008-05-27 | Paper |
| Branching and Treewidth Based Exact Algorithms | 2008-04-24 | Paper |
| Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes | 2007-09-07 | Paper |
