| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875518 | 2023-02-03 | Paper |
| RNC-approximation algorithms for the steiner problem | 2022-11-09 | Paper |
| Solving static permutation mastermind using \(O(n \log n)\) queries | 2022-02-01 | Paper |
| Triangle resilience of the square of a Hamilton cycle in random graphs | 2021-11-17 | Paper |
| Bootstrap percolation with inhibition | 2020-02-14 | Paper |
| A general lower bound for collaborative tree exploration | 2020-02-13 | Paper |
| Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction | 2020-02-07 | Paper |
| When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument | 2019-09-18 | Paper |
| Resilience of perfect matchings and Hamiltonicity in random graph processes | 2019-08-14 | Paper |
| The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates | 2019-07-31 | Paper |
| Multiassociative Memory: Recurrent Synapses Increase Storage Capacity | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743399 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633852 | 2019-05-06 | Paper |
| Local resilience of an almost spanning k‐cycle in random graphs | 2019-02-20 | Paper |
| Maximizing the Minimum Load for Random Processing Times | 2018-10-30 | Paper |
| An algorithmic framework for obtaining lower bounds for random Ramsey problems | 2018-10-29 | Paper |
| Even flying cops should think ahead | 2018-08-17 | Paper |
| Polynomial lower bound for distributed graph coloring in a weak LOCAL model | 2018-08-16 | Paper |
| Drift Analysis and Evolutionary Algorithms Revisited | 2018-07-24 | Paper |
| A general lower bound for collaborative tree exploration | 2018-04-12 | Paper |
| SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS | 2017-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4589015 | 2017-11-06 | Paper |
| Local resilience for squares of almost spanning cycles in sparse random graphs | 2017-10-16 | Paper |
| An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract | 2017-10-05 | Paper |
| A Short Proof of the Random Ramsey Theorem | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365110 | 2017-09-29 | Paper |
| Unique reconstruction threshold for random jigsaw puzzles | 2017-09-26 | Paper |
| Note on the coefficient of variations of neuronal spike trains | 2017-09-12 | Paper |
| Connectivity thresholds for bounded size rules | 2016-12-09 | Paper |
| On the threshold for the Maker-BreakerH-game | 2016-11-09 | Paper |
| Random directed graphs are robustly Hamiltonian | 2016-09-15 | Paper |
| A quasi-polynomial time approximation scheme for minimum weight triangulation | 2015-11-11 | Paper |
| Normalization Phenomena in Asynchronous Networks | 2015-11-04 | Paper |
| On the Number of Graphs Without Large Cliques | 2015-04-17 | Paper |
| The game chromatic number of dense random graphs | 2015-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934629 | 2014-12-18 | Paper |
| A quasi-polynomial time approximation scheme for minimum weight triangulation | 2014-11-25 | Paper |
| The maximum degree of random planar graphs | 2014-11-18 | Paper |
| Maximal biconnected subgraphs of random planar graphs | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921770 | 2014-10-13 | Paper |
| Balanced allocations | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417680 | 2014-05-22 | Paper |
| On the Insertion Time of Cuckoo Hashing | 2014-04-11 | Paper |
| General deletion lemmas via the Harris inequality | 2013-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857383 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857430 | 2013-11-01 | Paper |
| Coloring the edges of a random graph without a monochromatic giant component | 2013-10-10 | Paper |
| Explosive Percolation in Erdős–Rényi-Like Random Graph Processes | 2013-01-21 | Paper |
| A randomized version of Ramsey's theorem | 2012-12-14 | Paper |
| Extremal subgraphs of random graphs | 2012-10-26 | Paper |
| On properties of random dissections and triangulations | 2011-12-19 | Paper |
| Pegging Graphs Yields a Small Diameter | 2011-03-07 | Paper |
| Offline thresholds for Ramsey-type games on random graphs | 2010-11-10 | Paper |
| Asymmetric Ramsey properties of random graphs involving cliques | 2010-11-09 | Paper |
| Coloring the edges of a random graph without a monochromatic giant component | 2010-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579468 | 2010-08-06 | Paper |
| A new average case analysis for completion time scheduling | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576710 | 2010-07-30 | Paper |
| Upper Bounds for Online Ramsey Games in Random Graphs | 2010-04-23 | Paper |
| Online Ramsey Games in Random Graphs | 2010-04-23 | Paper |
| The Degree Sequence of Random Graphs from Subcritical Classes | 2010-04-22 | Paper |
| Optimal algorithms for \(k\)-search with application in option pricing | 2009-08-27 | Paper |
| Approximation schemes for node-weighted geometric Steiner tree problems | 2009-07-24 | Paper |
| A note on the chromatic number of a dense random graph | 2009-06-23 | Paper |
| On the resilience of long cycles in random graphs | 2009-04-07 | Paper |
| A tight bound on the collection of edges in MSTs of induced subgraphs | 2009-03-04 | Paper |
| A new average case analysis for completion time scheduling | 2008-12-21 | Paper |
| On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs | 2008-11-27 | Paper |
| On the chromatic number of random graphs | 2008-10-07 | Paper |
| Optimal Algorithms for k-Search with Application in Option Pricing | 2008-09-25 | Paper |
| The random planar graph process | 2008-03-28 | Paper |
| A probabilistic counting lemma for complete graphs | 2008-01-08 | Paper |
| Observational Learning in Random Networks | 2008-01-03 | Paper |
| On the Chromatic Number of Random Graphs | 2007-11-28 | Paper |
| \(K_4\)-free subgraphs of random graphs revisited | 2007-11-12 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Threshold Functions for Asymmetric Ramsey Properties Involving Cliques | 2007-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447281 | 2007-06-28 | Paper |
| On an Online Spanning Tree Problem in Randomly Weighted Graphs | 2007-03-20 | Paper |
| A characterization for sparse \(\varepsilon\)-regular pairs | 2007-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424885 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416250 | 2007-01-19 | Paper |
| Small subsets inherit sparse \(\varepsilon\)-regularity | 2007-01-11 | Paper |
| The expected competitive ratio for weighted completion time scheduling | 2006-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Balanced Allocations: The Heavily Loaded Case | 2006-06-01 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| On the Evolution of Triangle-Free Graphs | 2005-04-04 | Paper |
| Random planar graphs | 2005-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471965 | 2004-08-03 | Paper |
| K5‐free subgraphs of random graphs | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407450 | 2003-01-01 | Paper |
| A note on triangle-free and bipartite graphs | 2002-12-02 | Paper |
| Phase transitions in the evolution of partial orders | 2002-06-02 | Paper |
| On the structure of clique-free graphs | 2001-10-14 | Paper |
| Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries | 2001-08-20 | Paper |
| Asymptotic enumeration, global structure, and constrained evolution | 2001-07-24 | Paper |
| Counting Partial Orders with a Fixed Number of Comparable Pairs | 2001-07-18 | Paper |
| Discrete structures 2. Probability theory and statistics | 2001-07-16 | Paper |
| Discrete structures 1. Combinatorics, graph theory, algebra | 2001-04-22 | Paper |
| Approximability of scheduling with fixed jobs | 2001-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525263 | 2001-01-21 | Paper |
| A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 | 2000-08-27 | Paper |
| Generating Random Regular Graphs Quickly | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247202 | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703851 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252431 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347903 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718235 | 1997-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689037 | 1997-01-23 | Paper |
| Counting \(H\)-free graphs | 1996-07-18 | Paper |
| Tidier examples for lower bounds on diagonal Ramsey numbers | 1996-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273843 | 1996-05-30 | Paper |
| The average number of linear extensions of a partial order | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865522 | 1996-02-25 | Paper |
| Probabilistically checkable proofs and their consequences for approximation algorithms | 1995-11-06 | Paper |
| Random I‐colorable graphs | 1995-02-09 | Paper |
| Almost all Berge Graphs are Perfect | 1994-05-30 | Paper |
| On induced matchings | 1994-05-19 | Paper |
| Extremal Graph Problems for Graphs with a Color-Critical Vertex | 1994-04-28 | Paper |
| Excluding induced subgraphs. II: Extremal graphs | 1993-11-30 | Paper |
| The asymptotic number of graphs not containing a fixed color-critical subgraph | 1993-03-10 | Paper |
| Coloring Clique-free Graphs in Linear Expected Time | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998561 | 1992-09-17 | Paper |
| Excluding Induced Subgraphs III: A General Asymptotic | 1992-06-28 | Paper |
| Excluding induced subgraphs: quadrilaterals | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210200 | 1990-01-01 | Paper |
