Andreas Brandstädt
Andreas Brandstädt
Professor of Computer Science, University of Rostock, Germany
Bestätigte E-Mail-Adresse bei uni-rostock.de - Startseite
TitelZitiert vonJahr
Graph classes: a survey
A Brandstadt, JP Spinrad
Siam, 1999
19351999
Bipartite permutation graphs
J Spinrad, A Brandstädt, L Stewart
Discrete Applied Mathematics 18 (3), 279-292, 1987
2341987
Dually chordal graphs
A Brandstädt, F Dragan, V Chepoi, V Voloshin
SIAM Journal on Discrete Mathematics 11 (3), 437-455, 1998
1431998
Partitions of graphs into one or two independent sets and cliques
A Brandstädt
Discrete Mathematics 152 (1-3), 47-54, 1996
1101996
On domination problems for permutation and other graphs
A Brandstädt, D Kratsch
Theoretical Computer Science 54 (2-3), 181-198, 1987
1101987
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
101*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
971987
Special graph classes
A Brandstädt
Friedrich-Schiller-Univ., 1990
881990
Distance approximating trees for chordal and dually chordal graphs
A Brandstädt, V Chepoi, F Dragan
Journal of Algorithms 30 (1), 166-184, 1999
791999
Van Bang Le, and Jeremy P. Spinrad
A Brandstädt
Graph classes: a survey 3, 1999
751999
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
742005
Graphen und Algorithmen
A Brandstädt
Springer-Verlag, 2013
732013
On the linear structure and clique-width of bipartite permutation graphs
A Brandstädt, VV Lozin
732001
The complexity of some problems related to graph 3-colorability
A Brandstädt, T Szymczak
Discrete Applied Mathematics 89 (1-3), 59-73, 1998
681998
Convexity and HHD-free graphs
FF Dragan, F Nicolai, A Brandstädt
SIAM Journal on Discrete Mathematics 12 (1), 119-135, 1999
671999
P 6-and triangle-free graphs revisited: structure and bounded clique-width
A Brandstädt, T Klembt, S Mahfud
Discrete Mathematics & Theoretical Computer Science 8 (1), 2006
562006
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width
A Brandstädt, HO Le, R Mosca
Discrete Applied Mathematics 145 (2), 232-241, 2005
522005
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
512007
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
511985
Structure and linear time recognition of 3-leaf powers
A Brandstädt
Information Processing Letters 98 (4), 133-138, 2006
502006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20