×

zbMATH — the first resource for mathematics

Brandstädt, Andreas

Compute Distance To:
Author ID: brandstadt.andreas Recent zbMATH articles by "Brandstädt, Andreas"
Published as: Brandstaedt, Andreas; Brandstädt, A.; Brandstädt, Andreas
Homepage: http://cpr.uni-rostock.de/resolve/id/cpr_person_00000665
External Links: MGP · Wikidata · ResearchGate · dblp · GND
Documents Indexed: 166 Publications since 1977, including 13 Books
Biographic References: 1 Publication

Publications by Year

Citations contained in zbMATH

123 Publications have been cited 1,958 times in 1,194 Documents Cited by Year
Graph classes: a survey. Zbl 0919.05001
Brandstädt, Andreas; Van Bang Le; Spinrad, Jeremy P.
598
1999
Bipartite permutation graphs. Zbl 0628.05055
Spinrad, Jeremy; Brandstädt, Andreas; Stewart, Lorna
94
1987
Dually chordal graphs. Zbl 0909.05037
Brandstädt, Andreas; Dragan, Feodor; Chepoi, Victor; Voloshin, Vitaly
60
1998
The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Zbl 0638.68062
Müller, Haiko; Brandstädt, Andreas
39
1987
Partitions of graphs into one or two independent sets and cliques. Zbl 0853.68140
Brandstädt, Andreas
34
1996
On domination problems for permutation and other graphs. Zbl 0641.68100
Brandstädt, Andreas; Kratsch, Dieter
33
1987
Convexity and HHD-free graphs. Zbl 0916.05060
Dragan, Feodor F.; Nicolai, Falk; Brandstädt, Andreas
30
1999
On the linear structure and clique-width of bipartite permutation graphs. Zbl 1076.05066
Brandstädt, A.; Lozin, V. V.
27
2003
Independent sets of maximum weight in apple-free graphs. Zbl 1211.68281
Brandstädt, Andreas; Lozin, Vadim V.; Mosca, Raffaele
25
2010
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Zbl 1143.68059
Brandstädt, Andreas; Hoàng, Chính T.
25
2007
LexBFS-orderings and powers of chordal graphs. Zbl 0880.05074
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk
25
1997
Classes of bipartite graphs related to chordal graphs. Zbl 0763.05052
Brandstädt, Andreas
25
1991
The complexity of some problems related to GRAPH 3-COLORABILITY. Zbl 0927.68063
Brandstädt, Andreas; Van Bang Le; Szymczak, Thomas
24
1998
Structure and linear time recognition of 3-leaf powers. Zbl 1178.05090
Brandstädt, Andreas; Le, Van Bang
23
2006
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
22
2006
On the structure of (\(P_{5}\), gem)-free graphs. Zbl 1084.05048
Brandstädt, Andreas; Kratsch, Dieter
22
2005
A note on \(\alpha\)-redundant vertices in graphs. Zbl 0968.05058
Brandstädt, Andreas; Lozin, V. V.
22
2001
Distance approximating trees for chordal and dually chordal graphs. Zbl 0914.68148
Brandstädt, Andreas; Chepoi, Victor; Dragan, Feodor
22
1999
The algorithmic use of hypertree structure and maximum neighbourhood orderings. Zbl 0893.05018
Brandstädt, Andreas; Chepoi, Victor D.; Dargan, Feodor F.
22
1998
On the structure and stability number of \(P_{5}\)- and co-chair-free graphs. Zbl 1029.05142
Brandstädt, Andreas; Mosca, Raffaele
21
2003
\(P_6\)- and triangle-free graphs revisited: structure and bounded clique-width. Zbl 1153.05040
Brandstädt, Andreas; Klembt, Tilo; Mahfud, Suhail
20
2006
New graph classes of bounded clique-width. Zbl 1084.68088
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
20
2005
A linear-time algorithm for connected \(r\)-domination and Steiner tree on distance-hereditary graphs. Zbl 0990.05116
Brandstädt, Andreas; Dragan, Feodor F.
20
1998
Efficient dominating and edge dominating sets for graphs and hypergraphs. Zbl 1260.05108
Brandstädt, Andreas; Leitert, Arne; Rautenbach, Dieter
19
2012
On stable cutsets in graphs. Zbl 0962.68138
Brandstädt, Andreas; Dragan, Feodor F.; Le, Van Bang; Szymczak, Thomas
19
2000
Efficient edge domination on hole-free graphs in polynomial time. Zbl 1283.05197
Brandstädt, Andreas; Hundt, Christian; Nevries, Ragnar
18
2010
Chordal co-gem-free and (\(P_{5}\), gem)-free graphs have bounded clique-width. Zbl 1084.05056
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
18
2005
Tree spanners on chordal graphs: complexity and algorithms. Zbl 1049.05075
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Le, Van Bang
18
2004
Clique \(r\)-domination and clique \(r\)-packing problems on dually chordal graphs. Zbl 0869.05048
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F.
18
1997
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Zbl 1304.05104
Brandstädt, Andreas; Fičur, Pavel; Leitert, Arne; Milanič, Martin
16
2015
Structure and linear-time recognition of 4-leaf powers. Zbl 06972938
Brandstädt, Andreas; Le, Van Bang; Sritharan, R.
16
2008
Gem- and co-gem-free graphs have bounded clique-width. Zbl 1101.68719
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
16
2004
(\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. Zbl 1175.90395
Brandstädt, Andreas
15
2004
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Zbl 1042.68085
Brandstädt, Andreas; Mahfud, Suhail
15
2002
On improved time bounds for permutation graph problems. Zbl 0789.68105
Brandstädt, Andreas
15
1993
On algorithms for (\(P_5\), gem)-free graphs. Zbl 1086.68050
Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy
14
2005
On linear and circular structure of (claw, net)-free graphs. Zbl 1032.05095
Brandstädt, Andreas; Dragan, Feodor F.
14
2003
On the stability number of claw-free \(P_5\)-free and more general graphs. Zbl 1113.05308
Brandstädt, Andreas; Hammer, Peter L.
14
1999
New polynomial cases of the weighted efficient domination problem. Zbl 1398.68218
Brandstädt, Andreas; Milanič, Martin; Nevries, Ragnar
13
2013
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Zbl 1236.05127
Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric
13
2012
On distance-3 matchings and induced matchings. Zbl 1210.05105
Brandstädt, Andreas; Mosca, Raffaele
13
2011
Stability number of bull- and chair-free graphs revisited. Zbl 1029.05077
Brandstädt, Andreas; Hoàng, Chính T.; Van Bang Le
13
2003
Dominating induced matchings for \(P_7\)-free graphs in linear time. Zbl 1307.05171
Brandstädt, Andreas; Mosca, Raffaele
12
2014
Ptolemaic graphs and interval graphs are leaf powers. Zbl 1136.68450
Brandstädt, Andreas; Hundt, Christian
12
2008
Bisplit graphs. Zbl 1073.05059
Brandstädt, Andreas; Hammer, Peter L.; Le, Van Bang; Lozin, Vadim V.
12
2005
On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Zbl 1119.05087
Brandstädt, Andreas; Hoàng, Chính T.
11
2005
On the restriction of some NP-complete graph problems to permutation graphs. Zbl 0575.68069
Brandstädt, Andreas; Kratsch, Dieter
11
1985
Addendum to: “Maximum weight independent sets in hole- and co-chair-free graphs”. Zbl 1302.68122
Brandstädt, Andreas; Giakoumakis, Vassilis
10
2015
Maximum weight independent sets in hole- and co-chair-free graphs. Zbl 1233.68139
Brandstädt, Andreas; Giakoumakis, Vassilis
10
2012
The induced matching and chain subgraph cover problems for convex bipartite graphs. Zbl 1188.68209
Brandstädt, Andreas; Eschen, Elaine M.; Sritharan, R.
10
2007
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs. Zbl 0973.05051
Brandstädt, Andreas; Dragan, Feodor F.; Köhler, Ekkehard
10
2000
Perfect elimination orderings of chordal powers of graphs. Zbl 0948.05050
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F.
10
1996
Characterising \((k,\ell )\)-leaf powers. Zbl 1225.05079
Brandstädt, Andreas; Wagner, Peter
9
2010
On independent vertex sets in subclasses of apple-free graphs. Zbl 1187.05050
Brandstädt, Andreas; Klembt, Tilo; Lozin, Vadim V.; Mosca, Raffaele
9
2010
Maximum induced matchings for chordal graphs in linear time. Zbl 1171.68595
Brandstädt, Andreas; Hoàng, Chính T.
9
2008
New applications of clique separator decomposition for the maximum weight stable set problem. Zbl 1118.68101
Brandstädt, Andreas; Le, Van Bang; Mahfud, Suhail
9
2007
New graph classes of bounded clique-width. Zbl 1022.68090
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
9
2002
On partitions of permutations into increasing and decreasing subsequences. Zbl 0616.05002
Brandstädt, Andreas; Kratsch, Dieter
9
1986
Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs. Zbl 1352.05143
Brandstädt, Andreas; Mosca, Raffaele
8
2016
Cycle transversals in perfect graphs and cographs. Zbl 1259.68077
Brandstädt, Andreas; Brito, Synara; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio
8
2013
Rooted directed path graphs are leaf powers. Zbl 1211.05051
Brandstädt, Andreas; Hundt, Christian; Mancini, Federico; Wagner, Peter
8
2010
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Zbl 1221.05040
Brandstädt, Andreas; Le, Van Bang; Rautenbach, Dieter
8
2009
On \((k,\ell )\)-leaf powers. Zbl 1147.68601
Brandstädt, Andreas; Wagner, Peter
8
2007
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1107.68062
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
8
2007
Structure and stability number of chair-, co-P- and gem-free graphs revisited. Zbl 1173.68597
Brandstädt, Andreas; Le, Hoàng-Oanh; Vanherpe, Jean-Marie
8
2003
On variations of \(P_{4}\)-sparse graphs. Zbl 1022.05069
Brandstädt, Andreas; Mosca, Raffaele
8
2003
Maximum weight independent sets in odd-hole-free graphs without dart or without bull. Zbl 1321.05178
Brandstädt, Andreas; Mosca, Raffaele
7
2015
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 06482804
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
7
2015
Split-perfect graphs: characterizations and algorithmic use. Zbl 1056.05070
Brandstädt, Andreas; Le, Van Bang
7
2004
Bipartite permutation graphs are bipartite tolerance graphs. Zbl 0652.05060
Brandstädt, Andreas; Spinrad, Jeremy; Stewart, Lorna
7
1987
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
6
2017
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time. Zbl 1360.68497
Brandstädt, Andreas; Mosca, Raffaele
6
2017
Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
6
2016
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. Zbl 1417.05150
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik
6
2016
Exact leaf powers. Zbl 1193.05141
Brandstädt, Andreas; Le, Van Bang; Rautenbach, Dieter
6
2010
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes. Zbl 1176.05076
Brandstädt, Andreas; Le, Van Bang; de Ridder, H. N.
6
2004
On minimal prime extensions of a four-vertex graph in a prime graph. Zbl 1056.05111
Brandstädt, Andreas; Hoàng, Chính T.; Vanherpe, Jean-Marie
6
2004
Weighted efficient domination in two subclasses of \(P_6\)-free graphs. Zbl 1329.05225
Brandstädt, Andreas; Karthick, T.
5
2016
On \(k\)- versus \((k + 1)\)-leaf powers. Zbl 1168.05342
Brandstädt, Andreas; Wagner, Peter
5
2008
Simplicial powers of graphs. Zbl 1168.05341
Brandstädt, Andreas; Le, Van Bang
5
2008
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs. Zbl 1013.68290
Brandstädt, Andreas; Le, Hoàng-Oanh; Le, Van Bang
5
2002
Homogeneously orderable graphs. Zbl 0903.68136
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk
5
1997
Dominating cliques in graphs with hypertree structure. Zbl 0941.05513
Dragan, Feodor; Brandstädt, Andreas
5
1994
On the restriction of some NP-complete graph problems to permutation graphs. Zbl 0565.05060
Brandstädt, Andreas; Kratsch, Dieter
5
1984
A note on efficient domination in a superclass of \(P_5\)-free graphs. Zbl 1285.05135
Brandstädt, Andreas; Le, Van Bang
4
2014
Dominating induced matchings for \(P _{7}\)-free graphs in linear time. Zbl 1349.05249
Brandstädt, Andreas; Mosca, Raffaele
4
2011
Independent sets of maximum weight in apple-free graphs. Zbl 1183.05076
Brandstädt, Andreas; Klembt, Tilo; Lozin, Vadim V.; Mosca, Raffaele
4
2008
\(r\)-dominating cliques in graphs with hypertree structure. Zbl 0870.05038
Dragan, Feodor F.; Brandstädt, Andreas
4
1996
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Zbl 1311.05182
Berry, Anne; Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric
3
2015
Generalized powers of graphs and their algorithmic use. Zbl 1141.05320
Brandstädt, Andreas; Dragan, Feodor F.; Xiang, Yang; Yan, Chenyu
3
2006
Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles. Zbl 0998.05038
Brandstädt, Andreas; Le, Van Bang; Olariu, Stephan
3
2000
Tree- and forest-perfect graphs. Zbl 0941.05029
Brandstädt, Andreas; Le, Van Bang
3
1999
Duchet-type theorems for powers of HHD-free graphs. Zbl 0887.05050
Brandstädt, Andreas; Van Bang Le; Szymczak, Thomas
3
1997
Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs. Zbl 1437.05189
Brandstädt, Andreas; Mosca, Raffaele
2
2020
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs. Zbl 1398.05148
Brandstädt, Andreas; Giakoumakis, Vassilis; Milanič, Martin
2
2018
Efficient domination and efficient edge domination: a brief survey. Zbl 1400.05170
Brandstädt, Andreas
2
2018
Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time. Zbl 1380.05147
Brandstädt, Andreas; Mosca, Raffaele
2
2018
On efficient domination for some classes of \(H\)-free chordal graphs. Zbl 1383.05229
Brandstädt, Andreas; Mosca, Raffaele
2
2017
Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs. Zbl 1417.05151
Brandstädt, Andreas; Mosca, Raffaele
2
2016
Bounding the clique-width of \(H\)-free split graphs. Zbl 1346.05210
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
2
2015
Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs. Zbl 1437.05189
Brandstädt, Andreas; Mosca, Raffaele
2
2020
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs. Zbl 1398.05148
Brandstädt, Andreas; Giakoumakis, Vassilis; Milanič, Martin
2
2018
Efficient domination and efficient edge domination: a brief survey. Zbl 1400.05170
Brandstädt, Andreas
2
2018
Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time. Zbl 1380.05147
Brandstädt, Andreas; Mosca, Raffaele
2
2018
Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time. Zbl 1377.05185
Brandstädt, Andreas; Mosca, Raffaele
1
2018
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
6
2017
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time. Zbl 1360.68497
Brandstädt, Andreas; Mosca, Raffaele
6
2017
On efficient domination for some classes of \(H\)-free chordal graphs. Zbl 1383.05229
Brandstädt, Andreas; Mosca, Raffaele
2
2017
Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs. Zbl 1352.05143
Brandstädt, Andreas; Mosca, Raffaele
8
2016
Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
6
2016
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. Zbl 1417.05150
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik
6
2016
Weighted efficient domination in two subclasses of \(P_6\)-free graphs. Zbl 1329.05225
Brandstädt, Andreas; Karthick, T.
5
2016
Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs. Zbl 1417.05151
Brandstädt, Andreas; Mosca, Raffaele
2
2016
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Zbl 1304.05104
Brandstädt, Andreas; Fičur, Pavel; Leitert, Arne; Milanič, Martin
16
2015
Addendum to: “Maximum weight independent sets in hole- and co-chair-free graphs”. Zbl 1302.68122
Brandstädt, Andreas; Giakoumakis, Vassilis
10
2015
Maximum weight independent sets in odd-hole-free graphs without dart or without bull. Zbl 1321.05178
Brandstädt, Andreas; Mosca, Raffaele
7
2015
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 06482804
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
7
2015
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Zbl 1311.05182
Berry, Anne; Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric
3
2015
Bounding the clique-width of \(H\)-free split graphs. Zbl 1346.05210
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
2
2015
The Dilworth number of auto-chordal bipartite graphs. Zbl 1327.05285
Berry, Anne; Brandstädt, Andreas; Engel, Konrad
2
2015
Dominating induced matchings for \(P_7\)-free graphs in linear time. Zbl 1307.05171
Brandstädt, Andreas; Mosca, Raffaele
12
2014
A note on efficient domination in a superclass of \(P_5\)-free graphs. Zbl 1285.05135
Brandstädt, Andreas; Le, Van Bang
4
2014
New polynomial cases of the weighted efficient domination problem. Zbl 1398.68218
Brandstädt, Andreas; Milanič, Martin; Nevries, Ragnar
13
2013
Cycle transversals in perfect graphs and cographs. Zbl 1259.68077
Brandstädt, Andreas; Brito, Synara; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio
8
2013
Efficient dominating and edge dominating sets for graphs and hypergraphs. Zbl 1260.05108
Brandstädt, Andreas; Leitert, Arne; Rautenbach, Dieter
19
2012
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Zbl 1236.05127
Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric
13
2012
Maximum weight independent sets in hole- and co-chair-free graphs. Zbl 1233.68139
Brandstädt, Andreas; Giakoumakis, Vassilis
10
2012
On distance-3 matchings and induced matchings. Zbl 1210.05105
Brandstädt, Andreas; Mosca, Raffaele
13
2011
Dominating induced matchings for \(P _{7}\)-free graphs in linear time. Zbl 1349.05249
Brandstädt, Andreas; Mosca, Raffaele
4
2011
Independent sets of maximum weight in apple-free graphs. Zbl 1211.68281
Brandstädt, Andreas; Lozin, Vadim V.; Mosca, Raffaele
25
2010
Efficient edge domination on hole-free graphs in polynomial time. Zbl 1283.05197
Brandstädt, Andreas; Hundt, Christian; Nevries, Ragnar
18
2010
Characterising \((k,\ell )\)-leaf powers. Zbl 1225.05079
Brandstädt, Andreas; Wagner, Peter
9
2010
On independent vertex sets in subclasses of apple-free graphs. Zbl 1187.05050
Brandstädt, Andreas; Klembt, Tilo; Lozin, Vadim V.; Mosca, Raffaele
9
2010
Rooted directed path graphs are leaf powers. Zbl 1211.05051
Brandstädt, Andreas; Hundt, Christian; Mancini, Federico; Wagner, Peter
8
2010
Exact leaf powers. Zbl 1193.05141
Brandstädt, Andreas; Le, Van Bang; Rautenbach, Dieter
6
2010
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Zbl 1221.05040
Brandstädt, Andreas; Le, Van Bang; Rautenbach, Dieter
8
2009
Simplicial powers of graphs. Zbl 1192.68473
Brandstädt, Andreas; Le, Van Bang
2
2009
The complete inclusion structure of leaf power classes. Zbl 1184.68363
Wagner, Peter; Brandstädt, Andreas
1
2009
Structure and linear-time recognition of 4-leaf powers. Zbl 06972938
Brandstädt, Andreas; Le, Van Bang; Sritharan, R.
16
2008
Ptolemaic graphs and interval graphs are leaf powers. Zbl 1136.68450
Brandstädt, Andreas; Hundt, Christian
12
2008
Maximum induced matchings for chordal graphs in linear time. Zbl 1171.68595
Brandstädt, Andreas; Hoàng, Chính T.
9
2008
On \(k\)- versus \((k + 1)\)-leaf powers. Zbl 1168.05342
Brandstädt, Andreas; Wagner, Peter
5
2008
Simplicial powers of graphs. Zbl 1168.05341
Brandstädt, Andreas; Le, Van Bang
5
2008
Independent sets of maximum weight in apple-free graphs. Zbl 1183.05076
Brandstädt, Andreas; Klembt, Tilo; Lozin, Vadim V.; Mosca, Raffaele
4
2008
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Zbl 1143.68059
Brandstädt, Andreas; Hoàng, Chính T.
25
2007
The induced matching and chain subgraph cover problems for convex bipartite graphs. Zbl 1188.68209
Brandstädt, Andreas; Eschen, Elaine M.; Sritharan, R.
10
2007
New applications of clique separator decomposition for the maximum weight stable set problem. Zbl 1118.68101
Brandstädt, Andreas; Le, Van Bang; Mahfud, Suhail
9
2007
On \((k,\ell )\)-leaf powers. Zbl 1147.68601
Brandstädt, Andreas; Wagner, Peter
8
2007
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1107.68062
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
8
2007
Structure and linear time recognition of 3-leaf powers. Zbl 1178.05090
Brandstädt, Andreas; Le, Van Bang
23
2006
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
22
2006
\(P_6\)- and triangle-free graphs revisited: structure and bounded clique-width. Zbl 1153.05040
Brandstädt, Andreas; Klembt, Tilo; Mahfud, Suhail
20
2006
Generalized powers of graphs and their algorithmic use. Zbl 1141.05320
Brandstädt, Andreas; Dragan, Feodor F.; Xiang, Yang; Yan, Chenyu
3
2006
On the structure of (\(P_{5}\), gem)-free graphs. Zbl 1084.05048
Brandstädt, Andreas; Kratsch, Dieter
22
2005
New graph classes of bounded clique-width. Zbl 1084.68088
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
20
2005
Chordal co-gem-free and (\(P_{5}\), gem)-free graphs have bounded clique-width. Zbl 1084.05056
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
18
2005
On algorithms for (\(P_5\), gem)-free graphs. Zbl 1086.68050
Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy
14
2005
Bisplit graphs. Zbl 1073.05059
Brandstädt, Andreas; Hammer, Peter L.; Le, Van Bang; Lozin, Vadim V.
12
2005
On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Zbl 1119.05087
Brandstädt, Andreas; Hoàng, Chính T.
11
2005
New applications of clique separator decomposition for the maximum weight stable set problem. Zbl 1122.68478
Brandstädt, Andreas; Le, Van Bang; Mahfud, Suhail
2
2005
Clique-width for four-vertex forbidden subgraphs. Zbl 1123.68086
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoàng-Oanh; Lozin, Vadim V.
1
2005
Tree spanners on chordal graphs: complexity and algorithms. Zbl 1049.05075
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Le, Van Bang
18
2004
Gem- and co-gem-free graphs have bounded clique-width. Zbl 1101.68719
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
16
2004
(\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. Zbl 1175.90395
Brandstädt, Andreas
15
2004
Split-perfect graphs: characterizations and algorithmic use. Zbl 1056.05070
Brandstädt, Andreas; Le, Van Bang
7
2004
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes. Zbl 1176.05076
Brandstädt, Andreas; Le, Van Bang; de Ridder, H. N.
6
2004
On minimal prime extensions of a four-vertex graph in a prime graph. Zbl 1056.05111
Brandstädt, Andreas; Hoàng, Chính T.; Vanherpe, Jean-Marie
6
2004
On the linear structure and clique-width of bipartite permutation graphs. Zbl 1076.05066
Brandstädt, A.; Lozin, V. V.
27
2003
On the structure and stability number of \(P_{5}\)- and co-chair-free graphs. Zbl 1029.05142
Brandstädt, Andreas; Mosca, Raffaele
21
2003
On linear and circular structure of (claw, net)-free graphs. Zbl 1032.05095
Brandstädt, Andreas; Dragan, Feodor F.
14
2003
Stability number of bull- and chair-free graphs revisited. Zbl 1029.05077
Brandstädt, Andreas; Hoàng, Chính T.; Van Bang Le
13
2003
Structure and stability number of chair-, co-P- and gem-free graphs revisited. Zbl 1173.68597
Brandstädt, Andreas; Le, Hoàng-Oanh; Vanherpe, Jean-Marie
8
2003
On variations of \(P_{4}\)-sparse graphs. Zbl 1022.05069
Brandstädt, Andreas; Mosca, Raffaele
8
2003
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1255.68107
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
1
2003
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Zbl 1042.68085
Brandstädt, Andreas; Mahfud, Suhail
15
2002
New graph classes of bounded clique-width. Zbl 1022.68090
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
9
2002
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs. Zbl 1013.68290
Brandstädt, Andreas; Le, Hoàng-Oanh; Le, Van Bang
5
2002
Tree spanners on chordal graphs: Complexity, algorithms, open problems. Zbl 1019.68073
Brandstädt, A.; Dragan, F. F.; Le, H.-O.; Le, V. B.
1
2002
Recognizing the \(P_4\)-structure of claw-free graphs and a larger graph class. Zbl 0994.68097
Babel, Luitpold; Brandstädt, Andreas; Le, Van Bang
1
2002
A note on \(\alpha\)-redundant vertices in graphs. Zbl 0968.05058
Brandstädt, Andreas; Lozin, V. V.
22
2001
On stable cutsets in graphs. Zbl 0962.68138
Brandstädt, Andreas; Dragan, Feodor F.; Le, Van Bang; Szymczak, Thomas
19
2000
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs. Zbl 0973.05051
Brandstädt, Andreas; Dragan, Feodor F.; Köhler, Ekkehard
10
2000
Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles. Zbl 0998.05038
Brandstädt, Andreas; Le, Van Bang; Olariu, Stephan
3
2000
Recognizing the \(P_4\)-structure of block graphs. Zbl 0940.05033
Brandstädt, Andreas; Le, Van Bang
2
2000
Graph classes: a survey. Zbl 0919.05001
Brandstädt, Andreas; Van Bang Le; Spinrad, Jeremy P.
598
1999
Convexity and HHD-free graphs. Zbl 0916.05060
Dragan, Feodor F.; Nicolai, Falk; Brandstädt, Andreas
30
1999
Distance approximating trees for chordal and dually chordal graphs. Zbl 0914.68148
Brandstädt, Andreas; Chepoi, Victor; Dragan, Feodor
22
1999
On the stability number of claw-free \(P_5\)-free and more general graphs. Zbl 1113.05308
Brandstädt, Andreas; Hammer, Peter L.
14
1999
Tree- and forest-perfect graphs. Zbl 0941.05029
Brandstädt, Andreas; Le, Van Bang
3
1999
Recognizing the \(P_4\)-structure of bipartite graphs. Zbl 0931.68074
Babel, Luitpold; Brandstädt, Andreas; Van Bang Le
2
1999
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs (extended abstract). Zbl 0943.05080
Brandstädt, Andreas; Dragan, Feodor F.; Köhler, Ekkehard
1
1999
Dually chordal graphs. Zbl 0909.05037
Brandstädt, Andreas; Dragan, Feodor; Chepoi, Victor; Voloshin, Vitaly
60
1998
The complexity of some problems related to GRAPH 3-COLORABILITY. Zbl 0927.68063
Brandstädt, Andreas; Van Bang Le; Szymczak, Thomas
24
1998
The algorithmic use of hypertree structure and maximum neighbourhood orderings. Zbl 0893.05018
Brandstädt, Andreas; Chepoi, Victor D.; Dargan, Feodor F.
22
1998
A linear-time algorithm for connected \(r\)-domination and Steiner tree on distance-hereditary graphs. Zbl 0990.05116
Brandstädt, Andreas; Dragan, Feodor F.
20
1998
Powers of HHD-free graphs. Zbl 1018.05092
Dragan, Feodor F.; Nicolai, Falk; Brandstädt, Andreas
2
1998
LexBFS-orderings and powers of chordal graphs. Zbl 0880.05074
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk
25
1997
Clique \(r\)-domination and clique \(r\)-packing problems on dually chordal graphs. Zbl 0869.05048
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F.
18
1997
Homogeneously orderable graphs. Zbl 0903.68136
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk
5
1997
Duchet-type theorems for powers of HHD-free graphs. Zbl 0887.05050
Brandstädt, Andreas; Van Bang Le; Szymczak, Thomas
3
1997
...and 23 more Documents
all top 5

Cited by 1,300 Authors

78 Brandstädt, Andreas
50 Lozin, Vadim Vladislavovich
39 Paulusma, Daniël
36 Heggernes, Pinar
35 Dragan, Feodor F.
35 Lê Văn Băng
33 Kratsch, Dieter
33 Mosca, Raffaele
30 Szwarcfiter, Jayme Luiz
25 Dabrowski, Konrad Kazimierz
25 Rautenbach, Dieter
22 Golovach, Petr A.
22 Milanič, Martin
19 Karthick, T.
19 Müller, Haiko
19 Panda, Bhawani Sankar
18 Klein, Sulamita
18 MacKee, Terry Allan
17 Gutierrez, Marisa
17 van ’t Hof, Pim
16 Lin, Min Chih
16 Maffray, Frédéric
15 de Figueiredo, Celina M. Herrera
15 Faria, Luerbio
15 Uehara, Ryuhei
14 Bonomo, Flavia
14 Nikolopoulos, Stavros D.
13 Alcón, Liliana
13 Dourado, Mitre C.
13 Durán, Guillermo Alfredo
13 Fomin, Fedor V.
13 Hoàng, Chính T.
13 Meister, Daniel
13 Protti, Fábio
13 Sritharan, R.
12 Dantas, Simone
12 Habib, Michel A.
12 Hell, Pavol
12 Niedermeier, Rolf
11 Corneil, Derek Gordon
11 Gurski, Frank
11 Johnson, Matthew
11 Otachi, Yota
11 Paul, Christophe
11 Stewart, Lorna K.
10 Giakoumakis, Vassilis
10 Oellermann, Ortrud R.
10 Papadopoulos, Charis
9 Bodlaender, Hans L.
9 Brešar, Boštjan
9 De Caria, Pablo
9 Ito, Takehiro
9 Kloks, Ton
9 Villanger, Yngve
8 Chang, Maw-Shang
8 Chepoi, Victor D.
8 Di Stefano, Gabriele
8 Golumbic, Martin Charles
8 Korpelainen, Nicholas
8 Nogueira, Loana Tito
8 Schaudt, Oliver
8 Vanherpe, Jean-Marie
7 Berry, Anne
7 Calamoneri, Tiziana
7 Henning, Michael Anthony
7 Köhler, Ekkehard
7 Kratsch, Stefan
7 Hoàng-Oanh Le
7 Lee, Chuan-Min
7 Nicolai, Falk
7 Peng, Sheng-Lung
7 Ries, Bernard
7 Safe, Martín Darío
7 Saitoh, Toshiki
7 Yu, Chang-Wu
7 Zamaraev, Victor A.
6 Apollonio, Nicola
6 Belmonte, Rémy
6 Brignall, Robert
6 Cameron, Kathie
6 Changat, Manoj
6 Chen, Genhuey
6 de Werra, Dominique
6 Ducoffe, Guillaume
6 Fernandes dos Santos, Vinícius
6 Groshaus, Marina E.
6 Guo, Jiong
6 Huang, Shenwei
6 Jansen, Bart M. P.
6 Kanté, Mamadou Moustapha
6 Lê, Ngoc Chi
6 Liedloff, Mathieu
6 Lokshtanov, Daniel
6 Malyshev, Dmitry S.
6 Mertzios, George B.
6 Naduvath, Sudev
6 Orlovich, Yury L.
6 Pandey, Arti
6 Rotics, Udi
6 Schiermeyer, Ingo
...and 1,200 more Authors
all top 5

Cited in 97 Serials

319 Discrete Applied Mathematics
135 Theoretical Computer Science
120 Discrete Mathematics
66 Information Processing Letters
53 Algorithmica
29 Graphs and Combinatorics
22 Journal of Discrete Algorithms
21 Journal of Combinatorial Optimization
20 European Journal of Combinatorics
18 Journal of Graph Theory
16 SIAM Journal on Discrete Mathematics
15 Journal of Computer and System Sciences
15 Discrete Mathematics, Algorithms and Applications
13 Annals of Operations Research
11 Order
11 Discrete Optimization
10 Discussiones Mathematicae. Graph Theory
9 Linear Algebra and its Applications
8 International Journal of Foundations of Computer Science
8 Theory of Computing Systems
7 Journal of Combinatorial Theory. Series B
7 International Journal of Computer Mathematics
6 Networks
6 Information and Computation
6 European Journal of Operational Research
4 Information Sciences
4 Annals of Combinatorics
4 Optimization Letters
4 Algorithms
3 Acta Informatica
3 Computers & Mathematics with Applications
3 Advances in Applied Mathematics
3 Applied Mathematics Letters
3 Computational Geometry
3 Journal of Scheduling
2 Journal of Mathematical Biology
2 Applied Mathematics and Computation
2 BIT
2 Journal of Combinatorial Theory. Series A
2 Discrete & Computational Geometry
2 Computers & Operations Research
2 The Electronic Journal of Combinatorics
2 Mathematical Methods of Operations Research
2 Journal of Discrete Mathematical Sciences & Cryptography
2 RAIRO. Theoretical Informatics and Applications
2 Trudy Instituta Matematiki
2 RAIRO. Theoretical Informatics and Applications
2 ISRN Discrete Mathematics
1 Artificial Intelligence
1 Linear and Multilinear Algebra
1 Acta Mathematica
1 Acta Mathematica Vietnamica
1 Computing
1 Journal of Computational and Applied Mathematics
1 Journal of Mathematical Psychology
1 The Journal of Symbolic Logic
1 Mathematical Systems Theory
1 Mathematika
1 Proceedings of the American Mathematical Society
1 SIAM Journal on Computing
1 Combinatorica
1 Annals of Pure and Applied Logic
1 Social Choice and Welfare
1 Journal of Automated Reasoning
1 International Journal of Computational Geometry & Applications
1 SIAM Review
1 Mathematical Programming. Series A. Series B
1 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI
1 Applied Mathematics. Series B (English Edition)
1 Acta Universitatis Matthiae Belii. Series Mathematics
1 Selecta Mathematica. New Series
1 Complexity
1 International Transactions in Operational Research
1 Mathematical Communications
1 Vietnam Journal of Mathematics
1 Journal of Graph Algorithms and Applications
1 Journal of the ACM
1 Acta Mathematica Sinica. English Series
1 CEJOR. Central European Journal of Operations Research
1 Applied Mathematics E-Notes
1 Central European Journal of Mathematics
1 Quantum Information Processing
1 Journal of Applied Logic
1 Mediterranean Journal of Mathematics
1 AKCE International Journal of Graphs and Combinatorics
1 Proyecciones
1 Mathematics in Computer Science
1 Frontiers of Mathematics in China
1 Discrete and Continuous Dynamical Systems. Series S
1 Involve
1 Acta Universitatis Sapientiae. Mathematica
1 Acta Universitatis Sapientiae. Informatica
1 Symmetry
1 Computer Science Review
1 ACM Transactions on Computation Theory
1 Journal of Mathematical Modelling and Algorithms in Operations Research
1 International Journal of Applied and Computational Mathematics

Citations by Year

Wikidata Timeline