Published in: LIPIcs, Volume 322, 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, and Sebastian Siebertz. Kernelization Complexity of Solution Discovery Problems. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{grobler_et_al:LIPIcs.ISAAC.2024.36, author = {Grobler, Mario and Maaz, Stephanie and Mouawad, Amer E. and Nishimura, Naomi and Ramamoorthi, Vijayaragunathan and Siebertz, Sebastian}, title = {{Kernelization Complexity of Solution Discovery Problems}}, booktitle = {35th International Symposium on Algorithms and Computation (ISAAC 2024)}, pages = {36:1--36:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-354-6}, ISSN = {1868-8969}, year = {2024}, volume = {322}, editor = {Mestre, Juli\'{a}n and Wirth, Anthony}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.36}, URN = {urn:nbn:de:0030-drops-221630}, doi = {10.4230/LIPIcs.ISAAC.2024.36}, annote = {Keywords: solution discovery, kernelization, cut, independent set, vertex cover, dominating set} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Benjamin Moore, Naomi Nishimura, and Vijay Subramanya. Reconfiguration of Graph Minors. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{moore_et_al:LIPIcs.MFCS.2018.75, author = {Moore, Benjamin and Nishimura, Naomi and Subramanya, Vijay}, title = {{Reconfiguration of Graph Minors}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {75:1--75:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.75}, URN = {urn:nbn:de:0030-drops-96573}, doi = {10.4230/LIPIcs.MFCS.2018.75}, annote = {Keywords: reconfiguration, graph minors, graph algorithms} }
Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{lokshtanov_et_al:LIPIcs.IPEC.2017, title = {{LIPIcs, Volume 89, IPEC'17, Complete Volume}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017}, URN = {urn:nbn:de:0030-drops-86166}, doi = {10.4230/LIPIcs.IPEC.2017}, annote = {Keywords: Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Discrete Mathematics} }
Published in: LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lokshtanov_et_al:LIPIcs.IPEC.2017.0, author = {Lokshtanov, Daniel and Nishimura, Naomi}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.0}, URN = {urn:nbn:de:0030-drops-85437}, doi = {10.4230/LIPIcs.IPEC.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Tesshu Hanaka, Naomi Nishimura, and Hirotaka Ono. On Directed Covering and Domination Problems. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hanaka_et_al:LIPIcs.ISAAC.2017.45, author = {Hanaka, Tesshu and Nishimura, Naomi and Ono, Hirotaka}, title = {{On Directed Covering and Domination Problems}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.45}, URN = {urn:nbn:de:0030-drops-82460}, doi = {10.4230/LIPIcs.ISAAC.2017.45}, annote = {Keywords: directed graph, vertex cover, dominating set, edge dominating set, fixed-parameter algorithms} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Michael R. Fellows, Michael Hallett, Rold Niedermeier, and Naomi Nishimura. Fixed Parameter Algorithms (Dagstuhl Seminar 03311). Dagstuhl Seminar Report 388, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
@TechReport{fellows_et_al:DagSemRep.388, author = {Fellows, Michael R. and Hallett, Michael and Niedermeier, Rold and Nishimura, Naomi}, title = {{Fixed Parameter Algorithms (Dagstuhl Seminar 03311)}}, pages = {1--7}, ISSN = {1619-0203}, year = {2003}, type = {Dagstuhl Seminar Report}, number = {388}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.388}, URN = {urn:nbn:de:0030-drops-152681}, doi = {10.4230/DagSemRep.388}, }
Feedback for Dagstuhl Publishing