BibTeX records: Giacomo Paesani

download as .bib file

@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}
}
@inproceedings{DBLP:conf/aaai/DabrowskiEOPS24,
  author       = {Konrad K. Dabrowski and
                  Eduard Eiben and
                  Sebastian Ordyniak and
                  Giacomo Paesani and
                  Stefan Szeider},
  editor       = {Michael J. Wooldridge and
                  Jennifer G. Dy and
                  Sriraam Natarajan},
  title        = {Learning Small Decision Trees for Data of Low Rank-Width},
  booktitle    = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
                  2024, Thirty-Sixth Conference on Innovative Applications of Artificial
                  Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
                  in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
                  Canada},
  pages        = {10476--10483},
  publisher    = {{AAAI} Press},
  year         = {2024},
  url          = {https://doi.org/10.1609/aaai.v38i9.28916},
  doi          = {10.1609/AAAI.V38I9.28916},
  timestamp    = {Tue, 26 Mar 2024 17:04:05 +0100},
  biburl       = {https://dblp.org/rec/conf/aaai/DabrowskiEOPS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/OrdyniakPRS24,
  author       = {Sebastian Ordyniak and
                  Giacomo Paesani and
                  Mateusz Rychlicki and
                  Stefan Szeider},
  editor       = {Michael J. Wooldridge and
                  Jennifer G. Dy and
                  Sriraam Natarajan},
  title        = {A General Theoretical Framework for Learning Smallest Interpretable
                  Models},
  booktitle    = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
                  2024, Thirty-Sixth Conference on Innovative Applications of Artificial
                  Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
                  in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
                  Canada},
  pages        = {10662--10669},
  publisher    = {{AAAI} Press},
  year         = {2024},
  url          = {https://doi.org/10.1609/aaai.v38i9.28937},
  doi          = {10.1609/AAAI.V38I9.28937},
  timestamp    = {Tue, 26 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/aaai/OrdyniakPRS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/EibenOPS23,
  author       = {Eduard Eiben and
                  Sebastian Ordyniak and
                  Giacomo Paesani and
                  Stefan Szeider},
  title        = {Learning Small Decision Trees with Large Domain},
  booktitle    = {Proceedings of the Thirty-Second International Joint Conference on
                  Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
                  SAR, China},
  pages        = {3184--3192},
  publisher    = {ijcai.org},
  year         = {2023},
  url          = {https://doi.org/10.24963/ijcai.2023/355},
  doi          = {10.24963/IJCAI.2023/355},
  timestamp    = {Mon, 28 Aug 2023 17:23:07 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/EibenOPS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/OrdyniakPS23,
  author       = {Sebastian Ordyniak and
                  Giacomo Paesani and
                  Stefan Szeider},
  title        = {The Parameterized Complexity of Finding Concise Local Explanations},
  booktitle    = {Proceedings of the Thirty-Second International Joint Conference on
                  Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
                  SAR, China},
  pages        = {3312--3320},
  publisher    = {ijcai.org},
  year         = {2023},
  url          = {https://doi.org/10.24963/ijcai.2023/369},
  doi          = {10.24963/IJCAI.2023/369},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/OrdyniakPS23.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/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}
}
@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/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/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}
}
@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/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}
}
@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/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-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}
}
@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}
}
@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}
}
@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/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-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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics