references-pptale-github.bib

@article{AgrawalKST21,
  author    = {Akanksha Agrawal and
               Lawqueen Kanesh and
               Saket Saurabh and
               Prafullkumar Tale},
  title     = {Paths to trees and cacti},
  journal   = {Theor. Comput. Sci.},
  volume    = {860},
  pages     = {98--116},
  year      = {2021},
  url       = {https://doi.org/10.1016/j.tcs.2021.01.033},
  doi       = {10.1016/j.tcs.2021.01.033},
  timestamp = {Fri, 05 Mar 2021 16:01:08 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/AgrawalKST21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{LimaSSS21,
  author    = {Paloma T. Lima and
               Vin{\'{\i}}cius Fernandes dos Santos and
               Ignasi Sau and
               U{\'{e}}verton S. Souza},
  title     = {Reducing graph transversals via edge contractions},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {120},
  pages     = {62--74},
  year      = {2021},
  url       = {https://doi.org/10.1016/j.jcss.2021.03.003},
  doi       = {10.1016/j.jcss.2021.03.003},
  timestamp = {Tue, 13 Jul 2021 13:26:28 +0200},
  biburl    = {https://dblp.org/rec/journals/jcss/LimaSSS21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{AgrawalFLST20,
  author    = {Akanksha Agrawal and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Saket Saurabh and
               Prafullkumar Tale},
  title     = {Path Contraction Faster than 2\({}^{\mbox{n}}\)},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {34},
  number    = {2},
  pages     = {1302--1325},
  year      = {2020},
  url       = {https://doi.org/10.1137/19M1259638},
  doi       = {10.1137/19M1259638},
  timestamp = {Thu, 06 Aug 2020 21:48:09 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/AgrawalFLST20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@article{CrespelleDFG20,
  author    = {Christophe Crespelle and
               P{\aa}l Gr{\o}n{\aa}s Drange and
               Fedor V. Fomin and
               Petr A. Golovach},
  title     = {A survey of parameterized algorithms and the complexity of edge modification},
  journal   = {CoRR},
  volume    = {abs/2001.06867},
  year      = {2020},
  url       = {https://arxiv.org/abs/2001.06867},
  archivePrefix = {arXiv},
  eprint    = {2001.06867},
  timestamp = {Fri, 24 Jan 2020 15:00:57 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2001-06867.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Gunda0L0T20,
  author    = {Spoorthy Gunda and
               Pallavi Jain and
               Daniel Lokshtanov and
               Saket Saurabh and
               Prafullkumar Tale},
  title     = {On the Parameterized Approximability of Contraction to Classes of
               Chordal Graphs},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM}},
  series    = {LIPIcs},
  volume    = {176},
  pages     = {51:1--51:19},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.51},
  doi       = {10.4230/LIPIcs.APPROX/RANDOM.2020.51},
  timestamp = {Thu, 19 Nov 2020 15:52:36 +0100},
  biburl    = {https://dblp.org/rec/conf/approx/Gunda0L0T20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{SaurabhST20,
  author    = {Saket Saurabh and
               U{\'{e}}verton dos Santos Souza and
               Prafullkumar Tale},
  title     = {On the Parameterized Complexity of Grid Contraction},
  booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}},
  series    = {LIPIcs},
  volume    = {162},
  pages     = {34:1--34:17},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.SWAT.2020.34},
  doi       = {10.4230/LIPIcs.SWAT.2020.34},
  timestamp = {Fri, 12 Jun 2020 16:16:44 +0200},
  biburl    = {https://dblp.org/rec/conf/swat/0001ST20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@inproceedings{SaurabhT20,
  author    = {Saket Saurabh and
               Prafullkumar Tale},
  title     = {On the Parameterized Complexity of Maximum Degree Contraction Problem},
  booktitle = {15th International Symposium on Parameterized and Exact Computation, {IPEC}},
  series    = {LIPIcs},
  volume    = {180},
  pages     = {26:1--26:16},
  year      = {2020},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2020.26},
  doi       = {10.4230/LIPIcs.IPEC.2020.26},
  timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/0001T20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{AgrawalLSZ19,
  author    = {Akanksha Agrawal and
               Daniel Lokshtanov and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Split Contraction: The Untold Story},
  journal   = {{ACM} Trans. Comput. Theory},
  volume    = {11},
  number    = {3},
  pages     = {18:1--18:22},
  year      = {2019},
  url       = {https://doi.org/10.1145/3319909},
  doi       = {10.1145/3319909},
  timestamp = {Sat, 05 Sep 2020 17:44:52 +0200},
  biburl    = {https://dblp.org/rec/journals/toct/AgrawalLSZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@article{AgarwalST19,
  author    = {Akanksha Agrawal and
               Saket Saurabh and
               Prafullkumar Tale},
  title     = {On the Parameterized Complexity of Contraction to Generalization of Trees},
  journal   = {Theory Comput. Syst.},
  volume    = {63},
  number    = {3},
  pages     = {587--614},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00224-018-9892-z},
  doi       = {10.1007/s00224-018-9892-z},
  timestamp = {Mon, 16 Mar 2020 15:48:19 +0100},
  biburl    = {https://dblp.org/rec/journals/mst/AgarwalST19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{LokshtanovMS18,
  author    = {Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Saket Saurabh},
  title     = {Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {13:1--13:30},
  year      = {2018},
  url       = {https://doi.org/10.1145/3170442},
  doi       = {10.1145/3170442},
  timestamp = {Wed, 21 Nov 2018 12:44:28 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovMS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{KrithikaMT18,
  author    = {R. Krithika and
               Pranabendu Misra and
               Prafullkumar Tale},
  title     = {An {FPT} Algorithm for Contraction to Cactus},
  booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}},
  series    = {Lecture Notes in Computer Science},
  volume    = {10976},
  pages     = {341--352},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-94776-1\_29},
  doi       = {10.1007/978-3-319-94776-1\_29},
  timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoon/0001MT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{KrithikaMRT16,
  author    = {R. Krithika and
               Pranabendu Misra and
               Ashutosh Rai and
               Prafullkumar Tale},
  title     = {Lossy Kernels for Graph Contraction Problems},
  booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS}},
  series    = {LIPIcs},
  volume    = {65},
  pages     = {23:1--23:14},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.23},
  doi       = {10.4230/LIPIcs.FSTTCS.2016.23},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/fsttcs/KrithikaM0T16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{BelmonteGHP14,
  author    = {R{\'{e}}my Belmonte and
               Petr A. Golovach and
               Pim van 't Hof and
               Dani{\"{e}}l Paulusma},
  title     = {Parameterized complexity of three edge contraction problems with degree
               constraints},
  journal   = {Acta Informatica},
  volume    = {51},
  number    = {7},
  pages     = {473--497},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00236-014-0204-z},
  doi       = {10.1007/s00236-014-0204-z},
  timestamp = {Mon, 26 Oct 2020 08:23:37 +0100},
  biburl    = {https://dblp.org/rec/journals/acta/BelmonteGHP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{BodlaenderHL14,
  author    = {Hans L. Bodlaender and
               Pinar Heggernes and
               Daniel Lokshtanov},
  title     = {Graph Modification Problems (Dagstuhl Seminar 14071)},
  journal   = {Dagstuhl Reports},
  volume    = {4},
  number    = {2},
  pages     = {38--59},
  year      = {2014},
  url       = {https://doi.org/10.4230/DagRep.4.2.38},
  doi       = {10.4230/DagRep.4.2.38},
  timestamp = {Wed, 07 Jun 2017 14:40:01 +0200},
  biburl    = {https://dblp.org/rec/journals/dagstuhl-reports/BodlaenderHL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{HeggernesHLLP14,
  author    = {Pinar Heggernes and
               Pim van 't Hof and
               Benjamin L{\'{e}}v{\^{e}}que and
               Daniel Lokshtanov and
               Christophe Paul},
  title     = {Contracting Graphs to Paths and Trees},
  journal   = {Algorithmica},
  volume    = {68},
  number    = {1},
  pages     = {109--132},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00453-012-9670-2},
  doi       = {10.1007/s00453-012-9670-2},
  timestamp = {Mon, 06 Nov 2017 12:13:07 +0100},
  biburl    = {https://dblp.org/rec/journals/algorithmica/HeggernesHLLP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{CaiG13,
  author    = {Leizhen Cai and
               Chengwei Guo},
  title     = {Contracting Few Edges to Remove Forbidden Induced Subgraphs},
  booktitle = {Parameterized and Exact Computation - 8th International Symposium, {IPEC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8246},
  pages     = {97--109},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-319-03898-8\_10},
  doi       = {10.1007/978-3-319-03898-8\_10},
  biburl    = {https://dblp.org/rec/conf/iwpec/CaiG13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@inproceedings{LokshtanovMS13,
  author    = {Daniel Lokshtanov and
               Neeldhara Misra and
               Saket Saurabh},
  title     = {On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges},
  booktitle = {Parameterized and Exact Computation - 8th International Symposium, {IPEC}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8246},
  pages     = {243--254},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-319-03898-8\_21},
  doi       = {10.1007/978-3-319-03898-8\_21},
  biburl    = {https://dblp.org/rec/conf/iwpec/LokshtanovMS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@article{AsanoH83,
  author    = {Takao Asano and
               Tomio Hirata},
  title     = {Edge-Contraction Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {26},
  number    = {2},
  pages     = {197--208},
  year      = {1983},
  url       = {https://doi.org/10.1016/0022-0000(83)90012-0},
  doi       = {10.1016/0022-0000(83)90012-0},
  timestamp = {Tue, 16 Feb 2021 14:04:01 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/AsanoH83.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@article{WatanabeAN83,
  author    = {Toshimasa Watanabe and
               Tadashi Ae and
               Akira Nakamura},
  title     = {On the {NP}-hardness of edge-deletion and -contraction problems},
  journal   = {Discret. Appl. Math.},
  volume    = {6},
  number    = {1},
  pages     = {63--78},
  year      = {1983},
  url       = {https://doi.org/10.1016/0166-218X(83)90101-4},
  doi       = {10.1016/0166-218X(83)90101-4},
  timestamp = {Thu, 11 Feb 2021 23:20:47 +0100},
  biburl    = {https://dblp.org/rec/journals/dam/WatanabeAN83.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{WatanabeAN81,
  author    = {Toshimasa Watanabe and
               Tadashi Ae and
               Akira Nakamura},
  title     = {On the removal of forbidden graphs by edge-deletion or by edge-contraction},
  journal   = {Discret. Appl. Math.},
  volume    = {3},
  number    = {2},
  pages     = {151--153},
  year      = {1981},
  url       = {https://doi.org/10.1016/0166-218X(81)90039-1},
  doi       = {10.1016/0166-218X(81)90039-1},
  timestamp = {Thu, 11 Feb 2021 23:22:56 +0100},
  biburl    = {https://dblp.org/rec/journals/dam/WatanabeAN81.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@article{LewisY80,
  author    = {John M. Lewis and
               Mihalis Yannakakis},
  title     = {The Node-Deletion Problem for Hereditary Properties is {NP}-Complete},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {20},
  number    = {2},
  pages     = {219--230},
  year      = {1980},
  url       = {https://doi.org/10.1016/0022-0000(80)90060-4},
  doi       = {10.1016/0022-0000(80)90060-4},
  timestamp = {Tue, 16 Feb 2021 14:03:52 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/LewisY80.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@inproceedings{Yannakakis78Node,
  author    = {Mihalis Yannakakis},
  title     = {Node- and Edge-Deletion {NP}-Complete Problems},
  booktitle = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing (STOC)},
  pages     = {253--264},
  publisher = {{ACM}},
  year      = {1978},
  url       = {https://doi.org/10.1145/800133.804355},
  doi       = {10.1145/800133.804355},
  timestamp = {Wed, 14 Nov 2018 10:51:37 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/Yannakakis78.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}