dblp.uni-trier.dewww.uni-trier.de

Andreas Brandstädt Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
100EEAndreas Brandstädt, Raffaele Mosca: On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 116-126
99EEAndreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182
98EEAndreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le: Preface. Discrete Applied Mathematics 157(9): 1979 (2009)
2008
97EEAndreas Brandstädt, Van Bang Le: Simplicial Powers of Graphs. COCOA 2008: 160-170
96EEAndreas Brandstädt, Peter Wagner: On k-Versus (k+1)-Leaf Powers. COCOA 2008: 171-179
95EEAndreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858
94EEAndreas Brandstädt, Christian Hundt: Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN 2008: 479-491
93EEAndreas Brandstädt, Van Bang Le, R. Sritharan: Structure and linear-time recognition of 4-leaf powers. ACM Transactions on Algorithms 5(1): (2008)
92EEAndreas Brandstädt, Chính T. Hoàng: Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008)
2007
91 Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
90 Andreas Brandstädt, Dieter Kratsch, Haiko Müller: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers Springer 2007
89EEAndreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad: 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007
88EEAndreas Brandstädt, Peter Wagner: On ( k , l)-Leaf Powers. MFCS 2007: 525-535
87EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007)
86EEAndreas Brandstädt, Van Bang Le, Suhail Mahfud: New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 370(1-3): 229-239 (2007)
85EEAndreas Brandstädt, Elaine M. Eschen, R. Sritharan: The induced matching and chain subgraph cover problems for convex bipartite graphs. Theor. Comput. Sci. 381(1-3): 260-265 (2007)
84EEAndreas Brandstädt, Chính T. Hoàng: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theor. Comput. Sci. 389(1-2): 295-306 (2007)
2006
83EEAndreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan: Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434
82EEAndreas Brandstädt, Tilo Klembt, Suhail Mahfud: P6- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Mathematics & Theoretical Computer Science 8(1): 173-188 (2006)
81EEDieter Rautenbach, Andreas Brandstädt, Van Bang Le: Distance-Hereditary 5-Leaf Powers. Electronic Notes in Discrete Mathematics 27: 85-86 (2006)
80EEAndreas Brandstädt, Van Bang Le: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006)
79EEAndreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006)
2005
78EEAndreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
77EEAndreas Brandstädt, Van Bang Le, Suhail Mahfud: New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527
76EEAndreas Brandstädt, Chính T. Hoàng: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. IPCO 2005: 265-275
75EEAndreas Brandstädt, Dieter Kratsch: On the structure of (P5, gem)-free graphs. Discrete Applied Mathematics 145(2): 155-166 (2005)
74EEAndreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca: Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. Discrete Applied Mathematics 145(2): 232-241 (2005)
73EEAndreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)
72EEHans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005)
71EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005)
2004
70EEAndreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn: Preface: ODSA. Discrete Applied Mathematics 138(1-2): 1 (2004)
69EEAndreas Brandstädt: (P5, diamond)-free graphs revisited: structure and linear time optimization. Discrete Applied Mathematics 138(1-2): 13-27 (2004)
68EEAndreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe: On minimal prime extensions of a four-vertex graph in a prime graph. Discrete Mathematics 288(1-3): 9-17 (2004)
67EEAndreas Brandstädt, Van Bang Le, H. N. de Ridder: Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett. 89(4): 165-173 (2004)
66EEAndreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca: Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. 15(1): 163-185 (2004)
65EEAndreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discrete Math. 17(3): 341-360 (2004)
64EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004)
2003
63EEHans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72
62EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118
61 Andreas Brandstädt, Vadim V. Lozin: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67: (2003)
60EEAndreas Brandstädt, Feodor F. Dragan: On linear and circular structure of (claw, net)-free graphs. Discrete Applied Mathematics 129(2-3): 285-303 (2003)
59EEAndreas Brandstädt, Raffaele Mosca: On variations of P4-sparse graphs. Discrete Applied Mathematics 129(2-3): 521-532 (2003)
58EEAndreas Brandstädt, Chính T. Hoàng, Van Bang Le: Stability number of bull- and chair-free graphs revisited. Discrete Applied Mathematics 131(1): 39-50 (2003)
57EEAndreas Brandstädt, Raffaele Mosca: On the structure and stability number of P5- and co-chair-free graphs. Discrete Applied Mathematics 132(1-3): 47-65 (2003)
56EEAndreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe: Structure and stability number of chair-, co-P- and gem-free graphs revisited. Inf. Process. Lett. 86(3): 161-167 (2003)
2002
55EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le: Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174
54EEAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. WG 2002: 57-67
53EELuitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of claw-free graphs and a larger graph class. Discrete Mathematics & Theoretical Computer Science 5(1): 127-146 (2002)
52EEAndreas Brandstädt, Hoàng-Oanh Le, Van Bang Le: On alpha-redundant vertices in P5-free graphs. Inf. Process. Lett. 82(3): 119-122 (2002)
51EEAndreas Brandstädt, Suhail Mahfud: Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Inf. Process. Lett. 84(5): 251-259 (2002)
2001
50 Andreas Brandstädt, Van Bang Le: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings Springer 2001
49EEAndreas Brandstädt: On Robust Algorithms for the Maximum Weight Stable Set Problem. FCT 2001: 445-458
48 Andreas Brandstädt, Vadim V. Lozin: A note on alpha-redundant vertices in graphs. Discrete Applied Mathematics 108(3): 301-308 (2001)
2000
47EEAndreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82
46 Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak: On stable cutsets in graphs. Discrete Applied Mathematics 105(1-3): 39-50 (2000)
45EEAndreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Block Graphs. Discrete Applied Mathematics 99(1-3): 349-366 (2000)
44EEAndreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler: Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. SIAM J. Comput. 30(5): 1662-1677 (2000)
1999
43EEAndreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler: Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376
42EELuitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)
41EEAndreas Brandstädt, Van Bang Le: Tree- and Forest-perfect Graphs. Discrete Applied Mathematics 95(1-3): 141-162 (1999)
40EEAndreas Brandstädt, Peter L. Hammer: On the Stability Number of Claw-free P5-free and More General Graphs. Discrete Applied Mathematics 95(1-3): 163-167 (1999)
39 Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999)
38EEFeodor F. Dragan, Falk Nicolai, Andreas Brandstädt: Convexity and HHD-Free Graphs. SIAM J. Discrete Math. 12(1): 119-135 (1999)
1998
37EEAndreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discrete Applied Mathematics 82(1-3): 43-77 (1998)
36EEAndreas Brandstädt, Van Bang Le, Thomas Szymczak: The Complexity of some Problems Related to Graph 3-colorability. Discrete Applied Mathematics 89(1-3): 59-73 (1998)
35EEAndreas Brandstädt: Corrigendum. Discrete Mathematics 186(1-3): 295 (1998)
34EEAndreas Brandstädt, Feodor F. Dragan: A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks 31(3): 177-182 (1998)
33EEAndreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. SIAM J. Discrete Math. 11(3): 437-455 (1998)
1997
32EEAndreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91
31EEAndreas Brandstädt, Feodor F. Dragan, Falk Nicolai: LexBFS-orderings and powers of chordal graphs. Discrete Mathematics 171(1-3): 27-42 (1997)
30EEAndreas Brandstädt, Van Bang Le, Thomas Szymczak: Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics 177(1-3): 9-16 (1997)
29EEAndreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discrete Math. 10(1): 109-127 (1997)
28EEAndreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs. Theor. Comput. Sci. 172(1-2): 209-232 (1997)
1996
27EEFeodor F. Dragan, Falk Nicolai, Andreas Brandstädt: LexBFS-Orderings and Power of Graphs. WG 1996: 166-180
26EEAndreas Brandstädt, Heinz-Jürgen Voss: Short Disjoint Cycles in Graphs with Degree Constraints. Discrete Applied Mathematics 64(3): 197-205 (1996)
25EEAndreas Brandstädt: Partitions of graphs into one or two independent sets and cliques. Discrete Mathematics 152(1-3): 47-54 (1996)
24EEAndreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics 158(1-3): 273-278 (1996)
23EEFeodor F. Dragan, Andreas Brandstädt: r-Dominating cliques in graphs with hypertree structure. Discrete Mathematics 162(1-3): 93-108 (1996)
1995
22EEAndreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs and the Steiner Tree Problem. WG 1995: 381-395
1994
21EEFeodor F. Dragan, Andreas Brandstädt: Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746
20EEAndreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80
1993
19EEAndreas Brandstädt, Heinz-Jürgen Voss: Short Disjoint Cycles in Graphs with Degree Constraints. WG 1993: 125-131
18EEAndreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. WG 1993: 237-251
1992
17EEAndreas Brandstädt: On Improved Time Bounds for Permutation Graph Problems. WG 1992: 1-10
1991
16EEAndreas Brandstädt: Short Disjoint Cycles in Cubic Bridgeless Graphs. WG 1991: 239-249
15EEAndreas Brandstädt: Classes of bipartite graphs related to chordal graphs. Discrete Applied Mathematics 32(1): 51-60 (1991)
1989
14 Andreas Brandstädt: The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. FCT 1989: 68-77
1987
13 Andreas Brandstädt: The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 471-477 (1987)
12 Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner: Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Mathematical Systems Theory 19(4): 277-299 (1987)
11 Haiko Müller, Andreas Brandstädt: The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theor. Comput. Sci. 53: 257-265 (1987)
10 Andreas Brandstädt, Dieter Kratsch: On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. 54: 181-198 (1987)
1986
9 Andreas Brandstädt, Dieter Kratsch: On Partitions of Permutations into Increasing and Decreasing Subsequences. Elektronische Informationsverarbeitung und Kybernetik 22(5/6): 263-273 (1986)
1985
8 Andreas Brandstädt, Dieter Kratsch: On the restriction of some NP-complete graph problems to permutation graphs. FCT 1985: 53-62
1983
7 Andreas Brandstädt, Klaus W. Wagner: Reversal-Bounded and Visit-Bounded Realtime Computations. FCT 1983: 26-39
6 Andreas Brandstädt: Space Classes, Intersection of Languages and Bounded Erasing Homomorphisms. ITA 17(2): 121-130 (1983)
1981
5EEAndreas Brandstädt: Pushdown Automata with Restricted Use of Storage Symbols. MFCS 1981: 234-241
4 Andreas Brandstädt: Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure. ITA 15(3): 233-252 (1981)
1979
3 Gerd Wechsung, Andreas Brandstädt: A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. 9: 127-140 (1979)
1978
2 Andreas Brandstädt: On a Family of Complexity Measures on Turing Machines, defined by Predicates. Elektronische Informationsverarbeitung und Kybernetik 14(7/8): 331-339 (1978)
1977
1 Andreas Brandstädt, Dietrich Saalfeld: Eine Hierarchie beschränkter Rückkehrberechnungen auf on-line Turingmaschinen. Elektronische Informationsverarbeitung und Kybernetik 13(11): 571-583 (1977)

