Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Branch-width and well-quasi-ordering in matroids and graphs
Journal of Combinatorial Theory Series B
On matroids of branch-width three
Journal of Combinatorial Theory Series B
Discrete Mathematics - Algebraic and topological methods in graph theory
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the excluded minors for the matroids of branch-width k
Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Graph minors. XVIII. tree-decompositions and well-quasi-ordering
Journal of Combinatorial Theory Series B
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Partitioning Matroids with Only Small Cocircuits
Combinatorics, Probability and Computing
Graph Minors. XIX. Well-quasi-ordering on a surface
Journal of Combinatorial Theory Series B
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
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Journal of Combinatorial Theory Series B
Journal of Computer and System Sciences
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Obstructions to branch-decomposition of matroids
Journal of Combinatorial Theory Series B
Branch-width, parse trees, and monadic second-order logic for matroids
Journal of Combinatorial Theory Series B
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
The branchwidth of graphs and their cycle matroids
Journal of Combinatorial Theory Series B
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
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
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Graph colouring with no large monochromatic components
Combinatorics, Probability and Computing
On Integer Programming and the Branch-Width of the Constraint Matrix
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Excluding a group-labelled graph
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
List-color-critical graphs on a fixed surface
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science
Graph operations characterizing rank-width
Discrete Applied Mathematics
Addendum to matroid tree-width
European Journal of Combinatorics
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
Tangles, tree-decompositions and grids in matroids
Journal of Combinatorial Theory Series B
Information Processing Letters
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Discrete Applied Mathematics
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
Factored planning using decomposition trees
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computational study on planar dominating set problem
Theoretical Computer Science
Hypertree-decomposition via branch-decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Algorithms for propositional model counting
Journal of Discrete Algorithms
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Partitions versus sets: A case of duality
European Journal of Combinatorics
Graph minors XXIII. Nash-Williams' immersion conjecture
Journal of Combinatorial Theory Series B
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Combinations of local search and exact algorithms
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Proceedings of the forty-second ACM symposium on Theory of computing
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity results for the spanning tree congestion problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Computational study for planar connected dominating set problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Theoretical Computer Science
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
Linear connectivity forces large complete bipartite minors: An alternative approach
Journal of Combinatorial Theory Series B
Note: On self-duality of branchwidth in graphs of bounded genus
Discrete Applied Mathematics
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Generation of graphs with bounded branchwidth
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Exact distance oracles for planar 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
New advances in inference by recursive conditioning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Optimal branch-decomposition of planar graphs in O(n3) time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
New tools and simpler algorithms for branchwidth
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Two birds with one stone: the best of branchwidth and treewidth with one algorithm
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The branch-width of circular-arc graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Graph classes with structured neighborhoods and algorithmic applications
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Computational study on bidimensionality theory based algorithm for longest path problem
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
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
Survey: Subexponential parameterized algorithms
Computer Science Review
FPT results for signed domination
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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
Deciding first order properties of matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Information and Computation
On the excluded minor structure theorem for graphs of large tree-width
Journal of Combinatorial Theory Series B
Approximate search strategies for weighted trees
Theoretical Computer Science
Computability of width of submodular partition functions
European Journal of Combinatorics
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Graph classes with structured neighborhoods and algorithmic applications
Theoretical Computer Science
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
Square roots of minor closed graph classes
Discrete Applied Mathematics
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
| Hi-index | 0.01 |