Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Oliver Schaudt
@article{DBLP:journals/tcs/BohnleinSS23,
author = {Toni B{\"{o}}hnlein and
Oliver Schaudt and
Joachim Schauer},
title = {Stackelberg packing games},
journal = {Theor. Comput. Sci.},
volume = {943},
pages = {16--35},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.12.006},
doi = {10.1016/J.TCS.2022.12.006},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BohnleinSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AdjiashviliHMS22,
author = {David Adjiashvili and
Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
editor = {Artur Czumaj and
Qin Xin},
title = {Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.5},
doi = {10.4230/LIPICS.SWAT.2022.5},
timestamp = {Thu, 23 Jun 2022 13:34:22 +0200},
biburl = {https://dblp.org/rec/conf/swat/AdjiashviliHMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/ChudnovskyMPSA22,
author = {Maria Chudnovsky and
Neeldhara Misra and
Dani{\"{e}}l Paulusma and
Oliver Schaudt and
Akanksha Agrawal},
title = {Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl
Seminar 22481)},
journal = {Dagstuhl Reports},
volume = {12},
number = {11},
pages = {109--123},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.11.109},
doi = {10.4230/DAGREP.12.11.109},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/ChudnovskyMPSA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BohnleinKS21,
author = {Toni B{\"{o}}hnlein and
Stefan Kratsch and
Oliver Schaudt},
title = {Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial
setting},
journal = {Math. Program.},
volume = {187},
number = {1},
pages = {653--695},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01495-0},
doi = {10.1007/S10107-020-01495-0},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BohnleinKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BahKS21,
author = {Bubacarr Bah and
Jannis Kurtz and
Oliver Schaudt},
title = {Discrete optimization methods for group model selection in compressed
sensing},
journal = {Math. Program.},
volume = {190},
number = {1},
pages = {171--220},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01529-7},
doi = {10.1007/S10107-020-01529-7},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BahKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BruhnJS21,
author = {Henning Bruhn and
Felix Joos and
Oliver Schaudt},
title = {Erd{\"{o}}s-P{\'{o}}sa Property for Labeled Minors: 2-Connected
Minors},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {893--914},
year = {2021},
url = {https://doi.org/10.1137/19M1289340},
doi = {10.1137/19M1289340},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BruhnJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HommelsheimMS21,
author = {Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
title = {How to Secure Matchings against Edge Failures},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {2265--2292},
year = {2021},
url = {https://doi.org/10.1137/20M1336229},
doi = {10.1137/20M1336229},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HommelsheimMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bonomo-Braberman21,
author = {Flavia Bonomo{-}Braberman and
Maria Chudnovsky and
Jan Goedgebeur and
Peter Maceli and
Oliver Schaudt and
Maya Stein and
Mingxian Zhong},
title = {Better 3-coloring algorithms: Excluding a triangle and a seven vertex
path},
journal = {Theor. Comput. Sci.},
volume = {850},
pages = {98--115},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.10.032},
doi = {10.1016/J.TCS.2020.10.032},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Bonomo-Braberman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PeisSRRSV20,
author = {Britta Peis and
Oliver Schaudt and
Heiko R{\"{o}}glin and
Bert Randerath and
Rainer Schrader and
Frank Vallentin},
title = {Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization {(CTW} 2017)},
journal = {Discret. Appl. Math.},
volume = {272},
pages = {1},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.12.009},
doi = {10.1016/J.DAM.2019.12.009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PeisSRRSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChudnovskyGSZ20,
author = {Maria Chudnovsky and
Jan Goedgebeur and
Oliver Schaudt and
Mingxian Zhong},
title = {Obstructions for three-coloring graphs without induced paths on six
vertices},
journal = {J. Comb. Theory, Ser. {B}},
volume = {140},
pages = {45--83},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2019.04.006},
doi = {10.1016/J.JCTB.2019.04.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ChudnovskyGSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FioriniJS20,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
title = {Improved approximation algorithms for hitting 3-vertex paths},
journal = {Math. Program.},
volume = {182},
number = {1},
pages = {355--367},
year = {2020},
url = {https://doi.org/10.1007/s10107-019-01395-y},
doi = {10.1007/S10107-019-01395-Y},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FioriniJS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChudnovskyGSZ20,
author = {Maria Chudnovsky and
Jan Goedgebeur and
Oliver Schaudt and
Mingxian Zhong},
title = {Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {431--469},
year = {2020},
url = {https://doi.org/10.1137/18M1210290},
doi = {10.1137/18M1210290},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/ChudnovskyGSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BohnleinS20,
author = {Toni B{\"{o}}hnlein and
Oliver Schaudt},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {On the Complexity of Stackelberg Matroid Pricing Problems},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {83--96},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_7},
doi = {10.1007/978-3-030-48966-3\_7},
timestamp = {Fri, 29 May 2020 16:43:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BohnleinS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-05382,
author = {David Adjiashvili and
Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
title = {Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults},
journal = {CoRR},
volume = {abs/2009.05382},
year = {2020},
url = {https://arxiv.org/abs/2009.05382},
eprinttype = {arXiv},
eprint = {2009.05382},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-05382.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChudnovskySSSZ19,
author = {Maria Chudnovsky and
Oliver Schaudt and
Sophie Spirkl and
Maya Stein and
Mingxian Zhong},
title = {Approximately Coloring Graphs Without Long Induced Paths},
journal = {Algorithmica},
volume = {81},
number = {8},
pages = {3186--3199},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00577-6},
doi = {10.1007/S00453-019-00577-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChudnovskySSSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SchaudtS19,
author = {Oliver Schaudt and
Maya Stein},
title = {Partitioning two?coloured complete multipartite graphs into monochromatic
paths and cycles},
journal = {J. Graph Theory},
volume = {91},
number = {2},
pages = {122--147},
year = {2019},
url = {https://doi.org/10.1002/jgt.22424},
doi = {10.1002/JGT.22424},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SchaudtS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChudnovskyLSSTV19,
author = {Maria Chudnovsky and
Chun{-}Hung Liu and
Oliver Schaudt and
Sophie Spirkl and
Nicolas Trotignon and
Kristina Vuskovic},
title = {Triangle-free graphs that do not contain an induced subdivision of
{K4} are 3-colorable},
journal = {J. Graph Theory},
volume = {92},
number = {2},
pages = {67--95},
year = {2019},
url = {https://doi.org/10.1002/jgt.22441},
doi = {10.1002/JGT.22441},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChudnovskyLSSTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HommelsheimMS19,
author = {Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {How to Secure Matchings Against Edge Failures},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.38},
doi = {10.4230/LIPICS.STACS.2019.38},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HommelsheimMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BohnleinSS19,
author = {Toni B{\"{o}}hnlein and
Oliver Schaudt and
Joachim Schauer},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Stackelberg Packing Games},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {239--253},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_18},
doi = {10.1007/978-3-030-24766-9\_18},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BohnleinSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-01542,
author = {Bubacarr Bah and
Jannis Kurtz and
Oliver Schaudt},
title = {Discrete Optimization Methods for Group Model Selection in Compressed
Sensing},
journal = {CoRR},
volume = {abs/1904.01542},
year = {2019},
url = {http://arxiv.org/abs/1904.01542},
eprinttype = {arXiv},
eprint = {1904.01542},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-01542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/ChudnovskyPS19,
author = {Maria Chudnovsky and
Dani{\"{e}}l Paulusma and
Oliver Schaudt},
title = {Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)},
journal = {Dagstuhl Reports},
volume = {9},
number = {6},
pages = {125--142},
year = {2019},
url = {https://doi.org/10.4230/DagRep.9.6.125},
doi = {10.4230/DAGREP.9.6.125},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/ChudnovskyPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BonomoCMSSZ18,
author = {Flavia Bonomo and
Maria Chudnovsky and
Peter Maceli and
Oliver Schaudt and
Maya Stein and
Mingxian Zhong},
title = {Three-Coloring and List Three-Coloring of Graphs Without Induced Paths
on Seven Vertices},
journal = {Comb.},
volume = {38},
number = {4},
pages = {779--801},
year = {2018},
url = {https://doi.org/10.1007/s00493-017-3553-8},
doi = {10.1007/S00493-017-3553-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BonomoCMSSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GoedgebeurS18,
author = {Jan Goedgebeur and
Oliver Schaudt},
title = {Exhaustive generation of \emph{k}-critical H-free graphs},
journal = {J. Graph Theory},
volume = {87},
number = {2},
pages = {188--207},
year = {2018},
url = {https://doi.org/10.1002/jgt.22151},
doi = {10.1002/JGT.22151},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GoedgebeurS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BruhnJS18,
author = {Henning Bruhn and
Felix Joos and
Oliver Schaudt},
title = {Long cycles through prescribed vertices have the Erd{\H{o}}s-P{\'{o}}sa
property},
journal = {J. Graph Theory},
volume = {87},
number = {3},
pages = {275--284},
year = {2018},
url = {https://doi.org/10.1002/jgt.22156},
doi = {10.1002/JGT.22156},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BruhnJS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-01299,
author = {Viktor Bindewald and
Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
title = {How to Secure Matchings Against Edge Failures},
journal = {CoRR},
volume = {abs/1805.01299},
year = {2018},
url = {http://arxiv.org/abs/1805.01299},
eprinttype = {arXiv},
eprint = {1805.01299},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-01299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10370,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
title = {Improved approximation algorithms for hitting 3-vertex paths},
journal = {CoRR},
volume = {abs/1808.10370},
year = {2018},
url = {http://arxiv.org/abs/1808.10370},
eprinttype = {arXiv},
eprint = {1808.10370},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10370.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WeilS17,
author = {Vera Weil and
Oliver Schaudt},
title = {On bounding the difference between the maximum degree and the chromatic
number by a constant},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {228--234},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.11.018},
doi = {10.1016/J.DAM.2016.11.018},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WeilS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BruhnS17,
author = {Henning Bruhn and
Oliver Schaudt},
title = {The union-closed sets conjecture almost holds for almost all random
bipartite graphs},
journal = {Eur. J. Comb.},
volume = {59},
pages = {129--149},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2016.06.006},
doi = {10.1016/J.EJC.2016.06.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BruhnS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LangSS17,
author = {Richard Lang and
Oliver Schaudt and
Maya Stein},
title = {Almost Partitioning a 3-Edge-Colored K\({}_{\mbox{n, n}}\) into Five
Monochromatic Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {1374--1402},
year = {2017},
url = {https://doi.org/10.1137/15M104222X},
doi = {10.1137/15M104222X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LangSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BohnleinKS17,
author = {Toni B{\"{o}}hnlein and
Stefan Kratsch and
Oliver Schaudt},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial
Setting},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.46},
doi = {10.4230/LIPICS.ICALP.2017.46},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BohnleinKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChudnovskySSSZ17,
author = {Maria Chudnovsky and
Oliver Schaudt and
Sophie Spirkl and
Maya Stein and
Mingxian Zhong},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Approximately Coloring Graphs Without Long Induced Paths},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {193--205},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_15},
doi = {10.1007/978-3-319-68705-6\_15},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChudnovskySSSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/SchaudtS17,
author = {Oliver Schaudt and
Fabian Senger},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {The Parameterized Complexity of the Equidomination Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {412--424},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_31},
doi = {10.1007/978-3-319-68705-6\_31},
timestamp = {Thu, 02 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/SchaudtS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChudnovskyGSZ17,
author = {Maria Chudnovsky and
Jan Goedgebeur and
Oliver Schaudt and
Mingxian Zhong},
title = {Obstructions for three-coloring and list three-coloring H-free graphs},
journal = {CoRR},
volume = {abs/1703.05684},
year = {2017},
url = {http://arxiv.org/abs/1703.05684},
eprinttype = {arXiv},
eprint = {1703.05684},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChudnovskyGSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchaudtS17,
author = {Oliver Schaudt and
Fabian Senger},
title = {The Parameterized Complexity of the Equidomination Problem},
journal = {CoRR},
volume = {abs/1705.05599},
year = {2017},
url = {http://arxiv.org/abs/1705.05599},
eprinttype = {arXiv},
eprint = {1705.05599},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SchaudtS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06706,
author = {Henning Bruhn and
Oliver Schaudt},
title = {Fast Algorithms for Delta-Separated Sparsity Projection},
journal = {CoRR},
volume = {abs/1712.06706},
year = {2017},
url = {http://arxiv.org/abs/1712.06706},
eprinttype = {arXiv},
eprint = {1712.06706},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06706.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BruhnCJS16,
author = {Henning Bruhn and
Morgan Chopin and
Felix Joos and
Oliver Schaudt},
title = {Structural Parameterizations for Boxicity},
journal = {Algorithmica},
volume = {74},
number = {4},
pages = {1453--1472},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0011-0},
doi = {10.1007/S00453-015-0011-0},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BruhnCJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CambyS16,
author = {Eglantine Camby and
Oliver Schaudt},
title = {A New Characterization of P\({}_{\mbox{k}}\)-Free Graphs},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {205--217},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9989-6},
doi = {10.1007/S00453-015-9989-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CambyS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BruhnS16,
author = {Henning Bruhn and
Oliver Schaudt},
title = {Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {2},
pages = {832--855},
year = {2016},
url = {https://doi.org/10.1137/151006111},
doi = {10.1137/151006111},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BruhnS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeOS16,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {A unified approach to recognize squares of split graphs},
journal = {Theor. Comput. Sci.},
volume = {648},
pages = {26--33},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.037},
doi = {10.1016/J.TCS.2016.07.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BaumeisterBRSS16,
author = {Dorothea Baumeister and
Toni B{\"{o}}hnlein and
Lisa Rey and
Oliver Schaudt and
Ann{-}Kathrin Selker},
editor = {Gal A. Kaminka and
Maria Fox and
Paolo Bouquet and
Eyke H{\"{u}}llermeier and
Virginia Dignum and
Frank Dignum and
Frank van Harmelen},
title = {Minisum and Minimax Committee Election Rules for General Preference
Types},
booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
29 August-2 September 2016, The Hague, The Netherlands - Including
Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {285},
pages = {1656--1657},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-1656},
doi = {10.3233/978-1-61499-672-9-1656},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/BaumeisterBRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FioriniJS16,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Oliver Schaudt},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Improved Approximation Algorithms for Hitting 3-Vertex Paths},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {238--249},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_20},
doi = {10.1007/978-3-319-33461-5\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FioriniJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChudnovskyGSZ16,
author = {Maria Chudnovsky and
Jan Goedgebeur and
Oliver Schaudt and
Mingxian Zhong},
editor = {Robert Krauthgamer},
title = {Obstructions for three-coloring graphs with one forbidden induced
subgraph},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1774--1783},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch123},
doi = {10.1137/1.9781611974331.CH123},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChudnovskyGSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GoedgebeurS16,
author = {Jan Goedgebeur and
Oliver Schaudt},
editor = {Pinar Heggernes},
title = {Exhaustive Generation of k-Critical {\(\mathscr{H}\)}-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 = {109--120},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_10},
doi = {10.1007/978-3-662-53536-3\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GoedgebeurS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChudnovskySSSZ16,
author = {Maria Chudnovsky and
Oliver Schaudt and
Sophie Spirkl and
Maya Stein and
Mingxian Zhong},
title = {Approximately coloring graphs without long induced paths},
journal = {CoRR},
volume = {abs/1606.02967},
year = {2016},
url = {http://arxiv.org/abs/1606.02967},
eprinttype = {arXiv},
eprint = {1606.02967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChudnovskySSSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonomoSSV15,
author = {Flavia Bonomo and
Oliver Schaudt and
Maya Stein and
Mario Valencia{-}Pabon},
title = {b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable
on Tree-Cographs},
journal = {Algorithmica},
volume = {73},
number = {2},
pages = {289--305},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9921-5},
doi = {10.1007/S00453-014-9921-5},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonomoSSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BruhnCST15,
author = {Henning Bruhn and
Pierre Charbit and
Oliver Schaudt and
Jan Arne Telle},
title = {The graph formulation of the union-closed sets conjecture},
journal = {Eur. J. Comb.},
volume = {43},
pages = {210--219},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2014.08.030},
doi = {10.1016/J.EJC.2014.08.030},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BruhnCST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LangSS15,
author = {Richard Lang and
Oliver Schaudt and
Maya Stein},
title = {Partitioning 3-edge-coloured complete bipartite graphs into monochromatic
cycles},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {787--794},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.106},
doi = {10.1016/J.ENDM.2015.06.106},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LangSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SchaudtS15,
author = {Oliver Schaudt and
Maya Stein},
title = {Partitioning two-coloured complete multipartite graphs into monochromatic
paths and cycles},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {313--318},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.052},
doi = {10.1016/J.ENDM.2015.07.052},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/SchaudtS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SchaudtW15,
author = {Oliver Schaudt and
Vera Weil},
title = {On Bounding the Difference of the Maximum Degree and the Clique Number},
journal = {Graphs Comb.},
volume = {31},
number = {5},
pages = {1689--1702},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1468-3},
doi = {10.1007/S00373-014-1468-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SchaudtW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BruhnS15,
author = {Henning Bruhn and
Oliver Schaudt},
title = {The Journey of the Union-Closed Sets Conjecture},
journal = {Graphs Comb.},
volume = {31},
number = {6},
pages = {2043--2074},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1515-0},
doi = {10.1007/S00373-014-1515-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BruhnS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schaudt15,
author = {Oliver Schaudt},
title = {On disjoint maximal independent sets in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {23--27},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.010},
doi = {10.1016/J.IPL.2014.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schaudt15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeOS15,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free
split graphs},
journal = {Theor. Comput. Sci.},
volume = {602},
pages = {39--49},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.07.060},
doi = {10.1016/J.TCS.2015.07.060},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/0002MS15,
author = {Eun Jung Kim and
Martin Milanic and
Oliver Schaudt},
editor = {Ernst W. Mayr},
title = {Recognizing k-equistable Graphs in {FPT} 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 = {487--498},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_34},
doi = {10.1007/978-3-662-53174-7\_34},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/0002MS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002MS15,
author = {Eun Jung Kim and
Martin Milanic and
Oliver Schaudt},
title = {Recognizing k-equistable graphs in {FPT} time},
journal = {CoRR},
volume = {abs/1503.01098},
year = {2015},
url = {http://arxiv.org/abs/1503.01098},
eprinttype = {arXiv},
eprint = {1503.01098},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0002MS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChudnovskyGSZ15,
author = {Maria Chudnovsky and
Jan Goedgebeur and
Oliver Schaudt and
Mingxian Zhong},
title = {Obstructions for three-coloring graphs without induced paths on six
vertices},
journal = {CoRR},
volume = {abs/1504.06979},
year = {2015},
url = {http://arxiv.org/abs/1504.06979},
eprinttype = {arXiv},
eprint = {1504.06979},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChudnovskyGSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoedgebeurS15,
author = {Jan Goedgebeur and
Oliver Schaudt},
title = {Exhaustive generation of {\textdollar}k{\textdollar}-critical {\textdollar}{\textbackslash}mathcal
H{\textdollar}-free graphs},
journal = {CoRR},
volume = {abs/1506.03647},
year = {2015},
url = {http://arxiv.org/abs/1506.03647},
eprinttype = {arXiv},
eprint = {1506.03647},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoedgebeurS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchaudtW15,
author = {Oliver Schaudt and
Vera Weil},
title = {On bounding the difference between the maximum degree and the chromatic
number by a constant},
journal = {CoRR},
volume = {abs/1511.08403},
year = {2015},
url = {http://arxiv.org/abs/1511.08403},
eprinttype = {arXiv},
eprint = {1511.08403},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SchaudtW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MilanicOS14,
author = {Martin Milanic and
Andrea Oversberg and
Oliver Schaudt},
title = {A characterization of line graphs that are squares of graphs},
journal = {Discret. Appl. Math.},
volume = {173},
pages = {83--91},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.03.021},
doi = {10.1016/J.DAM.2014.03.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MilanicOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CambyS14,
author = {Eglantine Camby and
Oliver Schaudt},
title = {The price of connectivity for dominating set: Upper bounds and complexity},
journal = {Discret. Appl. Math.},
volume = {177},
pages = {53--59},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.029},
doi = {10.1016/J.DAM.2014.05.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CambyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CambyCFS14,
author = {Eglantine Camby and
Jean Cardinal and
Samuel Fiorini and
Oliver Schaudt},
title = {The Price of Connectivity for Vertex Cover},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {16},
number = {1},
pages = {207--224},
year = {2014},
url = {https://doi.org/10.46298/dmtcs.1262},
doi = {10.46298/DMTCS.1262},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CambyCFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BruhnS14,
author = {Henning Bruhn and
Oliver Schaudt},
editor = {Jon Lee and
Jens Vygen},
title = {Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {404--415},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_34},
doi = {10.1007/978-3-319-07557-0\_34},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BruhnS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/BonomoSSV14,
author = {Flavia Bonomo and
Oliver Schaudt and
Maya Stein and
Mario Valencia{-}Pabon},
editor = {Pierre Fouilhoux and
Luis Eduardo Neves Gouveia and
Ali Ridha Mahjoub and
Vangelis Th. Paschos},
title = {b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable
on Tree-Cographs},
booktitle = {Combinatorial Optimization - Third International Symposium, {ISCO}
2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8596},
pages = {100--111},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09174-7\_9},
doi = {10.1007/978-3-319-09174-7\_9},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/BonomoSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BruhnCJS14,
author = {Henning Bruhn and
Morgan Chopin and
Felix Joos and
Oliver Schaudt},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Structural Parameterizations for Boxicity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {117--128},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_10},
doi = {10.1007/978-3-319-12340-0\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BruhnCJS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CambyS14,
author = {Eglantine Camby and
Oliver Schaudt},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {A New Characterization of P\({}_{\mbox{k}}\)-free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {129--138},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_11},
doi = {10.1007/978-3-319-12340-0\_11},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CambyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeOS14,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free
Split Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {360--371},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_30},
doi = {10.1007/978-3-319-12340-0\_30},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeOS14,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free
split graphs},
journal = {CoRR},
volume = {abs/1402.0024},
year = {2014},
url = {http://arxiv.org/abs/1402.0024},
eprinttype = {arXiv},
eprint = {1402.0024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CambyS14,
author = {Eglantine Camby and
Oliver Schaudt},
title = {A new characterization of {\textdollar}P{\_}k{\textdollar}-free graphs},
journal = {CoRR},
volume = {abs/1402.7213},
year = {2014},
url = {http://arxiv.org/abs/1402.7213},
eprinttype = {arXiv},
eprint = {1402.7213},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CambyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchaudtS14,
author = {Oliver Schaudt and
Maya Stein},
title = {Partitioning two-coloured complete multipartite graphs into monochromatic
paths},
journal = {CoRR},
volume = {abs/1407.5083},
year = {2014},
url = {http://arxiv.org/abs/1407.5083},
eprinttype = {arXiv},
eprint = {1407.5083},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SchaudtS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonomoSS14,
author = {Flavia Bonomo and
Oliver Schaudt and
Maya Jakobine Stein},
title = {3-Colouring graphs without triangles or induced paths on seven vertices},
journal = {CoRR},
volume = {abs/1410.0040},
year = {2014},
url = {http://arxiv.org/abs/1410.0040},
eprinttype = {arXiv},
eprint = {1410.0040},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonomoSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeOS14a,
author = {Van Bang Le and
Andrea Oversberg and
Oliver Schaudt},
title = {Squares of {\textdollar}3{\textdollar}-sun-free split graphs},
journal = {CoRR},
volume = {abs/1410.2075},
year = {2014},
url = {http://arxiv.org/abs/1410.2075},
eprinttype = {arXiv},
eprint = {1410.2075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeOS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MilanicS13,
author = {Martin Milanic and
Oliver Schaudt},
title = {Computing square roots of trivially perfect and threshold graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1538--1545},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.027},
doi = {10.1016/J.DAM.2012.12.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MilanicS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schaudt13,
author = {Oliver Schaudt},
title = {On dominating sets whose induced subgraphs have a bounded diameter},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2647--2652},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.030},
doi = {10.1016/J.DAM.2013.05.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schaudt13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SchaudtSW13,
author = {Oliver Schaudt and
Rainer Schrader and
Vera Weil},
title = {On the separability of graphs},
journal = {Discret. Math.},
volume = {313},
number = {6},
pages = {809--820},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.12.023},
doi = {10.1016/J.DISC.2012.12.023},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SchaudtSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CambyS13,
author = {Eglantine Camby and
Oliver Schaudt},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {Connected dominating set in graphs without long paths and cycles},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {39--42},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CambyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2478,
author = {Eglantine Camby and
Jean Cardinal and
Samuel Fiorini and
Oliver Schaudt},
title = {The Price of Connectivity for Vertex Cover},
journal = {CoRR},
volume = {abs/1303.2478},
year = {2013},
url = {http://arxiv.org/abs/1303.2478},
eprinttype = {arXiv},
eprint = {1303.2478},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2868,
author = {Eglantine Camby and
Oliver Schaudt},
title = {A Note on Connected Dominating Set in Graphs Without Long Paths And
Cycles},
journal = {CoRR},
volume = {abs/1303.2868},
year = {2013},
url = {http://arxiv.org/abs/1303.2868},
eprinttype = {arXiv},
eprint = {1303.2868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BruhnS13,
author = {Henning Bruhn and
Oliver Schaudt},
title = {The journey of the union-closed sets conjecture},
journal = {CoRR},
volume = {abs/1309.3297},
year = {2013},
url = {http://arxiv.org/abs/1309.3297},
eprinttype = {arXiv},
eprint = {1309.3297},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BruhnS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BruhnS13a,
author = {Henning Bruhn and
Oliver Schaudt},
title = {Claw-free t-perfect graphs can be recognised in polynomial time},
journal = {CoRR},
volume = {abs/1310.8186},
year = {2013},
url = {http://arxiv.org/abs/1310.8186},
eprinttype = {arXiv},
eprint = {1310.8186},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BruhnS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonomoSSV13,
author = {Flavia Bonomo and
Oliver Schaudt and
Maya Stein and
Mario Valencia{-}Pabon},
title = {b-coloring is NP-hard on co-bipartite graphs and polytime solvable
on tree-cographs},
journal = {CoRR},
volume = {abs/1310.8313},
year = {2013},
url = {http://arxiv.org/abs/1310.8313},
eprinttype = {arXiv},
eprint = {1310.8313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonomoSSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schaudt12,
author = {Oliver Schaudt},
title = {On graphs for which the connected domination number is at most the
total domination number},
journal = {Discret. Appl. Math.},
volume = {160},
number = {7-8},
pages = {1281--1284},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.12.025},
doi = {10.1016/J.DAM.2011.12.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schaudt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schaudt12a,
author = {Oliver Schaudt},
title = {A note on connected dominating sets of distance-hereditary graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {9},
pages = {1394--1398},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.02.003},
doi = {10.1016/J.DAM.2012.02.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schaudt12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Schaudt12,
author = {Oliver Schaudt},
title = {Total domination versus paired domination},
journal = {Discuss. Math. Graph Theory},
volume = {32},
number = {3},
pages = {435--447},
year = {2012},
url = {https://doi.org/10.7151/dmgt.1614},
doi = {10.7151/DMGT.1614},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Schaudt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Schaudt12a,
author = {Oliver Schaudt},
title = {Paired- and induced paired-domination in (\emph{E, net})-free graphs},
journal = {Discuss. Math. Graph Theory},
volume = {32},
number = {3},
pages = {473--485},
year = {2012},
url = {https://doi.org/10.7151/dmgt.1617},
doi = {10.7151/DMGT.1617},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Schaudt12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchaudtS12,
author = {Oliver Schaudt and
Rainer Schrader},
title = {The complexity of connected dominating sets and total dominating sets
with specified induced subgraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {953--957},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.09.002},
doi = {10.1016/J.IPL.2012.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchaudtS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Schaudt12,
author = {Oliver Schaudt},
title = {On weighted efficient total domination},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {61--69},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.06.001},
doi = {10.1016/J.JDA.2011.06.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Schaudt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Schaudt12a,
author = {Oliver Schaudt},
title = {Efficient total domination in digraphs},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {32--42},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.02.003},
doi = {10.1016/J.JDA.2012.02.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Schaudt12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CambyCFS12,
author = {Eglantine Camby and
Jean Cardinal and
Samuel Fiorini and
Oliver Schaudt},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect
and Critical Graphs},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {56--59},
year = {2012},
timestamp = {Thu, 16 May 2013 15:41:40 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CambyCFS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/SchaudtSW12,
author = {Oliver Schaudt and
Rainer Schrader and
Vera Weil},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {On the Separability of Graphs},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {232--236},
year = {2012},
timestamp = {Thu, 16 May 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/SchaudtSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/SchaudtW12,
author = {Oliver Schaudt and
Vera Weil},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {Graphs in Which the Difference of the Maximum Clique Number and the
Maximum Degree Is Bounded by a Constant},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {237--239},
year = {2012},
timestamp = {Thu, 16 May 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/SchaudtW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Schaudt2011,
author = {Oliver Schaudt},
title = {The Structure of Dominating Subgraphs},
school = {University of Cologne},
year = {2011},
url = {http://www.dr.hut-verlag.de/978-3-8439-0196-3.html},
urn = {urn:nbn:de:101:1-2012011811327},
isbn = {978-3-8439-0196-3},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Schaudt2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Schaudt11,
author = {Oliver Schaudt},
title = {On the existence of total dominating subgraphs with a prescribed additive
hereditary property},
journal = {Discret. Math.},
volume = {311},
number = {18-19},
pages = {2095--2101},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.05.036},
doi = {10.1016/J.DISC.2011.05.036},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Schaudt11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/gi/Schaudt11,
author = {Oliver Schaudt},
editor = {Abraham Bernstein and
Steffen H{\"{o}}lldobler and
Klaus{-}Peter L{\"{o}}hr and
Paul Molitor and
Gustaf Neumann and
R{\"{u}}diger Reischuk and
Myra Spiliopoulou and
Harald St{\"{o}}rrle and
Dorothea Wagner},
title = {Die Struktur dominierender Mengen in Graphen},
booktitle = {Ausgezeichnete Informatikdissertationen 2011},
series = {{LNI}},
volume = {{D-12}},
pages = {171--180},
publisher = {{GI}},
year = {2011},
url = {https://dl.gi.de/handle/20.500.12116/33700},
timestamp = {Tue, 04 Jul 2023 17:43:46 +0200},
biburl = {https://dblp.org/rec/conf/gi/Schaudt11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Schaudt10,
author = {Oliver Schaudt},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {Efficient Total Domination},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {149--152},
year = {2010},
timestamp = {Tue, 09 Nov 2010 19:12:38 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/Schaudt10.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 2024-02-06 23:46 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:
