Distance Sequences In Locally Infinite Vertex-Transitive Digraphs. - Wesley Pegden (Comb., 2006)

A finite goal set in the plane which is not a winner. - Wesley Pegden (Discret. Math., 2008)

An improvement of the Moser-Tardos algorithmic local lemma - Wesley Pegden (CoRR, 2011)

Highly nonrepetitive sequences: Winning strategies from the local lemma. - Wesley Pegden (Random Struct. Algorithms, 2011)

The lefthanded local lemma characterizes chordal dependency graphs. - Wesley Pegden (Random Struct. Algorithms, 2012)

Critical graphs without triangles: An optimum density construction. - Wesley Pegden (Comb., 2013)

The Topology of Competitively Constructed Graphs. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2014)

Looking for vertex number one. - Alan M. Frieze; Wesley Pegden (CoRR, 2014)

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

Between 2- and 3-Colorability. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2015)

Walker-Breaker Games. - Lisa Espig; Alan M. Frieze; Michael Krivelevich; Wesley Pegden (SIAM J. Discret. Math., 2015)

Separating subadditive euclidean functionals. - Alan M. Frieze; Wesley Pegden (STOC, 2016)

Scalefree hardness of average-case Euclidean TSP approximation. - Alan M. Frieze; Wesley Pegden (CoRR, 2016)

Traveling in Randomly Embedded Random Graphs. - Alan M. Frieze; Wesley Pegden (APPROX-RANDOM, 2017)

A partisan districting protocol with provably nonpartisan outcomes. - Wesley Pegden; Ariel D. Procaccia; Dingli Yu (CoRR, 2017)

Constraining the Clustering Transition for Colorings of Sparse Random Graphs. - Michael Anastos; Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2018)

Online purchasing under uncertainty. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2018)

A note on dispersing particles on a line. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2018)

The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin (SIAM J. Discret. Math., 2018)

On the rank of a random binary matrix. - Colin Cooper; Alan M. Frieze; Wesley Pegden (SODA, 2019)

A note on the localization number of random graphs: Diameter two case. - Andrzej Dudek; Alan M. Frieze; Wesley Pegden (Discret. Appl. Math., 2019)

Minors of a random binary matroid. - Colin Cooper; Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2019)

On the Cover Time of Dense Graphs. - Colin Cooper; Alan M. Frieze; Wesley Pegden (SIAM J. Discret. Math., 2019)

Semi-bandit Optimization in the Dispersed Setting. - Travis Dick; Wesley Pegden; Maria-Florina Balcan (UAI, 2020)

Comb inequalities for typical Euclidean TSP instances. - Wesley Pegden; Anish Sevekari (CoRR, 2020)

On random multi-dimensional assignment problems. - Alan M. Frieze; Wesley Pegden; Tomasz Tkocz (Discret. Appl. Math., 2020)

Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin; Tomasz Tkocz (Electron. J. Comb., 2021)

Maker Breaker on digraphs. - Alan M. Frieze; Wesley Pegden (J. Graph Theory, 2021)

Spanners in randomly weighted graphs: Independent edge lengths. - Alan M. Frieze; Wesley Pegden (Discret. Appl. Math., 2022)

On the Cover Time of the Emerging Giant. - Alan M. Frieze; Wesley Pegden; Tomasz Tkocz (SIAM J. Discret. Math., 2022)

Subexponential mixing for partition chains on grid-like graphs. - Alan M. Frieze; Wesley Pegden (SODA, 2023)

Multitrees in Random Graphs. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2023)

Direct sampling of short paths for contiguous partitioning. - Wesley Pegden; Anish Sevekari (CoRR, 2023)

Spanners in randomly weighted graphs: Euclidean case. - Alan M. Frieze; Wesley Pegden (J. Graph Theory, 2023)

Sampling Balanced Forests of Grids in Polynomial Time. - Sarah Cannon; Wesley Pegden; Jamie Tucker-Foltz (STOC, 2024)

On the Intersecting Family Process. - Alan M. Frieze; Patrick Bennett; Andrew Newman; Wesley Pegden (Electron. J. Comb., 2024)

The Bright Side of Simple Heuristics for the TSP. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2024)

The Moran Process on a Random Graph. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2025)

Cover time of random subgraphs of the hypercube. - Colin Cooper; Alan M. Frieze; Wesley Pegden (CoRR, 2025)

Sampling tree-weighted partitions without sampling trees. - Sarah Cannon; Wesley Pegden; Jamie Tucker-Foltz (CoRR, 2025)