Complexity and Algorithms in Graphs
Complexity and Algorithms in Graphs is a research topic within Computational Theory and Mathematics. Science Explorer counts 21k research works in it since 1959. 24.4% of them reached the world's top 10% most cited for their field and year.
This cluster of papers focuses on combinatorial optimization, approximation algorithms, complexity theory, graph algorithms, submodular functions, network flows, matrix multiplication, communication complexity, linear programming, and algorithmic applications.
- Combinatorial Optimization
- Approximation Algorithms
- Complexity Theory
- Graph Algorithms
- Submodular Functions
- Network Flows
- Matrix Multiplication
- Communication Complexity
- Linear Programming
- Algorithmic Applications
- Research works
- 21k fractional, since 1959
- In the world top 10%
- 5.2k per year above
- Top-10% rate
- 24.4% share of its works in the world top 10%
- Growth, 2013–17 → 2018–22
- -2% the tick is no change
Which countries lead Complexity and Algorithms in Graphs research?
By volume, the United States and China publish the most (618 and 478 works in 2022–2025).
By volume, 2022–2025
- 1 United States 618 works
- 2 China 478 works
- 3 India 200 works
- 4 Germany 186 works
- 5 France 148 works
- 6 Japan 132 works
- 7 Israel 131 works
- 8 United Kingdom 114 works
- 9 Canada 89 works
- 10 Italy 64 works
How concentrated that is
The same countries as shares of everything the list above accounts for. A node where two countries do two thirds of the work and one spread evenly across twelve read alike as a ranking and not at all alike here.
Shares of the rows listed above, not of the whole node.
Which institutions lead Complexity and Algorithms in Graphs research?
By volume in 2022–2025, ETH Zurich publishes the most Complexity and Algorithms in Graphs research, followed by Centre National de la Recherche Scientifique and Massachusetts Institute of Technology.
By volume, 2022–2025
- 1 ETH ZurichSwitzerland 30 works
- 2 Centre National de la Recherche ScientifiqueFrance 28 works
- 3 Massachusetts Institute of TechnologyUnited States 27 works
- 4 Carnegie Mellon UniversityUnited States 27 works
- 5 Tel Aviv UniversityIsrael 25 works
- 6 University of WaterlooCanada 24 works
- 7 Ben-Gurion University of the NegevIsrael 22 works
- 8 Weizmann Institute of ScienceIsrael 20 works
- 9 University of Illinois Urbana-ChampaignUnited States 18 works
- 10 Technion – Israel Institute of TechnologyIsrael 18 works
Who are the leading researchers in Complexity and Algorithms in Graphs?
The most-cited researchers publishing on Complexity and Algorithms in Graphs include Dan Boneh, Ronald L. Rivest and Adi Shamir.
- 1 Dan Boneh United States 7.5k citations
- 2 Ronald L. Rivest United States 7.3k citations
- 3 Adi Shamir Israel 6.3k citations
- 4 David R. Karger United States 5.2k citations
- 5 Michael I. Jordan United States 4.8k citations
- 6 Robert E. Tarjan United States 3.9k citations
Ranked by citations received across their whole record, among researchers with at least three works on this topic.
Where is Complexity and Algorithms in Graphs research done?
The largest centres of Complexity and Algorithms in Graphs research in 2022–2025 are Beijing (China), Paris (France), Tokyo (Japan) and Shanghai (China). Among places with at least 20 works in it, it is an unusually large share of all research in Saarbrücken, Beersheba and Haifa.
Largest cities, 2022–2025
Where it is the local speciality
- SaarbrückenDE · 24.0 works25×
- BeershebaIL · 21.9 works20×
- HaifaIL · 27.4 works14×
- WaterlooCA · 25.6 works13×
- Tel AvivIL · 27.4 works13×
Location quotient: how much more of its research is in Complexity and Algorithms in Graphs than the world average.
Where is the best place to study Complexity and Algorithms in Graphs?
Among universities, judged by research, École Polytechnique Fédérale de Lausanne, ETH Zurich and Aarhus University score highest, combining excellence, specialisation, size, growth and international reach. Research strength is one signal when choosing where to study; it does not measure teaching.
One dot per university in the table below. The upper left is the interesting corner: small places doing unusually strong work.
| # | University | Score | Top 10% | Specialisation | Works | Growth |
|---|---|---|---|---|---|---|
| 1 | École Polytechnique Fédérale de LausanneSwitzerland | 64.0 | 25.3% | 11.8× | 14 | +33.7% |
| 2 | ETH ZurichSwitzerland | 63.9 | 12.8% | 16.2× | 30 | +5.1% |
| 3 | Aarhus UniversityDenmark | 63.3 | 38.5% | 7.0× | 14 | -16.5% |
| 4 | Massachusetts Institute of TechnologyUnited States | 60.0 | 16.5% | 15.8× | 27 | -18.4% |
| 5 | Carnegie Mellon UniversityUnited States | 58.1 | 15.5% | 23.6× | 27 | -5.5% |
| 6 | Tel Aviv UniversityIsrael | 57.2 | 14.6% | 16.6× | 25 | -14.3% |
| 7 | Weizmann Institute of ScienceIsrael | 56.7 | 15.9% | 49.4× | 20 | -24.7% |
| 8 | University of WaterlooCanada | 54.0 | 10.3% | 15.8× | 24 | -14.2% |
| 9 | The University of Texas at AustinUnited States | 53.2 | 37.0% | 5.9× | 14 | -16.3% |
| 10 | Bar-Ilan UniversityIsrael | 51.3 | 18.5% | 18.1× | 13 | +19.0% |
Universities only. Score blends excellence (30%), specialisation (25%), size (20%), growth (15%) and international reach (10%), 2015–2022; growth compares 2010–14 with 2015–19.
Is Complexity and Algorithms in Graphs research growing?
Output in 2018–2022 was 2% lower than in 2013–2017, peaking in 2015. The fastest-growing topics are Complexity and Algorithms in Graphs.
The same series as a ribbon — one cell per year, darker for more. The line above answers how much; this answers when.
Which topics inside it are moving
Growth and decline on one axis around a shared zero. Two lists side by side hide the thing that matters: whether the growth dwarfs the decline, or the other way round.