2008 |
15 | EE | Noga Alon,
Michael R. Capalbo:
Optimal universal graphs with deterministic embedding.
SODA 2008: 373-378 |
2007 |
14 | EE | Noga Alon,
Michael R. Capalbo:
Finding Disjoint Paths in Expanders Deterministically and Online.
FOCS 2007: 518-524 |
13 | EE | Noga Alon,
Michael R. Capalbo:
Sparse universal graphs for bounded-degree graphs.
Random Struct. Algorithms 31(2): 123-133 (2007) |
2005 |
12 | EE | Michael R. Capalbo:
Explicit Bounded-Degree Unique-Neighbor Concentrators.
Combinatorica 25(4): 379-391 (2005) |
2003 |
11 | EE | Noga Alon,
Michael R. Capalbo:
Smaller explicit superconcentrators.
SODA 2003: 340-346 |
10 | | Noga Alon,
Michael R. Capalbo:
Smaller Explicit Superconcentrators.
Internet Mathematics 1(2): (2003) |
9 | EE | Michael R. Capalbo:
An Explicit Construction of Lower-Diameter Cubic Graphs.
SIAM J. Discrete Math. 16(4): 635-650 (2003) |
2002 |
8 | EE | Noga Alon,
Michael R. Capalbo:
Explicit Unique-Neighbor Expanders.
FOCS 2002: 73- |
7 | EE | Michael R. Capalbo,
Omer Reingold,
Salil P. Vadhan,
Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders.
IEEE Conference on Computational Complexity 2002: 15 |
6 | EE | Michael R. Capalbo,
Omer Reingold,
Salil P. Vadhan,
Avi Wigderson:
Randomness conductors and constant-degree lossless expanders.
STOC 2002: 659-668 |
5 | EE | Michael R. Capalbo:
Small Universal Graphs for Bounded-Degree Planar Graphs.
Combinatorica 22(3): 345-359 (2002) |
2001 |
4 | EE | Noga Alon,
Michael R. Capalbo,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
RANDOM-APPROX 2001: 170-180 |
2000 |
3 | | Noga Alon,
Michael R. Capalbo,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Andrzej Rucinski,
Endre Szemerédi:
Universality and Tolerance.
FOCS 2000: 14-21 |
1999 |
2 | EE | Michael R. Capalbo:
A Small Universal Graph for Bounded-degree Planar Graphs.
SODA 1999: 156-160 |
1 | EE | Michael R. Capalbo,
S. Rao Kosaraju:
Small Universal Graphs.
STOC 1999: 741-749 |