Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Total Colorings of Degenerated Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Finding Independent Spanning Trees in Partial k-Trees
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms for the Multicolorings of Partial k-Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Parameterized graph cleaning problems
Discrete Applied Mathematics
Chromatic index of graphs with no cycle with a unique chord
Theoretical Computer Science
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and 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 frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Partitioning a weighted graph to connected subgraphs of almost uniform size
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Approximability of partitioning graphs with supply and demand
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
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
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Practical graph isomorphism, II
Journal of Symbolic Computation
| Hi-index | 0.01 |