LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Hi-index | 0.00 |