| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6068236 | 2023-11-13 | Paper |
| Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075944 | 2023-09-20 | Paper |
| Preference swaps for the stable matching problem | 2023-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874290 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874538 | 2023-02-07 | Paper |
| \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms | 2023-01-06 | Paper |
| Sparsification of SAT and CSP Problems via Tractable Extensions | 2022-12-05 | Paper |
| The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems | 2022-09-24 | Paper |
| Component order connectivity in directed graphs | 2022-08-18 | Paper |
| Randomized Contractions Meet Lean Decompositions | 2022-02-08 | Paper |
| r -Simple k -Path and Related Problems Parameterized by k / r | 2022-02-08 | Paper |
| Many-visits TSP revisited | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009480 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002776 | 2021-07-28 | Paper |
| Parameterized Pre-Coloring Extension and List Coloring Problems | 2021-03-30 | Paper |
| Representative Sets and Irrelevant Vertices | 2020-11-11 | Paper |
| Multi-budgeted directed cuts | 2020-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111389 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111736 | 2020-05-27 | Paper |
| Alternative parameterizations of \textsc{Metric Dimension} | 2020-01-16 | Paper |
| Directed multicut is W[1-hard, even for four terminal pairs] | 2019-12-06 | Paper |
| On r-Simple k-Path and Related Problems Parameterized by k/r | 2019-10-15 | Paper |
| Dependent Randomized Rounding: The Bipartite Case | 2019-09-12 | Paper |
| Randomized Rounding in the Presence of a Cardinality Constraint | 2019-09-11 | Paper |
| Half-integrality, LP-branching and FPT Algorithms | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743380 | 2019-05-10 | Paper |
| Euler Digraphs | 2019-03-04 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2019-01-25 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Compression via Matroids | 2018-10-30 | Paper |
| Two edge modification problems without polynomial kernels | 2018-08-17 | Paper |
| Directed multicut is W[1-hard, even for four terminal pairs] | 2018-07-16 | Paper |
| LP-branching algorithms based on biased graphs | 2018-07-16 | Paper |
| Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials | 2018-05-08 | Paper |
| \(k\)-distinct in- and out-branchings in digraphs | 2018-05-08 | Paper |
| The power of primitive positive definitions with polynomially many variables | 2018-02-13 | Paper |
| Odd properly colored cycles in edge-colored graphs | 2017-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957896 | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957518 | 2017-01-26 | Paper |
| Randomized Rounding in the Presence of a Cardinality Constraint | 2016-10-24 | Paper |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | 2016-10-24 | Paper |
| Rural postman parameterized by the number of components of required edges | 2016-09-16 | Paper |
| Polynomial kernels and user reductions for the workflow satisfiability problem | 2016-09-07 | Paper |
| Half-integrality, LP-branching, and FPT Algorithms | 2016-08-26 | Paper |
| Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis | 2016-01-05 | Paper |
| Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs | 2015-11-27 | Paper |
| Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem | 2015-09-15 | Paper |
| Clique Cover and Graph Separation | 2015-09-03 | Paper |
| Calculation of Discrepancy Measures and Applications | 2015-07-24 | Paper |
| A completeness theory for polynomial (Turing) kernelization | 2015-05-04 | Paper |
| A Completeness Theory for Polynomial (Turing) Kernelization | 2013-12-10 | Paper |
| Clique Cover and Graph Separation: New Incompressibility Results | 2013-08-12 | Paper |
| Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs | 2013-08-12 | Paper |
| Parameterized two-player Nash equilibrium | 2013-05-16 | Paper |
| A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting | 2012-08-23 | Paper |
| Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension | 2012-05-07 | Paper |
| Parameterized two-player Nash equilibrium | 2011-12-16 | Paper |
| New plain-exponential time classes for graph homomorphism | 2011-10-11 | Paper |
| Algorithmic construction of low-discrepancy point sets via dependent randomized rounding | 2010-10-11 | Paper |
| Preprocessing of Min Ones Problems: A Dichotomy | 2010-09-07 | Paper |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | 2010-09-03 | Paper |
| Randomized Rounding for Routing and Covering Problems: Experiments and Improvements | 2010-05-04 | Paper |
| Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples | 2010-02-15 | Paper |
| A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams | 2010-01-14 | Paper |
| Two Edge Modification Problems without Polynomial Kernels | 2010-01-14 | Paper |
| New Plain-Exponential Time Classes for Graph Homomorphism | 2009-08-18 | Paper |
| Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences | 2009-07-07 | Paper |
| A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances | 2008-06-05 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Counting models for 2SAT and 3SAT formulae | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808676 | 2004-08-12 | Paper |
| Exact algorithms for finding minimum transversals in rank-3 hypergraphs | 2004-08-06 | Paper |
