On the Complexity of Two Circle Strongly Connecting Problems
IEEE Transactions on Computers
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
Consideration set generation in commerce search
Proceedings of the 20th international conference on World wide web
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Parameterized complexity of independence and domination on geometric graphs
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
| Hi-index | 0.89 |