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
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Optimal node-degree bounds for the complexity of nonplanarity parameters
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Finding long paths and cycles in sparse Hamiltonian graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Universal stability of undirected graphs in the adversarial queueing model
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Graphs with magnetic Schrödinger operators of low corank
Journal of Combinatorial Theory Series B
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Disjoint paths in circular arc graphs
Nordic Journal of Computing
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
The structure of obstructions to treewidth and pathwidth
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation - TACS 2001
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
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
An improved linear edge bound for graph linkages
European Journal of Combinatorics - Special issue: Topological graph theory II
Finding large cycles in Hamiltonian graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Cutwidth I: a linear time fixed parameter algorithm
Journal of Algorithms
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Interconnection semantics for keyword search in XML
Proceedings of the 14th ACM international conference on Information and knowledge management
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
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
Survivable virtual concatenation for data over SONET/SDH in optical transport networks
IEEE/ACM Transactions on Networking (TON)
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Chordless paths through three vertices
Theoretical Computer Science - Parameterized and exact computation
The first order definability of graphs with separators via the Ehrenfeucht game
Theoretical Computer Science - Game theory meets theoretical computer science
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
On Sufficient Degree Conditions for a Graph to be $k$-linked
Combinatorics, Probability and Computing
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
Journal of Combinatorial Theory Series B
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Journal of Combinatorial Theory Series B
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph colouring with no large monochromatic components
Combinatorics, Probability and Computing
The extremal function for 3-linked graphs
Journal of Combinatorial Theory Series B
Locally planar graphs are 5-choosable
Journal of Combinatorial Theory Series B
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
On the odd-minor variant of Hadwiger's conjecture
Journal of Combinatorial Theory Series B
Excluding a group-labelled graph
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
A polynomial-time algorithm to find a linkless embedding of a graph
Journal of Combinatorial Theory Series B
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Quantum Information Processing
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
International Journal of Approximate Reasoning
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Computer Communications
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Note: Note on coloring graphs without odd-Kk-minors
Journal of Combinatorial Theory Series B
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics
Partitioning Graphs into Connected Parts
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms
Partitioning graphs into connected parts
Theoretical Computer Science
Disjoint directed and undirected paths and cycles in digraphs
Theoretical Computer Science
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
European Journal of Combinatorics
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Parameterizing Cut Sets in a Graph by the Number of Their Components
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On Partitioning a Graph into Two Connected Subgraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On Contracting Graphs to Fixed Pattern Graphs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
Finite planar emulators for K4,5-4K2 and K1,2,2,2 and Fellows' Conjecture
European Journal of Combinatorics
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Treewidth computations I. Upper bounds
Information and Computation
Graph minors XXIII. Nash-Williams' immersion conjecture
Journal of Combinatorial Theory Series B
Finding large cycles in Hamiltonian graphs
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On exact complexity of subgraph homeomorphism
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A very practical algorithm for the two-paths problem in 3-connected planar graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Wheel-free deletion is W[2]-hard
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient algorithms for node disjoint subgraph homeomorphism determination
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Journal of Computer and System Sciences
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Improved algorithm for the half-disjoint paths problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Fast minor testing in planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG)
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Notes: Packing cycles through prescribed vertices
Journal of Combinatorial Theory Series B
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Quantum Information Processing
Subexponential algorithms for partial cover problems
Information Processing Letters
Theoretical Computer Science
Edge contractions in subclasses of chordal graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Tight bounds for linkages in planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Algorithms for finding a maximum non-k-linked graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
On partitioning a graph into two connected subgraphs
Theoretical Computer Science
Faster parameterized algorithms for minor containment
Theoretical Computer Science
Combinatorial optimization with 2-joins
Journal of Combinatorial Theory Series B
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Containment relations in split graphs
Discrete Applied Mathematics
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate tree decompositions of planar graphs in linear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
A linear time algorithm for the induced disjoint paths problem in planar graphs
Journal of Computer and System Sciences
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B
Finding disjoint paths on directed acyclic graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On graph contractions and induced minors
Discrete Applied Mathematics
The complexity of minimum convex coloring
Discrete Applied Mathematics
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics
Finding contractions and induced minors in chordal graphs via disjoint paths
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Planar disjoint-paths completion
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Finding an induced subdivision of a digraph
Theoretical Computer Science
Solving the 2-disjoint connected subgraphs problem faster than 2n
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
Journal of Combinatorial Theory Series B
Complexity evaluation of benchmark instances for the p-median problem
Mathematical and Computer Modelling: An International Journal
Survey: Subexponential parameterized algorithms
Computer Science Review
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
On shortest disjoint paths in planar graphs
Discrete Optimization
Linkage for the diamond and the path with four vertices
Journal of Graph Theory
Finding odd cycle transversals
Operations Research Letters
Scheduling of vehicles in transportation networks
Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Multiflows in symmetric digraphs
Discrete Applied Mathematics
Induced disjoint paths in AT-Free graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Effective computation of immersion obstructions for unions of graph classes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Obtaining planarity by contracting few edges
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
Fundamenta Informaticae
Information and Computation
Note on the hardness of generalized connectivity
Journal of Combinatorial Optimization
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Hypertree-depth and minors in hypergraphs
Theoretical Computer Science
Induced disjoint paths in claw-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
MSOL restricted contractibility to planar graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Detecting induced star-like minors in polynomial time
Journal of Discrete Algorithms
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Obtaining planarity by contracting few edges
Theoretical Computer Science
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Testing subdivision-freeness: property testing meets structural graph theory
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
The next-to-shortest path in undirected graphs with nonnegative weights
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
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
A quasi-polynomial time partition oracle for graphs with an excluded minor
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Detecting an induced net subdivision
Journal of Combinatorial Theory Series B
Effective computation of immersion obstructions for unions of graph classes
Journal of Computer and System Sciences
Kernel bounds for path and cycle problems
Theoretical Computer Science
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science
Adiabatic quantum programming: minor embedding with hard faults
Quantum Information Processing
The density maximization problem in graphs
Journal of Combinatorial Optimization
Square roots of minor closed graph classes
Discrete Applied Mathematics
| Hi-index | 0.02 |