We stand with Ukraine  

Michael R. Capalbo

According to our database1, Michael R. Capalbo authored at least 14 papers between 1999 and 2010.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

2000
2002
2004
2006
2008
2010
0
1
2
3
4
1
1
1
2
1
1
1
2
1
1
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2008
Optimal universal graphs with deterministic embedding.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Sparse universal graphs for bounded-degree graphs.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
Random Struct. Algorithms, 2007

Finding Disjoint Paths in Expanders Deterministically and Online.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2005
Explicit Bounded-Degree Unique-Neighbor Concentrators.
[BibTeX]
[DOI]
Michael R. Capalbo
Comb., 2005

2003
An Explicit Construction of Lower-Diameter Cubic Graphs.
[BibTeX]
[DOI]
Michael R. Capalbo
SIAM J. Discret. Math., 2003

Smaller Explicit Superconcentrators.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
Internet Math., 2003

2002
Small Universal Graphs for Bounded-Degree Planar Graphs.
[BibTeX]
[DOI]
Michael R. Capalbo
Comb., 2002

Randomness conductors and constant-degree lossless expanders.
[BibTeX]
[DOI]
Michael R. Capalbo
,
Omer Reingold
,
Salil P. Vadhan
,
Avi Wigderson
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Explicit Unique-Neighbor Expanders.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
,
Yoshiharu Kohayakawa
,
Vojtech Rödl
,
Andrzej Rucinski
,
Endre Szemerédi
Proceedings of the Approximation, 2001

2000
Universality and Tolerance.
[BibTeX]
[DOI]
Noga Alon
,
Michael R. Capalbo
,
Yoshiharu Kohayakawa
,
Vojtech Rödl
,
Andrzej Rucinski
,
Endre Szemerédi
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Small Universal Graphs.
[BibTeX]
[DOI]
Michael R. Capalbo
,
S. Rao Kosaraju
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Small Universal Graph for Bounded-degree Planar Graphs.
[BibTeX]
[DOI]
Michael R. Capalbo
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999


  Loading...