# Michael R. Capalbo

According to our database

Collaborative distances:

^{1}, Michael R. Capalbo authored at least 15 papers between 1999 and 2010.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2010

Explicit sparse almost-universal graphs for G(n, k/n).

Random Struct. Algorithms, 2010

2008

Optimal universal graphs with deterministic embedding.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Sparse universal graphs for bounded-degree graphs.

Random Struct. Algorithms, 2007

Finding Disjoint Paths in Expanders Deterministically and Online.

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2005

Explicit Bounded-Degree Unique-Neighbor Concentrators.

Combinatorica, 2005

2003

An Explicit Construction of Lower-Diameter Cubic Graphs.

SIAM J. Discrete Math., 2003

Smaller explicit superconcentrators.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Small Universal Graphs for Bounded-Degree Planar Graphs.

Combinatorica, 2002

Randomness conductors and constant-degree lossless expanders.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Explicit Unique-Neighbor Expanders.

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Randomness Conductors and Constant-Degree Lossless Expanders.

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.

Proceedings of the Approximation, 2001

2000

Universality and Tolerance.

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Small Universal Graphs.

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Small Universal Graph for Bounded-degree Planar Graphs.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999