Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Daniël Paulusma
@article{DBLP:journals/ejc/DabrowskiJPPZ24,
author = {Konrad K. Dabrowski and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Viktor Zamaraev},
title = {On the price of independence for vertex cover, feedback vertex set
and odd cycle transversal},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103821},
year = {2024},
url = {https://doi.org/10.1016/j.ejc.2023.103821},
doi = {10.1016/J.EJC.2023.103821},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/DabrowskiJPPZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BonomoBrabermanBMP24,
author = {Flavia Bonomo{-}Braberman and
Nick Brettell and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
title = {Solving problems on generalized convex graphs via mim-width},
journal = {J. Comput. Syst. Sci.},
volume = {140},
pages = {103493},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2023.103493},
doi = {10.1016/J.JCSS.2023.103493},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BonomoBrabermanBMP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-16678,
author = {Jelle J. Oostveen and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {The Complexity of Diameter on H-free graphs},
journal = {CoRR},
volume = {abs/2402.16678},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.16678},
doi = {10.48550/ARXIV.2402.16678},
eprinttype = {arXiv},
eprint = {2402.16678},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-16678.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-00497,
author = {Tala Eagling{-}Vose and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Mark Siggers and
Siani Smith},
title = {Graph Homomorphism, Monotone Classes and Bounded Pathwidth},
journal = {CoRR},
volume = {abs/2403.00497},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.00497},
doi = {10.48550/ARXIV.2403.00497},
eprinttype = {arXiv},
eprint = {2403.00497},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-00497.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MartinPSL23,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2580--2604},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01109-z},
doi = {10.1007/S00453-023-01109-Z},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MartinPSL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuckePR23,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Finding Matching Cuts in H-Free Graphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3290--3322},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01137-9},
doi = {10.1007/S00453-023-01137-9},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LuckePR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BertheMPS23,
author = {Ga{\'{e}}tan Berthe and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {The Complexity of L(p, q)-Edge-Labelling},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3406--3429},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01120-4},
doi = {10.1007/S00453-023-01120-4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BertheMPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BenedekBJPY23,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Xin Ye},
title = {The Complexity of Matching Games: {A} Survey},
journal = {J. Artif. Intell. Res.},
volume = {77},
pages = {459--485},
year = {2023},
url = {https://doi.org/10.1613/jair.1.14281},
doi = {10.1613/JAIR.1.14281},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/BenedekBJPY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DabrowskiMNPR23,
author = {Konrad K. Dabrowski and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {Clique-width: Harnessing the power of atoms},
journal = {J. Graph Theory},
volume = {104},
number = {4},
pages = {769--810},
year = {2023},
url = {https://doi.org/10.1002/jgt.23000},
doi = {10.1002/JGT.23000},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/DabrowskiMNPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MartinPSL23,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Few induced disjoint paths for \emph{H}-free graphs},
journal = {Theor. Comput. Sci.},
volume = {939},
pages = {182--193},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.10.024},
doi = {10.1016/J.TCS.2022.10.024},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MartinPSL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BrettellOPPL23,
author = {Nick Brettell and
Jelle J. Oostveen and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Henning Fernau and
Klaus Jansen},
title = {Computing Subset Vertex Covers in H-Free Graphs},
booktitle = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
pages = {88--102},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4\_7},
doi = {10.1007/978-3-031-43587-4\_7},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BrettellOPPL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FeghaliLPR23,
author = {Carl Feghali and
Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Matching Cuts in Graphs of High Girth and H-Free Graphs},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {31:1--31:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.31},
doi = {10.4230/LIPICS.ISAAC.2023.31},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FeghaliLPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/0002MPPSL23,
author = {Matthew Johnson and
Barnaby Martin and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Complexity Framework for Forbidden Subgraphs {III:} When Problems
Are Tractable on Subcubic Graphs},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {57:1--57:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.57},
doi = {10.4230/LIPICS.MFCS.2023.57},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/0002MPPSL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LuckePR23,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter,
Bounded Radius},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {64:1--64:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.64},
doi = {10.4230/LIPICS.MFCS.2023.64},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/LuckePR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2023,
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1},
doi = {10.1007/978-3-031-43380-1},
isbn = {978-3-031-43379-5},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-13181,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Dani{\"{e}}l Paulusma},
title = {Partitioned Matching Games for International Kidney Exchange},
journal = {CoRR},
volume = {abs/2301.13181},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.13181},
doi = {10.48550/ARXIV.2301.13181},
eprinttype = {arXiv},
eprint = {2301.13181},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-13181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-01099,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter,
Bounded Radius},
journal = {CoRR},
volume = {abs/2304.01099},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.01099},
doi = {10.48550/ARXIV.2304.01099},
eprinttype = {arXiv},
eprint = {2304.01099},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-01099.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01104,
author = {Matthew Johnson and
Barnaby Martin and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Complexity Framework for Forbidden Subgraphs {III:} When Problems
are Tractable on Subcubic Graphs},
journal = {CoRR},
volume = {abs/2305.01104},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01104},
doi = {10.48550/ARXIV.2305.01104},
eprinttype = {arXiv},
eprint = {2305.01104},
timestamp = {Fri, 05 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01613,
author = {Hans L. Bodlaender and
Matthew Johnson and
Barnaby Martin and
Jelle J. Oostveen and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Complexity Framework for Forbidden Subgraphs {IV:} The Steiner Forest
Problem},
journal = {CoRR},
volume = {abs/2305.01613},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01613},
doi = {10.48550/ARXIV.2305.01613},
eprinttype = {arXiv},
eprint = {2305.01613},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-05701,
author = {Nick Brettell and
Jelle J. Oostveen and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Computing Subset Vertex Covers in H-Free Graphs},
journal = {CoRR},
volume = {abs/2307.05701},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.05701},
doi = {10.48550/ARXIV.2307.05701},
eprinttype = {arXiv},
eprint = {2307.05701},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-05817,
author = {Nick Brettell and
Andrea Munaro and
Dani{\"{e}}l Paulusma and
Shizhou Yang},
title = {Comparing Width Parameters on Graph Classes},
journal = {CoRR},
volume = {abs/2308.05817},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.05817},
doi = {10.48550/ARXIV.2308.05817},
eprinttype = {arXiv},
eprint = {2308.05817},
timestamp = {Thu, 24 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-05817.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-04656,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Jisu Jeong and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon and
Sang{-}il Oum and
Dani{\"{e}}l Paulusma},
title = {Computing pivot-minors},
journal = {CoRR},
volume = {abs/2311.04656},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.04656},
doi = {10.48550/ARXIV.2311.04656},
eprinttype = {arXiv},
eprint = {2311.04656},
timestamp = {Thu, 16 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-04656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-12960,
author = {Van Bang Le and
Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Maximizing Matching Cuts},
journal = {CoRR},
volume = {abs/2312.12960},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.12960},
doi = {10.48550/ARXIV.2312.12960},
eprinttype = {arXiv},
eprint = {2312.12960},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-12960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-16653,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Gergely Cs{\'{a}}ji and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Xin Ye},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes When Cycle Length Is Unbounded},
journal = {CoRR},
volume = {abs/2312.16653},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.16653},
doi = {10.48550/ARXIV.2312.16653},
eprinttype = {arXiv},
eprint = {2312.16653},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-16653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BrauseGMOPS22,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Pascal Ochem and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter},
journal = {Electron. J. Comb.},
volume = {29},
number = {2},
year = {2022},
url = {https://doi.org/10.37236/10738},
doi = {10.37236/10738},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/BrauseGMOPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MartinPS22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Colouring graphs of bounded diameter in the absence of small cycles},
journal = {Discret. Appl. Math.},
volume = {314},
pages = {150--161},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.026},
doi = {10.1016/J.DAM.2022.02.026},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MartinPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrettellHMP22,
author = {Nick Brettell and
Jake Horsfield and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
title = {List \emph{k}-colouring \emph{P}\({}_{\mbox{\emph{t}}}\)-free graphs:
{A} Mim-width perspective},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106168},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106168},
doi = {10.1016/J.IPL.2021.106168},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrettellHMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MartinPS22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Hard problems that quickly become very easy},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106213},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106213},
doi = {10.1016/J.IPL.2021.106213},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MartinPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GolovachPL22,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths in AT-free graphs},
journal = {J. Comput. Syst. Sci.},
volume = {124},
pages = {170--191},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.10.003},
doi = {10.1016/J.JCSS.2021.10.003},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GolovachPL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BrettellJP22,
author = {Nick Brettell and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Computing Weighted Subset Odd Cycle Transversals in \emph{H}-free
graphs},
journal = {J. Comput. Syst. Sci.},
volume = {128},
pages = {71--85},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.03.002},
doi = {10.1016/J.JCSS.2022.03.002},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BrettellJP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrettellHMPP22,
author = {Nick Brettell and
Jake Horsfield and
Andrea Munaro and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Bounding the mim-width of hereditary graph classes},
journal = {J. Graph Theory},
volume = {99},
number = {1},
pages = {117--151},
year = {2022},
url = {https://doi.org/10.1002/jgt.22730},
doi = {10.1002/JGT.22730},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/BrettellHMPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PaesaniPR22,
author = {Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {Feedback Vertex Set and Even Cycle Transversal for {\textdollar}H{\textdollar}-Free
Graphs: Finding Large Block Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2453--2472},
year = {2022},
url = {https://doi.org/10.1137/22m1468864},
doi = {10.1137/22M1468864},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/PaesaniPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KernMPSL22,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Disjoint paths and connected subgraphs for \emph{H}-free graphs},
journal = {Theor. Comput. Sci.},
volume = {898},
pages = {59--68},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.10.019},
doi = {10.1016/J.TCS.2021.10.019},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KernMPSL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrettellJPP22,
author = {Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Computing subset transversals in \emph{H}-free graphs},
journal = {Theor. Comput. Sci.},
volume = {902},
pages = {76--92},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.12.010},
doi = {10.1016/J.TCS.2021.12.010},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrettellJPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrauseGMPS22,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Partitioning \emph{H}-free graphs of bounded diameter},
journal = {Theor. Comput. Sci.},
volume = {930},
pages = {37--52},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.009},
doi = {10.1016/J.TCS.2022.07.009},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrauseGMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MartinPS22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Colouring generalized claw-free graphs and graphs of large girth:
Bounding the diameter},
journal = {Theor. Comput. Sci.},
volume = {931},
pages = {104--116},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.034},
doi = {10.1016/J.TCS.2022.07.034},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MartinPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuckePR22,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {On the complexity of matching cut for graphs of bounded radius and
\emph{H}-free graphs},
journal = {Theor. Comput. Sci.},
volume = {936},
pages = {33--42},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.09.014},
doi = {10.1016/J.TCS.2022.09.014},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LuckePR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/LaroseMMPSZ22,
author = {Beno{\^{\i}}t Larose and
Barnaby Martin and
Petar Markovic and
Dani{\"{e}}l Paulusma and
Siani Smith and
Stanislav Zivn{\'{y}}},
title = {{QCSP} on Reflexive Tournaments},
journal = {{ACM} Trans. Comput. Log.},
volume = {23},
number = {3},
pages = {14:1--14:22},
year = {2022},
url = {https://doi.org/10.1145/3508069},
doi = {10.1145/3508069},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/LaroseMMPSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BenedekBKP22,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {82--90},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p82.pdf},
doi = {10.5555/3535850.3535861},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BenedekBKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LuckePR22,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
editor = {Sang Won Bae and
Heejin Park},
title = {Finding Matching Cuts in H-Free Graphs},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {22:1--22:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.22},
doi = {10.4230/LIPICS.ISAAC.2022.22},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LuckePR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/MartinPSL22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
editor = {Ivana Ljubic and
Francisco Barahona and
Santanu S. Dey and
Ali Ridha Mahjoub},
title = {Few Induced Disjoint Paths for H-Free Graphs},
booktitle = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
Virtual Event, May 18-20, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13526},
pages = {89--101},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18530-4\_7},
doi = {10.1007/978-3-031-18530-4\_7},
timestamp = {Mon, 06 Nov 2023 13:38:03 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/MartinPSL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BertheMPS22,
author = {Ga{\'{e}}tan Berthe and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {The Complexity of L(p, q)-Edge-Labelling},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {175--186},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_15},
doi = {10.1007/978-3-030-96731-4\_15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/BertheMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BulteauDKOP22,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Noleen K{\"{o}}hler and
Sebastian Ordyniak and
Dani{\"{e}}l Paulusma},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {An Algorithmic Framework for Locally Constrained Homomorphisms},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {114--128},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_9},
doi = {10.1007/978-3-031-15914-5\_9},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BulteauDKOP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MartinPSL22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {398--411},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_29},
doi = {10.1007/978-3-031-15914-5\_29},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/MartinPSL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PaesaniPR22,
author = {Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Classifying Subset Feedback Vertex Set for H-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {412--424},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_30},
doi = {10.1007/978-3-031-15914-5\_30},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/PaesaniPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-00430,
author = {Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {Classifying Subset Feedback Vertex Set for H-Free Graphs},
journal = {CoRR},
volume = {abs/2201.00430},
year = {2022},
url = {https://arxiv.org/abs/2201.00430},
eprinttype = {arXiv},
eprint = {2201.00430},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-00430.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-11731,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Noleen K{\"{o}}hler and
Sebastian Ordyniak and
Dani{\"{e}}l Paulusma},
title = {An Algorithmic Framework for Locally Constrained Homomorphisms},
journal = {CoRR},
volume = {abs/2201.11731},
year = {2022},
url = {https://arxiv.org/abs/2201.11731},
eprinttype = {arXiv},
eprint = {2201.11731},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-11731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06898,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Xin Ye},
title = {The Complexity of Matching Games: {A} Survey},
journal = {CoRR},
volume = {abs/2202.06898},
year = {2022},
url = {https://arxiv.org/abs/2202.06898},
eprinttype = {arXiv},
eprint = {2202.06898},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-11595,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs},
journal = {CoRR},
volume = {abs/2202.11595},
year = {2022},
url = {https://arxiv.org/abs/2202.11595},
eprinttype = {arXiv},
eprint = {2202.11595},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-11595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-03319,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Few Induced Disjoint Paths for H-Free Graphs},
journal = {CoRR},
volume = {abs/2203.03319},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.03319},
doi = {10.48550/ARXIV.2203.03319},
eprinttype = {arXiv},
eprint = {2203.03319},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-03319.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-07129,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {On The Complexity of Matching Cut for Graphs of Bounded Radius and
H-Free Graphs},
journal = {CoRR},
volume = {abs/2204.07129},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.07129},
doi = {10.48550/ARXIV.2204.07129},
eprinttype = {arXiv},
eprint = {2204.07129},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-07129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07095,
author = {Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Finding Matching Cuts in H-Free Graphs},
journal = {CoRR},
volume = {abs/2207.07095},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07095},
doi = {10.48550/ARXIV.2207.07095},
eprinttype = {arXiv},
eprint = {2207.07095},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07095.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12203,
author = {Matthew Johnson and
Barnaby Martin and
Siani Smith and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic
graphs},
journal = {CoRR},
volume = {abs/2211.12203},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.12203},
doi = {10.48550/ARXIV.2211.12203},
eprinttype = {arXiv},
eprint = {2211.12203},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-12203.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12887,
author = {Matthew Johnson and
Barnaby Martin and
Jelle J. Oostveen and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Complexity Framework For Forbidden Subgraphs},
journal = {CoRR},
volume = {abs/2211.12887},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.12887},
doi = {10.48550/ARXIV.2211.12887},
eprinttype = {arXiv},
eprint = {2211.12887},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-12887.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-14214,
author = {Barnaby Martin and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Complexity Framework for Forbidden Subgraphs: When Hardness Is Not
Preserved under Edge Subdivision},
journal = {CoRR},
volume = {abs/2211.14214},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.14214},
doi = {10.48550/ARXIV.2211.14214},
eprinttype = {arXiv},
eprint = {2211.14214},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-14214.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-12317,
author = {Carl Feghali and
Felicia Lucke and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect
Matching},
journal = {CoRR},
volume = {abs/2212.12317},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.12317},
doi = {10.48550/ARXIV.2212.12317},
eprinttype = {arXiv},
eprint = {2212.12317},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-12317.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/algorithmica/BonamyBDJPP21,
author = {Marthe Bonamy and
Nicolas Bousquet and
Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Th{\'{e}}o Pierron},
title = {Graph Isomorphism for (H\({}_{\mbox{1, H\({}_{\mbox{2)}}\)}}\)-Free
Graphs: An Almost Complete Dichotomy},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {822--852},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00747-x},
doi = {10.1007/S00453-020-00747-X},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyBDJPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HochstattlerHMP21,
author = {Winfried Hochst{\"{a}}ttler and
Johann L. Hurink and
Bodo Manthey and
Dani{\"{e}}l Paulusma and
Britta Peis and
Georg Still},
title = {In Memoriam Walter Kern},
journal = {Discret. Appl. Math.},
volume = {303},
pages = {2--3},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.08.034},
doi = {10.1016/J.DAM.2021.08.034},
timestamp = {Fri, 24 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HochstattlerHMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/JohnsonPL21,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {What Graphs are 2-Dot Product Graphs?},
journal = {Int. J. Comput. Geom. Appl.},
volume = {31},
number = {1},
pages = {1--16},
year = {2021},
url = {https://doi.org/10.1142/S0218195921500011},
doi = {10.1142/S0218195921500011},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/JohnsonPL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BonamyDFJP21,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Recognizing graphs close to bipartite graphs with an application to
colouring reconfiguration},
journal = {J. Graph Theory},
volume = {98},
number = {1},
pages = {81--109},
year = {2021},
url = {https://doi.org/10.1002/jgt.22683},
doi = {10.1002/JGT.22683},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BonamyDFJP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DabrowskiDJKKOP21,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Jisu Jeong and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon and
Sang{-}il Oum and
Dani{\"{e}}l Paulusma},
title = {Tree Pivot-Minors and Linear Rank-Width},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {4},
pages = {2922--2945},
year = {2021},
url = {https://doi.org/10.1137/21M1402339},
doi = {10.1137/21M1402339},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DabrowskiDJKKOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderBJPPL21,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Steiner trees for hereditary graph classes: {A} treewidth perspective},
journal = {Theor. Comput. Sci.},
volume = {867},
pages = {30--39},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.012},
doi = {10.1016/J.TCS.2021.03.012},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderBJPPL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcc/DabrowskiGG0MP21,
author = {Konrad K. Dabrowski and
Maximilien Gadouleau and
Nicholas Georgiou and
Matthew Johnson and
George B. Mertzios and
Dani{\"{e}}l Paulusma},
editor = {Konrad K. Dabrowski and
Maximilien Gadouleau and
Nicholas Georgiou and
Matthew Johnson and
George B. Mertzios and
Dani{\"{e}}l Paulusma},
title = {Preface},
booktitle = {Surveys in Combinatorics, 2021: Invited lectures from the 28th British
Combinatorial Conference, Durham, UK, July 5-9, 2021},
pages = {vii--viii},
publisher = {Cambridge University Press},
year = {2021},
url = {https://doi.org/10.1017/9781009036214.001},
doi = {10.1017/9781009036214.001},
timestamp = {Mon, 10 Jan 2022 15:48:53 +0100},
biburl = {https://dblp.org/rec/conf/bcc/DabrowskiGG0MP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MartinPS21,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Colouring Graphs of Bounded Diameter in the Absence of Small Cycles},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {367--380},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_26},
doi = {10.1007/978-3-030-75242-2\_26},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/MartinPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BokJMPS21,
author = {Jan Bok and
Nikola Jedlickov{\'{a}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Rahul Santhanam and
Daniil Musatov},
title = {Injective Colouring for H-Free Graphs},
booktitle = {Computer Science - Theory and Applications - 16th International Computer
Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 -
July 2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12730},
pages = {18--30},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79416-3\_2},
doi = {10.1007/978-3-030-79416-3\_2},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/BokJMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LaroseMMPSZ21,
author = {Beno{\^{\i}}t Larose and
Petar Markovic and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Stanislav Zivn{\'{y}}},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {{QCSP} on Reflexive Tournaments},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {58:1--58:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.58},
doi = {10.4230/LIPICS.ESA.2021.58},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/LaroseMMPSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrauseGMPS21,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Partitioning H-Free Graphs of Bounded Diameter},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.21},
doi = {10.4230/LIPICS.ISAAC.2021.21},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BrauseGMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KernMPSL21,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
editor = {Paola Flocchini and
Lucia Moura},
title = {Disjoint Paths and Connected Subgraphs for H-Free Graphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {414--427},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_29},
doi = {10.1007/978-3-030-79987-8\_29},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/KernMPSL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PaesaniPR21,
author = {Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs:
Finding Large Block Graphs},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {82:1--82:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.82},
doi = {10.4230/LIPICS.MFCS.2021.82},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/PaesaniPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Bonomo-Braberman21,
author = {Flavia Bonomo{-}Braberman and
Nick Brettell and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Solving Problems on Generalized Convex Graphs via Mim-Width},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {200--214},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_15},
doi = {10.1007/978-3-030-83508-8\_15},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Bonomo-Braberman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BrettellJP21,
author = {Nick Brettell and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Computing Weighted Subset Transversals in H-Free Graphs},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {229--242},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_17},
doi = {10.1007/978-3-030-83508-8\_17},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BrettellJP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrauseGMPS21,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {336--348},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_26},
doi = {10.1007/978-3-030-86838-3\_26},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BrauseGMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/bcc/2021,
editor = {Konrad K. Dabrowski and
Maximilien Gadouleau and
Nicholas Georgiou and
Matthew Johnson and
George B. Mertzios and
Dani{\"{e}}l Paulusma},
title = {Surveys in Combinatorics, 2021: Invited lectures from the 28th British
Combinatorial Conference, Durham, UK, July 5-9, 2021},
publisher = {Cambridge University Press},
year = {2021},
isbn = {978-1-009-01888-3},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bcc/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07856,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Colouring Graphs of Bounded Diameter in the Absence of Small Cycles},
journal = {CoRR},
volume = {abs/2101.07856},
year = {2021},
url = {https://arxiv.org/abs/2101.07856},
eprinttype = {arXiv},
eprint = {2101.07856},
timestamp = {Tue, 26 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-10570,
author = {Beno{\^{\i}}t Larose and
Petar Markovic and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Stanislav Zivn{\'{y}}},
title = {{QCSP} on Reflexive Tournaments},
journal = {CoRR},
volume = {abs/2104.10570},
year = {2021},
url = {https://arxiv.org/abs/2104.10570},
eprinttype = {arXiv},
eprint = {2104.10570},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-10570.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-10593,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter},
journal = {CoRR},
volume = {abs/2104.10593},
year = {2021},
url = {https://arxiv.org/abs/2104.10593},
eprinttype = {arXiv},
eprint = {2104.10593},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-10593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-02736,
author = {Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs:
Finding Large Block Graphs},
journal = {CoRR},
volume = {abs/2105.02736},
year = {2021},
url = {https://arxiv.org/abs/2105.02736},
eprinttype = {arXiv},
eprint = {2105.02736},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-02736.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-04588,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Partitioning H-Free Graphs of Bounded Diameter},
journal = {CoRR},
volume = {abs/2105.04588},
year = {2021},
url = {https://arxiv.org/abs/2105.04588},
eprinttype = {arXiv},
eprint = {2105.04588},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-04588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-06349,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Disjoint Paths and Connected Subgraphs for H-Free Graphs},
journal = {CoRR},
volume = {abs/2105.06349},
year = {2021},
url = {https://arxiv.org/abs/2105.06349},
eprinttype = {arXiv},
eprint = {2105.06349},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-06349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06788,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes},
journal = {CoRR},
volume = {abs/2109.06788},
year = {2021},
url = {https://arxiv.org/abs/2109.06788},
eprinttype = {arXiv},
eprint = {2109.06788},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06788.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-11897,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Colouring Generalized Claw-Free Graphs and Graphs of Large Girth:
Bounding the Diameter},
journal = {CoRR},
volume = {abs/2111.11897},
year = {2021},
url = {https://arxiv.org/abs/2111.11897},
eprinttype = {arXiv},
eprint = {2111.11897},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-11897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JohnsonPP20,
author = {Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Connected Vertex Cover for (sP\({}_{\mbox{1+P\({}_{\mbox{5)}}\)}}\)-Free
Graphs},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {20--40},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00601-9},
doi = {10.1007/S00453-019-00601-9},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JohnsonPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlimosovaMMNPS20,
author = {Tereza Klimosov{\'{a}} and
Josef Mal{\'{\i}}k and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {Colouring (P\({}_{\mbox{r}}\) + P\({}_{\mbox{s}}\))-Free Graphs},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1833--1858},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00675-w},
doi = {10.1007/S00453-020-00675-W},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlimosovaMMNPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DabrowskiFJPPR20,
author = {Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {On Cycle Transversals and Their Connected Variants in the Absence
of a Small Linear Forest},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {2841--2866},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00706-6},
doi = {10.1007/S00453-020-00706-6},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DabrowskiFJPPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DabrowskiLP20,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
title = {Clique-width and well-quasi-ordering of triangle-free graph classes},
journal = {J. Comput. Syst. Sci.},
volume = {108},
pages = {64--91},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.09.001},
doi = {10.1016/J.JCSS.2019.09.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DabrowskiLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MartinPL20,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Disconnected cuts in claw-free graphs},
journal = {J. Comput. Syst. Sci.},
volume = {113},
pages = {60--75},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2020.04.005},
doi = {10.1016/J.JCSS.2020.04.005},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MartinPL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/HofKKPP20,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Kanstantsin Pashkovich and
Dani{\"{e}}l Paulusma},
title = {Simple games versus weighted voting games: bounding the critical threshold
value},
journal = {Soc. Choice Welf.},
volume = {54},
number = {4},
pages = {609--621},
year = {2020},
url = {https://doi.org/10.1007/s00355-019-01221-6},
doi = {10.1007/S00355-019-01221-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/HofKKPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BlancheDJLPZ20,
author = {Alexandre Blanch{\'{e}} and
Konrad K. Dabrowski and
Matthew Johnson and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma and
Viktor Zamaraev},
title = {Clique-Width for Graph Classes Closed under Complementation},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {2},
pages = {1107--1147},
year = {2020},
url = {https://doi.org/10.1137/18M1235016},
doi = {10.1137/18M1235016},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BlancheDJLPZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BokJMPS20,
author = {Jan Bok and
Nikola Jedlickov{\'{a}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Acyclic, Star and Injective Colouring: {A} Complexity Picture for
H-Free Graphs},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {22:1--22:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.22},
doi = {10.4230/LIPICS.ESA.2020.22},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BokJMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KernP20,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Contracting to a Longest Path in H-Free Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {22:1--22:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.22},
doi = {10.4230/LIPICS.ISAAC.2020.22},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KernP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BrettellHMPP20,
author = {Nick Brettell and
Jake Horsfield and
Andrea Munaro and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Bounding the Mim-Width of Hereditary Graph Classes},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {6:1--6:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.6},
doi = {10.4230/LIPICS.IPEC.2020.6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BrettellHMPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BodlaenderB0PPL20,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Steiner Trees for Hereditary Graph Classes},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {613--624},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_48},
doi = {10.1007/978-3-030-61792-9\_48},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BodlaenderB0PPL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DabrowskiMNPR20,
author = {Konrad K. Dabrowski and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Clique-Width: Harnessing the Power of Atoms},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {119--133},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_10},
doi = {10.1007/978-3-030-60440-0\_10},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DabrowskiMNPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrettellJPP20,
author = {Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Computing Subset Transversals in H-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {187--199},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_15},
doi = {10.1007/978-3-030-60440-0\_15},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrettellJPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-05018,
author = {Nick Brettell and
Jake Horsfield and
Andrea Munaro and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Bounding the Mim-Width of Hereditary Graph Classes},
journal = {CoRR},
volume = {abs/2004.05018},
year = {2020},
url = {https://arxiv.org/abs/2004.05018},
eprinttype = {arXiv},
eprint = {2004.05018},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-05018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-05022,
author = {Nick Brettell and
Jake Horsfield and
Dani{\"{e}}l Paulusma},
title = {Colouring {\textdollar}(sP{\_}1+P{\_}5){\textdollar}-Free Graphs:
a Mim-Width Perspective},
journal = {CoRR},
volume = {abs/2004.05022},
year = {2020},
url = {https://arxiv.org/abs/2004.05022},
eprinttype = {arXiv},
eprint = {2004.05022},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-05022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07492,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective},
journal = {CoRR},
volume = {abs/2004.07492},
year = {2020},
url = {https://arxiv.org/abs/2004.07492},
eprinttype = {arXiv},
eprint = {2004.07492},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07492.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-13938,
author = {Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Computing Subset Transversals in H-Free Graphs},
journal = {CoRR},
volume = {abs/2005.13938},
year = {2020},
url = {https://arxiv.org/abs/2005.13938},
eprinttype = {arXiv},
eprint = {2005.13938},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-13938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-03578,
author = {Konrad K. Dabrowski and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {Clique-Width: Harnessing the Power of Atoms},
journal = {CoRR},
volume = {abs/2006.03578},
year = {2020},
url = {https://arxiv.org/abs/2006.03578},
eprinttype = {arXiv},
eprint = {2006.03578},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-03578.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-14514,
author = {Nick Brettell and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Computing Weighted Subset Transversals in H-Free Graphs},
journal = {CoRR},
volume = {abs/2007.14514},
year = {2020},
url = {https://arxiv.org/abs/2007.14514},
eprinttype = {arXiv},
eprint = {2007.14514},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-14514.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-00561,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Jisu Jeong and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon and
Sang{-}il Oum and
Dani{\"{e}}l Paulusma},
title = {Tree pivot-minors and linear rank-width},
journal = {CoRR},
volume = {abs/2008.00561},
year = {2020},
url = {https://arxiv.org/abs/2008.00561},
eprinttype = {arXiv},
eprint = {2008.00561},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-00561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-01590,
author = {Nick Brettell and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
title = {List k-Colouring P\({}_{\mbox{t}}\)-Free Graphs with No Induced 1-Subdivision
of K\({}_{\mbox{1, s}}\): a Mim-width Perspective},
journal = {CoRR},
volume = {abs/2008.01590},
year = {2020},
url = {https://arxiv.org/abs/2008.01590},
eprinttype = {arXiv},
eprint = {2008.01590},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-01590.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-09004,
author = {Nick Brettell and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
title = {Solving problems on generalized convex graphs via mim-width},
journal = {CoRR},
volume = {abs/2008.09004},
year = {2020},
url = {https://arxiv.org/abs/2008.09004},
eprinttype = {arXiv},
eprint = {2008.09004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-09004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-09415,
author = {Jan Bok and
Nikola Jedlickov{\'{a}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Acyclic, Star and Injective Colouring: {A} Complexity Picture for
H-Free Graphs},
journal = {CoRR},
volume = {abs/2008.09415},
year = {2020},
url = {https://arxiv.org/abs/2008.09415},
eprinttype = {arXiv},
eprint = {2008.09415},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-09415.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-12226,
author = {Ga{\'{e}}tan Berthe and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {The complexity of L(p, q)-Edge-Labelling},
journal = {CoRR},
volume = {abs/2008.12226},
year = {2020},
url = {https://arxiv.org/abs/2008.12226},
eprinttype = {arXiv},
eprint = {2008.12226},
timestamp = {Wed, 14 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-12226.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-09770,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Hard Problems That Quickly Become Very Easy},
journal = {CoRR},
volume = {abs/2012.09770},
year = {2020},
url = {https://arxiv.org/abs/2012.09770},
eprinttype = {arXiv},
eprint = {2012.09770},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-09770.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-09814,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths in AT-free Graphs},
journal = {CoRR},
volume = {abs/2012.09814},
year = {2020},
url = {https://arxiv.org/abs/2012.09814},
eprinttype = {arXiv},
eprint = {2012.09814},
timestamp = {Sun, 03 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-09814.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BonsmaP19,
author = {Paul S. Bonsma and
Dani{\"{e}}l Paulusma},
title = {Using contracted solution graphs for solving reconfiguration problems},
journal = {Acta Informatica},
volume = {56},
number = {7-8},
pages = {619--648},
year = {2019},
url = {https://doi.org/10.1007/s00236-019-00336-8},
doi = {10.1007/S00236-019-00336-8},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BonsmaP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonamyDFJP19,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent Feedback Vertex Set for P\({}_{\mbox{5}}\)-Free Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1342--1369},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0474-x},
doi = {10.1007/S00453-018-0474-X},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonamyDFJP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKLP19,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth
at Most 2},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2795--2828},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00555-y},
doi = {10.1007/S00453-019-00555-Y},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/GolovachJMPS19,
author = {Petr A. Golovach and
Matthew Johnson and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Surjective H-colouring: New hardness results},
journal = {Comput.},
volume = {8},
number = {1},
pages = {27--42},
year = {2019},
url = {https://doi.org/10.3233/COM-180084},
doi = {10.3233/COM-180084},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computability/GolovachJMPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PaulusmaPR19,
author = {Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
title = {Critical vertices and edges in H-free graphs},
journal = {Discret. Appl. Math.},
volume = {257},
pages = {361--367},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.08.016},
doi = {10.1016/J.DAM.2018.08.016},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PaulusmaPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/JohnsonMMP19,
author = {Matthew Johnson and
Barnaby Martin and
George B. Mertzios and
Dani{\"{e}}l Paulusma},
title = {Report on {BCTCS} {\&} AlgoUK 2019},
journal = {Bull. {EATCS}},
volume = {128},
year = {2019},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/580/584},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/JohnsonMMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaulusmaS19,
author = {Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {On the parameterized complexity of (\emph{k}, \emph{s})-SAT},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {34--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.005},
doi = {10.1016/J.IPL.2018.11.005},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaulusmaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalbyLPR19,
author = {Esther Galby and
Paloma T. Lima and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Classifying \emph{k}-edge colouring for \emph{H}-free graphs},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {39--43},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.006},
doi = {10.1016/J.IPL.2019.02.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalbyLPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DabrowskiHP19,
author = {Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding clique-width via perfect graphs},
journal = {J. Comput. Syst. Sci.},
volume = {104},
pages = {202--215},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2016.06.007},
doi = {10.1016/J.JCSS.2016.06.007},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DabrowskiHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GaspersHP19,
author = {Serge Gaspers and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Colouring square-free graphs without long induced paths},
journal = {J. Comput. Syst. Sci.},
volume = {106},
pages = {60--79},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.06.002},
doi = {10.1016/J.JCSS.2019.06.002},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GaspersHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BlancheD0P19,
author = {Alexandre Blanch{\'{e}} and
Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Hereditary graph classes: When the complexities of coloring and clique
cover coincide},
journal = {J. Graph Theory},
volume = {91},
number = {3},
pages = {267--289},
year = {2019},
url = {https://doi.org/10.1002/jgt.22431},
doi = {10.1002/JGT.22431},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BlancheD0P19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DabrowskiD0P19,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Filling the complexity gaps for colouring planar and bounded degree
graphs},
journal = {J. Graph Theory},
volume = {92},
number = {4},
pages = {377--393},
year = {2019},
url = {https://doi.org/10.1002/jgt.22459},
doi = {10.1002/JGT.22459},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DabrowskiD0P19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/LaroseMP19,
author = {Beno{\^{\i}}t Larose and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {Surjective H-Colouring over Reflexive Digraphs},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {1},
pages = {3:1--3:21},
year = {2019},
url = {https://doi.org/10.1145/3282431},
doi = {10.1145/3282431},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/LaroseMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BiroKPP19,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Dani{\"{e}}l Paulusma},
editor = {Edith Elkind and
Manuela Veloso and
Noa Agmon and
Matthew E. Taylor},
title = {Generalized Matching Games for International Kidney Exchange},
booktitle = {Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
2019},
pages = {413--421},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2019},
url = {http://dl.acm.org/citation.cfm?id=3331721},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BiroKPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcc/Dabrowski0P19,
author = {Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Allan Lo and
Richard Mycroft and
Guillem Perarnau and
Andrew Treglown},
title = {Clique-width for hereditary graph classes},
booktitle = {Surveys in Combinatorics, 2019: Invited lectures from the 27th British
Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019},
pages = {1--56},
publisher = {Cambridge University Press},
year = {2019},
url = {https://doi.org/10.1017/9781108649094.002},
doi = {10.1017/9781108649094.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bcc/Dabrowski0P19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauDF0PV19,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Guillaume Fertin and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
St{\'{e}}phane Vialette},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {Finding a Small Number of Colourful Components},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.20},
doi = {10.4230/LIPICS.CPM.2019.20},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauDF0PV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Feghali0PP19,
author = {Carl Feghali and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
editor = {Leszek Antoni Gasieniec and
Jesper Jansson and
Christos Levcopoulos},
title = {On Cycle Transversals and Their Connected Variants in the Absence
of a Small Linear Forest},
booktitle = {Fundamentals of Computation Theory - 22nd International Symposium,
{FCT} 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11651},
pages = {258--273},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25027-0\_18},
doi = {10.1007/978-3-030-25027-0\_18},
timestamp = {Tue, 17 May 2022 11:54:28 +0200},
biburl = {https://dblp.org/rec/conf/fct/Feghali0PP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MartinPS19,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Colouring H-Free Graphs of Bounded Diameter},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.14},
doi = {10.4230/LIPICS.MFCS.2019.14},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/MartinPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BonamyD0P19,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Graph Isomorphism for (H\({}_{\mbox{1}}\), H\({}_{\mbox{2}}\))-Free
Graphs: An Almost Complete Dichotomy},
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 = {181--195},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_14},
doi = {10.1007/978-3-030-24766-9\_14},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BonamyD0P19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2019,
editor = {Florin Manea and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Giuseppe Primiero},
title = {Computing with Foresight and Industry - 15th Conference on Computability
in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11558},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22996-2},
doi = {10.1007/978-3-030-22996-2},
isbn = {978-3-030-22995-5},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00335,
author = {Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Clique-Width for Hereditary Graph Classes},
journal = {CoRR},
volume = {abs/1901.00335},
year = {2019},
url = {http://arxiv.org/abs/1901.00335},
eprinttype = {arXiv},
eprint = {1901.00335},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-01861,
author = {Esther Galby and
Paloma T. Lima and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {On the Parameterized Complexity of k-Edge Colouring},
journal = {CoRR},
volume = {abs/1901.01861},
year = {2019},
url = {http://arxiv.org/abs/1901.01861},
eprinttype = {arXiv},
eprint = {1901.01861},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-01861.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-00491,
author = {Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Pawel Rzazewski},
title = {On Cycle Transversals and Their Connected Variants in the Absence
of a Small Linear Forest},
journal = {CoRR},
volume = {abs/1908.00491},
year = {2019},
url = {http://arxiv.org/abs/1908.00491},
eprinttype = {arXiv},
eprint = {1908.00491},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-00491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-05254,
author = {Konrad K. Dabrowski and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Viktor Zamaraev},
title = {On the Price of Independence for Vertex Cover, Feedback Vertex Set
and Odd Cycle Transversal},
journal = {CoRR},
volume = {abs/1910.05254},
year = {2019},
url = {http://arxiv.org/abs/1910.05254},
eprinttype = {arXiv},
eprint = {1910.05254},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-05254.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/dam/CochefertCGKPS18,
author = {Manfred Cochefert and
Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Computing square roots of graphs with low maximum degree},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {93--101},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.04.041},
doi = {10.1016/J.DAM.2017.04.041},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CochefertCGKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/BiroKPW18,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
title = {The stable fixtures problem with payments},
journal = {Games Econ. Behav.},
volume = {108},
pages = {245--268},
year = {2018},
url = {https://doi.org/10.1016/j.geb.2017.02.002},
doi = {10.1016/J.GEB.2017.02.002},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/BiroKPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonamyDFJP18,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent feedback vertex sets for graphs of bounded diameter},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {26--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.004},
doi = {10.1016/J.IPL.2017.11.004},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonamyDFJP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DabrowskiP18,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {On colouring (2\emph{P}\({}_{\mbox{2}}\), \emph{H})-free and (\emph{P}\({}_{\mbox{5}}\),
\emph{H})-free graphs},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {35--41},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.003},
doi = {10.1016/J.IPL.2018.02.003},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DabrowskiP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GolovachKPS18,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Finding Cactus Roots in Polynomial Time},
journal = {Theory Comput. Syst.},
volume = {62},
number = {6},
pages = {1409--1426},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9825-2},
doi = {10.1007/S00224-017-9825-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GolovachKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/DabrowskiLP18,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
title = {Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes},
journal = {Order},
volume = {35},
number = {2},
pages = {253--274},
year = {2018},
url = {https://doi.org/10.1007/s11083-017-9430-7},
doi = {10.1007/S11083-017-9430-7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/DabrowskiLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChiarelliHJMP18,
author = {Nina Chiarelli and
Tatiana Romina Hartinger and
Matthew Johnson and
Martin Milanic and
Dani{\"{e}}l Paulusma},
title = {Minimum connected transversals in graphs: New hardness results and
tractable cases using the price of connectivity},
journal = {Theor. Comput. Sci.},
volume = {705},
pages = {75--83},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.09.033},
doi = {10.1016/J.TCS.2017.09.033},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChiarelliHJMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DinerPPR18,
author = {{\"{O}}znur Yasar Diner and
Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
title = {Contraction and deletion blockers for perfect graphs and \emph{H}-free
graphs},
journal = {Theor. Comput. Sci.},
volume = {746},
pages = {49--72},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.06.023},
doi = {10.1016/J.TCS.2018.06.023},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DinerPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MartinPL18,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Disconnected Cuts in Claw-free Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {61:1--61:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.61},
doi = {10.4230/LIPICS.ESA.2018.61},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/MartinPL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KlimosovaMMNPS18,
author = {Tereza Klimosov{\'{a}} and
Josef Mal{\'{\i}}k and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Veronika Sl{\'{i}}vov{\'{a}}},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Colouring (P{\_}r+P{\_}s)-Free Graphs},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.5},
doi = {10.4230/LIPICS.ISAAC.2018.5},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KlimosovaMMNPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Dabrowski0PPZ18,
author = {Konrad K. Dabrowski and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Viktor Zamaraev},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {On the Price of Independence for Vertex Cover, Feedback Vertex Set
and Odd Cycle Transversal},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {63:1--63:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.63},
doi = {10.4230/LIPICS.MFCS.2018.63},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Dabrowski0PPZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HofKKP18,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Dani{\"{e}}l Paulusma},
editor = {Xiaotie Deng},
title = {Simple Games Versus Weighted Voting Games},
booktitle = {Algorithmic Game Theory - 11th International Symposium, {SAGT} 2018,
Beijing, China, September 11-14, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11059},
pages = {69--81},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-99660-8\_7},
doi = {10.1007/978-3-319-99660-8\_7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/HofKKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GaspersHP18,
author = {Serge Gaspers and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Colouring Square-Free Graphs without Long Induced Paths},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.35},
doi = {10.4230/LIPICS.STACS.2018.35},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GaspersHP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LaroseMP18,
author = {Beno{\^{\i}}t Larose and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Surjective H-Colouring over Reflexive Digraphs},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {49:1--49:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.49},
doi = {10.4230/LIPICS.STACS.2018.49},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LaroseMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DabrowskiDJKKOP18,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Jisu Jeong and
Mamadou Moustapha Kant{\'{e}} and
O{-}joung Kwon and
Sang{-}il Oum and
Dani{\"{e}}l Paulusma},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Computing Small Pivot-Minors},
booktitle = {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},
pages = {125--138},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_11},
doi = {10.1007/978-3-030-00256-5\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DabrowskiDJKKOP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/0002PP18,
author = {Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Connected Vertex Cover for (sP{\_}1+P{\_}5) {(} s {P} 1 + {P} 5 {)}
-Free Graphs},
booktitle = {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},
pages = {279--291},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_23},
doi = {10.1007/978-3-030-00256-5\_23},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/0002PP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03663,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Disconnected Cuts in Claw-free Graphs},
journal = {CoRR},
volume = {abs/1803.03663},
year = {2018},
url = {http://arxiv.org/abs/1803.03663},
eprinttype = {arXiv},
eprint = {1803.03663},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03663.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-11091,
author = {Tereza Klimosov{\'{a}} and
Josef Mal{\'{\i}}k and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}} and
Dani{\"{e}}l Paulusma and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {Colouring (P{\_}r+P{\_}s)-Free Graphs},
journal = {CoRR},
volume = {abs/1804.11091},
year = {2018},
url = {http://arxiv.org/abs/1804.11091},
eprinttype = {arXiv},
eprint = {1804.11091},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-11091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02192,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Dani{\"{e}}l Paulusma},
title = {Simple Games versus Weighted Voting Games},
journal = {CoRR},
volume = {abs/1805.02192},
year = {2018},
url = {http://arxiv.org/abs/1805.02192},
eprinttype = {arXiv},
eprint = {1805.02192},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02192.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08270,
author = {Serge Gaspers and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Colouring Square-Free Graphs without Long Induced Paths},
journal = {CoRR},
volume = {abs/1805.08270},
year = {2018},
url = {http://arxiv.org/abs/1805.08270},
eprinttype = {arXiv},
eprint = {1805.08270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-08270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-03561,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Guillaume Fertin and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
St{\'{e}}phane Vialette},
title = {Finding a Small Number of Colourful Components},
journal = {CoRR},
volume = {abs/1808.03561},
year = {2018},
url = {http://arxiv.org/abs/1808.03561},
eprinttype = {arXiv},
eprint = {1808.03561},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-03561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01542,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Contracting to a Longest Path in H-Free Graphs},
journal = {CoRR},
volume = {abs/1810.01542},
year = {2018},
url = {http://arxiv.org/abs/1810.01542},
eprinttype = {arXiv},
eprint = {1810.01542},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04379,
author = {Esther Galby and
Paloma T. Lima and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Classifying k-Edge Colouring for H-free Graphs},
journal = {CoRR},
volume = {abs/1810.04379},
year = {2018},
url = {http://arxiv.org/abs/1810.04379},
eprinttype = {arXiv},
eprint = {1810.04379},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04379.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08841,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Kanstantsin Pashkovich and
Dani{\"{e}}l Paulusma},
title = {Simple Games versus Weighted Voting Games: Bounding the Critical Threshold
Value},
journal = {CoRR},
volume = {abs/1810.08841},
year = {2018},
url = {http://arxiv.org/abs/1810.08841},
eprinttype = {arXiv},
eprint = {1810.08841},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-08841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12252,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Graph Isomorphism for (H\({}_{\mbox{1}}\), H\({}_{\mbox{2}}\))-free
Graphs: An Almost Complete Dichotomy},
journal = {CoRR},
volume = {abs/1811.12252},
year = {2018},
url = {http://arxiv.org/abs/1811.12252},
eprinttype = {arXiv},
eprint = {1811.12252},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachPS17,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
title = {Graph editing to a fixed target},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {181--190},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2014.07.008},
doi = {10.1016/J.DAM.2014.07.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHKP17,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {The price of connectivity for feedback vertex set},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {132--143},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.011},
doi = {10.1016/J.DAM.2016.08.011},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BresarHKMPPT17,
author = {Bostjan Bresar and
Pinar Heggernes and
Marcin Jakub Kaminski and
Martin Milanic and
Dani{\"{e}}l Paulusma and
Primoz Potocnik and
Nicolas Trotignon},
title = {Preface: Algorithmic Graph Theory on the Adriatic Coast},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {1--3},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.05.007},
doi = {10.1016/J.DAM.2017.05.007},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BresarHKMPPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Feghali0P17,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Kempe equivalence of colourings of cubic graphs},
journal = {Eur. J. Comb.},
volume = {59},
pages = {1--10},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2016.06.008},
doi = {10.1016/J.EJC.2016.06.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Feghali0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DabrowskiP17,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Contracting Bipartite Graphs to Paths and Cycles},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {309--315},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.053},
doi = {10.1016/J.ENDM.2017.06.053},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/DabrowskiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PicouleauPR17,
author = {Christophe Picouleau and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Reducing the Chromatic Number by Vertex or Edge Deletions},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {243--248},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.042},
doi = {10.1016/J.ENDM.2017.10.042},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PicouleauPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DabrowskiP17,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Contracting bipartite graphs to paths and cycles},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {37--42},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.013},
doi = {10.1016/J.IPL.2017.06.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DabrowskiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DabrowskiGHPT17,
author = {Konrad Kazimierz Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Editing to a planar graph of given degrees},
journal = {J. Comput. Syst. Sci.},
volume = {85},
pages = {168--182},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2016.11.009},
doi = {10.1016/J.JCSS.2016.11.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DabrowskiGHPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DabrowskiDP17,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Dani{\"{e}}l Paulusma},
title = {Colouring diamond-free graphs},
journal = {J. Comput. Syst. Sci.},
volume = {89},
pages = {410--431},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.06.005},
doi = {10.1016/J.JCSS.2017.06.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DabrowskiDP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GolovachJPS17,
author = {Petr A. Golovach and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {A Survey on the Computational Complexity of Coloring Graphs with Forbidden
Subgraphs},
journal = {J. Graph Theory},
volume = {84},
number = {4},
pages = {331--363},
year = {2017},
url = {https://doi.org/10.1002/jgt.22028},
doi = {10.1002/JGT.22028},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/GolovachJPS17.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/tcs/GolovachKPS17,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {A linear kernel for finding square roots of almost planar graphs},
journal = {Theor. Comput. Sci.},
volume = {689},
pages = {36--47},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.05.008},
doi = {10.1016/J.TCS.2017.05.008},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Golovach0MPS17,
author = {Petr A. Golovach and
Matthew Johnson and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
editor = {Jarkko Kari and
Florin Manea and
Ion Petre},
title = {Surjective H-Colouring: New Hardness Results},
booktitle = {Unveiling Dynamics and Complexity - 13th Conference on Computability
in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10307},
pages = {270--281},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58741-7\_26},
doi = {10.1007/978-3-319-58741-7\_26},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/Golovach0MPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BonamyDF0P17,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Independent Feedback Vertex Set for P{\_}5-free Graphs},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {16:1--16:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.16},
doi = {10.4230/LIPICS.ISAAC.2017.16},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BonamyDF0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BonamyDF0P17,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Recognizing Graphs Close to Bipartite Graphs},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {70:1--70:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.70},
doi = {10.4230/LIPICS.MFCS.2017.70},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BonamyDF0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BlancheD0LPZ17,
author = {Alexandre Blanch{\'{e}} and
Konrad K. Dabrowski and
Matthew Johnson and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma and
Viktor Zamaraev},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Clique-Width for Graph Classes Closed under Complementation},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {73:1--73:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.73},
doi = {10.4230/LIPICS.MFCS.2017.73},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlancheD0LPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/PaulusmaPR17,
author = {Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
editor = {T. V. Gopal and
Gerhard J{\"{a}}ger and
Silvia Steila},
title = {Blocking Independent Sets for H-Free Graphs via Edge Contractions
and Vertex Deletions},
booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
{TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10185},
pages = {470--483},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-55911-7\_34},
doi = {10.1007/978-3-319-55911-7\_34},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/PaulusmaPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DabrowskiLP17,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes},
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 = {220--233},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_17},
doi = {10.1007/978-3-319-68705-6\_17},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DabrowskiLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHKLP17,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth
at Most 2},
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 = {275--288},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_21},
doi = {10.1007/978-3-319-68705-6\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachHKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Golovach0MPS17,
author = {Petr A. Golovach and
Matthew Johnson and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Surjective H-Colouring: New Hardness Results},
journal = {CoRR},
volume = {abs/1701.02188},
year = {2017},
url = {http://arxiv.org/abs/1701.02188},
eprinttype = {arXiv},
eprint = {1701.02188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Golovach0MPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachHKLP17,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
title = {Algorithms for outerplanar graph roots and graph roots of pathwidth
at most 2},
journal = {CoRR},
volume = {abs/1703.05102},
year = {2017},
url = {http://arxiv.org/abs/1703.05102},
eprinttype = {arXiv},
eprint = {1703.05102},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachHKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlancheD0LPZ17,
author = {Alexandre Blanch{\'{e}} and
Konrad K. Dabrowski and
Matthew Johnson and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma and
Victor Zamaraev},
title = {Clique-Width for Graph Classes Closed under Complementation},
journal = {CoRR},
volume = {abs/1705.07681},
year = {2017},
url = {http://arxiv.org/abs/1705.07681},
eprinttype = {arXiv},
eprint = {1705.07681},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlancheD0LPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiP17,
author = {Konrad Kazimierz Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Contracting Bipartite Graphs to Paths and Cycles},
journal = {CoRR},
volume = {abs/1706.03750},
year = {2017},
url = {http://arxiv.org/abs/1706.03750},
eprinttype = {arXiv},
eprint = {1706.03750},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChiarelliH0MP17,
author = {Nina Chiarelli and
Tatiana Romina Hartinger and
Matthew Johnson and
Martin Milanic and
Dani{\"{e}}l Paulusma},
title = {Minimum Connected Transversals in Graphs: New Hardness Results and
Tractable Cases Using the Price of Connectivity},
journal = {CoRR},
volume = {abs/1706.08050},
year = {2017},
url = {http://arxiv.org/abs/1706.08050},
eprinttype = {arXiv},
eprint = {1706.08050},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChiarelliH0MP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaulusmaPR17,
author = {Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
title = {Critical Vertices and Edges in {\textdollar}H{\textdollar}-free Graphs},
journal = {CoRR},
volume = {abs/1706.09043},
year = {2017},
url = {http://arxiv.org/abs/1706.09043},
eprinttype = {arXiv},
eprint = {1706.09043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaulusmaPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinerPPR17,
author = {{\"{O}}znur Yasar Diner and
Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
title = {Contraction and Deletion Blockers for Perfect Graphs and {\textdollar}H{\textdollar}-free
Graphs},
journal = {CoRR},
volume = {abs/1706.09052},
year = {2017},
url = {http://arxiv.org/abs/1706.09052},
eprinttype = {arXiv},
eprint = {1706.09052},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinerPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonamyDF0P17,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent Feedback Vertex Sets for Graphs of Bounded Diameter},
journal = {CoRR},
volume = {abs/1707.09383},
year = {2017},
url = {http://arxiv.org/abs/1707.09383},
eprinttype = {arXiv},
eprint = {1707.09383},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonamyDF0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonamyDF0P17a,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent Feedback Vertex Set for {\textdollar}P{\_}5{\textdollar}-free
Graphs},
journal = {CoRR},
volume = {abs/1707.09402},
year = {2017},
url = {http://arxiv.org/abs/1707.09402},
eprinttype = {arXiv},
eprint = {1707.09402},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonamyDF0P17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonamyDF0P17b,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Recognizing Graphs Close to Bipartite Graphs with an Application to
Colouring Reconfiguration},
journal = {CoRR},
volume = {abs/1707.09817},
year = {2017},
url = {http://arxiv.org/abs/1707.09817},
eprinttype = {arXiv},
eprint = {1707.09817},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonamyDF0P17b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-09486,
author = {Beno{\^{\i}}t Larose and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {Surjective H-Colouring over Reflexive Digraphs},
journal = {CoRR},
volume = {abs/1709.09486},
year = {2017},
url = {http://arxiv.org/abs/1709.09486},
eprinttype = {arXiv},
eprint = {1709.09486},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-09486.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-08837,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
title = {Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes},
journal = {CoRR},
volume = {abs/1711.08837},
year = {2017},
url = {http://arxiv.org/abs/1711.08837},
eprinttype = {arXiv},
eprint = {1711.08837},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-08837.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-02447,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {On Colouring (2P\({}_{\mbox{2}}\), H)-Free and (P\({}_{\mbox{5}}\),
H)-Free Graphs},
journal = {CoRR},
volume = {abs/1712.02447},
year = {2017},
url = {http://arxiv.org/abs/1712.02447},
eprinttype = {arXiv},
eprint = {1712.02447},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-02447.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-08362,
author = {Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma},
title = {Connected Vertex Cover for (sP\({}_{\mbox{1}}\)+P\({}_{\mbox{5}}\))-Free
Graphs},
journal = {CoRR},
volume = {abs/1712.08362},
year = {2017},
url = {http://arxiv.org/abs/1712.08362},
eprinttype = {arXiv},
eprint = {1712.08362},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-08362.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Cochefert0GKP16,
author = {Manfred Cochefert and
Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {Parameterized Algorithms for Finding Square Roots},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {602--629},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9967-4},
doi = {10.1007/S00453-014-9967-4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Cochefert0GKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/0001KKPP16,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Finding Shortest Paths Between Graph Colourings},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {295--321},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0009-7},
doi = {10.1007/S00453-015-0009-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/0001KKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaulusmaSS16,
author = {Dani{\"{e}}l Paulusma and
Friedrich Slivovsky and
Stefan Szeider},
title = {Model Counting for {CNF} Formulas of Bounded Modular Treewidth},
journal = {Algorithmica},
volume = {76},
number = {1},
pages = {168--194},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0030-x},
doi = {10.1007/S00453-015-0030-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PaulusmaSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/DabrowskiP16,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs},
journal = {Comput. J.},
volume = {59},
number = {5},
pages = {650--666},
year = {2016},
url = {https://doi.org/10.1093/comjnl/bxv096},
doi = {10.1093/COMJNL/BXV096},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/DabrowskiP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DabrowskiP16,
author = {Konrad Kazimierz Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Classifying the clique-width of H-free bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {200},
pages = {43--51},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.030},
doi = {10.1016/J.DAM.2015.06.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DabrowskiP16.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/ejc/HartingerJMP16,
author = {Tatiana Romina Hartinger and
Matthew Johnson and
Martin Milanic and
Dani{\"{e}}l Paulusma},
title = {The price of connectivity for cycle transversals},
journal = {Eur. J. Comb.},
volume = {58},
pages = {203--224},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2016.06.003},
doi = {10.1016/J.EJC.2016.06.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HartingerJMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GolovachKPS16,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Squares of Low Clique Number},
journal = {Electron. Notes Discret. Math.},
volume = {55},
pages = {195--198},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.10.048},
doi = {10.1016/J.ENDM.2016.10.048},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GolovachKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DabrowskiGHP16,
author = {Konrad Kazimierz Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Editing to Eulerian graphs},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {2},
pages = {213--228},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2015.10.003},
doi = {10.1016/J.JCSS.2015.10.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DabrowskiGHP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FeghaliJP16,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {A Reconfigurations Analogue of Brooks' Theorem and Its Consequences},
journal = {J. Graph Theory},
volume = {83},
number = {4},
pages = {340--358},
year = {2016},
url = {https://doi.org/10.1002/jgt.22000},
doi = {10.1002/JGT.22000},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/FeghaliJP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KaminskiPST16,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Anthony Stewart and
Dimitrios M. Thilikos},
title = {Minimal disconnected cuts in planar graphs},
journal = {Networks},
volume = {68},
number = {4},
pages = {250--259},
year = {2016},
url = {https://doi.org/10.1002/net.21696},
doi = {10.1002/NET.21696},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KaminskiPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachPL16,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced disjoint paths in circular-arc graphs in linear time},
journal = {Theor. Comput. Sci.},
volume = {640},
pages = {70--83},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.06.003},
doi = {10.1016/J.TCS.2016.06.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachPL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/PaulusmaPR16,
author = {Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
editor = {Raffaele Cerulli and
Satoru Fujishige and
Ali Ridha Mahjoub},
title = {Reducing the Clique and Chromatic Number via Edge Contractions and
Vertex Deletions},
booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016,
Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9849},
pages = {38--49},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45587-7\_4},
doi = {10.1007/978-3-319-45587-7\_4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/PaulusmaPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/DabrowskiLP16,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {253--265},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_20},
doi = {10.1007/978-3-319-44543-4\_20},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/DabrowskiLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GolovachKPS16,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Finding Cactus Roots in Polynomial Time},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {361--372},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_28},
doi = {10.1007/978-3-319-44543-4\_28},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GolovachKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BonsmaP16,
author = {Paul S. Bonsma and
Dani{\"{e}}l Paulusma},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Using Contracted Solution Graphs for Solving Reconfiguration Problems},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {20:1--20:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.20},
doi = {10.4230/LIPICS.MFCS.2016.20},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BonsmaP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachKPS16,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
editor = {Rasmus Pagh},
title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.4},
doi = {10.4230/LIPICS.SWAT.2016.4},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DabrowskiDP16,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Dani{\"{e}}l Paulusma},
editor = {Rasmus Pagh},
title = {Colouring Diamond-free Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.16},
doi = {10.4230/LIPICS.SWAT.2016.16},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DabrowskiDP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AllisonP16,
author = {David Allison and
Dani{\"{e}}l Paulusma},
title = {New Bounds for the Snake-in-the-Box Problem},
journal = {CoRR},
volume = {abs/1603.05119},
year = {2016},
url = {http://arxiv.org/abs/1603.05119},
eprinttype = {arXiv},
eprint = {1603.05119},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AllisonP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlancheD0P16,
author = {Alexandre Blanch{\'{e}} and
Konrad Kazimierz Dabrowski and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Colouring on Hereditary Graph Classes Closed under Complementation},
journal = {CoRR},
volume = {abs/1607.06757},
year = {2016},
url = {http://arxiv.org/abs/1607.06757},
eprinttype = {arXiv},
eprint = {1607.06757},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlancheD0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachKPS16,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs},
journal = {CoRR},
volume = {abs/1608.06136},
year = {2016},
url = {http://arxiv.org/abs/1608.06136},
eprinttype = {arXiv},
eprint = {1608.06136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cochefert0GKPS16,
author = {Manfred Cochefert and
Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Squares of Low Maximum Degree},
journal = {CoRR},
volume = {abs/1608.06142},
year = {2016},
url = {http://arxiv.org/abs/1608.06142},
eprinttype = {arXiv},
eprint = {1608.06142},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cochefert0GKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiLP16,
author = {Konrad Kazimierz Dabrowski and
Vadim V. Lozin and
Dani{\"{e}}l Paulusma},
title = {Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes},
journal = {CoRR},
volume = {abs/1611.03671},
year = {2016},
url = {http://arxiv.org/abs/1611.03671},
eprinttype = {arXiv},
eprint = {1611.03671},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/0001GKP15,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {List Coloring in the Absence of a Linear Forest},
journal = {Algorithmica},
volume = {71},
number = {1},
pages = {21--35},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9777-0},
doi = {10.1007/S00453-013-9777-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/0001GKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHHMPP15,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Fredrik Manne and
Dani{\"{e}}l Paulusma and
Michal Pilipczuk},
title = {Modifying a Graph Using Vertex Elimination},
journal = {Algorithmica},
volume = {72},
number = {1},
pages = {99--125},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9848-2},
doi = {10.1007/S00453-013-9848-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHHMPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Huang0P15,
author = {Shenwei Huang and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Narrowing the Complexity Gap for Colouring (\emph{C\({}_{\mbox{s}}\),
P\({}_{\mbox{t}}\)})-Free Graphs},
journal = {Comput. J.},
volume = {58},
number = {11},
pages = {3074--3088},
year = {2015},
url = {https://doi.org/10.1093/comjnl/bxv039},
doi = {10.1093/COMJNL/BXV039},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cj/Huang0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachPR15,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Coloring graphs characterized by a forbidden subgraph},
journal = {Discret. Appl. Math.},
volume = {180},
pages = {101--110},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.08.008},
doi = {10.1016/J.DAM.2014.08.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/0002PS15,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
title = {Knocking out \({}_{\mbox{P}}\)\({}_{\mbox{k}}\)-free graphs},
journal = {Discret. Appl. Math.},
volume = {190-191},
pages = {100--108},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.04.010},
doi = {10.1016/J.DAM.2015.04.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/0002PS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Feghali0P15,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Kempe Equivalence of Colourings of Cubic Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {243--249},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.034},
doi = {10.1016/J.ENDM.2015.06.034},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/Feghali0P15.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/endm/0002LP15,
author = {Matthew Johnson and
Erik Jan van Leeuwen and
Dani{\"{e}}l Paulusma},
title = {What Graphs are 2-Dot Product Graphs?},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {705--711},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.095},
doi = {10.1016/J.ENDM.2015.06.095},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/0002LP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MartinP15,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {The computational complexity of disconnected cut and 2\({}_{\mbox{K2}}\)-partition},
journal = {J. Comb. Theory, Ser. {B}},
volume = {111},
pages = {17--37},
year = {2015},
url = {https://doi.org/10.1016/j.jctb.2014.09.002},
doi = {10.1016/J.JCTB.2014.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MartinP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaFGKPP15,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
journal = {J. Graph Theory},
volume = {79},
number = {4},
pages = {282--299},
year = {2015},
url = {https://doi.org/10.1002/jgt.21832},
doi = {10.1002/JGT.21832},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaFGKPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GolovachPL15,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths in Claw-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {348--375},
year = {2015},
url = {https://doi.org/10.1137/140963200},
doi = {10.1137/140963200},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/GolovachPL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/socnet/0002PL15,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Algorithms for diversity and clustering in social networks through
dot product graphs},
journal = {Soc. Networks},
volume = {41},
pages = {48--55},
year = {2015},
url = {https://doi.org/10.1016/j.socnet.2015.01.001},
doi = {10.1016/J.SOCNET.2015.01.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/socnet/0002PL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaplickFHPT15,
author = {Steven Chaplick and
Jir{\'{\i}} Fiala and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Marek Tesar},
title = {Locally constrained homomorphisms on graphs of bounded treewidth and
bounded degree},
journal = {Theor. Comput. Sci.},
volume = {590},
pages = {86--95},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.028},
doi = {10.1016/J.TCS.2015.01.028},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaplickFHPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DabrowskiP15,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {167--181},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_12},
doi = {10.1007/978-3-319-18173-8\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DabrowskiP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DinerPPR15,
author = {{\"{O}}znur Yasar Diner and
Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Contraction Blockers for Graphs with Forbidden Induced Paths},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {194--207},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_14},
doi = {10.1007/978-3-319-18173-8\_14},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DinerPPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/DabrowskiGHPT15,
author = {Konrad Kazimierz Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Lev D. Beklemishev and
Daniil V. Musatov},
title = {Editing to a Planar Graph of Given Degrees},
booktitle = {Computer Science - Theory and Applications - 10th International Computer
Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July
13-17, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9139},
pages = {143--156},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20297-6\_10},
doi = {10.1007/978-3-319-20297-6\_10},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/DabrowskiGHPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KaminskiPST15,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Anthony Stewart and
Dimitrios M. Thilikos},
editor = {Adrian Kosowski and
Igor Walukiewicz},
title = {Minimal Disconnected Cuts in Planar Graphs},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9210},
pages = {243--254},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22177-9\_19},
doi = {10.1007/978-3-319-22177-9\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/KaminskiPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/DabrowskiD0P15,
author = {Konrad Kazimierz Dabrowski and
Fran{\c{c}}ois Dross and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Filling the Complexity Gaps for Colouring Planar and Bounded Degree
Graphs},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {100--111},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_9},
doi = {10.1007/978-3-319-29516-9\_9},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/DabrowskiD0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/DabrowskiHP15,
author = {Konrad Kazimierz Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
editor = {Adrian{-}Horia Dediu and
Enrico Formenti and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Bounding Clique-Width via Perfect Graphs},
booktitle = {Language and Automata Theory and Applications - 9th International
Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8977},
pages = {676--688},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15579-1\_53},
doi = {10.1007/978-3-319-15579-1\_53},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/DabrowskiHP15.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/mfcs/Hartinger0MP15,
author = {Tatiana Romina Hartinger and
Matthew Johnson and
Martin Milanic and
Dani{\"{e}}l Paulusma},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {The Price of Connectivity for Cycle Transversals},
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 = {395--406},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_33},
doi = {10.1007/978-3-662-48054-0\_33},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Hartinger0MP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Paulusma15,
author = {Dani{\"{e}}l Paulusma},
editor = {Ernst W. Mayr},
title = {Open Problems on Graph Coloring for Special Graph Classes},
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 = {16--30},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_2},
doi = {10.1007/978-3-662-53174-7\_2},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Paulusma15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiroKPW15,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
editor = {Ernst W. Mayr},
title = {The Stable Fixtures Problem with Payments},
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 = {49--63},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_4},
doi = {10.1007/978-3-662-53174-7\_4},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BiroKPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Feghali0P15,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {A Reconfigurations Analogue of Brooks' Theorem and its Consequences},
journal = {CoRR},
volume = {abs/1501.05800},
year = {2015},
url = {http://arxiv.org/abs/1501.05800},
eprinttype = {arXiv},
eprint = {1501.05800},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Feghali0P15.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/Feghali0P15a,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Kempe Equivalence of Colourings of Cubic Graphs},
journal = {CoRR},
volume = {abs/1503.03430},
year = {2015},
url = {http://arxiv.org/abs/1503.03430},
eprinttype = {arXiv},
eprint = {1503.03430},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Feghali0P15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiDJP15,
author = {Konrad Kazimierz Dabrowski and
Fran{\c{c}}ois Dross and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Filling the Complexity Gaps for Colouring Planar and Bounded Degree
Graphs},
journal = {CoRR},
volume = {abs/1506.06564},
year = {2015},
url = {http://arxiv.org/abs/1506.06564},
eprinttype = {arXiv},
eprint = {1506.06564},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiDJP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiGHPT15,
author = {Konrad K. Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Editing to a Planar Graph of Given Degrees},
journal = {CoRR},
volume = {abs/1508.02773},
year = {2015},
url = {http://arxiv.org/abs/1508.02773},
eprinttype = {arXiv},
eprint = {1508.02773},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiGHPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiroKPW15,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
title = {The Stable Fixtures Problem with Payments},
journal = {CoRR},
volume = {abs/1508.06420},
year = {2015},
url = {http://arxiv.org/abs/1508.06420},
eprinttype = {arXiv},
eprint = {1508.06420},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BiroKPW15.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/BonsmaP15,
author = {Paul S. Bonsma and
Dani{\"{e}}l Paulusma},
title = {Using Contracted Solution Graphs for Solving Reconfiguration Problems},
journal = {CoRR},
volume = {abs/1509.06357},
year = {2015},
url = {http://arxiv.org/abs/1509.06357},
eprinttype = {arXiv},
eprint = {1509.06357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonsmaP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelmonteHKP15,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Jakub Kaminski and
Dani{\"{e}}l Paulusma},
title = {The Price of Connectivity for Feedback Vertex Set},
journal = {CoRR},
volume = {abs/1510.02639},
year = {2015},
url = {http://arxiv.org/abs/1510.02639},
eprinttype = {arXiv},
eprint = {1510.02639},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelmonteHKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002PL15,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {What Graphs are 2-Dot Product Graphs?},
journal = {CoRR},
volume = {abs/1511.05009},
year = {2015},
url = {http://arxiv.org/abs/1511.05009},
eprinttype = {arXiv},
eprint = {1511.05009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0002PL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiDP15,
author = {Konrad Kazimierz Dabrowski and
Fran{\c{c}}ois Dross and
Dani{\"{e}}l Paulusma},
title = {Narrowing the gap in the clique-width dichotomy for {\textdollar}(H{\_}1,
H{\_}2){\textdollar}-free graphs},
journal = {CoRR},
volume = {abs/1512.07849},
year = {2015},
url = {http://arxiv.org/abs/1512.07849},
eprinttype = {arXiv},
eprint = {1512.07849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiDP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BelmonteGHP14,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Parameterized complexity of three edge contraction problems with degree
constraints},
journal = {Acta Informatica},
volume = {51},
number = {7},
pages = {473--497},
year = {2014},
url = {https://doi.org/10.1007/s00236-014-0204-z},
doi = {10.1007/S00236-014-0204-Z},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BelmonteGHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteGHHKP14,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting Fixed Patterns in Chordal Graphs in Polynomial Time},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {501--521},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9748-5},
doi = {10.1007/S00453-013-9748-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteGHHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachP14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma},
title = {List coloring in the absence of two subgraphs},
journal = {Discret. Appl. Math.},
volume = {166},
pages = {123--130},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.10.010},
doi = {10.1016/J.DAM.2013.10.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachPS14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Coloring graphs without short cycles and long induced paths},
journal = {Discret. Appl. Math.},
volume = {167},
pages = {107--120},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.12.008},
doi = {10.1016/J.DAM.2013.12.008},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChalopinP14,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Dani{\"{e}}l Paulusma},
title = {Packing bipartite graphs with covers of complete bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {40--50},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2012.08.026},
doi = {10.1016/J.DAM.2012.08.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChalopinP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GolovachPKT14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Marcin Kaminski and
Dimitrios M. Thilikos},
title = {Lift-contractions},
journal = {Eur. J. Comb.},
volume = {35},
pages = {286--296},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2013.06.026},
doi = {10.1016/J.EJC.2013.06.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GolovachPKT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GolovachPS14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Closing complexity gaps for coloring problems on H-free graphs},
journal = {Inf. Comput.},
volume = {237},
pages = {204--214},
year = {2014},
url = {https://doi.org/10.1016/j.ic.2014.02.004},
doi = {10.1016/J.IC.2014.02.004},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GolovachPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bonamy0LPP14,
author = {Marthe Bonamy and
Matthew Johnson and
Ioannis Lignos and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Reconfiguration graphs for vertex colourings of chordal and chordal
bipartite graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {132--143},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9490-y},
doi = {10.1007/S10878-012-9490-Y},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bonamy0LPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/0002PPT14,
author = {Matthew Johnson and
Viresh Patel and
Dani{\"{e}}l Paulusma and
Th{\'{e}}ophile Trunck},
title = {Obtaining Online Ecological Colourings by Generalizing First-Fit},
journal = {Theory Comput. Syst.},
volume = {54},
number = {2},
pages = {244--260},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9513-9},
doi = {10.1007/S00224-013-9513-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/0002PPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DabrowskiGP14,
author = {Konrad K. Dabrowski and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
title = {Colouring of graphs with Ramsey-type forbidden subgraphs},
journal = {Theor. Comput. Sci.},
volume = {522},
pages = {34--43},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.12.004},
doi = {10.1016/J.TCS.2013.12.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DabrowskiGP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiroBGKP14,
author = {P{\'{e}}ter Bir{\'{o}} and
Matthijs Bomhoff and
Petr A. Golovach and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Solutions for the stable roommates problem with payments},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {53--61},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.03.027},
doi = {10.1016/J.TCS.2013.03.027},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiroBGKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/Huang0P14,
author = {Shenwei Huang and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Qianping Gu and
Pavol Hell and
Boting Yang},
title = {Narrowing the Complexity Gap for Colouring {(C} s , {P} t )-Free Graphs},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8546},
pages = {162--173},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07956-1\_15},
doi = {10.1007/978-3-319-07956-1\_15},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/Huang0P14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DabrowskiP14,
author = {Konrad Kazimierz Dabrowski and
Dani{\"{e}}l Paulusma},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Classifying the Clique-Width of H-Free Bipartite Graphs},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {489--500},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_42},
doi = {10.1007/978-3-319-08783-2\_42},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DabrowskiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DabrowskiGHP14,
author = {Konrad Kazimierz Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Editing to Eulerian Graphs},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {97--108},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.97},
doi = {10.4230/LIPICS.FSTTCS.2014.97},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DabrowskiGHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/0002KKPP14,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Finding Shortest Paths Between Graph Colourings},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {221--233},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_19},
doi = {10.1007/978-3-319-13524-3\_19},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/0002KKPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BelmonteHKP14,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Jakub Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Forbidden Induced Subgraphs and the Price of Connectivity for Feedback
Vertex Set},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {57--68},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_6},
doi = {10.1007/978-3-662-44465-8\_6},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BelmonteHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FeghaliJP14,
author = {Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {A Reconfigurations Analogue of Brooks' Theorem},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {287--298},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_25},
doi = {10.1007/978-3-662-44465-8\_25},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FeghaliJP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JohnsonPS14,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Knocking Out {P} k -free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {396--407},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_34},
doi = {10.1007/978-3-662-44465-8\_34},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/JohnsonPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachPL14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time},
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 = {225--237},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_19},
doi = {10.1007/978-3-319-12340-0\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachPL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiP14,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Classifying the Clique-Width of {\textdollar}H{\textdollar}-Free Bipartite
Graphs},
journal = {CoRR},
volume = {abs/1402.7060},
year = {2014},
url = {http://arxiv.org/abs/1402.7060},
eprinttype = {arXiv},
eprint = {1402.7060},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachPL14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time},
journal = {CoRR},
volume = {abs/1403.0789},
year = {2014},
url = {http://arxiv.org/abs/1403.0789},
eprinttype = {arXiv},
eprint = {1403.0789},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachPL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002KKPP14,
author = {Matthew Johnson and
Dieter Kratsch and
Stefan Kratsch and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {Colouring Reconfiguration Is Fixed-Parameter Tractable},
journal = {CoRR},
volume = {abs/1403.6347},
year = {2014},
url = {http://arxiv.org/abs/1403.6347},
eprinttype = {arXiv},
eprint = {1403.6347},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0002KKPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiP14a,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs},
journal = {CoRR},
volume = {abs/1405.7092},
year = {2014},
url = {http://arxiv.org/abs/1405.7092},
eprinttype = {arXiv},
eprint = {1405.7092},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiHP14,
author = {Konrad K. Dabrowski and
Shenwei Huang and
Dani{\"{e}}l Paulusma},
title = {Bounding Clique-Width via Perfect Graphs},
journal = {CoRR},
volume = {abs/1406.6298},
year = {2014},
url = {http://arxiv.org/abs/1406.6298},
eprinttype = {arXiv},
eprint = {1406.6298},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Huang0P14,
author = {Shenwei Huang and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Narrowing the Complexity Gap for Colouring ({\textdollar}C{\_}s{\textdollar},
{\textdollar}P{\_}t{\textdollar})-Free Graphs},
journal = {CoRR},
volume = {abs/1407.1480},
year = {2014},
url = {http://arxiv.org/abs/1407.1480},
eprinttype = {arXiv},
eprint = {1407.1480},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Huang0P14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Golovach0PS14,
author = {Petr A. Golovach and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {A Survey on the Computational Complexity of Colouring Graphs with
Forbidden Subgraphs},
journal = {CoRR},
volume = {abs/1407.1482},
year = {2014},
url = {http://arxiv.org/abs/1407.1482},
eprinttype = {arXiv},
eprint = {1407.1482},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/Golovach0PS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChaplickFHPT14,
author = {Steven Chaplick and
Jir{\'{\i}} Fiala and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Marek Tesar},
title = {Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and
Bounded Degree},
journal = {CoRR},
volume = {abs/1408.6676},
year = {2014},
url = {http://arxiv.org/abs/1408.6676},
eprinttype = {arXiv},
eprint = {1408.6676},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChaplickFHPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DabrowskiGHP14,
author = {Konrad K. Dabrowski and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Editing to Eulerian Graphs},
journal = {CoRR},
volume = {abs/1410.6863},
year = {2014},
url = {http://arxiv.org/abs/1410.6863},
eprinttype = {arXiv},
eprint = {1410.6863},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DabrowskiGHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaFHP13,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {129--145},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9576-4},
doi = {10.1007/S00453-011-9576-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaFHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachPS13,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {4-coloring H-free graphs when {H} is small},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {140--150},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.022},
doi = {10.1016/J.DAM.2012.08.022},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHKPT13,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Characterizing graphs of small carving-width},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1888--1893},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.036},
doi = {10.1016/J.DAM.2013.02.036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHKPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/FialaKP13,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {A note on contracting claw-free graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {15},
number = {2},
pages = {223--232},
year = {2013},
url = {https://doi.org/10.46298/dmtcs.605},
doi = {10.46298/DMTCS.605},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/FialaKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BroersmaFGP13,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
title = {Three complexity results on coloring Pk-free graphs},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {609--619},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2011.12.008},
doi = {10.1016/J.EJC.2011.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BroersmaFGP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolovachHHP13,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Choosability on H-free graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {107--110},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.003},
doi = {10.1016/J.IPL.2012.12.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolovachHHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachHP13,
author = {Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Obtaining planarity by contracting few edges},
journal = {Theor. Comput. Sci.},
volume = {476},
pages = {38--46},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.041},
doi = {10.1016/J.TCS.2012.12.041},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GolovachHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKPT13,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Increasing the minimum degree of a graph by contractions},
journal = {Theor. Comput. Sci.},
volume = {481},
pages = {74--84},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.02.030},
doi = {10.1016/J.TCS.2013.02.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OrdyniakPS13,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Satisfiability of acyclic and almost acyclic {CNF} formulas},
journal = {Theor. Comput. Sci.},
volume = {481},
pages = {85--99},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.039},
doi = {10.1016/J.TCS.2012.12.039},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/OrdyniakPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKP13,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {Detecting induced minors in AT-free graphs},
journal = {Theor. Comput. Sci.},
volume = {482},
pages = {20--32},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.02.029},
doi = {10.1016/J.TCS.2013.02.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GolovachP13,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {List Coloring in the Absence of Two Subgraphs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {288--299},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_24},
doi = {10.1007/978-3-642-38233-8\_24},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GolovachP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ChaplickFHPT13,
author = {Steven Chaplick and
Jir{\'{\i}} Fiala and
Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Marek Tesar},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and
Bounded Degree},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {121--132},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_14},
doi = {10.1007/978-3-642-40164-0\_14},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fct/ChaplickFHPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0002PL13,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Algorithms to Measure Diversity and Clustering in Social Networks
through Dot Product Graphs},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {130--140},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_13},
doi = {10.1007/978-3-642-45030-3\_13},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/0002PL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GolovachPS13,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Graph Editing to a Fixed Target},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {192--205},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_17},
doi = {10.1007/978-3-642-45278-9\_17},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GolovachPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BelmonteGHP13,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Parameterized Complexity of Two Edge Contraction Problems with Degree
Constraints},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {16--27},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_3},
doi = {10.1007/978-3-319-03898-8\_3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BelmonteGHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PaulusmaSS13,
author = {Dani{\"{e}}l Paulusma and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Natacha Portier and
Thomas Wilke},
title = {Model Counting for {CNF} Formulas of Bounded Modular Treewidth},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {55--66},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.55},
doi = {10.4230/LIPICS.STACS.2013.55},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/PaulusmaSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFGKPP13,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
booktitle = {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},
pages = {127--138},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_12},
doi = {10.1007/978-3-642-45043-3\_12},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFGKPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CochefertCGKP13,
author = {Manfred Cochefert and
Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Sparse Square Roots},
booktitle = {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},
pages = {177--188},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_16},
doi = {10.1007/978-3-642-45043-3\_16},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CochefertCGKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DabrowskiGP13,
author = {Konrad K. Dabrowski and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Colouring of Graphs with Ramsey-Type Forbidden Subgraphs},
booktitle = {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},
pages = {201--212},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_18},
doi = {10.1007/978-3-642-45043-3\_18},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DabrowskiGP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5953,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
journal = {CoRR},
volume = {abs/1301.5953},
year = {2013},
url = {http://arxiv.org/abs/1301.5953},
eprinttype = {arXiv},
eprint = {1301.5953},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5953.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CochefertCGKP13,
author = {Manfred Cochefert and
Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {Parameterized Algorithms for Finding Square Roots},
journal = {CoRR},
volume = {abs/1310.5469},
year = {2013},
url = {http://arxiv.org/abs/1310.5469},
eprinttype = {arXiv},
eprint = {1310.5469},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CochefertCGKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/GolovachLMP12,
author = {Petr A. Golovach and
Bernard Lidick{\'{y}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {Finding vertex-surjective graph homomorphisms},
journal = {Acta Informatica},
volume = {49},
number = {6},
pages = {381--394},
year = {2012},
url = {https://doi.org/10.1007/s00236-012-0164-0},
doi = {10.1007/S00236-012-0164-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/acta/GolovachLMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FialaKLP12,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {The k-in-a-Path Problem for Claw-free Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {499--519},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9468-z},
doi = {10.1007/S00453-010-9468-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FialaKLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HofKP12,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Finding Induced Paths of Given Parity in Claw-Free Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {537--563},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9470-5},
doi = {10.1007/S00453-010-9470-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HofKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachKPT12,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Containment relations in split graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {1-2},
pages = {155--163},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.10.004},
doi = {10.1016/J.DAM.2011.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaGKLP12,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {Distance three labelings of trees},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {764--779},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.02.004},
doi = {10.1016/J.DAM.2011.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaGKLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HofKPST12,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
title = {On graph contractions and induced minors},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {799--809},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2010.05.005},
doi = {10.1016/J.DAM.2010.05.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HofKPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/BiroKP12,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Computing solutions for matching games},
journal = {Int. J. Game Theory},
volume = {41},
number = {1},
pages = {75--90},
year = {2012},
url = {https://doi.org/10.1007/s00182-011-0273-y},
doi = {10.1007/S00182-011-0273-Y},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijgt/BiroKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/StewartPJ12,
author = {Iain A. Stewart and
Dani{\"{e}}l Paulusma and
Matthew Johnson},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {12},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.007},
doi = {10.1016/J.JDA.2011.08.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/StewartPJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HeggernesHP12,
author = {Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Computing role assignments of proper interval graphs in polynomial
time},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {173--188},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.004},
doi = {10.1016/J.JDA.2011.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HeggernesHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CouturierGKP12,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
title = {On the parameterized complexity of coloring graphs in the absence
of a linear forest},
journal = {J. Discrete Algorithms},
volume = {15},
pages = {56--62},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.008},
doi = {10.1016/J.JDA.2012.04.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CouturierGKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FialaKP12,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting induced star-like minors in polynomial time},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {74--85},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.002},
doi = {10.1016/J.JDA.2012.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FialaKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaGPS12,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Updating the complexity status of coloring graphs without a fixed
induced linear forest},
journal = {Theor. Comput. Sci.},
volume = {414},
number = {1},
pages = {9--19},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.10.005},
doi = {10.1016/J.TCS.2011.10.005},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKPT12,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Induced packing of odd cycles in planar graphs},
journal = {Theor. Comput. Sci.},
volume = {420},
pages = {28--35},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.11.004},
doi = {10.1016/J.TCS.2011.11.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaGPS12a,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Determining the chromatic number of triangle-free 2P\({}_{\mbox{3}}\)-free
graphs in polynomial time},
journal = {Theor. Comput. Sci.},
volume = {423},
pages = {1--10},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.12.076},
doi = {10.1016/J.TCS.2011.12.076},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachPS12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Computing vertex-surjective homomorphisms to partially reflexive trees},
journal = {Theor. Comput. Sci.},
volume = {457},
pages = {86--100},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.06.039},
doi = {10.1016/J.TCS.2012.06.039},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BelmonteHKPT12,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Guohui Lin},
title = {Characterizing Graphs of Small Carving-Width},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {360--370},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_32},
doi = {10.1007/978-3-642-31770-5\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BelmonteHKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GolovachLMP12,
author = {Petr A. Golovach and
Bernard Lidick{\'{y}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
editor = {Edward A. Hirsch and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Michail Kh. Prilutskii},
title = {Finding Vertex-Surjective Graph Homomorphisms},
booktitle = {Computer Science - Theory and Applications - 7th International Computer
Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
July 3-7, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7353},
pages = {160--171},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30642-6\_16},
doi = {10.1007/978-3-642-30642-6\_16},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/GolovachLMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GolovachPL12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Induced Disjoint Paths in Claw-Free Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {515--526},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_45},
doi = {10.1007/978-3-642-33090-2\_45},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GolovachPL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachPS12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Closing Complexity Gaps for Coloring Problems on H-Free Graphs},
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 = {14--23},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_5},
doi = {10.1007/978-3-642-35261-4\_5},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GolovachPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachKP12,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Detecting Induced Minors in AT-Free Graphs},
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 = {495--505},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_52},
doi = {10.1007/978-3-642-35261-4\_52},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolovachKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachPR12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Bernard Ries},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Coloring Graphs Characterized by a Forbidden Subgraph},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {443--454},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_40},
doi = {10.1007/978-3-642-32589-2\_40},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachHP12,
author = {Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Obtaining Planarity by Contracting Few Edges},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {455--466},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_41},
doi = {10.1007/978-3-642-32589-2\_41},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GolovachPS12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {M{\'{a}}ria Bielikov{\'{a}} and
Gerhard Friedrich and
Georg Gottlob and
Stefan Katzenbeisser and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {4-Coloring H-Free Graphs When {H} Is Small},
booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7147},
pages = {289--300},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27660-6\_24},
doi = {10.1007/978-3-642-27660-6\_24},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/GolovachPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachPL12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Induced Disjoint Paths in AT-Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {153--164},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_14},
doi = {10.1007/978-3-642-31155-0\_14},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachPL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiroBGKP12,
author = {P{\'{e}}ter Bir{\'{o}} and
Matthijs Bomhoff and
Petr A. Golovach and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Solutions for the Stable Roommates Problem with Payments},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {69--80},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_10},
doi = {10.1007/978-3-642-34611-8\_10},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BiroBGKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHHMPP12,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Fredrik Manne and
Dani{\"{e}}l Paulusma and
Michal Pilipczuk},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {How to Eliminate a Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {320--331},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_32},
doi = {10.1007/978-3-642-34611-8\_32},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachHHMPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4419,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Induced Disjoint Paths in Claw-Free Graphs},
journal = {CoRR},
volume = {abs/1202.4419},
year = {2012},
url = {http://arxiv.org/abs/1202.4419},
eprinttype = {arXiv},
eprint = {1202.4419},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-4419.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-2124,
author = {Petr A. Golovach and
Bernard Lidick{\'{y}} and
Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {Finding vertex-surjective graph homomorphisms},
journal = {CoRR},
volume = {abs/1204.2124},
year = {2012},
url = {http://arxiv.org/abs/1204.2124},
eprinttype = {arXiv},
eprint = {1204.2124},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-2124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-5113,
author = {Petr A. Golovach and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Obtaining Planarity by Contracting Few Edges},
journal = {CoRR},
volume = {abs/1204.5113},
year = {2012},
url = {http://arxiv.org/abs/1204.5113},
eprinttype = {arXiv},
eprint = {1204.5113},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-5113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoKPT11,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {On disconnected cuts and separators},
journal = {Discret. Appl. Math.},
volume = {159},
number = {13},
pages = {1345--1351},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.04.027},
doi = {10.1016/J.DAM.2011.04.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ItoKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BonamyJLPP11,
author = {Marthe Bonamy and
Matthew Johnson and
Ioannis Lignos and
Viresh Patel and
Dani{\"{e}}l Paulusma},
title = {On the diameter of reconfiguration graphs for vertex colourings},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {161--166},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.028},
doi = {10.1016/J.ENDM.2011.09.028},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BonamyJLPP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GolovachKPT11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Lift Contractions},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {407--412},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.066},
doi = {10.1016/J.ENDM.2011.09.066},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/GolovachKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KaminskiPT11,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Contracting planar graphs to contractions of triangulations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {299--306},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.010},
doi = {10.1016/J.JDA.2011.03.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KaminskiPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChalopinP11,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Dani{\"{e}}l Paulusma},
title = {Graph labelings derived from models in distributed computing: {A}
complete complexity classification},
journal = {Networks},
volume = {58},
number = {3},
pages = {207--231},
year = {2011},
url = {https://doi.org/10.1002/net.20432},
doi = {10.1002/NET.20432},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChalopinP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoKPT11,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Parameterizing cut sets in a graph by the number of their components},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6340--6350},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.005},
doi = {10.1016/J.TCS.2011.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaulusmaR11,
author = {Dani{\"{e}}l Paulusma and
Johan M. M. van Rooij},
title = {On partitioning a graph into two connected subgraphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6761--6769},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.001},
doi = {10.1016/J.TCS.2011.09.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaulusmaR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/MartinP11,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma},
editor = {Jimmy Ho{-}Man Lee},
title = {The Computational Complexity of Disconnected Cut and 2K 2-Partition},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2011 - 17th
International Conference, {CP} 2011, Perugia, Italy, September 12-16,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6876},
pages = {561--575},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23786-7\_43},
doi = {10.1007/978-3-642-23786-7\_43},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/MartinP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GolovachPS11,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {261--274},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_20},
doi = {10.1007/978-3-642-20712-9\_20},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/GolovachPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GolovachPS11,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Coloring Graphs without Short Cycles and Long Induced Paths},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {193--204},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_17},
doi = {10.1007/978-3-642-22953-4\_17},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fct/GolovachPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BelmonteGHHKP11,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Finding Contractions and Induced Minors in Chordal Graphs via Disjoint
Paths},
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 = {110--119},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_13},
doi = {10.1007/978-3-642-25591-5\_13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BelmonteGHHKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachKPT11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Increasing the Minimum Degree of a Graph by Contractions},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {67--79},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_6},
doi = {10.1007/978-3-642-28050-4\_6},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachKP11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Contracting a Chordal Graph to a Split Graph or a Tree},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {339--350},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_32},
doi = {10.1007/978-3-642-22993-0\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/OrdyniakPS11,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Karem A. Sakallah and
Laurent Simon},
title = {Satisfiability of Acyclic and almost Acyclic {CNF} Formulas {(II)}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6695},
pages = {47--60},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21581-0\_6},
doi = {10.1007/978-3-642-21581-0\_6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/OrdyniakPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CouturierGKP11,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {List Coloring in the Absence of a Linear Forest},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {119--130},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_12},
doi = {10.1007/978-3-642-25870-1\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CouturierGKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4279,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas {(II)}},
journal = {CoRR},
volume = {abs/1104.4279},
year = {2011},
url = {http://arxiv.org/abs/1104.4279},
eprinttype = {arXiv},
eprint = {1104.4279},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4779,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma},
title = {The Computational Complexity of Disconnected Cut and 2K2-Partition},
journal = {CoRR},
volume = {abs/1104.4779},
year = {2011},
url = {http://arxiv.org/abs/1104.4779},
eprinttype = {arXiv},
eprint = {1104.4779},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HofP10,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {A new characterization of P\({}_{\mbox{6}}\)-free graphs},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {731--740},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2008.08.025},
doi = {10.1016/J.DAM.2008.08.025},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HofP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JohnsonPW10,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Chantal Wood},
title = {Path factors and parallel knock-out schemes of almost claw-free graphs},
journal = {Discret. Math.},
volume = {310},
number = {9},
pages = {1413--1423},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.04.022},
doi = {10.1016/J.DISC.2009.04.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JohnsonPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaP10,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma},
title = {Computing sharp 2-factors in claw-free graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {321--329},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.001},
doi = {10.1016/J.JDA.2009.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FialaP10,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma},
title = {Comparing Universal Covers in Polynomial Time},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {620--635},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9200-z},
doi = {10.1007/S00224-009-9200-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FialaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HofPR10,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Johan M. M. van Rooij},
title = {Computing role assignments of chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {40-42},
pages = {3601--3613},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.05.041},
doi = {10.1016/J.TCS.2010.05.041},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HofPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChalopinP10,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Dani{\"{e}}l Paulusma},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Packing Bipartite Graphs with Covers of Complete Bipartite Graphs},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {276--287},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_25},
doi = {10.1007/978-3-642-13073-1\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChalopinP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JohnsonPPT10,
author = {Matthew Johnson and
Viresh Patel and
Dani{\"{e}}l Paulusma and
Th{\'{e}}ophile Trunck},
editor = {Farid M. Ablayev and
Ernst W. Mayr},
title = {Obtaining Online Ecological Colourings by Generalizing First-Fit},
booktitle = {Computer Science - Theory and Applications, 5th International Computer
Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6072},
pages = {240--251},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13182-0\_22},
doi = {10.1007/978-3-642-13182-0\_22},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/JohnsonPPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KaminskiPT10,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Contractions of Planar Graphs in Polynomial Time},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {122--133},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_11},
doi = {10.1007/978-3-642-15775-2\_11},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KaminskiPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/OrdyniakPS10,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {84--95},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.84},
doi = {10.4230/LIPICS.FSTTCS.2010.84},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/OrdyniakPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BroersmaGPS10,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {On Coloring Graphs without Induced Forests},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {156--167},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_14},
doi = {10.1007/978-3-642-17514-5\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BroersmaGPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HeggernesHP10,
author = {Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Computing Role Assignments of Proper Interval Graphs in Polynomial
Time},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {167--180},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_18},
doi = {10.1007/978-3-642-19222-7\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/HeggernesHP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HofKPST10,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {On Contracting Graphs to Fixed Pattern Graphs},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {503--514},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_42},
doi = {10.1007/978-3-642-11266-9\_42},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HofKPST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FialaKLP10,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {The k-in-a-path Problem for Claw-free Graphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {371--382},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2469},
doi = {10.4230/LIPICS.STACS.2010.2469},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FialaKLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BiroKP10,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {On Solution Concepts for Matching Games},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {117--127},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_12},
doi = {10.1007/978-3-642-13562-0\_12},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/BiroKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GolovachLP10,
author = {Petr A. Golovach and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {\emph{L}(2, 1, 1)-Labeling Is NP-Complete for Trees},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {211--221},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_20},
doi = {10.1007/978-3-642-13562-0\_20},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GolovachLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaGPS10,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Dimitrios M. Thilikos},
title = {Narrowing Down the Gap on the Complexity of Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {63--74},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_8},
doi = {10.1007/978-3-642-16926-7\_8},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BroersmaGPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-2460,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Contracting planar graphs to contractions of triangulations},
journal = {CoRR},
volume = {abs/1012.2460},
year = {2010},
url = {http://arxiv.org/abs/1012.2460},
eprinttype = {arXiv},
eprint = {1012.2460},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-2460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaFMPSY09,
author = {Haitze J. Broersma and
Jun Fujisawa and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman and
Kiyoshi Yoshimoto},
title = {lambda-backbone colorings along pairwise disjoint stars and matchings},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5596--5609},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.007},
doi = {10.1016/J.DISC.2008.04.007},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BroersmaFMPSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaMPS09,
author = {Hajo Broersma and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman},
title = {Backbone colorings along stars and matchings in split graphs: their
span is close to the chromatic number},
journal = {Discuss. Math. Graph Theory},
volume = {29},
number = {1},
pages = {143--162},
year = {2009},
url = {https://doi.org/10.7151/dmgt.1437},
doi = {10.7151/DMGT.1437},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BroersmaPY09,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {Sharp Upper Bounds on the Minimum Number of Components of 2-factors
in Claw-free Graphs},
journal = {Graphs Comb.},
volume = {25},
number = {4},
pages = {427--460},
year = {2009},
url = {https://doi.org/10.1007/s00373-009-0855-7},
doi = {10.1007/S00373-009-0855-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/BroersmaPY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KernP09,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {On the Core and \emph{f}-Nucleolus of Flow Games},
journal = {Math. Oper. Res.},
volume = {34},
number = {4},
pages = {981--991},
year = {2009},
url = {https://doi.org/10.1287/moor.1090.0405},
doi = {10.1287/MOOR.1090.0405},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KernP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaJP09,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Upper bounds and algorithms for parallel knock-out numbers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1319--1327},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.03.024},
doi = {10.1016/J.TCS.2008.03.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaJP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerMPS09,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Covering graphs with few complete bipartite subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2045--2053},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.059},
doi = {10.1016/J.TCS.2008.12.059},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HofPW09,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
title = {Partitioning graphs into connected parts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4834--4843},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.028},
doi = {10.1016/J.TCS.2009.06.028},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HofPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/HofPW09,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Partitioning Graphs into Connected Parts},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {143--154},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_15},
doi = {10.1007/978-3-642-03351-3\_15},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/HofPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HofPR09,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Johan M. M. van Rooij},
editor = {Miroslaw Kutylowski and
Witold Charatonik and
Maciej Gebala},
title = {Computing Role Assignments of Chordal Graphs},
booktitle = {Fundamentals of Computation Theory, 17th International Symposium,
{FCT} 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5699},
pages = {193--204},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03409-1\_18},
doi = {10.1007/978-3-642-03409-1\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HofPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachKPT09,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Induced Packing of Odd Cycles in a Planar Graph},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {514--523},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_53},
doi = {10.1007/978-3-642-10631-6\_53},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolovachKPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoKPT09,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Parameterizing Cut Sets in a Graph by the Number of Their Components},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {605--615},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_62},
doi = {10.1007/978-3-642-10631-6\_62},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ItoKPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/PaulusmaR09,
author = {Dani{\"{e}}l Paulusma and
Johan M. M. van Rooij},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {On Partitioning a Graph into Two Connected Subgraphs},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {1215--1224},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_122},
doi = {10.1007/978-3-642-10631-6\_122},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/PaulusmaR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BroersmaFGP09,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Three Complexity Results on Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free
Graphs},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {95--104},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_12},
doi = {10.1007/978-3-642-10217-2\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BroersmaFGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFHP09,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {44--53},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_4},
doi = {10.1007/978-3-642-11409-0\_4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HofKP09,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Finding Induced Paths of Given Parity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {341--352},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_30},
doi = {10.1007/978-3-642-11409-0\_30},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HofKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-5468,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {The k-in-a-path problem for claw-free graphs},
journal = {CoRR},
volume = {abs/0912.5468},
year = {2009},
url = {http://arxiv.org/abs/0912.5468},
eprinttype = {arXiv},
eprint = {0912.5468},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-5468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PaulusmaY08,
author = {Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {Relative length of longest paths and longest cycles in triangle-free
graphs},
journal = {Discret. Math.},
volume = {308},
number = {7},
pages = {1222--1229},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.03.070},
doi = {10.1016/J.DISC.2007.03.070},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PaulusmaY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FialaPT08,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
title = {Locally constrained graph homomorphisms and equitable partitions},
journal = {Eur. J. Comb.},
volume = {29},
number = {4},
pages = {850--880},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.11.006},
doi = {10.1016/J.EJC.2007.11.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FialaPT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LevinPW08,
author = {Asaf Levin and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
title = {The computational complexity of graph contractions {I:} Polynomially
solvable and NP-complete cases},
journal = {Networks},
volume = {51},
number = {3},
pages = {178--189},
year = {2008},
url = {https://doi.org/10.1002/net.20214},
doi = {10.1002/NET.20214},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LevinPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LevinPW08a,
author = {Asaf Levin and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
title = {The computational complexity of graph contractions {II:} Two tough
polynomially solvable cases},
journal = {Networks},
volume = {52},
number = {1},
pages = {32--56},
year = {2008},
url = {https://doi.org/10.1002/net.20249},
doi = {10.1002/NET.20249},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LevinPW08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BroersmaCP08,
author = {Hajo Broersma and
Agostino Capponi and
Dani{\"{e}}l Paulusma},
title = {A New Algorithm for On-line Coloring Bipartite Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {72--91},
year = {2008},
url = {https://doi.org/10.1137/060668675},
doi = {10.1137/060668675},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BroersmaCP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaJPS08,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
title = {The computational complexity of the parallel knock-out problem},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {182--195},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.11.021},
doi = {10.1016/J.TCS.2007.11.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaJPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HofP08,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Xiaodong Hu and
Jie Wang},
title = {A New Characterization of P6-Free Graphs},
booktitle = {Computing and Combinatorics, 14th Annual International Conference,
{COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5092},
pages = {415--424},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69733-6\_41},
doi = {10.1007/978-3-540-69733-6\_41},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HofP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/FialaP08,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma},
editor = {Edward A. Hirsch and
Alexander A. Razborov and
Alexei L. Semenov and
Anatol Slissenko},
title = {Comparing Universal Covers in Polynomial Time},
booktitle = {Computer Science - Theory and Applications, Third International Computer
Science Symposium in Russia, {CSR} 2008, Moscow, Russia, June 7-12,
2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5010},
pages = {158--167},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79709-8\_18},
doi = {10.1007/978-3-540-79709-8\_18},
timestamp = {Tue, 21 Mar 2023 21:00:47 +0100},
biburl = {https://dblp.org/rec/conf/csr/FialaP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/JohnsonPW08,
author = {Matthew Johnson and
Dani{\"{e}}l Paulusma and
Chantal Wood},
editor = {Mirka Miller and
Koichi Wada},
title = {Path factors and parallel knock-out schemes of almost claw-free graphs},
booktitle = {Proceedings of the 19th International Workshop on Combinatorial Algorithms,
{IWOCA} 2008, September 13-15, 2008, Nagoya, Japan},
pages = {27--41},
publisher = {College Publications},
year = {2008},
timestamp = {Fri, 19 Jan 2024 14:56:10 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/JohnsonPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BroersmaP08,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Computing Sharp 2-Factors in Claw-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {193--204},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_15},
doi = {10.1007/978-3-540-85238-4\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BroersmaP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2008,
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3},
doi = {10.1007/978-3-540-92248-3},
isbn = {978-3-540-92247-6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/PaulusmaY07,
author = {Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {Cycles through specified vertices in triangle-free graphs},
journal = {Discuss. Math. Graph Theory},
volume = {27},
number = {1},
pages = {179--191},
year = {2007},
url = {https://doi.org/10.7151/dmgt.1354},
doi = {10.7151/DMGT.1354},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/PaulusmaY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaPY07,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {On components of 2-factors in claw-free graphs},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {289--293},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.050},
doi = {10.1016/J.ENDM.2007.07.050},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaPY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FleischnerMPS07,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Covering Graphs with Few Complete Bipartite Subgraphs},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {340--351},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_28},
doi = {10.1007/978-3-540-77050-3\_28},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FleischnerMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BroersmaJP07,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Giuseppe Prencipe and
Shmuel Zaks},
title = {Upper Bounds and Algorithms for Parallel Knock-Out Numbers},
booktitle = {Structural Information and Communication Complexity, 14th International
Colloquium, {SIROCCO} 2007, Castiglioncello, Italy, June 5-8, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4474},
pages = {328--340},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72951-8\_26},
doi = {10.1007/978-3-540-72951-8\_26},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BroersmaJP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BroersmaMPS07,
author = {Hajo Broersma and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {Improved Upper Bounds for \emph{lambda} -Backbone Colorings Along
Matchings and Stars},
booktitle = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
on Current Trends in Theory and Practice of Computer Science, Harrachov,
Czech Republic, January 20-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {188--199},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_15},
doi = {10.1007/978-3-540-69507-3\_15},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BroersmaMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BroersmaCP06,
author = {Hajo Broersma and
Agostino Capponi and
Dani{\"{e}}l Paulusma},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On-Line Coloring of H-Free Bipartite Graphs},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {284--295},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_28},
doi = {10.1007/11758471\_28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BroersmaCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BroersmaJPS06,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {The Computational Complexity of the Parallel Knock-Out Problem},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {250--261},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_26},
doi = {10.1007/11682462\_26},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/BroersmaJPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChalopinP06,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Dani{\"{e}}l Paulusma},
editor = {Fedor V. Fomin},
title = {Graph Labelings Derived from Models in Distributed Computing},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {301--312},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_27},
doi = {10.1007/11917496\_27},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChalopinP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FialaP05,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma},
title = {A complete complexity classification of the role assignment problem},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {1},
pages = {67--81},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.029},
doi = {10.1016/J.TCS.2005.09.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FialaP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FialaPT05,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {340--351},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_30},
doi = {10.1007/11549345\_30},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FialaPT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaPT05,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
editor = {Dieter Kratsch},
title = {Algorithms for Comparability of Matrices in Partial Orders Imposed
by Graph Homomorphisms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {115--126},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_11},
doi = {10.1007/11604686\_11},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaPT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KernP04,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {The computational complexity of the elimination problem in generalized
sports competitions},
journal = {Discret. Optim.},
volume = {1},
number = {2},
pages = {205--214},
year = {2004},
url = {https://doi.org/10.1016/j.disopt.2003.12.003},
doi = {10.1016/J.DISOPT.2003.12.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KernP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fpt/SmitSHBPW04,
author = {Lodewijk T. Smit and
Gerard J. M. Smit and
Johann L. Hurink and
Hajo Broersma and
Dani{\"{e}}l Paulusma and
Pascal T. Wolkotte},
editor = {Oliver Diessel and
John Williams},
title = {Run-time mapping of applications to a heterogeneous reconfigurable
tiled system on chip architecture},
booktitle = {Proceedings of the 2004 {IEEE} International Conference on Field-Programmable
Technology, Brisbane, Australia, December 6-8, 2004},
pages = {421--424},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/FPT.2004.1393315},
doi = {10.1109/FPT.2004.1393315},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fpt/SmitSHBPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaPSVW04,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Gerard J. M. Smit and
Frank Vlaardingerbroek and
Gerhard J. Woeginger},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {The Computational Complexity of the Minimum Weight Processor Assignment
Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {189--200},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_16},
doi = {10.1007/978-3-540-30559-0\_16},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaPSVW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KernP03,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Matching Games: The Least Core and the Nucleolus},
journal = {Math. Oper. Res.},
volume = {28},
number = {2},
pages = {294--308},
year = {2003},
url = {https://doi.org/10.1287/moor.28.2.294.14477},
doi = {10.1287/MOOR.28.2.294.14477},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KernP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FialaP03,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {The Computational Complexity of the Role Assignment Problem},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {817--828},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_64},
doi = {10.1007/3-540-45061-0\_64},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FialaP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LevinPW03,
author = {Asaf Levin and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
editor = {Hans L. Bodlaender},
title = {The Complexity of Graph Contractions},
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 = {322--333},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_28},
doi = {10.1007/978-3-540-39890-5\_28},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LevinPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KernP01,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {The new {FIFA} rules are hard: complexity aspects of sports competitions},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {317--323},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00241-9},
doi = {10.1016/S0166-218X(00)00241-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KernP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/DriessenP01,
author = {Theo S. H. Driessen and
Dani{\"{e}}l Paulusma},
title = {Two extensions of the Shapley value for cooperative games},
journal = {Math. Methods Oper. Res.},
volume = {53},
number = {1},
pages = {35--49},
year = {2001},
url = {https://doi.org/10.1007/s001860000099},
doi = {10.1007/S001860000099},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/DriessenP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleKP00,
author = {Ulrich Faigle and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Note on the computational complexity of least core concepts for min-cost
spanning tree games},
journal = {Math. Methods Oper. Res.},
volume = {52},
number = {1},
pages = {23--38},
year = {2000},
url = {https://doi.org/10.1007/s001860000059},
doi = {10.1007/S001860000059},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/FaigleKP00.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-04-25 05:54 CEST 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:
