Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Andreas Brandstädt

2010 – today

see FAQ

What is the meaning of the colors in the publication list?

2013
[j80]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtBKNP13
- ask others
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)
[j79]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtBKNP13a
- ask others
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)
[c36]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/mfcs/BrandstadtMN13
- ask others
Andreas Brandstädt, Martin Milanic, Ragnar Nevries: New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS 2013: 195-206
[i8]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1302-1402
- ask others
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti: Clique cycle-transversals in distance-hereditary graphs. CoRR abs/1302.1402 (2013)
[i7]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1304-6255
- ask others
Andreas Brandstädt, Martin Milanic, Ragnar Nevries: New Polynomial Cases of the Weighted Efficient Domination Problem. CoRR abs/1304.6255 (2013)
[i6]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/BerryBE13
- ask others
Anne Berry, Andreas Brandstädt, Konrad Engel: The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR abs/1309.5787 (2013)
2012
[j78]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtGM12
- ask others
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)
[j77]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtG12
- ask others
Andreas Brandstädt, Vassilis Giakoumakis: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112(3): 67-71 (2012)
[c35]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/isaac/BrandstadtLR12
- ask others
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. ISAAC 2012: 267-277
[i5]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1207-0953
- ask others
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. CoRR abs/1207.0953 (2012)
[i4]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1209-2512
- ask others
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
[j76]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtM11
- ask others
Andreas Brandstädt, Raffaele Mosca: On distance-3 matchings and induced matchings. Discrete Applied Mathematics 159(7): 509-520 (2011)
[j75]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/gc/BrandstadtGLL11
- ask others
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graphs and Combinatorics 27(6): 799-819 (2011)
[c34]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/isaac/BrandstadtM11
- ask others
Andreas Brandstädt, Raffaele Mosca: Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC 2011: 100-109
[i3]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1105-2874
- ask others
Andreas Brandstädt, Vassilis Giakoumakis: Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences. CoRR abs/1105.2874 (2011)
[i2]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1106-2772
- ask others
Andreas Brandstädt, Raffaele Mosca: Dominating Induced Matchings for P7-Free Graphs in Linear Time. CoRR abs/1106.2772 (2011)
[i1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dagstuhl-reports/BrandstadtGHM11
- ask others
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
[j74]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/algorithmica/BrandstadtKLM10
- ask others
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)
[j73]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtW10
- ask others
Andreas Brandstädt, Peter Wagner: Characterising (k, l)-leaf powers. Discrete Applied Mathematics 158(2): 110-122 (2010)
[j72]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtHMW10
- ask others
Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner: Rooted directed path graphs are leaf powers. Discrete Mathematics 310(4): 897-910 (2010)
[j71]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/BrandstadtLM10
- ask others
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)
[j70]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtLR10
- ask others
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach: Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010)
[c33]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/latin/BrandstadtHN10
- ask others
Andreas Brandstädt, Christian Hundt, Ragnar Nevries: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. LATIN 2010: 650-661

2000 – 2009

see FAQ

What is the meaning of the colors in the publication list?

2009
[j69]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtEGL09
- ask others
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le: Preface. Discrete Applied Mathematics 157(9): 1979 (2009)
[j68]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtLR09
- ask others
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)
[j67]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtL09
- ask others
Andreas Brandstädt, Van Bang Le: Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009)
[j66]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/WagnerB09
- ask others
Peter Wagner, Andreas Brandstädt: The complete inclusion structure of leaf power classes. Theor. Comput. Sci. 410(52): 5505-5514 (2009)
[c32]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/birthday/BrandstadtM09
- ask others
Andreas Brandstädt, Raffaele Mosca: On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 116-126
[c31]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/birthday/BrandstadtGLL09
- ask others
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182
2008
[j65]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/algorithmica/BrandstadtH08
- ask others
Andreas Brandstädt, Chính T. Hoàng: Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008)
[j64]
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/talg/BrandstadtLS08
- ask others
Andreas Brandstädt, Van Bang Le, R. Sritharan: Structure and linear-time recognition of 4-leaf powers. ACM Transactions on Algorithms 5(1) (2008)
[c30]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/cocoa/BrandstadtL08
- ask others
Andreas Brandstädt, Van Bang Le: Simplicial Powers of Graphs. COCOA 2008: 160-170
[c29]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/cocoa/BrandstadtW08
- ask others
Andreas Brandstädt, Peter Wagner: On k-Versus (k+1)-Leaf Powers. COCOA 2008: 171-179
[c28]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/isaac/BrandstadtKLM08
- ask others
Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858
[c27]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/latin/BrandstadtH08
- ask others
Andreas Brandstädt, Christian Hundt: Ptolemaic Graphs and Interval Graphs Are Leaf Powers. LATIN 2008: 479-491
2007
[j63]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/algorithmica/BrandstadtDLLU07
- ask others
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)
[j62]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtLM07
- ask others
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)
[j61]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtES07
- ask others
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)
[j60]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtH07
- ask others
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)
[c26]
- view
  - electronic edition @ dagstuhl.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/dagstuhl/BrandstadtJKS07
