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
Counting H-colorings of partial k-trees
Theoretical Computer Science
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
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
Approximation of Pathwidth of Outerplanar Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Computing the vertex separation of unicyclic graphs
Information and Computation
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
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
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
Nash equilibria in graphical games on trees revisited
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Online promise problems with online width metrics
Journal of Computer and System Sciences
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Information Processing Letters
Node-searching problem on block graphs
Discrete Applied Mathematics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Constraint complexity of realizations of linear codes on arbitrary graphs
IEEE Transactions on Information Theory
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On the treewidth and pathwidth of biconvex bipartite graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algorithms and theory of computation handbook
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
The complexity of minimum convex coloring
Discrete Applied Mathematics
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
k-chordal graphs: from cops and robber to compact routing via treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Approximate search strategies for weighted trees
Theoretical Computer Science
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Imbalance is fixed parameter tractable
Information Processing Letters
| Hi-index | 0.06 |