Wesley Pegden

Orcid: 0000-0002-3680-1817

According to our database1, Wesley Pegden authored at least 36 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Spanners in randomly weighted graphs: Euclidean case.
J. Graph Theory, September, 2023

Sampling Balanced Forests of Grids in Polynomial Time.
CoRR, 2023

The bright side of simple heuristics for the TSP.
CoRR, 2023

Direct sampling of short paths for contiguous partitioning.
CoRR, 2023

Multitrees in Random Graphs.
Electron. J. Comb., 2023

Subexponential mixing for partition chains on grid-like graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
On the Cover Time of the Emerging Giant.
SIAM J. Discret. Math., 2022

Spanners in randomly weighted graphs: Independent edge lengths.
Discret. Appl. Math., 2022

2021
Maker Breaker on digraphs.
J. Graph Theory, 2021

Minimum-Weight Combinatorial Structures Under Random Cost-Constraints.
Electron. J. Comb., 2021

2020
On random multi-dimensional assignment problems.
Discret. Appl. Math., 2020

Comb inequalities for typical Euclidean TSP instances.
CoRR, 2020

Semi-bandit Optimization in the Dispersed Setting.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

2019
On the Cover Time of Dense Graphs.
SIAM J. Discret. Math., 2019

Traveling in randomly embedded random graphs.
Random Struct. Algorithms, 2019

Minors of a random binary matroid.
Random Struct. Algorithms, 2019

A note on the localization number of random graphs: Diameter two case.
Discret. Appl. Math., 2019

On the Rank of a Random Binary Matrix.
Electron. J. Comb., 2019

2018
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights.
SIAM J. Discret. Math., 2018

A note on dispersing particles on a line.
Random Struct. Algorithms, 2018

Online purchasing under uncertainty.
Random Struct. Algorithms, 2018

Constraining the Clustering Transition for Colorings of Sparse Random Graphs.
Electron. J. Comb., 2018

2017
Separating subadditive euclidean functionals.
Random Struct. Algorithms, 2017

A partisan districting protocol with provably nonpartisan outcomes.
CoRR, 2017

2016
Scalefree hardness of average-case Euclidean TSP approximation.
CoRR, 2016

2015
Walker-Breaker Games.
SIAM J. Discret. Math., 2015

Between 2- and 3-Colorability.
Electron. J. Comb., 2015

2014
An Extension of the Moser-Tardos Algorithmic Local Lemma.
SIAM J. Discret. Math., 2014

Looking for vertex number one.
CoRR, 2014

The Topology of Competitively Constructed Graphs.
Electron. J. Comb., 2014

2013
Critical graphs without triangles: An optimum density construction.
Comb., 2013

2012
The lefthanded local lemma characterizes chordal dependency graphs.
Random Struct. Algorithms, 2012

2011
Highly nonrepetitive sequences: Winning strategies from the local lemma.
Random Struct. Algorithms, 2011

An improvement of the Moser-Tardos algorithmic local lemma
CoRR, 2011

2008
A finite goal set in the plane which is not a winner.
Discret. Math., 2008

2006
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs.
Comb., 2006


  Loading...