In Journals

1. Even-hole-free graphs that do not contain diamonds: a structure theorem and its consequences, joint work with Kristina Vuškovic and Ton Kloks, Journal of Combinatorial Theory, Series B 99 (2009) 733-800.

2. On a property of minimal triangulations, joint work with Dieter Kratsch, Discrete Mathematics 309 (2009) 1724-1729.

3. Random walks on the vertices of transportation polytopes with constant number of sources, joint work with Mary Cryan, Martin Dyer and Leen Stougie, Random Structures and Algorithms 33 (2008) 333-355.

4. Feedback vertex set on AT-free graphs, joint work with Dieter Kratsch and Ioan Todinca, Discrete Applied Mathematics 156 (2008) 1936-1947.

5. On stable cutsets in claw-free graphs and planar graphs, joint work with Raffaele Mosca and Van Bang Le, Journal of Discrete Algorithms 6 (2008) 256-276.

6. Computing the branchwidth of interval graphs, joint work with Ton Kloks and Jan Kratochvíl, Discrete Applied Mathematics 145 (2005) 266-275.

7. On treewidth approximations, joint work with Vincent Bouchitté, Dieter Kratsch and Ioan Todinca, Discrete Applied Mathematics 136 (2004) 183-196.

8. Algorithms for graphs with small octopus, joint work with Fedor V. Fomin and Dieter Kratsch, Discrete Applied Mathematics 134 (2004) 105-128.

9. Additive tree spanners, joint work with Dieter Kratsch, Hoàng-Oanh Le, Erich Prisner and Dorothea Wagner, SIAM Journal on Discrete Mathematics 17 (2003) 332-340.

10. Splitting a graph into disjoint induced paths or cycles, joint work with Hoàng-Oanh Le and Van Bang Le, Discrete Applied Mathematics 131 (2003) 199-212.

11. On the domination search number, joint work with Fedor V. Fomin and Dieter Kratsch, Discrete Applied Mathematics 127 (2003) 565-580.

12. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems, joint work with Hajo Broersma, Ton Kloks and Dieter Kratsch, Algorithmica 32 (2002) 594-610.

13. On the structure of graphs with bounded asteroidal number, joint work with Ton Kloks and Dieter Kratsch, Graphs and Combinatorics 17 (2001) 295-306.

14. Efficient algorithms for graphs with few P₄s, joint work with Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch and Stephan Olariu, Discrete Mathematics 235 (2001) 29-51.

15. Partial orders on weak orders convex subsets, joint work with Jean-Xavier Rampon, Order 17 (2000) 103-123.

16. Finding and counting small subgraphs efficiently, joint work with Ton Kloks and Dieter Kratsch, Information Processing Letters 74 (2000) 115-121.

17. Degree-preserving trees, joint work with Hajo Broersma, Andreas Huck, Ton Kloks, Otto Koppius, Dieter Kratsch and Hilde Tuinstra, Networks 35 (2000) 26-39.

18. On the vertex ranking problem for trapezoid, circular-arc and other graphs, joint work with Jitender S. Deogun, Ton Kloks and Dieter Kratsch, Discrete Applied Mathematics 98 (1999) 39-63.

19. Approximating the bandwidth for asteroidal triple-free graphs joint work with Ton Kloks and Dieter Kratsch, Journal of Algorithms 32 (1999) 41-57.

20. Independent sets in asteroidal triple-free graphs, joint work with Hajo Broersma, Ton Kloks and Dieter Kratsch, SIAM Journal on Discrete Mathematics 12 (1999) 276-287.

21. Bandwidth on chain graphs, joint work with Ton Kloks and Dieter Kratsch, Information Processing Letters 68 (1998) 313-315.

22. Vertex ranking of asteroidal triple-free graphs, joint work with Ton Kloks and C. K. Wong, Information Processing Letters 68 (1998) 201-206.

23. Treewidth and minimum fill-in on d-trapezoid graphs, joint work with Hans L. Bodlaender, Ton Kloks and Dieter Kratsch, Journal of Graph Algorithms and Applications 2 (1998) 1-23.

24. Ranking of graphs, joint work with Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch and Zsolt Tuza, SIAM Journal on Discrete Mathematics 11 (1998) 168-181.

25. Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Applied Mathematics 78 (1997) 189-205. Erratum

26. Measuring the vulnerability for classes of intersection graphs, joint work with Dieter Kratsch and Ton Kloks, Discrete Applied Mathematics 77 (1997) 259-270.

27. Partial orders and their convex subsets, joint work with Jean-Xavier Rampon, Discrete Mathematics 165/166 (1997) 507-517.

28. HAMILTONIAN CIRCUIT in chordal bipartite graphs, Discrete Mathematics 156 (1996) 291-298.

29. Toughness, hamiltonicity and split graphs, joint work with Dieter Kratsch and Jenö Lehel, Discrete Mathematics 150 (1996) 231-245.

30. On edge perfectness and classes of bipartite graphs, Discrete Mathematics 149 (1996) 159-187.

31. The minimum broadcast time problem for several processor networks, joint work with Klaus Jansen, Theoretical Computer Science 147 (1995) 69-85.

32. Polynomial time algorithms for HAMILTONian problems on bipartite distance hereditary graphs, joint work with Falk Nicolai, Information Processing Letters 46 (1993) 225-230.

33. A note on balanced immunity, Mathematical Systems Theory 26 (1993) 157-167.

34. Domination in convex and chordal bipartite graphs, joint work with Peter Damaschke and Dieter Kratsch, Information Processing Letters 36 (1990) 231-236.

35. Alternating cycle-free matchings, Order 7 (1990) 11-21.

36. The NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs, joint work with Andreas Brandstädt, Theoretical Computer Science 53 (1987) 257-265.