Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders. LIPIcs, Volume 173, ESA 2020, Complete Volume. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 1-1598, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@Proceedings{grandoni_et_al:LIPIcs.ESA.2020, title = {{LIPIcs, Volume 173, ESA 2020, Complete Volume}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {1--1598}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020}, URN = {urn:nbn:de:0030-drops-128651}, doi = {10.4230/LIPIcs.ESA.2020}, annote = {Keywords: LIPIcs, Volume 173, ESA 2020, Complete Volume} }
Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders. Front Matter, Table of Contents, Preface, Conference Organization. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 0:i-0:xx, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{grandoni_et_al:LIPIcs.ESA.2020.0, author = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.0}, URN = {urn:nbn:de:0030-drops-128669}, doi = {10.4230/LIPIcs.ESA.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, and Joseph S. B. Mitchell. Planar Bichromatic Bottleneck Spanning Trees. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 1:1-1:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{abuaffash_et_al:LIPIcs.ESA.2020.1, author = {Abu-Affash, A. Karim and Bhore, Sujoy and Carmi, Paz and Mitchell, Joseph S. B.}, title = {{Planar Bichromatic Bottleneck Spanning Trees}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.1}, URN = {urn:nbn:de:0030-drops-128670}, doi = {10.4230/LIPIcs.ESA.2020.1}, annote = {Keywords: Approximation Algorithms, Bottleneck Spanning Tree, NP-Hardness} }
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, and Sam Westrick. Parallel Batch-Dynamic Trees via Change Propagation. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 2:1-2:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{acar_et_al:LIPIcs.ESA.2020.2, author = {Acar, Umut A. and Anderson, Daniel and Blelloch, Guy E. and Dhulipala, Laxman and Westrick, Sam}, title = {{Parallel Batch-Dynamic Trees via Change Propagation}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {2:1--2:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.2}, URN = {urn:nbn:de:0030-drops-128686}, doi = {10.4230/LIPIcs.ESA.2020.2}, annote = {Keywords: Dynamic trees, Graph algorithms, Parallel algorithms, Dynamic algorithms} }
Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda. Reconstructing Biological and Digital Phylogenetic Trees in Parallel. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 3:1-3:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{afshar_et_al:LIPIcs.ESA.2020.3, author = {Afshar, Ramtin and Goodrich, Michael T. and Matias, Pedro and Osegueda, Martha C.}, title = {{Reconstructing Biological and Digital Phylogenetic Trees in Parallel}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {3:1--3:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.3}, URN = {urn:nbn:de:0030-drops-128696}, doi = {10.4230/LIPIcs.ESA.2020.3}, annote = {Keywords: Tree Reconstruction, Parallel Algorithms, Privacy, Phylogenetic Trees, Data Structures, Hierarchical Clustering} }
Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence. Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 4:1-4:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ahmed_et_al:LIPIcs.ESA.2020.4, author = {Ahmed, Reyan and Sahneh, Faryad Darabi and Hamm, Keaton and Kobourov, Stephen and Spence, Richard}, title = {{Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.4}, URN = {urn:nbn:de:0030-drops-128709}, doi = {10.4230/LIPIcs.ESA.2020.4}, annote = {Keywords: multi-level, Steiner tree, approximation algorithms} }
Amihood Amir, Itai Boneh, Michael Itzhaki, and Eitan Kondratovsky. Analysis of the Period Recovery Error Bound. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{amir_et_al:LIPIcs.ESA.2020.5, author = {Amir, Amihood and Boneh, Itai and Itzhaki, Michael and Kondratovsky, Eitan}, title = {{Analysis of the Period Recovery Error Bound}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {5:1--5:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.5}, URN = {urn:nbn:de:0030-drops-128717}, doi = {10.4230/LIPIcs.ESA.2020.5}, annote = {Keywords: Period Recovery, Period Recovery Hierarchy, Hamming Distance} }
Eugenio Angriman, Maria Predari, Alexander van der Grinten, and Henning Meyerhenke. Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 6:1-6:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{angriman_et_al:LIPIcs.ESA.2020.6, author = {Angriman, Eugenio and Predari, Maria and van der Grinten, Alexander and Meyerhenke, Henning}, title = {{Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {6:1--6:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.6}, URN = {urn:nbn:de:0030-drops-128723}, doi = {10.4230/LIPIcs.ESA.2020.6}, annote = {Keywords: Laplacian pseudoinverse, electrical centrality measures, uniform spanning tree, effective resistance, parallel sampling} }
Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, and Csaba D. Tóth. Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 7:1-7:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{arkin_et_al:LIPIcs.ESA.2020.7, author = {Arkin, Esther M. and Das, Rathish and Gao, Jie and Goswami, Mayank and Mitchell, Joseph S. B. and Polishchuk, Valentin and T\'{o}th, Csaba D.}, title = {{Cutting Polygons into Small Pieces with Chords: Laser-Based Localization}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.7}, URN = {urn:nbn:de:0030-drops-128736}, doi = {10.4230/LIPIcs.ESA.2020.7}, annote = {Keywords: Polygon partition, Arrangements, Visibility, Localization} }
Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou. Set Cover with Delay - Clairvoyance Is Not Required. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 8:1-8:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{azar_et_al:LIPIcs.ESA.2020.8, author = {Azar, Yossi and Chiplunkar, Ashish and Kutten, Shay and Touitou, Noam}, title = {{Set Cover with Delay - Clairvoyance Is Not Required}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {8:1--8:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.8}, URN = {urn:nbn:de:0030-drops-128749}, doi = {10.4230/LIPIcs.ESA.2020.8}, annote = {Keywords: Set Cover, Delay, Clairvoyant} }
Sayan Bandyapadhyay. Improved Bounds for Metric Capacitated Covering Problems. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 9:1-9:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bandyapadhyay:LIPIcs.ESA.2020.9, author = {Bandyapadhyay, Sayan}, title = {{Improved Bounds for Metric Capacitated Covering Problems}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.9}, URN = {urn:nbn:de:0030-drops-128759}, doi = {10.4230/LIPIcs.ESA.2020.9}, annote = {Keywords: Capacitated covering, approximation algorithms, bicriteria approximation, LP rounding} }
Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, and Dror Rawitz. Minimum Neighboring Degree Realization in Graphs and Trees. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{barnoy_et_al:LIPIcs.ESA.2020.10, author = {Bar-Noy, Amotz and Choudhary, Keerti and Cohen, Avi and Peleg, David and Rawitz, Dror}, title = {{Minimum Neighboring Degree Realization in Graphs and Trees}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.10}, URN = {urn:nbn:de:0030-drops-128765}, doi = {10.4230/LIPIcs.ESA.2020.10}, annote = {Keywords: Graph realization, neighborhood profile, graph algorithms, degree sequences} }
Siddharth Barman, Umang Bhaskar, Anand Krishna, and Ranjani G. Sundaram. Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 11:1-11:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{barman_et_al:LIPIcs.ESA.2020.11, author = {Barman, Siddharth and Bhaskar, Umang and Krishna, Anand and Sundaram, Ranjani G.}, title = {{Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.11}, URN = {urn:nbn:de:0030-drops-128775}, doi = {10.4230/LIPIcs.ESA.2020.11}, annote = {Keywords: Discrete Fair Division, Nash Social Welfare, Subadditive Valuations, Submodular Valuations} }
Surender Baswana, Shiv Gupta, and Till Knollmann. Mincut Sensitivity Data Structures for the Insertion of an Edge. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 12:1-12:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{baswana_et_al:LIPIcs.ESA.2020.12, author = {Baswana, Surender and Gupta, Shiv and Knollmann, Till}, title = {{Mincut Sensitivity Data Structures for the Insertion of an Edge}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.12}, URN = {urn:nbn:de:0030-drops-128781}, doi = {10.4230/LIPIcs.ESA.2020.12}, annote = {Keywords: Mincut, Sensitivity, Data Structure} }
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, and Martin Strehler. Linear Time LexDFS on Chordal Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 13:1-13:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{beisegel_et_al:LIPIcs.ESA.2020.13, author = {Beisegel, Jesse and K\"{o}hler, Ekkehard and Scheffler, Robert and Strehler, Martin}, title = {{Linear Time LexDFS on Chordal Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.13}, URN = {urn:nbn:de:0030-drops-128790}, doi = {10.4230/LIPIcs.ESA.2020.13}, annote = {Keywords: LexDFS, chordal graphs, linear time implementation, search trees, LexBFS} }
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota Otachi. Grundy Distinguishes Treewidth from Pathwidth. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 14:1-14:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{belmonte_et_al:LIPIcs.ESA.2020.14, author = {Belmonte, R\'{e}my and Kim, Eun Jung and Lampis, Michael and Mitsou, Valia and Otachi, Yota}, title = {{Grundy Distinguishes Treewidth from Pathwidth}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.14}, URN = {urn:nbn:de:0030-drops-128803}, doi = {10.4230/LIPIcs.ESA.2020.14}, annote = {Keywords: Treewidth, Pathwidth, Clique-width, Grundy Coloring} }
Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan. On the Complexity of BWT-Runs Minimization via Alphabet Reordering. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 15:1-15:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bentley_et_al:LIPIcs.ESA.2020.15, author = {Bentley, Jason W. and Gibney, Daniel and Thankachan, Sharma V.}, title = {{On the Complexity of BWT-Runs Minimization via Alphabet Reordering}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.15}, URN = {urn:nbn:de:0030-drops-128819}, doi = {10.4230/LIPIcs.ESA.2020.15}, annote = {Keywords: BWT, NP-hardness, APX-hardness} }
Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Simulating Population Protocols in Sub-Constant Time per Interaction. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 16:1-16:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{berenbrink_et_al:LIPIcs.ESA.2020.16, author = {Berenbrink, Petra and Hammer, David and Kaaser, Dominik and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung}, title = {{Simulating Population Protocols in Sub-Constant Time per Interaction}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {16:1--16:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.16}, URN = {urn:nbn:de:0030-drops-128827}, doi = {10.4230/LIPIcs.ESA.2020.16}, annote = {Keywords: Population Protocols, Simulation, Random Sampling, Dynamic Alias Table} }
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Miloš Trujić, and Emo Welzl. An Optimal Decentralized (Δ + 1)-Coloring Algorithm. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 17:1-17:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bertschinger_et_al:LIPIcs.ESA.2020.17, author = {Bertschinger, Daniel and Lengler, Johannes and Martinsson, Anders and Meier, Robert and Steger, Angelika and Truji\'{c}, Milo\v{s} and Welzl, Emo}, title = {{An Optimal Decentralized (\Delta + 1)-Coloring Algorithm}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.17}, URN = {urn:nbn:de:0030-drops-128837}, doi = {10.4230/LIPIcs.ESA.2020.17}, annote = {Keywords: Decentralized Algorithm, Distributed Computing, Graph Coloring, Randomized Algorithms} }
Anup Bhattacharya, Jan Eube, Heiko Röglin, and Melanie Schmidt. Noisy, Greedy and Not so Greedy k-Means++. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 18:1-18:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhattacharya_et_al:LIPIcs.ESA.2020.18, author = {Bhattacharya, Anup and Eube, Jan and R\"{o}glin, Heiko and Schmidt, Melanie}, title = {{Noisy, Greedy and Not so Greedy k-Means++}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {18:1--18:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.18}, URN = {urn:nbn:de:0030-drops-128848}, doi = {10.4230/LIPIcs.ESA.2020.18}, annote = {Keywords: k-means++, greedy, adaptive sampling} }
Sujoy Bhore, Guangping Li, and Martin Nöllenburg. An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 19:1-19:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhore_et_al:LIPIcs.ESA.2020.19, author = {Bhore, Sujoy and Li, Guangping and N\"{o}llenburg, Martin}, title = {{An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {19:1--19:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.19}, URN = {urn:nbn:de:0030-drops-128856}, doi = {10.4230/LIPIcs.ESA.2020.19}, annote = {Keywords: Independent Sets, Dynamic Algorithms, Rectangle Intersection Graphs, Approximation Algorithms, Experimental Evaluation} }
Johannes Blum and Sabine Storandt. Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 20:1-20:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blum_et_al:LIPIcs.ESA.2020.20, author = {Blum, Johannes and Storandt, Sabine}, title = {{Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.20}, URN = {urn:nbn:de:0030-drops-128861}, doi = {10.4230/LIPIcs.ESA.2020.20}, annote = {Keywords: contraction hierarchies, search space size, balanced separator, tree decomposition} }
Thomas Bläsius, Tobias Friedrich, and Martin Schirneck. The Minimization of Random Hypergraphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 21:1-21:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blasius_et_al:LIPIcs.ESA.2020.21, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Schirneck, Martin}, title = {{The Minimization of Random Hypergraphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.21}, URN = {urn:nbn:de:0030-drops-128871}, doi = {10.4230/LIPIcs.ESA.2020.21}, annote = {Keywords: Chernoff-Hoeffding theorem, maximum entropy, maximization, minimization, phase transition, random hypergraphs} }
Jan Bok, Nikola Jedlic̆ková, Barnaby Martin, Daniël Paulusma, and Siani Smith. Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 22:1-22:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bok_et_al:LIPIcs.ESA.2020.22, author = {Bok, Jan and Jedlic̆kov\'{a}, Nikola and Martin, Barnaby and Paulusma, Dani\"{e}l and Smith, Siani}, title = {{Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {22:1--22:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.22}, URN = {urn:nbn:de:0030-drops-128885}, doi = {10.4230/LIPIcs.ESA.2020.22}, annote = {Keywords: acyclic colouring, star colouring, injective colouring, H-free, dichotomy} }
Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, and Rémi Watrigant. An Algorithmic Weakening of the Erdős-Hajnal Conjecture. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 23:1-23:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bonnet_et_al:LIPIcs.ESA.2020.23, author = {Bonnet, \'{E}douard and Thomass\'{e}, St\'{e}phan and Tran, Xuan Thang and Watrigant, R\'{e}mi}, title = {{An Algorithmic Weakening of the Erd\H{o}s-Hajnal Conjecture}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.23}, URN = {urn:nbn:de:0030-drops-128894}, doi = {10.4230/LIPIcs.ESA.2020.23}, annote = {Keywords: Approximation, Maximum Independent Set, H-free Graphs, Erd\H{o}s-Hajnal conjecture} }
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa. Reconfiguration of Spanning Trees with Many or Few Leaves. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 24:1-24:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bousquet_et_al:LIPIcs.ESA.2020.24, author = {Bousquet, Nicolas and Ito, Takehiro and Kobayashi, Yusuke and Mizuta, Haruka and Ouvrard, Paul and Suzuki, Akira and Wasa, Kunihiro}, title = {{Reconfiguration of Spanning Trees with Many or Few Leaves}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.24}, URN = {urn:nbn:de:0030-drops-128909}, doi = {10.4230/LIPIcs.ESA.2020.24}, annote = {Keywords: combinatorial reconfiguration, spanning trees, PSPACE, polynomial-time algorithms} }
Karl Bringmann, Marvin Künnemann, and André Nusser. When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bringmann_et_al:LIPIcs.ESA.2020.25, author = {Bringmann, Karl and K\"{u}nnemann, Marvin and Nusser, Andr\'{e}}, title = {{When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fr\'{e}chet Distance Under Translation}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.25}, URN = {urn:nbn:de:0030-drops-128912}, doi = {10.4230/LIPIcs.ESA.2020.25}, annote = {Keywords: Fr\'{e}chet Distance, Computational Geometry, Continuous Optimization, Algorithm Engineering} }
Peter A. Brooksbank, Yinan Li, Youming Qiao, and James B. Wilson. Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 26:1-26:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{brooksbank_et_al:LIPIcs.ESA.2020.26, author = {Brooksbank, Peter A. and Li, Yinan and Qiao, Youming and Wilson, James B.}, title = {{Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.26}, URN = {urn:nbn:de:0030-drops-128920}, doi = {10.4230/LIPIcs.ESA.2020.26}, annote = {Keywords: Alternating Matrix Spaces, Average-case Algorithm, p-groups of Class 2nd Exponent p, Magma} }
Kevin Buchin, Sariel Har-Peled, and Dániel Oláh. Sometimes Reliable Spanners of Almost Linear Size. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 27:1-27:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{buchin_et_al:LIPIcs.ESA.2020.27, author = {Buchin, Kevin and Har-Peled, Sariel and Ol\'{a}h, D\'{a}niel}, title = {{Sometimes Reliable Spanners of Almost Linear Size}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.27}, URN = {urn:nbn:de:0030-drops-128934}, doi = {10.4230/LIPIcs.ESA.2020.27}, annote = {Keywords: Geometric spanners, vertex failures, reliability} }
Parinya Chalermsook and Wanchote Po Jiamjitrak. New Binary Search Tree Bounds via Geometric Inversions. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 28:1-28:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chalermsook_et_al:LIPIcs.ESA.2020.28, author = {Chalermsook, Parinya and Jiamjitrak, Wanchote Po}, title = {{New Binary Search Tree Bounds via Geometric Inversions}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.28}, URN = {urn:nbn:de:0030-drops-128944}, doi = {10.4230/LIPIcs.ESA.2020.28}, annote = {Keywords: Binary Search Tree, Potential Function, Inversion, Data Structures, Online Algorithms} }
Timothy M. Chan and Qizheng He. More on Change-Making and Related Problems. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 29:1-29:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chan_et_al:LIPIcs.ESA.2020.29, author = {Chan, Timothy M. and He, Qizheng}, title = {{More on Change-Making and Related Problems}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.29}, URN = {urn:nbn:de:0030-drops-128958}, doi = {10.4230/LIPIcs.ESA.2020.29}, annote = {Keywords: Coin changing, knapsack, dynamic programming, Frobenius problem, fine-grained complexity} }
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, and Minshen Zhu. The Maximum Binary Tree Problem. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 30:1-30:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chandrasekaran_et_al:LIPIcs.ESA.2020.30, author = {Chandrasekaran, Karthekeyan and Grigorescu, Elena and Istrate, Gabriel and Kulkarni, Shubhang and Lin, Young-San and Zhu, Minshen}, title = {{The Maximum Binary Tree Problem}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {30:1--30:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.30}, URN = {urn:nbn:de:0030-drops-128967}, doi = {10.4230/LIPIcs.ESA.2020.30}, annote = {Keywords: maximum binary tree, heapability, inapproximability, fixed-parameter tractability} }
Panagiotis Charalampopoulos and Adam Karczmarz. Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 31:1-31:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{charalampopoulos_et_al:LIPIcs.ESA.2020.31, author = {Charalampopoulos, Panagiotis and Karczmarz, Adam}, title = {{Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {31:1--31:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.31}, URN = {urn:nbn:de:0030-drops-128970}, doi = {10.4230/LIPIcs.ESA.2020.31}, annote = {Keywords: dynamic graph algorithms, planar graphs, single-source shortest paths, strong connectivity} }
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba. The Number of Repetitions in 2D-Strings. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 32:1-32:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{charalampopoulos_et_al:LIPIcs.ESA.2020.32, author = {Charalampopoulos, Panagiotis and Radoszewski, Jakub and Rytter, Wojciech and Wale\'{n}, Tomasz and Zuba, Wiktor}, title = {{The Number of Repetitions in 2D-Strings}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.32}, URN = {urn:nbn:de:0030-drops-128987}, doi = {10.4230/LIPIcs.ESA.2020.32}, annote = {Keywords: 2D-run, quartic, run, square} }
Lin Chen, Martin Koutecký, Lei Xu, and Weidong Shi. New Bounds on Augmenting Steps of Block-Structured Integer Programs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 33:1-33:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chen_et_al:LIPIcs.ESA.2020.33, author = {Chen, Lin and Kouteck\'{y}, Martin and Xu, Lei and Shi, Weidong}, title = {{New Bounds on Augmenting Steps of Block-Structured Integer Programs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.33}, URN = {urn:nbn:de:0030-drops-128994}, doi = {10.4230/LIPIcs.ESA.2020.33}, annote = {Keywords: Integer Programming, Graver basis, Fixed parameter tractable} }
Man-Kwun Chiu, Matias Korman, Martin Suderland, and Takeshi Tokuyama. Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 34:1-34:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chiu_et_al:LIPIcs.ESA.2020.34, author = {Chiu, Man-Kwun and Korman, Matias and Suderland, Martin and Tokuyama, Takeshi}, title = {{Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {34:1--34:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.34}, URN = {urn:nbn:de:0030-drops-129002}, doi = {10.4230/LIPIcs.ESA.2020.34}, annote = {Keywords: Consistent Digital Line Segments, Digital Geometry, Discrepancy} }
Maria Chudnovsky, Jason King, Michał Pilipczuk, Paweł Rzążewski, and Sophie Spirkl. Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 35:1-35:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chudnovsky_et_al:LIPIcs.ESA.2020.35, author = {Chudnovsky, Maria and King, Jason and Pilipczuk, Micha{\l} and Rz\k{a}\.{z}ewski, Pawe{\l} and Spirkl, Sophie}, title = {{Finding Large H-Colorable Subgraphs in Hereditary Graph Classes}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.35}, URN = {urn:nbn:de:0030-drops-129019}, doi = {10.4230/LIPIcs.ESA.2020.35}, annote = {Keywords: homomorphisms, hereditary graph classes, odd cycle transversal} }
Philipp Czerner and Harald Räcke. Compact Oblivious Routing in Weighted Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 36:1-36:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{czerner_et_al:LIPIcs.ESA.2020.36, author = {Czerner, Philipp and R\"{a}cke, Harald}, title = {{Compact Oblivious Routing in Weighted Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {36:1--36:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.36}, URN = {urn:nbn:de:0030-drops-129024}, doi = {10.4230/LIPIcs.ESA.2020.36}, annote = {Keywords: Oblivious Routing, Compact Routing, Competitive Analysis} }
Shichuan Deng, Jian Li, and Yuval Rabani. Approximation Algorithms for Clustering with Dynamic Points. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 37:1-37:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{deng_et_al:LIPIcs.ESA.2020.37, author = {Deng, Shichuan and Li, Jian and Rabani, Yuval}, title = {{Approximation Algorithms for Clustering with Dynamic Points}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.37}, URN = {urn:nbn:de:0030-drops-129037}, doi = {10.4230/LIPIcs.ESA.2020.37}, annote = {Keywords: clustering, dynamic points, multi-objective optimization} }
Hu Ding. A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 38:1-38:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ding:LIPIcs.ESA.2020.38, author = {Ding, Hu}, title = {{A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {38:1--38:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.38}, URN = {urn:nbn:de:0030-drops-129045}, doi = {10.4230/LIPIcs.ESA.2020.38}, annote = {Keywords: minimum enclosing ball, outliers, shape fitting, high dimensions, sub-linear time} }
Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, and Florian Kurpicz. Practical Performance of Space Efficient Data Structures for Longest Common Extensions. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 39:1-39:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dinklage_et_al:LIPIcs.ESA.2020.39, author = {Dinklage, Patrick and Fischer, Johannes and Herlez, Alexander and Kociumaka, Tomasz and Kurpicz, Florian}, title = {{Practical Performance of Space Efficient Data Structures for Longest Common Extensions}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {39:1--39:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.39}, URN = {urn:nbn:de:0030-drops-129050}, doi = {10.4230/LIPIcs.ESA.2020.39}, annote = {Keywords: text indexing, longest common prefix, space efficient data structures} }
Jan Dreier, Philipp Kuinke, and Peter Rossmanith. First-Order Model-Checking in Random Graphs and Complex Networks. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 40:1-40:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dreier_et_al:LIPIcs.ESA.2020.40, author = {Dreier, Jan and Kuinke, Philipp and Rossmanith, Peter}, title = {{First-Order Model-Checking in Random Graphs and Complex Networks}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {40:1--40:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.40}, URN = {urn:nbn:de:0030-drops-129068}, doi = {10.4230/LIPIcs.ESA.2020.40}, annote = {Keywords: random graphs, average case analysis, first-order model-checking} }
Franziska Eberle, Nicole Megow, and Kevin Schewior. Optimally Handling Commitment Issues in Online Throughput Maximization. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 41:1-41:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{eberle_et_al:LIPIcs.ESA.2020.41, author = {Eberle, Franziska and Megow, Nicole and Schewior, Kevin}, title = {{Optimally Handling Commitment Issues in Online Throughput Maximization}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {41:1--41:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.41}, URN = {urn:nbn:de:0030-drops-129076}, doi = {10.4230/LIPIcs.ESA.2020.41}, annote = {Keywords: Deadline scheduling, throughput, online algorithms, competitive analysis} }
Eduard Eiben and William Lochet. A Polynomial Kernel for Line Graph Deletion. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 42:1-42:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{eiben_et_al:LIPIcs.ESA.2020.42, author = {Eiben, Eduard and Lochet, William}, title = {{A Polynomial Kernel for Line Graph Deletion}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {42:1--42:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.42}, URN = {urn:nbn:de:0030-drops-129088}, doi = {10.4230/LIPIcs.ESA.2020.42}, annote = {Keywords: Kernelization, line graphs, H-free editing, graph modification problem} }
Friedrich Eisenbrand and Moritz Venzin. Approximate CVP_p in Time 2^{0.802 n}. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 43:1-43:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{eisenbrand_et_al:LIPIcs.ESA.2020.43, author = {Eisenbrand, Friedrich and Venzin, Moritz}, title = {{Approximate CVP\underlinep in Time 2^\{0.802 n\}}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {43:1--43:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.43}, URN = {urn:nbn:de:0030-drops-129097}, doi = {10.4230/LIPIcs.ESA.2020.43}, annote = {Keywords: Shortest and closest vector problem, approximation algorithm, sieving, covering convex bodies} }
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, and Hadas Shachnai. A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 44:1-44:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fairstein_et_al:LIPIcs.ESA.2020.44, author = {Fairstein, Yaron and Kulik, Ariel and Naor, Joseph (Seffi) and Raz, Danny and Shachnai, Hadas}, title = {{A (1-e^\{-1\}-\epsilon)-Approximation for the Monotone Submodular Multiple Knapsack Problem}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.44}, URN = {urn:nbn:de:0030-drops-129107}, doi = {10.4230/LIPIcs.ESA.2020.44}, annote = {Keywords: Sumodular Optimization, Multiple Knapsack, Randomized Rounding} }
Chenglin Fan and Benjamin Raichel. Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 45:1-45:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fan_et_al:LIPIcs.ESA.2020.45, author = {Fan, Chenglin and Raichel, Benjamin}, title = {{Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {45:1--45:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.45}, URN = {urn:nbn:de:0030-drops-129111}, doi = {10.4230/LIPIcs.ESA.2020.45}, annote = {Keywords: Voronoi Diagrams, Expected Complexity, Computational Geometry} }
Andreas Emil Feldmann and David Saulpic. Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 46:1-46:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{feldmann_et_al:LIPIcs.ESA.2020.46, author = {Feldmann, Andreas Emil and Saulpic, David}, title = {{Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {46:1--46:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.46}, URN = {urn:nbn:de:0030-drops-129129}, doi = {10.4230/LIPIcs.ESA.2020.46}, annote = {Keywords: Approximation Scheme, Clustering, Highway Dimension} }
Alejandro Flores-Velazco and David M. Mount. Coresets for the Nearest-Neighbor Rule. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 47:1-47:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{floresvelazco_et_al:LIPIcs.ESA.2020.47, author = {Flores-Velazco, Alejandro and Mount, David M.}, title = {{Coresets for the Nearest-Neighbor Rule}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {47:1--47:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.47}, URN = {urn:nbn:de:0030-drops-129138}, doi = {10.4230/LIPIcs.ESA.2020.47}, annote = {Keywords: coresets, nearest-neighbor rule, classification, nearest-neighbor condensation, training-set reduction, approximate nearest-neighbor, approximation algorithms} }
Fedor V. Fomin and Petr A. Golovach. Kernelization of Whitney Switches. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 48:1-48:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fomin_et_al:LIPIcs.ESA.2020.48, author = {Fomin, Fedor V. and Golovach, Petr A.}, title = {{Kernelization of Whitney Switches}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {48:1--48:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.48}, URN = {urn:nbn:de:0030-drops-129144}, doi = {10.4230/LIPIcs.ESA.2020.48}, annote = {Keywords: Whitney switch, 2-isomorphism, Parameterized Complexity, kernelization} }
Fedor V. Fomin and Petr A. Golovach. Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 49:1-49:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fomin_et_al:LIPIcs.ESA.2020.49, author = {Fomin, Fedor V. and Golovach, Petr A.}, title = {{Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {49:1--49:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.49}, URN = {urn:nbn:de:0030-drops-129157}, doi = {10.4230/LIPIcs.ESA.2020.49}, annote = {Keywords: Parameterized complexity, structural parameterization, subexponential algorithms, kernelization, chordal graphs, fill-in, independent set, clique, coloring} }
Fedor V. Fomin, Petr Golovach, Pranabendu Misra, and M. S. Ramanujan. On the Complexity of Recovering Incidence Matrices. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 50:1-50:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fomin_et_al:LIPIcs.ESA.2020.50, author = {Fomin, Fedor V. and Golovach, Petr and Misra, Pranabendu and Ramanujan, M. S.}, title = {{On the Complexity of Recovering Incidence Matrices}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.50}, URN = {urn:nbn:de:0030-drops-129164}, doi = {10.4230/LIPIcs.ESA.2020.50}, annote = {Keywords: Graph Incidence Matrix, Matrix Recovery, Enumeration Algorithm} }
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 51:1-51:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fomin_et_al:LIPIcs.ESA.2020.51, author = {Fomin, Fedor V. and Golovach, Petr A. and Stamoulis, Giannos and Thilikos, Dimitrios M.}, title = {{An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {51:1--51:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.51}, URN = {urn:nbn:de:0030-drops-129172}, doi = {10.4230/LIPIcs.ESA.2020.51}, annote = {Keywords: Graph modification Problems, Algorithmic meta-theorems, First Order Logic, Irrelevant vertex technique, Planar graphs, Surface embeddable graphs} }
Zachary Friggstad and Chaitanya Swamy. A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 52:1-52:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{friggstad_et_al:LIPIcs.ESA.2020.52, author = {Friggstad, Zachary and Swamy, Chaitanya}, title = {{A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {52:1--52:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.52}, URN = {urn:nbn:de:0030-drops-129183}, doi = {10.4230/LIPIcs.ESA.2020.52}, annote = {Keywords: Approximation Algorithms, Directed Latency, TSP} }
Henry Förster and Michael Kaufmann. On Compact RAC Drawings. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 53:1-53:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{forster_et_al:LIPIcs.ESA.2020.53, author = {F\"{o}rster, Henry and Kaufmann, Michael}, title = {{On Compact RAC Drawings}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {53:1--53:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.53}, URN = {urn:nbn:de:0030-drops-129192}, doi = {10.4230/LIPIcs.ESA.2020.53}, annote = {Keywords: RAC drawings, visualization of dense graphs, compact drawings} }
Younan Gao, Meng He, and Yakov Nekrich. Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 54:1-54:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gao_et_al:LIPIcs.ESA.2020.54, author = {Gao, Younan and He, Meng and Nekrich, Yakov}, title = {{Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.54}, URN = {urn:nbn:de:0030-drops-129202}, doi = {10.4230/LIPIcs.ESA.2020.54}, annote = {Keywords: orthogonal range search, geometric data structures, orthogonal range reporting, orthogonal range successor, sorted range reporting, text indexing, word RAM} }
Naveen Garg and Nikhil Kumar. Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 55:1-55:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{garg_et_al:LIPIcs.ESA.2020.55, author = {Garg, Naveen and Kumar, Nikhil}, title = {{Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {55:1--55:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.55}, URN = {urn:nbn:de:0030-drops-129214}, doi = {10.4230/LIPIcs.ESA.2020.55}, annote = {Keywords: Combinatorial Optimization, Multicommodity Flow, Network Design} }
Martin Held and Stefan de Lorenzo. An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 56:1-56:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{held_et_al:LIPIcs.ESA.2020.56, author = {Held, Martin and de Lorenzo, Stefan}, title = {{An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {56:1--56:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.56}, URN = {urn:nbn:de:0030-drops-129224}, doi = {10.4230/LIPIcs.ESA.2020.56}, annote = {Keywords: Voronoi Diagram, multiplicative weight, additive weight, arc expansion, overlay arrangement, implementation, experiments, CGAL, exact arithmetic} }
Monika Henzinger and Sagar Kale. Fully-Dynamic Coresets. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 57:1-57:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2020.57, author = {Henzinger, Monika and Kale, Sagar}, title = {{Fully-Dynamic Coresets}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {57:1--57:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.57}, URN = {urn:nbn:de:0030-drops-129230}, doi = {10.4230/LIPIcs.ESA.2020.57}, annote = {Keywords: Clustering, Coresets, Dynamic Algorithms} }
Monika Henzinger, Shahbaz Khan, Richard Paul, and Christian Schulz. Dynamic Matching Algorithms in Practice. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 58:1-58:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2020.58, author = {Henzinger, Monika and Khan, Shahbaz and Paul, Richard and Schulz, Christian}, title = {{Dynamic Matching Algorithms in Practice}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {58:1--58:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.58}, URN = {urn:nbn:de:0030-drops-129243}, doi = {10.4230/LIPIcs.ESA.2020.58}, annote = {Keywords: Matching, Dynamic Matching, Blossom Algorithm} }
Monika Henzinger, Alexander Noe, Christian Schulz, and Darren Strash. Finding All Global Minimum Cuts in Practice. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 59:1-59:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{henzinger_et_al:LIPIcs.ESA.2020.59, author = {Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren}, title = {{Finding All Global Minimum Cuts in Practice}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {59:1--59:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.59}, URN = {urn:nbn:de:0030-drops-129255}, doi = {10.4230/LIPIcs.ESA.2020.59}, annote = {Keywords: Minimum Cut, Graph Algorithm, Algorithm Engineering, Cut Enumeration, Balanced Cut, Global Minimum Cut, Large-scale Graph Analysis} }
Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse. Approximate Turing Kernelization for Problems Parameterized by Treewidth. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 60:1-60:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hols_et_al:LIPIcs.ESA.2020.60, author = {Hols, Eva-Maria C. and Kratsch, Stefan and Pieterse, Astrid}, title = {{Approximate Turing Kernelization for Problems Parameterized by Treewidth}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {60:1--60:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.60}, URN = {urn:nbn:de:0030-drops-129261}, doi = {10.4230/LIPIcs.ESA.2020.60}, annote = {Keywords: Approximation, Turing kernelization, Graph problems, Treewidth} }
Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan. The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 61:1-61:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hoppenworth_et_al:LIPIcs.ESA.2020.61, author = {Hoppenworth, Gary and Bentley, Jason W. and Gibney, Daniel and Thankachan, Sharma V.}, title = {{The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {61:1--61:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.61}, URN = {urn:nbn:de:0030-drops-129278}, doi = {10.4230/LIPIcs.ESA.2020.61}, annote = {Keywords: Edit Distance, Median String, Center String, SETH} }
Tanmay Inamdar and Kasturi Varadarajan. Capacitated Sum-Of-Radii Clustering: An FPT Approximation. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 62:1-62:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{inamdar_et_al:LIPIcs.ESA.2020.62, author = {Inamdar, Tanmay and Varadarajan, Kasturi}, title = {{Capacitated Sum-Of-Radii Clustering: An FPT Approximation}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {62:1--62:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.62}, URN = {urn:nbn:de:0030-drops-129288}, doi = {10.4230/LIPIcs.ESA.2020.62}, annote = {Keywords: Sum-of-radii Clustering, Capacitated Clustering} }
Bart M. P. Jansen and Michał Włodarczyk. Optimal Polynomial-Time Compression for Boolean Max CSP. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 63:1-63:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.ESA.2020.63, author = {Jansen, Bart M. P. and W{\l}odarczyk, Micha{\l}}, title = {{Optimal Polynomial-Time Compression for Boolean Max CSP}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {63:1--63:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.63}, URN = {urn:nbn:de:0030-drops-129297}, doi = {10.4230/LIPIcs.ESA.2020.63}, annote = {Keywords: constraint satisfaction problem, kernelization, exponential time algorithms} }
Mamadou Moustapha Kanté, Christophe Paul, and Dimitrios M. Thilikos. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 64:1-64:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kante_et_al:LIPIcs.ESA.2020.64, author = {Kant\'{e}, Mamadou Moustapha and Paul, Christophe and Thilikos, Dimitrios M.}, title = {{A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.64}, URN = {urn:nbn:de:0030-drops-129307}, doi = {10.4230/LIPIcs.ESA.2020.64}, annote = {Keywords: Graph decompositions, Parameterized algorithms, Typical sequences, Pathwidth, Graph searching} }
Tomohiro Koana, Christian Komusiewicz, and Frank Sommer. Exploiting c-Closure in Kernelization Algorithms for Graph Problems. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 65:1-65:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{koana_et_al:LIPIcs.ESA.2020.65, author = {Koana, Tomohiro and Komusiewicz, Christian and Sommer, Frank}, title = {{Exploiting c-Closure in Kernelization Algorithms for Graph Problems}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {65:1--65:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.65}, URN = {urn:nbn:de:0030-drops-129316}, doi = {10.4230/LIPIcs.ESA.2020.65}, annote = {Keywords: Fixed-parameter tractability, kernelization, c-closure, Dominating Set, Induced Matching, Irredundant Set, Ramsey numbers} }
Łukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, and Magnus Wahlström. Many Visits TSP Revisited. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 66:1-66:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kowalik_et_al:LIPIcs.ESA.2020.66, author = {Kowalik, {\L}ukasz and Li, Shaohua and Nadara, Wojciech and Smulewicz, Marcin and Wahlstr\"{o}m, Magnus}, title = {{Many Visits TSP Revisited}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {66:1--66:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66}, URN = {urn:nbn:de:0030-drops-129329}, doi = {10.4230/LIPIcs.ESA.2020.66}, annote = {Keywords: many visits traveling salesman problem, exponential algorithm} }
Hung Le and Shay Solomon. Light Euclidean Spanners with Steiner Points. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 67:1-67:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{le_et_al:LIPIcs.ESA.2020.67, author = {Le, Hung and Solomon, Shay}, title = {{Light Euclidean Spanners with Steiner Points}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {67:1--67:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.67}, URN = {urn:nbn:de:0030-drops-129331}, doi = {10.4230/LIPIcs.ESA.2020.67}, annote = {Keywords: Euclidean spanners, Steiner spanners, light spanners} }
Victor Lecomte and Omri Weinstein. Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 68:1-68:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{lecomte_et_al:LIPIcs.ESA.2020.68, author = {Lecomte, Victor and Weinstein, Omri}, title = {{Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {68:1--68:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.68}, URN = {urn:nbn:de:0030-drops-129342}, doi = {10.4230/LIPIcs.ESA.2020.68}, annote = {Keywords: data structures, binary search trees, dynamic optimality, lower bounds} }
Lily Li and Aleksandar Nikolov. On the Computational Complexity of Linear Discrepancy. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 69:1-69:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{li_et_al:LIPIcs.ESA.2020.69, author = {Li, Lily and Nikolov, Aleksandar}, title = {{On the Computational Complexity of Linear Discrepancy}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {69:1--69:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.69}, URN = {urn:nbn:de:0030-drops-129352}, doi = {10.4230/LIPIcs.ESA.2020.69}, annote = {Keywords: discrepancy theory, linear discrepancy, rounding, NP-hardness} }
Bogdan-Adrian Manghiuc, Pan Peng, and He Sun. Augmenting the Algebraic Connectivity of Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 70:1-70:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{manghiuc_et_al:LIPIcs.ESA.2020.70, author = {Manghiuc, Bogdan-Adrian and Peng, Pan and Sun, He}, title = {{Augmenting the Algebraic Connectivity of Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {70:1--70:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.70}, URN = {urn:nbn:de:0030-drops-129367}, doi = {10.4230/LIPIcs.ESA.2020.70}, annote = {Keywords: Graph sparsification, Algebraic connectivity, Semidefinite programming} }
Dániel Marx. Chordless Cycle Packing Is Fixed-Parameter Tractable. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 71:1-71:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{marx:LIPIcs.ESA.2020.71, author = {Marx, D\'{a}niel}, title = {{Chordless Cycle Packing Is Fixed-Parameter Tractable}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {71:1--71:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.71}, URN = {urn:nbn:de:0030-drops-129373}, doi = {10.4230/LIPIcs.ESA.2020.71}, annote = {Keywords: chordal graphs, packing, fixed-parameter tractability} }
Dániel Marx and R. B. Sandeep. Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 72:1-72:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{marx_et_al:LIPIcs.ESA.2020.72, author = {Marx, D\'{a}niel and Sandeep, R. B.}, title = {{Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {72:1--72:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.72}, URN = {urn:nbn:de:0030-drops-129383}, doi = {10.4230/LIPIcs.ESA.2020.72}, annote = {Keywords: incompressibility, edge modification problems, H-free graphs} }
Zeev Nutov. Approximating k-Connected m-Dominating Sets. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 73:1-73:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{nutov:LIPIcs.ESA.2020.73, author = {Nutov, Zeev}, title = {{Approximating k-Connected m-Dominating Sets}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.73}, URN = {urn:nbn:de:0030-drops-129392}, doi = {10.4230/LIPIcs.ESA.2020.73}, annote = {Keywords: k-connected graph, m-dominating set, approximation algorithm, rooted subset k-connectivity, subset k-connectivity} }
Karolina Okrasa, Marta Piecyk, and Paweł Rzążewski. Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 74:1-74:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{okrasa_et_al:LIPIcs.ESA.2020.74, author = {Okrasa, Karolina and Piecyk, Marta and Rz\k{a}\.{z}ewski, Pawe{\l}}, title = {{Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {74:1--74:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.74}, URN = {urn:nbn:de:0030-drops-129402}, doi = {10.4230/LIPIcs.ESA.2020.74}, annote = {Keywords: list homomorphisms, fine-grained complexity, SETH, treewidth} }
Georg Osang, Mael Rouxel-Labbé, and Monique Teillaud. Generalizing CGAL Periodic Delaunay Triangulations. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 75:1-75:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{osang_et_al:LIPIcs.ESA.2020.75, author = {Osang, Georg and Rouxel-Labb\'{e}, Mael and Teillaud, Monique}, title = {{Generalizing CGAL Periodic Delaunay Triangulations}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {75:1--75:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.75}, URN = {urn:nbn:de:0030-drops-129419}, doi = {10.4230/LIPIcs.ESA.2020.75}, annote = {Keywords: Delaunay triangulation, lattice, algorithm, software, experiments} }
Ioannis Panagiotas and Bora Uçar. Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 76:1-76:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{panagiotas_et_al:LIPIcs.ESA.2020.76, author = {Panagiotas, Ioannis and U\c{c}ar, Bora}, title = {{Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {76:1--76:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.76}, URN = {urn:nbn:de:0030-drops-129424}, doi = {10.4230/LIPIcs.ESA.2020.76}, annote = {Keywords: bipartite graphs, matching, randomized algorithm} }
Jakub Radoszewski and Juliusz Straszyński. Efficient Computation of 2-Covers of a String. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 77:1-77:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{radoszewski_et_al:LIPIcs.ESA.2020.77, author = {Radoszewski, Jakub and Straszy\'{n}ski, Juliusz}, title = {{Efficient Computation of 2-Covers of a String}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {77:1--77:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.77}, URN = {urn:nbn:de:0030-drops-129432}, doi = {10.4230/LIPIcs.ESA.2020.77}, annote = {Keywords: quasiperiodicity, cover of a string, 2-cover, lambda-cover} }
Rajiv Raman and Saurabh Ray. Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 78:1-78:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{raman_et_al:LIPIcs.ESA.2020.78, author = {Raman, Rajiv and Ray, Saurabh}, title = {{Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {78:1--78:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.78}, URN = {urn:nbn:de:0030-drops-129441}, doi = {10.4230/LIPIcs.ESA.2020.78}, annote = {Keywords: Approximation algorithms, geometry, Covering} }
Hanlin Ren. Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 79:1-79:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ren:LIPIcs.ESA.2020.79, author = {Ren, Hanlin}, title = {{Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {79:1--79:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.79}, URN = {urn:nbn:de:0030-drops-129450}, doi = {10.4230/LIPIcs.ESA.2020.79}, annote = {Keywords: Graph theory, Failure-prone structures} }
Philipp Schepper. Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 80:1-80:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{schepper:LIPIcs.ESA.2020.80, author = {Schepper, Philipp}, title = {{Fine-Grained Complexity of Regular Expression Pattern Matching and Membership}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {80:1--80:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.80}, URN = {urn:nbn:de:0030-drops-129464}, doi = {10.4230/LIPIcs.ESA.2020.80}, annote = {Keywords: Fine-Grained Complexity, Regular Expression, Pattern Matching, Dichotomy} }
Ben Strasser, Dorothea Wagner, and Tim Zeitz. Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 81:1-81:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{strasser_et_al:LIPIcs.ESA.2020.81, author = {Strasser, Ben and Wagner, Dorothea and Zeitz, Tim}, title = {{Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {81:1--81:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.81}, URN = {urn:nbn:de:0030-drops-129479}, doi = {10.4230/LIPIcs.ESA.2020.81}, annote = {Keywords: realistic road networks, time-dependent route planning, shortest paths} }
Hanrui Zhang. Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 82:1-82:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{zhang:LIPIcs.ESA.2020.82, author = {Zhang, Hanrui}, title = {{Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {82:1--82:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.82}, URN = {urn:nbn:de:0030-drops-129488}, doi = {10.4230/LIPIcs.ESA.2020.82}, annote = {Keywords: Prophet Inequalities, Combinatorial Welfare Maximization, (Approximate) Subadditivity} }
Xianghui Zhong. On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 83:1-83:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{zhong:LIPIcs.ESA.2020.83, author = {Zhong, Xianghui}, title = {{On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.83}, URN = {urn:nbn:de:0030-drops-129497}, doi = {10.4230/LIPIcs.ESA.2020.83}, annote = {Keywords: traveling salesman problem, metric TSP, graph TSP, k-Opt algorithm, Lin-Kernighan algorithm, approximation algorithm, approximation ratio.} }
Feedback for Dagstuhl Publishing