Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Matthew Johnson 0002
@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 = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/DabrowskiJPPZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/Benedek0C0PY24,
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},
editor = {Mehdi Dastani and
Jaime Sim{\~{a}}o Sichman and
Natasha Alechina and
Virginia Dignum},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes when Cycle Length is Unbounded},
booktitle = {Proceedings of the 23rd International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2024, Auckland, New Zealand, May 6-10,
2024},
pages = {2153--2155},
publisher = {{ACM}},
year = {2024},
url = {https://dl.acm.org/doi/10.5555/3635637.3663091},
doi = {10.5555/3635637.3663091},
timestamp = {Fri, 03 May 2024 14:27:55 +0200},
biburl = {https://dblp.org/rec/conf/atal/Benedek0C0PY24.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}
}
@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}
}
@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-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/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/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 = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrettellJPP22.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-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/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/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/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 = {Tue, 07 May 2024 01:00:00 +0200},
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/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}
}
@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/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/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/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/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/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 = {Tue, 07 May 2024 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-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-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/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/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/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/jct/BonamyBFJ19,
author = {Marthe Bonamy and
Nicolas Bousquet and
Carl Feghali and
Matthew Johnson},
title = {On a conjecture of Mohar concerning Kempe equivalence of regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {135},
pages = {179--199},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.08.002},
doi = {10.1016/J.JCTB.2018.08.002},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BonamyBFJ19.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}
}
@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/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}
}
@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-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/dam/FeghaliJT18,
author = {Carl Feghali and
Matthew Johnson and
Daniel Thomas},
title = {Erd{\H{o}}s-Ko-Rado theorems for a family of trees},
journal = {Discret. Appl. Math.},
volume = {236},
pages = {464--471},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.10.009},
doi = {10.1016/J.DAM.2017.10.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FeghaliJT18.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/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}
}
@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 = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Dabrowski0PPZ18.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 = {Tue, 07 May 2024 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-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-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/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/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}
}
@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 = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BlancheD0LPZ17.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/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/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/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-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/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/comcom/MaskerNBLJ16,
author = {Markus M{\"{a}}sker and
Lars Nagel and
Andr{\'{e}} Brinkmann and
Foad Lotfifar and
Matthew Johnson},
title = {Smart Grid-aware scheduling in data centres},
journal = {Comput. Commun.},
volume = {96},
pages = {73--85},
year = {2016},
url = {https://doi.org/10.1016/j.comcom.2016.04.021},
doi = {10.1016/J.COMCOM.2016.04.021},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comcom/MaskerNBLJ16.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/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/corr/LotfifarJ16,
author = {Foad Lotfifar and
Matthew Johnson},
title = {A Serial Multilevel Hypergraph Partitioning Algorithm},
journal = {CoRR},
volume = {abs/1601.01336},
year = {2016},
url = {http://arxiv.org/abs/1601.01336},
eprinttype = {arXiv},
eprint = {1601.01336},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LotfifarJ16.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/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/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/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/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}
}
@inproceedings{DBLP:conf/europar/LotfifarJ15,
author = {Foad Lotfifar and
Matthew Johnson},
editor = {Jesper Larsson Tr{\"{a}}ff and
Sascha Hunold and
Francesco Versaci},
title = {A Multi-level Hypergraph Partitioning Algorithm Using Rough Set Clustering},
booktitle = {Euro-Par 2015: Parallel Processing - 21st International Conference
on Parallel and Distributed Computing, Vienna, Austria, August 24-28,
2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9233},
pages = {159--170},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48096-0\_13},
doi = {10.1007/978-3-662-48096-0\_13},
timestamp = {Sun, 12 Nov 2023 02:07:45 +0100},
biburl = {https://dblp.org/rec/conf/europar/LotfifarJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip6-3/MaskerNBLJ15,
author = {Markus M{\"{a}}sker and
Lars Nagel and
Andr{\'{e}} Brinkmann and
Foad Lotfifar and
Matthew Johnson},
title = {Smart grid-aware scheduling in data centres},
booktitle = {2015 Sustainable Internet and {ICT} for Sustainability, SustainIT
2015, Madrid, Spain, April 14-15, 2015},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/SustainIT.2015.7101362},
doi = {10.1109/SUSTAINIT.2015.7101362},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ifip6-3/MaskerNBLJ15.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/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}
}
@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/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/BonamyBF015,
author = {Marthe Bonamy and
Nicolas Bousquet and
Carl Feghali and
Matthew Johnson},
title = {On a conjecture of Mohar concerning Kempe equivalence of regular graphs},
journal = {CoRR},
volume = {abs/1510.06964},
year = {2015},
url = {http://arxiv.org/abs/1510.06964},
eprinttype = {arXiv},
eprint = {1510.06964},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonamyBF015.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/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}
}
@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/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/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}
}
@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/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}
}
@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}
}
@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/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/jgt/CerecedaHJ11,
author = {Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
title = {Finding paths between 3-colorings},
journal = {J. Graph Theory},
volume = {67},
number = {1},
pages = {69--82},
year = {2011},
url = {https://doi.org/10.1002/jgt.20514},
doi = {10.1002/JGT.20514},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CerecedaHJ11.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/BroersmaDJS10,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {101},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.003},
doi = {10.1016/J.JDA.2009.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS10.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}
}
@article{DBLP:journals/ejc/CerecedaHJ09,
author = {Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
title = {Mixing 3-colourings in bipartite graphs},
journal = {Eur. J. Comb.},
volume = {30},
number = {7},
pages = {1593--1606},
year = {2009},
url = {https://doi.org/10.1016/j.ejc.2009.03.011},
doi = {10.1016/J.EJC.2009.03.011},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/CerecedaHJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS09,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {147},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.002},
doi = {10.1016/J.JDA.2008.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS09.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/dm/CerecedaHJ08,
author = {Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
title = {Connectedness of the graph of vertex-colourings},
journal = {Discret. Math.},
volume = {308},
number = {5-6},
pages = {913--919},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.028},
doi = {10.1016/J.DISC.2007.07.028},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CerecedaHJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS08,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {539},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.005},
doi = {10.1016/J.JDA.2008.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HeuvelJ08,
author = {Jan van den Heuvel and
Matthew Johnson},
title = {Transversals of subtree hypergraphs and the source location problem
in digraphs},
journal = {Networks},
volume = {51},
number = {2},
pages = {113--119},
year = {2008},
url = {https://doi.org/10.1002/net.20206},
doi = {10.1002/NET.20206},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HeuvelJ08.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/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/iwoca/JohnsonCH08,
author = {Matthew Johnson and
Luis Cereceda and
Jan van den Heuvel},
editor = {Mirka Miller and
Koichi Wada},
title = {Finding Paths Between 3-Colourings},
booktitle = {Proceedings of the 19th International Workshop on Combinatorial Algorithms,
{IWOCA} 2008, September 13-15, 2008, Nagoya, Japan},
pages = {182--196},
publisher = {College Publications},
year = {2008},
timestamp = {Tue, 16 Apr 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/JohnsonCH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BonsmaCHJ07,
author = {Paul S. Bonsma and
Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
title = {Finding Paths between Graph Colourings: Computational Complexity and
Possible Distances},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {463--469},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.073},
doi = {10.1016/J.ENDM.2007.07.073},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BonsmaCHJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Johnson07a,
author = {Matthew Johnson},
title = {Amalgamations of factorizations of complete graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {4},
pages = {597--611},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2006.09.004},
doi = {10.1016/J.JCTB.2006.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Johnson07a.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/wg/CerecedaHJ07,
author = {Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Mixing 3-Colourings in Bipartite Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {166--177},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_17},
doi = {10.1007/978-3-540-74839-7\_17},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CerecedaHJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HiltonJ06,
author = {Anthony J. W. Hilton and
Matthew Johnson},
title = {Cycle decompositions of the complete graph},
journal = {Ars Comb.},
volume = {81},
year = {2006},
timestamp = {Tue, 16 Apr 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/HiltonJ06.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}
}
@proceedings{DBLP:conf/acid/2006,
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
publisher = {King's College, London},
year = {2006},
isbn = {1-904987-38-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2005,
editor = {Hajo Broersma and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2005 - Proceedings of the First
ACiD Workshop, 8-10 July 2005, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {4},
publisher = {King's College, London},
year = {2005},
isbn = {1-904987-10-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HiltonJ04,
author = {Anthony J. W. Hilton and
Matthew Johnson},
title = {Amalgamations of factorizations of complete equipartite graphs},
journal = {Discret. Math.},
volume = {284},
number = {1-3},
pages = {157--175},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.11.030},
doi = {10.1016/J.DISC.2003.11.030},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HiltonJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EslahchiJ04,
author = {Changiz Eslahchi and
Matthew Johnson},
title = {Characterization of graphs with hall number 2},
journal = {J. Graph Theory},
volume = {45},
number = {2},
pages = {81--100},
year = {2004},
url = {https://doi.org/10.1002/jgt.10154},
doi = {10.1002/JGT.10154},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EslahchiJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/HeuvelJ04,
author = {Jan van den Heuvel and
Matthew Johnson},
editor = {Alejandro L{\'{o}}pez{-}Ortiz and
Ang{\`{e}}le M. Hamel},
title = {The External Network Problem with Edge- or Arc-Connectivity Requirements},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, First Workshop
on Combinatorial and Algorithmic Aspects of Networking, {CAAN} 2004,
Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3405},
pages = {114--126},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11527954\_11},
doi = {10.1007/11527954\_11},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/caan/HeuvelJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BedfordJO03,
author = {David Bedford and
Matthew Johnson and
Matthew A. Ollis},
title = {Defining sets for Latin squares given that they are based on groups},
journal = {Eur. J. Comb.},
volume = {24},
number = {1},
pages = {129--135},
year = {2003},
url = {https://doi.org/10.1016/S0195-6698(02)00115-4},
doi = {10.1016/S0195-6698(02)00115-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BedfordJO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HiltonJRW03,
author = {Anthony J. W. Hilton and
Matthew Johnson and
Christopher A. Rodger and
Evan B. Wantland},
title = {Amalgamations of connected k-factorizations},
journal = {J. Comb. Theory, Ser. {B}},
volume = {88},
number = {2},
pages = {267--279},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(03)00030-3},
doi = {10.1016/S0095-8956(03)00030-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HiltonJRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HiltonJ03,
author = {Anthony J. W. Hilton and
Matthew Johnson},
title = {An algorithm for finding factorizations of complete graphs},
journal = {J. Graph Theory},
volume = {43},
number = {2},
pages = {132--136},
year = {2003},
url = {https://doi.org/10.1002/jgt.10109},
doi = {10.1002/JGT.10109},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HiltonJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/0002B01,
author = {Matthew Johnson and
David Bedford},
title = {Weak critical sets in cyclic Latin squares},
journal = {Australas. {J} Comb.},
volume = {23},
pages = {301},
year = {2001},
url = {http://ajc.maths.uq.edu.au/pdf/23/ocr-ajc-v23-p301.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/0002B01.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-05-09 00:02 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:
