SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the induced matching problem
Journal of Computer and System Sciences
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Planar crossing numbers of genus g graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |