A Small Universal Graph for Bounded-degree Planar Graphs. - Michael R. Capalbo (SODA, 1999)

Small Universal Graphs. - Michael R. Capalbo; S. Rao Kosaraju (STOC, 1999)

Universality and Tolerance. - Noga Alon; Michael R. Capalbo; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (FOCS, 2000)

Near-optimum Universal Graphs for Graphs with Bounded Degrees. - Noga Alon; Michael R. Capalbo; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Endre Szemerédi (RANDOM-APPROX, 2001)

Explicit Unique-Neighbor Expanders. - Noga Alon; Michael R. Capalbo (FOCS, 2002)

Randomness conductors and constant-degree lossless expanders. - Michael R. Capalbo; Omer Reingold; Salil P. Vadhan; Avi Wigderson (STOC, 2002)

Small Universal Graphs for Bounded-Degree Planar Graphs. - Michael R. Capalbo (Comb., 2002)

Smaller Explicit Superconcentrators. - Noga Alon; Michael R. Capalbo (Internet Math., 2003)

An Explicit Construction of Lower-Diameter Cubic Graphs. - Michael R. Capalbo (SIAM J. Discret. Math., 2003)

Explicit Bounded-Degree Unique-Neighbor Concentrators. - Michael R. Capalbo (Comb., 2005)

Finding Disjoint Paths in Expanders Deterministically and Online. - Noga Alon; Michael R. Capalbo (FOCS, 2007)

Sparse universal graphs for bounded-degree graphs. - Noga Alon; Michael R. Capalbo (Random Struct. Algorithms, 2007)

Optimal universal graphs with deterministic embedding. - Noga Alon; Michael R. Capalbo (SODA, 2008)

Explicit sparse almost-universal graphs for G(n, k/n). - Michael R. Capalbo (Random Struct. Algorithms, 2010)