Efficient Algorithms for graphs with maximum neighbourhood orderings and related elimination orderings
(Project supported by the Volkswagen-Stiftung 1994-1996 together with H.-J. Bandelt, Mathematisches Seminar der Universität Hamburg) A. Brandstädt, V.D. Chepoi
(Kishinev, now Marseille), F.F. Dragan (Kishinev, Rostock, Los Angeles, now Kent State University), V.I. Voloshin (Kishinev)
Hypertree algorithms
Project supported by the German Research Council (DFG) 1995-1997, A. Brandstädt, F. Nicolai (Universität Duisburg), T. Szymczak
Algorithms for solving optimization problems in discrete metric structures
Project supported by the German Research Council (DFG) 1996-1999, A. Brandstädt, F.F. Dragan
Special classes of graphs: representations, local properties, characterizations, algorithms
supported by the European Community (EU) - INTAS-Project 1998-2001 together with a group of the Belorussian State University of Minsk (R. Tyshkevich),
a group of the Belorussian Academy of Sciences (V. Sarvanov), H. Fleischner (Austrian Academy of Sciences, Vienna) and V. Giakoumakis (University of Amiens, France)
Robust algorithms for solving algorithmic graph problems, restricted to special graph classes
Project supported by the German Research Council (DFG) 2000-2003, A. Brandstädt, Stephan Foeldes, Raffaele Mosca, Hoang-Oanh Le
Phylogenetic trees, k-leaf powers and variants
Project supported by the German Research Council (DFG) 2007-2008, A. Brandstädt, Peter Wagner