Michael Capalbo
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 12
- Complexity and Algorithms in Graphs 6
- Topological and Geometric Data Analysis 2
-
- Limits and Structures in Graph Theory 7
- Finite Group Theory Research 2
- Co-authors
- Noga Alon (10 shared papers)Salil Vadhan (2 shared papers)Avi Wigderson (2 shared papers)Omer Reingold (2 shared papers)Yoshiharu Kohayakawa (3 shared papers)Andrzej Ruciński (3 shared papers)Endre Szemerédi (3 shared papers)S. Rao Kosaraju (1 shared paper)
- Journals
- Random Structures and Algorithms (2 papers)COMBINATORICA (2 papers)Internet Mathematics (1 paper)SIAM Journal on Discrete Mathematics (1 paper)Lecture notes in computer science (1 paper)
- Partner nations
- United StatesIsraelPoland
In The Last Decade
Michael Capalbo
17 papers receiving 386 citations
Peers
Comparison fields: 5 of 39
- Discrete Mathematics and Combinatorics 147
- Computational Theory and Mathematics 239
- Geometry and Topology 61
- Artificial Intelligence 140
- Computer Networks and Communications 86
Countries citing papers authored by Michael Capalbo
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
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-authors
The 10 scholars most cited alongside Michael Capalbo, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 160 | |
| 2 | 2007 | 52 | |
| 3 | 2002 | 33 | |
| 4 | 2006 | 30 | |
| 5 | Optimal universal graphs with deterministic embedding | 2008 | 21 |
| 6 | 2002 | 20 | |
| 7 | 1999 | 18 | |
| 8 | 2003 | 18 | |
| 9 | 2001 | 15 | |
| 10 | 2002 | 15 | |
| 11 | 2004 | 14 | |
| 12 | 2003 | 6 | |
| 13 | Near-optimum universal graphs for graphs with bounded degrees (Extended abstract) | 2015 | 3 |
| 14 | 2010 | 3 | |
| 15 | 2007 | 2 | |
| 16 | 2005 | 1 | |
| 17 | 2003 | 1 |
About Michael Capalbo
Michael Capalbo is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Computer Graphics and Computer-Aided Design, having authored 17 papers that have together received 412 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (12 papers), Limits and Structures in Graph Theory (7 papers), Complexity and Algorithms in Graphs (6 papers), Graph theory and applications (4 papers), VLSI and FPGA Design Techniques (3 papers), Optimization and Search Problems (2 papers), Topological and Geometric Data Analysis (2 papers) and Finite Group Theory Research (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (147 citations), Computational Theory and Mathematics (239 citations), Geometry and Topology (61 citations), Artificial Intelligence (140 citations) and Computer Networks and Communications (86 citations). Michael Capalbo has collaborated with scholars based in United States, Israel and Poland. Frequent co-authors include Noga Alon, Salil Vadhan, Avi Wigderson, Omer Reingold, Yoshiharu Kohayakawa, Andrzej Ruciński, Endre Szemerédi, S. Rao Kosaraju, Vojtch Rödl and Vojtěch Rödl. Their work appears in journals such as Random Structures and Algorithms, COMBINATORICA, Internet Mathematics, SIAM Journal on Discrete Mathematics and Lecture notes in computer science.
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.