Andreas Brandstädt
Andreas Brandstädt
Professor of Computer Science, University of Rostock, Germany
Verifisert e-postadresse på uni-rostock.de - Startside
Tittel
Sitert av
Sitert av
År
Graph classes: a survey
A Brandstädt, VB Le, JP Spinrad
Society for Industrial and Applied Mathematics, 1999
22411999
Bipartite permutation graphs
J Spinrad, A Brandstädt, L Stewart
Discrete Applied Mathematics 18 (3), 279-292, 1987
2681987
Dually chordal graphs
A Brandstädt, F Dragan, V Chepoi, V Voloshin
SIAM Journal on Discrete Mathematics 11 (3), 437-455, 1998
1641998
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
1351987
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
128*1998
Partitions of graphs into one or two independent sets and cliques
A Brandstädt
Discrete Mathematics 152 (1-3), 47-54, 1996
1261996
On domination problems for permutation and other graphs
A Brandstädt, D Kratsch
Theoretical Computer Science 54 (2-3), 181-198, 1987
1111987
Van Bang Le, and Jeremy P. Spinrad
A Brandstädt
Graph classes: a survey 3, 1999
1081999
Special graph classes: A survey
A Brandstädt
UD, Fachbereich Mathematik, 1991
921991
On the linear structure and clique-width of bipartite permutation graphs
A Brandstädt, VV Lozin
842001
Distance approximating trees for chordal and dually chordal graphs
A Brandstädt, V Chepoi, F Dragan
Journal of Algorithms 30 (1), 166-184, 1999
831999
Graphen und Algorithmen
A Brandstädt
Springer-Verlag, 2013
802013
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
802005
Convexity and HHD-free graphs
FF Dragan, F Nicolai, A Brandstädt
SIAM Journal on Discrete Mathematics 12 (1), 119-135, 1999
791999
The complexity of some problems related to graph 3-colorability
A Brandstädt, T Szymczak
Discrete Applied Mathematics 89 (1-3), 59-73, 1998
731998
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
641985
P6-and triangle-free graphs revisited: structure and bounded clique-width
A Brandstädt, T Klembt, S Mahfud
Discrete Mathematics and Theoretical Computer Science 8, 173-188, 2006
622006
Structure and linear time recognition of 3-leaf powers
A Brandstädt
Information Processing Letters 98 (4), 133-138, 2006
612006
LexBFS-orderings and powers of chordal graphs
A Brandstädt, FF Dragan, F Nicolai
Discrete Mathematics 171 (1-3), 27-42, 1997
611997
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
A Brandstädt, CT Hoàng
Theoretical Computer Science 389 (1-2), 295-306, 2007
572007
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20