| Publication | Date of Publication | Type |
|---|
| On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems | 2026-03-18 | Paper |
Flow-augmentation. I: Directed graphs
Journal of the ACM | 2026-02-24 | Paper |
Almost consistent systems of linear equations
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| Parameterized complexity of equality MinCSP | 2025-01-06 | Paper |
| Determinantal sieving | 2024-11-28 | Paper |
| Representative set statements for delta-matroids and the Mader delta-matroid | 2024-11-28 | Paper |
| Almost consistent systems of linear equations | 2024-05-14 | Paper |
| Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | 2024-05-14 | Paper |
Component order connectivity in directed graphs
(available as arXiv preprint) | 2023-11-13 | Paper |
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
(available as arXiv preprint) | 2023-09-20 | Paper |
| Representative set statements for delta-matroids and the Mader delta-matroid | 2023-06-06 | Paper |
Preference swaps for the stable matching problem
Theoretical Computer Science | 2023-04-20 | Paper |
| scientific article; zbMATH DE number 7650904 (Why is no real title available?) | 2023-02-07 | Paper |
| Many Visits TSP Revisited | 2023-02-07 | Paper |
\(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
Journal of Computer and System Sciences | 2023-01-06 | Paper |
Sparsification of SAT and CSP Problems via Tractable Extensions
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Component order connectivity in directed graphs
Algorithmica | 2022-08-18 | Paper |
Randomized Contractions Meet Lean Decompositions
ACM Transactions on Algorithms | 2022-02-08 | Paper |
r -Simple k -Path and Related Problems Parameterized by k / r
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Preference Swaps for the Stable Matching Problem
(available as arXiv preprint) | 2021-12-31 | Paper |
Many-visits TSP revisited
Journal of Computer and System Sciences | 2021-11-25 | Paper |
| Multi-budgeted directed cuts | 2021-08-04 | Paper |
Parameterized algorithms for zero extension and metric labelling problems
(available as arXiv preprint) | 2021-07-28 | Paper |
Parameterized pre-coloring extension and list coloring problems
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Representative sets and irrelevant vertices: new tools for kernelization
Journal of the ACM | 2020-11-11 | Paper |
Multi-budgeted directed cuts
Algorithmica | 2020-08-12 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2020-05-27 | Paper |
Alternative parameterizations of \textsc{Metric Dimension}
Theoretical Computer Science | 2020-01-16 | Paper |
Directed multicut is W[1-hard, even for four terminal pairs]
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Dependent Randomized Rounding: The Bipartite Case
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Randomized Rounding in the Presence of a Cardinality Constraint
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Half-integrality, LP-branching and FPT algorithms
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Compression via matroids: a randomized polynomial kernel for odd cycle transversal | 2019-05-10 | Paper |
Euler digraphs
Springer Monographs in Mathematics | 2019-03-04 | Paper |
Path-contractions, edge deletions and connectivity preservation
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Path-contractions, edge deletions and connectivity preservation
Journal of Computer and System Sciences | 2019-01-25 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Compression via Matroids
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Two edge modification problems without polynomial kernels
Discrete Optimization | 2018-08-17 | Paper |
LP-branching algorithms based on biased graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Directed multicut is W[1-hard, even for four terminal pairs]
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Journal of Computer and System Sciences | 2018-05-08 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
Journal of Computer and System Sciences | 2018-05-08 | Paper |
The power of primitive positive definitions with polynomially many variables
Journal Of Logic And Computation | 2018-02-13 | Paper |
Odd properly colored cycles in edge-colored graphs
Discrete Mathematics | 2017-02-06 | Paper |
Abusing the Tutte matrix: an algebraic instance compression for the \(K\)-set-cycle problem
(available as arXiv preprint) | 2017-01-30 | Paper |
| Subexponential parameterized odd cycle transversal on planar graphs | 2017-01-26 | Paper |
The mixed Chinese postman problem parameterized by pathwidth and treedepth
SIAM Journal on Discrete Mathematics | 2016-11-30 | Paper |
Randomized rounding in the presence of a cardinality constraint
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Parameterized complexity and kernelizability of max ones and exact ones problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Rural postman parameterized by the number of components of required edges
Journal of Computer and System Sciences | 2016-09-16 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Algorithmica | 2016-09-07 | Paper |
Half-integrality, LP-branching, and FPT algorithms
SIAM Journal on Computing | 2016-08-26 | Paper |
Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis
Information Processing Letters | 2016-01-05 | Paper |
Fixed-parameter tractability of multicut in directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Parameterized and Exact Computation | 2015-09-15 | Paper |
Clique Cover and Graph Separation
ACM Transactions on Computation Theory | 2015-09-03 | Paper |
Calculation of discrepancy measures and applications
A Panorama of Discrepancy Theory | 2015-07-24 | Paper |
A completeness theory for polynomial (Turing) kernelization
Algorithmica | 2015-05-04 | Paper |
A completeness theory for polynomial (Turing) kernelization
Parameterized and Exact Computation | 2013-12-10 | Paper |
Clique cover and graph separation: new incompressibility results
Automata, Languages, and Programming | 2013-08-12 | Paper |
Fixed-parameter tractability of multicut in directed acyclic graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Parameterized two-player Nash equilibrium
Algorithmica | 2013-05-16 | Paper |
A new randomized algorithm to approximate the star discrepancy based on threshold accepting
SIAM Journal on Numerical Analysis | 2012-08-23 | Paper |
Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
Journal of Complexity | 2012-05-07 | Paper |
Parameterized two-player Nash equilibrium
Lecture Notes in Computer Science | 2011-12-16 | Paper |
New plain-exponential time classes for graph homomorphism
Theory of Computing Systems | 2011-10-11 | Paper |
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Journal of Complexity | 2010-10-11 | Paper |
Preprocessing of min ones problems: a dichotomy
Automata, Languages and Programming | 2010-09-07 | Paper |
Parameterized complexity and kernelizability of Max Ones and Exact Ones problems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Randomized rounding for routing and covering problems: experiments and improvements
Experimental Algorithms | 2010-05-04 | Paper |
Implementation of a component-by-component algorithm to generate small low-discrepancy samples
Monte Carlo and Quasi-Monte Carlo Methods 2008 | 2010-02-15 | Paper |
Two edge modification problems without polynomial kernels
Parameterized and Exact Computation | 2010-01-14 | Paper |
A faster fixed-parameter approach to drawing binary tanglegrams
Parameterized and Exact Computation | 2010-01-14 | Paper |
New Plain-Exponential Time Classes for Graph Homomorphism
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
Lecture Notes in Computer Science | 2009-07-07 | Paper |
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
Parameterized and Exact Computation | 2008-06-05 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2090009 (Why is no real title available?) | 2004-08-12 | Paper |
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms | 2004-08-06 | Paper |
