| Publication | Date of Publication | Type |
|---|
The bright side of simple heuristics for the TSP
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
On the intersecting family process
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Rainbow thresholds
SIAM Journal on Discrete Mathematics | 2024-09-17 | Paper |
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
On the Concentration of the Maximum Degree in the Duplication-Divergence Models
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
Rainbow powers of a Hamilton cycle in Gn,p
Journal of Graph Theory | 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 |
A scaling limit for the length of the longest cycle in a sparse random digraph
Random Structures & Algorithms | 2023-10-12 | Paper |
A scaling limit for the length of the longest cycle in a sparse random digraph
Random Structures & Algorithms | 2023-10-12 | Paper |
Corrigendum to “Online purchasing under uncertainty”
Random Structures & Algorithms | 2023-10-12 | Paper |
Finding maximum matchings in random regular graphs in linear expected time
Random Structures & Algorithms | 2023-10-11 | Paper |
Spanners in randomly weighted graphs: Euclidean case
Journal of Graph Theory | 2023-10-10 | Paper |
Maker Breaker on digraphs
Journal of Graph Theory | 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 |
| The concentration of the maximum degree in the duplication-divergence models | 2023-03-30 | Paper |
Colorful Hamilton Cycles in Random Graphs
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Multitrees in random graphs
The Electronic Journal of Combinatorics | 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
SIAM Journal on Discrete Mathematics | 2022-09-21 | Paper |
| Hamilton cycles in a semi-random graph model | 2022-07-30 | Paper |
On the cover time of the emerging giant
SIAM Journal on Discrete Mathematics | 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
Journal of Applied Probability | 2022-07-08 | Paper |
A randomly weighted minimum arborescence with a random cost constraint
Mathematics of Operations Research | 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
AIMS Mathematics | 2022-04-25 | Paper |
Localization game for random graphs
Discrete Applied Mathematics | 2022-01-13 | Paper |
Spanners in randomly weighted graphs: independent edge lengths
Discrete Applied Mathematics | 2022-01-13 | Paper |
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
Operations Research Letters | 2021-12-13 | Paper |
Multitrees in random graphs
(available as arXiv preprint) | 2021-10-17 | Paper |
A note on randomly colored matchings in random bipartite graphs
(available as arXiv preprint) | 2021-10-04 | Paper |
The game chromatic number of a random hypergraph
(available as arXiv preprint) | 2021-10-04 | Paper |
Hamiltonicity of random graphs in the stochastic block model
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
Shortest paths with a cost constraint: a probabilistic analysis
Discrete Applied Mathematics | 2021-08-02 | Paper |
| Traveling in randomly embedded random graphs | 2021-07-28 | Paper |
Rank of the vertex-edge incidence matrix of $r$-out hypergraphs
(available as arXiv preprint) | 2021-07-12 | Paper |
The cover time of a biased random walk on a random cubic graph
(available as arXiv preprint) | 2021-06-15 | Paper |
The effect of adding randomly weighted edges
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
Long Paths in Random Apollonian Networks
Internet Mathematics | 2021-04-26 | Paper |
Some properties of random Apollonian networks
Internet Mathematics | 2021-04-23 | Paper |
Some typical properties of the spatial preferred attachment model
Internet Mathematics | 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
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Isomorphism for random \(k\)-uniform hypergraphs
Information Processing Letters | 2021-02-04 | Paper |
A randomly weighted minimum spanning tree with a random cost constraint
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Minimum-weight combinatorial structures under random cost-constraints
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
A randomly weighted minimum spanning tree with a random cost constraint
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Hamilton cycles in random graphs with minimum degree at least 3: an improved analysis
Random Structures & Algorithms | 2021-01-05 | Paper |
On the existence of Hamilton cycles with a periodic pattern in a random digraph
The Electronic Journal of Combinatorics | 2020-12-03 | Paper |
On the connectivity of proper colorings of random graphs and hypergraphs
Random Structures & Algorithms | 2020-10-26 | Paper |
Random volumes in \(d\)-dimensional polytopes
discrete Analysis | 2020-10-20 | Paper |
On random multi-dimensional assignment problems
Discrete Applied Mathematics | 2020-10-14 | Paper |
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
(available as arXiv preprint) | 2020-09-07 | Paper |
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
Journal of Graph Theory | 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
Random Structures & Algorithms | 2020-02-14 | Paper |
Random graphs with a fixed maximum degree
SIAM Journal on Discrete Mathematics | 2020-01-09 | Paper |
Near-perfect token distribution
Automata, Languages and Programming | 2019-12-04 | Paper |
Traveling in randomly embedded random graphs
Random Structures & Algorithms | 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
Random Structures & Algorithms | 2019-11-07 | Paper |
On the rank of a random binary matrix
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the rank of a random binary matrix
The Electronic Journal of Combinatorics | 2019-10-14 | Paper |
The cover time of a biased random walk on \(G_{n,p}\)
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Analyzing Walksat on random formulas
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
A note on log-concave random graphs
The Electronic Journal of Combinatorics | 2019-09-12 | Paper |
A note on log-concave random graphs
The Electronic Journal of Combinatorics | 2019-09-12 | Paper |
On the cover time of dense graphs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
A random variant of the game of plates and olives
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
A random variant of the game of plates and olives
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
On the insertion time of random walk cuckoo hashing
Random Structures & Algorithms | 2019-08-14 | Paper |
| An efficient sparse regularity concept | 2019-05-06 | Paper |
| On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm | 2019-05-06 | Paper |
| The cover time of random geometric graphs | 2019-05-06 | Paper |
Perfect matchings and Hamiltonian cycles in the preferential attachment model
Random Structures & Algorithms | 2019-05-02 | Paper |
| Separating effect from significance in Markov chain tests | 2019-04-08 | Paper |
Pattern colored Hamilton cycles in random graphs
SIAM Journal on Discrete Mathematics | 2019-03-20 | Paper |
A note on dispersing particles on a line
Random Structures & Algorithms | 2019-02-20 | Paper |
A note on the localization number of random graphs: diameter two case
Discrete Applied Mathematics | 2019-02-08 | Paper |
| Hamilton Cycles in Random Graphs: a bibliography | 2019-01-21 | Paper |
Assessing significance in a Markov chain without mixing
Proceedings of the National Academy of Sciences | 2019-01-11 | Paper |
Coloring bipartite hypergraphs
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Diffusion limited aggregation on the Boolean lattice
The Annals of Applied Probability | 2018-12-17 | Paper |
Diffusion limited aggregation on the Boolean lattice
The Annals of Applied Probability | 2018-12-17 | Paper |
Discordant Voting Processes on Finite Graphs
SIAM Journal on Discrete Mathematics | 2018-10-18 | Paper |
Online purchasing under uncertainty
Random Structures & Algorithms | 2018-09-25 | Paper |
A greedy algorithm for finding a large 2‐matching on a random cubic graph
Journal of Graph Theory | 2018-08-16 | Paper |
The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
SIAM Journal on Discrete Mathematics | 2018-08-15 | Paper |
Packing Hamilton cycles online
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
Elegantly colored paths and cycles in edge colored random graphs
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
On the insertion time of random walk cuckoo hashing
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On rainbow Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2018-06-27 | Paper |
On rainbow Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2018-06-27 | Paper |
On the rank of a random binary matrix
(available as arXiv preprint) | 2018-06-13 | Paper |
Constraining the clustering transition for colorings of sparse random graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Constraining the clustering transition for colorings of sparse random graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
Combinatorics, Probability and Computing | 2018-05-24 | Paper |
On the trace of random walks on random graphs
Proceedings of the London Mathematical Society | 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
Information Processing Letters | 2017-12-13 | Paper |
Greedy algorithms for the shortest common superstring that are asymtotically optimal
Algorithms — ESA '96 | 2017-12-05 | Paper |
| scientific article; zbMATH DE number 6797624 (Why is no real title available?) | 2017-10-25 | Paper |
Separating subadditive Euclidean functionals
Random Structures & Algorithms | 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
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
On the length of a random minimum spanning tree
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2017-09-29 | Paper |
| Component structure of the vacant set induced by a random walk on a random graph | 2017-09-29 | Paper |
Separating subadditive Euclidean functionals
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Randomly coloring simple hypergraphs with fewer colors
Information Processing Letters | 2017-06-30 | Paper |
Looking for vertex number one
The Annals of Applied Probability | 2017-05-03 | Paper |
On random \(k\)-out subgraphs of large graphs
Random Structures & Algorithms | 2017-04-18 | Paper |
Minimum cost matching in a random graph with random costs
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
| Cover time of a random graph with given degree sequence | 2017-02-10 | Paper |
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
| Square of a Hamilton cycle in a random graph | 2016-11-20 | Paper |
Rainbow arborescence in random digraphs
Journal of Graph Theory | 2016-11-16 | Paper |
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
| Square of Hamilton cycle in a random graph | 2016-06-24 | Paper |
Rainbow matchings and Hamilton cycles in random graphs
Random Structures & Algorithms | 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
Moscow Journal of Combinatorics and Number Theory | 2016-04-13 | Paper |
Vacant sets and vacant nets: component structures induced by a random walk
SIAM Journal on Discrete Mathematics | 2016-02-05 | Paper |
Rainbow connection of random regular graphs
SIAM Journal on Discrete Mathematics | 2015-11-18 | Paper |
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
Random Structures & Algorithms | 2015-10-12 | Paper |
| Introduction to Random Graphs | 2015-10-05 | Paper |
Walker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
On-line list colouring of random graphs
The Electronic Journal of Combinatorics | 2015-08-26 | Paper |
On-line list colouring of random graphs
The Electronic Journal of Combinatorics | 2015-08-26 | Paper |
Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two.
Random Structures & Algorithms | 2015-06-22 | Paper |
Maker-breaker games on random geometric graphs
Random Structures & Algorithms | 2015-06-22 | Paper |
The height of random k‐trees and related branching processes
Random Structures & Algorithms | 2015-06-22 | Paper |
On the chromatic number of a random hypergraph
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
Random triangle removal
Advances in Mathematics | 2015-05-29 | Paper |
Efficient algorithms for three‐dimensional axial and planar random assignment problems
Random Structures & Algorithms | 2015-02-20 | Paper |
Efficient algorithms for three‐dimensional axial and planar random assignment problems
Random Structures & Algorithms | 2015-02-20 | Paper |
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Between 2- and 3-colorability
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Between 2- and 3-colorability
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
| Line-of-sight networks | 2014-12-18 | Paper |
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
Random Structures & Algorithms | 2014-11-17 | Paper |
Analyzing Walksat on random formulas
SIAM Journal on Computing | 2014-11-14 | Paper |
| On the random 2-stage minimum spanning tree | 2014-10-13 | Paper |
| The cover time of two classes of random graphs | 2014-10-13 | Paper |
| The influence of search engines on preferential attachment | 2014-10-13 | Paper |
| Adversarial deletion in a scale free random graph process | 2014-10-13 | Paper |
The \(t\)-tone chromatic number of random graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
The topology of competitively constructed graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
The topology of competitively constructed graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Expanders via Random Spanning Trees
SIAM Journal on Computing | 2014-07-30 | Paper |
| scientific article; zbMATH DE number 6303032 (Why is no real title available?) | 2014-06-11 | Paper |
Rainbow Hamilton cycles in random graphs
Random Structures & Algorithms | 2014-05-13 | Paper |
Approximate counting of regular hypergraphs
Information Processing Letters | 2014-04-14 | Paper |
On the non-planarity of a random subgraph
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science | 2014-01-13 | Paper |
On a sparse random graph with minimum degree three: likely Pósa sets are large
Journal of Combinatorics | 2013-11-05 | Paper |
On a sparse random graph with minimum degree three: likely Pósa sets are large
Journal of Combinatorics | 2013-11-05 | Paper |
Randomly coloring constant degree graphs
Random Structures & Algorithms | 2013-10-09 | Paper |
On the game chromatic number of sparse random graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Rainbow connection of sparse random graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Tight Hamilton cycles in random uniform hypergraphs
Random Structures & Algorithms | 2013-05-28 | Paper |
Separating populations with wide data: a spectral analysis
Electronic Journal of Statistics | 2013-05-27 | Paper |
Randomly coloring simple hypergraphs
Information Processing Letters | 2013-04-04 | Paper |
Component structure of the vacant set induced by a random walk on a random graph
Random Structures & Algorithms | 2013-03-12 | Paper |
Rainbow connectivity of sparse random graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
Random Structures & Algorithms | 2012-10-31 | Paper |
Cops and robbers on geometric graphs
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
| A new approach to the planted clique problem | 2012-10-19 | Paper |
Cover time of a random graph with given degree sequence
Discrete Mathematics | 2012-10-16 | Paper |
Packing tight Hamilton cycles in uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Packing Hamilton cycles in random and pseudo-random hypergraphs
Random Structures & Algorithms | 2012-08-30 | Paper |
On certain properties of random Apollonian networks
Lecture Notes in Computer Science | 2012-07-23 | Paper |
Some Typical Properties of the Spatial Preferred Attachment Model
Lecture Notes in Computer Science | 2012-07-23 | Paper |
Variations on cops and robbers
Journal of Graph Theory | 2012-06-13 | Paper |
Rainbow Hamilton cycles in uniform hypergraphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Packing tight Hamilton cycles in 3-uniform hypergraphs
Random Structures & Algorithms | 2012-05-14 | Paper |
Stationary distribution and cover time of random walks on random digraphs
Journal of Combinatorial Theory. Series B | 2012-05-04 | Paper |
Hypergraphs with independent neighborhoods
Combinatorica | 2011-12-19 | Paper |
Karp-Sipser on random graphs with a fixed degree sequence
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
| Random greedy triangle-packing beyond the 7/4 barrier | 2011-08-08 | Paper |
An analysis of random-walk cuckoo hashing
SIAM Journal on Computing | 2011-07-29 | Paper |
A note on the random greedy triangle-packing algorithm
Journal of Combinatorics | 2011-06-27 | Paper |
Flips in graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Random walks with look-ahead in scale-free random graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Loose Hamilton cycles in random uniform hypergraphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Loose Hamilton cycles in random uniform hypergraphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Loose Hamilton cycles in random uniform hypergraphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The cover time of random geometric graphs
Random Structures & Algorithms | 2011-05-11 | Paper |
Hamilton cycles in random graphs with a fixed degree sequence
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Ramsey games with giants
Random Structures & Algorithms | 2011-01-17 | Paper |
An efficient sparse regularity concept
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Multiple random walks in random regular graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Randomly coloring random graphs
Random Structures & Algorithms | 2010-11-10 | Paper |
Coloring \(H\)-free hypergraphs
Random Structures & Algorithms | 2010-11-10 | Paper |
Hamilton cycles in 3-out
Random Structures & Algorithms | 2010-11-09 | Paper |
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Crawling on web graphs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Finding a maximum matching in a sparse random graph in O ( n ) expected time
Journal of the ACM | 2010-07-14 | Paper |
Loose Hamilton cycles in random 3-uniform hypergraphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Loose Hamilton cycles in random 3-uniform hypergraphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Loose Hamilton cycles in random 3-uniform hypergraphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Memoryless rules for Achlioptas processes
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Lecture Notes in Computer Science | 2010-05-26 | Paper |
High degree vertices and eigenvalues in the preferential attachment graph
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Line-of-Sight Networks
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Anti-Ramsey properties of random graphs
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Average-Case Analyses of Vickrey Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
An Analysis of Random-Walk Cuckoo Hashing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Multiple Random Walks and Interacting Particle Systems
Automata, Languages and Programming | 2009-07-14 | Paper |
Hamilton Cycles in Random Lifts of Directed Graphs
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
A Geometric Preferential Attachment Model of Networks II
Internet Mathematics | 2009-04-28 | Paper |
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439
Random Structures & Algorithms | 2009-04-08 | Paper |
On rainbow trees and cycles
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On rainbow trees and cycles
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On the chromatic number of simple triangle-free triple systems
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The Cover Time of Random Digraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5485592 (Why is no real title available?) | 2009-01-05 | Paper |
Game chromatic index of graphs with given restrictions on degrees
Theoretical Computer Science | 2008-11-18 | Paper |
On two Hamilton cycle problems in random graphs
Israel Journal of Mathematics | 2008-10-16 | Paper |
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
Automata, Languages and Programming | 2008-08-28 | Paper |
The cover time of the giant component of a random graph
Random Structures & Algorithms | 2008-07-21 | Paper |
| Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION | 2008-06-02 | Paper |
| scientific article; zbMATH DE number 5279368 (Why is no real title available?) | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 5279368 (Why is no real title available?) | 2008-05-27 | Paper |
Separating Populations with Wide Data: A Spectral Analysis
Algorithms and Computation | 2008-05-27 | Paper |
The Influence of Search Engines on Preferential Attachment
Internet Mathematics | 2008-04-29 | Paper |
A Geometric Preferential Attachment Model of Networks II
Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
The game chromatic number of random graphs
Random Structures & Algorithms | 2008-03-28 | Paper |
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM | 2008-01-14 | Paper |
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
SIAM Journal on Computing | 2007-10-22 | Paper |
A Geometric Preferential Attachment Model of Networks
Internet Mathematics | 2007-08-20 | Paper |
Random 2-SAT with prescribed literal degrees
Algorithmica | 2007-08-20 | Paper |
Adversarial Deletion in a Scale-Free Random Graph Process
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Product rule wins a competitive game
Proceedings of the American Mathematical Society | 2007-07-27 | Paper |
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms | 2007-07-18 | Paper |
| A survey on the use of Markov chains to randomly sample colourings | 2007-06-28 | Paper |
First-Order Definability of Trees and Sparse Random Graphs
Combinatorics, Probability and Computing | 2007-05-15 | Paper |
Codes identifying sets of vertices in random networks
Discrete Mathematics | 2007-03-15 | Paper |
The cover time of the preferential attachment graph
Journal of Combinatorial Theory. Series B | 2007-02-13 | Paper |
Randomly generated intersecting hypergraphs II
Random Structures & Algorithms | 2007-02-07 | Paper |
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms | 2007-02-07 | Paper |
The cover time of sparse random graphs
Random Structures & Algorithms | 2007-02-07 | Paper |
Hamilton cycles in random lifts of graphs
European Journal of Combinatorics | 2006-11-15 | Paper |
Almost universal graphs
Random Structures & Algorithms | 2006-09-06 | Paper |
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms | 2006-06-06 | Paper |
The Strong Chromatic Index of Random Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
On the random 2-stage minimum spanning tree
Random Structures & Algorithms | 2006-03-24 | Paper |
Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
Combinatorica | 2006-01-26 | Paper |
The Game of JumbleG
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
On Random Symmetric Travelling Salesman Problems
Mathematics of Operations Research | 2005-11-11 | Paper |
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
Internet Mathematics | 2005-10-27 | Paper |
The Cover Time of Random Regular Graphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Perfect matchings in random bipartite graphs with minimal degree at least 2
Random Structures & Algorithms | 2005-06-01 | Paper |
Crawling on Simple Models of Web Graphs
Internet Mathematics | 2005-05-09 | Paper |
On packing Hamilton cycles in \(\varepsilon\)-regular graphs
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
Random Deletion in a Scale-Free Random Graph Process
Internet Mathematics | 2005-05-03 | Paper |
Clustering large graphs via the singular value decomposition
Machine Learning | 2005-01-19 | Paper |
| scientific article; zbMATH DE number 2127722 (Why is no real title available?) | 2005-01-14 | Paper |
| scientific article; zbMATH DE number 2119677 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119678 (Why is no real title available?) | 2004-11-29 | Paper |
Efficient communication in an ad-hoc network
Journal of Algorithms | 2004-11-23 | Paper |
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
On the $b$ -Independence Number of Sparse Random Graphs
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2079334 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079333 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2064410 (Why is no real title available?) | 2004-05-18 | Paper |
Adding random edges to dense graphs
Random Structures & Algorithms | 2004-03-29 | Paper |
The emergence of a giant component in random subgraphs of pseudo-random graphs
Random Structures & Algorithms | 2004-02-03 | Paper |
Randomly coloring graphs with lower bounds on girth and maximum degree
Random Structures & Algorithms | 2003-11-10 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM | 2003-06-25 | Paper |
Arc-Disjoint Paths in Expander Digraphs
SIAM Journal on Computing | 2003-06-19 | Paper |
A general model of web graphs
Random Structures & Algorithms | 2003-05-11 | Paper |
On graph irregularity strength
Journal of Graph Theory | 2003-03-19 | Paper |
How many random edges make a dense graph hamiltonian?
Random Structures & Algorithms | 2003-03-19 | Paper |
| scientific article; zbMATH DE number 1875439 (Why is no real title available?) | 2003-03-02 | Paper |
Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
Combinatorics, Probability and Computing | 2003-02-11 | Paper |
Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
Combinatorics, Probability and Computing | 2003-01-05 | Paper |
Hamilton cycles in random subgraphs of pseudo-random graphs
Discrete Mathematics | 2002-12-02 | Paper |
\(G\)-intersecting families
Combinatorics, Probability and Computing | 2002-11-24 | Paper |
Addendum to ‘avoiding a giant component’
Random Structures & Algorithms | 2002-11-17 | Paper |
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
Combinatorics, Probability and Computing | 2002-11-12 | Paper |
| scientific article; zbMATH DE number 1139976 (Why is no real title available?) | 2002-11-11 | Paper |
On Counting Independent Sets in Sparse Graphs
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1775418 (Why is no real title available?) | 2002-09-17 | Paper |
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
Mathematical Programming. Series A. Series B | 2002-06-12 | Paper |
Avoiding a giant component
Random Structures & Algorithms | 2002-06-06 | Paper |
Vertex covers by edge disjoint cliques
Combinatorica | 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
Journal of Mathematical Physics | 2001-08-30 | Paper |
On Markov chains for randomly \(H\)-coloring a graph
Journal of Algorithms | 2001-07-29 | Paper |
Edge-disjoint paths in expander graphs
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1496581 (Why is no real title available?) | 2001-03-07 | Paper |
| scientific article; zbMATH DE number 1559568 (Why is no real title available?) | 2001-02-28 | Paper |
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing | 2001-01-23 | Paper |
| The probabilistic relationship between the assignment and asymmetric traveling salesman problems. | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1416161 (Why is no real title available?) | 2000-12-12 | Paper |
On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
The Electronic Journal of Combinatorics | 2000-11-30 | Paper |
On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
The Electronic Journal of Combinatorics | 2000-11-30 | Paper |
Splitting an Expander Graph
Journal of Algorithms | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1369837 (Why is no real title available?) | 2000-10-05 | Paper |
A note on random minimum length spanning trees
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
A note on random minimum length spanning trees
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
Min-wise independent permutations
Journal of Computer and System Sciences | 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
The Electronic Journal of Combinatorics | 2000-05-11 | Paper |
min-wise independent linear permutations
The Electronic Journal of Combinatorics | 2000-05-11 | Paper |
| scientific article; zbMATH DE number 1445370 (Why is no real title available?) | 2000-05-10 | Paper |
A note on sparse random graphs and cover graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
A note on sparse random graphs and cover graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
Log-Sobolev inequalities and sampling from log-concave distributions
The Annals of Applied Probability | 2000-02-07 | Paper |
| scientific article; zbMATH DE number 1380616 (Why is no real title available?) | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1301961 (Why is no real title available?) | 1999-12-13 | Paper |
Quick approximation to matrices and applications
Combinatorica | 1999-12-08 | Paper |
| scientific article; zbMATH DE number 1305424 (Why is no real title available?) | 1999-09-15 | Paper |
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
Average-case analysis of the merging algorithm of Hwang and Lin
Algorithmica | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1305418 (Why is no real title available?) | 1999-06-17 | Paper |
Random minimum length spanning trees in regular graphs
Combinatorica | 1999-05-18 | Paper |
A simple algorithm for constructing Szemerédi's regularity partition
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
A simple algorithm for constructing Szemerédi's regularity partition
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
| scientific article; zbMATH DE number 1246226 (Why is no real title available?) | 1999-01-27 | Paper |
A polynomial-time algorithm for learning noisy linear threshold functions
Algorithmica | 1998-11-11 | Paper |
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing | 1998-09-21 | Paper |
Approximately Counting Hamilton Paths and Cycles in Dense Graphs
SIAM Journal on Computing | 1998-09-20 | Paper |
Greedy algorithms for the shortest common superstring that are asymptotically optimal
Algorithmica | 1998-05-24 | Paper |
| scientific article; zbMATH DE number 1003244 (Why is no real title available?) | 1998-01-25 | Paper |
Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
Algorithmica | 1997-10-09 | Paper |
| scientific article; zbMATH DE number 986986 (Why is no real title available?) | 1997-08-19 | Paper |
| scientific article; zbMATH DE number 1047719 (Why is no real title available?) | 1997-08-11 | Paper |
| scientific article; zbMATH DE number 1003293 (Why is no real title available?) | 1997-08-03 | Paper |
| scientific article; zbMATH DE number 1003265 (Why is no real title available?) | 1997-04-23 | Paper |
Perfect Matchings in Random r-regular, s-uniform Hypergraphs
Combinatorics, Probability and Computing | 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
Information Processing Letters | 1997-02-27 | Paper |
Generating and Counting Hamilton Cycles in Random Regular Graphs
Journal of Algorithms | 1996-12-16 | Paper |
| scientific article; zbMATH DE number 871922 (Why is no real title available?) | 1996-12-11 | Paper |
On the Connectivity of Random k-th Nearest Neighbour Graphs
Combinatorics, Probability and Computing | 1996-09-29 | Paper |
Perfect matchings in random s‐uniform hypergraphs
Random Structures & Algorithms | 1996-06-05 | Paper |
Covering the edges of a random graph by cliques
Combinatorica | 1996-06-05 | Paper |
On the Best Case of Heapsort
Journal of Algorithms | 1996-06-04 | Paper |
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
Random Structures & Algorithms | 1996-05-28 | Paper |
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
Journal of Algorithms | 1996-05-06 | Paper |
When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
SIAM Journal on Computing | 1996-03-18 | Paper |
Probabilistic analysis of an algorithm in the theory of markets in indivisible goods
The Annals of Applied Probability | 1996-03-12 | Paper |
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
The Electronic Journal of Combinatorics | 1995-10-19 | Paper |
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold
The Electronic Journal of Combinatorics | 1995-10-19 | Paper |
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
Combinatorics, Probability and Computing | 1995-08-27 | Paper |
An analysis of Monte Carlo algorithm for estimating the permanent
Combinatorica | 1995-07-23 | Paper |
| scientific article; zbMATH DE number 747034 (Why is no real title available?) | 1995-07-23 | Paper |
Sampling from log-concave distributions
The Annals of Applied Probability | 1995-05-30 | Paper |
Multicoloured Hamilton cycles
The Electronic Journal of Combinatorics | 1995-05-22 | Paper |
Multicoloured Hamilton cycles
The Electronic Journal of Combinatorics | 1995-05-22 | Paper |
Randomized greedy matching. II
Random Structures & Algorithms | 1995-05-09 | Paper |
Broadcasting in random graphs
Discrete Applied Mathematics | 1995-05-03 | Paper |
Finding hidden hamiltonian cycles
Random Structures & Algorithms | 1995-03-20 | Paper |
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
SIAM Journal on Computing | 1995-03-09 | Paper |
On key storage in secure networks
Journal of Cryptology | 1995-01-01 | Paper |
On the independence number of random cubic graphs
Random Structures & Algorithms | 1994-12-11 | Paper |
| scientific article; zbMATH DE number 437557 (Why is no real title available?) | 1994-11-29 | Paper |
Near‐perfect token distribution
Random Structures & Algorithms | 1994-11-08 | Paper |
On the complexity of computing the diameter of a polytope
Computational Complexity | 1994-10-30 | Paper |
Hamilton Cycles in Random Regular Digraphs
Combinatorics, Probability and Computing | 1994-10-24 | Paper |
Multicolored trees in random graphs
Random Structures & Algorithms | 1994-09-15 | Paper |
Hamilton cycles in a class of random directed graphs
Journal of Combinatorial Theory. Series B | 1994-09-13 | Paper |
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM | 1994-08-21 | Paper |
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
Mathematical Programming. Series A. Series B | 1994-08-10 | Paper |
On Subgraph Sizes in Random Graphs
Combinatorics, Probability and Computing | 1994-08-10 | Paper |
On the problem of approximating the number of bases of a matroid
Information Processing Letters | 1994-05-26 | Paper |
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
Combinatorics, Probability and Computing | 1994-04-28 | Paper |
| scientific article; zbMATH DE number 437559 (Why is no real title available?) | 1993-12-15 | Paper |
The average performance of the greedy matching algorithm
The Annals of Applied Probability | 1993-10-28 | Paper |
Polychromatic Hamilton cycles
Discrete Mathematics | 1993-10-17 | Paper |
Probabilistic analysis of the generalised assignment problem
Mathematical Programming. Series A. Series B | 1992-12-17 | Paper |
Counting the Number of Hamilton Cycles in Random Digraphs
Random Structures & Algorithms | 1992-10-18 | Paper |
| scientific article; zbMATH DE number 68367 (Why is no real title available?) | 1992-10-06 | Paper |
On the independence and chromatic numbers of random regular graphs
Journal of Combinatorial Theory. Series B | 1992-06-28 | Paper |
On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph
Random Structures & Algorithms | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17673 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17674 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17675 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 18983 (Why is no real title available?) | 1992-06-26 | Paper |
Spanning maximal planar subgraphs of random graphs
Random Structures & Algorithms | 1992-06-25 | Paper |
On the length of the longest monotone subsequence in a random permutation
The Annals of Applied Probability | 1992-06-25 | Paper |
Edge disjoint spanning trees in random graphs
Periodica Mathematica Hungarica | 1992-06-25 | Paper |
On patching algorithms for random asymmetric travelling salesman problems
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Randomized greedy matching
Random Structures & Algorithms | 1992-06-25 | Paper |
Occupancy problems and random algebras
Discrete Mathematics | 1991-01-01 | Paper |
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph
Random Structures & Algorithms | 1991-01-01 | Paper |
The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4205985 (Why is no real title available?) | 1990-01-01 | Paper |
On the independence number of random graphs
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4193709 (Why is no real title available?) | 1990-01-01 | Paper |
Greedy Matching on the Line
SIAM Journal on Computing | 1990-01-01 | Paper |
On an optimization problem with nested constraints
Discrete Applied Mathematics | 1990-01-01 | Paper |
Probabilistic analysis of a parallel algorithm for finding maximal independent sets
Random Structures & Algorithms | 1990-01-01 | Paper |
Survival time of a random graph
Combinatorica | 1989-01-01 | Paper |
A new integer programming formulation for the permutation flowshop problem
European Journal of Operational Research | 1989-01-01 | Paper |
The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms | 1989-01-01 | Paper |
On random minimum length spanning trees
Combinatorica | 1989-01-01 | Paper |
A randomized algorithm for fixed-dimensional linear programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the number of hamilton cycles in a random graph
Journal of Graph Theory | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4114681 (Why is no real title available?) | 1989-01-01 | Paper |
Random graph orders
Order | 1989-01-01 | Paper |
Probabilistic Analysis of the Multidimensional Knapsack Problem
Mathematics of Operations Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4087714 (Why is no real title available?) | 1988-01-01 | Paper |
Finding Hamilton cycles in sparse random graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
Partitioning random graphs into large cycles
Discrete Mathematics | 1988-01-01 | Paper |
On the random construction of heaps
Information Processing Letters | 1988-01-01 | Paper |
Edge-colouring random graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
On the Complexity of Computing the Volume of a Polyhedron
SIAM Journal on Computing | 1988-01-01 | Paper |
An algorithm for finding hamilton cycles in random directed graphs
Journal of Algorithms | 1988-01-01 | Paper |
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
SIAM Journal on Computing | 1988-01-01 | Paper |
Large induced trees in sparse random graphs
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
Parallel algorithms for finding Hamilton cycles in random graphs
Information Processing Letters | 1987-01-01 | Paper |
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
SIAM Journal on Computing | 1987-01-01 | Paper |
Large holes in sparse random graphs
Combinatorica | 1987-01-01 | Paper |
An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4059455 (Why is no real title available?) | 1987-01-01 | Paper |
Planar 3DM is NP-complete
Journal of Algorithms | 1986-01-01 | Paper |
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
SIAM Journal on Computing | 1986-01-01 | Paper |
On linear programs with random costs
Mathematical Programming | 1986-01-01 | Paper |
Expected Behaviour of Line-Balancing Heuristics
IMA Journal of Management Mathematics | 1986-01-01 | Paper |
A probabilistic analysis of the next fit decreasing bin packing heuristic
Operations Research Letters | 1986-01-01 | Paper |
On large matchings and cycles in sparse random graphs
Discrete Mathematics | 1986-01-01 | Paper |
Maximum matchings in a class of random graphs
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
BIT | 1985-01-01 | Paper |
A simple heuristic for the p-centre problem
Operations Research Letters | 1985-01-01 | Paper |
On the complexity of partitioning graphs into connected subgraphs
Discrete Applied Mathematics | 1985-01-01 | Paper |
The shortest-path problem for graphs with random arc-lengths
Discrete Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3950585 (Why is no real title available?) | 1985-01-01 | Paper |
On the value of a random minimum spanning tree problem
Discrete Applied Mathematics | 1985-01-01 | Paper |
Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
European Journal of Combinatorics | 1985-01-01 | Paper |
Analysis of heuristics for finding a maximum weight planar subgraph
European Journal of Operational Research | 1985-01-01 | Paper |
Hamiltonian cycles in random regular graphs
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3916307 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3889547 (Why is no real title available?) | 1984-01-01 | Paper |
Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
European Journal of Operational Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3906194 (Why is no real title available?) | 1984-01-01 | Paper |
A partitioning algorithm for minimum weighted Euclidean matching
Information Processing Letters | 1984-01-01 | Paper |
Partitioning heuristics for two geometric maximization problems
Operations Research Letters | 1984-01-01 | Paper |
On the quadratic assignment problem
Discrete Applied Mathematics | 1983-01-01 | Paper |
Complexity of a 3-dimensional assignment problem
European Journal of Operational Research | 1983-01-01 | Paper |
On the existence of Hamiltonian cycles in a class of random graphs
Discrete Mathematics | 1983-01-01 | Paper |
An extension of Christofides heuristic to the k-person travelling salesman problem
Discrete Applied Mathematics | 1983-01-01 | Paper |
Algebraic Linear Programming
Mathematics of Operations Research | 1982-01-01 | Paper |
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
Networks | 1982-01-01 | Paper |
On the connectivity of random m-orientable graphs and digraphs
Combinatorica | 1982-01-01 | Paper |
An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
The Journal of the Operational Research Society | 1981-01-01 | Paper |
Probabilistic analysis of some Euclidean clustering problems
Discrete Applied Mathematics | 1980-01-01 | Paper |
An algorithm for algebraic assignment problems
Discrete Applied Mathematics | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3630482 (Why is no real title available?) | 1979-01-01 | Paper |
A Partitioned Inverse in Linear Programming
The Journal of the Operational Research Society | 1978-01-01 | Paper |
Minimum Paths in Directed Graphs
The Journal of the Operational Research Society | 1977-01-01 | Paper |
Shortest path algorithms for knapsack type problems
Mathematical Programming | 1976-01-01 | Paper |
Bottleneck Linear Programming
The Journal of the Operational Research Society | 1975-01-01 | Paper |
A bilinear programming formulation of the 3-dimensional assignment problem
Mathematical Programming | 1974-01-01 | Paper |
A cost function property for plant location problems
Mathematical Programming | 1974-01-01 | Paper |
Karp's patching algorithm on random perturbations of dense digraphs
(available as arXiv preprint) | N/A | Paper |
On the intersecting family process
(available as arXiv preprint) | N/A | Paper |
Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
(available as arXiv preprint) | N/A | Paper |
A note on the chromatic number of the square of a sparse random gra
(available as arXiv preprint) | N/A | Paper |
Diffusion limited aggregation in the layers model
(available as arXiv preprint) | N/A | Paper |
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
(available as arXiv preprint) | N/A | Paper |
The maximum degree of the $r$th power of a sparse random graph
(available as arXiv preprint) | N/A | Paper |