- ask others
Andreas 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
[c25]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/mfcs/BrandstadtW07
- ask others
Andreas Brandstädt, Peter Wagner: On ( k , l)-Leaf Powers. MFCS 2007: 525-535
[e3]
- view
  - electronic edition @ dagstuhl.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/dagstuhl/2007P7211
- ask others
Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (Eds.): 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
[e2]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/2007
- ask others
Andreas Brandstädt, Dieter Kratsch, Haiko Müller (Eds.): 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
2006
[j59]
- view
  - electronic edition @ dmtcs.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dmtcs/BrandstadtKM06
- ask others
Andreas Brandstädt, Tilo Klembt, Suhail Mahfud: P₆- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Mathematics & Theoretical Computer Science 8(1): 173-188 (2006)
[j58]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/endm/RautenbachBL06
- ask others
Dieter Rautenbach, Andreas Brandstädt, Van Bang Le: Distance-Hereditary 5-Leaf Powers. Electronic Notes in Discrete Mathematics 27: 85-86 (2006)
[j57]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtL06
- ask others
Andreas Brandstädt, Van Bang Le: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006)
[j56]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mst/BrandstadtELL06
- ask others
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]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/swat/BrandstadtDXY06
- ask others
Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan: Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434
2005
[j55]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtK05
- ask others
Andreas Brandstädt, Dieter Kratsch: On the structure of (P₅, gem)-free graphs. Discrete Applied Mathematics 145(2): 155-166 (2005)
[j54]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtLM05
- ask others
Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca: Chordal co-gem-free and (P₅, gem)-free graphs have bounded clique-width. Discrete Applied Mathematics 145(2): 232-241 (2005)
[j53]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtHLL05
- ask others
Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)
[j52]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mst/BrandstadtDLM05
- ask others
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)
[j51]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BodlaenderBKRS05
- ask others
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: On algorithms for (P₅, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005)
[c23]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/BrandstadtELL05
- ask others
Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
[c22]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/BrandstadtLM05
- ask others
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]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/ipco/BrandstadtH05
- ask others
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
[j50]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtEGL04
- ask others
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn: Preface: ODSA. Discrete Applied Mathematics 138(1-2): 1 (2004)
[j49]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/Brandstadt04
- ask others
Andreas Brandstädt: (P₅, diamond)-free graphs revisited: structure and linear time optimization. Discrete Applied Mathematics 138(1-2): 13-27 (2004)
[j48]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtHV04
- ask others
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)
[j47]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ijfcs/BrandstadtLM04
- ask others
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)
[j46]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtLR04
- ask others
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)
[j45]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/BrandstadtL04
- ask others
Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discrete Math. 17(3): 341-360 (2004)
[j44]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtDLL04
- ask others
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)
2003
[j43]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/arscom/BrandstadtL03
- ask others
Andreas Brandstädt, Vadim V. Lozin: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003)
[j42]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtD03
- ask others
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)
[j41]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtM03
- ask others
Andreas Brandstädt, Raffaele Mosca: On variations of P₄-sparse graphs. Discrete Applied Mathematics 129(2-3): 521-532 (2003)
[j40]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtHL03
- ask others
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)
[j39]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtM03a
- ask others
Andreas Brandstädt, Raffaele Mosca: On the structure and stability number of P₅- and co-chair-free graphs. Discrete Applied Mathematics 132(1-3): 47-65 (2003)
[j38]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtLV03
- ask others
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]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/BodlaenderBKRS03
- ask others
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: Linear Time Algorithms for Some NP-Complete Problems on (P₅, Gem)-Free Graphs. FCT 2003: 61-72
[c19]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtDLLU03
- ask others
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
[j37]
- view
  - electronic edition @ loria.fr
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dmtcs/BabelBL02
- ask others
Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of claw-free graphs and a larger graph class. Discrete Mathematics & Theoretical Computer Science 5(1): 127-146 (2002)
[j36]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtLL02
- ask others
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)
[j35]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BrandstadtM02
- ask others
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]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/isaac/BrandstadtDLL02
- ask others
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]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtDLM02
- ask others
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. WG 2002: 57-67
2001
[j34]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtL01
- ask others
Andreas Brandstädt, Vadim V. Lozin: A note on alpha-redundant vertices in graphs. Discrete Applied Mathematics 108(3): 301-308 (2001)
[c16]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/Brandstadt01
- ask others
Andreas Brandstädt: On Robust Algorithms for the Maximum Weight Stable Set Problem. FCT 2001: 445-458
[e1]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/2001
- ask others
Andreas Brandstädt, Van Bang Le (Eds.): Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2204, Springer 2001, ISBN 3-540-42707-4
2000
[j33]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtL00
- ask others
Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of Block Graphs. Discrete Applied Mathematics 99(1-3): 349-366 (2000)
[j32]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtDLS00
- ask others
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)
[j31]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/gc/BrandstadtLO00
- ask others
Andreas Brandstädt, Van Bang Le, Stephan Olariu: Efficiently Recognizing the P ₄-Structure of Trees and of Bipartite Graphs Without Short Cycles. Graphs and Combinatorics 16(4): 381-387 (2000)
[j30]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamcomp/BrandstadtDK00
- ask others
Andreas 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)
[c15]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtL00
- ask others
Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82

