Michael Capalbo

591 total citations
16 papers, 286 citations indexed

About

Michael Capalbo is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Michael Capalbo has authored 16 papers receiving a total of 286 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 7 papers in Discrete Mathematics and Combinatorics and 4 papers in Geometry and Topology. Recurrent topics in Michael Capalbo's work include Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (6 papers) and Complexity and Algorithms in Graphs (5 papers). Michael Capalbo is often cited by papers focused on Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (6 papers) and Complexity and Algorithms in Graphs (5 papers). Michael Capalbo collaborates with scholars based in United States, Israel and Poland. Michael Capalbo's co-authors include Noga Alon, Avi Wigderson, Salil Vadhan, Omer Reingold, S. Rao Kosaraju, Endre Szemerédi, V. Rödl, Andrzej Ruciński, Yoshiharu Kohayakawa and Vojtěch Rödl and has published in prestigious journals such as Nature Chemical Biology, COMBINATORICA and SIAM Journal on Discrete Mathematics.

In The Last Decade

Michael Capalbo

15 papers receiving 267 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael Capalbo United States 9 163 97 96 72 39 16 286
Luděk Kučera Czechia 8 177 1.1× 102 1.1× 37 0.4× 75 1.0× 29 0.7× 35 303
Ryan R. Martin United States 13 213 1.3× 92 0.9× 212 2.2× 57 0.8× 130 3.3× 54 417
Bennet Manvel United States 10 170 1.0× 60 0.6× 72 0.8× 32 0.4× 81 2.1× 21 271
Michael Krivelevich Israel 12 253 1.6× 45 0.5× 242 2.5× 40 0.6× 119 3.1× 28 374
Zbigniew Lonc Poland 10 174 1.1× 52 0.5× 89 0.9× 32 0.4× 63 1.6× 57 269
Robin A. Moser Switzerland 4 191 1.2× 78 0.8× 68 0.7× 55 0.8× 23 0.6× 5 259
Marcos Kiwi Chile 9 155 1.0× 164 1.7× 38 0.4× 40 0.6× 14 0.4× 36 289
Svante Linusson Sweden 10 137 0.8× 42 0.4× 201 2.1× 16 0.2× 77 2.0× 40 334
Pierre Duchet France 11 371 2.3× 32 0.3× 124 1.3× 34 0.5× 160 4.1× 30 450
Radoš Radoičić United States 10 151 0.9× 25 0.3× 144 1.5× 11 0.2× 82 2.1× 32 322

Countries citing papers authored by Michael Capalbo

Since Specialization
Citations

This map shows the geographic impact of Michael Capalbo's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Capalbo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Capalbo more than expected).

Fields of papers citing papers by Michael Capalbo

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Capalbo. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Capalbo. The network helps show where Michael Capalbo may publish in the future.

Co-authorship network of co-authors of Michael Capalbo

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Capalbo. A scholar is included among the top collaborators of Michael Capalbo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Capalbo. Michael Capalbo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Alon, Noga, Michael Capalbo, Yoshiharu Kohayakawa, et al.. (2015). Near-optimum universal graphs for graphs with bounded degrees (Extended abstract). Nature Chemical Biology. 16(12). 170–180. 1 indexed citations
2.
Capalbo, Michael. (2010). Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$. Random Structures and Algorithms. 37(4). 437–454. 3 indexed citations
3.
Alon, Noga & Michael Capalbo. (2008). Optimal universal graphs with deterministic embedding. Symposium on Discrete Algorithms. 373–378. 15 indexed citations
4.
Alon, Noga & Michael Capalbo. (2007). Finding Disjoint Paths in Expanders Deterministically and Online. 518–524. 37 indexed citations
5.
6.
Alon, Noga & Michael Capalbo. (2006). Sparse universal graphs for bounded‐degree graphs. Random Structures and Algorithms. 31(2). 123–133. 22 indexed citations
7.
Capalbo, Michael. (2005). Explicit Bounded-Degree Unique-Neighbor Concentrators. COMBINATORICA. 25(4). 379–391. 1 indexed citations
8.
Alon, Noga & Michael Capalbo. (2004). Smaller Explicit Superconcentrators. Internet Mathematics. 1(2). 151–163. 11 indexed citations
9.
Alon, Noga & Michael Capalbo. (2003). Smaller explicit superconcentrators. Symposium on Discrete Algorithms. 340–346. 3 indexed citations
10.
Capalbo, Michael. (2003). An Explicit Construction of Lower-Diameter Cubic Graphs. SIAM Journal on Discrete Mathematics. 16(4). 630–634. 1 indexed citations
11.
Alon, Noga & Michael Capalbo. (2003). Explicit unique-neighbor expanders. 73–79. 16 indexed citations
12.
Alon, Noga, Michael Capalbo, Yoshiharu Kohayakawa, et al.. (2002). Universality and tolerance. 14–21. 24 indexed citations
13.
Capalbo, Michael, Omer Reingold, Salil Vadhan, & Avi Wigderson. (2002). Randomness conductors and constant-degree lossless expanders. 659–668. 120 indexed citations
14.
Capalbo, Michael. (2002). Small Universal Graphs for Bounded-Degree Planar Graphs. COMBINATORICA. 22(3). 345–359. 10 indexed citations
15.
Capalbo, Michael, Omer Reingold, Salil Vadhan, & Avi Wigderson. (2002). Randomness conductors and constant-degree lossless expanders. 8 indexed citations
16.
Capalbo, Michael & S. Rao Kosaraju. (1999). Small universal graphs. 741–749. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Luděk Kučera Breakdown of academic impact, for papers by Ryan R. Martin Breakdown of academic impact, for papers by Bennet Manvel Breakdown of academic impact, for papers by Michael Krivelevich Breakdown of academic impact, for papers by Zbigniew Lonc Breakdown of academic impact, for papers by Robin A. Moser Breakdown of academic impact, for papers by Marcos Kiwi Breakdown of academic impact, for papers by Svante Linusson Breakdown of academic impact, for papers by Pierre Duchet Breakdown of academic impact, for papers by Radoš Radoičić
Rankless by CCL
2026