Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andreas Brandstädt
@article{DBLP:journals/tcs/BrandstadtM23,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Combining decomposition approaches for the Maximum Weight Stable Set
problem},
journal = {Theor. Comput. Sci.},
volume = {960},
pages = {113914},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113914},
doi = {10.1016/J.TCS.2023.113914},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BrandstadtM22,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding dominating induced matchings in P\({}_{\mbox{9}}\)-free graphs
in polynomial time},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {4},
pages = {1139--1162},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2336},
doi = {10.7151/DMGT.2336},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BrandstadtM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtM21,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum weight independent sets for (\emph{S}\({}_{\mbox{1, 2, 4}}\),
triangle)-free graphs in polynomial time},
journal = {Theor. Comput. Sci.},
volume = {878-879},
pages = {11--25},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.05.027},
doi = {10.1016/J.TCS.2021.05.027},
timestamp = {Mon, 19 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-01772,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Efficient Domination for P\({}_{\mbox{8}}\)-Free Bipartite
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/2101.01772},
year = {2021},
url = {https://arxiv.org/abs/2101.01772},
eprinttype = {arXiv},
eprint = {2101.01772},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-01772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-07532,
author = {Andreas Brandst{\"{a}}dt},
title = {Finding Efficient Domination for (P\({}_{\mbox{9}}\), S\({}_{\mbox{1,
1, 6}}\), S\({}_{\mbox{1, 2, 5}}\)-Free Chordal Bipartite Graphs in
Polynomial Time},
journal = {CoRR},
volume = {abs/2109.07532},
year = {2021},
url = {https://arxiv.org/abs/2109.07532},
eprinttype = {arXiv},
eprint = {2109.07532},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-07532.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM20,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating induced matchings in S1, 2, 4-free graphs},
journal = {Discret. Appl. Math.},
volume = {278},
pages = {83--92},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2018.09.028},
doi = {10.1016/J.DAM.2018.09.028},
timestamp = {Fri, 15 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM20a,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On efficient domination for some classes of H-free chordal graphs},
journal = {Discret. Appl. Math.},
volume = {281},
pages = {81--95},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.04.029},
doi = {10.1016/J.DAM.2019.04.029},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM20b,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial
time},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {417--434},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.01.028},
doi = {10.1016/J.DAM.2020.01.028},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM20b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM20c,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial
time},
journal = {Discret. Appl. Math.},
volume = {284},
pages = {269--280},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.03.043},
doi = {10.1016/J.DAM.2020.03.043},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM20c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-04046,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Efficient Domination for S\({}_{\mbox{1, 3, 3}}\)-Free Bipartite
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/2008.04046},
year = {2020},
url = {https://arxiv.org/abs/2008.04046},
eprinttype = {arXiv},
eprint = {2008.04046},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-16076,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Efficient Domination for S\({}_{\mbox{1, 1, 5}}\)-Free Bipartite
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/2010.16076},
year = {2020},
url = {https://arxiv.org/abs/2010.16076},
eprinttype = {arXiv},
eprint = {2010.16076},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-16076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM19,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On efficient domination for some classes of H-free bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {270},
pages = {58--67},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.06.004},
doi = {10.1016/J.DAM.2019.06.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtM19,
author = {Andreas Brandst{\"{a}}dt and
Martin Milanic},
title = {A dichotomy for weighted efficient dominating sets with bounded degree
vertices},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {30--34},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.007},
doi = {10.1016/J.IPL.2018.10.007},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-05582,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Dominating Induced Matchings in S\({}_{\mbox{1, 1, 5}}\)-Free
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1905.05582},
year = {2019},
url = {http://arxiv.org/abs/1905.05582},
eprinttype = {arXiv},
eprint = {1905.05582},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-05582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-00978,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Dominating Induced Matchings in P\({}_{\mbox{9}}\)-Free Graphs
in Polynomial Time},
journal = {CoRR},
volume = {abs/1908.00978},
year = {2019},
url = {http://arxiv.org/abs/1908.00978},
eprinttype = {arXiv},
eprint = {1908.00978},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-00978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM18,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial
time},
journal = {Discret. Appl. Math.},
volume = {236},
pages = {57--65},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.10.003},
doi = {10.1016/J.DAM.2017.10.003},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM18a,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum weight independent set for {\(\mathscr{l}\)}claw-free graphs
in polynomial time},
journal = {Discret. Appl. Math.},
volume = {237},
pages = {57--64},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.11.029},
doi = {10.1016/J.DAM.2017.11.029},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtGM18,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis and
Martin Milanic},
title = {Weighted efficient domination for some classes of H-free and of (H1,
H2)-free graphs},
journal = {Discret. Appl. Math.},
volume = {250},
pages = {130--144},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.05.012},
doi = {10.1016/J.DAM.2018.05.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/Brandstadt18,
author = {Andreas Brandst{\"{a}}dt},
editor = {B. S. Panda and
Partha P. Goswami},
title = {Efficient Domination and Efficient Edge Domination: {A} Brief Survey},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {1--14},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_1},
doi = {10.1007/978-3-319-74180-2\_1},
timestamp = {Wed, 09 Jun 2021 08:38:40 +0200},
biburl = {https://dblp.org/rec/conf/caldam/Brandstadt18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2018,
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5},
doi = {10.1007/978-3-030-00256-5},
isbn = {978-3-030-00255-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-00386,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On Efficient Domination for Some Classes of H-Free Bipartite Graphs},
journal = {CoRR},
volume = {abs/1806.00386},
year = {2018},
url = {http://arxiv.org/abs/1806.00386},
eprinttype = {arXiv},
eprint = {1806.00386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-00386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09472,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Sets for (S\({}_{\mbox{1, 2, 4}}\), Triangle)-Free
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1806.09472},
year = {2018},
url = {http://arxiv.org/abs/1806.09472},
eprinttype = {arXiv},
eprint = {1806.09472},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09472.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtM17,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Dominating Induced Matchings in P\({}_{\mbox{8}}\) -Free Graphs
in Polynomial Time},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1283--1302},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0150-y},
doi = {10.1007/S00453-016-0150-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEFK17,
author = {Andreas Brandst{\"{a}}dt and
Elaine M. Eschen and
Erik Friese and
T. Karthick},
title = {Efficient domination for classes of P\({}_{\mbox{6}}\)-free graphs},
journal = {Discret. Appl. Math.},
volume = {223},
pages = {15--27},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.019},
doi = {10.1016/J.DAM.2016.08.019},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEFK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BrandstadtM17,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On Efficient Domination for Some Classes of \emph{H}-Free Chordal
Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {57--62},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.011},
doi = {10.1016/J.ENDM.2017.10.011},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BrandstadtM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrandstadtDHP17,
author = {Andreas Brandst{\"{a}}dt and
Konrad Kazimierz Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding the Clique-Width of \emph{H}-Free Chordal Graphs},
journal = {J. Graph Theory},
volume = {86},
number = {1},
pages = {42--77},
year = {2017},
url = {https://doi.org/10.1002/jgt.22111},
doi = {10.1002/JGT.22111},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrandstadtDHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM17,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On Efficient Domination for Some Classes of H-Free Chordal Graphs},
journal = {CoRR},
volume = {abs/1701.03414},
year = {2017},
url = {http://arxiv.org/abs/1701.03414},
eprinttype = {arXiv},
eprint = {1701.03414},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM17a,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On Chordal-k-Generalized Split Graphs},
journal = {CoRR},
volume = {abs/1702.07914},
year = {2017},
url = {http://arxiv.org/abs/1702.07914},
eprinttype = {arXiv},
eprint = {1702.07914},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM17b,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Finding Dominating Induced Matchings in {\textdollar}S{\_}\{2, 2,
3\}{\textdollar}-Free Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1706.04894},
year = {2017},
url = {http://arxiv.org/abs/1706.04894},
eprinttype = {arXiv},
eprint = {1706.04894},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM17b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM17c,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating Induced Matchings in {\textdollar}S{\_}\{1, 2, 4\}{\textdollar}-Free
Graphs},
journal = {CoRR},
volume = {abs/1706.09301},
year = {2017},
url = {http://arxiv.org/abs/1706.09301},
eprinttype = {arXiv},
eprint = {1706.09301},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM17c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtK16,
author = {Andreas Brandst{\"{a}}dt and
T. Karthick},
title = {Weighted efficient domination in two subclasses of P\({}_{\mbox{6}}\)-free
graphs},
journal = {Discret. Appl. Math.},
volume = {201},
pages = {38--46},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.07.032},
doi = {10.1016/J.DAM.2015.07.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtENP16,
author = {Andreas Brandst{\"{a}}dt and
Simone Esposito and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {Clique cycle-transversals in distance-hereditary graphs},
journal = {Discret. Appl. Math.},
volume = {210},
pages = {38--44},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2014.12.007},
doi = {10.1016/J.DAM.2014.12.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtENP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtDHP16,
author = {Andreas Brandst{\"{a}}dt and
Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding the clique-width of H-free split graphs},
journal = {Discret. Appl. Math.},
volume = {211},
pages = {30--39},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.04.003},
doi = {10.1016/J.DAM.2016.04.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtDHP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtM16,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Weighted Efficient Domination for P\({}_{\mbox{5}}\)-Free and P\({}_{\mbox{6}}\)-Free
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {4},
pages = {2288--2303},
year = {2016},
url = {https://doi.org/10.1137/15M1039821},
doi = {10.1137/15M1039821},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtM16,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
editor = {Pinar Heggernes},
title = {Weighted Efficient Domination for P{\_}6 -Free and for P{\_}5 -Free
Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {38--49},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_4},
doi = {10.1007/978-3-662-53536-3\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BrandstadtN16,
author = {Andreas Brandst{\"{a}}dt and
Ragnar Nevries},
title = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs},
booktitle = {Encyclopedia of Algorithms},
pages = {618--621},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_689},
doi = {10.1007/978-1-4939-2864-4\_689},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/BrandstadtN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM16,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial
Time},
journal = {CoRR},
volume = {abs/1602.05838},
year = {2016},
url = {http://arxiv.org/abs/1602.05838},
eprinttype = {arXiv},
eprint = {1602.05838},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtMM16,
author = {Andreas Brandst{\"{a}}dt and
Suhail Mahfud and
Raffaele Mosca},
title = {Bounded Clique-Width of ({\textdollar}S{\_}\{1, 2, 2\}{\textdollar},
Triangle)-Free Graphs},
journal = {CoRR},
volume = {abs/1608.01820},
year = {2016},
url = {http://arxiv.org/abs/1608.01820},
eprinttype = {arXiv},
eprint = {1608.01820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryBGM15,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis and
Fr{\'{e}}d{\'{e}}ric Maffray},
title = {Efficiently decomposing, recognizing and triangulating hole-free graphs
without diamonds},
journal = {Discret. Appl. Math.},
volume = {184},
pages = {50--61},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.11.018},
doi = {10.1016/J.DAM.2014.11.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryBGM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BrandstadtDHP15,
author = {Andreas Brandst{\"{a}}dt and
Konrad Kazimierz Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding the Clique-Width of H-free Split Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {497--503},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.069},
doi = {10.1016/J.ENDM.2015.06.069},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BrandstadtDHP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtM15,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart
or Without Bull},
journal = {Graphs Comb.},
volume = {31},
number = {5},
pages = {1249--1262},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1461-x},
doi = {10.1007/S00373-014-1461-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BerryBE15,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Konrad Engel},
title = {The Dilworth Number of Auto-Chordal Bipartite Graphs},
journal = {Graphs Comb.},
volume = {31},
number = {5},
pages = {1463--1471},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1471-8},
doi = {10.1007/S00373-014-1471-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BerryBE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtFLM15,
author = {Andreas Brandst{\"{a}}dt and
Pavel Ficur and
Arne Leitert and
Martin Milanic},
title = {Polynomial-time algorithms for weighted efficient domination problems
in AT-free graphs and dually chordal graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {256--262},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.024},
doi = {10.1016/J.IPL.2014.09.024},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtFLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtG15,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free
graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {345--350},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.019},
doi = {10.1016/J.IPL.2014.09.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrandstadtDHP15,
author = {Andreas Brandst{\"{a}}dt and
Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Bounding the Clique-Width of H-free Chordal Graphs},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {139--150},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_12},
doi = {10.1007/978-3-662-48054-0\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrandstadtDHP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtEF15,
author = {Andreas Brandst{\"{a}}dt and
Elaine M. Eschen and
Erik Friese},
editor = {Ernst W. Mayr},
title = {Efficient Domination for Some Subclasses of P{\_}6 -free Graphs in
Polynomial Time},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {78--89},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_6},
doi = {10.1007/978-3-662-53174-7\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtEF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtDHP15,
author = {Andreas Brandst{\"{a}}dt and
Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding the Clique-Width of H-free Chordal Graphs},
journal = {CoRR},
volume = {abs/1502.06948},
year = {2015},
url = {http://arxiv.org/abs/1502.06948},
eprinttype = {arXiv},
eprint = {1502.06948},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtDHP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtEF15,
author = {Andreas Brandst{\"{a}}dt and
Elaine M. Eschen and
Erik Friese},
title = {Efficient Domination for Some Subclasses of P\({}_{\mbox{6}}\)-Free
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1503.00091},
year = {2015},
url = {http://arxiv.org/abs/1503.00091},
eprinttype = {arXiv},
eprint = {1503.00091},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtEF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtK15,
author = {Andreas Brandst{\"{a}}dt and
T. Karthick},
title = {Weighted Efficient Domination in Classes of P\({}_{\mbox{6}}\)-free
Graphs},
journal = {CoRR},
volume = {abs/1503.06025},
year = {2015},
url = {http://arxiv.org/abs/1503.06025},
eprinttype = {arXiv},
eprint = {1503.06025},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM15,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating Induced Matchings for P\({}_{\mbox{8}}\)-free Graphs in
Polynomial Time},
journal = {CoRR},
volume = {abs/1507.06541},
year = {2015},
url = {http://arxiv.org/abs/1507.06541},
eprinttype = {arXiv},
eprint = {1507.06541},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Brandstadt15,
author = {Andreas Brandst{\"{a}}dt},
title = {Weighted Efficient Domination for P\({}_{\mbox{5}}\)-Free Graphs in
Linear Time},
journal = {CoRR},
volume = {abs/1507.06765},
year = {2015},
url = {http://arxiv.org/abs/1507.06765},
eprinttype = {arXiv},
eprint = {1507.06765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Brandstadt15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM15a,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Weighted Efficient Domination for {\textdollar}P{\_}6{\textdollar}-Free
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1508.07733},
year = {2015},
url = {http://arxiv.org/abs/1508.07733},
eprinttype = {arXiv},
eprint = {1508.07733},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtDHP15a,
author = {Andreas Brandst{\"{a}}dt and
Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding the Clique-Width of {\textdollar}H{\textdollar}-free Split
Graphs},
journal = {CoRR},
volume = {abs/1509.04273},
year = {2015},
url = {http://arxiv.org/abs/1509.04273},
eprinttype = {arXiv},
eprint = {1509.04273},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtDHP15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtM15b,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Sets for ({\textdollar}P{\_}7{\textdollar},
Triangle)-Free Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1511.08066},
year = {2015},
url = {http://arxiv.org/abs/1511.08066},
eprinttype = {arXiv},
eprint = {1511.08066},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtM15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtM14,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating Induced Matchings for {P} 7-Free Graphs in Linear Time},
journal = {Algorithmica},
volume = {68},
number = {4},
pages = {998--1018},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9709-4},
doi = {10.1007/S00453-012-9709-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEGLLP14,
author = {Andreas Brandst{\"{a}}dt and
Konrad Engel and
Hans{-}Dietrich O. F. Gronau and
Roger Labahn and
Van Bang Le and
Florian Pfender},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {163},
pages = {101},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.09.002},
doi = {10.1016/J.DAM.2013.09.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEGLLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtL14,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {A note on efficient domination in a superclass of P\({}_{\mbox{5}}\)-free
graphs},
journal = {Inf. Process. Lett.},
volume = {114},
number = {7},
pages = {357--359},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.02.007},
doi = {10.1016/J.IPL.2014.02.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtG14,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Weighted Efficient Domination for {\textdollar}(P{\_}5+kP{\_}2){\textdollar}-Free
Graphs in Polynomial Time},
journal = {CoRR},
volume = {abs/1407.4593},
year = {2014},
url = {http://arxiv.org/abs/1407.4593},
eprinttype = {arXiv},
eprint = {1407.4593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandstadtFLM14,
author = {Andreas Brandst{\"{a}}dt and
Pavel Ficur and
Arne Leitert and
Martin Milanic},
title = {Polynomial-time Algorithms for Weighted Efficient Domination Problems
in AT-free Graphs and Dually Chordal Graphs},
journal = {CoRR},
volume = {abs/1410.0770},
year = {2014},
url = {http://arxiv.org/abs/1410.0770},
eprinttype = {arXiv},
eprint = {1410.0770},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrandstadtFLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BrandstadtENP13,
author = {Andreas Brandst{\"{a}}dt and
Simone Esposito and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {Clique cycle transversals in distance-hereditary graphs},
journal = {Electron. Notes Discret. Math.},
volume = {44},
pages = {15--21},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.10.004},
doi = {10.1016/J.ENDM.2013.10.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BrandstadtENP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtBKNP13,
author = {Andreas Brandst{\"{a}}dt and
Synara Brito and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {Cycle transversals in perfect graphs and cographs},
journal = {Theor. Comput. Sci.},
volume = {469},
pages = {15--23},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.10.030},
doi = {10.1016/J.TCS.2012.10.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtBKNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtBKNP13a,
author = {Andreas Brandst{\"{a}}dt and
Synara Brito and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {Corrigendum to "Cycle transversals in perfect graphs and cographs"
[Theoret. Comput. Sci. 469(2013) 15-23]},
journal = {Theor. Comput. Sci.},
volume = {487},
pages = {103--105},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.03.022},
doi = {10.1016/J.TCS.2013.03.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtBKNP13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrandstadtMN13,
author = {Andreas Brandst{\"{a}}dt and
Martin Milanic and
Ragnar Nevries},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {New Polynomial Cases of the Weighted Efficient Domination Problem},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {195--206},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_19},
doi = {10.1007/978-3-642-40313-2\_19},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrandstadtMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2013,
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3},
doi = {10.1007/978-3-642-45043-3},
isbn = {978-3-642-45042-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-1402,
author = {Andreas Brandst{\"{a}}dt and
Simone Esposito and
Loana Tito Nogueira and
F{\'{a}}bio Protti},
title = {Clique cycle-transversals in distance-hereditary graphs},
journal = {CoRR},
volume = {abs/1302.1402},
year = {2013},
url = {http://arxiv.org/abs/1302.1402},
eprinttype = {arXiv},
eprint = {1302.1402},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-1402.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6255,
author = {Andreas Brandst{\"{a}}dt and
Martin Milanic and
Ragnar Nevries},
title = {New Polynomial Cases of the Weighted Efficient Domination Problem},
journal = {CoRR},
volume = {abs/1304.6255},
year = {2013},
url = {http://arxiv.org/abs/1304.6255},
eprinttype = {arXiv},
eprint = {1304.6255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerryBE13,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Konrad Engel},
title = {The Dilworth Number of Auto-Chordal-Bipartite Graphs},
journal = {CoRR},
volume = {abs/1309.5787},
year = {2013},
url = {http://arxiv.org/abs/1309.5787},
eprinttype = {arXiv},
eprint = {1309.5787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerryBE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtGM12,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis and
Fr{\'{e}}d{\'{e}}ric Maffray},
title = {Clique separator decomposition of hole-free and diamond-free graphs
and algorithmic consequences},
journal = {Discret. Appl. Math.},
volume = {160},
number = {4-5},
pages = {471--478},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.10.031},
doi = {10.1016/J.DAM.2011.10.031},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtG12,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Maximum Weight Independent Sets in hole- and co-chair-free graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {67--71},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.015},
doi = {10.1016/J.IPL.2011.09.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtLR12,
author = {Andreas Brandst{\"{a}}dt and
Arne Leitert and
Dieter Rautenbach},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {267--277},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_30},
doi = {10.1007/978-3-642-35261-4\_30},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0953,
author = {Andreas Brandst{\"{a}}dt and
Arne Leitert and
Dieter Rautenbach},
title = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs},
journal = {CoRR},
volume = {abs/1207.0953},
year = {2012},
url = {http://arxiv.org/abs/1207.0953},
eprinttype = {arXiv},
eprint = {1207.0953},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0953.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-2512,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart
or Without Bull},
journal = {CoRR},
volume = {abs/1209.2512},
year = {2012},
url = {http://arxiv.org/abs/1209.2512},
eprinttype = {arXiv},
eprint = {1209.2512},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-2512.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM11,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On distance-3 matchings and induced matchings},
journal = {Discret. Appl. Math.},
volume = {159},
number = {7},
pages = {509--520},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.05.022},
doi = {10.1016/J.DAM.2010.05.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtGLL11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
title = {Path-Bicolorable Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {799--819},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1007-9},
doi = {10.1007/S00373-010-1007-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtGLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtM11,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Dominating Induced Matchings for {P} 7-free Graphs in Linear Time},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {100--109},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_12},
doi = {10.1007/978-3-642-25591-5\_12},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2874,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Clique Separator Decomposition of Hole- and Diamond-Free Graphs and
Algorithmic Consequences},
journal = {CoRR},
volume = {abs/1105.2874},
year = {2011},
url = {http://arxiv.org/abs/1105.2874},
eprinttype = {arXiv},
eprint = {1105.2874},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-2772,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {Dominating Induced Matchings for P7-Free Graphs in Linear Time},
journal = {CoRR},
volume = {abs/1106.2772},
year = {2011},
url = {http://arxiv.org/abs/1106.2772},
eprinttype = {arXiv},
eprint = {1106.2772},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-2772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BrandstadtGHM11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Pinar Heggernes and
Ross M. McConnell},
title = {Exploiting graph structure to cope with hard problems (Dagstuhl Seminar
11182)},
journal = {Dagstuhl Reports},
volume = {1},
number = {5},
pages = {29--46},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.5.29},
doi = {10.4230/DAGREP.1.5.29},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BrandstadtGHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtKLM10,
author = {Andreas Brandst{\"{a}}dt and
Tilo Klembt and
Vadim V. Lozin and
Raffaele Mosca},
title = {On Independent Vertex Sets in Subclasses of Apple-Free Graphs},
journal = {Algorithmica},
volume = {56},
number = {4},
pages = {383--393},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9176-0},
doi = {10.1007/S00453-008-9176-0},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtKLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtW10,
author = {Andreas Brandst{\"{a}}dt and
Peter Wagner},
title = {Characterising (k, \emph{l})-leaf powers},
journal = {Discret. Appl. Math.},
volume = {158},
number = {2},
pages = {110--122},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.09.008},
doi = {10.1016/J.DAM.2009.09.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtHMW10,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt and
Federico Mancini and
Peter Wagner},
title = {Rooted directed path graphs are leaf powers},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {897--910},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.10.006},
doi = {10.1016/J.DISC.2009.10.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtHMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtLM10,
author = {Andreas Brandst{\"{a}}dt and
Vadim V. Lozin and
Raffaele Mosca},
title = {Independent Sets of Maximum Weight in Apple-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {1},
pages = {239--254},
year = {2010},
url = {https://doi.org/10.1137/090750822},
doi = {10.1137/090750822},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtLR10,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Dieter Rautenbach},
title = {Exact leaf powers},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {31-33},
pages = {2968--2977},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.04.027},
doi = {10.1016/J.TCS.2010.04.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BrandstadtHN10,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt and
Ragnar Nevries},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Efficient Edge Domination on Hole-Free Graphs in Polynomial Time},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {650--661},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_56},
doi = {10.1007/978-3-642-12200-2\_56},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BrandstadtHN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEGL09,
author = {Andreas Brandst{\"{a}}dt and
Konrad Engel and
Hans{-}Dietrich O. F. Gronau and
Van Bang Le},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {1979},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.11.007},
doi = {10.1016/J.DAM.2008.11.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtLR09,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Dieter Rautenbach},
title = {A forbidden induced subgraph characterization of distance-hereditary
5-leaf powers},
journal = {Discret. Math.},
volume = {309},
number = {12},
pages = {3843--3852},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.10.025},
doi = {10.1016/J.DISC.2008.10.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtL09,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Simplicial powers of graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5443--5454},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.010},
doi = {10.1016/J.TCS.2009.04.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WagnerB09,
author = {Peter Wagner and
Andreas Brandst{\"{a}}dt},
title = {The complete inclusion structure of leaf power classes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5505--5514},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.031},
doi = {10.1016/J.TCS.2009.06.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WagnerB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BrandstadtM09,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {On Distance-3 Matchings and Induced Matchings},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {116--126},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_11},
doi = {10.1007/978-3-642-02029-2\_11},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BrandstadtM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BrandstadtGLL09,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Path-Bicolorable Graphs},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {172--182},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_17},
doi = {10.1007/978-3-642-02029-2\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BrandstadtGLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtH08,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng},
title = {Maximum Induced Matchings for Chordal Graphs in Linear Time},
journal = {Algorithmica},
volume = {52},
number = {4},
pages = {440--447},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9045-2},
doi = {10.1007/S00453-007-9045-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrandstadtLS08,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
R. Sritharan},
title = {Structure and linear-time recognition of 4-leaf powers},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {1},
pages = {11:1--11:22},
year = {2008},
url = {https://doi.org/10.1145/1435375.1435386},
doi = {10.1145/1435375.1435386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BrandstadtLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BrandstadtL08,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Simplicial Powers of Graphs},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {160--170},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_15},
doi = {10.1007/978-3-540-85097-7\_15},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BrandstadtL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BrandstadtW08,
author = {Andreas Brandst{\"{a}}dt and
Peter Wagner},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {On k-Versus (k+1)-Leaf Powers},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {171--179},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_16},
doi = {10.1007/978-3-540-85097-7\_16},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BrandstadtW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtKLM08,
author = {Andreas Brandst{\"{a}}dt and
Tilo Klembt and
Vadim V. Lozin and
Raffaele Mosca},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Independent Sets of Maximum Weight in Apple-Free Graphs},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {848--858},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_74},
doi = {10.1007/978-3-540-92182-0\_74},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtKLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BrandstadtH08,
author = {Andreas Brandst{\"{a}}dt and
Christian Hundt},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Ptolemaic Graphs and Interval Graphs Are Leaf Powers},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {479--491},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_42},
doi = {10.1007/978-3-540-78773-0\_42},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BrandstadtH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtDLLU07,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
journal = {Algorithmica},
volume = {47},
number = {1},
pages = {27--51},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-1209-y},
doi = {10.1007/S00453-006-1209-Y},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtDLLU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtLM07,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Suhail Mahfud},
title = {New applications of clique separator decomposition for the Maximum
Weight Stable Set problem},
journal = {Theor. Comput. Sci.},
volume = {370},
number = {1-3},
pages = {229--239},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.10.035},
doi = {10.1016/J.TCS.2006.10.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtES07,
author = {Andreas Brandst{\"{a}}dt and
Elaine M. Eschen and
R. Sritharan},
title = {The induced matching and chain subgraph cover problems for convex
bipartite graphs},
journal = {Theor. Comput. Sci.},
volume = {381},
number = {1-3},
pages = {260--265},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.04.006},
doi = {10.1016/J.TCS.2007.04.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtES07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtH07,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng},
title = {On clique separators, nearly chordal graphs, and the Maximum Weight
Stable Set Problem},
journal = {Theor. Comput. Sci.},
volume = {389},
number = {1-2},
pages = {295--306},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.09.031},
doi = {10.1016/J.TCS.2007.09.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrandstadtW07,
author = {Andreas Brandst{\"{a}}dt and
Peter Wagner},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {On {(} \emph{k} , \emph{l})-Leaf Powers},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {525--535},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_47},
doi = {10.1007/978-3-540-74456-6\_47},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrandstadtW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7211,
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
title = {Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes, 20.05. - 25.05.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07211},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/portals/07211/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7211.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2007,
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7},
doi = {10.1007/978-3-540-74839-7},
isbn = {978-3-540-74838-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandstadtJKS07,
author = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
title = {07211 Abstracts Collection - Exact, Approximative, Robust and Certifying
Algorithms on Particular Graph Classes},
booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes, 20.05. - 25.05.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07211},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1269},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandstadtJKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BrandstadtKM06,
author = {Andreas Brandst{\"{a}}dt and
Tilo Klembt and
Suhail Mahfud},
title = {\emph{P}\({}_{\mbox{6}}\)- and triangle-free graphs revisited: structure
and bounded clique-width},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {8},
number = {1},
pages = {173--188},
year = {2006},
url = {https://doi.org/10.46298/dmtcs.372},
doi = {10.46298/DMTCS.372},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BrandstadtKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RautenbachBL06,
author = {Dieter Rautenbach and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Distance-Hereditary 5-Leaf Powers},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {85--86},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.068},
doi = {10.1016/J.ENDM.2006.08.068},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RautenbachBL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtL06,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Structure and linear time recognition of 3-leaf powers},
journal = {Inf. Process. Lett.},
volume = {98},
number = {4},
pages = {133--138},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.004},
doi = {10.1016/J.IPL.2006.01.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandstadtELL06,
author = {Andreas Brandst{\"{a}}dt and
Joost Engelfriet and
Ho{\`{a}}ng{-}Oanh Le and
Vadim V. Lozin},
title = {Clique-Width for 4-Vertex Forbidden Subgraphs},
journal = {Theory Comput. Syst.},
volume = {39},
number = {4},
pages = {561--590},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1199-1},
doi = {10.1007/S00224-005-1199-1},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BrandstadtELL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrandstadtDXY06,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Yang Xiang and
Chenyu Yan},
editor = {Lars Arge and
Rusins Freivalds},
title = {Generalized Powers of Graphs and Their Algorithmic Use},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {423--434},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_39},
doi = {10.1007/11785293\_39},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrandstadtDXY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtK05,
author = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch},
title = {On the structure of (\emph{P}\({}_{\mbox{5}}\), gem)-free graphs},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {155--166},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.009},
doi = {10.1016/J.DAM.2004.01.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtLM05,
author = {Andreas Brandst{\"{a}}dt and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
title = {Chordal co-gem-free and (\emph{P}\({}_{\mbox{5}}\), gem)-free graphs
have bounded clique-width},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {232--241},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.014},
doi = {10.1016/J.DAM.2004.01.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtHLL05,
author = {Andreas Brandst{\"{a}}dt and
Peter L. Hammer and
Van Bang Le and
Vadim V. Lozin},
title = {Bisplit graphs},
journal = {Discret. Math.},
volume = {299},
number = {1-3},
pages = {11--32},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.08.046},
doi = {10.1016/J.DISC.2004.08.046},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtHLL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandstadtDLM05,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
title = {New Graph Classes of Bounded Clique-Width},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {623--645},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1154-6},
doi = {10.1007/S00224-004-1154-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandstadtDLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderBKRS05,
author = {Hans L. Bodlaender and
Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Micha{\"{e}}l Rao and
Jeremy P. Spinrad},
title = {On algorithms for (\emph{P}\({}_{\mbox{5}}\), gem)-free graphs},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {1},
pages = {2--21},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.026},
doi = {10.1016/J.TCS.2005.09.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderBKRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrandstadtELL05,
author = {Andreas Brandst{\"{a}}dt and
Joost Engelfriet and
Ho{\`{a}}ng{-}Oanh Le and
Vadim V. Lozin},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Clique-Width for Four-Vertex Forbidden Subgraphs},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {185--196},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_17},
doi = {10.1007/11537311\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrandstadtELL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrandstadtLM05,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Suhail Mahfud},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {New Applications of Clique Separator Decomposition for the Maximum
Weight Stable Set Problem},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {516--527},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_45},
doi = {10.1007/11537311\_45},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrandstadtLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BrandstadtH05,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight
Stable Set Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {265--275},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_20},
doi = {10.1007/11496915\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BrandstadtH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtEGL04,
author = {Andreas Brandst{\"{a}}dt and
Konrad Engel and
Hans{-}Dietrich O. F. Gronau and
Roger Labahn},
title = {Preface: {ODSA}},
journal = {Discret. Appl. Math.},
volume = {138},
number = {1-2},
pages = {1},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00264-6},
doi = {10.1016/S0166-218X(03)00264-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtEGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brandstadt04,
author = {Andreas Brandst{\"{a}}dt},
title = {(P\({}_{\mbox{5}}\), diamond)-free graphs revisited: structure and
linear time optimization},
journal = {Discret. Appl. Math.},
volume = {138},
number = {1-2},
pages = {13--27},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00266-X},
doi = {10.1016/S0166-218X(03)00266-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Brandstadt04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtHV04,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Jean{-}Marie Vanherpe},
title = {On minimal prime extensions of a four-vertex graph in a prime graph},
journal = {Discret. Math.},
volume = {288},
number = {1-3},
pages = {9--17},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.06.019},
doi = {10.1016/J.DISC.2004.06.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtHV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BrandstadtLM04,
author = {Andreas Brandst{\"{a}}dt and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
title = {Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width},
journal = {Int. J. Found. Comput. Sci.},
volume = {15},
number = {1},
pages = {163--185},
year = {2004},
url = {https://doi.org/10.1142/S0129054104002364},
doi = {10.1142/S0129054104002364},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BrandstadtLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLR04,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
H. N. de Ridder},
title = {Efficient robust algorithms for the Maximum Weight Stable Set Problem
in chair-free graph classes},
journal = {Inf. Process. Lett.},
volume = {89},
number = {4},
pages = {165--173},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.11.002},
doi = {10.1016/J.IPL.2003.11.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtL04,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Split-Perfect Graphs: Characterizations and Algorithmic Use},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {3},
pages = {341--360},
year = {2004},
url = {https://doi.org/10.1137/S0895480100367676},
doi = {10.1137/S0895480100367676},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtDLL04,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Tree spanners on chordal graphs: complexity and algorithms},
journal = {Theor. Comput. Sci.},
volume = {310},
number = {1-3},
pages = {329--354},
year = {2004},
url = {https://doi.org/10.1016/S0304-3975(03)00424-9},
doi = {10.1016/S0304-3975(03)00424-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtDLL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4221,
editor = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
title = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05.
- 28.05.2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04221},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/portals/04221/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandstadtCJS04,
author = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
editor = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
title = {04221 Abstracts Collection - Robust and Approximative Algorithms on
Particular Graph Classes},
booktitle = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05.
- 28.05.2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04221},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/273/},
timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandstadtCJS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrandstadtL03,
author = {Andreas Brandst{\"{a}}dt and
Vadim V. Lozin},
title = {On the linear structure and clique-width of bipartite permutation
graphs},
journal = {Ars Comb.},
volume = {67},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrandstadtL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtD03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan},
title = {On linear and circular structure of (claw, net)-free graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {285--303},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00571-1},
doi = {10.1016/S0166-218X(02)00571-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM03,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On variations of P\({}_{\mbox{4}}\)-sparse graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {521--532},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00180-X},
doi = {10.1016/S0166-218X(03)00180-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtHL03,
author = {Andreas Brandst{\"{a}}dt and
Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Van Bang Le},
title = {Stability number of bull- and chair-free graphs revisited},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {39--50},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00415-8},
doi = {10.1016/S0166-218X(02)00415-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtHL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM03a,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On the structure and stability number of P\({}_{\mbox{5}}\)- and co-chair-free
graphs},
journal = {Discret. Appl. Math.},
volume = {132},
number = {1-3},
pages = {47--65},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00389-5},
doi = {10.1016/S0166-218X(03)00389-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLV03,
author = {Andreas Brandst{\"{a}}dt and
Ho{\`{a}}ng{-}Oanh Le and
Jean{-}Marie Vanherpe},
title = {Structure and stability number of chair-, co-P- and gem-free graphs
revisited},
journal = {Inf. Process. Lett.},
volume = {86},
number = {3},
pages = {161--167},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00487-8},
doi = {10.1016/S0020-0190(02)00487-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BodlaenderBKRS03,
author = {Hans L. Bodlaender and
Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Micha{\"{e}}l Rao and
Jeremy P. Spinrad},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Linear Time Algorithms for Some NP-Complete Problems on (P\({}_{\mbox{5}}\),
Gem)-Free Graphs},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {61--72},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_7},
doi = {10.1007/978-3-540-45077-1\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BodlaenderBKRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDLLU03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
editor = {Hans L. Bodlaender},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {106--118},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_10},
doi = {10.1007/978-3-540-39890-5\_10},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLLU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BabelBL02,
author = {Luitpold Babel and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of claw-free graphs and
a larger graph class},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {5},
number = {1},
pages = {127--146},
year = {2002},
url = {https://doi.org/10.46298/dmtcs.294},
doi = {10.46298/DMTCS.294},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BabelBL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtLL02,
author = {Andreas Brandst{\"{a}}dt and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {On alpha-redundant vertices in P5-free graphs},
journal = {Inf. Process. Lett.},
volume = {82},
number = {3},
pages = {119--122},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00265-4},
doi = {10.1016/S0020-0190(01)00265-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtM02,
author = {Andreas Brandst{\"{a}}dt and
Suhail Mahfud},
title = {Maximum Weight Stable Set on graphs without claw and co-claw (and
similar graph classes) can be solved in linear time},
journal = {Inf. Process. Lett.},
volume = {84},
number = {5},
pages = {251--259},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00291-0},
doi = {10.1016/S0020-0190(02)00291-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtDLL02,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Prosenjit Bose and
Pat Morin},
title = {Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {163--174},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_15},
doi = {10.1007/3-540-36136-7\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtDLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDLM02,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
editor = {Ludek Kucera},
title = {New Graph Classes of Bounded Clique-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {57--67},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_6},
doi = {10.1007/3-540-36379-3\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtL01,
author = {Andreas Brandst{\"{a}}dt and
Vadim V. Lozin},
title = {A note on alpha-redundant vertices in graphs},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {301--308},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00239-0},
doi = {10.1016/S0166-218X(00)00239-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Brandstadt01,
author = {Andreas Brandst{\"{a}}dt},
editor = {Rusins Freivalds},
title = {On Robust Algorithms for the Maximum Weight Stable Set Problem},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {445--458},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_51},
doi = {10.1007/3-540-44669-9\_51},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Brandstadt01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2001,
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2},
doi = {10.1007/3-540-45477-2},
isbn = {3-540-42707-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtL00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of Block Graphs},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {349--366},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00145-6},
doi = {10.1016/S0166-218X(99)00145-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtDLS00,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Van Bang Le and
Thomas Szymczak},
title = {On stable cutsets in graphs},
journal = {Discret. Appl. Math.},
volume = {105},
number = {1-3},
pages = {39--50},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00197-9},
doi = {10.1016/S0166-218X(00)00197-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtDLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtLO00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Stephan Olariu},
title = {Efficiently Recognizing the \emph{P} \({}_{\mbox{4}}\)-Structure of
Trees and of Bipartite Graphs Without Short Cycles},
journal = {Graphs Comb.},
volume = {16},
number = {4},
pages = {381--387},
year = {2000},
url = {https://doi.org/10.1007/s003730070002},
doi = {10.1007/S003730070002},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtLO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrandstadtDK00,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
title = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free
Graphs},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1662--1677},
year = {2000},
url = {https://doi.org/10.1137/S0097539799357775},
doi = {10.1137/S0097539799357775},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrandstadtDK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtL00,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Split-Perfect Graphs: Characterizations and Algorithmic Use},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {71--82},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_8},
doi = {10.1007/3-540-40064-8\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BabelBL99,
author = {Luitpold Babel and
Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Recognizing the P\({}_{\mbox{4}}\)-structure of Bipartite Graphs},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {157--168},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00104-3},
doi = {10.1016/S0166-218X(99)00104-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BabelBL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtL99,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Tree- and Forest-perfect Graphs},
journal = {Discret. Appl. Math.},
volume = {95},
number = {1-3},
pages = {141--162},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00071-2},
doi = {10.1016/S0166-218X(99)00071-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtH99,
author = {Andreas Brandst{\"{a}}dt and
Peter L. Hammer},
title = {On the Stability Number of Claw-free P\({}_{\mbox{5}}\)-free and More
General Graphs},
journal = {Discret. Appl. Math.},
volume = {95},
number = {1-3},
pages = {163--167},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00072-4},
doi = {10.1016/S0166-218X(99)00072-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BrandstadtCD99,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Distance Approximating Trees for Chordal and Dually Chordal Graphs},
journal = {J. Algorithms},
volume = {30},
number = {1},
pages = {166--184},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0962},
doi = {10.1006/JAGM.1998.0962},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BrandstadtCD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DraganNB99,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
title = {Convexity and HHD-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {1},
pages = {119--135},
year = {1999},
url = {https://doi.org/10.1137/S0895480195321718},
doi = {10.1137/S0895480195321718},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DraganNB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDK99,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free
Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {364--376},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_34},
doi = {10.1007/3-540-46784-X\_34},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtCD98,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood
Orderings},
journal = {Discret. Appl. Math.},
volume = {82},
number = {1-3},
pages = {43--77},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(97)00125-X},
doi = {10.1016/S0166-218X(97)00125-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtCD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtLS98,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Thomas Szymczak},
title = {The Complexity of some Problems Related to Graph 3-colorability},
journal = {Discret. Appl. Math.},
volume = {89},
number = {1-3},
pages = {59--73},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00116-4},
doi = {10.1016/S0166-218X(98)00116-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtLS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Brandstadt98,
author = {Andreas Brandst{\"{a}}dt},
title = {Corrigendum},
journal = {Discret. Math.},
volume = {186},
number = {1-3},
pages = {295},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(98)00014-4},
doi = {10.1016/S0012-365X(98)00014-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Brandstadt98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/DraganNB98,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
title = {Powers of hhd-free graphs},
journal = {Int. J. Comput. Math.},
volume = {69},
number = {3-4},
pages = {217--242},
year = {1998},
url = {https://doi.org/10.1080/00207169808804720},
doi = {10.1080/00207169808804720},
timestamp = {Fri, 10 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/DraganNB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrandstadtD98,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan},
title = {A linear-time algorithm for connected r-domination and Steiner tree
on distance-hereditary graphs},
journal = {Networks},
volume = {31},
number = {3},
pages = {177--182},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199805)31:3\&\#60;177::AID-NET4\&\#62;3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0037(199805)31:3\&\#60;177::AID-NET4\&\#62;3.0.CO;2-C},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrandstadtD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtDCV98,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Victor Chepoi and
Vitaly I. Voloshin},
title = {Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {437--455},
year = {1998},
url = {https://doi.org/10.1137/S0895480193253415},
doi = {10.1137/S0895480193253415},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtDCV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtDN97,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
title = {LexBFS-orderings and powers of chordal graphs},
journal = {Discret. Math.},
volume = {171},
number = {1-3},
pages = {27--42},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00070-2},
doi = {10.1016/S0012-365X(96)00070-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtDN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtLS97,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le and
Thomas Szymczak},
title = {Duchet-type theorems for powers of HHD-free graphs},
journal = {Discret. Math.},
volume = {177},
number = {1-3},
pages = {9--16},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00370-6},
doi = {10.1016/S0012-365X(96)00370-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtCD97,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Clique \emph{r}-Domination and Clique \emph{r}-Packing Problems on
Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {109--127},
year = {1997},
url = {https://doi.org/10.1137/S0895480194267853},
doi = {10.1137/S0895480194267853},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtCD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtDN97,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
title = {Homogeneously Orderable Graphs},
journal = {Theor. Comput. Sci.},
volume = {172},
number = {1-2},
pages = {209--232},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00091-6},
doi = {10.1016/S0304-3975(96)00091-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtDN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BrandstadtCD97,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Distance Approximating Trees for Chordal and Dually Chordal Graphs
(Extended Abstract)},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {78--91},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_7},
doi = {10.1007/3-540-63397-9\_7},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BrandstadtCD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtV96,
author = {Andreas Brandst{\"{a}}dt and
Heinz{-}J{\"{u}}rgen Voss},
title = {Short Disjoint Cycles in Graphs with Degree Constraints},
journal = {Discret. Appl. Math.},
volume = {64},
number = {3},
pages = {197--205},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(94)00133-X},
doi = {10.1016/0166-218X(94)00133-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Brandstadt96,
author = {Andreas Brandst{\"{a}}dt},
title = {Partitions of graphs into one or two independent sets and cliques},
journal = {Discret. Math.},
volume = {152},
number = {1-3},
pages = {47--54},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00296-U},
doi = {10.1016/0012-365X(94)00296-U},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Brandstadt96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtCD96,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Perfect elimination orderings of chordal powers of graphs},
journal = {Discret. Math.},
volume = {158},
number = {1-3},
pages = {273--278},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00081-7},
doi = {10.1016/0012-365X(95)00081-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtCD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DraganB96,
author = {Feodor F. Dragan and
Andreas Brandst{\"{a}}dt},
title = {r-Dominating cliques in graphs with hypertree structure},
journal = {Discret. Math.},
volume = {162},
number = {1-3},
pages = {93--108},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00277-4},
doi = {10.1016/0012-365X(95)00277-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DraganB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganNB96,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
editor = {Fabrizio d'Amore and
Paolo Giulio Franciosa and
Alberto Marchetti{-}Spaccamela},
title = {LexBFS-Orderings and Power of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop,
{WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1197},
pages = {166--180},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62559-3\_15},
doi = {10.1007/3-540-62559-3\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganNB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDN95,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
editor = {Manfred Nagl},
title = {Homogeneously Orderable Graphs and the Steiner Tree Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop,
{WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1017},
pages = {381--395},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60618-1\_90},
doi = {10.1007/3-540-60618-1\_90},
timestamp = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0073241,
author = {Andreas Brandst{\"{a}}dt},
title = {Graphen und Algorithmen},
series = {Leitf{\"{a}}den und Monographien der Informatik},
publisher = {Teubner},
year = {1994},
isbn = {978-3-519-02131-5},
timestamp = {Fri, 08 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0073241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DraganB94,
author = {Feodor F. Dragan and
Andreas Brandst{\"{a}}dt},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Dominating Cliques in Graphs with Hypertree Structures},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {735--746},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_186},
doi = {10.1007/3-540-57785-8\_186},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DraganB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtCD94,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood
Orderings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {65--80},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_38},
doi = {10.1007/3-540-59071-4\_38},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtCD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtV93,
author = {Andreas Brandst{\"{a}}dt and
Heinz{-}J{\"{u}}rgen Voss},
editor = {Jan van Leeuwen},
title = {Short Disjoint Cycles in Graphs with Degree Constraints},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {125--131},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_46},
doi = {10.1007/3-540-57899-4\_46},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDCV93,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Victor Chepoi and
Vitaly I. Voloshin},
editor = {Jan van Leeuwen},
title = {Dually Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {237--251},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_56},
doi = {10.1007/3-540-57899-4\_56},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDCV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Brandstadt92,
author = {Andreas Brandst{\"{a}}dt},
editor = {Ernst W. Mayr},
title = {On Improved Time Bounds for Permutation Graph Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {1--10},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_30},
doi = {10.1007/3-540-56402-0\_30},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Brandstadt92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brandstadt91,
author = {Andreas Brandst{\"{a}}dt},
title = {Classes of bipartite graphs related to chordal graphs},
journal = {Discret. Appl. Math.},
volume = {32},
number = {1},
pages = {51--60},
year = {1991},
url = {https://doi.org/10.1016/0166-218X(91)90023-P},
doi = {10.1016/0166-218X(91)90023-P},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Brandstadt91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Brandstadt91,
author = {Andreas Brandst{\"{a}}dt},
editor = {Gunther Schmidt and
Rudolf Berghammer},
title = {Short Disjoint Cycles in Cubic Bridgeless Graphs},
booktitle = {17th International Workshop, {WG} '91, Fischbachau, Germany, June
17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {570},
pages = {239--249},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-55121-2\_25},
doi = {10.1007/3-540-55121-2\_25},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/Brandstadt91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Branstadt89,
author = {Andreas Brandst{\"{a}}dt},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {The Jump Number Problem for Biconvex Graphs and Rectangle Covers of
Rectangular Regions},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {68--77},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_7},
doi = {10.1007/3-540-51498-8\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Branstadt89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SpinradBS87,
author = {Jeremy P. Spinrad and
Andreas Brandst{\"{a}}dt and
Lorna Stewart},
title = {Bipartite permutation graphs},
journal = {Discret. Appl. Math.},
volume = {18},
number = {3},
pages = {279--292},
year = {1987},
url = {https://doi.org/10.1016/S0166-218X(87)80003-3},
doi = {10.1016/S0166-218X(87)80003-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SpinradBS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Brandstadt87,
author = {Andreas Brandst{\"{a}}dt},
title = {The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit,
Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs},
journal = {J. Inf. Process. Cybern.},
volume = {23},
number = {8/9},
pages = {471--477},
year = {1987},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Brandstadt87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandenburgBW87,
author = {Franz{-}Josef Brandenburg and
Andreas Brandst{\"{a}}dt and
Klaus W. Wagner},
title = {Uniform Simulations of Nondeterministic Real Time Multitape Turing
Machines},
journal = {Math. Syst. Theory},
volume = {19},
number = {4},
pages = {277--299},
year = {1987},
url = {https://doi.org/10.1007/BF01704917},
doi = {10.1007/BF01704917},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandenburgBW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerB87,
author = {Haiko M{\"{u}}ller and
Andreas Brandst{\"{a}}dt},
title = {The NP-Completeness of Steiner Tree and Dominating Set for Chordal
Bipartite Graphs},
journal = {Theor. Comput. Sci.},
volume = {53},
pages = {257--265},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90067-3},
doi = {10.1016/0304-3975(87)90067-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MullerB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtK87,
author = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch},
title = {On Domination Problems for Permutation and Other Graphs},
journal = {Theor. Comput. Sci.},
volume = {54},
pages = {181--198},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90128-9},
doi = {10.1016/0304-3975(87)90128-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/BrandstadtK86,
author = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch},
title = {On Partitions of Permutations into Increasing and Decreasing Subsequences},
journal = {J. Inf. Process. Cybern.},
volume = {22},
number = {5/6},
pages = {263--273},
year = {1986},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/BrandstadtK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrandstadtK85,
author = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch},
editor = {Lothar Budach},
title = {On the restriction of some NP-complete graph problems to permutation
graphs},
booktitle = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September
9-13, 1985},
series = {Lecture Notes in Computer Science},
volume = {199},
pages = {53--62},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0028791},
doi = {10.1007/BFB0028791},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrandstadtK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Brandstadt83,
author = {Andreas Brandst{\"{a}}dt},
title = {Zu Raum- und Zeitkompliziertheitsklassen auf nichtdeterministischen
Turingakzeptoren},
school = {University of Jena, Germany},
year = {1983},
url = {https://d-nb.info/840146396},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Brandstadt83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Brandstadt83,
author = {Andreas Brandst{\"{a}}dt},
title = {Space Classes, Intersection of Languages and Bounded Erasing Homomorphisms},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {17},
number = {2},
pages = {121--130},
year = {1983},
url = {https://doi.org/10.1051/ita/1983170201211},
doi = {10.1051/ITA/1983170201211},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Brandstadt83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrandstadtW83,
author = {Andreas Brandst{\"{a}}dt and
Klaus W. Wagner},
editor = {Marek Karpinski},
title = {Reversal-Bounded and Visit-Bounded Realtime Computations},
booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International
FCT-Conference, Borgholm, Sweden, August 21-27, 1983},
series = {Lecture Notes in Computer Science},
volume = {158},
pages = {26--39},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-12689-9\_91},
doi = {10.1007/3-540-12689-9\_91},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrandstadtW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Brandstadt81,
author = {Andreas Brandst{\"{a}}dt},
title = {Closure Properties of Certain Families of Formal Languages with Respect
to a Generalization of Cyclic Closure},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {15},
number = {3},
pages = {233--252},
year = {1981},
url = {https://doi.org/10.1051/ita/1981150302331},
doi = {10.1051/ITA/1981150302331},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Brandstadt81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Brandstadt81,
author = {Andreas Brandst{\"{a}}dt},
editor = {Jozef Gruska and
Michal Chytil},
title = {Pushdown Automata with Restricted Use of Storage Symbols},
booktitle = {Mathematical Foundations of Computer Science 1981, Strbske Pleso,
Czechoslovakia, August 31 - September 4, 1981, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {118},
pages = {234--241},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/3-540-10856-4\_89},
doi = {10.1007/3-540-10856-4\_89},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Brandstadt81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WechsungB79,
author = {Gerd Wechsung and
Andreas Brandst{\"{a}}dt},
title = {A Relation Between Space, Return and Dual Return Complexities},
journal = {Theor. Comput. Sci.},
volume = {9},
pages = {127--140},
year = {1979},
url = {https://doi.org/10.1016/0304-3975(79)90010-0},
doi = {10.1016/0304-3975(79)90010-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WechsungB79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Brandstadt78,
author = {Andreas Brandst{\"{a}}dt},
title = {On a Family of Complexity Measures on Turing Machines, defined by
Predicates},
journal = {J. Inf. Process. Cybern.},
volume = {14},
number = {7/8},
pages = {331--339},
year = {1978},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Brandstadt78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/BrandstadtS77,
author = {Andreas Brandst{\"{a}}dt and
Dietrich Saalfeld},
title = {Eine Hierarchie beschr{\"{a}}nkter R{\"{u}}ckkehrberechnungen
auf on-line Turingmaschinen},
journal = {J. Inf. Process. Cybern.},
volume = {13},
number = {11},
pages = {571--583},
year = {1977},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/BrandstadtS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-11-13 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
