Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
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)
STOC '94 Proceedings of the twenty-sixth 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
Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Exploiting structure in quantified formulas
Journal of Algorithms
On the Accuracy and Running Time of GSAT
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
On Synthesis of Easily Testable (k, K) Circuits
IEEE Transactions on Computers
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
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
The complexity of finding small triangulations of convex 3-polytopes
Journal of Algorithms - Special issue: SODA 2000
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
Information Processing Letters
Efficiently parallelizable problems on a class of decomposable graphs
Journal of Computer and System Sciences
Journal of Combinatorial Theory Series B
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
DAG-width: connectivity measure for directed graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
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
Traversing the machining graph
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Maximum Independent Set Problem in Planar Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
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
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
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics
Power Indices in Spanning Connectivity Games
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
On minimal tree realizations of linear codes
IEEE Transactions on Information Theory
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Treewidth computations I. Upper bounds
Information and Computation
Isoperimetric inequalities and the width parameters of graphs
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
Tree-width and optimization in bounded degree graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A note on root choice for parallel processing of tree decompositions
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Optimal root choice for parallel processing of tree decompositions
International Journal of Intelligent Information and Database Systems
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Vertex-bipartition method for colouring minor-closed classes of graphs
Combinatorics, Probability and Computing
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
An efficient partitioning oracle for bounded-treewidth graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Phylogenetic network inferences through efficient haplotyping
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Treewidth: characterizations, applications, and computations
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
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
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Efficient parameterized algorithm for biopolymer structure-sequence alignment
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Tree-width of hypergraphs and surface duality
Journal of Combinatorial Theory Series B
Graphs of separability at most 2
Discrete Applied Mathematics
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
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
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
Journal of Combinatorial Theory Series B
Survey: Subexponential parameterized algorithms
Computer Science Review
Exact algorithms for a discrete metric labeling problem
Discrete Optimization
On shortest disjoint paths in planar graphs
Discrete Optimization
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
Traveling salesman problem under categorization
Operations Research Letters
Reliability analysis of a simple replicated and-fork/and-join graph
Operations Research Letters
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Algorithms for bandwidth consecutive multicolorings of graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Submodular minimization via pathwidth
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
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Coloring graphs characterized by a forbidden subgraph
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.12 |