The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michael R. Capalbo" ( http://dblp.L3S.de/Authors/Michael_R._Capalbo )

  Author page on DBLP  Author page in RDF  Community of Michael R. Capalbo in ASPL-2

Publication years (Num. hits)
1999-2008 (15) 2010 (1)
Publication types (Num. hits)
article(6) inproceedings(10)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 11 keywords

Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael R. Capalbo Explicit sparse almost-universal graphs for G(n, k/n). Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo Optimal universal graphs with deterministic embedding. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo Sparse universal graphs for bounded-degree graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo Finding Disjoint Paths in Expanders Deterministically and Online. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael R. Capalbo Explicit Bounded-Degree Unique-Neighbor Concentrators. Search on Bibsonomy Combinatorica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35
1Noga Alon, Michael R. Capalbo Smaller Explicit Superconcentrators. Search on Bibsonomy Internet Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michael R. Capalbo An Explicit Construction of Lower-Diameter Cubic Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2003 DBLP  BibTeX  RDF
1Noga Alon, Michael R. Capalbo Smaller explicit superconcentrators. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michael R. Capalbo Small Universal Graphs for Bounded-Degree Planar Graphs. Search on Bibsonomy Combinatorica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C35
1Noga Alon, Michael R. Capalbo Explicit Unique-Neighbor Expanders. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson Randomness Conductors and Constant-Degree Lossless Expanders. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF expander graphs, extractors, condensers, graph products
1Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson Randomness conductors and constant-degree lossless expanders. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF expander graphs, extractors, condensers, graph products
1Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Near-optimum Universal Graphs for Graphs with Bounded Degrees. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi Universality and Tolerance. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF positive integers, sparse universal graphs, random constructions, fault-tolerant bipartite random graph, graph theory, graph theory, graphs, bipartite graphs, universality, vertices, tolerance, maximum degree
1Michael R. Capalbo A Small Universal Graph for Bounded-degree Planar Graphs. Search on Bibsonomy SODA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Michael R. Capalbo, S. Rao Kosaraju Small Universal Graphs. Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.