Found: 106
Select item for more details and to access through your institution.
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 powers of a Hamilton cycle in G<sub>n,p</sub>.
- Published in:
- Journal of Graph Theory, 2024, v. 105, n. 4, p. 491, doi. 10.1002/jgt.23054
- By:
- Publication type:
- Article
Spanners in randomly weighted graphs: Euclidean case.
- Published in:
- Journal of Graph Theory, 2023, v. 104, n. 1, p. 87, doi. 10.1002/jgt.22950
- By:
- Publication type:
- Article
Maker Breaker on digraphs.
- Published in:
- Journal of Graph Theory, 2021, v. 98, n. 4, p. 653, doi. 10.1002/jgt.22719
- By:
- Publication type:
- Article
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
- Published in:
- Journal of Graph Theory, 2019, v. 92, n. 4, p. 405, doi. 10.1002/jgt.22461
- By:
- Publication type:
- Article
A greedy algorithm for finding a large 2‐matching on a random cubic graph.
- Published in:
- Journal of Graph Theory, 2018, v. 88, n. 3, p. 449, doi. 10.1002/jgt.22224
- By:
- Publication type:
- Article
Rainbow Arborescence in Random Digraphs.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 251, doi. 10.1002/jgt.21995
- By:
- Publication type:
- Article
Variations on cops and robbers.
- Published in:
- Journal of Graph Theory, 2012, v. 69, n. 4, p. 383, doi. 10.1002/jgt.20591
- By:
- Publication type:
- Article
The t-Tone Chromatic Number of Random Graphs.
- Published in:
- Graphs & Combinatorics, 2014, v. 30, n. 5, p. 1073, doi. 10.1007/s00373-013-1341-9
- By:
- Publication type:
- Article
On graph irregularity strength.
- Published in:
- Journal of Graph Theory, 2002, v. 41, n. 2, p. 120, doi. 10.1002/jgt.10056
- By:
- Publication type:
- Article
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs.
- Published in:
- Journal of Applied Probability, 2022, v. 59, n. 2, p. 299, doi. 10.1017/jpr.2021.59
- By:
- Publication type:
- Article
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
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
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
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
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
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
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
Component structure of the vacant set induced by a random walk on a random graph.
- Published in:
- Random Structures & Algorithms, 2013, v. 42, n. 2, p. 135, doi. 10.1002/rsa.20402
- By:
- Publication type:
- Article
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables.
- Published in:
- Random Structures & Algorithms, 2012, v. 41, n. 3, p. 334, doi. 10.1002/rsa.20427
- By:
- Publication type:
- Article
Packing hamilton cycles in random and pseudo-random hypergraphs.
- Published in:
- Random Structures & Algorithms, 2012, v. 41, n. 1, p. 1, doi. 10.1002/rsa.20396
- By:
- Publication type:
- Article
Packing tight Hamilton cycles in 3-uniform hypergraphs.
- Published in:
- Random Structures & Algorithms, 2012, v. 40, n. 3, p. 269, doi. 10.1002/rsa.20374
- By:
- Publication type:
- Article
The cover time of random geometric graphs.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 3, p. 324, doi. 10.1002/rsa.20320
- By:
- Publication type:
- Article
Ramsey games with giants.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 1/2, p. 1, doi. 10.1002/rsa.20343
- By:
- Publication type:
- Article
Randomly coloring random graphs.
- Published in:
- Random Structures & Algorithms, 2010, v. 36, n. 3, p. 251, doi. 10.1002/rsa.20286
- By:
- Publication type:
- Article
Coloring H-free hypergraphs.
- Published in:
- Random Structures & Algorithms, 2010, v. 36, n. 1, p. 11, doi. 10.1002/rsa.20298
- By:
- Publication type:
- Article
Hamilton cycles in 3-out.
- Published in:
- Random Structures & Algorithms, 2009, v. 35, n. 4, p. 393, doi. 10.1002/rsa.20272
- By:
- Publication type:
- Article
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439.
- Published in:
- Random Structures & Algorithms, 2009, v. 34, n. 2, p. 300, doi. 10.1002/rsa.20258
- By:
- Publication type:
- Article
The cover time of the giant component of a random graph.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 4, p. 401, doi. 10.1002/rsa.20201
- By:
- Publication type:
- Article
The game chromatic number of random graphs.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 2, p. 223, doi. 10.1002/rsa.20179
- By:
- Publication type:
- Article