| Publication | Date of Publication | Type |
|---|
| New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes | 2024-03-19 | Paper |
| On the connectivity and diameter of geodetic graphs | 2024-02-05 | Paper |
| The Structure of Metrizable Graphs | 2023-11-15 | Paper |
| A randomized construction of high girth regular graphs | 2023-10-11 | Paper |
| Irreducible nonmetrizable path systems in graphs | 2023-10-05 | Paper |
| An improved protocol for the exactly-N problem* | 2023-07-12 | Paper |
| How Balanced Can Permutations Be? | 2023-06-29 | Paper |
| On the L\"owner-John Ellipsoids of the Metric Polytope | 2023-04-19 | Paper |
| In search of hyperpaths | 2023-03-15 | Paper |
| On the local structure of oriented graphs -- a case study in flag algebras | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090432 | 2022-07-18 | Paper |
| On the densities of cliques and independent sets in graphs | 2022-06-29 | Paper |
| An approach to the girth problem in cubic graphs | 2022-06-29 | Paper |
| Geodesic geometry on graphs | 2022-06-03 | Paper |
| Bounds on Unique-Neighbor Codes | 2022-03-19 | Paper |
| Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols | 2022-02-10 | Paper |
| Efficient, local and symmetric Markov chains that generate one-factorizations | 2020-12-18 | Paper |
| Hyperpaths | 2020-11-19 | Paper |
| On the weight distribution of random binary linear codes | 2020-06-19 | Paper |
| Asymptotically almost every \(2r\)-regular graph has an internal partition | 2020-03-03 | Paper |
| Enumeration and randomized constructions of hypertrees | 2019-11-28 | Paper |
| A King in every two consecutive tournaments | 2019-10-21 | Paper |
| Universal knot diagrams | 2019-07-04 | Paper |
| Extremal hypercuts and shadows of simplicial complexes | 2019-02-07 | Paper |
| The distribution of knots in the Petaluma model | 2018-12-06 | Paper |
| The one-round Voronoi game | 2018-11-23 | Paper |
| Random Simplicial Complexes: Around the Phase Transition | 2018-02-26 | Paper |
| Monotone Subsequences in High-Dimensional Permutations | 2018-01-19 | Paper |
| On the Rigidity of Sparse Random Graphs | 2017-07-05 | Paper |
| Efficient Generation of One-Factorizations through Hill Climbing | 2017-07-03 | Paper |
| On The Communication Complexity of High-Dimensional Permutations | 2017-06-07 | Paper |
| On the practically interesting instances of MAXCUT | 2017-01-30 | Paper |
| On the Number of 4-Cycles in a Tournament | 2016-11-16 | Paper |
| On the phase transition in random simplicial complexes | 2016-11-04 | Paper |
| Internal Partitions of Regular Graphs | 2016-10-13 | Paper |
| Discrepancy of high-dimensional permutations | 2016-10-10 | Paper |
| No justified complaints | 2016-10-07 | Paper |
| Invariants of random knots and links | 2016-09-14 | Paper |
| The threshold for d-collapsibility in random complexes* | 2016-03-22 | Paper |
| On the Local Profiles of Trees | 2016-02-01 | Paper |
| A note on the inducibility of 4-vertex graphs | 2015-09-24 | Paper |
| From average case complexity to improper learning complexity | 2015-06-26 | Paper |
| Efficient construction of a small hitting set for combinatorial rectangles in high dimension | 2015-05-07 | Paper |
| Fast perfection-information leader-election protocol with linear immunity | 2015-05-07 | Paper |
| Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal | 2015-03-24 | Paper |
| Triply Existentially Complete Triangle‐Free Graphs | 2015-03-24 | Paper |
| When does the top homology of a random simplicial complex vanish? | 2015-02-20 | Paper |
| An upper bound on the number of high-dimensional permutations | 2015-01-08 | Paper |
| Musical Chairs | 2014-12-22 | Paper |
| On regular hypergraphs of high girth | 2014-09-04 | Paper |
| On the 3‐Local Profiles of Graphs | 2014-08-07 | Paper |
| Extremal problems on shadows and hypercuts in simplicial complexes | 2014-08-04 | Paper |
| Chernoff's Inequality - A very elementary proof | 2014-03-30 | Paper |
| On the vertices of the \(d\)-dimensional Birkhoff polytope | 2014-03-25 | Paper |
| On high-dimensional acyclic tournaments | 2014-01-24 | Paper |
| An upper bound on the number of Steiner triple systems | 2013-12-23 | Paper |
| Collapsibility and vanishing of top homology in random simplicial complexes | 2013-03-20 | Paper |
| Are Stable Instances Easy? | 2012-09-12 | Paper |
| Tight products and graph expansion | 2012-06-13 | Paper |
| Strong convergence in posets | 2012-06-04 | Paper |
| On the Lipschitz constant of the RSK correspondence | 2011-11-11 | Paper |
| Oblivious Collaboration | 2011-10-28 | Paper |
| Eigenvectors of random graphs: Nodal Domains | 2011-08-09 | Paper |
| The expected genus of a random chord diagram | 2011-03-10 | Paper |
| Word maps and spectra of random graph lifts | 2010-11-24 | Paper |
| On metric Ramsey-type phenomena | 2010-08-16 | Paper |
| Girth and euclidean distortion | 2010-08-05 | Paper |
| Learning Complexity vs Communication Complexity | 2010-04-23 | Paper |
| Lower bounds in communication complexity based on factorization norms | 2009-06-16 | Paper |
| Eigenvectors of Random Graphs: Nodal Domains | 2009-02-17 | Paper |
| Lower bounds in communication complexity based on factorization norms | 2009-01-05 | Paper |
| Complexity measures of sign matrices | 2008-10-21 | Paper |
| Graph coloring with no large monochromatic components | 2008-09-29 | Paper |
| Expander graphs and their applications | 2008-07-21 | Paper |
| Graph coloring with no large monochromatic components | 2008-06-05 | Paper |
| Limitations to Fréchet's metric embedding method | 2007-10-09 | Paper |
| Lifts, discrepancy and nearly optimal spectral gap | 2007-05-08 | Paper |
| Minors in lifts of graphs | 2007-02-07 | Paper |
| Homological connectivity of random 2-complexes | 2007-01-08 | Paper |
| How neighborly can a centrally symmetric polytope be? | 2006-10-04 | Paper |
| On metric Ramsey-type phenomena | 2006-07-26 | Paper |
| Random Lifts of Graphs: Edge Expansion | 2006-07-06 | Paper |
| Random lifts of graphs: perfect matchings | 2006-06-27 | Paper |
| On the expansion rate of Margulis expanders. | 2006-05-18 | Paper |
| The non-crossing graph | 2006-01-31 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Monotone maps, sphericity and bounded second eigenvalue | 2005-11-22 | Paper |
| A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex | 2005-11-22 | Paper |
| ON METRIC RAMSEY-TYPE DICHOTOMIES | 2005-05-23 | Paper |
| Essential covers of the cube by hyperplanes | 2005-04-06 | Paper |
| Some low distortion metric Ramsey problems | 2005-02-23 | Paper |
| Ramanujan Signing of Regular Graphs | 2005-02-18 | Paper |
| Metric embeddings -- beyond one-dimensional distortion | 2004-12-16 | Paper |
| Colorings of the \(d\)-regular infinite tree | 2004-08-06 | Paper |
| The one-round Voronoi game | 2004-03-11 | Paper |
| Low dimensional embeddings of ultrametrics. | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542534 | 2004-02-08 | Paper |
| Linear codes and character sums | 2003-10-14 | Paper |
| An extremal problem on degree sequences of graphs | 2003-03-25 | Paper |
| The Euclidean distortion of complete binary trees | 2003-03-17 | Paper |
| Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders | 2002-12-10 | Paper |
| A continuous analogue of the girth problem | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549227 | 2002-11-10 | Paper |
| Random graph coverings. I: General theory and graph connectivity | 2002-10-20 | Paper |
| Random lifts of graphs: Independence and chromatic number | 2002-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542587 | 2002-09-17 | Paper |
| Girth and Euclidean distortion | 2002-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768394 | 2002-06-03 | Paper |
| The Moore bound for irregular graphs | 2002-05-14 | Paper |
| Neighborhood Preserving Hashing and Approximate Queries | 2002-04-23 | Paper |
| A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents | 2001-06-13 | Paper |
| On the hardness of approximating the chromatic number | 2001-06-12 | Paper |
| Low distortion Euclidean embeddings of trees | 2000-06-05 | Paper |
| Competitive optimal on-line leasing | 2000-01-04 | Paper |
| The linear-array conjecture in communication complexity is false | 1999-12-08 | Paper |
| Non-expansive hashing | 1999-10-31 | Paper |
| A note on the influence of an \(\epsilon\)-biased random source | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228448 | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228506 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4220403 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386290 | 1998-10-15 | Paper |
| Fault-tolerant Computation in the Full Information Model | 1998-05-10 | Paper |
| Efficient construction of a small hitting set for combinatorial rectangles in high dimension | 1998-03-26 | Paper |
| Inclusion-exclusion: exact and approximate | 1998-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347906 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128884 | 1997-04-23 | Paper |
| Biased random walks | 1996-09-16 | Paper |
| Central points for sets in \(\mathbb{R}^ n\) (or: the chocolate ice-cream problem) | 1996-07-29 | Paper |
| Witness sets for families of binary vectors | 1996-02-26 | Paper |
| On the distance distribution of codes | 1996-02-12 | Paper |
| Fast perfect-information leader-election protocols with linear immunity | 1995-10-17 | Paper |
| The geometry of graphs and some of its algorithmic applications | 1995-07-24 | Paper |
| Spectral properties of threshold functions | 1995-04-18 | Paper |
| An optimal on-line algorithm for metrical task system | 1994-08-21 | Paper |
| Local and global clique numbers | 1994-07-04 | Paper |
| Low diameter graph decompositions | 1994-06-22 | Paper |
| Local-Global Phenomena in Graphs | 1994-04-28 | Paper |
| Constant depth circuits, Fourier transform, and learnability | 1993-12-09 | Paper |
| Combinatorial characterization of read-once formulae | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138968 | 1993-10-20 | Paper |
| The influence of variables in product spaces | 1993-10-04 | Paper |
| The influence of large coalitions | 1993-09-15 | Paper |
| On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels | 1993-05-16 | Paper |
| On convex body chasing | 1993-05-16 | Paper |
| Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties | 1993-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4024324 | 1993-03-09 | Paper |
| The equivalence of two problems on the cube | 1992-10-05 | Paper |
| Locality in Distributed Graph Algorithms | 1992-06-28 | Paper |
| Single round simulation on radio networks | 1992-06-28 | Paper |
| Balancing extensions via Brunn-Minkowski | 1992-06-27 | Paper |
| Approximate inclusion-exclusion | 1992-06-25 | Paper |
| Additive bases of vector spaces over prime fields | 1992-06-25 | Paper |
| A lower bound for radio broadcast | 1992-06-25 | Paper |
| Results on learnability and the Vapnik-Chervonenkis dimension | 1991-01-01 | Paper |
| A lower bound on the area of permutation layouts | 1991-01-01 | Paper |
| Improved routing strategies with succinct tables | 1990-01-01 | Paper |
| Bounds on Universal Sequences | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733694 | 1989-01-01 | Paper |
| Some extremal problems arising from discrete control processes | 1989-01-01 | Paper |
| Cycles of length 0 modulo k in directed graphs | 1989-01-01 | Paper |
| Interpolation between bases and the shuffle exchange network | 1989-01-01 | Paper |
| On the cover time of random walks on graphs | 1989-01-01 | Paper |
| Some Bounds for the Banzhaf Index and Other Semivalues | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830840 | 1988-01-01 | Paper |
| Optima of dual integer linear programs | 1988-01-01 | Paper |
| Rubber bands, convex embeddings and graph connectivity | 1988-01-01 | Paper |
| Matroidal bijections between graphs | 1988-01-01 | Paper |
| Extremal problems on permutations under cyclic equivalence | 1987-01-01 | Paper |
| Hard Enumeration Problems in Geometry and Combinatorics | 1986-01-01 | Paper |
| Graph coloring and monotone functions on posets | 1986-01-01 | Paper |
| Legal coloring of graphs | 1986-01-01 | Paper |
| Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas | 1986-01-01 | Paper |
| Searching ordered structures | 1985-01-01 | Paper |
| Every poset has a central element | 1985-01-01 | Paper |
| Deciding hypergraph 2-colourability by H-resolution | 1985-01-01 | Paper |
| Largest induced suborders satisfying the chain condition | 1985-01-01 | Paper |
| The Information-Theoretic Bound is Good for Merging | 1984-01-01 | Paper |
| Graph decompositions without isolates | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320411 | 1983-01-01 | Paper |
| Largest digraphs contained in all n-tournaments | 1983-01-01 | Paper |
| The Counterfeit Coin Problem Revisited | 1982-01-01 | Paper |
| A new derivation of the counting formula for Young tableaux | 1982-01-01 | Paper |
| Incidence Matrices of Subsets—A Rank Formula | 1981-01-01 | Paper |
| On Petersen's graph theorem | 1981-01-01 | Paper |
| Extending the Greene-Kleitman theorem to directed graphs | 1981-01-01 | Paper |
| Covering digraphs by paths | 1978-01-01 | Paper |
| A lower bound for the circumference of a graph | 1976-01-01 | Paper |