Coauthor Index

1Luitpold Babel [42] [53]
2Hans L. Bodlaender [63] [72]
3Franz-Josef Brandenburg [12]
4Victor Chepoi [18] [20] [24] [29] [32] [33] [37] [39]
5Feodor F. Dragan [18] [20] [21] [22] [23] [24] [27] [28] [29] [31] [32] [33] [34] [37] [38] [39] [43] [44] [46] [54] [55] [60] [62] [64] [71] [83] [87]
6Konrad Engel [70] [98]
7Joost Engelfriet [78] [79]
8Elaine M. Eschen [85]
9Martin Charles Golumbic [99]
10Hans-Dietrich O. F. Gronau [70] [98]
11Peter L. Hammer [40] [73]
12Chính T. Hoàng [58] [68] [76] [84] [92]
13Christian Hundt [94]
14Klaus Jansen [89] [91]
15Tilo Klembt [82] [95]
16Ekkehard Köhler [43] [44]
17Dieter Kratsch [8] [9] [10] [63] [72] [75] [89] [90] [91]
18Roger Labahn [70]
19Hoàng-Oanh Le [52] [54] [55] [56] [62] [64] [66] [71] [74] [78] [79] [87]
20Van Bang Le [30] [36] [41] [42] [45] [46] [47] [50] [52] [53] [55] [58] [62] [64] [65] [67] [73] [77] [80] [81] [86] [87] [93] [97] [98] [99]
21Marina Lipshteyn [99]
22Vadim V. Lozin [48] [61] [73] [78] [79] [95]
23Suhail Mahfud [51] [77] [82] [86]
24Raffaele Mosca [54] [57] [59] [66] [71] [74] [95] [100]
25Haiko Müller [11] [90]
26Falk Nicolai [22] [27] [28] [31] [38]
27Michaël Rao [63] [72]
28Dieter Rautenbach [81]
29H. N. de Ridder [67]
30Dietrich Saalfeld [1]
31Jeremy Spinrad [63] [72] [89] [91]
32R. Sritharan [85] [93]
33Thomas Szymczak [30] [36] [46]
34Ryuhei Uehara [62] [87]
35Jean-Marie Vanherpe [56] [68]
36Vitaly I. Voloshin [18] [33]
37Heinz-Jürgen Voss [19] [26]
38Klaus W. Wagner [7] [12]
39Peter Wagner [88] [96]
40Gerd Wechsung [3]
41Yang Xiang [83]
42Chenyu Yan [83]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)