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)
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
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Searching with Mobile Agents in Networks with Liars
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
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
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
Searching expenditure and interval graphs
Discrete Applied Mathematics
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 II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
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
Node-searching problem on block 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
AAIM '08 Proceedings of the 4th 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
Monotonicity in digraph search problems
Theoretical Computer Science
Monotony properties of connected visible graph searching
Information and Computation
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
Theoretical Computer Science
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
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
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
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
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
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The cost of monotonicity in distributed graph searching
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
GSST: anytime guaranteed search
Autonomous Robots
Agent-based coordination of human-multirobot teams in complex environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with temporal immunity by cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Fast edge searching and fast searching on graphs
Theoretical Computer Science
Digraph decompositions and monotonicity in digraph searching
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
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Fast searching games on graphs
Journal of Combinatorial Optimization
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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
Sweeping graphs with large clique number
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Edge search number of cographs
Discrete Applied Mathematics
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Information and Computation
Lower bounds on edge searching
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Computability of width of submodular partition functions
European Journal of Combinatorics
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Discrete Applied Mathematics
| Hi-index | 0.02 |