STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Finding a Path of Superlogarithmic Length
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finding paths and cycles of superpolylogarithmic length
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Algorithms for long paths in graphs
Theoretical Computer Science
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Finding monotone paths in edge-ordered graphs
Discrete Applied Mathematics
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Journal of Combinatorial Theory Series B
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
IEEE/ACM Transactions on Networking (TON)
Survey: Subexponential parameterized algorithms
Computer Science Review
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Hi-index | 0.00 |