Upload Records Snowball Search Search OpenAlex
About the database ScholarIQanswers from OpenAlex
Complexity and Algorithms in Graphs
TopicLeading institutions, researchers & key papers
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.
14
Works
IDs:OpenAlex
How has Complexity and Algorithms in Graphs's publication output changed over time?
ScholarIQpublication output · 2007–2015
Output declined67% over the shown period — from 3 works in 2007 to 1 in 2015.
3
1
1
1
2007200920112015
What are the most-cited papers on Complexity and Algorithms in Graphs?
ScholarIQmost cited works
A Randomized Rounding Approach to the Traveling Salesman Problem
Shayan Oveis Gharan, Amin Saberi, Mohit Singh
2011184 Citations
Approximating minimum bounded degree spanning trees to within one of optimal
Mohit Singh, Lap Chi Lau
2007158 Citations
Crown Structures for Vertex Cover Kernelization
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
S4210177266. 2007130 Citations
Survivable Network Design with Degree or Order Constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
S153560523. 200973 Citations
Survivable network design with degree or order constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
200767 Citations
Where is Complexity and Algorithms in Graphs research published, and who funds it?
ScholarIQvenues & funding sources
TOP JOURNALS
S4210177266130
S15356052373
S11899248963
TOP FUNDERS
National Science Foundation—
NIH—
Wellcome Trust—
European Research Council—
Funder breakdown is a member featureSign up free to unlock
How much of the research on Complexity and Algorithms in Graphs is open access?
ScholarIQopen access share
0%OPEN ACCESS
Gold
0%
Green
0%
Hybrid
0%
Bronze
0%
Closed
100%
Related on ScholarIQ
Nonconstructive tools for proving polynomial-time decidability
Paper
Iterative Methods in Combinatorial Optimization
Paper
A Randomized Rounding Approach to the Traveling Salesman Problem
Paper
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
Paper
Approximating minimum bounded degree spanning trees to within one of optimal
Paper
Crown Structures for Vertex Cover Kernelization
Paper