| Graph classes: a survey A Brandstädt, VB Le, JP Spinrad Society for Industrial and Applied Mathematics, 1999 | 2469 | 1999 |
| Bipartite permutation graphs J Spinrad, A Brandstädt, L Stewart Discrete Applied Mathematics 18 (3), 279-292, 1987 | 318 | 1987 |
| Van Bang Le, and Jeremy P. Spinrad A Brandstädt Graph classes: a survey 3, 1999 | 299 | 1999 |
| Dually chordal graphs A Brandstädt, F Dragan, V Chepoi, V Voloshin SIAM journal on discrete mathematics 11 (3), 437-455, 1998 | 249 | 1998 |
| The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs H Müller, A Brandstädt Theoretical Computer Science 53 (2-3), 257-265, 1987 | 185 | 1987 |
| The algorithmic use of hypertree structure and maximum neighbourhood orderings A Brandstädt, VD Chepoi, FF Dragan Discrete Applied Mathematics 82 (1-3), 43-77, 1998 | 149* | 1998 |
| Partitions of graphs into one or two independent sets and cliques A Brandstädt Discrete Mathematics 152 (1-3), 47-54, 1996 | 142 | 1996 |
| On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987 | 118 | 1987 |
| Convexity and HHD-free graphs FF Dragan, F Nicolai, A Brandstädt SIAM Journal on Discrete Mathematics 12 (1), 119-135, 1999 | 102 | 1999 |
| On the linear structure and clique-width of bipartite permutation graphs A Brandstadt, VV Lozin Ars Combinatoria 67 (1), 273-281, 2003 | 100 | 2003 |
| Distance approximating trees for chordal and dually chordal graphs A Brandstädt, V Chepoi, F Dragan Journal of Algorithms 30 (1), 166-184, 1999 | 98 | 1999 |
| Special graph classes: A survey A Brandstädt UD, Fachbereich Mathematik, 1991 | 98 | 1991 |
| Handbook of graph theory, combinatorial optimization, and algorithms K Thulasiraman, S Arumugam, A Brandstädt (No Title), 2016 | 95 | 2016 |
| The complexity of some problems related to graph 3-colorability A Brandstädt, T Szymczak Discrete Applied Mathematics 89 (1-3), 59-73, 1998 | 94 | 1998 |
| Graphen und Algorithmen A Brandstädt Springer-Verlag, 2013 | 90 | 2013 |
| On the restriction of some NP-complete graph problems to permutation graphs A Brandstädt, D Kratsch International Conference on Fundamentals of Computation Theory, 53-62, 1985 | 84 | 1985 |
| New graph classes of bounded clique-width A Brandstädt, FF Dragan, HO Le, R Mosca Theory of Computing Systems 38 (5), 623-645, 2005 | 83 | 2005 |
| Clique-width for 4-vertex forbidden subgraphs A Brandstadt, J Engelfriet, HO Le, VV Lozin Theory of Computing Systems 39 (4), 561-590, 2006 | 82 | 2006 |
| Structure and linear time recognition of 3-leaf powers A Brandstädt Information Processing Letters 98 (4), 133-138, 2006 | 78 | 2006 |
| LexBFS-orderings and powers of chordal graphs A Brandstädt, FF Dragan, F Nicolai Discrete Mathematics 171 (1-3), 27-42, 1997 | 73 | 1997 |
Van Bang LeUniversity of Rostock, GermanyVerified email at uni-rostock.de
