Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cutwidth I: a linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
On problems without polynomial kernels
Journal of Computer and System Sciences
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Graph coloring and the immersion order
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
European Journal of Combinatorics
| Hi-index | 0.00 |