The complexity of searching a graph
Journal of the ACM (JACM)
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
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)
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
On the Domination Search Number
WG '00 Proceedings of the 26th 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
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Finding hidden independent sets in interval graphs
Theoretical Computer Science
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Searching expenditure and interval graphs
Discrete Applied Mathematics
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
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
Node-searching problem on block graphs
Discrete Applied Mathematics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
Distributed chasing of network intruders
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
Digraph Strong Searching: Monotonicity and Complexity
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On the Monotonicity of Weak Searching
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Vision-Based Pursuit-Evasion in a Grid
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Monotonicity in digraph search problems
Theoretical Computer Science
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
Maximum vertex occupation time and inert fugitive: Recontamination does help
Information Processing Letters
Edge searching weighted graphs
Discrete Applied Mathematics
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
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reconfiguration of the routing in WDM networks with two classes of services
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
A Self-stabilizing Algorithm for Graph Searching in Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Lower Bounds on Fast Searching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding hidden independent sets in interval graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Intruder capture in Sierpinski graphs
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Directed searching digraphs: monotonicity and complexity
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Monotonicity of non-deterministic graph searching
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
Arc searching digraphs without jumping
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
Network decontamination with local immunization
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
Fast edge-searching and related problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Fast edge searching and fast searching on graphs
Theoretical Computer Science
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Vision-Based Pursuit-Evasion in a Grid
SIAM Journal on Discrete Mathematics
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
Connected searching of weighted trees
Theoretical Computer Science
LIFO-search on digraphs: a searching game for cycle-rank
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Fast searching games on graphs
Journal of Combinatorial Optimization
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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
Edge search number of cographs
Discrete Applied Mathematics
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
Information and Computation
Step-wise tile assembly with a constant number of tile types
Natural Computing: an international journal
Approximate search strategies for weighted trees
Theoretical Computer Science
Lower bounds on edge searching
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Discrete Applied Mathematics
| Hi-index | 5.24 |