Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms
On the Domination Search Number
WG '00 Proceedings of the 26th 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
On the Monotonicity of Games Generated by Symmetric Submodular Functions
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 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
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Searching expenditure and interval graphs
Discrete Applied Mathematics
Randomized pursuit-evasion with limited visibility
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the vertex separation of unicyclic graphs
Information and Computation
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
Node-searching problem on block graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
The role of information in the cop-robber game
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Monotony properties of connected visible graph searching
Information and Computation
Computing and Updating the Process Number in Trees
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Edge searching weighted graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
On Partitioning a Graph into Two Connected Subgraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Intruder capture in Sierpinski graphs
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Graph searching in a crime wave
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Secure upgrade of hardware security modules in bank networks
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
On partitioning a graph into two connected subgraphs
Theoretical Computer Science
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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
Discrete Applied Mathematics
| Hi-index | 0.01 |