| 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/Q5093402 | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091007 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091175 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090377 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140739 | 2020-12-16 | Paper |
| Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time | 2020-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111423 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111865 | 2020-05-27 | Paper |
| An adaptive prefix-assignment technique for symmetry reduction | 2020-01-15 | Paper |
| Algebraic methods in the congested clique | 2019-11-27 | Paper |
| Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication | 2019-10-15 | Paper |
| Engineering Motif Search for Large Graphs | 2019-09-12 | Paper |
| Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs | 2019-09-12 | Paper |
| Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs | 2019-09-11 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5743488 | 2019-05-10 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2019-02-06 | Paper |
| On the number of connected sets in bounded degree graphs | 2018-11-22 | Paper |
| A Faster Subquadratic Algorithm for Finding Outlier Correlations | 2018-11-13 | 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 |
| A Faster Subquadratic Algorithm for Finding Outlier Correlations | 2018-07-16 | Paper |
| Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs | 2018-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606323 | 2018-03-02 | Paper |
| Dense Subset Sum may be the hardest | 2018-01-24 | Paper |
| An adaptive prefix-assignment technique for symmetry reduction | 2017-11-15 | Paper |
| How Proofs are Prepared at Camelot | 2017-09-29 | Paper |
| Narrow sieves for parameterized paths and packings | 2017-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957868 | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954983 | 2017-01-24 | Paper |
| Fast Möbius inversion in semimodular lattices and ER-labelable posets | 2016-09-13 | Paper |
| Separating OR, SUM, and XOR circuits | 2016-04-18 | Paper |
| Constrained multilinear detection and generalized graph motifs | 2016-03-29 | Paper |
| Algebraic methods in the congested clique | 2016-03-23 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2015-10-27 | Paper |
| On the Number of Connected Sets in Bounded Degree Graphs | 2015-09-09 | Paper |
| Enumeration of Steiner triple systems with subsystems | 2015-08-13 | Paper |
| Fast Witness Extraction Using a Decision Oracle | 2014-10-08 | Paper |
| The traveling salesman problem in bounded degree graphs | 2014-09-09 | Paper |
| Switching in one-factorisations of complete graphs | 2014-09-04 | Paper |
| Fast monotone summation over disjoint sets | 2014-04-15 | Paper |
| Finding Efficient Circuits for Ensemble Computation | 2013-08-12 | Paper |
| Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm | 2013-08-06 | Paper |
| Covering and packing in linear space | 2013-04-04 | Paper |
| Counting closed trails | 2013-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910710 | 2013-03-19 | Paper |
| Homomorphic Hashing for Sparse Coefficient Extraction | 2013-01-07 | Paper |
| Fast Monotone Summation over Disjoint Sets | 2013-01-07 | Paper |
| Local approximability of max-min and min-max linear programs | 2012-12-10 | Paper |
| Evaluation of permanents in rings and semirings | 2012-03-27 | Paper |
| Steiner triple systems satisfying the 4-vertex condition | 2012-03-01 | Paper |
| The cycle switching graph of the Steiner triple systems of order 19 is connected | 2012-01-24 | Paper |
| Conflict Propagation and Component Recursion for Canonical Labeling | 2011-05-12 | Paper |
| Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 | 2011-05-10 | Paper |
| The number of Latin squares of order 11 | 2011-04-19 | Paper |
| Almost stable matchings by truncating the Gale-Shapley algorithm | 2010-10-07 | Paper |
| Trimmed Moebius inversion and graphs of bounded degree | 2010-10-06 | Paper |
| Covering and Packing in Linear Space | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3582521 | 2010-09-02 | Paper |
| Properties of the Steiner triple systems of order 19 | 2010-08-12 | Paper |
| Counting Paths and Packings in Halves | 2009-10-29 | Paper |
| Packing Steiner trees with identical terminal sets | 2009-07-21 | Paper |
| There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14 | 2009-04-08 | Paper |
| Classification of resolvable balanced incomplete block designs — the unitals on 28 points | 2009-03-31 | Paper |
| Fourier meets M\"{o}bius: fast subset convolution | 2009-01-05 | Paper |
| An enumeration of graphical designs | 2008-11-19 | Paper |
| The Travelling Salesman Problem in Bounded Degree Graphs | 2008-08-28 | Paper |
| Steiner triple systems of order 19 and 21 with subsystems of order 7 | 2008-05-29 | Paper |
| There are exactly five biplanes with k = 11 | 2008-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442390 | 2008-02-22 | Paper |
| There are exactly five biplanes with | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429155 | 2007-03-30 | Paper |
| The Steiner quadruple systems of order 16 | 2006-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488382 | 2006-09-14 | Paper |
| Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms | 2006-06-01 | Paper |
| On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs. | 2006-05-18 | Paper |
| Classification algorithms for codes and designs | 2006-04-03 | Paper |
| Exact and approximate balanced data gathering in energy-constrained sensor networks | 2005-12-05 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments | 2005-08-17 | Paper |
| One-factorizations of regular graphs of order 12 | 2005-04-25 | Paper |
| There exist non‐isomorphic STS(19) with equivalent point codes | 2005-02-23 | Paper |
| The Steiner triple systems of order 19 | 2004-08-13 | Paper |
| Miscellaneous classification results for 2-designs | 2004-08-06 | Paper |
| Enumeration of balanced ternary designs. | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457544 | 2004-03-25 | Paper |
| Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions | 2002-09-17 | Paper |
| There exists no (15,5,4) RBIBD | 2002-04-17 | Paper |
| There exists no (15,5,4) RBIBD†* | 2002-02-27 | Paper |
