![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael R. Capalbo
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j6]Michael R. Capalbo:
Explicit sparse almost-universal graphs for G(n, k/n). Random Struct. Algorithms 37(4): 437-454 (2010)
2000 – 2009
- 2008
- [c10]Noga Alon, Michael R. Capalbo:
Optimal universal graphs with deterministic embedding. SODA 2008: 373-378 - 2007
- [j5]Noga Alon, Michael R. Capalbo:
Sparse universal graphs for bounded-degree graphs. Random Struct. Algorithms 31(2): 123-133 (2007) - [c9]Noga Alon, Michael R. Capalbo:
Finding Disjoint Paths in Expanders Deterministically and Online. FOCS 2007: 518-524 - 2005
- [j4]Michael R. Capalbo:
Explicit Bounded-Degree Unique-Neighbor Concentrators. Comb. 25(4): 379-391 (2005) - 2003
- [j3]Noga Alon, Michael R. Capalbo:
Smaller Explicit Superconcentrators. Internet Math. 1(2): 151-163 (2003) - [j2]Michael R. Capalbo:
An Explicit Construction of Lower-Diameter Cubic Graphs. SIAM J. Discret. Math. 16(4): 630-634 (2003) - [c8]Noga Alon, Michael R. Capalbo:
Smaller explicit superconcentrators. SODA 2003: 340-346 - 2002
- [j1]Michael R. Capalbo:
Small Universal Graphs for Bounded-Degree Planar Graphs. Comb. 22(3): 345-359 (2002) - [c7]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders. CCC 2002: 15 - [c6]Noga Alon, Michael R. Capalbo:
Explicit Unique-Neighbor Expanders. FOCS 2002: 73- - [c5]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668 - 2001
- [c4]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
- [c3]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
, Endre Szemerédi:
Universality and Tolerance. FOCS 2000: 14-21
1990 – 1999
- 1999
- [c2]Michael R. Capalbo:
A Small Universal Graph for Bounded-degree Planar Graphs. SODA 1999: 156-160 - [c1]Michael R. Capalbo, S. Rao Kosaraju:
Small Universal Graphs. STOC 1999: 741-749
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint