default search action
Wesley Pegden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Alan M. Frieze, Patrick Bennett, Andrew Newman, Wesley Pegden:
On the Intersecting Family Process. Electron. J. Comb. 31(4) (2024) - [j27]Alan M. Frieze, Wesley Pegden:
The Bright Side of Simple Heuristics for the TSP. Electron. J. Comb. 31(4) (2024) - [c6]Sarah Cannon
, Wesley Pegden
Sampling Balanced Forests of Grids in Polynomial Time. STOC 2024: 1676-1687 - 2023
- [j26]Alan M. Frieze, Wesley Pegden
Multitrees in Random Graphs. Electron. J. Comb. 30(1) (2023) - [j25]Alan M. Frieze
Spanners in randomly weighted graphs: Euclidean case. J. Graph Theory 104(1): 87-103 (2023) - [c5]Alan M. Frieze, Wesley Pegden
Subexponential mixing for partition chains on grid-like graphs. SODA 2023: 3317-3329 - [i16]Wesley Pegden
Direct sampling of short paths for contiguous partitioning. CoRR abs/2307.05042 (2023) - [i15]Alan M. Frieze, Wesley Pegden:
The bright side of simple heuristics for the TSP. CoRR abs/2310.03222 (2023) - [i14]Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz:
Sampling Balanced Forests of Grids in Polynomial Time. CoRR abs/2310.15152 (2023) - 2022
- [j24]Alan M. Frieze
Spanners in randomly weighted graphs: Independent edge lengths. Discret. Appl. Math. 309: 68-74 (2022) - [j23]Alan M. Frieze
On the Cover Time of the Emerging Giant. SIAM J. Discret. Math. 36(3): 1687-1710 (2022) - [i13]Alan M. Frieze, Wesley Pegden:
Subexponential mixing for partition chains on grid-like graphs. CoRR abs/2206.00579 (2022) - 2021
- [j22]Alan M. Frieze, Wesley Pegden
Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. Electron. J. Comb. 28(1): 1 (2021) - [j21]Alan M. Frieze
Maker Breaker on digraphs. J. Graph Theory 98(4): 653-661 (2021) - [i12]Alan M. Frieze, Wesley Pegden:
Spanners in randomly weighted graphs: independent edge lengths. CoRR abs/2105.01718 (2021) - 2020
- [j20]Alan M. Frieze, Wesley Pegden
On random multi-dimensional assignment problems. Discret. Appl. Math. 287: 1-9 (2020) - [c4]Travis Dick, Wesley Pegden, Maria-Florina Balcan:
Semi-bandit Optimization in the Dispersed Setting. UAI 2020: 909-918 - [i11]Wesley Pegden, Anish Sevekari:
Comb inequalities for typical Euclidean TSP instances. CoRR abs/2012.00292 (2020)
2010 – 2019
- 2019
- [j19]Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Rank of a Random Binary Matrix. Electron. J. Comb. 26(4): 4 (2019) - [j18]Andrzej Dudek, Alan M. Frieze, Wesley Pegden
A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. 254: 107-112 (2019) - [j17]Alan M. Frieze, Wesley Pegden
Traveling in randomly embedded random graphs. Random Struct. Algorithms 55(3): 649-676 (2019) - [j16]Colin Cooper, Alan M. Frieze, Wesley Pegden
Minors of a random binary matroid. Random Struct. Algorithms 55(4): 865-880 (2019) - [j15]Colin Cooper, Alan M. Frieze, Wesley Pegden
On the Cover Time of Dense Graphs. SIAM J. Discret. Math. 33(3): 1374-1389 (2019) - [c3]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the rank of a random binary matrix. SODA 2019: 946-955 - [i10]Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On random multi-dimensional assignment problems. CoRR abs/1901.07167 (2019) - [i9]Maria-Florina Balcan, Travis Dick, Wesley Pegden:
Semi-bandit Optimization in the Dispersed Setting. CoRR abs/1904.09014 (2019) - 2018
- [j14]Michael Anastos, Alan M. Frieze, Wesley Pegden
Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j13]Alan M. Frieze, Wesley Pegden
Online purchasing under uncertainty. Random Struct. Algorithms 53(2): 327-351 (2018) - [j12]Alan M. Frieze, Wesley Pegden
A note on dispersing particles on a line. Random Struct. Algorithms 53(4): 586-591 (2018) - [j11]Alan M. Frieze, Wesley Pegden
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. SIAM J. Discret. Math. 32(3): 2115-2133 (2018) - [i8]Colin Cooper, Alan M. Frieze, Wesley Pegden:
On the cover time of dense graphs. CoRR abs/1810.04772 (2018) - 2017
- [j10]Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. Random Struct. Algorithms 51(3): 375-403 (2017) - [c2]Alan M. Frieze, Wesley Pegden:
Traveling in Randomly Embedded Random Graphs. APPROX-RANDOM 2017: 45:1-45:17 - [i7]Wesley Pegden, Ariel D. Procaccia, Dingli Yu:
A partisan districting protocol with provably nonpartisan outcomes. CoRR abs/1710.08781 (2017) - 2016
- [c1]Alan M. Frieze, Wesley Pegden
Separating subadditive euclidean functionals. STOC 2016: 22-35 - [i6]Alan M. Frieze, Wesley Pegden:
Scalefree hardness of average-case Euclidean TSP approximation. CoRR abs/1604.04549 (2016) - [i5]Alan M. Frieze, Wesley Pegden:
Online purchasing under uncertainty. CoRR abs/1605.06072 (2016) - 2015
- [j9]Alan M. Frieze, Wesley Pegden:
Between 2- and 3-Colorability. Electron. J. Comb. 22(1): 1 (2015) - [j8]Lisa Espig, Alan M. Frieze
Walker-Breaker Games. SIAM J. Discret. Math. 29(3): 1476-1485 (2015) - [i4]Alan M. Frieze, Wesley Pegden:
Separating subadditive Euclidean functionals. CoRR abs/1501.01944 (2015) - 2014
- [j7]Alan M. Frieze, Wesley Pegden:
The Topology of Competitively Constructed Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j6]Wesley Pegden
An Extension of the Moser-Tardos Algorithmic Local Lemma. SIAM J. Discret. Math. 28(2): 911-917 (2014) - [i3]Alan M. Frieze, Wesley Pegden:
Looking for vertex number one. CoRR abs/1408.6821 (2014) - 2013
- [j5]Wesley Pegden
Critical graphs without triangles: An optimum density construction. Comb. 33(4): 495-513 (2013) - 2012
- [j4]Wesley Pegden
The lefthanded local lemma characterizes chordal dependency graphs. Random Struct. Algorithms 41(4): 546-556 (2012) - 2011
- [j3]Wesley Pegden
Highly nonrepetitive sequences: Winning strategies from the local lemma. Random Struct. Algorithms 38(1-2): 140-161 (2011) - [i2]Wesley Pegden:
A finite goal set in the plane which is not a Winner. CoRR abs/1101.4420 (2011) - [i1]Wesley Pegden:
An improvement of the Moser-Tardos algorithmic local lemma. CoRR abs/1102.2853 (2011)
2000 – 2009
- 2008
- [j2]Wesley Pegden
A finite goal set in the plane which is not a winner. Discret. Math. 308(24): 6546-6551 (2008) - 2006
- [j1]Wesley Pegden
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs. Comb. 26(5): 577-585 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: