In Proceedings

1. On stable cutsets in claw-free graphs and planar graphs, joint work with Raffaele Mosca and Van Bang Le, Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Springer-Verlag Lecture Notes in Computer Science 3787 (2005) 163-174.
   Journal version: Journal of Discrete Algorithms 6 (2008) 256-276.

2. On the recognition of general partition graphs, joint work with Ton Kloks, Chuan-Min Lee and Jiping Liu, Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag Lecture Notes in Computer Science 2880 (2003) 273-283.

3. Feedback vertex set and longest induced path on AT-free graphs, joint work with Dieter Kratsch and Ioan Todinca, Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag Lecture Notes in Computer Science 2880 (2003) 309-321.
   Journal version: Discrete Applied Mathematics 156 (2008) 1936-1947.

4. Random walks on the vertices of transportation polytops with constant number of sources, joint work with Mary Cryan, Martin Dyer and Leen Stougie, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) 330-339.
   Random Structures and Algorithms 33 (2008) 333-355.

5. On the tree-degree of graphs, joint work with Maw-Shang Chang, Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), Springer-Verlag Lecture Notes in Computer Science 2204 (2001) 44-54.

6. On treewidth approximations, joint work with Vincent Bouchitté, Dieter Kratsch and Ioan Todinca, Proceedings of the 1st CologneTwente Workshop on Graphs and Combinatorial Optimization 2001, Electronic Notes in Discrete Mathematics 8 (2001).

7. Bandwidth of split and circular permutation graphs, joint work with Ton Kloks, Dieter Kratsch and Yvan Le Borgne, Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Springer-Verlag Lecture Notes in Computer Science 1928 (2000) 243-254.

8. On the domination search number, joint work with Fedor V. Fomin and Dieter Kratsch, Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Springer-Verlag Lecture Notes in Computer Science 1928 (2000) 161-171.
   Journal version: Discrete Applied Mathematics 127 (2003) 565-580.

9. On the structure of graphs with bounded asteroidal number, joint work with Ton Kloks and Dieter Kratsch, Proceedings of the 6th Twente Workshop on Graphs and Combinatorial Optimization 1999, Electronic Notes in Discrete Mathematics 3 (1999).
   Journal version: Graphs and Combinatorics 17 (2001) 295-306.

10. New branchwidth territories, joint work with Ton Kloks and Jan Kratochvíl, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), Springer-Verlag Lecture Notes in Computer Science 1563 (1999) 173-183.
    Journal version: Discrete Applied Mathematics 145 (2005) 266-275.

11. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems, joint work with Hajo Broersma, Dieter Kratsch and Ton Kloks, Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), Springer-Verlag Lecture Notes in Computer Science 1517 (1998) 88-99.
    Journal version: Algorithmica 32 (2002) 594-610.

12. Degree-preserving forests, joint work with Hajo Broersma, Andreas Huck, Ton Kloks, Otto Koppius, Dieter Kratsch and Hilde Tuinstra, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), Springer-Verlag Lecture Notes in Computer Science 1450 (1998) 713-721.
    Journal version: Networks 35 (2000) 26-39.

13. Asteroidal sets in graphs, joint work with Dieter Kratsch and Ton Kloks, Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'97), Springer-Verlag Lecture Notes in Computer Science 1335 (1997) 227-241.

14. Independent sets in asteroidal triple-free graphs, joint work with Hajo Broersma, Ton Kloks and Dieter Kratsch, Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP'97), Springer-Verlag Lecture Notes in Computer Science 1256 (1997) 760-770.
    Journal version: SIAM Journal on Discrete Mathematics 12 (1999) 276-287.

15. Vertex ranking of asteroidal triple-free graphs, joint work with Ton Kloks and C. K. Wong, Proceedings of the 7th Annunal International Symposium on Algorithms and Computation (ISAAC'96), Springer-Verlag Lecture Notes in Computer Science 1178 (1996) 174-182.
    Journal version: Information Processing Letters 68 (1998) 201-206.

16. Finding and counting small subgraphs efficiently, joint work with Ton Kloks and Dieter Kratsch, Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'95), Springer-Verlag Lecture Notes in Computer Science 1017 (1995) 14-23.
    Journal version: Information Processing Letters 74 (2000) 115-121.

17. Approximating the bandwidth for asteroidal triple-free graphs, joint work with Ton Kloks and Dieter Kratsch, Proceedings of the 3rd Annual European Symposium on Algorithms (ESA'95), Springer-Verlag Lecture Notes in Computer Science 979 (1995) 434-447.
    Journal version: Journal of Algorithms 32 (1999) 41-57.

18. Ranking of graphs, joint work with Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch and Zsolt Tuza, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'94), Springer-Verlag Lecture Notes in Computer Science 903 (1995) 292-304.
    Journal version: SIAM Journal on Discrete Mathematics 11 (1998) 168-181.

19. Dominoes, joint work with Ton Kloks and Dieter Kratsch, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'94), Springer-Verlag Lecture Notes in Computer Science 903 (1995) 106-120.

20. The minimum broadcast time problem for several processor networks, joint work with Klaus Jansen, Proceedings of the 1st Canada-France Conference on Parallel and Distributed Computing, Springer-Verlag Lecture Notes in Computer Science 805 (1994) 219-234.
    Journal version: Theoretical Computer Science 147 (1995) 69-85.

21. On vertex ranking for permutation and other graphs, joint work with Jitender S. Deogun, Ton Kloks and Dieter Kratsch, Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), Springer-Verlag Lecture Notes in Computer Science 775 (1994) 747-758.
    Journal version: Discrete Applied Mathematics 98 (1999) 39-63.

22. Computing TREEWIDTH and MINIMUM FILL-IN: all you need are all minimal separators, joint work with Ton Kloks, Hans L. Bodlaender and Dieter Kratsch, Proceedings of the First Annual European Symposium on Algorithms (ESA'93), Springer-Verlag Lecture Notes in Computer Science 726 (1993) 260-271. Erratum Springer-Verlag Lecture Notes in Computer Science 855 (1994) 508.