A survey of graph layout problems
ACM Computing Surveys (CSUR)
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 interval completion of chordal graphs
Discrete Applied Mathematics
Node-searching problem on block graphs
Discrete Applied Mathematics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Minimal interval completion through graph exploration
Theoretical Computer Science
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
On the interval completion of chordal graphs
Discrete Applied Mathematics
Pursuing a fast robber on a graph
Theoretical Computer Science
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Mixed search number and linear-width of interval and split graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Edge search number of cographs
Discrete Applied Mathematics
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Approximate search strategies for weighted trees
Theoretical Computer Science
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Discrete Applied Mathematics
| Hi-index | 0.00 |