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
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th 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
On the domination search number
Discrete Applied Mathematics
Computing the vertex separation of unicyclic graphs
Information and Computation
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Cutwidth I: a linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Visibility-based Pursuit-evasion with Limited Field of View
International Journal of Robotics Research
Node-searching problem on block graphs
Discrete Applied Mathematics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Journal of Discrete Algorithms
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
Visibility-based pursuit-evasion with limited field of view
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Dependency structure matrix, genetic algorithms, and effective recombination
Evolutionary Computation
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Hierarchical BOA solves ising spin glasses and MAXSAT
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
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
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Optimal head-driven parsing complexity for linear context-free rewriting systems
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Distance constrained labelings of graphs of bounded treewidth
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
On cutwidth parameterized by vertex cover
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A branch-and-bound algorithm for the minimum cut linear arrangement problem
Journal of Combinatorial Optimization
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |