Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Coloring triangle-free graphs on surfaces
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved algorithm for finding cycles through elements
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Proceedings of the forty-second ACM symposium on Theory of computing
A linear time algorithm for the induced disjoint paths problem in planar graphs
Journal of Computer and System Sciences
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
Hi-index | 0.00 |