Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Petr A. Golovach
@article{DBLP:journals/ipl/FominGIK24, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Tomohiro Koana}, title = {{FPT} approximation and subexponential algorithms for covering few or many edges}, journal = {Inf. Process. Lett.}, volume = {185}, pages = {106471}, year = {2024}, url = {https://doi.org/10.1016/j.ipl.2024.106471}, doi = {10.1016/J.IPL.2024.106471}, timestamp = {Fri, 08 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/FominGIK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/FominGPPS24, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Geevarghese Philip and Saket Saurabh}, title = {Diverse collections in matroids and graphs}, journal = {Math. Program.}, volume = {204}, number = {1}, pages = {415--447}, year = {2024}, url = {https://doi.org/10.1007/s10107-023-01959-z}, doi = {10.1007/S10107-023-01959-Z}, timestamp = {Fri, 22 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/FominGPPS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/FominGKLS24, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Daniel Lokshtanov and Giannos Stamoulis}, title = {Shortest Cycles with Monotone Submodular Costs}, journal = {{ACM} Trans. Algorithms}, volume = {20}, number = {1}, pages = {2:1--2:16}, year = {2024}, url = {https://doi.org/10.1145/3626824}, doi = {10.1145/3626824}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/FominGKLS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-15348, author = {Matthias Bentert and Fedor V. Fomin and Petr A. Golovach}, title = {Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths}, journal = {CoRR}, volume = {abs/2402.15348}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.15348}, doi = {10.48550/ARXIV.2402.15348}, eprinttype = {arXiv}, eprint = {2402.15348}, timestamp = {Fri, 22 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-15348.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/BandyapadhyayFGLPS23, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov}, title = {How to find a good explanation for clustering?}, journal = {Artif. Intell.}, volume = {322}, pages = {103948}, year = {2023}, url = {https://doi.org/10.1016/j.artint.2023.103948}, doi = {10.1016/J.ARTINT.2023.103948}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/BandyapadhyayFGLPS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/csr/CrespelleDFG23, 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 = {Comput. Sci. Rev.}, volume = {48}, pages = {100556}, year = {2023}, url = {https://doi.org/10.1016/j.cosrev.2023.100556}, doi = {10.1016/J.COSREV.2023.100556}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/csr/CrespelleDFG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FominGT23, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs}, journal = {Inf. Comput.}, volume = {293}, pages = {105049}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105049}, doi = {10.1016/J.IC.2023.105049}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FominGT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominGP23, author = {Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit}, title = {Parameterized complexity of categorical clustering with size constraints}, journal = {J. Comput. Syst. Sci.}, volume = {136}, pages = {171--194}, year = {2023}, url = {https://doi.org/10.1016/j.jcss.2023.03.006}, doi = {10.1016/J.JCSS.2023.03.006}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominGP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominGLSSS23, author = {Fedor V. Fomin and Petr A. Golovach and William Lochet and Danil Sagunov and Saket Saurabh and Kirill Simonov}, title = {Detours in directed graphs}, journal = {J. Comput. Syst. Sci.}, volume = {137}, pages = {66--86}, year = {2023}, url = {https://doi.org/10.1016/j.jcss.2023.05.001}, doi = {10.1016/J.JCSS.2023.05.001}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominGLSSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BandyapadhyayFGPS23, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit and Kirill Simonov}, title = {Lossy Kernelization of Same-Size Clustering}, journal = {Theory Comput. Syst.}, volume = {67}, number = {4}, pages = {785--824}, year = {2023}, url = {https://doi.org/10.1007/s00224-023-10129-9}, doi = {10.1007/S00224-023-10129-9}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/BandyapadhyayFGPS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GolovachST23, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {Combing a Linkage in an Annulus}, journal = {{SIAM} J. Discret. Math.}, volume = {37}, number = {4}, pages = {2332--2364}, year = {2023}, url = {https://doi.org/10.1137/22m150914x}, doi = {10.1137/22M150914X}, timestamp = {Fri, 03 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/GolovachST23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/GolovachST23, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable}, journal = {{ACM} Trans. Algorithms}, volume = {19}, number = {3}, pages = {23:1--23:29}, year = {2023}, url = {https://doi.org/10.1145/3583688}, doi = {10.1145/3583688}, timestamp = {Fri, 18 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/GolovachST23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/SamFRG23, author = {Emmanuel Sam and Michael R. Fellows and Frances A. Rosamond and Petr A. Golovach}, editor = {Marios Mavronicolas}, title = {On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves}, booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC} 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13898}, pages = {353--367}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-30448-4\_25}, doi = {10.1007/978-3-031-30448-4\_25}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/SamFRG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominG00Z23, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh and Meirav Zehavi}, editor = {Inge Li G{\o}rtz and Martin Farach{-}Colton and Simon J. Puglisi and Grzegorz Herman}, title = {Kernelization for Spreading Points}, booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {274}, pages = {48:1--48:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ESA.2023.48}, doi = {10.4230/LIPICS.ESA.2023.48}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominG00Z23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/SamBGB23, author = {Emmanuel Sam and Benjamin Bergougnoux and Petr A. Golovach and Nello Blaser}, editor = {Henning Fernau and Klaus Jansen}, title = {Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves}, booktitle = {Fundamentals of Computation Theory - 24th International Symposium, {FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14292}, pages = {392--405}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43587-4\_28}, doi = {10.1007/978-3-031-43587-4\_28}, timestamp = {Wed, 18 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/SamBGB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/DidimoFGIKS23, author = {Walter Didimo and Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Stephen G. Kobourov and Marie Diana Sieper}, editor = {Michael A. Bekos and Markus Chimani}, title = {Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem}, booktitle = {Graph Drawing and Network Visualization - 31st International Symposium, {GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {14466}, pages = {189--202}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-49275-4\_13}, doi = {10.1007/978-3-031-49275-4\_13}, timestamp = {Sat, 10 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gd/DidimoFGIKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGSS23, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis}, title = {Approximating Long Cycle Above Dirac's Guarantee}, booktitle = {50th International Colloquium on Automata, Languages, and Programming, {ICALP} 2023, July 10-14, 2023, Paderborn, Germany}, series = {LIPIcs}, volume = {261}, pages = {60:1--60:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.60}, doi = {10.4230/LIPICS.ICALP.2023.60}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGSST23, author = {Fedor V. Fomin and Petr A. Golovach and Ignasi Sau and Giannos Stamoulis and Dimitrios M. Thilikos}, editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis}, title = {Compound Logics for Modification Problems}, booktitle = {50th International Colloquium on Automata, Languages, and Programming, {ICALP} 2023, July 10-14, 2023, Paderborn, Germany}, series = {LIPIcs}, volume = {261}, pages = {61:1--61:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.61}, doi = {10.4230/LIPICS.ICALP.2023.61}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGSST23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGKS23, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Giannos Stamoulis}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Computing Paths of Large Rank in Planar Frameworks Deterministically}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {32:1--32:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.32}, doi = {10.4230/LIPICS.ISAAC.2023.32}, timestamp = {Tue, 28 Nov 2023 13:12:50 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FominGKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/ArrighiFG023, author = {Emmanuel Arrighi and Fedor V. Fomin and Petr A. Golovach and Petra Wolf}, editor = {Neeldhara Misra and Magnus Wahlstr{\"{o}}m}, title = {Kernelizing Temporal Exploration Problems}, booktitle = {18th International Symposium on Parameterized and Exact Computation, {IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands}, series = {LIPIcs}, volume = {285}, pages = {1:1--1:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.1}, doi = {10.4230/LIPICS.IPEC.2023.1}, timestamp = {Wed, 13 Dec 2023 14:08:59 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/ArrighiFG023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/FominG0K23, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Tomohiro Koana}, editor = {J{\'{e}}r{\^{o}}me Leroux and Sylvain Lombardy and David Peleg}, title = {{FPT} Approximation and Subexponential Algorithms for Covering Few or Many Edges}, 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 = {46:1--46:8}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.46}, doi = {10.4230/LIPICS.MFCS.2023.46}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/FominG0K23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGKLS23, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Daniel Lokshtanov and Giannos Stamoulis}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Shortest Cycles With Monotone Submodular Costs}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {2214--2227}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch83}, doi = {10.1137/1.9781611977554.CH83}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/FominGKLS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GolovachST23, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {3684--3699}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch141}, doi = {10.1137/1.9781611977554.CH141}, timestamp = {Fri, 17 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GolovachST23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGKSS23, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Kirill Simonov and Giannos Stamoulis}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Fixed-Parameter Tractability of Maximum Colored Path and Beyond}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {3700--3712}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch142}, doi = {10.1137/1.9781611977554.CH142}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/FominGKSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominFG23, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Parameterized Complexity of Broadcasting in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {334--347}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_24}, doi = {10.1007/978-3-031-43380-1\_24}, timestamp = {Wed, 27 Sep 2023 09:00:02 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominFG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominGSS23, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Tur{\'{a}}n's Theorem Through Algorithmic Lens}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {14093}, pages = {348--362}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43380-1\_25}, doi = {10.1007/978-3-031-43380-1\_25}, timestamp = {Wed, 27 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominGSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-10110, author = {Emmanuel Arrighi and Fedor V. Fomin and Petr A. Golovach and Petra Wolf}, title = {Kernelizing Temporal Exploration Problems}, journal = {CoRR}, volume = {abs/2302.10110}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.10110}, doi = {10.48550/ARXIV.2302.10110}, eprinttype = {arXiv}, eprint = {2302.10110}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-10110.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-01314, author = {Matthias Bentert and P{\aa}l Gr{\o}n{\aa}s Drange and Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen}, title = {Two-sets cut-uncut on planar graphs}, journal = {CoRR}, volume = {abs/2305.01314}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.01314}, doi = {10.48550/ARXIV.2305.01314}, eprinttype = {arXiv}, eprint = {2305.01314}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-01314.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-01993, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Giannos Stamoulis}, title = {Computing paths of large rank in planar frameworks deterministically}, journal = {CoRR}, volume = {abs/2305.01993}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.01993}, doi = {10.48550/ARXIV.2305.01993}, eprinttype = {arXiv}, eprint = {2305.01993}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-01993.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-02011, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, title = {Approximating Long Cycle Above Dirac's Guarantee}, journal = {CoRR}, volume = {abs/2305.02011}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.02011}, doi = {10.48550/ARXIV.2305.02011}, eprinttype = {arXiv}, eprint = {2305.02011}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-02011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-01536, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, title = {Parameterized Complexity of Broadcasting in Graphs}, journal = {CoRR}, volume = {abs/2306.01536}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.01536}, doi = {10.48550/ARXIV.2306.01536}, eprinttype = {arXiv}, eprint = {2306.01536}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-01536.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-00362, author = {Emmanuel Sam and Benjamin Bergougnoux and Petr A. Golovach and Nello Blaser}, title = {Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves}, journal = {CoRR}, volume = {abs/2307.00362}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.00362}, doi = {10.48550/ARXIV.2307.00362}, eprinttype = {arXiv}, eprint = {2307.00362}, timestamp = {Mon, 10 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-00362.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-07456, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, title = {Tur{\'{a}}n's Theorem Through Algorithmic Lens}, journal = {CoRR}, volume = {abs/2307.07456}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.07456}, doi = {10.48550/ARXIV.2307.07456}, eprinttype = {arXiv}, eprint = {2307.07456}, timestamp = {Mon, 24 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-07456.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-07099, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh and Meirav Zehavi}, title = {Kernelization for Spreading Points}, journal = {CoRR}, volume = {abs/2308.07099}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.07099}, doi = {10.48550/ARXIV.2308.07099}, eprinttype = {arXiv}, eprint = {2308.07099}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-07099.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-15546, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Tomohiro Koana}, title = {{FPT} Approximation and Subexponential Algorithms for Covering Few or Many Edges}, journal = {CoRR}, volume = {abs/2308.15546}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.15546}, doi = {10.48550/ARXIV.2308.15546}, eprinttype = {arXiv}, eprint = {2308.15546}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-15546.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-15635, author = {Walter Didimo and Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Stephen G. Kobourov and Marie Diana Sieper}, title = {Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem}, journal = {CoRR}, volume = {abs/2308.15635}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.15635}, doi = {10.48550/ARXIV.2308.15635}, eprinttype = {arXiv}, eprint = {2308.15635}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-15635.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-09678, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, title = {Tree Containment Above Minimum Degree is {FPT}}, journal = {CoRR}, volume = {abs/2310.09678}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.09678}, doi = {10.48550/ARXIV.2310.09678}, eprinttype = {arXiv}, eprint = {2310.09678}, timestamp = {Wed, 25 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-09678.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGLMSS22, author = {Fedor V. Fomin and Petr A. Golovach and William Lochet and Pranabendu Misra and Saket Saurabh and Roohani Sharma}, title = {Parameterized Complexity of Directed Spanner Problems}, journal = {Algorithmica}, volume = {84}, number = {8}, pages = {2292--2308}, year = {2022}, url = {https://doi.org/10.1007/s00453-021-00911-x}, doi = {10.1007/S00453-021-00911-X}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGLMSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachZ22, author = {Petr A. Golovach and Meirav Zehavi}, title = {Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation}, journal = {Algorithmica}, volume = {84}, number = {11}, pages = {3107--3109}, year = {2022}, url = {https://doi.org/10.1007/s00453-022-01042-7}, doi = {10.1007/S00453-022-01042-7}, timestamp = {Mon, 31 Oct 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/BrauseGMOPS22, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Pascal Ochem and Dani{\"{e}}l Paulusma and Siani Smith}, title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter}, journal = {Electron. J. Comb.}, volume = {29}, number = {2}, year = {2022}, url = {https://doi.org/10.37236/10738}, doi = {10.37236/10738}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorics/BrauseGMOPS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CrespelleG22, author = {Christophe Crespelle and Petr A. Golovach}, title = {Cyclability in graph classes}, journal = {Discret. Appl. Math.}, volume = {313}, pages = {147--178}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.01.021}, doi = {10.1016/J.DAM.2022.01.021}, timestamp = {Fri, 29 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CrespelleG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GolovachKKL22, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, title = {Refined notions of parameterized enumeration kernels with applications to matching cut enumeration}, journal = {J. Comput. Syst. Sci.}, volume = {123}, pages = {76--102}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.07.005}, doi = {10.1016/J.JCSS.2021.07.005}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GolovachKKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GolovachPL22, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in AT-free graphs}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {170--191}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.10.003}, doi = {10.1016/J.JCSS.2021.10.003}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GolovachPL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mss/FominFG22, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, title = {Present-biased optimization}, journal = {Math. Soc. Sci.}, volume = {119}, pages = {56--67}, year = {2022}, url = {https://doi.org/10.1016/j.mathsocsci.2022.06.001}, doi = {10.1016/J.MATHSOCSCI.2022.06.001}, timestamp = {Mon, 24 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mss/FominFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GolovachLP22, author = {Petr A. Golovach and Paloma T. Lima and Charis Papadopoulos}, title = {Graph Square Roots of Small Distance from Degree One Graphs}, journal = {Theory Comput. Syst.}, volume = {66}, number = {4}, pages = {821--846}, year = {2022}, url = {https://doi.org/10.1007/s00224-022-10079-8}, doi = {10.1007/S00224-022-10079-8}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/GolovachLP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrauseGMPS22, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, title = {Partitioning \emph{H}-free graphs of bounded diameter}, journal = {Theor. Comput. Sci.}, volume = {930}, pages = {37--52}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.07.009}, doi = {10.1016/J.TCS.2022.07.009}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrauseGMPS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/FominGT22, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Parameterized Complexity of Elimination Distance to First-Order Logic Properties}, journal = {{ACM} Trans. Comput. Log.}, volume = {23}, number = {3}, pages = {17:1--17:35}, year = {2022}, url = {https://doi.org/10.1145/3517129}, doi = {10.1145/3517129}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/FominGT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/FominGST22, author = {Fedor V. Fomin and Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {An Algorithmic Meta-Theorem for Graph Modification to Planarity and {FOL}}, journal = {{ACM} Trans. Comput. Theory}, volume = {14}, number = {3-4}, pages = {1--29}, year = {2022}, url = {https://doi.org/10.1145/3571278}, doi = {10.1145/3571278}, timestamp = {Fri, 18 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/FominGST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/BandyapadhyayFG22, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov}, title = {How to Find a Good Explanation for Clustering?}, booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI} 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22 - March 1, 2022}, pages = {3904--3912}, publisher = {{AAAI} Press}, year = {2022}, url = {https://doi.org/10.1609/aaai.v36i4.20306}, doi = {10.1609/AAAI.V36I4.20306}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/BandyapadhyayFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/BandyapadhyayFG22, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit and Kirill Simonov}, editor = {Alexander S. Kulikov and Sofya Raskhodnikova}, title = {Lossy Kernelization of Same-Size Clustering}, booktitle = {Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, {CSR} 2022, Virtual Event, June 29 - July 1, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13296}, pages = {96--114}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-09574-0\_7}, doi = {10.1007/978-3-031-09574-0\_7}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csr/BandyapadhyayFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/GolovachPRS22, author = {Petr A. Golovach and Fahad Panolan and Ashutosh Rai and Saket Saurabh}, editor = {Alexander S. Kulikov and Sofya Raskhodnikova}, title = {Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs}, booktitle = {Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, {CSR} 2022, Virtual Event, June 29 - July 1, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13296}, pages = {152--169}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-09574-0\_10}, doi = {10.1007/978-3-031-09574-0\_10}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csr/GolovachPRS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGSS22, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman}, title = {Longest Cycle Above Erd{\H{o}}s-Gallai Bound}, booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, series = {LIPIcs}, volume = {244}, pages = {55:1--55:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ESA.2022.55}, doi = {10.4230/LIPICS.ESA.2022.55}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominGSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominG0Z22, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Meirav Zehavi}, editor = {Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff}, title = {(Re)packing Equal Disks into Rectangle}, booktitle = {49th International Colloquium on Automata, Languages, and Programming, {ICALP} 2022, July 4-8, 2022, Paris, France}, series = {LIPIcs}, volume = {229}, pages = {60:1--60:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.60}, doi = {10.4230/LIPICS.ICALP.2022.60}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominG0Z22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/BandyapadhyayFG22, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit and Kirill Simonov}, editor = {Holger Dell and Jesper Nederlof}, title = {{FPT} Approximation for Fair Minimum-Load Clustering}, booktitle = {17th International Symposium on Parameterized and Exact Computation, {IPEC} 2022, September 7-9, 2022, Potsdam, Germany}, series = {LIPIcs}, volume = {249}, pages = {4:1--4:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.4}, doi = {10.4230/LIPICS.IPEC.2022.4}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/BandyapadhyayFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/FominG0P022, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Nidhi Purohit and Saket Saurabh}, editor = {Holger Dell and Jesper Nederlof}, title = {Exact Exponential Algorithms for Clustering Problems}, booktitle = {17th International Symposium on Parameterized and Exact Computation, {IPEC} 2022, September 7-9, 2022, Potsdam, Germany}, series = {LIPIcs}, volume = {249}, pages = {13:1--13:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.13}, doi = {10.4230/LIPICS.IPEC.2022.13}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/FominG0P022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/FominGSS22, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Stefan Szeider and Robert Ganian and Alexandra Silva}, title = {Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria}, series = {LIPIcs}, volume = {241}, pages = {1:1--1:4}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.1}, doi = {10.4230/LIPICS.MFCS.2022.1}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/FominGSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGSS22, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {Algorithmic Extensions of Dirac's Theorem}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {406--416}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.20}, doi = {10.1137/1.9781611977073.20}, timestamp = {Tue, 12 Apr 2022 11:24:56 +0200}, biburl = {https://dblp.org/rec/conf/soda/FominGSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominGLSS022, author = {Fedor V. Fomin and Petr A. Golovach and William Lochet and Danil Sagunov and Kirill Simonov and Saket Saurabh}, editor = {Petra Berenbrink and Benjamin Monmege}, title = {Detours in Directed Graphs}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, series = {LIPIcs}, volume = {219}, pages = {29:1--29:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.STACS.2022.29}, doi = {10.4230/LIPICS.STACS.2022.29}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/FominGLSS022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2201-03318, author = {Fedor V. Fomin and Petr A. Golovach and William Lochet and Danil Sagunov and Kirill Simonov and Saket Saurabh}, title = {Detours in Directed Graphs}, journal = {CoRR}, volume = {abs/2201.03318}, year = {2022}, url = {https://arxiv.org/abs/2201.03318}, eprinttype = {arXiv}, eprint = {2201.03318}, timestamp = {Thu, 20 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-03318.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-03061, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, title = {Longest Cycle above Erd{\H{o}}s-Gallai Bound}, journal = {CoRR}, volume = {abs/2202.03061}, year = {2022}, url = {https://arxiv.org/abs/2202.03061}, eprinttype = {arXiv}, eprint = {2202.03061}, timestamp = {Wed, 09 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-03061.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-07449, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Kirill Simonov and Giannos Stamoulis}, title = {Fixed-Parameter Tractability of Maximum Colored Path and Beyond}, journal = {CoRR}, volume = {abs/2207.07449}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.07449}, doi = {10.48550/ARXIV.2207.07449}, eprinttype = {arXiv}, eprint = {2207.07449}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-07449.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-09993, author = {Cl{\'{e}}ment Dallard and Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Martin Milanic}, title = {Computing Tree Decompositions with Small Independence Number}, journal = {CoRR}, volume = {abs/2207.09993}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.09993}, doi = {10.48550/ARXIV.2207.09993}, eprinttype = {arXiv}, eprint = {2207.09993}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-09993.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-06847, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Nidhi Purohit and Saket Saurabh}, title = {Exact Exponential Algorithms for Clustering Problems}, journal = {CoRR}, volume = {abs/2208.06847}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.06847}, doi = {10.48550/ARXIV.2208.06847}, eprinttype = {arXiv}, eprint = {2208.06847}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-06847.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-01723, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes}, journal = {CoRR}, volume = {abs/2211.01723}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.01723}, doi = {10.48550/ARXIV.2211.01723}, eprinttype = {arXiv}, eprint = {2211.01723}, timestamp = {Fri, 04 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-01723.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-04797, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Daniel Lokshtanov and Giannos Stamoulis}, title = {Shortest Cycles With Monotone Submodular Costs}, journal = {CoRR}, volume = {abs/2211.04797}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.04797}, doi = {10.48550/ARXIV.2211.04797}, eprinttype = {arXiv}, eprint = {2211.04797}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-04797.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-09603, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh and Meirav Zehavi}, title = {(Re)packing Equal Disks into Rectangle}, journal = {CoRR}, volume = {abs/2211.09603}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.09603}, doi = {10.48550/ARXIV.2211.09603}, eprinttype = {arXiv}, eprint = {2211.09603}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-09603.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominG21, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs}, journal = {Algorithmica}, volume = {83}, number = {7}, pages = {2170--2214}, year = {2021}, url = {https://doi.org/10.1007/s00453-021-00822-x}, doi = {10.1007/S00453-021-00822-X}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/FominG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominGS21, author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, title = {Parameterized \emph{k}-Clustering: Tractability island}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {50--74}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.005}, doi = {10.1016/J.JCSS.2020.10.005}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominGS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/ChaplickFGKZ21, author = {Steven Chaplick and Fedor V. Fomin and Petr A. Golovach and Dusan Knop and Peter Zeman}, title = {Kernelization of Graph Hamiltonicity: Proper H-Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {35}, number = {2}, pages = {840--892}, year = {2021}, url = {https://doi.org/10.1137/19M1299001}, doi = {10.1137/19M1299001}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/ChaplickFGKZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominG21, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Kernelization of Whitney Switches}, journal = {{SIAM} J. Discret. Math.}, volume = {35}, number = {2}, pages = {1298--1336}, year = {2021}, url = {https://doi.org/10.1137/20M1367519}, doi = {10.1137/20M1367519}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/FominG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/FominGLPSZ21, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, title = {Multiplicative Parameterization Above a Guarantee}, journal = {{ACM} Trans. Comput. Theory}, volume = {13}, number = {3}, pages = {18:1--18:16}, year = {2021}, url = {https://doi.org/10.1145/3460956}, doi = {10.1145/3460956}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toct/FominGLPSZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/FominFG21, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, title = {Present-Biased Optimization}, booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI} 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9, 2021}, pages = {5415--5422}, publisher = {{AAAI} Press}, year = {2021}, url = {https://doi.org/10.1609/aaai.v35i6.16682}, doi = {10.1609/AAAI.V35I6.16682}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/FominFG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FominG0021, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh}, editor = {Mikolaj Bojanczyk and Chandra Chekuri}, title = {{ETH} Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space}, booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021, Virtual Conference}, series = {LIPIcs}, volume = {213}, pages = {21:1--21:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.21}, doi = {10.4230/LIPICS.FSTTCS.2021.21}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FominG0021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrauseGMPS21, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Partitioning H-Free Graphs of Bounded Diameter}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {21:1--21:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.21}, doi = {10.4230/LIPICS.ISAAC.2021.21}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrauseGMPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/FominGT21, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Parameterized Complexity of Elimination Distance to First-Order Logic Properties}, booktitle = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2021, Rome, Italy, June 29 - July 2, 2021}, pages = {1--13}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/LICS52264.2021.9470540}, doi = {10.1109/LICS52264.2021.9470540}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/FominGT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BandyapadhyayFG21, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, editor = {Filippo Bonchi and Simon J. Puglisi}, title = {Parameterized Complexity of Feature Selection for Categorical Data Clustering}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia}, series = {LIPIcs}, volume = {202}, pages = {14:1--14:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.14}, doi = {10.4230/LIPICS.MFCS.2021.14}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/BandyapadhyayFG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EibenFGLPS21, author = {Eduard Eiben and Fedor V. Fomin and Petr A. Golovach and William Lochet and Fahad Panolan and Kirill Simonov}, editor = {D{\'{a}}niel Marx}, title = {{EPTAS} for \emph{k}-means Clustering of Affine Subspaces}, booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2021, Virtual Conference, January 10 - 13, 2021}, pages = {2649--2659}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976465.157}, doi = {10.1137/1.9781611976465.157}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/EibenFGLPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominGPP021, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Geevarghese Philip and Saket Saurabh}, editor = {Markus Bl{\"{a}}ser and Benjamin Monmege}, title = {Diverse Collections in Matroids and Graphs}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {187}, pages = {31:1--31:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.STACS.2021.31}, doi = {10.4230/LIPICS.STACS.2021.31}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/FominGPP021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GolovachKKL21, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, editor = {Markus Bl{\"{a}}ser and Benjamin Monmege}, title = {Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {187}, pages = {37:1--37:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.STACS.2021.37}, doi = {10.4230/LIPICS.STACS.2021.37}, timestamp = {Thu, 11 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/GolovachKKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FominGP21, author = {Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit}, editor = {Anna Lubiw and Mohammad R. Salavatipour}, title = {Parameterized Complexity of Categorical Clustering with Size Constraints}, 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 = {385--398}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-83508-8\_28}, doi = {10.1007/978-3-030-83508-8\_28}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/FominGP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominGT21, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {308--320}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_24}, doi = {10.1007/978-3-030-86838-3\_24}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FominGT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BrauseGMPS21, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski}, title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter}, booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {12911}, pages = {336--348}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86838-3\_26}, doi = {10.1007/978-3-030-86838-3\_26}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BrauseGMPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/iwpec/2021, editor = {Petr A. Golovach and Meirav Zehavi}, title = {16th International Symposium on Parameterized and Exact Computation, {IPEC} 2021, September 8-10, 2021, Lisbon, Portugal}, series = {LIPIcs}, volume = {214}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-216-7}, isbn = {978-3-95977-216-7}, timestamp = {Mon, 22 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-03800, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, title = {Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}, journal = {CoRR}, volume = {abs/2101.03800}, year = {2021}, url = {https://arxiv.org/abs/2101.03800}, eprinttype = {arXiv}, eprint = {2101.03800}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-03800.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-04633, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Geevarghese Philip and Saket Saurabh}, title = {Diverse Collections in Matroids and Graphs}, journal = {CoRR}, volume = {abs/2101.04633}, year = {2021}, url = {https://arxiv.org/abs/2101.04633}, eprinttype = {arXiv}, eprint = {2101.04633}, timestamp = {Fri, 22 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-04633.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-13409, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs}, journal = {CoRR}, volume = {abs/2102.13409}, year = {2021}, url = {https://arxiv.org/abs/2102.13409}, eprinttype = {arXiv}, eprint = {2102.13409}, timestamp = {Tue, 02 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-13409.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2104-02998, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Parameterized Complexity of Elimination Distance to First-Order Logic Properties}, journal = {CoRR}, volume = {abs/2104.02998}, year = {2021}, url = {https://arxiv.org/abs/2104.02998}, eprinttype = {arXiv}, eprint = {2104.02998}, timestamp = {Tue, 13 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2104-02998.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2104-07974, author = {Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit}, title = {Parameterized Complexity of Categorical Clustering with Size Constraints}, journal = {CoRR}, volume = {abs/2104.07974}, year = {2021}, url = {https://arxiv.org/abs/2104.07974}, eprinttype = {arXiv}, eprint = {2104.07974}, timestamp = {Mon, 19 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2104-07974.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2104-10593, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, title = {Acyclic, Star, and Injective Colouring: Bounding the Diameter}, journal = {CoRR}, volume = {abs/2104.10593}, year = {2021}, url = {https://arxiv.org/abs/2104.10593}, eprinttype = {arXiv}, eprint = {2104.10593}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2104-10593.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-03753, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, title = {Parameterized Complexity of Feature Selection for Categorical Data Clustering}, journal = {CoRR}, volume = {abs/2105.03753}, year = {2021}, url = {https://arxiv.org/abs/2105.03753}, eprinttype = {arXiv}, eprint = {2105.03753}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-03753.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-04588, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, title = {Partitioning H-Free Graphs of Bounded Diameter}, journal = {CoRR}, volume = {abs/2105.04588}, year = {2021}, url = {https://arxiv.org/abs/2105.04588}, eprinttype = {arXiv}, eprint = {2105.04588}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-04588.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-03425, author = {Fedor V. Fomin and Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {An Algorithmic Meta-Theorem for Graph Modification to Planarity and {FOL}}, journal = {CoRR}, volume = {abs/2106.03425}, year = {2021}, url = {https://arxiv.org/abs/2106.03425}, eprinttype = {arXiv}, eprint = {2106.03425}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-03425.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-06715, author = {Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh}, title = {{ETH} Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space}, journal = {CoRR}, volume = {abs/2107.06715}, year = {2021}, url = {https://arxiv.org/abs/2107.06715}, eprinttype = {arXiv}, eprint = {2107.06715}, timestamp = {Wed, 21 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-06715.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-07383, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit and Kirill Simonov}, title = {Lossy Kernelization of Same-Size Clustering}, journal = {CoRR}, volume = {abs/2107.07383}, year = {2021}, url = {https://arxiv.org/abs/2107.07383}, eprinttype = {arXiv}, eprint = {2107.07383}, timestamp = {Wed, 21 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-07383.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-09481, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and Nidhi Purohit and Kirill Simonov}, title = {{FPT} Approximation for Fair Minimum-Load Clustering}, journal = {CoRR}, volume = {abs/2107.09481}, year = {2021}, url = {https://arxiv.org/abs/2107.09481}, eprinttype = {arXiv}, eprint = {2107.09481}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-09481.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-02755, author = {Fedor V. Fomin and Petr A. Golovach and Ignasi Sau and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {Compound Logics for Modification Problems}, journal = {CoRR}, volume = {abs/2111.02755}, year = {2021}, url = {https://arxiv.org/abs/2111.02755}, eprinttype = {arXiv}, eprint = {2111.02755}, timestamp = {Mon, 07 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-02755.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-06580, author = {Sayan Bandyapadhyay and Fedor V. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov}, title = {How to Find a Good Explanation for Clustering?}, journal = {CoRR}, volume = {abs/2112.06580}, year = {2021}, url = {https://arxiv.org/abs/2112.06580}, eprinttype = {arXiv}, eprint = {2112.06580}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-06580.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGST20, author = {Fedor V. Fomin and Petr A. Golovach and Torstein J. F. Str{\o}mme and Dimitrios M. Thilikos}, title = {Subgraph Complementation}, journal = {Algorithmica}, volume = {82}, number = {7}, pages = {1859--1880}, year = {2020}, url = {https://doi.org/10.1007/s00453-020-00677-8}, doi = {10.1007/S00453-020-00677-8}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGST20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachHKLP20, author = {Petr A. Golovach and Pinar Heggernes and Athanasios L. Konstantinidis and Paloma T. Lima and Charis Papadopoulos}, title = {Parameterized Aspects of Strong Subgraph Closure}, journal = {Algorithmica}, volume = {82}, number = {7}, pages = {2006--2038}, year = {2020}, url = {https://doi.org/10.1007/s00453-020-00684-9}, doi = {10.1007/S00453-020-00684-9}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGR20, author = {Fedor V. Fomin and Petr A. Golovach and Jean{-}Florent Raymond}, title = {On the Tractability of Optimization Problems on H-Graphs}, journal = {Algorithmica}, volume = {82}, number = {9}, pages = {2432--2473}, year = {2020}, url = {https://doi.org/10.1007/s00453-020-00692-9}, doi = {10.1007/S00453-020-00692-9}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHKS20, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Reza Saei}, title = {Enumeration of minimal connected dominating sets for chordal graphs}, journal = {Discret. Appl. Math.}, volume = {278}, pages = {3--11}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.07.015}, doi = {10.1016/J.DAM.2019.07.015}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GolovachHKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/datamine/FominGP20, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan}, title = {Parameterized low-rank binary matrix approximation}, journal = {Data Min. Knowl. Discov.}, volume = {34}, number = {2}, pages = {478--532}, year = {2020}, url = {https://doi.org/10.1007/s10618-019-00669-5}, doi = {10.1007/S10618-019-00669-5}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/datamine/FominGP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GolovachHLM20, author = {Petr A. Golovach and Pinar Heggernes and Paloma T. Lima and Pedro Montealegre}, title = {Finding connected secluded subgraphs}, journal = {J. Comput. Syst. Sci.}, volume = {113}, pages = {101--124}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2020.05.006}, doi = {10.1016/J.JCSS.2020.05.006}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/GolovachHLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/FominGT20, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {On the Parameterized Complexity of Graph Modification to First-Order Logic Properties}, journal = {Theory Comput. Syst.}, volume = {64}, number = {2}, pages = {251--271}, year = {2020}, url = {https://doi.org/10.1007/s00224-019-09938-8}, doi = {10.1007/S00224-019-09938-8}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/FominGT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGLPSZ20, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, title = {Going Far from Degeneracy}, journal = {{SIAM} J. Discret. Math.}, volume = {34}, number = {3}, pages = {1587--1601}, year = {2020}, url = {https://doi.org/10.1137/19M1290577}, doi = {10.1137/19M1290577}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGLPSZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/FominGLP020, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh}, title = {Approximation Schemes for Low-rank Binary Matrix Approximation Problems}, journal = {{ACM} Trans. Algorithms}, volume = {16}, number = {1}, pages = {12:1--12:39}, year = {2020}, url = {https://doi.org/10.1145/3365653}, doi = {10.1145/3365653}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/FominGLP020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/FominGPS20, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Kirill Simonov}, editor = {Jaroslaw Byrka and Raghu Meka}, title = {Low-Rank Binary Matrix Approximation in Column-Sum Norm}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual Conference}, series = {LIPIcs}, volume = {176}, pages = {32:1--32:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.32}, doi = {10.4230/LIPICS.APPROX/RANDOM.2020.32}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/FominGPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominG20, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {Kernelization of Whitney Switches}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {48:1--48:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.48}, doi = {10.4230/LIPICS.ESA.2020.48}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/FominG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominG20a, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {49:1--49:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.49}, doi = {10.4230/LIPICS.ESA.2020.49}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/FominG20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGMR20, author = {Fedor V. Fomin and Petr A. Golovach and Pranabendu Misra and M. S. Ramanujan}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {On the Complexity of Recovering Incidence Matrices}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {50:1--50:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.50}, doi = {10.4230/LIPICS.ESA.2020.50}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominGMR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGST20, author = {Fedor V. Fomin and Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {An Algorithmic Meta-Theorem for Graph Modification to Planarity and {FOL}}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {51:1--51:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.51}, doi = {10.4230/LIPICS.ESA.2020.51}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominGST20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/FominGLP0Z20, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, editor = {Thomas Vidick}, title = {Parameterization Above a Multiplicative Guarantee}, booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS} 2020, January 12-14, 2020, Seattle, Washington, {USA}}, series = {LIPIcs}, volume = {151}, pages = {39:1--39:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.39}, doi = {10.4230/LIPICS.ITCS.2020.39}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/FominGLP0Z20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGJPS20, author = {Fedor V. Fomin and Petr A. Golovach and Lars Jaffke and Geevarghese Philip and Danil Sagunov}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Diverse Pairs of Matchings}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {26:1--26:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.26}, doi = {10.4230/LIPICS.ISAAC.2020.26}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGJPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/ChaplickGHK20, author = {Steven Chaplick and Petr A. Golovach and Tim A. Hartmann and Dusan Knop}, editor = {Yixin Cao and Marcin Pilipczuk}, title = {Recognizing Proper Tree-Graphs}, 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 = {8:1--8:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.8}, doi = {10.4230/LIPICS.IPEC.2020.8}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/ChaplickGHK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/FominGLM0S20, author = {Fedor V. Fomin and Petr A. Golovach and William Lochet and Pranabendu Misra and Saket Saurabh and Roohani Sharma}, editor = {Yixin Cao and Marcin Pilipczuk}, title = {Parameterized Complexity of Directed Spanner Problems}, 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 = {12:1--12:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.12}, doi = {10.4230/LIPICS.IPEC.2020.12}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/FominGLM0S20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/Golovach0S0Z20, author = {Petr A. Golovach and R. Krithika and Abhishek Sahu and Saket Saurabh and Meirav Zehavi}, editor = {Yoshiharu Kohayakawa and Fl{\'{a}}vio Keidi Miyazawa}, title = {Graph Hamiltonicity Parameterized by Proper Interval Deletion Set}, 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 = {104--115}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-61792-9\_9}, doi = {10.1007/978-3-030-61792-9\_9}, timestamp = {Thu, 03 Dec 2020 14:27:45 +0100}, biburl = {https://dblp.org/rec/conf/latin/Golovach0S0Z20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/GolovachLP20, author = {Petr A. Golovach and Paloma T. Lima and Charis Papadopoulos}, editor = {Yoshiharu Kohayakawa and Fl{\'{a}}vio Keidi Miyazawa}, title = {Graph Square Roots of Small Distance from Degree One Graphs}, 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 = {116--128}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-61792-9\_10}, doi = {10.1007/978-3-030-61792-9\_10}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/latin/GolovachLP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GolovachST20, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, editor = {Shuchi Chawla}, title = {Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {931--950}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.56}, doi = {10.1137/1.9781611975994.56}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GolovachST20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/FominGS20, author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, editor = {Susanne Albers}, title = {Parameterized Complexity of {PCA} (Invited Talk)}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands}, series = {LIPIcs}, volume = {162}, pages = {1:1--1:5}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.1}, doi = {10.4230/LIPICS.SWAT.2020.1}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/swat/FominGS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-06867, 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}, eprinttype = {arXiv}, eprint = {2001.06867}, timestamp = {Fri, 24 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-06867.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-08226, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Subexponential parameterized algorithms and kernelization on almost chordal graphs}, journal = {CoRR}, volume = {abs/2002.08226}, year = {2020}, url = {https://arxiv.org/abs/2002.08226}, eprinttype = {arXiv}, eprint = {2002.08226}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-08226.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-13684, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Kernelization of Whitney Switches}, journal = {CoRR}, volume = {abs/2006.13684}, year = {2020}, url = {https://arxiv.org/abs/2006.13684}, eprinttype = {arXiv}, eprint = {2006.13684}, timestamp = {Wed, 01 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-13684.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-04567, author = {Fedor V. Fomin and Petr A. Golovach and Lars Jaffke and Geevarghese Philip and Danil Sagunov}, title = {Diverse Pairs of Matchings}, journal = {CoRR}, volume = {abs/2009.04567}, year = {2020}, url = {https://arxiv.org/abs/2009.04567}, eprinttype = {arXiv}, eprint = {2009.04567}, timestamp = {Thu, 17 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-04567.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-05733, author = {Petr A. Golovach and Paloma T. Lima and Charis Papadopoulos}, title = {Graph Square Roots of Small Distance from Degree One Graphs}, journal = {CoRR}, volume = {abs/2010.05733}, year = {2020}, url = {https://arxiv.org/abs/2010.05733}, eprinttype = {arXiv}, eprint = {2010.05733}, timestamp = {Tue, 20 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-05733.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-09580, author = {Eduard Eiben and Fedor V. Fomin and Petr A. Golovach and William Lochet and Fahad Panolan and Kirill Simonov}, title = {{EPTAS} for k-means Clustering of Affine Subspaces}, journal = {CoRR}, volume = {abs/2010.09580}, year = {2020}, url = {https://arxiv.org/abs/2010.09580}, eprinttype = {arXiv}, eprint = {2010.09580}, timestamp = {Wed, 21 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-09580.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-03619, author = {Fedor V. Fomin and Petr A. Golovach and Danil Sagunov and Kirill Simonov}, title = {Algorithmic Extensions of Dirac's Theorem}, journal = {CoRR}, volume = {abs/2011.03619}, year = {2020}, url = {https://arxiv.org/abs/2011.03619}, eprinttype = {arXiv}, eprint = {2011.03619}, timestamp = {Thu, 12 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-03619.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-11670, author = {Steven Chaplick and Petr A. Golovach and Tim A. Hartmann and Dusan Knop}, title = {Recognizing Proper Tree-Graphs}, journal = {CoRR}, volume = {abs/2011.11670}, year = {2020}, url = {https://arxiv.org/abs/2011.11670}, eprinttype = {arXiv}, eprint = {2011.11670}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-11670.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-09814, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in AT-free Graphs}, journal = {CoRR}, volume = {abs/2012.09814}, year = {2020}, url = {https://arxiv.org/abs/2012.09814}, eprinttype = {arXiv}, eprint = {2012.09814}, timestamp = {Sun, 03 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-09814.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-14736, author = {Fedor V. Fomin and Pierre Fraigniaud and Petr A. Golovach}, title = {Present-Biased Optimization}, journal = {CoRR}, volume = {abs/2012.14736}, year = {2020}, url = {https://arxiv.org/abs/2012.14736}, eprinttype = {arXiv}, eprint = {2012.14736}, timestamp = {Fri, 08 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-14736.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachHKLP19, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Paloma T. Lima and Dani{\"{e}}l Paulusma}, title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2}, journal = {Algorithmica}, volume = {81}, number = {7}, pages = {2795--2828}, year = {2019}, url = {https://doi.org/10.1007/s00453-019-00555-y}, doi = {10.1007/S00453-019-00555-Y}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/computability/GolovachJMPS19, author = {Petr A. Golovach and Matthew Johnson and Barnaby Martin and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Surjective H-colouring: New hardness results}, journal = {Comput.}, volume = {8}, number = {1}, pages = {27--42}, year = {2019}, url = {https://doi.org/10.3233/COM-180084}, doi = {10.3233/COM-180084}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/computability/GolovachJMPS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachKLS19, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, title = {Enumeration and maximum number of maximal irredundant sets for chordal graphs}, journal = {Discret. Appl. Math.}, volume = {265}, pages = {69--85}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.03.018}, doi = {10.1016/J.DAM.2019.03.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachKLS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGPS19, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Saket Saurabh}, title = {Editing to Connected F-Degree Graph}, journal = {{SIAM} J. Discret. Math.}, volume = {33}, number = {2}, pages = {795--836}, year = {2019}, url = {https://doi.org/10.1137/17M1129428}, doi = {10.1137/17M1129428}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGPS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/FominGLSZ19, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh and Meirav Zehavi}, title = {Clique-width {III:} Hamiltonian Cycle and the Odd Case of Graph Coloring}, journal = {{ACM} Trans. Algorithms}, volume = {15}, number = {1}, pages = {9:1--9:27}, year = {2019}, url = {https://doi.org/10.1145/3280824}, doi = {10.1145/3280824}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/FominGLSZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/FominGLS19, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Spanning Circuits in Regular Matroids}, journal = {{ACM} Trans. Algorithms}, volume = {15}, number = {4}, pages = {52:1--52:38}, year = {2019}, url = {https://doi.org/10.1145/3355629}, doi = {10.1145/3355629}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/FominGLS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKS19, author = {Petr A. Golovach and Dieter Kratsch and Mohamed Yosri Sayadi}, title = {Enumeration of maximal irredundant sets for claw-free graphs}, journal = {Theor. Comput. Sci.}, volume = {754}, pages = {3--15}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.02.014}, doi = {10.1016/J.TCS.2018.02.014}, timestamp = {Wed, 19 Dec 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKLS19, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, title = {Enumeration and maximum number of minimal dominating sets for chordal graphs}, journal = {Theor. Comput. Sci.}, volume = {783}, pages = {41--52}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.03.017}, doi = {10.1016/J.TCS.2019.03.017}, timestamp = {Wed, 03 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKLS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGLP0Z19, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, title = {Going Far From Degeneracy}, booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany}, series = {LIPIcs}, volume = {144}, pages = {47:1--47:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ESA.2019.47}, doi = {10.4230/LIPICS.ESA.2019.47}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominGLP0Z19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FominGS19, author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, editor = {Arkadev Chattopadhyay and Paul Gastin}, title = {Parameterized k-Clustering: Tractability Island}, booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019, Bombay, India}, series = {LIPIcs}, volume = {150}, pages = {14:1--14:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.14}, doi = {10.4230/LIPICS.FSTTCS.2019.14}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FominGS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGL0Z19, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh and Meirav Zehavi}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {59:1--59:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.59}, doi = {10.4230/LIPICS.ICALP.2019.59}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGL0Z19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/SimonovFGP19, author = {Kirill Simonov and Fedor V. Fomin and Petr A. Golovach and Fahad Panolan}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, title = {Refined Complexity of {PCA} with Outliers}, booktitle = {Proceedings of the 36th International Conference on Machine Learning, {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {5818--5826}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v97/simonov19a.html}, timestamp = {Tue, 11 Jun 2019 15:37:38 +0200}, biburl = {https://dblp.org/rec/conf/icml/SimonovFGP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CrespelleFG19, author = {Christophe Crespelle and Carl Feghali and Petr A. Golovach}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Cyclability in Graph Classes}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {16:1--16:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.16}, doi = {10.4230/LIPICS.ISAAC.2019.16}, timestamp = {Thu, 28 Nov 2019 15:51:42 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CrespelleFG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachT19, author = {Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Bart M. P. Jansen and Jan Arne Telle}, title = {Clustering to Given Connectivities}, booktitle = {14th International Symposium on Parameterized and Exact Computation, {IPEC} 2019, September 11-13, 2019, Munich, Germany}, series = {LIPIcs}, volume = {148}, pages = {18:1--18:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.18}, doi = {10.4230/LIPICS.IPEC.2019.18}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominGT19, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Rolf Niedermeier and Christophe Paul}, title = {Modification to Planarity is Fixed Parameter Tractable}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2019, March 13-16, 2019, Berlin, Germany}, series = {LIPIcs}, volume = {126}, pages = {28:1--28:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.STACS.2019.28}, doi = {10.4230/LIPICS.STACS.2019.28}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/FominGT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/ChaplickFGK019, author = {Steven Chaplick and Fedor V. Fomin and Petr A. Golovach and Dusan Knop and Peter Zeman}, editor = {Zachary Friggstad and J{\"{o}}rg{-}R{\"{u}}diger Sack and Mohammad R. Salavatipour}, title = {Kernelization of Graph Hamiltonicity: Proper H-Graphs}, 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 = {296--310}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24766-9\_22}, doi = {10.1007/978-3-030-24766-9\_22}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/ChaplickFGK019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-02526, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, title = {Going Far From Degeneracy}, journal = {CoRR}, volume = {abs/1902.02526}, year = {2019}, url = {http://arxiv.org/abs/1902.02526}, eprinttype = {arXiv}, eprint = {1902.02526}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-02526.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-06957, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh and Meirav Zehavi}, title = {Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals}, journal = {CoRR}, volume = {abs/1902.06957}, year = {2019}, url = {http://arxiv.org/abs/1902.06957}, eprinttype = {arXiv}, eprint = {1902.06957}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-06957.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-08559, author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, title = {Parameterized k-Clustering: The distance matters!}, journal = {CoRR}, volume = {abs/1902.08559}, year = {2019}, url = {http://arxiv.org/abs/1902.08559}, eprinttype = {arXiv}, eprint = {1902.08559}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-08559.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1904-06141, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Kirill Simonov}, title = {Low-rank binary matrix approximation in column-sum norm}, journal = {CoRR}, volume = {abs/1904.06141}, year = {2019}, url = {http://arxiv.org/abs/1904.06141}, eprinttype = {arXiv}, eprint = {1904.06141}, timestamp = {Thu, 25 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1904-06141.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1905-04124, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Kirill Simonov}, title = {Refined Complexity of {PCA} with Outliers}, journal = {CoRR}, volume = {abs/1905.04124}, year = {2019}, url = {http://arxiv.org/abs/1905.04124}, eprinttype = {arXiv}, eprint = {1905.04124}, timestamp = {Mon, 27 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1905-04124.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-02919, author = {Petr A. Golovach and Giannos Stamoulis and Dimitrios M. Thilikos}, title = {Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable}, journal = {CoRR}, volume = {abs/1907.02919}, year = {2019}, url = {http://arxiv.org/abs/1907.02919}, eprinttype = {arXiv}, eprint = {1907.02919}, timestamp = {Mon, 08 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-02919.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachHKKSV18, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Sigve Hortemo S{\ae}ther and Yngve Villanger}, title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width}, journal = {Algorithmica}, volume = {80}, number = {2}, pages = {714--741}, year = {2018}, url = {https://doi.org/10.1007/s00453-017-0289-1}, doi = {10.1007/S00453-017-0289-1}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKKSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CochefertCGKPS18, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Computing square roots of graphs with low maximum degree}, journal = {Discret. Appl. Math.}, volume = {248}, pages = {93--101}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2017.04.041}, doi = {10.1016/J.DAM.2017.04.041}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CochefertCGKPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/GolovachHK18, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch}, title = {Enumeration and maximum number of minimal connected vertex covers in graphs}, journal = {Eur. J. Comb.}, volume = {68}, pages = {132--147}, year = {2018}, url = {https://doi.org/10.1016/j.ejc.2017.07.015}, doi = {10.1016/J.EJC.2017.07.015}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/GolovachHK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GolovachKPS18, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Finding Cactus Roots in Polynomial Time}, journal = {Theory Comput. Syst.}, volume = {62}, number = {6}, pages = {1409--1426}, year = {2018}, url = {https://doi.org/10.1007/s00224-017-9825-2}, doi = {10.1007/S00224-017-9825-2}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/GolovachKPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGLS18, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Covering Vectors by Spaces: Regular Matroids}, journal = {{SIAM} J. Discret. Math.}, volume = {32}, number = {4}, pages = {2512--2565}, year = {2018}, url = {https://doi.org/10.1137/17M1151250}, doi = {10.1137/17M1151250}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGLS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGT18, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Structured Connectivity Augmentation}, journal = {{SIAM} J. Discret. Math.}, volume = {32}, number = {4}, pages = {2612--2635}, year = {2018}, url = {https://doi.org/10.1137/17M1146233}, doi = {10.1137/17M1146233}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGR18, author = {Fedor V. Fomin and Petr A. Golovach and Jean{-}Florent Raymond}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {On the Tractability of Optimization Problems on H-Graphs}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {30:1--30:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.30}, doi = {10.4230/LIPICS.ESA.2018.30}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominGR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGP18, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Parameterized Low-Rank Binary Matrix Approximation}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {53:1--53:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.53}, doi = {10.4230/LIPICS.ICALP.2018.53}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GolovachL0Z18, author = {Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh and Meirav Zehavi}, editor = {Artur Czumaj}, title = {Cliquewidth {III:} The Odd Case of Graph Coloring Parameterized by Cliquewidth}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {262--273}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.19}, doi = {10.1137/1.9781611975031.19}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/GolovachL0Z18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/FominGST18, author = {Fedor V. Fomin and Petr A. Golovach and Torstein J. F. Str{\o}mme and Dimitrios M. Thilikos}, editor = {David Eppstein}, title = {Partial Complementation of Graphs}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2018, June 18-20, 2018, Malm{\"{o}}, Sweden}, series = {LIPIcs}, volume = {101}, pages = {21:1--21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.21}, doi = {10.4230/LIPICS.SWAT.2018.21}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/swat/FominGST18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GolovachHKLP18, author = {Petr A. Golovach and Pinar Heggernes and Athanasios L. Konstantinidis and Paloma T. Lima and Charis Papadopoulos}, editor = {David Eppstein}, title = {Parameterized Aspects of Strong Subgraph Closure}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2018, June 18-20, 2018, Malm{\"{o}}, Sweden}, series = {LIPIcs}, volume = {101}, pages = {23:1--23:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.23}, doi = {10.4230/LIPICS.SWAT.2018.23}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/GolovachHKLP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-10386, author = {Petr A. Golovach and Pinar Heggernes and Athanasios L. Konstantinidis and Paloma T. Lima and Charis Papadopoulos}, title = {Parameterized Aspects of Strong Subgraph Closure}, journal = {CoRR}, volume = {abs/1802.10386}, year = {2018}, url = {http://arxiv.org/abs/1802.10386}, eprinttype = {arXiv}, eprint = {1802.10386}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-10386.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1803-06102, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan}, title = {Parameterized Low-Rank Binary Matrix Approximation}, journal = {CoRR}, volume = {abs/1803.06102}, year = {2018}, url = {http://arxiv.org/abs/1803.06102}, eprinttype = {arXiv}, eprint = {1803.06102}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1803-06102.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1803-09483, author = {Petr A. Golovach and Dimitrios M. Thilikos}, title = {Clustering to Given Connectivities}, journal = {CoRR}, volume = {abs/1803.09483}, year = {2018}, url = {http://arxiv.org/abs/1803.09483}, eprinttype = {arXiv}, eprint = {1803.09483}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1803-09483.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-10920, author = {Fedor V. Fomin and Petr A. Golovach and Torstein J. F. Str{\o}mme and Dimitrios M. Thilikos}, title = {Partial complementation of graphs}, journal = {CoRR}, volume = {abs/1804.10920}, year = {2018}, url = {http://arxiv.org/abs/1804.10920}, eprinttype = {arXiv}, eprint = {1804.10920}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-10920.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-04375, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {On the Parameterized Complexity of Graph Modification to First-Order Logic Properties}, journal = {CoRR}, volume = {abs/1805.04375}, year = {2018}, url = {http://arxiv.org/abs/1805.04375}, eprinttype = {arXiv}, eprint = {1805.04375}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-04375.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-07156, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh}, title = {Approximation Schemes for Low-Rank Binary Matrix Approximation Problems}, journal = {CoRR}, volume = {abs/1807.07156}, year = {2018}, url = {http://arxiv.org/abs/1807.07156}, eprinttype = {arXiv}, eprint = {1807.07156}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-07156.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/FernauGS18, author = {Henning Fernau and Petr A. Golovach and Marie{-}France Sagot}, title = {Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421)}, journal = {Dagstuhl Reports}, volume = {8}, number = {10}, pages = {63--86}, year = {2018}, url = {https://doi.org/10.4230/DagRep.8.10.63}, doi = {10.4230/DAGREP.8.10.63}, timestamp = {Fri, 11 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/FernauGS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BliznetsFGKKS17, author = {Ivan Bliznets and Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov and Saket Saurabh}, title = {Parameterized Complexity of Superstring Problems}, journal = {Algorithmica}, volume = {79}, number = {3}, pages = {798--813}, year = {2017}, url = {https://doi.org/10.1007/s00453-016-0193-0}, doi = {10.1007/S00453-016-0193-0}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BliznetsFGKKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHKKV17, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Yngve Villanger}, title = {Minimal dominating sets in interval graphs and trees}, journal = {Discret. Appl. Math.}, volume = {216}, pages = {162--170}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2016.01.038}, doi = {10.1016/J.DAM.2016.01.038}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachHKKV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHLMSSS17, author = {Petr A. Golovach and Pinar Heggernes and Nathan Lindzey and Ross M. McConnell and Vin{\'{\i}}cius Fernandes dos Santos and Jeremy P. Spinrad and Jayme Luiz Szwarcfiter}, title = {On recognition of threshold tolerance graphs and their complements}, journal = {Discret. Appl. Math.}, volume = {216}, pages = {171--180}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2015.01.034}, doi = {10.1016/J.DAM.2015.01.034}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachHLMSSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachPS17, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Iain A. Stewart}, title = {Graph editing to a fixed target}, journal = {Discret. Appl. Math.}, volume = {216}, pages = {181--190}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2014.07.008}, doi = {10.1016/J.DAM.2014.07.008}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Golovach17, author = {Petr A. Golovach}, title = {Editing to a connected graph of given degrees}, journal = {Inf. Comput.}, volume = {256}, pages = {131--147}, year = {2017}, url = {https://doi.org/10.1016/j.ic.2017.04.013}, doi = {10.1016/J.IC.2017.04.013}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Golovach17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DabrowskiGHPT17, author = {Konrad Kazimierz Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Editing to a planar graph of given degrees}, journal = {J. Comput. Syst. Sci.}, volume = {85}, pages = {168--182}, year = {2017}, url = {https://doi.org/10.1016/j.jcss.2016.11.009}, doi = {10.1016/J.JCSS.2016.11.009}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DabrowskiGHPT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GolovachJPS17, author = {Petr A. Golovach and Matthew Johnson and Dani{\"{e}}l Paulusma and Jian Song}, title = {A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs}, journal = {J. Graph Theory}, volume = {84}, number = {4}, pages = {331--363}, year = {2017}, url = {https://doi.org/10.1002/jgt.22028}, doi = {10.1002/JGT.22028}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/GolovachJPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/FominGKK17, author = {Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov}, title = {Parameterized Complexity of Secluded Connectivity Problems}, journal = {Theory Comput. Syst.}, volume = {61}, number = {3}, pages = {795--819}, year = {2017}, url = {https://doi.org/10.1007/s00224-016-9717-x}, doi = {10.1007/S00224-016-9717-X}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/FominGKK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GolovachKMT17, author = {Petr A. Golovach and Marcin Kaminski and Spyridon Maniatis and Dimitrios M. Thilikos}, title = {The Parameterized Complexity of Graph Cyclability}, journal = {{SIAM} J. Discret. Math.}, volume = {31}, number = {1}, pages = {511--541}, year = {2017}, url = {https://doi.org/10.1137/141000014}, doi = {10.1137/141000014}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GolovachKMT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BelmonteFGR17, author = {R{\'{e}}my Belmonte and Fedor V. Fomin and Petr A. Golovach and M. S. Ramanujan}, title = {Metric Dimension of Bounded Tree-length Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {31}, number = {2}, pages = {1217--1243}, year = {2017}, url = {https://doi.org/10.1137/16M1057383}, doi = {10.1137/16M1057383}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/BelmonteFGR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachM17, author = {Petr A. Golovach and George B. Mertzios}, title = {Graph editing to a given degree sequence}, journal = {Theor. Comput. Sci.}, volume = {665}, pages = {1--12}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.12.007}, doi = {10.1016/J.TCS.2016.12.007}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKPS17, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {A linear kernel for finding square roots of almost planar graphs}, journal = {Theor. Comput. Sci.}, volume = {689}, pages = {36--47}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.05.008}, doi = {10.1016/J.TCS.2017.05.008}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/GolovachKS17, author = {Petr A. Golovach and Dieter Kratsch and Mohamed Yosri Sayadi}, editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos}, title = {Enumeration of Maximal Irredundant Sets for Claw-Free Graphs}, booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC} 2017, Athens, Greece, May 24-26, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10236}, pages = {297--309}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-57586-5\_25}, doi = {10.1007/978-3-319-57586-5\_25}, timestamp = {Thu, 24 Mar 2022 11:08:56 +0100}, biburl = {https://dblp.org/rec/conf/ciac/GolovachKS17.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/icalp/FominGLS17, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {Covering Vectors by Spaces: Regular Matroids}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {56:1--56:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.56}, doi = {10.4230/LIPICS.ICALP.2017.56}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachHLM17, author = {Petr A. Golovach and Pinar Heggernes and Paloma T. Lima and Pedro Montealegre}, editor = {Daniel Lokshtanov and Naomi Nishimura}, title = {Finding Connected Secluded Subgraphs}, booktitle = {12th International Symposium on Parameterized and Exact Computation, {IPEC} 2017, September 6-8, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {89}, pages = {18:1--18:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.18}, doi = {10.4230/LIPICS.IPEC.2017.18}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachHLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/FominGT17, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean{-}Fran{\c{c}}ois Raskin}, title = {Structured Connectivity Augmentation}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark}, series = {LIPIcs}, volume = {83}, pages = {29:1--29:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.29}, doi = {10.4230/LIPICS.MFCS.2017.29}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/FominGT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGLS17, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, editor = {Philip N. Klein}, title = {Spanning Circuits in Regular Matroids}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1433--1441}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.93}, doi = {10.1137/1.9781611974782.93}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/FominGLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHKLP17, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Paloma T. Lima and Dani{\"{e}}l Paulusma}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {275--288}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_21}, doi = {10.1007/978-3-319-68705-6\_21}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHKLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKLS17, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10520}, pages = {289--302}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_22}, doi = {10.1007/978-3-319-68705-6\_22}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachKLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Golovach0MPS17, author = {Petr A. Golovach and Matthew Johnson and Barnaby Martin and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Surjective H-Colouring: New Hardness Results}, journal = {CoRR}, volume = {abs/1701.02188}, year = {2017}, url = {http://arxiv.org/abs/1701.02188}, eprinttype = {arXiv}, eprint = {1701.02188}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Golovach0MPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachHKLP17, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Paloma T. Lima and Dani{\"{e}}l Paulusma}, title = {Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2}, journal = {CoRR}, volume = {abs/1703.05102}, year = {2017}, url = {http://arxiv.org/abs/1703.05102}, eprinttype = {arXiv}, eprint = {1703.05102}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachHKLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FominGT17, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Structured Connectivity Augmentation}, journal = {CoRR}, volume = {abs/1706.04255}, year = {2017}, url = {http://arxiv.org/abs/1706.04255}, eprinttype = {arXiv}, eprint = {1706.04255}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FominGT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1709-09737, author = {Fedor V. Fomin and Petr A. Golovach and Jean{-}Florent Raymond}, title = {On the tractability of optimization problems on H-graphs}, journal = {CoRR}, volume = {abs/1709.09737}, year = {2017}, url = {http://arxiv.org/abs/1709.09737}, eprinttype = {arXiv}, eprint = {1709.09737}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1709-09737.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-02300, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Covering vectors by spaces: Regular matroids}, journal = {CoRR}, volume = {abs/1710.02300}, year = {2017}, url = {http://arxiv.org/abs/1710.02300}, eprinttype = {arXiv}, eprint = {1710.02300}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-02300.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-10979, author = {Petr A. Golovach and Pinar Heggernes and Paloma T. Lima and Pedro Montealegre}, title = {Finding Connected Secluded Subgraphs}, journal = {CoRR}, volume = {abs/1710.10979}, year = {2017}, url = {http://arxiv.org/abs/1710.10979}, eprinttype = {arXiv}, eprint = {1710.10979}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-10979.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Cochefert0GKP16, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Parameterized Algorithms for Finding Square Roots}, journal = {Algorithmica}, volume = {74}, number = {2}, pages = {602--629}, year = {2016}, url = {https://doi.org/10.1007/s00453-014-9967-4}, doi = {10.1007/S00453-014-9967-4}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Cochefert0GKP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHKKV16, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Yngve Villanger}, title = {Enumerating minimal dominating sets in chordal bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {199}, pages = {30--36}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2014.12.010}, doi = {10.1016/J.DAM.2014.12.010}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachHKKV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/AbramovskayaFGP16, author = {Tatjana V. Abramovskaya and Fedor V. Fomin and Petr A. Golovach and Michal Pilipczuk}, title = {How to hunt an invisible rabbit on a graph}, journal = {Eur. J. Comb.}, volume = {52}, pages = {12--26}, year = {2016}, url = {https://doi.org/10.1016/j.ejc.2015.08.002}, doi = {10.1016/J.EJC.2015.08.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/AbramovskayaFGP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Squares of Low Clique Number}, journal = {Electron. Notes Discret. Math.}, volume = {55}, pages = {195--198}, year = {2016}, url = {https://doi.org/10.1016/j.endm.2016.10.048}, doi = {10.1016/J.ENDM.2016.10.048}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ChitnisFG16, author = {Rajesh Chitnis and Fedor V. Fomin and Petr A. Golovach}, title = {Parameterized complexity of the anchored k-core problem for directed graphs}, journal = {Inf. Comput.}, volume = {247}, pages = {11--22}, year = {2016}, url = {https://doi.org/10.1016/j.ic.2015.11.002}, doi = {10.1016/J.IC.2015.11.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ChitnisFG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DabrowskiGHP16, author = {Konrad Kazimierz Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Editing to Eulerian graphs}, journal = {J. Comput. Syst. Sci.}, volume = {82}, number = {2}, pages = {213--228}, year = {2016}, url = {https://doi.org/10.1016/j.jcss.2015.10.003}, doi = {10.1016/J.JCSS.2015.10.003}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DabrowskiGHP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachHK16, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch}, title = {Enumerating minimal connected dominating sets in graphs of bounded chordality}, journal = {Theor. Comput. Sci.}, volume = {630}, pages = {63--75}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.03.026}, doi = {10.1016/J.TCS.2016.03.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachHK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachPL16, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced disjoint paths in circular-arc graphs in linear time}, journal = {Theor. Comput. Sci.}, volume = {640}, pages = {70--83}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.06.003}, doi = {10.1016/J.TCS.2016.06.003}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachPL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/GolovachM16, author = {Petr A. Golovach and George B. Mertzios}, editor = {Alexander S. Kulikov and Gerhard J. Woeginger}, title = {Graph Editing to a Given Degree Sequence}, booktitle = {Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9691}, pages = {177--191}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-34171-2\_13}, doi = {10.1007/978-3-319-34171-2\_13}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/GolovachM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, editor = {Veli M{\"{a}}kinen and Simon J. Puglisi and Leena Salmela}, title = {Finding Cactus Roots in Polynomial Time}, booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016, Helsinki, Finland, August 17-19, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9843}, pages = {361--372}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-44543-4\_28}, doi = {10.1007/978-3-319-44543-4\_28}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominGPS16, author = {Fedor V. Fomin and Petr A. Golovach and Fahad Panolan and Saket Saurabh}, editor = {Nicolas Ollinger and Heribert Vollmer}, title = {Editing to Connected f-Degree Graph}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS} 2016, February 17-20, 2016, Orl{\'{e}}ans, France}, series = {LIPIcs}, volume = {47}, pages = {36:1--36:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.STACS.2016.36}, doi = {10.4230/LIPICS.STACS.2016.36}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/FominGPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, editor = {Rasmus Pagh}, title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2016, June 22-24, 2016, Reykjavik, Iceland}, series = {LIPIcs}, volume = {53}, pages = {4:1--4:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.4}, doi = {10.4230/LIPICS.SWAT.2016.4}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachM16, author = {Petr A. Golovach and George B. Mertzios}, title = {Graph Editing to a Given Degree Sequence}, journal = {CoRR}, volume = {abs/1601.03174}, year = {2016}, url = {http://arxiv.org/abs/1601.03174}, eprinttype = {arXiv}, eprint = {1601.03174}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BelmonteFGR16, author = {R{\'{e}}my Belmonte and Fedor V. Fomin and Petr A. Golovach and M. S. Ramanujan}, title = {Metric Dimension of Bounded Tree-length Graphs}, journal = {CoRR}, volume = {abs/1602.02610}, year = {2016}, url = {http://arxiv.org/abs/1602.02610}, eprinttype = {arXiv}, eprint = {1602.02610}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BelmonteFGR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachHK16, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch}, title = {Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs}, journal = {CoRR}, volume = {abs/1602.07504}, year = {2016}, url = {http://arxiv.org/abs/1602.07504}, eprinttype = {arXiv}, eprint = {1602.07504}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachHK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FominGLS16, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Spanning Circuits in Regular Matroids}, journal = {CoRR}, volume = {abs/1607.05516}, year = {2016}, url = {http://arxiv.org/abs/1607.05516}, eprinttype = {arXiv}, eprint = {1607.05516}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FominGLS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs}, journal = {CoRR}, volume = {abs/1608.06136}, year = {2016}, url = {http://arxiv.org/abs/1608.06136}, eprinttype = {arXiv}, eprint = {1608.06136}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Cochefert0GKPS16, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Squares of Low Maximum Degree}, journal = {CoRR}, volume = {abs/1608.06142}, year = {2016}, url = {http://arxiv.org/abs/1608.06142}, eprinttype = {arXiv}, eprint = {1608.06142}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Cochefert0GKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/0001GKP15, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {List Coloring in the Absence of a Linear Forest}, journal = {Algorithmica}, volume = {71}, number = {1}, pages = {21--35}, year = {2015}, url = {https://doi.org/10.1007/s00453-013-9777-0}, doi = {10.1007/S00453-013-9777-0}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/0001GKP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachHHMPP15, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Fredrik Manne and Dani{\"{e}}l Paulusma and Michal Pilipczuk}, title = {Modifying a Graph Using Vertex Elimination}, journal = {Algorithmica}, volume = {72}, number = {1}, pages = {99--125}, year = {2015}, url = {https://doi.org/10.1007/s00453-013-9848-2}, doi = {10.1007/S00453-013-9848-2}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHHMPP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GolovachHKV15, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Yngve Villanger}, title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets}, journal = {Algorithmica}, volume = {72}, number = {3}, pages = {836--859}, year = {2015}, url = {https://doi.org/10.1007/s00453-014-9875-7}, doi = {10.1007/S00453-014-9875-7}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachPR15, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Bernard Ries}, title = {Coloring graphs characterized by a forbidden subgraph}, journal = {Discret. Appl. Math.}, volume = {180}, pages = {101--110}, year = {2015}, url = {https://doi.org/10.1016/j.dam.2014.08.008}, doi = {10.1016/J.DAM.2014.08.008}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachPR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BroersmaFGKPP15, author = {Hajo Broersma and Jir{\'{\i}} Fiala and Petr A. Golovach and Tom{\'{a}}s Kaiser and Dani{\"{e}}l Paulusma and Andrzej Proskurowski}, title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs}, journal = {J. Graph Theory}, volume = {79}, number = {4}, pages = {282--299}, year = {2015}, url = {https://doi.org/10.1002/jgt.21832}, doi = {10.1002/JGT.21832}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/BroersmaFGKPP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/FominGNP15, author = {Fedor V. Fomin and Petr A. Golovach and Jesper Nederlof and Michal Pilipczuk}, title = {Minimizing Rosenthal Potential in Multicast Games}, journal = {Theory Comput. Syst.}, volume = {57}, number = {1}, pages = {81--96}, year = {2015}, url = {https://doi.org/10.1007/s00224-014-9573-5}, doi = {10.1007/S00224-014-9573-5}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/FominGNP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GolovachPL15, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in Claw-Free Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {29}, number = {1}, pages = {348--375}, year = {2015}, url = {https://doi.org/10.1137/140963200}, doi = {10.1137/140963200}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/GolovachPL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GolovachHHP15, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Christophe Paul}, title = {Hadwiger Number of Graphs with Small Chordality}, journal = {{SIAM} J. Discret. Math.}, volume = {29}, number = {3}, pages = {1427--1451}, year = {2015}, url = {https://doi.org/10.1137/140975279}, doi = {10.1137/140975279}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GolovachHHP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Golovach15, author = {Petr A. Golovach}, title = {Editing to a Graph of Given Degrees}, journal = {Theor. Comput. Sci.}, volume = {591}, pages = {72--84}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.04.034}, doi = {10.1016/J.TCS.2015.04.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Golovach15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/BliznetsFGKKS15, author = {Ivan Bliznets and Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov and Saket Saurabh}, editor = {Ferdinando Cicalese and Ely Porat and Ugo Vaccaro}, title = {Parameterized Complexity of Superstring Problems}, booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9133}, pages = {89--99}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-19929-0\_8}, doi = {10.1007/978-3-319-19929-0\_8}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BliznetsFGKKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/DabrowskiGHPT15, author = {Konrad Kazimierz Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, editor = {Lev D. Beklemishev and Daniil V. Musatov}, title = {Editing to a Planar Graph of Given Degrees}, booktitle = {Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9139}, pages = {143--156}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-20297-6\_10}, doi = {10.1007/978-3-319-20297-6\_10}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/csr/DabrowskiGHPT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FominGKK15, author = {Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov}, editor = {Prahladh Harsha and G. Ramalingam}, title = {Parameterized Complexity of Secluded Connectivity Problems}, booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015, Bangalore, India}, series = {LIPIcs}, volume = {45}, pages = {408--419}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.408}, doi = {10.4230/LIPICS.FSTTCS.2015.408}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FominGKK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachHKKSV15, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Sigve Hortemo S{\ae}ther and Yngve Villanger}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {248--258}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_22}, doi = {10.1007/978-3-662-48971-0\_22}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolovachHKKSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/GolovachHK15, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch}, editor = {Zsuzsanna Lipt{\'{a}}k and William F. Smyth}, title = {Enumeration and Maximum Number of Minimal Connected Vertex Covers in 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 = {235--247}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-29516-9\_20}, doi = {10.1007/978-3-319-29516-9\_20}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/GolovachHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachRT15, author = {Petr A. Golovach and Cl{\'{e}}ment Requil{\'{e}} and Dimitrios M. Thilikos}, editor = {Thore Husfeldt and Iyad A. Kanj}, title = {Variants of Plane Diameter Completion}, booktitle = {10th International Symposium on Parameterized and Exact Computation, {IPEC} 2015, September 16-18, 2015, Patras, Greece}, series = {LIPIcs}, volume = {43}, pages = {30--42}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.30}, doi = {10.4230/LIPICS.IPEC.2015.30}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachRT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachHK15, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch}, editor = {Thore Husfeldt and Iyad A. Kanj}, title = {Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality}, booktitle = {10th International Symposium on Parameterized and Exact Computation, {IPEC} 2015, September 16-18, 2015, Patras, Greece}, series = {LIPIcs}, volume = {43}, pages = {307--318}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.307}, doi = {10.4230/LIPICS.IPEC.2015.307}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BelmonteFGR15, author = {R{\'{e}}my Belmonte and Fedor V. Fomin and Petr A. Golovach and M. S. Ramanujan}, editor = {Giuseppe F. Italiano and Giovanni Pighizzini and Donald Sannella}, title = {Metric Dimension of Bounded Width Graphs}, booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9235}, pages = {115--126}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48054-0\_10}, doi = {10.1007/978-3-662-48054-0\_10}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/BelmonteFGR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colognetwente/AbramovskayaFGP15, author = {Tatjana V. Abramovskaya and Fedor V. Fomin and Petr A. Golovach and Michal Pilipczuk}, editor = {Ekrem Duman and Ali Fuat Alkaya}, title = {How to Hunt an Invisible Rabbit on a Graph}, booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015}, pages = {169--172}, year = {2015}, timestamp = {Thu, 02 Feb 2017 18:00:28 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/AbramovskayaFGP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BliznetsFGKKS15, author = {Ivan Bliznets and Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov and Saket Saurabh}, title = {Parameterized Complexity of Superstring Problems}, journal = {CoRR}, volume = {abs/1502.01461}, year = {2015}, url = {http://arxiv.org/abs/1502.01461}, eprinttype = {arXiv}, eprint = {1502.01461}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BliznetsFGKKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FominGKK15, author = {Fedor V. Fomin and Petr A. Golovach and Nikolay Karpov and Alexander S. Kulikov}, title = {Parameterized Complexity of Secluded Connectivity Problems}, journal = {CoRR}, volume = {abs/1502.03989}, year = {2015}, url = {http://arxiv.org/abs/1502.03989}, eprinttype = {arXiv}, eprint = {1502.03989}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FominGKK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AbramovskayaFGP15, author = {Tatjana V. Abramovskaya and Fedor V. Fomin and Petr A. Golovach and Michal Pilipczuk}, title = {How to Hunt an Invisible Rabbit on a Graph}, journal = {CoRR}, volume = {abs/1502.05614}, year = {2015}, url = {http://arxiv.org/abs/1502.05614}, eprinttype = {arXiv}, eprint = {1502.05614}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AbramovskayaFGP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DabrowskiGHPT15, author = {Konrad K. Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Editing to a Planar Graph of Given Degrees}, journal = {CoRR}, volume = {abs/1508.02773}, year = {2015}, url = {http://arxiv.org/abs/1508.02773}, eprinttype = {arXiv}, eprint = {1508.02773}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DabrowskiGHPT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachRT15, author = {Petr A. Golovach and Cl{\'{e}}ment Requil{\'{e}} and Dimitrios M. Thilikos}, title = {Variants of Plane Diameter Completion}, journal = {CoRR}, volume = {abs/1509.00757}, year = {2015}, url = {http://arxiv.org/abs/1509.00757}, eprinttype = {arXiv}, eprint = {1509.00757}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachRT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachHKKSV15, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Sigve Hortemo S{\ae}ther and Yngve Villanger}, title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width}, journal = {CoRR}, volume = {abs/1509.03753}, year = {2015}, url = {http://arxiv.org/abs/1509.03753}, eprinttype = {arXiv}, eprint = {1509.03753}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachHKKSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/BelmonteGHP14, author = {R{\'{e}}my Belmonte and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Parameterized complexity of three edge contraction problems with degree constraints}, journal = {Acta Informatica}, volume = {51}, number = {7}, pages = {473--497}, year = {2014}, url = {https://doi.org/10.1007/s00236-014-0204-z}, doi = {10.1007/S00236-014-0204-Z}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/BelmonteGHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BelmonteGHHKP14, author = {R{\'{e}}my Belmonte and Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Marcin Kaminski and Dani{\"{e}}l Paulusma}, title = {Detecting Fixed Patterns in Chordal Graphs in Polynomial Time}, journal = {Algorithmica}, volume = {69}, number = {3}, pages = {501--521}, year = {2014}, url = {https://doi.org/10.1007/s00453-013-9748-5}, doi = {10.1007/S00453-013-9748-5}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteGHHKP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachP14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma}, title = {List coloring in the absence of two subgraphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {123--130}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.010}, doi = {10.1016/J.DAM.2013.10.010}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachPS14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Coloring graphs without short cycles and long induced paths}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {107--120}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.008}, doi = {10.1016/J.DAM.2013.12.008}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHKR14, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Arash Rafiey}, title = {Finding clubs in graph classes}, journal = {Discret. Appl. Math.}, volume = {174}, pages = {57--65}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2014.04.016}, doi = {10.1016/J.DAM.2014.04.016}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachHKR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/GolovachPKT14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Marcin Kaminski and Dimitrios M. Thilikos}, title = {Lift-contractions}, journal = {Eur. J. Comb.}, volume = {35}, pages = {286--296}, year = {2014}, url = {https://doi.org/10.1016/j.ejc.2013.06.026}, doi = {10.1016/J.EJC.2013.06.026}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/GolovachPKT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GolovachPS14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Closing complexity gaps for coloring problems on H-free graphs}, journal = {Inf. Comput.}, volume = {237}, pages = {204--214}, year = {2014}, url = {https://doi.org/10.1016/j.ic.2014.02.004}, doi = {10.1016/J.IC.2014.02.004}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GolovachPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominG14, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Parameterized complexity of connected even/odd subgraph problems}, journal = {J. Comput. Syst. Sci.}, volume = {80}, number = {1}, pages = {157--179}, year = {2014}, url = {https://doi.org/10.1016/j.jcss.2013.07.002}, doi = {10.1016/J.JCSS.2013.07.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/GolovachHKS14, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Reza Saei}, title = {Subset feedback vertex sets in chordal graphs}, journal = {J. Discrete Algorithms}, volume = {26}, pages = {7--15}, year = {2014}, url = {https://doi.org/10.1016/j.jda.2013.09.005}, doi = {10.1016/J.JDA.2013.09.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/GolovachHKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FominGLS14, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {5}, pages = {1541--1563}, year = {2014}, url = {https://doi.org/10.1137/130910932}, doi = {10.1137/130910932}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FominGLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominG14, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Long Circuits and Large Euler Subgraphs}, journal = {{SIAM} J. Discret. Math.}, volume = {28}, number = {2}, pages = {878--892}, year = {2014}, url = {https://doi.org/10.1137/130936816}, doi = {10.1137/130936816}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DabrowskiGP14, author = {Konrad K. Dabrowski and Petr A. Golovach and Dani{\"{e}}l Paulusma}, title = {Colouring of graphs with Ramsey-type forbidden subgraphs}, journal = {Theor. Comput. Sci.}, volume = {522}, pages = {34--43}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.12.004}, doi = {10.1016/J.TCS.2013.12.004}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DabrowskiGP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BiroBGKP14, author = {P{\'{e}}ter Bir{\'{o}} and Matthijs Bomhoff and Petr A. Golovach and Walter Kern and Dani{\"{e}}l Paulusma}, title = {Solutions for the stable roommates problem with payments}, journal = {Theor. Comput. Sci.}, volume = {540}, pages = {53--61}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.03.027}, doi = {10.1016/J.TCS.2013.03.027}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BiroBGKP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/GolovachKMT14, author = {Petr A. Golovach and Marcin Jakub Kaminski and Spyridon Maniatis and Dimitrios M. Thilikos}, editor = {Andreas S. Schulz and Dorothea Wagner}, title = {The Parameterized Complexity of Graph Cyclability}, booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8737}, pages = {492--504}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44777-2\_41}, doi = {10.1007/978-3-662-44777-2\_41}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/GolovachKMT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/BasavarajuFGS14, author = {Manu Basavaraju and Fedor V. Fomin and Petr A. Golovach and Saket Saurabh}, editor = {Venkatesh Raman and S. P. Suresh}, title = {Connecting Vertices by Independent Trees}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India}, series = {LIPIcs}, volume = {29}, pages = {73--84}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.73}, doi = {10.4230/LIPICS.FSTTCS.2014.73}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/BasavarajuFGS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/DabrowskiGHP14, author = {Konrad Kazimierz Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, editor = {Venkatesh Raman and S. P. Suresh}, title = {Editing to Eulerian Graphs}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India}, series = {LIPIcs}, volume = {29}, pages = {97--108}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.97}, doi = {10.4230/LIPICS.FSTTCS.2014.97}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/DabrowskiGHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BasavarajuFGMRS14, author = {Manu Basavaraju and Fedor V. Fomin and Petr A. Golovach and Pranabendu Misra and M. S. Ramanujan and Saket Saurabh}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Parameterized Algorithms to Preserve Connectivity}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {800--811}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_66}, doi = {10.1007/978-3-662-43948-7\_66}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BasavarajuFGMRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/Golovach14, author = {Petr A. Golovach}, editor = {Marek Cygan and Pinar Heggernes}, title = {Editing to a Graph of Given Degrees}, 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 = {196--207}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13524-3\_17}, doi = {10.1007/978-3-319-13524-3\_17}, timestamp = {Sat, 19 Oct 2019 20:25:35 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/Golovach14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Golovach14, author = {Petr A. Golovach}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Editing to a Connected Graph of Given Degrees}, 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 = {324--335}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8\_28}, doi = {10.1007/978-3-662-44465-8\_28}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Golovach14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHHP14, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Christophe Paul}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Hadwiger Number of Graphs with Small Chordality}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {201--213}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_17}, doi = {10.1007/978-3-319-12340-0\_17}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHLMSS14, author = {Petr A. Golovach and Pinar Heggernes and Nathan Lindzey and Ross M. McConnell and Vin{\'{\i}}cius Fernandes dos Santos and Jeremy P. Spinrad}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Recognizing Threshold Tolerance Graphs in O(n\({}^{\mbox{2}}\)) Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {214--224}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_18}, doi = {10.1007/978-3-319-12340-0\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachHLMSS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachPL14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, editor = {Dieter Kratsch and Ioan Todinca}, title = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time}, booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8747}, pages = {225--237}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0\_19}, doi = {10.1007/978-3-319-12340-0\_19}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachPL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachPL14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time}, journal = {CoRR}, volume = {abs/1403.0789}, year = {2014}, url = {http://arxiv.org/abs/1403.0789}, eprinttype = {arXiv}, eprint = {1403.0789}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachPL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachHHP14, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Christophe Paul}, title = {Hadwiger number of graphs with small chordality}, journal = {CoRR}, volume = {abs/1406.3812}, year = {2014}, url = {http://arxiv.org/abs/1406.3812}, eprinttype = {arXiv}, eprint = {1406.3812}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachHHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Golovach0PS14, author = {Petr A. Golovach and Matthew Johnson and Dani{\"{e}}l Paulusma and Jian Song}, title = {A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs}, journal = {CoRR}, volume = {abs/1407.1482}, year = {2014}, url = {http://arxiv.org/abs/1407.1482}, eprinttype = {arXiv}, eprint = {1407.1482}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/Golovach0PS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DabrowskiGHP14, author = {Konrad K. Dabrowski and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Editing to Eulerian Graphs}, journal = {CoRR}, volume = {abs/1410.6863}, year = {2014}, url = {http://arxiv.org/abs/1410.6863}, eprinttype = {arXiv}, eprint = {1410.6863}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DabrowskiGHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachKMT14, author = {Petr A. Golovach and Marcin Jakub Kaminski and Spyridon Maniatis and Dimitrios M. Thilikos}, title = {The Parameterized Complexity of Graph Cyclability}, journal = {CoRR}, volume = {abs/1412.3955}, year = {2014}, url = {http://arxiv.org/abs/1412.3955}, eprinttype = {arXiv}, eprint = {1412.3955}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachKMT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachPS13, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {4-coloring H-free graphs when {H} is small}, journal = {Discret. Appl. Math.}, volume = {161}, number = {1-2}, pages = {140--150}, year = {2013}, url = {https://doi.org/10.1016/j.dam.2012.08.022}, doi = {10.1016/J.DAM.2012.08.022}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/BroersmaFGP13, author = {Hajo Broersma and Fedor V. Fomin and Petr A. Golovach and Dani{\"{e}}l Paulusma}, title = {Three complexity results on coloring Pk-free graphs}, journal = {Eur. J. Comb.}, volume = {34}, number = {3}, pages = {609--619}, year = {2013}, url = {https://doi.org/10.1016/j.ejc.2011.12.008}, doi = {10.1016/J.EJC.2011.12.008}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/BroersmaFGP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GolovachHHP13, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Choosability on H-free graphs}, journal = {Inf. Process. Lett.}, volume = {113}, number = {4}, pages = {107--110}, year = {2013}, url = {https://doi.org/10.1016/j.ipl.2012.12.003}, doi = {10.1016/J.IPL.2012.12.003}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GolovachHHP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CouturierGKLP13, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Artem V. Pyatkin}, title = {Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds}, journal = {Theory Comput. Syst.}, volume = {52}, number = {4}, pages = {645--667}, year = {2013}, url = {https://doi.org/10.1007/s00224-012-9410-7}, doi = {10.1007/S00224-012-9410-7}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/CouturierGKLP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachHP13, author = {Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Obtaining planarity by contracting few edges}, journal = {Theor. Comput. Sci.}, volume = {476}, pages = {38--46}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.041}, doi = {10.1016/J.TCS.2012.12.041}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GolovachHP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKPT13, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Increasing the minimum degree of a graph by contractions}, journal = {Theor. Comput. Sci.}, volume = {481}, pages = {74--84}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.02.030}, doi = {10.1016/J.TCS.2013.02.030}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKP13, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Detecting induced minors in AT-free graphs}, journal = {Theor. Comput. Sci.}, volume = {482}, pages = {20--32}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.02.029}, doi = {10.1016/J.TCS.2013.02.029}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BroersmaGP13, author = {Hajo Broersma and Petr A. Golovach and Viresh Patel}, title = {Tight complexity bounds for {FPT} subgraph problems parameterized by the clique-width}, journal = {Theor. Comput. Sci.}, volume = {485}, pages = {69--84}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.03.008}, doi = {10.1016/J.TCS.2013.03.008}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BroersmaGP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/ChitnisFG13, author = {Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach}, editor = {Marie desJardins and Michael L. Littman}, title = {Preventing Unraveling in Social Networks Gets Harder}, booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}}, pages = {1085--1091}, publisher = {{AAAI} Press}, year = {2013}, url = {https://doi.org/10.1609/aaai.v27i1.8462}, doi = {10.1609/AAAI.V27I1.8462}, timestamp = {Mon, 04 Sep 2023 15:56:33 +0200}, biburl = {https://dblp.org/rec/conf/aaai/ChitnisFG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/GolovachHKR13, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Arash Rafiey}, editor = {Paul G. Spirakis and Maria J. Serna}, title = {Cliques and Clubs}, booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013, Barcelona, Spain, May 22-24, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7878}, pages = {276--287}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38233-8\_23}, doi = {10.1007/978-3-642-38233-8\_23}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/GolovachHKR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/GolovachP13, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma}, editor = {Paul G. Spirakis and Maria J. Serna}, title = {List Coloring in the Absence of Two Subgraphs}, booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013, Barcelona, Spain, May 22-24, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7878}, pages = {288--299}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38233-8\_24}, doi = {10.1007/978-3-642-38233-8\_24}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/GolovachP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominG13, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Hans L. Bodlaender and Giuseppe F. Italiano}, title = {Long Circuits and Large Euler Subgraphs}, booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8125}, pages = {493--504}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40450-4\_42}, doi = {10.1007/978-3-642-40450-4\_42}, timestamp = {Mon, 03 Jan 2022 22:19:39 +0100}, biburl = {https://dblp.org/rec/conf/esa/FominG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/ChitnisFG13, author = {Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach}, editor = {Anil Seth and Nisheeth K. Vishnoi}, title = {Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs}, booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013, Guwahati, India}, series = {LIPIcs}, volume = {24}, pages = {79--90}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2013}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.79}, doi = {10.4230/LIPICS.FSTTCS.2013.79}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/ChitnisFG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GolovachHKV13, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Yngve Villanger}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7965}, pages = {485--496}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39206-1\_41}, doi = {10.1007/978-3-642-39206-1\_41}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GolovachHKV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/GolovachPS13, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Iain A. Stewart}, editor = {Thierry Lecroq and Laurent Mouchard}, title = {Graph Editing to a Fixed Target}, booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8288}, pages = {192--205}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45278-9\_17}, doi = {10.1007/978-3-642-45278-9\_17}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/GolovachPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/BelmonteGHP13, author = {R{\'{e}}my Belmonte and Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, editor = {Gregory Z. Gutin and Stefan Szeider}, title = {Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints}, booktitle = {Parameterized and Exact Computation - 8th International Symposium, {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8246}, pages = {16--27}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03898-8\_3}, doi = {10.1007/978-3-319-03898-8\_3}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/BelmonteGHP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/FominGK13, author = {Fedor V. Fomin and Petr A. Golovach and Janne H. Korhonen}, editor = {Krishnendu Chatterjee and Jir{\'{\i}} Sgall}, title = {On the Parameterized Complexity of Cutting a Few Vertices from a Graph}, booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8087}, pages = {421--432}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40313-2\_38}, doi = {10.1007/978-3-642-40313-2\_38}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/FominGK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFGKPP13, author = {Hajo Broersma and Jir{\'{\i}} Fiala and Petr A. Golovach and Tom{\'{a}}s Kaiser and Dani{\"{e}}l Paulusma and Andrzej Proskurowski}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {127--138}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_12}, doi = {10.1007/978-3-642-45043-3\_12}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFGKPP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CochefertCGKP13, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Sparse Square Roots}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {177--188}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_16}, doi = {10.1007/978-3-642-45043-3\_16}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CochefertCGKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DabrowskiGP13, author = {Konrad K. Dabrowski and Petr A. Golovach and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Colouring of Graphs with Ramsey-Type Forbidden Subgraphs}, booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {8165}, pages = {201--212}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_18}, doi = {10.1007/978-3-642-45043-3\_18}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DabrowskiGP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-5953, author = {Hajo Broersma and Jir{\'{\i}} Fiala and Petr A. Golovach and Tom{\'{a}}s Kaiser and Dani{\"{e}}l Paulusma and Andrzej Proskurowski}, title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs}, journal = {CoRR}, volume = {abs/1301.5953}, year = {2013}, url = {http://arxiv.org/abs/1301.5953}, eprinttype = {arXiv}, eprint = {1301.5953}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-5953.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-5746, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Long Circuits and Large Euler Subgraphs}, journal = {CoRR}, volume = {abs/1304.5746}, year = {2013}, url = {http://arxiv.org/abs/1304.5746}, eprinttype = {arXiv}, eprint = {1304.5746}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-5746.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-5870, author = {Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach}, title = {Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs}, journal = {CoRR}, volume = {abs/1304.5870}, year = {2013}, url = {http://arxiv.org/abs/1304.5870}, eprinttype = {arXiv}, eprint = {1304.5870}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-5870.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-6189, author = {Fedor V. Fomin and Petr A. Golovach and Janne H. Korhonen}, title = {On the parameterized complexity of cutting a few vertices from a graph}, journal = {CoRR}, volume = {abs/1304.6189}, year = {2013}, url = {http://arxiv.org/abs/1304.6189}, eprinttype = {arXiv}, eprint = {1304.6189}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-6189.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-6420, author = {Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach}, title = {Preventing Unraveling in Social Networks Gets Harder}, journal = {CoRR}, volume = {abs/1304.6420}, year = {2013}, url = {http://arxiv.org/abs/1304.6420}, eprinttype = {arXiv}, eprint = {1304.6420}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-6420.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Golovach13, author = {Petr A. Golovach}, title = {Editing to a Connected Graph of Given Degrees}, journal = {CoRR}, volume = {abs/1308.1802}, year = {2013}, url = {http://arxiv.org/abs/1308.1802}, eprinttype = {arXiv}, eprint = {1308.1802}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Golovach13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FominGNP13, author = {Fedor V. Fomin and Petr A. Golovach and Jesper Nederlof and Michal Pilipczuk}, title = {Minimizing Rosenthal Potential in Multicast Games}, journal = {CoRR}, volume = {abs/1309.6797}, year = {2013}, url = {http://arxiv.org/abs/1309.6797}, eprinttype = {arXiv}, eprint = {1309.6797}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FominGNP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CochefertCGKP13, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Parameterized Algorithms for Finding Square Roots}, journal = {CoRR}, volume = {abs/1310.5469}, year = {2013}, url = {http://arxiv.org/abs/1310.5469}, eprinttype = {arXiv}, eprint = {1310.5469}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CochefertCGKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Golovach13a, author = {Petr A. Golovach}, title = {Editing to a Graph of Given Degrees}, journal = {CoRR}, volume = {abs/1311.4768}, year = {2013}, url = {http://arxiv.org/abs/1311.4768}, eprinttype = {arXiv}, eprint = {1311.4768}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Golovach13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/GolovachLMP12, author = {Petr A. Golovach and Bernard Lidick{\'{y}} and Barnaby Martin and Dani{\"{e}}l Paulusma}, title = {Finding vertex-surjective graph homomorphisms}, journal = {Acta Informatica}, volume = {49}, number = {6}, pages = {381--394}, year = {2012}, url = {https://doi.org/10.1007/s00236-012-0164-0}, doi = {10.1007/S00236-012-0164-0}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/acta/GolovachLMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BodlaenderFGOL12, author = {Hans L. Bodlaender and Fedor V. Fomin and Petr A. Golovach and Yota Otachi and Erik Jan van Leeuwen}, title = {Parameterized Complexity of the Spanning Tree Congestion Problem}, journal = {Algorithmica}, volume = {64}, number = {1}, pages = {85--111}, year = {2012}, url = {https://doi.org/10.1007/s00453-011-9565-7}, doi = {10.1007/S00453-011-9565-7}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderFGOL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachKPT12, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Containment relations in split graphs}, journal = {Discret. Appl. Math.}, volume = {160}, number = {1-2}, pages = {155--163}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2011.10.004}, doi = {10.1016/J.DAM.2011.10.004}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachKPT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachHM12, author = {Petr A. Golovach and Pinar Heggernes and Rodica Mihai}, title = {Edge search number of cographs}, journal = {Discret. Appl. Math.}, volume = {160}, number = {6}, pages = {734--743}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2011.04.020}, doi = {10.1016/J.DAM.2011.04.020}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachHM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FialaGKLP12, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Bernard Lidick{\'{y}} and Dani{\"{e}}l Paulusma}, title = {Distance three labelings of trees}, journal = {Discret. Appl. Math.}, volume = {160}, number = {6}, pages = {764--779}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2011.02.004}, doi = {10.1016/J.DAM.2011.02.004}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FialaGKLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachKS12, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l and Ondrej Such{\'{y}}}, title = {Parameterized complexity of generalized domination problems}, journal = {Discret. Appl. Math.}, volume = {160}, number = {6}, pages = {780--792}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2010.11.012}, doi = {10.1016/J.DAM.2010.11.012}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CouturierGKP12, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {On the parameterized complexity of coloring graphs in the absence of a linear forest}, journal = {J. Discrete Algorithms}, volume = {15}, pages = {56--62}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2012.04.008}, doi = {10.1016/J.JDA.2012.04.008}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CouturierGKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/FominGL12, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov}, title = {Cops and Robber Game Without Recharging}, journal = {Theory Comput. Syst.}, volume = {50}, number = {4}, pages = {611--620}, year = {2012}, url = {https://doi.org/10.1007/s00224-011-9360-5}, doi = {10.1007/S00224-011-9360-5}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/FominGL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGP12, author = {Fedor V. Fomin and Petr A. Golovach and Pawel Pralat}, title = {Cops and Robber with Constraints}, journal = {{SIAM} J. Discret. Math.}, volume = {26}, number = {2}, pages = {571--590}, year = {2012}, url = {https://doi.org/10.1137/110837759}, doi = {10.1137/110837759}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BroersmaGPS12, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Updating the complexity status of coloring graphs without a fixed induced linear forest}, journal = {Theor. Comput. Sci.}, volume = {414}, number = {1}, pages = {9--19}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.10.005}, doi = {10.1016/J.TCS.2011.10.005}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKPT12, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Induced packing of odd cycles in planar graphs}, journal = {Theor. Comput. Sci.}, volume = {420}, pages = {28--35}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.11.004}, doi = {10.1016/J.TCS.2011.11.004}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BroersmaGPS12a, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Determining the chromatic number of triangle-free 2P\({}_{\mbox{3}}\)-free graphs in polynomial time}, journal = {Theor. Comput. Sci.}, volume = {423}, pages = {1--10}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.076}, doi = {10.1016/J.TCS.2011.12.076}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachPS12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Computing vertex-surjective homomorphisms to partially reflexive trees}, journal = {Theor. Comput. Sci.}, volume = {457}, pages = {86--100}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.039}, doi = {10.1016/J.TCS.2012.06.039}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/GolovachLMP12, author = {Petr A. Golovach and Bernard Lidick{\'{y}} and Barnaby Martin and Dani{\"{e}}l Paulusma}, editor = {Edward A. Hirsch and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Michail Kh. Prilutskii}, title = {Finding Vertex-Surjective Graph Homomorphisms}, booktitle = {Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7353}, pages = {160--171}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30642-6\_16}, doi = {10.1007/978-3-642-30642-6\_16}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/csr/GolovachLMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/GolovachPL12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, editor = {Leah Epstein and Paolo Ferragina}, title = {Induced Disjoint Paths in Claw-Free Graphs}, booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7501}, pages = {515--526}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33090-2\_45}, doi = {10.1007/978-3-642-33090-2\_45}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/GolovachPL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGNP12, author = {Fedor V. Fomin and Petr A. Golovach and Jesper Nederlof and Michal Pilipczuk}, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Minimizing Rosenthal Potential in Multicast Games}, booktitle = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7392}, pages = {525--536}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31585-5\_47}, doi = {10.1007/978-3-642-31585-5\_47}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FominGNP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachPS12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Closing Complexity Gaps for Coloring Problems on H-Free Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {14--23}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_5}, doi = {10.1007/978-3-642-35261-4\_5}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GolovachPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachKP12, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Detecting Induced Minors in AT-Free Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {495--505}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_52}, doi = {10.1007/978-3-642-35261-4\_52}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolovachKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachHKS12, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Reza Saei}, editor = {Dimitrios M. Thilikos and Gerhard J. Woeginger}, title = {An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs}, booktitle = {Parameterized and Exact Computation - 7th International Symposium, {IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7535}, pages = {85--96}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33293-7\_10}, doi = {10.1007/978-3-642-33293-7\_10}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachHKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/FominGGSSLVV12, author = {Fedor V. Fomin and Serge Gaspers and Petr A. Golovach and Karol Suchan and Stefan Szeider and Erik Jan van Leeuwen and Martin Vatshelle and Yngve Villanger}, editor = {David Fern{\'{a}}ndez{-}Baca}, title = {k-Gap Interval Graphs}, booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7256}, pages = {350--361}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-29344-3\_30}, doi = {10.1007/978-3-642-29344-3\_30}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/latin/FominGGSSLVV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GolovachPR12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Bernard Ries}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, title = {Coloring Graphs Characterized by a Forbidden Subgraph}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, pages = {443--454}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32589-2\_40}, doi = {10.1007/978-3-642-32589-2\_40}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GolovachPR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GolovachHP12, author = {Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, title = {Obtaining Planarity by Contracting Few Edges}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, pages = {455--466}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32589-2\_41}, doi = {10.1007/978-3-642-32589-2\_41}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GolovachHP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/GolovachPS12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {M{\'{a}}ria Bielikov{\'{a}} and Gerhard Friedrich and Georg Gottlob and Stefan Katzenbeisser and Gy{\"{o}}rgy Tur{\'{a}}n}, title = {4-Coloring H-Free Graphs When {H} Is Small}, booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7147}, pages = {289--300}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-27660-6\_24}, doi = {10.1007/978-3-642-27660-6\_24}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sofsem/GolovachPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominG12, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Christoph D{\"{u}}rr and Thomas Wilke}, title = {Parameterized Complexity of Connected Even/Odd Subgraph Problems}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2012, February 29th - March 3rd, 2012, Paris, France}, series = {LIPIcs}, volume = {14}, pages = {432--440}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2012}, url = {https://doi.org/10.4230/LIPIcs.STACS.2012.432}, doi = {10.4230/LIPICS.STACS.2012.432}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/FominG12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GolovachPL12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, editor = {Fedor V. Fomin and Petteri Kaski}, title = {Induced Disjoint Paths in AT-Free Graphs}, booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7357}, pages = {153--164}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31155-0\_14}, doi = {10.1007/978-3-642-31155-0\_14}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/GolovachPL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BiroBGKP12, author = {P{\'{e}}ter Bir{\'{o}} and Matthijs Bomhoff and Petr A. Golovach and Walter Kern and Dani{\"{e}}l Paulusma}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {Solutions for the Stable Roommates Problem with Payments}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {69--80}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_10}, doi = {10.1007/978-3-642-34611-8\_10}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BiroBGKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachHHMPP12, author = {Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Fredrik Manne and Dani{\"{e}}l Paulusma and Michal Pilipczuk}, editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern}, title = {How to Eliminate a Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers}, series = {Lecture Notes in Computer Science}, volume = {7551}, pages = {320--331}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34611-8\_32}, doi = {10.1007/978-3-642-34611-8\_32}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachHHMPP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1202-4419, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in Claw-Free Graphs}, journal = {CoRR}, volume = {abs/1202.4419}, year = {2012}, url = {http://arxiv.org/abs/1202.4419}, eprinttype = {arXiv}, eprint = {1202.4419}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1202-4419.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-2124, author = {Petr A. Golovach and Bernard Lidick{\'{y}} and Barnaby Martin and Dani{\"{e}}l Paulusma}, title = {Finding vertex-surjective graph homomorphisms}, journal = {CoRR}, volume = {abs/1204.2124}, year = {2012}, url = {http://arxiv.org/abs/1204.2124}, eprinttype = {arXiv}, eprint = {1204.2124}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-2124.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-5113, author = {Petr A. Golovach and Pim van 't Hof and Dani{\"{e}}l Paulusma}, title = {Obtaining Planarity by Contracting Few Edges}, journal = {CoRR}, volume = {abs/1204.5113}, year = {2012}, url = {http://arxiv.org/abs/1204.5113}, eprinttype = {arXiv}, eprint = {1204.5113}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-5113.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1208-5345, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Yngve Villanger}, title = {Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay}, journal = {CoRR}, volume = {abs/1208.5345}, year = {2012}, url = {http://arxiv.org/abs/1208.5345}, eprinttype = {arXiv}, eprint = {1208.5345}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1208-5345.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGKKL11, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, title = {Branch and Recharge: Exact Algorithms for Generalized Domination}, journal = {Algorithmica}, volume = {61}, number = {2}, pages = {252--273}, year = {2011}, url = {https://doi.org/10.1007/s00453-010-9418-9}, doi = {10.1007/S00453-010-9418-9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGKKL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGHMVW11, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, title = {How to Guard a Graph?}, journal = {Algorithmica}, volume = {61}, number = {4}, pages = {839--856}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9382-4}, doi = {10.1007/S00453-009-9382-4}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGHMVW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/GolovachT11, author = {Petr A. Golovach and Dimitrios M. Thilikos}, title = {Paths of bounded length and their cuts: Parameterized complexity and algorithms}, journal = {Discret. Optim.}, volume = {8}, number = {1}, pages = {72--86}, year = {2011}, url = {https://doi.org/10.1016/j.disopt.2010.09.009}, doi = {10.1016/J.DISOPT.2010.09.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/GolovachT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GolovachKPT11, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Lift Contractions}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {407--412}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.066}, doi = {10.1016/J.ENDM.2011.09.066}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/GolovachKPT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominGL11, author = {Fedor V. Fomin and Petr A. Golovach and Erik Jan van Leeuwen}, title = {Spanners of bounded degree graphs}, journal = {Inf. Process. Lett.}, volume = {111}, number = {3}, pages = {142--144}, year = {2011}, url = {https://doi.org/10.1016/j.ipl.2010.10.021}, doi = {10.1016/J.IPL.2010.10.021}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FominGL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DraganFG11, author = {Feodor F. Dragan and Fedor V. Fomin and Petr A. Golovach}, title = {Spanners in sparse graphs}, journal = {J. Comput. Syst. Sci.}, volume = {77}, number = {6}, pages = {1108--1119}, year = {2011}, url = {https://doi.org/10.1016/j.jcss.2010.10.002}, doi = {10.1016/J.JCSS.2010.10.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/DraganFG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FominGT11, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Contraction obstructions for treewidth}, journal = {J. Comb. Theory, Ser. {B}}, volume = {101}, number = {5}, pages = {302--314}, year = {2011}, url = {https://doi.org/10.1016/j.jctb.2011.02.008}, doi = {10.1016/J.JCTB.2011.02.008}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/FominGT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominGT11, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Approximating Width Parameters of Hypergraphs with Excluded Minors}, journal = {{SIAM} J. Discret. Math.}, volume = {25}, number = {3}, pages = {1331--1348}, year = {2011}, url = {https://doi.org/10.1137/080743226}, doi = {10.1137/080743226}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominGT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DraganFG11, author = {Feodor F. Dragan and Fedor V. Fomin and Petr A. Golovach}, title = {Approximation of minimum weight spanners for sparse graphs}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {8-10}, pages = {846--852}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2010.11.034}, doi = {10.1016/J.TCS.2010.11.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DraganFG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FialaGK11, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, title = {Parameterized complexity of coloring problems: Treewidth versus vertex cover}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {23}, pages = {2513--2523}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2010.10.043}, doi = {10.1016/J.TCS.2010.10.043}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FialaGK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FominGL11, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov}, title = {Guard games on graphs: Keep the intruder out!}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {46}, pages = {6484--6497}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.08.024}, doi = {10.1016/J.TCS.2011.08.024}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FominGL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachHKLMS11, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Daniel Lokshtanov and Daniel Meister and Saket Saurabh}, title = {Bandwidth on AT-free graphs}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {50}, pages = {7001--7008}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.09.011}, doi = {10.1016/J.TCS.2011.09.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachHKLMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colognetwente/GolovachKT11, author = {Petr A. Golovach and Marcin Kaminski and Dimitrios M. Thilikos}, editor = {Ludovica Adacher and Marta Flamini and Gianmaria Leo and Gaia Nicosia and Andrea Pacifici and Veronica Piccialli}, title = {Odd cyclic surface separators in planar graphs}, booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011}, pages = {165--167}, year = {2011}, url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=177}, timestamp = {Thu, 12 Mar 2020 11:34:41 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/GolovachKT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/GolovachPS11, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Alexander S. Kulikov and Nikolay K. Vereshchagin}, title = {Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees}, booktitle = {Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6651}, pages = {261--274}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-20712-9\_20}, doi = {10.1007/978-3-642-20712-9\_20}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csr/GolovachPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/GolovachPS11, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Olaf Owe and Martin Steffen and Jan Arne Telle}, title = {Coloring Graphs without Short Cycles and Long Induced Paths}, booktitle = {Fundamentals of Computation Theory - 18th International Symposium, {FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6914}, pages = {193--204}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22953-4\_17}, doi = {10.1007/978-3-642-22953-4\_17}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fct/GolovachPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BelmonteGHHKP11, author = {R{\'{e}}my Belmonte and Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Marcin Kaminski and Dani{\"{e}}l Paulusma}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {110--119}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_13}, doi = {10.1007/978-3-642-25591-5\_13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BelmonteGHHKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachKPT11, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, editor = {D{\'{a}}niel Marx and Peter Rossmanith}, title = {Increasing the Minimum Degree of a Graph by Contractions}, booktitle = {Parameterized and Exact Computation - 6th International Symposium, {IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {7112}, pages = {67--79}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-28050-4\_6}, doi = {10.1007/978-3-642-28050-4\_6}, timestamp = {Fri, 09 Apr 2021 18:49:30 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachKPT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/BroersmaGP11, author = {Hajo Broersma and Petr A. Golovach and Viresh Patel}, editor = {D{\'{a}}niel Marx and Peter Rossmanith}, title = {Tight Complexity Bounds for {FPT} Subgraph Problems Parameterized by Clique-Width}, booktitle = {Parameterized and Exact Computation - 6th International Symposium, {IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {7112}, pages = {207--218}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-28050-4\_17}, doi = {10.1007/978-3-642-28050-4\_17}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/BroersmaGP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GolovachKP11, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma}, editor = {Filip Murlak and Piotr Sankowski}, title = {Contracting a Chordal Graph to a Split Graph or a Tree}, booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6907}, pages = {339--350}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22993-0\_32}, doi = {10.1007/978-3-642-22993-0\_32}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GolovachKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CouturierGKP11, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {List Coloring in the Absence of a Linear Forest}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {119--130}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_12}, doi = {10.1007/978-3-642-25870-1\_12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CouturierGKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1112-3244, author = {Fedor V. Fomin and Serge Gaspers and Petr A. Golovach and Karol Suchan and Stefan Szeider and Erik Jan van Leeuwen and Martin Vatshelle and Yngve Villanger}, title = {k-Gap Interval Graphs}, journal = {CoRR}, volume = {abs/1112.3244}, year = {2011}, url = {http://arxiv.org/abs/1112.3244}, eprinttype = {arXiv}, eprint = {1112.3244}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1112-3244.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FialaG10, author = {Jir{\'{\i}} Fiala and Petr A. Golovach}, title = {Complexity of the packing coloring problem for trees}, journal = {Discret. Appl. Math.}, volume = {158}, number = {7}, pages = {771--778}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2008.09.001}, doi = {10.1016/J.DAM.2008.09.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FialaG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominGGKS10, author = {Fedor V. Fomin and Serge Gaspers and Petr A. Golovach and Dieter Kratsch and Saket Saurabh}, title = {Parameterized algorithm for eternal vertex cover}, journal = {Inf. Process. Lett.}, volume = {110}, number = {16}, pages = {702--706}, year = {2010}, url = {https://doi.org/10.1016/j.ipl.2010.05.029}, doi = {10.1016/J.IPL.2010.05.029}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FominGGKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FominGLS10, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Intractability of Clique-Width Parameterizations}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {5}, pages = {1941--1956}, year = {2010}, url = {https://doi.org/10.1137/080742270}, doi = {10.1137/080742270}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/FominGLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FominGKNS10, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Nicolas Nisse and Karol Suchan}, title = {Pursuing a fast robber on a graph}, journal = {Theor. Comput. Sci.}, volume = {411}, number = {7-9}, pages = {1167--1181}, year = {2010}, url = {https://doi.org/10.1016/j.tcs.2009.12.010}, doi = {10.1016/J.TCS.2009.12.010}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FominGKNS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BroersmaGPS10, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On Coloring Graphs without Induced Forests}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {156--167}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_14}, doi = {10.1007/978-3-642-17514-5\_14}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BroersmaGPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGLS10, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, editor = {Moses Charikar}, title = {Algorithmic Lower Bounds for Problems Parameterized with Clique-Width}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {493--502}, publisher = {{SIAM}}, year = {2010}, url = {https://doi.org/10.1137/1.9781611973075.42}, doi = {10.1137/1.9781611973075.42}, timestamp = {Tue, 02 Feb 2021 17:07:39 +0100}, biburl = {https://dblp.org/rec/conf/soda/FominGLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/FominGL10, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov}, editor = {Haim Kaplan}, title = {Cops and Robber Game without Recharging}, booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6139}, pages = {273--284}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13731-0\_26}, doi = {10.1007/978-3-642-13731-0\_26}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/FominGL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/GolovachLP10, author = {Petr A. Golovach and Bernard Lidick{\'{y}} and Dani{\"{e}}l Paulusma}, editor = {Jan Kratochv{\'{\i}}l and Angsheng Li and Jir{\'{\i}} Fiala and Petr Kolman}, title = {\emph{L}(2, 1, 1)-Labeling Is NP-Complete for Trees}, booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference, {TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6108}, pages = {211--221}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13562-0\_20}, doi = {10.1007/978-3-642-13562-0\_20}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tamc/GolovachLP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/FominGT10, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Klaus Jansen and Roberto Solis{-}Oba}, title = {Approximation Algorithms for Domination Search}, booktitle = {Approximation and Online Algorithms - 8th International Workshop, {WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6534}, pages = {130--141}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-18318-8\_12}, doi = {10.1007/978-3-642-18318-8\_12}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/waoa/FominGT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKC10, author = {Petr A. Golovach and Dieter Kratsch and Jean{-}Fran{\c{c}}ois Couturier}, editor = {Dimitrios M. Thilikos}, title = {Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {39--50}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_6}, doi = {10.1007/978-3-642-16926-7\_6}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachKC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaGPS10, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Dimitrios M. Thilikos}, title = {Narrowing Down the Gap on the Complexity of Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free Graphs}, booktitle = {Graph Theoretic Concepts in Computer Science - 36th International Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010 Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6410}, pages = {63--74}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_8}, doi = {10.1007/978-3-642-16926-7\_8}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BroersmaGPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BonatoGHK09, author = {Anthony Bonato and Petr A. Golovach and Gena Hahn and Jan Kratochv{\'{\i}}l}, title = {The capture time of a graph}, journal = {Discret. Math.}, volume = {309}, number = {18}, pages = {5588--5595}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2008.04.004}, doi = {10.1016/J.DISC.2008.04.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BonatoGHK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominGKKL09, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, title = {Sort and Search: Exact algorithms for generalized domination}, journal = {Inf. Process. Lett.}, volume = {109}, number = {14}, pages = {795--798}, year = {2009}, url = {https://doi.org/10.1016/j.ipl.2009.03.023}, doi = {10.1016/J.IPL.2009.03.023}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FominGKKL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/FominGT09, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Amos Fiat and Peter Sanders}, title = {Contraction Bidimensionality: The Accurate Picture}, booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5757}, pages = {706--717}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04128-0\_63}, doi = {10.1007/978-3-642-04128-0\_63}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/FominGT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachKPT09, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Induced Packing of Odd Cycles in a Planar Graph}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {514--523}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_53}, doi = {10.1007/978-3-642-10631-6\_53}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolovachKPT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachHKLMS09, author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Daniel Lokshtanov and Daniel Meister and Saket Saurabh}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Bandwidth on AT-Free Graphs}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {573--582}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_59}, doi = {10.1007/978-3-642-10631-6\_59}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GolovachHKLMS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/BroersmaFGP09, author = {Hajo Broersma and Fedor V. Fomin and Petr A. Golovach and Dani{\"{e}}l Paulusma}, editor = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l and Mirka Miller}, title = {Three Complexity Results on Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free Graphs}, booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009, Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5874}, pages = {95--104}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10217-2\_12}, doi = {10.1007/978-3-642-10217-2\_12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/BroersmaFGP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/GolovachT09, author = {Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Jianer Chen and Fedor V. Fomin}, title = {Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms}, booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC} 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5917}, pages = {210--221}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11269-0\_17}, doi = {10.1007/978-3-642-11269-0\_17}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/GolovachT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/GolovachH09, author = {Petr A. Golovach and Pinar Heggernes}, editor = {Rastislav Kr{\'{a}}lovic and Damian Niwinski}, title = {Choosability of P5-Free Graphs}, booktitle = {Mathematical Foundations of Computer Science 2009, 34th International Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5734}, pages = {382--391}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03816-7\_33}, doi = {10.1007/978-3-642-03816-7\_33}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/GolovachH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FominGLS09, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, editor = {Claire Mathieu}, title = {Clique-width: on the price of generality}, booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009}, pages = {825--834}, publisher = {{SIAM}}, year = {2009}, url = {https://doi.org/10.1137/1.9781611973068.90}, doi = {10.1137/1.9781611973068.90}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/FominGLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FominGT09, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Susanne Albers and Jean{-}Yves Marion}, title = {Approximating Acyclicity Parameters of Sparse Hypergraphs}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings}, series = {LIPIcs}, volume = {3}, pages = {445--456}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1803}, doi = {10.4230/LIPICS.STACS.2009.1803}, timestamp = {Tue, 22 Jun 2021 15:43:57 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FominGT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/FialaGK09, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Jianer Chen and S. Barry Cooper}, title = {Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover}, booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference, {TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5532}, pages = {221--230}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02017-9\_25}, doi = {10.1007/978-3-642-02017-9\_25}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/tamc/FialaGK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/FominGL09, author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov}, editor = {Evripidis Bampis and Klaus Jansen}, title = {Guard Games on Graphs: Keep the Intruder Out!}, booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA} 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5893}, pages = {147--158}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-12450-1\_14}, doi = {10.1007/978-3-642-12450-1\_14}, timestamp = {Thu, 23 Sep 2021 11:48:40 +0200}, biburl = {https://dblp.org/rec/conf/waoa/FominGL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachKS09, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l and Ondrej Such{\'{y}}}, editor = {Christophe Paul and Michel Habib}, title = {Parameterized Complexity of Generalized Domination Problems}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {133--142}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_12}, doi = {10.1007/978-3-642-11409-0\_12}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/FominGT09, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, editor = {Erik D. Demaine and MohammadTaghi Hajiaghayi and D{\'{a}}niel Marx}, title = {Contraction Bidimensionality: the Accurate Picture}, booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009}, series = {Dagstuhl Seminar Proceedings}, volume = {09511}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {http://drops.dagstuhl.de/opus/volltexte/2010/2500/}, timestamp = {Thu, 10 Jun 2021 13:02:08 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/FominGT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FialaGK08, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'{u}}s M. Halld{\'{o}}rsson and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Igor Walukiewicz}, title = {Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)}, booktitle = {Automata, Languages and Programming, 35th International Colloquium, {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part {I:} Tack {A:} Algorithms, Automata, Complexity, and Games}, series = {Lecture Notes in Computer Science}, volume = {5125}, pages = {294--305}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-70575-8\_25}, doi = {10.1007/978-3-540-70575-8\_25}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FialaGK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DraganFG08, author = {Feodor F. Dragan and Fedor V. Fomin and Petr A. Golovach}, editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'{u}}s M. Halld{\'{o}}rsson and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Igor Walukiewicz}, title = {Spanners in Sparse Graphs}, booktitle = {Automata, Languages and Programming, 35th International Colloquium, {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part {I:} Tack {A:} Algorithms, Automata, Complexity, and Games}, series = {Lecture Notes in Computer Science}, volume = {5125}, pages = {597--608}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-70575-8\_49}, doi = {10.1007/978-3-540-70575-8\_49}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DraganFG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/FominGK08, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Giorgio Ausiello and Juhani Karhum{\"{a}}ki and Giancarlo Mauri and C.{-}H. Luke Ong}, title = {On tractability of Cops and Robbers game}, booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science - {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy}, series = {{IFIP}}, volume = {273}, pages = {171--185}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-09680-3\_12}, doi = {10.1007/978-0-387-09680-3\_12}, timestamp = {Fri, 27 Sep 2019 10:35:17 +0200}, biburl = {https://dblp.org/rec/conf/ifipTCS/FominGK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGHMVW08, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, editor = {Seok{-}Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, title = {How to Guard a Graph?}, booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC} 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5369}, pages = {318--329}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92182-0\_30}, doi = {10.1007/978-3-540-92182-0\_30}, timestamp = {Thu, 27 Apr 2023 14:57:19 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGHMVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/DraganFG08, author = {Feodor F. Dragan and Fedor V. Fomin and Petr A. Golovach}, editor = {Edward Ochmanski and Jerzy Tyszkiewicz}, title = {A {PTAS} for the Sparsest Spanners Problem on Apex-Minor-Free Graphs}, booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5162}, pages = {290--298}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85238-4\_23}, doi = {10.1007/978-3-540-85238-4\_23}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/DraganFG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/FialaGK08, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Manindra Agrawal and Ding{-}Zhu Du and Zhenhua Duan and Angsheng Li}, title = {Distance Constrained Labelings of Trees}, booktitle = {Theory and Applications of Models of Computation, 5th International Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4978}, pages = {125--135}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-79228-4\_11}, doi = {10.1007/978-3-540-79228-4\_11}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/tamc/FialaGK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/GolovachK08, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Manindra Agrawal and Ding{-}Zhu Du and Zhenhua Duan and Angsheng Li}, title = {Generalized Domination in Degenerate Graphs: {A} Complete Dichotomy of Computational Complexity}, booktitle = {Theory and Applications of Models of Computation, 5th International Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4978}, pages = {182--191}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-79228-4\_16}, doi = {10.1007/978-3-540-79228-4\_16}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tamc/GolovachK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaG08, author = {Jir{\'{\i}} Fiala and Petr A. Golovach}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Complexity of the Packing Coloring Problem for Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {134--145}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_13}, doi = {10.1007/978-3-540-92248-3\_13}, timestamp = {Sun, 25 Oct 2020 23:07:56 +0100}, biburl = {https://dblp.org/rec/conf/wg/FialaG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachV08, author = {Petr A. Golovach and Yngve Villanger}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Parameterized Complexity for Domination Problems on Degenerate Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {195--205}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_18}, doi = {10.1007/978-3-540-92248-3\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0809-3646, author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos}, title = {Approximating acyclicity parameters of sparse hypergraphs}, journal = {CoRR}, volume = {abs/0809.3646}, year = {2008}, url = {http://arxiv.org/abs/0809.3646}, eprinttype = {arXiv}, eprint = {0809.3646}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0809-3646.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BroersmaFGW07, author = {Hajo Broersma and Fedor V. Fomin and Petr A. Golovach and Gerhard J. Woeginger}, title = {Backbone colorings for graphs: Tree and path backbones}, journal = {J. Graph Theory}, volume = {55}, number = {2}, pages = {137--152}, year = {2007}, url = {https://doi.org/10.1002/jgt.20228}, doi = {10.1002/JGT.20228}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BroersmaFGW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FominGKKL07, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Norbert Zeh}, title = {Branch and Recharge: Exact Algorithms for Generalized Domination}, booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS} 2007, Halifax, Canada, August 15-17, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4619}, pages = {507--518}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73951-7\_44}, doi = {10.1007/978-3-540-73951-7\_44}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/FominGKKL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GolovachK07, author = {Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Computational Complexity of Generalized Domination: {A} Complete Dichotomy for Chordal 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 = {1--11}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7\_1}, doi = {10.1007/978-3-540-74839-7\_1}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FialaGK05, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Distance Constrained Labelings of Graphs of Bounded Treewidth}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {360--372}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_30}, doi = {10.1007/11523468\_30}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FialaGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FialaGK04, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Elegant Distance Constrained Labelings of Trees}, booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {3353}, pages = {58--67}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_5}, doi = {10.1007/978-3-540-30559-0\_5}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FialaGK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FominG03, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Interval degree and bandwidth of a graph}, journal = {Discret. Appl. Math.}, volume = {129}, number = {2-3}, pages = {345--359}, year = {2003}, url = {https://doi.org/10.1016/S0166-218X(02)00574-7}, doi = {10.1016/S0166-218X(02)00574-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FominG03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaFGW03, author = {Hajo Broersma and Fedor V. Fomin and Petr A. Golovach and Gerhard J. Woeginger}, editor = {Hans L. Bodlaender}, title = {Backbone Colorings for Networks}, booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop, {WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2880}, pages = {131--142}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_12}, doi = {10.1007/978-3-540-39890-5\_12}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BroersmaFGW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FominG00, author = {Fedor V. Fomin and Petr A. Golovach}, title = {Graph Searching and Interval Completion}, journal = {{SIAM} J. Discret. Math.}, volume = {13}, number = {4}, pages = {454--464}, year = {2000}, url = {https://doi.org/10.1137/S0895480199350477}, doi = {10.1137/S0895480199350477}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FominG00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominG98, author = {Fedor V. Fomin and Petr A. Golovach}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Interval Completion with the Smallest Max-degree}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {359--371}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_29}, doi = {10.1007/10692760\_29}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.