Efficient approximation schemes for maximization problems on K3,3-free of K5-free graphs

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Information Processing Letters

The longest common subsequence problem for sequences with nested arc annotations

Journal of Computer and System Sciences - Computational biology 2002

The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Approximation Algorithms for Independent Sets in Map Graphs

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

Equivalence of local treewidth and linear local treewidth and its algorithmic applications

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Improved induced matchings in sparse graphs

Discrete Applied Mathematics