Concerning the achromatic number of graphs
Journal of Combinatorial Theory Series B
American Mathematical Monthly
The NP-completeness column: an ongoing guide
Journal of Algorithms
Nonconstructive advances in polynomial-time complexity
Information Processing Letters
On the complexity of covering vertices by faces in a planar graph
SIAM Journal on Computing
Layout permutation problems and well-partially-ordered sets
Proceedings of the fifth MIT conference on Advanced research in VLSI
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Finding a minimum circuit in a graph
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Complexity of cycle and path problems in graphs
Complexity of cycle and path problems in graphs
Graph Theory With Applications
Graph Theory With Applications
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On the Complements of Partial k-Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation - TACS 2001
Consistency of Natural Relations on Sets
Combinatorics, Probability and Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Finding paths and cycles of superpolylogarithmic length
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Innovative computational methods for transcriptomic data analysis
Proceedings of the 2006 ACM symposium on Applied computing
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Graph coloring and the immersion order
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Note: A decidability result for the dominating set problem
Theoretical Computer Science
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster parameterized algorithms for minor containment
Theoretical Computer Science
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Effective computation of immersion obstructions for unions of graph classes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Information and Computation
Linear kernels and single-exponential algorithms via protrusion decompositions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Effective computation of immersion obstructions for unions of graph classes
Journal of Computer and System Sciences
| Hi-index | 0.01 |
Recent advances in graph theory and graph algorithms dramatically alter the traditional view of concrete complexity theory, in which a decision problem is generally shown to be in P by producing an efficient algorithm to solve an optimization version of the problem. Nonconstructive tools are now available for classifying problems as decidable in polynomial time by guaranteeing only the existence of polynomial-time decision algorithms. In this paper these new methods are employed to prove membership in P for a number of problems whose complexities are not otherwise known. Powerful consequences of these techniques are pointed out and their utility is illustrated. A type of partially ordered set that supports this general approach is defined and explored.