LIPIcs, Volume 43
IPEC 2015, September 16-18, 2015, Patras, Greece
Editors: Thore Husfeldt and Iyad Kanj
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Leslie Ann Goldberg and Marc Roth. Parameterised and Fine-Grained Subgraph Counting, Modulo 2. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 68:1-68:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{goldberg_et_al:LIPIcs.ICALP.2023.68, author = {Goldberg, Leslie Ann and Roth, Marc}, title = {{Parameterised and Fine-Grained Subgraph Counting, Modulo 2}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {68:1--68:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68}, URN = {urn:nbn:de:0030-drops-181200}, doi = {10.4230/LIPIcs.ICALP.2023.68}, annote = {Keywords: modular counting, parameterised complexity, fine-grained complexity, subgraph counting} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Radu Curticapean, Holger Dell, and Thore Husfeldt. Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{curticapean_et_al:LIPIcs.ESA.2021.34, author = {Curticapean, Radu and Dell, Holger and Husfeldt, Thore}, title = {{Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.34}, URN = {urn:nbn:de:0030-drops-146154}, doi = {10.4230/LIPIcs.ESA.2021.34}, annote = {Keywords: Counting complexity, matchings, paths, subgraphs, parameterized complexity} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Samir Datta and Kishlaya Jaiswal. Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 36:1-36:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{datta_et_al:LIPIcs.MFCS.2021.36, author = {Datta, Samir and Jaiswal, Kishlaya}, title = {{Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {36:1--36:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.36}, URN = {urn:nbn:de:0030-drops-144763}, doi = {10.4230/LIPIcs.MFCS.2021.36}, annote = {Keywords: permanent mod powers of 2, parallel computation, graphs, shortest disjoint paths, shortest disjoint cycles} }
Published in: LIPIcs, Volume 161, 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)
Thore Husfeldt. Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). In 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 161, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{husfeldt:LIPIcs.CPM.2020.1, author = {Husfeldt, Thore}, title = {{Algebraic Algorithms for Finding Patterns in Graphs}}, booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-149-8}, ISSN = {1868-8969}, year = {2020}, volume = {161}, editor = {G{\o}rtz, Inge Li and Weimann, Oren}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.1}, URN = {urn:nbn:de:0030-drops-121261}, doi = {10.4230/LIPIcs.CPM.2020.1}, annote = {Keywords: paths, exterior algebra, wedge product, color-coding, parameterized complexity} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Cornelius Brand. Patching Colors with Tensors. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{brand:LIPIcs.ESA.2019.25, author = {Brand, Cornelius}, title = {{Patching Colors with Tensors}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.25}, URN = {urn:nbn:de:0030-drops-111467}, doi = {10.4230/LIPIcs.ESA.2019.25}, annote = {Keywords: Color-Coding, Extensor-Coding, internal out-branching, colorful problems, algebraic algorithms, multilinear detection, deterministic algorithms, exterior algebra} }
Published in: LIPIcs, Volume 115, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Karl Bringmann, Thore Husfeldt, and Måns Magnusson. Multivariate Analysis of Orthogonal Range Searching and Graph Distances. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bringmann_et_al:LIPIcs.IPEC.2018.4, author = {Bringmann, Karl and Husfeldt, Thore and Magnusson, M\r{a}ns}, title = {{Multivariate Analysis of Orthogonal Range Searching and Graph Distances}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {4:1--4:13}, 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.4}, URN = {urn:nbn:de:0030-drops-102050}, doi = {10.4230/LIPIcs.IPEC.2018.4}, annote = {Keywords: Diameter, radius, Wiener index, orthogonal range searching, treewidth, vertex cover number} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund_et_al:LIPIcs.ISAAC.2018.17, author = {Bj\"{o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko}, title = {{Counting Connected Subgraphs with Maximum-Degree-Aware Sieving}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.17}, URN = {urn:nbn:de:0030-drops-99655}, doi = {10.4230/LIPIcs.ISAAC.2018.17}, annote = {Keywords: graph embedding, k-path, subgraph counting, maximum degree} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Andreas Björklund and Thore Husfeldt. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 19:1-19:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund_et_al:LIPIcs.ISAAC.2018.19, author = {Bj\"{o}rklund, Andreas and Husfeldt, Thore}, title = {{Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.19}, URN = {urn:nbn:de:0030-drops-99670}, doi = {10.4230/LIPIcs.ISAAC.2018.19}, annote = {Keywords: Shortest disjoint paths, Cubic planar graph} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Thore Husfeldt. Computing Graph Distances Parameterized by Treewidth and Diameter. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 16:1-16:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{husfeldt:LIPIcs.IPEC.2016.16, author = {Husfeldt, Thore}, title = {{Computing Graph Distances Parameterized by Treewidth and Diameter}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {16:1--16:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.16}, URN = {urn:nbn:de:0030-drops-69476}, doi = {10.4230/LIPIcs.IPEC.2016.16}, annote = {Keywords: Graph algorithms, diameter, treewidth, Strong Exponential Time Hypothesis} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond. The First Parameterized Algorithms and Computational Experiments Challenge. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 30:1-30:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dell_et_al:LIPIcs.IPEC.2016.30, author = {Dell, Holger and Husfeldt, Thore and Jansen, Bart M. P. and Kaski, Petteri and Komusiewicz, Christian and Rosamond, Frances A.}, title = {{The First Parameterized Algorithms and Computational Experiments Challenge}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {30:1--30:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.30}, URN = {urn:nbn:de:0030-drops-69310}, doi = {10.4230/LIPIcs.IPEC.2016.30}, annote = {Keywords: treewidth, feedback vertex set, contest, implementation challenge, FPT} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
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-dev.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)
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-dev.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-dev.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} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Virginia Vassilevska Williams. Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk). In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 17-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{vassilevskawilliams:LIPIcs.IPEC.2015.17, author = {Vassilevska Williams, Virginia}, title = {{Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {17--29}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.17}, URN = {urn:nbn:de:0030-drops-55683}, doi = {10.4230/LIPIcs.IPEC.2015.17}, annote = {Keywords: reductions, satisfiability, strong exponential time hypothesis, shortest paths, 3SUM, equivalences, fine-grained complexity} }
Feedback for Dagstuhl Publishing