1990 – 1999

see FAQ

What is the meaning of the colors in the publication list?

1999
[j29]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BabelBL99
- ask others
Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)
[j28]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtL99
- ask others
Andreas Brandstädt, Van Bang Le: Tree- and Forest-perfect Graphs. Discrete Applied Mathematics 95(1-3): 141-162 (1999)
[j27]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtH99
- ask others
Andreas Brandstädt, Peter L. Hammer: On the Stability Number of Claw-free P₅-free and More General Graphs. Discrete Applied Mathematics 95(1-3): 163-167 (1999)
[j26]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jal/BrandstadtCD99
- ask others
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999)
[j25]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/DraganNB99
- ask others
Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt: Convexity and HHD-Free Graphs. SIAM J. Discrete Math. 12(1): 119-135 (1999)
[c14]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtDK99
- ask others
Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler: Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376
1998
[j24]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtCD98
- ask others
Andreas 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)
[j23]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtLS98
- ask others
Andreas 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)
[j22]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/Brandstadt98
- ask others
Andreas Brandstädt: Corrigendum. Discrete Mathematics 186(1-3): 295 (1998)
[j21]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/networks/BrandstadtD98
- ask others
Andreas 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)
[j20]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/BrandstadtDCV98
- ask others
Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. SIAM J. Discrete Math. 11(3): 437-455 (1998)
1997
[j19]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtDN97
- ask others
Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: LexBFS-orderings and powers of chordal graphs. Discrete Mathematics 171(1-3): 27-42 (1997)
[j18]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtLS97
- ask others
Andreas Brandstädt, Van Bang Le, Thomas Szymczak: Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics 177(1-3): 9-16 (1997)
[j17]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/BrandstadtCD97
- ask others
Andreas 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)
[j16]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtDN97
- ask others
Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs. Theor. Comput. Sci. 172(1-2): 209-232 (1997)
[c13]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/esa/BrandstadtCD97
- ask others
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91
1996
[j15]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/BrandstadtV96
- ask others
Andreas Brandstädt, Heinz-Jürgen Voss: Short Disjoint Cycles in Graphs with Degree Constraints. Discrete Applied Mathematics 64(3): 197-205 (1996)
[j14]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/Brandstadt96
- ask others
Andreas Brandstädt: Partitions of graphs into one or two independent sets and cliques. Discrete Mathematics 152(1-3): 47-54 (1996)
[j13]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/BrandstadtCD96
- ask others
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics 158(1-3): 273-278 (1996)
[j12]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dm/DraganB96
- ask others
Feodor F. Dragan, Andreas Brandstädt: r-Dominating cliques in graphs with hypertree structure. Discrete Mathematics 162(1-3): 93-108 (1996)
[c12]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/DraganNB96
- ask others
Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt: LexBFS-Orderings and Power of Graphs. WG 1996: 166-180
1995
[c11]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtDN95
- ask others
Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs and the Steiner Tree Problem. WG 1995: 381-395
1994
[b1]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - books/daglib/0073241
- ask others
Andreas Brandstädt: Graphen und Algorithmen. Leitfäden und Monographien der Informatik, Teubner 1994, ISBN 978-3-519-02131-5, pp. 1-264
[c10]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/stacs/DraganB94
- ask others
Feodor F. Dragan, Andreas Brandstädt: Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746
[c9]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtCD94
- ask others
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80
1993
[c8]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtV93
- ask others
Andreas Brandstädt, Heinz-Jürgen Voss: Short Disjoint Cycles in Graphs with Degree Constraints. WG 1993: 125-131
[c7]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/BrandstadtDCV93
- ask others
Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. WG 1993: 237-251
1992
[c6]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/Brandstadt92
- ask others
Andreas Brandstädt: On Improved Time Bounds for Permutation Graph Problems. WG 1992: 1-10
1991
[j11]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/Brandstadt91
- ask others
Andreas Brandstädt: Classes of bipartite graphs related to chordal graphs. Discrete Applied Mathematics 32(1): 51-60 (1991)
[c5]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/wg/Brandstadt91
- ask others
Andreas Brandstädt: Short Disjoint Cycles in Cubic Bridgeless Graphs. WG 1991: 239-249

