Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Athanasios L. Konstantinidis and Charis Papadopoulos. Cluster Deletion on Interval Graphs and Split Related Graphs. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{konstantinidis_et_al:LIPIcs.MFCS.2019.12, author = {Konstantinidis, Athanasios L. and Papadopoulos, Charis}, title = {{Cluster Deletion on Interval Graphs and Split Related Graphs}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.12}, URN = {urn:nbn:de:0030-drops-109568}, doi = {10.4230/LIPIcs.MFCS.2019.12}, annote = {Keywords: Cluster deletion, interval graphs, split graphs} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Charis Papadopoulos and Spyridon Tzimas. Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 20:1-20:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{papadopoulos_et_al:LIPIcs.IPEC.2018.20, author = {Papadopoulos, Charis and Tzimas, Spyridon}, title = {{Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.20}, URN = {urn:nbn:de:0030-drops-102216}, doi = {10.4230/LIPIcs.IPEC.2018.20}, annote = {Keywords: Subset Feedback Vertex Set, Node Multiway Cut, Terminal Set problem, polynomial-time algorithm, NP-completeness, W\lbrack1\rbrack-hardness, graphs of bounded independent set size} }
Published in: LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, and Charis Papadopoulos. Parameterized Aspects of Strong Subgraph Closure. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 23:1-23:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{golovach_et_al:LIPIcs.SWAT.2018.23, author = {Golovach, Petr A. and Heggernes, Pinar and Konstantinidis, Athanasios L. and Lima, Paloma T. and Papadopoulos, Charis}, title = {{Parameterized Aspects of Strong Subgraph Closure}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-068-2}, ISSN = {1868-8969}, year = {2018}, volume = {101}, editor = {Eppstein, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.23}, URN = {urn:nbn:de:0030-drops-88490}, doi = {10.4230/LIPIcs.SWAT.2018.23}, annote = {Keywords: Strong triadic closure, Parameterized complexity, Forbidden subgraphs} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Athanasios L. Konstantinidis and Charis Papadopoulos. Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 53:1-53:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{konstantinidis_et_al:LIPIcs.ISAAC.2017.53, author = {Konstantinidis, Athanasios L. and Papadopoulos, Charis}, title = {{Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {53:1--53: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.53}, URN = {urn:nbn:de:0030-drops-82113}, doi = {10.4230/LIPIcs.ISAAC.2017.53}, annote = {Keywords: strong triadic closure, polynomial-time algorithm, NP-completeness, split graphs, proper interval graphs} }
Feedback for Dagstuhl Publishing