Found: 107
Select item for more details and to access through your institution.
Packing Hamilton Cycles Online.
- Published in:
- Combinatorics, Probability & Computing, 2018, v. 27, n. 4, p. 475, doi. 10.1017/S0963548318000159
- By:
- Publication type:
- Article
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph.
- Published in:
- Combinatorics, Probability & Computing, 2018, v. 27, n. 2, p. 228, doi. 10.1017/S0963548317000426
- By:
- Publication type:
- Article
On the Length of a Random Minimum Spanning Tree.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 1, p. 89, doi. 10.1017/S0963548315000024
- By:
- Publication type:
- Article
On the Non-Planarity of a Random Subgraph.
- Published in:
- Combinatorics, Probability & Computing, 2013, v. 22, n. 5, p. 722, doi. 10.1017/S0963548313000308
- By:
- Publication type:
- Article
Cops and Robbers on Geometric Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2012, v. 21, n. 6, p. 816, doi. 10.1017/S0963548312000338
- By:
- Publication type:
- Article
Karp–Sipser on Random Graphs with a Fixed Degree Sequence.
- Published in:
- Combinatorics, Probability & Computing, 2011, v. 20, n. 5, p. 721, doi. 10.1017/S0963548311000265
- By:
- Publication type:
- Article
Line-of-Sight Networks.
- Published in:
- Combinatorics, Probability & Computing, 2009, v. 18, n. 1/2, p. 145, doi. 10.1017/S0963548308009334
- By:
- Publication type:
- Article
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 5, p. 733, doi. 10.1017/S0963548306008388
- By:
- Publication type:
- Article
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 5, p. 713, doi. 10.1017/S096354830600798X
- By:
- Publication type:
- Article
First-Order Definability of Trees and Sparse Random Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 3, p. 375, doi. 10.1017/S0963548306008376
- By:
- Publication type:
- Article
Adversarial Deletion in a Scale-Free Random Graph Process.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 2, p. 261, doi. 10.1017/S0963548306007681
- By:
- Publication type:
- Article
The Game of JumbleG.
- Published in:
- Combinatorics, Probability & Computing, 2005, v. 14, n. 5/6, p. 783, doi. 10.1017/s0963548305006851
- By:
- Publication type:
- Article
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence.
- Published in:
- Combinatorics, Probability & Computing, 2004, v. 13, n. 3, p. 319, doi. 10.1017/s096354830400611x
- By:
- Publication type:
- Article
On the b-Independence Number of Sparse Random Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2004, v. 13, n. 3, p. 295, doi. 10.1017/s0963548304006108
- By:
- Publication type:
- Article
Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2002, v. 11, n. 2, p. 129, doi. 10.1017/S0963548301005004
- By:
- Publication type:
- Article
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2000, v. 9, n. 3, p. 241, doi. 10.1017/s0963548300004284
- By:
- Publication type:
- Article
Perfect Matchings in Random r-regular, s-uniform Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 1996, v. 5, n. 1, p. 1, doi. 10.1017/S0963548300001796
- By:
- Publication type:
- Article
On the Connectivity of Random k-th Nearest Neighbour Graphs.
- Published in:
- Combinatorics, Probability & Computing, 1995, v. 4, n. 4, p. 343, doi. 10.1017/S0963548300001711
- By:
- Publication type:
- Article
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
- Published in:
- Combinatorics, Probability & Computing, 1995, v. 4, n. 1, p. 47, doi. 10.1017/S0963548300001474
- By:
- Publication type:
- Article
Hamilton Cycles in Random Regular Digraphs.
- Published in:
- Combinatorics, Probability & Computing, 1994, v. 3, n. 1, p. 39, doi. 10.1017/S096354830000095X
- By:
- Publication type:
- Article
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
- Published in:
- Combinatorics, Probability & Computing, 1993, v. 2, n. 3, p. 271, doi. 10.1017/S0963548300000675
- By:
- Publication type:
- Article
On the trace of random walks on random graphs.
- Published in:
- Proceedings of the London Mathematical Society, 2018, v. 116, n. 4, p. 1, doi. 10.1112/plms.12083
- By:
- Publication type:
- Article
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint.
- Published in:
- Mathematics of Operations Research, 2022, v. 47, n. 2, p. 1664, doi. 10.1287/moor.2021.1184
- By:
- Publication type:
- Article
On Random Symmetric Travelling Salesman Problems.
- Published in:
- Mathematics of Operations Research, 2004, v. 29, n. 4, p. 878, doi. 10.1287/moor.1040.0105
- By:
- Publication type:
- Article
PROBABILISTIC ANALYSIS OF A RELAXATION FOR THE k-MEDIAN PROBLEM.
- Published in:
- Mathematics of Operations Research, 1988, v. 13, n. 1, p. 1, doi. 10.1287/moor.13.1.1
- By:
- Publication type:
- Article
CORRIGENDUM: ALGEBRAIC LINEAR PROGRAMMING.
- Published in:
- 1983
- By:
- Publication type:
- Correction Notice
Rainbow Hamilton cycles in random geometric graphs.
- Published in:
- Random Structures & Algorithms, 2024, v. 64, n. 4, p. 878, doi. 10.1002/rsa.21201
- By:
- Publication type:
- Article
A scaling limit for the length of the longest cycle in a sparse random digraph.
- Published in:
- Random Structures & Algorithms, 2022, v. 60, n. 1, p. 3, doi. 10.1002/rsa.21030
- By:
- Publication type:
- Article
Finding maximum matchings in random regular graphs in linear expected time.
- Published in:
- Random Structures & Algorithms, 2021, v. 58, n. 3, p. 390, doi. 10.1002/rsa.20980
- By:
- Publication type:
- Article
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis.
- Published in:
- Random Structures & Algorithms, 2020, v. 57, n. 4, p. 865, doi. 10.1002/rsa.20978
- By:
- Publication type:
- Article
On the connectivity of proper colorings of random graphs and hypergraphs.
- Published in:
- Random Structures & Algorithms, 2020, v. 56, n. 4, p. 988, doi. 10.1002/rsa.20912
- By:
- Publication type:
- Article
Minors of a random binary matroid.
- Published in:
- Random Structures & Algorithms, 2019, v. 55, n. 4, p. 865, doi. 10.1002/rsa.20881
- By:
- Publication type:
- Article
Traveling in randomly embedded random graphs.
- Published in:
- Random Structures & Algorithms, 2019, v. 55, n. 3, p. 649, doi. 10.1002/rsa.20832
- By:
- Publication type:
- Article
Notes on growing a tree in a graph.
- Published in:
- Random Structures & Algorithms, 2019, v. 55, n. 2, p. 290, doi. 10.1002/rsa.20828
- By:
- Publication type:
- Article
On the insertion time of random walk cuckoo hashing.
- Published in:
- Random Structures & Algorithms, 2019, v. 54, n. 4, p. 721, doi. 10.1002/rsa.20808
- By:
- Publication type:
- Article
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
- Published in:
- Random Structures & Algorithms, 2019, v. 54, n. 2, p. 258, doi. 10.1002/rsa.20778
- By:
- Publication type:
- Article
A note on dispersing particles on a line.
- Published in:
- Random Structures & Algorithms, 2018, v. 53, n. 4, p. 586, doi. 10.1002/rsa.20821
- By:
- Publication type:
- Article
Online purchasing under uncertainty.
- Published in:
- Random Structures & Algorithms, 2018, v. 53, n. 2, p. 327, doi. 10.1002/rsa.20764
- By:
- Publication type:
- Article
Separating subadditive euclidean functionals.
- Published in:
- Random Structures & Algorithms, 2017, v. 51, n. 3, p. 375, doi. 10.1002/rsa.20706
- By:
- Publication type:
- Article
On random k-out subgraphs of large graphs.
- Published in:
- Random Structures & Algorithms, 2017, v. 50, n. 2, p. 143, doi. 10.1002/rsa.20650
- By:
- Publication type:
- Article
Rainbow Matchings and Hamilton Cycles in Random Graphs.
- Published in:
- Random Structures & Algorithms, 2016, v. 48, n. 3, p. 503, doi. 10.1002/rsa.20594
- By:
- Publication type:
- Article
The height of random k-trees and related branching processes.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 4, p. 675, doi. 10.1002/rsa.20576
- By:
- Publication type:
- Article
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three.
- Published in:
- Random Structures & Algorithms, 2015, v. 47, n. 1, p. 73, doi. 10.1002/rsa.20542
- By:
- Publication type:
- Article
Efficient Algorithms for Three-Dimensional Axial and Planar Random Assignment Problems.
- Published in:
- Random Structures & Algorithms, 2015, v. 46, n. 1, p. 160, doi. 10.1002/rsa.20525
- By:
- Publication type:
- Article
Maker-breaker games on random geometric graphs.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 4, p. 553, doi. 10.1002/rsa.20572
- By:
- Publication type:
- Article
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 4, p. 627, doi. 10.1002/rsa.20573
- By:
- Publication type:
- Article
Tight Hamilton cycles in random uniform hypergraphs.
- Published in:
- Random Structures & Algorithms, 2013, v. 42, n. 3, p. 374, doi. 10.1002/rsa.20404
- By:
- Publication type:
- Article
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three.
- Published in:
- Random Structures & Algorithms, 2014, v. 45, n. 3, p. 443, doi. 10.1002/rsa.20482
- By:
- Publication type:
- Article
Rainbow hamilton cycles in random graphs.
- Published in:
- Random Structures & Algorithms, 2014, v. 44, n. 3, p. 328, doi. 10.1002/rsa.20475
- By:
- Publication type:
- Article
Randomly coloring constant degree graphs.
- Published in:
- Random Structures & Algorithms, 2013, v. 43, n. 2, p. 181, doi. 10.1002/rsa.20451
- By:
- Publication type:
- Article