Michael R. Capalbo

16 papers A* 8A 1Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2010 J jnl
Explicit sparse almost-universal graphs for G(n, k/n).
Random Struct. Algorithms
Michael R. Capalbo
2008 A* conf
Optimal universal graphs with deterministic embedding.
SODA
Noga Alon, Michael R. Capalbo
2007 A* conf
Finding Disjoint Paths in Expanders Deterministically and Online.
FOCS
Noga Alon, Michael R. Capalbo
2007 J jnl
Sparse universal graphs for bounded-degree graphs.
Random Struct. Algorithms
Noga Alon, Michael R. Capalbo
2005 J jnl
Explicit Bounded-Degree Unique-Neighbor Concentrators.
Comb.
Michael R. Capalbo
2003 J jnl
An Explicit Construction of Lower-Diameter Cubic Graphs.
SIAM J. Discret. Math.
Michael R. Capalbo
2003 J jnl
Smaller Explicit Superconcentrators.
Internet Math.
Noga Alon, Michael R. Capalbo
2003 A* conf
Smaller explicit superconcentrators.
SODA
Noga Alon, Michael R. Capalbo
2002 A* conf
Explicit Unique-Neighbor Expanders.
FOCS
Noga Alon, Michael R. Capalbo
2002 A conf
Randomness Conductors and Constant-Degree Lossless Expanders.
CCC
Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002 A* conf
Randomness conductors and constant-degree lossless expanders.
STOC
Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002 J jnl
Small Universal Graphs for Bounded-Degree Planar Graphs.
Comb.
Michael R. Capalbo
2001 — conf
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
RANDOM-APPROX
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2000 A* conf
Universality and Tolerance.
FOCS
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
1999 A* conf
A Small Universal Graph for Bounded-degree Planar Graphs.
SODA
Michael R. Capalbo
1999 A* conf
Small Universal Graphs.
STOC
Michael R. Capalbo, S. Rao Kosaraju