Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndreas Brandstädt
Person information
- affiliation: University of Rostock, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j103]Andreas Brandstädt, Martin Milanic:
A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. 142: 30-34 (2019)- 2018
- [j102]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discrete Applied Mathematics 236: 57-65 (2018) - [j101]Andreas Brandstädt, Raffaele Mosca:
Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discrete Applied Mathematics 237: 57-64 (2018) - [j100]Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic:
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discrete Applied Mathematics 250: 130-144 (2018) - [c39]Andreas Brandstädt:
Efficient Domination and Efficient Edge Domination: A Brief Survey. CALDAM 2018: 1-14 - [e6]Andreas Brandstädt, Ekkehard Köhler, Klaus Meer:
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Lecture Notes in Computer Science 11159, Springer 2018, ISBN 978-3-030-00255-8 [contents] - [i28]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR abs/1806.00386 (2018) - [i27]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time. CoRR abs/1806.09472 (2018) - 2017
- [j99]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time. Algorithmica 77(4): 1283-1302 (2017) - [j98]Andreas Brandstädt, Elaine M. Eschen, Erik Friese, T. Karthick:
Efficient domination for classes of P6-free graphs. Discrete Applied Mathematics 223: 15-27 (2017) - [j97]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Chordal Graphs. Electronic Notes in Discrete Mathematics 62: 57-62 (2017) - [j96]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-Free Chordal Graphs. Journal of Graph Theory 86(1): 42-77 (2017) - [i26]Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR abs/1701.03414 (2017) - [i25]Andreas Brandstädt, Raffaele Mosca:
On Chordal-k-Generalized Split Graphs. CoRR abs/1702.07914 (2017) - [i24]Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR abs/1706.04894 (2017) - [i23]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR abs/1706.09301 (2017) - 2016
- [j95]Andreas Brandstädt, T. Karthick:
Weighted efficient domination in two subclasses of P6-free graphs. Discrete Applied Mathematics 201: 38-46 (2016) - [j94]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle-transversals in distance-hereditary graphs. Discrete Applied Mathematics 210: 38-44 (2016) - [j93]Andreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the clique-width of H-free split graphs. Discrete Applied Mathematics 211: 30-39 (2016) - [j92]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P5-Free and P6-Free Graphs. SIAM J. Discrete Math. 30(4): 2288-2303 (2016) - [c38]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG 2016: 38-49 - [r1]Andreas Brandstädt, Ragnar Nevries:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. Encyclopedia of Algorithms 2016: 618-621 - [i22]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR abs/1602.05838 (2016) - [i21]Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca:
Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR abs/1608.01820 (2016) - 2015
- [j91]Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray:
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discrete Applied Mathematics 184: 50-61 (2015) - [j90]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Split Graphs. Electronic Notes in Discrete Mathematics 49: 497-503 (2015) - [j89]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs and Combinatorics 31(5): 1249-1262 (2015) - [j88]Anne Berry, Andreas Brandstädt, Konrad Engel:
The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs and Combinatorics 31(5): 1463-1471 (2015) - [j87]Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115(2): 256-262 (2015) - [j86]Andreas Brandstädt, Vassilis Giakoumakis:
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 115(2): 345-350 (2015) - [c37]Andreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - [c36]Andreas Brandstädt, Elaine M. Eschen, Erik Friese:
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. WG 2015: 78-89 - [i20]Andreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. CoRR abs/1502.06948 (2015) - [i19]Andreas Brandstädt, Elaine M. Eschen, Erik Friese:
Efficient Domination for Some Subclasses of P6-Free Graphs in Polynomial Time. CoRR abs/1503.00091 (2015) - [i18]Andreas Brandstädt, T. Karthick:
Weighted Efficient Domination in Classes of P6-free Graphs. CoRR abs/1503.06025 (2015) - [i17]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P8-free Graphs in Polynomial Time. CoRR abs/1507.06541 (2015) - [i16]Andreas Brandstädt:
Weighted Efficient Domination for P5-Free Graphs in Linear Time. CoRR abs/1507.06765 (2015) - [i15]Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR abs/1508.07733 (2015) - [i14]Andreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of $H$-free Split Graphs. CoRR abs/1509.04273 (2015) - [i13]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR abs/1511.08066 (2015) - 2014
- [j85]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica 68(4): 998-1018 (2014) - [j84]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. Discrete Applied Mathematics 163: 101 (2014) - [j83]Andreas Brandstädt, Van Bang Le:
A note on efficient domination in a superclass of P5-free graphs. Inf. Process. Lett. 114(7): 357-359 (2014) - [i12]Andreas Brandstädt, Vassilis Giakoumakis:
Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time. CoRR abs/1407.4593 (2014) - [i11]Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs. CoRR abs/1410.0770 (2014) - 2013
- [j82]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle transversals in distance-hereditary graphs. Electronic Notes in Discrete Mathematics 44: 15-21 (2013) - [j81]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. 469: 15-23 (2013) - [j80]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. 487: 103-105 (2013) - [c35]Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS 2013: 195-206 - [e5]Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk:
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Lecture Notes in Computer Science 8165, Springer 2013, ISBN 978-3-642-45042-6 [contents] - [i10]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle-transversals in distance-hereditary graphs. CoRR abs/1302.1402 (2013) - [i9]Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. CoRR abs/1304.6255 (2013) - [i8]Anne Berry, Andreas Brandstädt, Konrad Engel:
The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR abs/1309.5787 (2013) - 2012
- [j79]Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray:
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. Discrete Applied Mathematics 160(4-5): 471-478 (2012) - [j78]Andreas Brandstädt, Vassilis Giakoumakis:
Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112(3): 67-71 (2012) - [c34]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC 2012: 267-277 - [i7]Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. CoRR abs/1207.0953 (2012) - [i6]Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. CoRR abs/1209.2512 (2012) - 2011
- [j77]Andreas Brandstädt, Raffaele Mosca:
On distance-3 matchings and induced matchings. Discrete Applied Mathematics 159(7): 509-520 (2011) - [j76]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graphs and Combinatorics 27(6): 799-819 (2011) - [c33]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC 2011: 100-109 - [i5]Andreas Brandstädt, Vassilis Giakoumakis:
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences. CoRR abs/1105.2874 (2011) - [i4]Andreas Brandstädt, Raffaele Mosca:
Dominating Induced Matchings for P7-Free Graphs in Linear Time. CoRR abs/1106.2772 (2011) - [i3]Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell:
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1(5): 29-46 (2011) - 2010
- [j75]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca:
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56(4): 383-393 (2010) - [j74]Andreas Brandstädt, Peter Wagner:
Characterising (k, l)-leaf powers. Discrete Applied Mathematics 158(2): 110-122 (2010) - [j73]Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner:
Rooted directed path graphs are leaf powers. Discrete Mathematics 310(4): 897-910 (2010) - [j72]Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discrete Math. 24(1): 239-254 (2010) - [j71]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010) - [c32]Andreas Brandstädt, Christian Hundt, Ragnar Nevries:
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. LATIN 2010: 650-661
2000 – 2009
- 2009
- [j70]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le:
Preface. Discrete Applied Mathematics 157(9): 1979 (2009) - [j69]Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discrete Mathematics 309(12): 3843-3852 (2009) - [j68]Andreas Brandstädt, Van Bang Le:
Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009) - [j67]Peter Wagner, Andreas Brandstädt:
The complete inclusion structure of leaf power classes. Theor. Comput. Sci. 410(52): 5505-5514 (2009) - [c31]Andreas Brandstädt, Raffaele Mosca:
On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 116-126 - [c30]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - 2008
- [j66]Andreas Brandstädt, Chính T. Hoàng:
Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008) - [j65]Andreas Brandstädt, Van Bang Le, R. Sritharan:
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5(1): 11:1-11:22 (2008) - [c29]
- [c28]
- [c27]Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858 - [c26]Andreas Brandstädt, Christian Hundt:
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN 2008: 479-491 - 2007
- [j64]Andreas 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) - [j63]Andreas 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) - [j62]Andreas 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) - [j61]Andreas 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) - [c25]
- [e4]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Dagstuhl Seminar Proceedings 07211, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e3]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. Lecture Notes in Computer Science 4769, Springer 2007, ISBN 978-3-540-74838-0 [contents] - [i2]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. 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 - 2006
- [j60]Andreas 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) - [j59]Dieter Rautenbach, Andreas Brandstädt, Van Bang Le:
Distance-Hereditary 5-Leaf Powers. Electronic Notes in Discrete Mathematics 27: 85-86 (2006) - [j58]Andreas Brandstädt, Van Bang Le:
Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006) - [j57]Andreas 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) - [c24]Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434 - 2005
- [j56]Andreas Brandstädt, Dieter Kratsch:
On the structure of (P5, gem)-free graphs. Discrete Applied Mathematics 145(2): 155-166 (2005) - [j55]Andreas 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) - [j54]Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005) - [j53]Andreas 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) - [j52]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005) - [c23]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196 - [c22]Andreas Brandstädt, Van Bang Le, Suhail Mahfud:
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527 - [c21]Andreas Brandstädt, Chính T. Hoàng:
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. IPCO 2005: 265-275 - 2004
- [j51]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn:
Preface: ODSA. Discrete Applied Mathematics 138(1-2): 1 (2004) - [j50]Andreas Brandstädt:
(P5, diamond)-free graphs revisited: structure and linear time optimization. Discrete Applied Mathematics 138(1-2): 13-27 (2004) - [j49]Andreas 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) - [j48]Andreas 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) - [j47]Andreas 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) - [j46]Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discrete Math. 17(3): 341-360 (2004) - [j45]Andreas 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) - [e2]Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004. Dagstuhl Seminar Proceedings 04221, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [i1]Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes 2004 - 2003
- [j44]Andreas Brandstädt, Vadim V. Lozin:
On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003) - [j43]Andreas Brandstädt, Feodor F. Dragan:
On linear and circular structure of (claw, net)-free graphs. Discrete Applied Mathematics 129(2-3): 285-303 (2003) - [j42]Andreas Brandstädt, Raffaele Mosca:
On variations of P4-sparse graphs. Discrete Applied Mathematics 129(2-3): 521-532 (2003) - [j41]Andreas 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) - [j40]Andreas 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) - [j39]Andreas 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) - [c20]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72 - [c19]Andreas 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 - 2002
- [j38]Luitpold 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) - [j37]Andreas 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) - [j36]Andreas 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) - [c18]Andreas 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 - [c17]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67 - 2001
- [j35]