Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Ivan Bliznets and Vladislav Epifanov. MaxCut Above Guarantee. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 22:1-22:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bliznets_et_al:LIPIcs.MFCS.2023.22, author = {Bliznets, Ivan and Epifanov, Vladislav}, title = {{MaxCut Above Guarantee}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {22:1--22:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.22}, URN = {urn:nbn:de:0030-drops-185560}, doi = {10.4230/LIPIcs.MFCS.2023.22}, annote = {Keywords: Tripartite, 3-colorable, chordal, maximum cut, FPT-algorithm, linear kernel} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Tatiana Belova and Ivan Bliznets. Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{belova_et_al:LIPIcs.ISAAC.2022.24, author = {Belova, Tatiana and Bliznets, Ivan}, title = {{Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.24}, URN = {urn:nbn:de:0030-drops-173097}, doi = {10.4230/LIPIcs.ISAAC.2022.24}, annote = {Keywords: Parameterized complexity, Hardness of approximation, Edge modification problems} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Ivan Bliznets and Danil Sagunov. Solving Target Set Selection with Bounded Thresholds Faster than 2^n. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 22:1-22:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bliznets_et_al:LIPIcs.IPEC.2018.22, author = {Bliznets, Ivan and Sagunov, Danil}, title = {{Solving Target Set Selection with Bounded Thresholds Faster than 2^n}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {22:1--22: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.22}, URN = {urn:nbn:de:0030-drops-102235}, doi = {10.4230/LIPIcs.IPEC.2018.22}, annote = {Keywords: exact exponential algorithms, target set, vertex thresholds, social influence, irreversible conversions of graphs, bootstrap percolation} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Ivan Bliznets and Nikolai Karpov. Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bliznets_et_al:LIPIcs.MFCS.2017.6, author = {Bliznets, Ivan and Karpov, Nikolai}, title = {{Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.6}, URN = {urn:nbn:de:0030-drops-80728}, doi = {10.4230/LIPIcs.MFCS.2017.6}, annote = {Keywords: clustering, parameterized complexity, highly connected} }
Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Ivan Bliznets, Marek Cygan, Pawel Komosa, and Michal Pilipczuk. Hardness of Approximation for H-Free Edge Modification Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bliznets_et_al:LIPIcs.APPROX-RANDOM.2016.3, author = {Bliznets, Ivan and Cygan, Marek and Komosa, Pawel and Pilipczuk, Michal}, title = {{Hardness of Approximation for H-Free Edge Modification Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {3:1--3:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.3}, URN = {urn:nbn:de:0030-drops-66260}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.3}, annote = {Keywords: hardness of approximation, parameterized complexity, kernelization, edge modification problems} }
Feedback for Dagstuhl Publishing