| Publication | Date of Publication | Type |
|---|
| The shortest even cycle problem is tractable | 2023-12-08 | Paper |
| Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths | 2023-09-20 | Paper |
| Fully Dynamic Transitive Closure in plane dags with one source and one sink | 2023-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874426 | 2023-02-07 | Paper |
| Dynamic algorithms for the Dyck languages | 2022-12-16 | Paper |
| Lower bounds for dynamic transitive closure, planar point location, and parentheses matching | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091009 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091007 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009466 | 2021-08-04 | Paper |
| Multivariate analysis of orthogonal range searching and graph distances | 2020-08-12 | Paper |
| Shortest Two Disjoint Paths in Polynomial Time | 2019-11-21 | Paper |
| Extensor-coding | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743488 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743515 | 2019-05-10 | Paper |
| Fast Zeta Transforms for Lattices with Few Irreducibles | 2018-10-30 | Paper |
| Exponential Time Complexity of the Permanent and the Tutte Polynomial | 2018-10-30 | Paper |
| Computing Graph Distances Parameterized by Treewidth and Diameter | 2018-04-10 | Paper |
| Computing the permanent modulo a prime power | 2017-06-13 | Paper |
| Narrow sieves for parameterized paths and packings | 2017-05-24 | Paper |
| Graph colouring algorithms | 2016-09-30 | Paper |
| The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems | 2015-10-27 | Paper |
| Black box for constant-time insertion in priority queues (note) | 2015-09-02 | Paper |
| The traveling salesman problem in bounded degree graphs | 2014-09-09 | Paper |
| Shortest Two Disjoint Paths in Polynomial Time | 2014-07-01 | Paper |
| Covering and packing in linear space | 2013-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910710 | 2013-03-19 | Paper |
| Evaluation of permanents in rings and semirings | 2012-03-27 | Paper |
| Invitation to Algorithmic Uses of Inclusion–Exclusion | 2011-07-07 | Paper |
| The Exponential Time Complexity of Computing the Probability That a Graph Is Connected | 2010-12-07 | Paper |
| Trimmed Moebius inversion and graphs of bounded degree | 2010-10-06 | Paper |
| Exponential Time Complexity of the Permanent and the Tutte Polynomial | 2010-09-07 | Paper |
| Covering and Packing in Linear Space | 2010-09-07 | Paper |
| Set Partitioning via Inclusion-Exclusion | 2010-04-29 | Paper |
| Counting Paths and Packings in Halves | 2009-10-29 | Paper |
| Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings | 2009-03-12 | Paper |
| Fourier meets M\"{o}bius: fast subset convolution | 2009-01-05 | Paper |
| Exact algorithms for exact satisfiability and number of perfect matchings | 2008-12-02 | Paper |
| The Travelling Salesman Problem in Bounded Degree Graphs | 2008-08-28 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Dynamic nested brackets | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737225 | 2004-08-11 | Paper |
| Finding a Path of Superlogarithmic Length | 2003-09-28 | Paper |
| New Lower Bound Techniques for Dynamic Partial Sums and Related Problems | 2003-06-19 | Paper |
| Lower bounds for approximate polygon decomposition and minimum gap | 2002-07-14 | Paper |
| A cell probe lower bound for dynamic nearest-neighbour searching | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490353 | 2000-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129920 | 1997-05-28 | Paper |
