Upload Records Snowball Search Search OpenAlex
About the database ScholarIQanswers from OpenAlex
Advanced Graph Theory Research
TopicLeading institutions, researchers & key papers
This cluster of papers represents advances in graph theory and algorithms, focusing on topics such as parameterized complexity, fixed-parameter algorithms, constraint satisfaction problems, treewidth, kernelization, complexity classification, approximation algorithms, and homomorphism. The papers cover a wide range of algorithmic applications and theoretical developments in the field of graph theory.
14
Works
IDs:OpenAlex
How has Advanced Graph Theory Research's publication output changed over time?
ScholarIQpublication output · 1978–2014
Output grew0% over the shown period — from 1 works in 1978 to 1 in 2014.
1
1
1
1
1
19782003200420112014
What are the most-cited papers on Advanced Graph Theory Research?
ScholarIQmost cited works
Iterative Methods in Combinatorial Optimization
Lap Chi Lau, R. Ravi, Mohit Singh
Cambridge University Press eBooks. 2011195 Citations
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
Faisal N. Abu-Khzam, R. Lorraine Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons
2004166 Citations
Ore’s condition for completely independent spanning trees
Genghua Fan, Yanmei Hong, Qinghai Liu
S171741597. 201458 CitationsOPEN ACCESS
The C3-structure of the tournaments
Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé
S18902827. 200324 CitationsOPEN ACCESS
Where is Advanced Graph Theory Research research published, and who funds it?
ScholarIQvenues & funding sources
TOP JOURNALS
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 Advanced Graph Theory Research is open access?
ScholarIQopen access share
40%OPEN ACCESS
Gold
0%
Green
0%
Hybrid
0%
Bronze
40%
Closed
60%
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