| Publication | Date of Publication | Type |
|---|
| Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) | 2024-03-14 | Paper |
| On the Concentration of the Maximum Degree in the Duplication-Divergence Models | 2024-03-14 | Paper |
| Rainbow powers of a Hamilton cycle in Gn,p | 2024-02-23 | Paper |
| Hamilton cycles in random digraphs with minimum degree at least one | 2023-12-11 | Paper |
| Weighted tree games | 2023-11-18 | Paper |
| Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds | 2023-11-09 | Paper |
| Corrigendum to “Online purchasing under uncertainty” | 2023-10-12 | Paper |
| A scaling limit for the length of the longest cycle in a sparse random digraph | 2023-10-12 | Paper |
| Finding maximum matchings in random regular graphs in linear expected time | 2023-10-11 | Paper |
| Spanners in randomly weighted graphs: Euclidean case | 2023-10-10 | Paper |
| Maker Breaker on digraphs | 2023-10-04 | Paper |
| The bright side of simple heuristics for the TSP | 2023-10-04 | Paper |
| Giant Rainbow Trees in Sparse Random Graphs | 2023-08-27 | Paper |
| Rainbow Greedy Matching Algorithms | 2023-07-02 | Paper |
| Sequentially constrained Hamilton cycles in random graphs | 2023-05-01 | Paper |
| Colorful Hamilton Cycles in Random Graphs | 2023-03-30 | Paper |
| The concentration of the maximum degree in the duplication-divergence models | 2023-03-30 | Paper |
| Multitrees in random graphs | 2023-02-17 | Paper |
| On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs | 2023-02-03 | Paper |
| Random Graphs and Networks: A First Course | 2023-01-30 | Paper |
| On the chromatic number of random regular hypergraphs | 2022-12-30 | Paper |
| Degree distribution for duplication-divergence graphs: large deviations | 2022-12-21 | Paper |
| Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs | 2022-09-21 | Paper |
| Hamilton cycles in a semi-random graph model | 2022-07-30 | Paper |
| On the Cover Time of the Emerging Giant | 2022-07-28 | Paper |
| Fast construction on a restricted budget | 2022-07-14 | Paper |
| Giant descendant trees, matchings, and independent sets in age-biased attachment graphs | 2022-07-08 | Paper |
| A Randomly Weighted Minimum Arborescence with a Random Cost Constraint | 2022-06-27 | Paper |
| Subexponential mixing for partition chains on grid-like graphs | 2022-06-01 | Paper |
| A note on spanning \(K_r\)-cycles in random graphs | 2022-04-25 | Paper |
| Spanners in randomly weighted graphs: independent edge lengths | 2022-01-13 | Paper |
| Localization game for random graphs | 2022-01-13 | Paper |
| Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects | 2021-12-13 | Paper |
| Multitrees in random graphs | 2021-10-17 | Paper |
| The game chromatic number of a random hypergraph | 2021-10-04 | Paper |
| A note on randomly colored matchings in random bipartite graphs | 2021-10-04 | Paper |
| Hamiltonicity of Random Graphs in the Stochastic Block Model | 2021-08-20 | Paper |
| Shortest paths with a cost constraint: a probabilistic analysis | 2021-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002651 | 2021-07-28 | Paper |
| Rank of the vertex-edge incidence matrix of $r$-out hypergraphs | 2021-07-12 | Paper |
| The cover time of a biased random walk on a random cubic graph | 2021-06-15 | Paper |
| The Effect of Adding Randomly Weighted Edges | 2021-06-10 | Paper |
| Long Paths in Random Apollonian Networks | 2021-04-26 | Paper |
| Some Typical Properties of the Spatial Preferred Attachment Model | 2021-04-23 | Paper |
| Some Properties of Random Apollonian Networks | 2021-04-23 | Paper |
| Rainbow Thresholds | 2021-04-12 | Paper |
| A scaling limit for the length of the longest cycle in a sparse random graph | 2021-03-08 | Paper |
| Isomorphism for random \(k\)-uniform hypergraphs | 2021-02-04 | Paper |
| A randomly weighted minimum spanning tree with a random cost constraint | 2021-02-02 | Paper |
| Minimum-weight combinatorial structures under random cost-constraints | 2021-01-29 | Paper |
| A randomly weighted minimum spanning tree with a random cost constraint | 2021-01-29 | Paper |
| Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis | 2021-01-05 | Paper |
| On the existence of Hamilton cycles with a periodic pattern in a random digraph | 2020-12-03 | Paper |
| On the connectivity of proper colorings of random graphs and hypergraphs | 2020-10-26 | Paper |
| Random volumes in d-dimensional polytopes | 2020-10-20 | Paper |
| On random multi-dimensional assignment problems | 2020-10-14 | Paper |
| Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects | 2020-09-07 | Paper |
| How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? | 2020-07-17 | Paper |
| Karp's patching algorithm on dense digraphs | 2020-06-18 | Paper |
| Rainbow Hamilton Cycles in Random Geometric Graphs | 2020-03-05 | Paper |
| Minors of a random binary matroid | 2020-02-14 | Paper |
| Random Graphs with a Fixed Maximum Degree | 2020-01-09 | Paper |
| Near-perfect token distribution | 2019-12-04 | Paper |
| Traveling in randomly embedded random graphs | 2019-11-28 | Paper |
| A note on the rank of a sparse random matrix | 2019-11-21 | Paper |
| Notes on growing a tree in a graph | 2019-11-07 | Paper |
| On the rank of a random binary matrix | 2019-10-15 | Paper |
| On the rank of a random binary matrix | 2019-10-14 | Paper |
| The cover time of a biased random walk on Gn,p | 2019-09-18 | Paper |
| Analyzing Walksat on Random Formulas | 2019-09-17 | Paper |
| A note on log-concave random graphs | 2019-09-12 | Paper |
| A Random Variant of the Game of Plates and Olives | 2019-08-29 | Paper |
| On the Cover Time of Dense Graphs | 2019-08-29 | Paper |
| On the insertion time of random walk cuckoo hashing | 2019-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633810 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633827 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633854 | 2019-05-06 | Paper |
| Perfect matchings and Hamiltonian cycles in the preferential attachment model | 2019-05-02 | Paper |
| Separating effect from significance in Markov chain tests | 2019-04-08 | Paper |
| Pattern Colored Hamilton Cycles in Random Graphs | 2019-03-20 | Paper |
| A note on dispersing particles on a line | 2019-02-20 | Paper |
| A note on the localization number of random graphs: diameter two case | 2019-02-08 | Paper |
| Hamilton Cycles in Random Graphs: a bibliography | 2019-01-21 | Paper |
| Coloring bipartite hypergraphs | 2019-01-11 | Paper |
| Assessing significance in a Markov chain without mixing | 2019-01-11 | Paper |
| Diffusion limited aggregation on the Boolean lattice | 2018-12-17 | Paper |
| Discordant Voting Processes on Finite Graphs | 2018-10-18 | Paper |
| Online purchasing under uncertainty | 2018-09-25 | Paper |
| A greedy algorithm for finding a large 2‐matching on a random cubic graph | 2018-08-16 | Paper |
| The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights | 2018-08-15 | Paper |
| Packing Hamilton Cycles Online | 2018-07-24 | Paper |
| Elegantly Colored Paths and Cycles in Edge Colored Random Graphs | 2018-07-18 | Paper |
| On the insertion time of random walk cuckoo hashing | 2018-07-16 | Paper |
| On rainbow Hamilton cycles in random hypergraphs | 2018-06-27 | Paper |
| On the rank of a random binary matrix | 2018-06-13 | Paper |
| Constraining the clustering transition for colorings of sparse random graphs | 2018-05-25 | Paper |
| On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph | 2018-05-24 | Paper |
| On the trace of random walks on random graphs | 2018-05-03 | Paper |
| On the connectivity threshold for colorings of random graphs and hypergraphs | 2018-03-14 | Paper |
| Discordant Voting Processes on Finite Graphs | 2017-12-19 | Paper |
| Balanced allocation through random walk | 2017-12-13 | Paper |
| Greedy algorithms for the shortest common superstring that are asymtotically optimal | 2017-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5371198 | 2017-10-25 | Paper |
| Separating subadditive euclidean functionals | 2017-10-24 | Paper |
| Adding random edges to create the square of a Hamilton cycle | 2017-10-07 | Paper |
| Loose Hamilton Cycles in Regular Hypergraphs | 2017-10-04 | Paper |
| On the Length of a Random Minimum Spanning Tree | 2017-10-04 | Paper |
| Separating subadditive euclidean functionals | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365090 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365111 | 2017-09-29 | Paper |
| Randomly coloring simple hypergraphs with fewer colors | 2017-06-30 | Paper |
| Looking for vertex number one | 2017-05-03 | Paper |
| On randomk-out subgraphs of large graphs | 2017-04-18 | Paper |
| Minimum Cost Matching in a Random Graph with Random Costs | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959892 | 2017-02-10 | Paper |
| Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity | 2016-11-25 | Paper |
| Square of a Hamilton cycle in a random graph | 2016-11-20 | Paper |
| Rainbow Arborescence in Random Digraphs | 2016-11-16 | Paper |
| Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs | 2016-07-06 | Paper |
| Square of Hamilton cycle in a random graph | 2016-06-24 | Paper |
| Rainbow matchings and Hamilton cycles in random graphs | 2016-06-10 | Paper |
| Scalefree hardness of average-case Euclidean TSP approximation | 2016-04-15 | Paper |
| A note on the vacant set of random walks on the hypercube and other regular graphs of high degree | 2016-04-13 | Paper |
| Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk | 2016-02-05 | Paper |
| Rainbow Connection of Random Regular Graphs | 2015-11-18 | Paper |
| An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three | 2015-10-12 | Paper |
| Introduction to Random Graphs | 2015-10-05 | Paper |
| Walker-Breaker Games | 2015-09-02 | Paper |
| On-line list colouring of random graphs | 2015-08-26 | Paper |
| Maker‐breaker games on random geometric graphs | 2015-06-22 | Paper |
| Cover time of a random graph with a degree sequence II: Allowing vertices of degree two | 2015-06-22 | Paper |
| The height of random k‐trees and related branching processes | 2015-06-22 | Paper |
| On the chromatic number of a random hypergraph | 2015-06-10 | Paper |
| Random triangle removal | 2015-05-29 | Paper |
| Efficient algorithms for three‐dimensional axial and planar random assignment problems | 2015-02-20 | Paper |
| Between 2- and 3-colorability | 2015-02-19 | Paper |
| Power of \(k\) choices and rainbow spanning trees in random graphs | 2015-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934689 | 2014-12-18 | Paper |
| On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three | 2014-11-17 | Paper |
| Analyzing Walksat on Random Formulas | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921681 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921682 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921759 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921765 | 2014-10-13 | Paper |
| The \(t\)-tone chromatic number of random graphs | 2014-09-19 | Paper |
| Packing tree factors in random and pseudo-random graphs | 2014-09-04 | Paper |
| The topology of competitively constructed graphs | 2014-09-04 | Paper |
| Expanders via Random Spanning Trees | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420010 | 2014-06-11 | Paper |
| Rainbow hamilton cycles in random graphs | 2014-05-13 | Paper |
| Approximate counting of regular hypergraphs | 2014-04-14 | Paper |
| On the Non-Planarity of a Random Subgraph | 2014-02-24 | Paper |
| The cover times of random walks on random uniform hypergraphs | 2014-01-13 | Paper |
| On a sparse random graph with minimum degree three: likely Pósa sets are large | 2013-11-05 | Paper |
| Randomly coloring constant degree graphs | 2013-10-09 | Paper |
| On the Game Chromatic Number of Sparse Random Graphs | 2013-09-26 | Paper |
| Rainbow connection of sparse random graphs | 2013-06-07 | Paper |
| Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs | 2013-06-07 | Paper |
| Tight Hamilton cycles in random uniform hypergraphs | 2013-05-28 | Paper |
| Separating populations with wide data: a spectral analysis | 2013-05-27 | Paper |
| Randomly coloring simple hypergraphs | 2013-04-04 | Paper |
| Component structure of the vacant set induced by a random walk on a random graph | 2013-03-12 | Paper |
| On the chromatic number of simple triangle-free triple systems | 2012-11-15 | Paper |
| Rainbow Connectivity of Sparse Random Graphs | 2012-11-02 | Paper |
| Cops and Robbers on Geometric Graphs | 2012-10-31 | Paper |
| Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables | 2012-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165958 | 2012-10-19 | Paper |
| Cover time of a random graph with given degree sequence | 2012-10-16 | Paper |
| Packing Tight Hamilton Cycles in Uniform Hypergraphs | 2012-09-12 | Paper |
| Packing hamilton cycles in random and pseudo-random hypergraphs | 2012-08-30 | Paper |
| Some Typical Properties of the Spatial Preferred Attachment Model | 2012-07-23 | Paper |
| On Certain Properties of Random Apollonian Networks | 2012-07-23 | Paper |
| Variations on cops and robbers | 2012-06-13 | Paper |
| Rainbow Hamilton cycles in uniform hypergraphs | 2012-06-12 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2012-05-14 | Paper |
| Stationary distribution and cover time of random walks on random digraphs | 2012-05-04 | Paper |
| Hypergraphs with independent neighborhoods | 2011-12-19 | Paper |
| Karp–Sipser on Random Graphs with a Fixed Degree Sequence | 2011-12-08 | Paper |
| Random greedy triangle-packing beyond the 7/4 barrier | 2011-08-08 | Paper |
| An Analysis of Random-Walk Cuckoo Hashing | 2011-07-29 | Paper |
| A note on the random greedy triangle-packing algorithm | 2011-06-27 | Paper |
| Flips in Graphs | 2011-06-17 | Paper |
| Random Walks with Look-Ahead in Scale-Free Random Graphs | 2011-06-17 | Paper |
| Loose Hamilton cycles in random uniform hypergraphs | 2011-06-01 | Paper |
| The cover time of random geometric graphs | 2011-05-11 | Paper |
| Hamilton Cycles in Random Graphs with a Fixed Degree Sequence | 2011-04-15 | Paper |
| Ramsey games with giants | 2011-01-17 | Paper |
| Multiple Random Walks in Random Regular Graphs | 2010-12-03 | Paper |
| An Efficient Sparse Regularity Concept | 2010-12-03 | Paper |
| Coloring H-free hypergraphs | 2010-11-10 | Paper |
| Randomly coloring random graphs | 2010-11-10 | Paper |
| Hamilton cycles in 3-out | 2010-11-09 | Paper |
| On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem | 2010-08-16 | Paper |
| Logconcave random graphs | 2010-08-12 | Paper |
| Crawling on web graphs | 2010-08-05 | Paper |
| Finding a maximum matching in a sparse random graph in O ( n ) expected time | 2010-07-14 | Paper |
| Loose Hamilton cycles in random 3-uniform hypergraphs | 2010-06-16 | Paper |
| Memoryless Rules for Achlioptas Processes | 2010-06-01 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Line-of-Sight Networks | 2010-04-23 | Paper |
| Anti-Ramsey properties of random graphs | 2010-04-21 | Paper |
| An Analysis of Random-Walk Cuckoo Hashing | 2009-10-28 | Paper |
| Average-Case Analyses of Vickrey Costs | 2009-10-28 | Paper |
| Multiple Random Walks and Interacting Particle Systems | 2009-07-14 | Paper |
| Hamilton Cycles in Random Lifts of Directed Graphs | 2009-05-27 | Paper |
| A Geometric Preferential Attachment Model of Networks II | 2009-04-28 | Paper |
| Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439 | 2009-04-08 | Paper |
| Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\) | 2009-04-07 | Paper |
| On rainbow trees and cycles | 2009-04-07 | Paper |
| On the chromatic number of simple triangle-free triple systems | 2009-04-07 | Paper |
| The Cover Time of Random Digraphs | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302103 | 2009-01-05 | Paper |
| Game chromatic index of graphs with given restrictions on degrees | 2008-11-18 | Paper |
| On two Hamilton cycle problems in random graphs | 2008-10-16 | Paper |
| Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time | 2008-08-28 | Paper |
| The cover time of the giant component of a random graph | 2008-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3499508 | 2008-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387670 | 2008-05-27 | Paper |
| Separating Populations with Wide Data: A Spectral Analysis | 2008-05-27 | Paper |
| The Influence of Search Engines on Preferential Attachment | 2008-04-29 | Paper |
| A Geometric Preferential Attachment Model of Networks II | 2008-04-11 | Paper |
| The game chromatic number of random graphs | 2008-03-28 | Paper |
| On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem | 2008-02-22 | Paper |
| On the Chromatic Number of Random Graphs with a Fixed Degree Sequence | 2008-02-22 | Paper |
| Fast monte-carlo algorithms for finding low-rank approximations | 2008-01-14 | Paper |
| The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems | 2007-10-22 | Paper |
| A Geometric Preferential Attachment Model of Networks | 2007-08-20 | Paper |
| Random 2-SAT with prescribed literal degrees | 2007-08-20 | Paper |
| Adversarial Deletion in a Scale-Free Random Graph Process | 2007-07-30 | Paper |
| Product rule wins a competitive game | 2007-07-27 | Paper |
| The diameter of randomly perturbed digraphs and some applications | 2007-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447279 | 2007-06-28 | Paper |
| First-Order Definability of Trees and Sparse Random Graphs | 2007-05-15 | Paper |
| Codes identifying sets of vertices in random networks | 2007-03-15 | Paper |
| The cover time of the preferential attachment graph | 2007-02-13 | Paper |
| The cover time of sparse random graphs | 2007-02-07 | Paper |
| Randomly generated intersecting hypergraphs II | 2007-02-07 | Paper |
| Randomly coloring sparse random graphs with fewer colors than the maximum degree | 2007-02-07 | Paper |
| Hamilton cycles in random lifts of graphs | 2006-11-15 | Paper |
| Almost universal graphs | 2006-09-06 | Paper |
| The satisfiability threshold for randomly generated binary constraint satisfaction problems | 2006-06-06 | Paper |
| The Strong Chromatic Index of Random Graphs | 2006-06-01 | Paper |
| On the random 2-stage minimum spanning tree | 2006-03-24 | Paper |
| Random \(k\)-SAT: A tight threshold for moderately growing \(k\) | 2006-01-26 | Paper |
| The Game of JumbleG | 2005-11-14 | Paper |
| On Random Symmetric Travelling Salesman Problems | 2005-11-11 | Paper |
| High Degree Vertices and Eigenvalues in the Preferential Attachment Graph | 2005-10-27 | Paper |
| The Cover Time of Random Regular Graphs | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| Perfect matchings in random bipartite graphs with minimal degree at least 2 | 2005-06-01 | Paper |
| Crawling on Simple Models of Web Graphs | 2005-05-09 | Paper |
| On packing Hamilton cycles in \(\varepsilon\)-regular graphs | 2005-05-04 | Paper |
| Random Deletion in a Scale-Free Random Graph Process | 2005-05-03 | Paper |
| Clustering large graphs via the singular value decomposition | 2005-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154668 | 2005-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828948 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828949 | 2004-11-29 | Paper |
| Efficient communication in an ad-hoc network | 2004-11-23 | Paper |
| On the $b$ -Independence Number of Sparse Random Graphs | 2004-09-24 | Paper |
| The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471288 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471289 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461909 | 2004-05-18 | Paper |
| Adding random edges to dense graphs | 2004-03-29 | Paper |
| The emergence of a giant component in random subgraphs of pseudo-random graphs | 2004-02-03 | Paper |
| Randomly coloring graphs with lower bounds on girth and maximum degree | 2003-11-10 | Paper |
| On randomly generated intersecting hypergraphs | 2003-09-24 | Paper |
| Concurrent threads and optimal parallel minimum spanning trees algorithm | 2003-06-25 | Paper |
| Arc-Disjoint Paths in Expander Digraphs | 2003-06-19 | Paper |
| A general model of web graphs | 2003-05-11 | Paper |
| On graph irregularity strength | 2003-03-19 | Paper |
| How many random edges make a dense graph hamiltonian? | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796198 | 2003-03-02 | Paper |
| Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity | 2003-02-11 | Paper |
| Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs | 2003-01-05 | Paper |
| Hamilton cycles in random subgraphs of pseudo-random graphs | 2002-12-02 | Paper |
| G-Intersecting Families | 2002-11-24 | Paper |
| Addendum to ‘avoiding a giant component’ | 2002-11-17 | Paper |
| Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385084 | 2002-11-11 | Paper |
| On Counting Independent Sets in Sparse Graphs | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542551 | 2002-09-17 | Paper |
| A new rounding procedure for the assignment problem with applications to dense graph arrangement problems | 2002-06-12 | Paper |
| Avoiding a giant component | 2002-06-06 | Paper |
| Vertex covers by edge disjoint cliques | 2002-02-13 | Paper |
| Hamilton cycles in the union of random permutations | 2001-09-04 | Paper |
| Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids | 2001-08-30 | Paper |
| On Markov Chains for Randomly H-Coloring a Graph | 2001-07-29 | Paper |
| Edge-Disjoint Paths in Expander Graphs | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500692 | 2001-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527020 | 2001-02-28 | Paper |
| Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs | 2001-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768360 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943352 | 2000-12-12 | Paper |
| On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs | 2000-11-30 | Paper |
| Splitting an Expander Graph | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704792 | 2000-10-05 | Paper |
| A note on random minimum length spanning trees | 2000-09-14 | Paper |
| Min-wise independent permutations | 2000-08-27 | Paper |
| Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk | 2000-06-21 | Paper |
| min-wise independent linear permutations | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952692 | 2000-05-10 | Paper |
| A note on sparse random graphs and cover graphs | 2000-04-16 | Paper |
| Log-Sobolev inequalities and sampling from log-concave distributions | 2000-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705352 | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247194 | 1999-12-13 | Paper |
| Quick approximation to matrices and applications | 1999-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252307 | 1999-09-15 | Paper |
| On Perfect Matchings and Hamilton Cycles in Sums of Random Trees | 1999-06-27 | Paper |
| Average-case analysis of the merging algorithm of Hwang and Lin | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252300 | 1999-06-17 | Paper |
| Random minimum length spanning trees in regular graphs | 1999-05-18 | Paper |
| A simple algorithm for constructing Szemerédi's regularity partition | 1999-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226449 | 1999-01-27 | Paper |
| A polynomial-time algorithm for learning noisy linear threshold functions | 1998-11-11 | Paper |
| Optimal Construction of Edge-Disjoint Paths in Random Graphs | 1998-09-21 | Paper |
| Approximately Counting Hamilton Paths and Cycles in Dense Graphs | 1998-09-20 | Paper |
| Greedy algorithms for the shortest common superstring that are asymptotically optimal | 1998-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335204 | 1998-01-25 | Paper |
| Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3122905 | 1997-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347886 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128923 | 1997-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128893 | 1997-04-23 | Paper |
| Perfect Matchings in Random r-regular, s-uniform Hypergraphs | 1997-03-06 | Paper |
| Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph | 1997-03-06 | Paper |
| The worst-case running time of the random simplex algorithm is exponential in the height | 1997-02-27 | Paper |
| Generating and Counting Hamilton Cycles in Random Regular Graphs | 1996-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875193 | 1996-12-11 | Paper |
| On the Connectivity of Random k-th Nearest Neighbour Graphs | 1996-09-29 | Paper |
| Perfect matchings in random s‐uniform hypergraphs | 1996-06-05 | Paper |
| Covering the edges of a random graph by cliques | 1996-06-05 | Paper |
| On the Best Case of Heapsort | 1996-06-04 | Paper |
| Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case | 1996-05-28 | Paper |
| Analysis of Two Simple Heuristics on a Random Instance ofk-sat | 1996-05-06 | Paper |
| When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? | 1996-03-18 | Paper |
| Probabilistic analysis of an algorithm in the theory of markets in indivisible goods | 1996-03-12 | Paper |
| Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold | 1995-10-19 | Paper |
| Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697455 | 1995-07-23 | Paper |
| An analysis of Monte Carlo algorithm for estimating the permanent | 1995-07-23 | Paper |
| Sampling from log-concave distributions | 1995-05-30 | Paper |
| Multicoloured Hamilton cycles | 1995-05-22 | Paper |
| Randomized greedy matching. II | 1995-05-09 | Paper |
| Broadcasting in random graphs | 1995-05-03 | Paper |
| Finding hidden hamiltonian cycles | 1995-03-20 | Paper |
| Existence and Construction of Edge-Disjoint Paths on Expander Graphs | 1995-03-09 | Paper |
| On key storage in secure networks | 1995-01-01 | Paper |
| On the independence number of random cubic graphs | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140436 | 1994-11-29 | Paper |
| Near‐perfect token distribution | 1994-11-08 | Paper |
| On the complexity of computing the diameter of a polytope | 1994-10-30 | Paper |
| Hamilton Cycles in Random Regular Digraphs | 1994-10-24 | Paper |
| Multicolored trees in random graphs | 1994-09-15 | Paper |
| Hamilton cycles in a class of random directed graphs | 1994-09-13 | Paper |
| A random polynomial-time algorithm for approximating the volume of convex bodies | 1994-08-21 | Paper |
| On Subgraph Sizes in Random Graphs | 1994-08-10 | Paper |
| Random walks, totally unimodular matrices, and a randomised dual simplex algorithm | 1994-08-10 | Paper |
| On the problem of approximating the number of bases of a matroid | 1994-05-26 | Paper |
| A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem | 1994-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140438 | 1993-12-15 | Paper |
| The average performance of the greedy matching algorithm | 1993-10-28 | Paper |
| Polychromatic Hamilton cycles | 1993-10-17 | Paper |
| Probabilistic analysis of the generalised assignment problem | 1992-12-17 | Paper |
| Counting the Number of Hamilton Cycles in Random Digraphs | 1992-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014322 | 1992-10-06 | Paper |
| On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph | 1992-06-28 | Paper |
| On the independence and chromatic numbers of random regular graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975002 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975003 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975004 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976408 | 1992-06-26 | Paper |
| Randomized greedy matching | 1992-06-25 | Paper |
| Spanning maximal planar subgraphs of random graphs | 1992-06-25 | Paper |
| On the length of the longest monotone subsequence in a random permutation | 1992-06-25 | Paper |
| On patching algorithms for random asymmetric travelling salesman problems | 1992-06-25 | Paper |
| Edge disjoint spanning trees in random graphs | 1992-06-25 | Paper |
| Occupancy problems and random algebras | 1991-01-01 | Paper |
| Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202206 | 1990-01-01 | Paper |
| Greedy Matching on the Line | 1990-01-01 | Paper |
| Probabilistic analysis of a parallel algorithm for finding maximal independent sets | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355235 | 1990-01-01 | Paper |
| On an optimization problem with nested constraints | 1990-01-01 | Paper |
| The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected | 1990-01-01 | Paper |
| On the independence number of random graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729826 | 1989-01-01 | Paper |
| On the number of hamilton cycles in a random graph | 1989-01-01 | Paper |
| Probabilistic Analysis of the Multidimensional Knapsack Problem | 1989-01-01 | Paper |
| The solution of some random NP-hard problems in polynomial expected time | 1989-01-01 | Paper |
| Random graph orders | 1989-01-01 | Paper |
| Survival time of a random graph | 1989-01-01 | Paper |
| On random minimum length spanning trees | 1989-01-01 | Paper |
| A new integer programming formulation for the permutation flowshop problem | 1989-01-01 | Paper |
| A randomized algorithm for fixed-dimensional linear programming | 1989-01-01 | Paper |
| An algorithm for finding hamilton cycles in random directed graphs | 1988-01-01 | Paper |
| Reconstructing Truncated Integer Variables Satisfying Linear Congruences | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816114 | 1988-01-01 | Paper |
| On the Complexity of Computing the Volume of a Polyhedron | 1988-01-01 | Paper |
| Finding Hamilton cycles in sparse random graphs | 1988-01-01 | Paper |
| Partitioning random graphs into large cycles | 1988-01-01 | Paper |
| On the random construction of heaps | 1988-01-01 | Paper |
| Edge-colouring random graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794221 | 1987-01-01 | Paper |
| On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients | 1987-01-01 | Paper |
| An algorithm for finding Hamilton paths and cycles in random graphs | 1987-01-01 | Paper |
| Parallel algorithms for finding Hamilton cycles in random graphs | 1987-01-01 | Paper |
| Large holes in sparse random graphs | 1987-01-01 | Paper |
| Large induced trees in sparse random graphs | 1987-01-01 | Paper |
| On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem | 1986-01-01 | Paper |
| On linear programs with random costs | 1986-01-01 | Paper |
| Planar 3DM is NP-complete | 1986-01-01 | Paper |
| Expected Behaviour of Line-Balancing Heuristics | 1986-01-01 | Paper |
| A probabilistic analysis of the next fit decreasing bin packing heuristic | 1986-01-01 | Paper |
| On large matchings and cycles in sparse random graphs | 1986-01-01 | Paper |
| Maximum matchings in a class of random graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3720644 | 1985-01-01 | Paper |
| A simple heuristic for the p-centre problem | 1985-01-01 | Paper |
| On the complexity of partitioning graphs into connected subgraphs | 1985-01-01 | Paper |
| Analysis of heuristics for finding a maximum weight planar subgraph | 1985-01-01 | Paper |
| On the value of a random minimum spanning tree problem | 1985-01-01 | Paper |
| An algorithm for finding a matroid basis which maximizes the product of the weights of the elements | 1985-01-01 | Paper |
| Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs | 1985-01-01 | Paper |
| The shortest-path problem for graphs with random arc-lengths | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683849 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691698 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3222861 | 1984-01-01 | Paper |
| Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses | 1984-01-01 | Paper |
| A partitioning algorithm for minimum weighted Euclidean matching | 1984-01-01 | Paper |
| Partitioning heuristics for two geometric maximization problems | 1984-01-01 | Paper |
| Hamiltonian cycles in random regular graphs | 1984-01-01 | Paper |
| On the quadratic assignment problem | 1983-01-01 | Paper |
| Complexity of a 3-dimensional assignment problem | 1983-01-01 | Paper |
| An extension of Christofides heuristic to the k-person travelling salesman problem | 1983-01-01 | Paper |
| On the existence of Hamiltonian cycles in a class of random graphs | 1983-01-01 | Paper |
| On the worst-case performance of some algorithms for the asymmetric traveling salesman problem | 1982-01-01 | Paper |
| Algebraic Linear Programming | 1982-01-01 | Paper |
| On the connectivity of random m-orientable graphs and digraphs | 1982-01-01 | Paper |
| An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice | 1981-01-01 | Paper |
| Probabilistic analysis of some Euclidean clustering problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191856 | 1979-01-01 | Paper |
| An algorithm for algebraic assignment problems | 1979-01-01 | Paper |
| A Partitioned Inverse in Linear Programming | 1978-01-01 | Paper |
| Minimum Paths in Directed Graphs | 1977-01-01 | Paper |
| Shortest path algorithms for knapsack type problems | 1976-01-01 | Paper |
| Bottleneck Linear Programming | 1975-01-01 | Paper |
| A cost function property for plant location problems | 1974-01-01 | Paper |
| A bilinear programming formulation of the 3-dimensional assignment problem | 1974-01-01 | Paper |
| On the rank of a random binary matrix | 0001-01-03 | Paper |
| Rainbow Hamilton Cycles in Random Geometric Graphs | 0001-01-03 | Paper |
| Subexponential mixing for partition chains on grid-like graphs | 0001-01-03 | Paper |
| Karp's patching algorithm on random perturbations of dense digraphs | 0001-01-03 | Paper |
| On the intersecting family process | 0001-01-03 | Paper |
| Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p | 0001-01-03 | Paper |
| A note on the chromatic number of the square of a sparse random gra | 0001-01-03 | Paper |
| Diffusion limited aggregation in the layers model | 0001-01-03 | Paper |
| O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold | 0001-01-03 | Paper |
| The maximum degree of the $r$th power of a sparse random graph | 0001-01-03 | Paper |