1980 – 1989

see FAQ

What is the meaning of the colors in the publication list?

1989
[c4]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/Branstadt89
- ask others
Andreas Brandstädt: The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. FCT 1989: 68-77
1987
[j10]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eik/Brandstadt87
- ask others
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)
[j9]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mst/BrandenburgBW87
- ask others
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)
[j8]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/MullerB87
- ask others
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)
[j7]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BrandstadtK87
- ask others
Andreas Brandstädt, Dieter Kratsch: On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. 54: 181-198 (1987)
1986
[j6]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eik/BrandstadtK86
- ask others
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
[c3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/BrandstadtK85
- ask others
Andreas Brandstädt, Dieter Kratsch: On the restriction of some NP-complete graph problems to permutation graphs. FCT 1985: 53-62
1983
[j5]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ita/Brandstadt83
- ask others
Andreas Brandstädt: Space Classes, Intersection of Languages and Bounded Erasing Homomorphisms. ITA 17(2): 121-130 (1983)
[c2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/fct/BrandstadtW83
- ask others
Andreas Brandstädt, Klaus W. Wagner: Reversal-Bounded and Visit-Bounded Realtime Computations. FCT 1983: 26-39
1981
[j4]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ita/Brandstadt81
- ask others
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)
[c1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/mfcs/Brandstadt81
- ask others
Andreas Brandstädt: Pushdown Automata with Restricted Use of Storage Symbols. MFCS 1981: 234-241

1970 – 1979

see FAQ

What is the meaning of the colors in the publication list?

1979
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/WechsungB79
- ask others
Gerd Wechsung, Andreas Brandstädt: A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. 9: 127-140 (1979)
1978
[j2]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eik/Brandstadt78
- ask others
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
[j1]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eik/BrandstadtS77
- ask others
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

see FAQ

What is the meaning of the colors in the coauthor index?