| 2016 | WG | Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. | Andreas Brandstdt, Raffaele Mosca |
| 2015 | MFCS | Bounding the Clique-Width of H-free Chordal Graphs. | Andreas Brandstdt, Konrad K. Dabrowski, Shenwei Huang, Danil Paulusma |
| 2015 | WG | Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. | Andreas Brandstdt, Elaine M. Eschen, Erik Friese |
| 2013 | MFCS | New Polynomial Cases of the Weighted Efficient Domination Problem. | Andreas Brandstdt, Martin Milanic, Ragnar Nevries |
| 2012 | ISAAC | Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. | Andreas Brandstdt, Arne Leitert, Dieter Rautenbach |
| 2011 | ISAAC | Dominating Induced Matchings for P 7-free Graphs in Linear Time. | Andreas Brandstdt, Raffaele Mosca |
| 2010 | LATIN | Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. | Andreas Brandstdt, Christian Hundt, Ragnar Nevries |
| 2008 | COCOA | Simplicial Powers of Graphs. | Andreas Brandstdt, Van Bang Le |
| 2008 | COCOA | On k-Versus (k+1)-Leaf Powers. | Andreas Brandstdt, Peter Wagner |
| 2008 | ISAAC | Independent Sets of Maximum Weight in Apple-Free Graphs. | Andreas Brandstdt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
| 2008 | LATIN | Ptolemaic Graphs and Interval Graphs Are Leaf Powers. | Andreas Brandstdt, Christian Hundt |
| 2007 | MFCS | On ( | Andreas Brandstdt, Peter Wagner |
| 2005 | FCT | Clique-Width for Four-Vertex Forbidden Subgraphs. | Andreas Brandstdt, Joost Engelfriet, Hong-Oanh Le, Vadim V. Lozin |
| 2005 | FCT | New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. | Andreas Brandstdt, Van Bang Le, Suhail Mahfud |
| 2005 | IPCO | On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. | Andreas Brandstdt, Chnh T. Hong |
| 2003 | FCT | Linear Time Algorithms for Some NP-Complete Problems on (P | Hans L. Bodlaender, Andreas Brandstdt, Dieter Kratsch, Michal Rao, Jeremy P. Spinrad |
| 2003 | WG | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2002 | ISAAC | Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le |
| 2002 | WG | New Graph Classes of Bounded Clique-Width. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Raffaele Mosca |
| 2001 | FCT | On Robust Algorithms for the Maximum Weight Stable Set Problem. | Andreas Brandstdt |
| 2000 | WG | Split-Perfect Graphs: Characterizations and Algorithmic Use. | Andreas Brandstdt, Van Bang Le |
| 1999 | WG | Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. | Andreas Brandstdt, Feodor F. Dragan, Ekkehard Khler |
| 1997 | ESA | Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). | Andreas Brandstdt, Victor Chepoi, Feodor F. Dragan |
| 1996 | WG | LexBFS-Orderings and Power of Graphs. | Feodor F. Dragan, Falk Nicolai, Andreas Brandstdt |
| 1995 | WG | Homogeneously Orderable Graphs and the Steiner Tree Problem. | Andreas Brandstdt, Feodor F. Dragan, Falk Nicolai |
| 1994 | STACS | Dominating Cliques in Graphs with Hypertree Structures. | Feodor F. Dragan, Andreas Brandstdt |
| 1994 | WG | The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. | Andreas Brandstdt, Victor Chepoi, Feodor F. Dragan |
| 1993 | WG | Dually Chordal Graphs. | Andreas Brandstdt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |
| 1993 | WG | Short Disjoint Cycles in Graphs with Degree Constraints. | Andreas Brandstdt, Heinz-Jrgen Voss |
| 1992 | WG | On Improved Time Bounds for Permutation Graph Problems. | Andreas Brandstdt |
| 1991 | WG | Short Disjoint Cycles in Cubic Bridgeless Graphs. | Andreas Brandstdt |
| 1989 | FCT | The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. | Andreas Brandstdt |
| 1985 | FCT | On the restriction of some NP-complete graph problems to permutation graphs. | Andreas Brandstdt, Dieter Kratsch |
| 1983 | FCT | Reversal-Bounded and Visit-Bounded Realtime Computations. | Andreas Brandstdt, Klaus W. Wagner |
| 1981 | MFCS | Pushdown Automata with Restricted Use of Storage Symbols. | Andreas Brandstdt |