| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147394 | 2024-01-15 | Paper |
| The shortest even cycle problem is tractable | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091175 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091009 | 2022-07-21 | Paper |
| Exploiting sparsity for bipartite Hamiltonicity | 2022-07-21 | Paper |
| Counting connected subgraphs with maximum-degree-aware sieving | 2022-07-21 | Paper |
| Approximate Counting of k-Paths: Deterministic and in Polynomial Space | 2022-07-21 | Paper |
| Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors | 2022-07-21 | Paper |
| Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space | 2022-02-16 | Paper |
| Counting Short Vector Pairs by Inner Product and Relations to the Permanent | 2020-07-28 | Paper |
| Directed Hamiltonicity and out-branchings via generalized Laplacians | 2020-05-27 | Paper |
| Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants | 2020-05-27 | Paper |
| Shortest two disjoint paths in polynomial time | 2019-11-21 | Paper |
| Engineering Motif Search for Large Graphs | 2019-09-12 | Paper |
| Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants | 2019-09-10 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time | 2019-06-20 | Paper |
| Counting perfect matchings as fast as Ryser | 2019-05-10 | Paper |
| Fast zeta transforms for lattices with few irreducibles | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743515 | 2019-05-10 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time | 2018-11-12 | Paper |
| Fast Zeta Transforms for Lattices with Few Irreducibles | 2018-10-30 | Paper |
| Below all subsets for some permutational counting problems | 2017-10-17 | Paper |
| Coloring graphs having few colorings over path decompositions | 2017-10-17 | Paper |
| How proofs are prepared at Camelot (extended abstract) | 2017-09-29 | Paper |
| Computing the permanent modulo a prime power | 2017-06-13 | Paper |
| Narrow sieves for parameterized paths and packings | 2017-05-24 | Paper |
| Spotting trees with few leaves | 2017-05-24 | Paper |
| Probably optimal graph motifs | 2017-01-30 | Paper |
| Constrained multilinear detection and generalized graph motifs | 2016-03-29 | Paper |
| Spotting trees with few leaves | 2015-10-27 | Paper |
| The parity of set systems under random restrictions with applications to exponential time problems | 2015-10-27 | Paper |
| Fast witness extraction using a decision oracle | 2014-10-08 | Paper |
| The traveling salesman problem in bounded degree graphs | 2014-09-09 | Paper |
| Listing triangles | 2014-07-01 | Paper |
| Shortest two disjoint paths in polynomial time | 2014-07-01 | Paper |
| Determinant sums for undirected Hamiltonicity | 2014-06-04 | Paper |
| Covering and packing in linear space | 2013-04-04 | Paper |
| Counting closed trails | 2013-03-21 | Paper |
| Trimmed Moebius inversion and graphs of bounded degree | 2013-03-19 | Paper |
| Evaluation of permanents in rings and semirings | 2012-03-27 | Paper |
| Exact covers via determinants | 2012-01-23 | Paper |
| Trimmed Moebius inversion and graphs of bounded degree | 2010-10-06 | 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 |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737225 | 2004-08-11 | Paper |
| Finding a Path of Superlogarithmic Length | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778560 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722009 | 2001-07-11 | Paper |
