LIPIcs, Volume 43
IPEC 2015, September 16-18, 2015, Patras, Greece
Editors: Thore Husfeldt and Iyad Kanj
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, and Leo Wendt. Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 10:1-10:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{angrick_et_al:LIPIcs.SEA.2023.10, author = {Angrick, Sebastian and Bals, Ben and Casel, Katrin and Cohen, Sarel and Friedrich, Tobias and Hastrich, Niko and Hradilak, Theresa and Issac, Davis and Ki{\ss}ig, Otto and Schmidt, Jonas and Wendt, Leo}, title = {{Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.10}, URN = {urn:nbn:de:0030-drops-183602}, doi = {10.4230/LIPIcs.SEA.2023.10}, annote = {Keywords: directed feedback vertex set, vertex cover, reduction rules} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Eduard Eiben, Robert Ganian, and Iyad Kanj. The Parameterized Complexity of Coordinated Motion Planning. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 28:1-28:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{eiben_et_al:LIPIcs.SoCG.2023.28, author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad}, title = {{The Parameterized Complexity of Coordinated Motion Planning}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.28}, URN = {urn:nbn:de:0030-drops-178784}, doi = {10.4230/LIPIcs.SoCG.2023.28}, annote = {Keywords: coordinated motion planning, multi-agent path finding, parameterized complexity, disjoint paths on grids} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider. Finding a Cluster in Incomplete Data. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 47:1-47:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{eiben_et_al:LIPIcs.ESA.2022.47, author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad and Ordyniak, Sebastian and Szeider, Stefan}, title = {{Finding a Cluster in Incomplete Data}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.47}, URN = {urn:nbn:de:0030-drops-169858}, doi = {10.4230/LIPIcs.ESA.2022.47}, annote = {Keywords: Parameterized complexity, incomplete data, clustering} }
Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Jianer Chen, Qin Huang, Iyad Kanj, and Ge Xia. Near-Optimal Algorithms for Point-Line Covering Problems. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 21:1-21:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.STACS.2022.21, author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Xia, Ge}, title = {{Near-Optimal Algorithms for Point-Line Covering Problems}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.21}, URN = {urn:nbn:de:0030-drops-158312}, doi = {10.4230/LIPIcs.STACS.2022.21}, annote = {Keywords: line cover, rich lines, exact fitting, kernelization, randomized algorithms, complexity lower bounds, algebraic computation trees} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia. Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 48:1-48:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2021.48, author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Li, Qian and Xia, Ge}, title = {{Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {48:1--48:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.48}, URN = {urn:nbn:de:0030-drops-154816}, doi = {10.4230/LIPIcs.ISAAC.2021.48}, annote = {Keywords: streaming algorithms, matching, parameterized algorithms, lower bounds} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Dan Bergren, Eduard Eiben, Robert Ganian, and Iyad Kanj. On Covering Segments with Unit Intervals. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 13:1-13:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bergren_et_al:LIPIcs.STACS.2020.13, author = {Bergren, Dan and Eiben, Eduard and Ganian, Robert and Kanj, Iyad}, title = {{On Covering Segments with Unit Intervals}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.13}, URN = {urn:nbn:de:0030-drops-118741}, doi = {10.4230/LIPIcs.STACS.2020.13}, annote = {Keywords: Segment covering, unit intervals, NP-completeness, parameterized complexity} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 51:1-51:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kanj_et_al:LIPIcs.ESA.2018.51, author = {Kanj, Iyad and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan}, title = {{Solving Partition Problems Almost Always Requires Pushing Many Vertices Around}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.51}, URN = {urn:nbn:de:0030-drops-95140}, doi = {10.4230/LIPIcs.ESA.2018.51}, annote = {Keywords: Fixed-parameter algorithms, Kernelization, Vertex-partition problems, Reduction rules, Cross-composition} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Eduard Eiben and Iyad Kanj. How to Navigate Through Obstacles?. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 48:1-48:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{eiben_et_al:LIPIcs.ICALP.2018.48, author = {Eiben, Eduard and Kanj, Iyad}, title = {{How to Navigate Through Obstacles?}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.48}, URN = {urn:nbn:de:0030-drops-90528}, doi = {10.4230/LIPIcs.ICALP.2018.48}, annote = {Keywords: parameterized complexity and algorithms, motion planning, barrier coverage, barrier resilience, colored path, minimum constraint removal, planar graphs} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Robert Ganian, Ronald de Haan, Iyad Kanj, and Stefan Szeider. On Existential MSO and its Relation to ETH. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 42:1-42:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{ganian_et_al:LIPIcs.MFCS.2016.42, author = {Ganian, Robert and de Haan, Ronald and Kanj, Iyad and Szeider, Stefan}, title = {{On Existential MSO and its Relation to ETH}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.42}, URN = {urn:nbn:de:0030-drops-64556}, doi = {10.4230/LIPIcs.MFCS.2016.42}, annote = {Keywords: exponential time hypothesis (ETH), monadic second order logic, subexponential time complexity, serf-reducibility, logic games} }
Published in: LIPIcs, Volume 53, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen. Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 14:1-14:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kanj_et_al:LIPIcs.SWAT.2016.14, author = {Kanj, Iyad and Komusiewicz, Christian and Sorge, Manuel and Jan van Leeuwen, Erik}, title = {{Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs}}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-011-8}, ISSN = {1868-8969}, year = {2016}, volume = {53}, editor = {Pagh, Rasmus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.14}, URN = {urn:nbn:de:0030-drops-60360}, doi = {10.4230/LIPIcs.SWAT.2016.14}, annote = {Keywords: vertex-partition problems, monopolar graphs, subcolorings, split graphs, unipolar graphs, fixed-parameter algorithms} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Iyad Kanj, Ljubomir Perkovic, and Duru Türkoglu. Degree Four Plane Spanners: Simpler and Better. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 45:1-45:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kanj_et_al:LIPIcs.SoCG.2016.45, author = {Kanj, Iyad and Perkovic, Ljubomir and T\"{u}rkoglu, Duru}, title = {{Degree Four Plane Spanners: Simpler and Better}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {45:1--45:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.45}, URN = {urn:nbn:de:0030-drops-59376}, doi = {10.4230/LIPIcs.SoCG.2016.45}, annote = {Keywords: Nonnumerical Algorithms and Problems,Computational Geometry and Object Modeling} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Thore Husfeldt and Iyad Kanj. LIPIcs, Volume 43, IPEC'15, Complete Volume. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@Proceedings{husfeldt_et_al:LIPIcs.IPEC.2015, title = {{LIPIcs, Volume 43, IPEC'15, Complete Volume}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015}, URN = {urn:nbn:de:0030-drops-56020}, doi = {10.4230/LIPIcs.IPEC.2015}, annote = {Keywords: Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Discrete Mathematics} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Thore Husfeldt and Iyad Kanj. Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. i-xiv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{husfeldt_et_al:LIPIcs.IPEC.2015.i, author = {Husfeldt, Thore and Kanj, Iyad}, title = {{Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {i--xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.i}, URN = {urn:nbn:de:0030-drops-55676}, doi = {10.4230/LIPIcs.IPEC.2015.i}, annote = {Keywords: IPEC} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Dimitrios M. Thilikos. Bidimensionality and Parameterized Algorithms (Invited Talk). In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 1-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{thilikos:LIPIcs.IPEC.2015.1, author = {Thilikos, Dimitrios M.}, title = {{Bidimensionality and Parameterized Algorithms}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {1--16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.1}, URN = {urn:nbn:de:0030-drops-55663}, doi = {10.4230/LIPIcs.IPEC.2015.1}, annote = {Keywords: Parameterized algorithms, Subexponential FPT-algorithms, Kernelization, Linear kenrels, Bidimensionality, Graph Minors} }
Feedback for Dagstuhl Publishing