Disjoint paths in circular arc graphs
Nordic Journal of Computing
Powers of Geometric Intersection Graphs and Dispersion Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Maintenance of a Percing Set for Intervals with Applications
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Efficient Dispersion Algorithms for Geometric Intersection Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Powers of geometric intersection graphs and dispersion algorithms
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
A linear-time algorithm for optimal barrier placement
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
From a Circular-Arc Model to a Proper Circular-Arc Model
Graph-Theoretic Concepts in Computer Science
A Vector Assignment Approach for the Graph Coloring Problem
Learning and Intelligent Optimization
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Generalized shooter location problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal cover of points by disks in a simple polygon
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Algorithms for interval structures with applications
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Domination when the stars are out
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Power domination problem in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Graph classes with structured neighborhoods and algorithmic applications
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing
Journal of Discrete Algorithms
Optimization problems in dotted interval graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Algorithms for interval structures with applications
Theoretical Computer Science
Graph classes with structured neighborhoods and algorithmic applications
Theoretical Computer Science
| Hi-index | 0.89 |