Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella. LIPIcs, Volume 107, ICALP'18, Complete Volume. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@Proceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2018, title = {{LIPIcs, Volume 107, ICALP'18, Complete Volume}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018}, URN = {urn:nbn:de:0030-drops-92803}, doi = {10.4230/LIPIcs.ICALP.2018}, annote = {Keywords: Theory of computation} }
Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella. Front Matter, Table of Contents, Preface, Conference Organization. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 0:i-0:xlviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2018.0, author = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {0:i--0:xlviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.0}, URN = {urn:nbn:de:0030-drops-90049}, doi = {10.4230/LIPIcs.ICALP.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Theophanis Hadjistasi and Alexander A. Schwarzmann. Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper). In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 1:1-1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hadjistasi_et_al:LIPIcs.ICALP.2018.1, author = {Hadjistasi, Theophanis and Schwarzmann, Alexander A.}, title = {{Consistent Distributed Memory Services: Resilience and Efficiency}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.1}, URN = {urn:nbn:de:0030-drops-90050}, doi = {10.4230/LIPIcs.ICALP.2018.1}, annote = {Keywords: Atomicity, shared-memory, read/write objects, fault-tolerance, latency} }
Jaroslav Nesetril. Sparsity - an Algorithmic Perspective (Invited Paper). In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{nesetril:LIPIcs.ICALP.2018.2, author = {Nesetril, Jaroslav}, title = {{Sparsity - an Algorithmic Perspective}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.2}, URN = {urn:nbn:de:0030-drops-90062}, doi = {10.4230/LIPIcs.ICALP.2018.2}, annote = {Keywords: sparse structures, algorithm design} }
Sam Staton. Probability Theory from a Programming Perspective (Invited Paper). In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{staton:LIPIcs.ICALP.2018.3, author = {Staton, Sam}, title = {{Probability Theory from a Programming Perspective}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.3}, URN = {urn:nbn:de:0030-drops-90073}, doi = {10.4230/LIPIcs.ICALP.2018.3}, annote = {Keywords: correctness, complexity, statistics} }
Richard Ryan Williams. Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, p. 4:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{williams:LIPIcs.ICALP.2018.4, author = {Williams, Richard Ryan}, title = {{Lower Bounds by Algorithm Design: A Progress Report}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {4:1--4:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.4}, URN = {urn:nbn:de:0030-drops-90088}, doi = {10.4230/LIPIcs.ICALP.2018.4}, annote = {Keywords: circuit complexity, satisfiability, derandomization} }
Anders Aamand, Mathias Bæk Tejs Knudsen, and Mikkel Thorup. Power of d Choices with Simple Tabulation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 5:1-5:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aamand_et_al:LIPIcs.ICALP.2018.5, author = {Aamand, Anders and B{\ae}k Tejs Knudsen, Mathias and Thorup, Mikkel}, title = {{Power of d Choices with Simple Tabulation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.5}, URN = {urn:nbn:de:0030-drops-90096}, doi = {10.4230/LIPIcs.ICALP.2018.5}, annote = {Keywords: Hashing, Load Balancing, Balls and Bins, Simple Tabulation} }
Anders Aamand, Niklas Hjuler, Jacob Holm, and Eva Rotenberg. One-Way Trail Orientations. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aamand_et_al:LIPIcs.ICALP.2018.6, author = {Aamand, Anders and Hjuler, Niklas and Holm, Jacob and Rotenberg, Eva}, title = {{One-Way Trail Orientations}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.6}, URN = {urn:nbn:de:0030-drops-90109}, doi = {10.4230/LIPIcs.ICALP.2018.6}, annote = {Keywords: Graph algorithms, Robbins' theorem, Graph orientation} }
Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 7:1-7:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{arar_et_al:LIPIcs.ICALP.2018.7, author = {Arar, Moab and Chechik, Shiri and Cohen, Sarel and Stein, Cliff and Wajc, David}, title = {{Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.7}, URN = {urn:nbn:de:0030-drops-90112}, doi = {10.4230/LIPIcs.ICALP.2018.7}, annote = {Keywords: Dynamic, Worst-case, Maximum Matching, Maximum Weight Matching} }
Amir Abboud and Karl Bringmann. Tighter Connections Between Formula-SAT and Shaving Logs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 8:1-8:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abboud_et_al:LIPIcs.ICALP.2018.8, author = {Abboud, Amir and Bringmann, Karl}, title = {{Tighter Connections Between Formula-SAT and Shaving Logs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.8}, URN = {urn:nbn:de:0030-drops-90129}, doi = {10.4230/LIPIcs.ICALP.2018.8}, annote = {Keywords: Fine-Grained Complexity, Hardness in P, Formula-SAT, Longest Common Subsequence, Frechet Distance} }
Anna Adamaszek, Matthias Mnich, and Katarzyna Paluch. New Approximation Algorithms for (1,2)-TSP. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{adamaszek_et_al:LIPIcs.ICALP.2018.9, author = {Adamaszek, Anna and Mnich, Matthias and Paluch, Katarzyna}, title = {{New Approximation Algorithms for (1,2)-TSP}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.9}, URN = {urn:nbn:de:0030-drops-90133}, doi = {10.4230/LIPIcs.ICALP.2018.9}, annote = {Keywords: Approximation algorithms, traveling salesperson problem, cycle cover} }
Pankaj K. Agarwal, Haim Kaplan, and Micha Sharir. Union of Hypercubes and 3D Minkowski Sums with Random Sizes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2018.10, author = {Agarwal, Pankaj K. and Kaplan, Haim and Sharir, Micha}, title = {{Union of Hypercubes and 3D Minkowski Sums with Random Sizes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.10}, URN = {urn:nbn:de:0030-drops-90147}, doi = {10.4230/LIPIcs.ICALP.2018.10}, annote = {Keywords: Computational geometry, Minkowski sums, Axis-parallel cubes, Union of geometric objects, Objects with random sizes} }
Rotem Arnon-Friedman and Henry Yuen. Noise-Tolerant Testing of High Entanglement of Formation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 11:1-11:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{arnonfriedman_et_al:LIPIcs.ICALP.2018.11, author = {Arnon-Friedman, Rotem and Yuen, Henry}, title = {{Noise-Tolerant Testing of High Entanglement of Formation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.11}, URN = {urn:nbn:de:0030-drops-90157}, doi = {10.4230/LIPIcs.ICALP.2018.11}, annote = {Keywords: device independence, quantum games, entanglement testing, noise tolerance} }
Miriam Backens. A Complete Dichotomy for Complex-Valued Holant^c. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 12:1-12:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{backens:LIPIcs.ICALP.2018.12, author = {Backens, Miriam}, title = {{A Complete Dichotomy for Complex-Valued Holant^c}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.12}, URN = {urn:nbn:de:0030-drops-90168}, doi = {10.4230/LIPIcs.ICALP.2018.12}, annote = {Keywords: computational complexity, counting complexity, Holant problems, dichotomy, entanglement} }
Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, and Adi Shamir. Tight Bounds on Online Checkpointing Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 13:1-13:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{baron_et_al:LIPIcs.ICALP.2018.13, author = {Bar-On, Achiya and Dinur, Itai and Dunkelman, Orr and Hod, Rani and Keller, Nathan and Ronen, Eyal and Shamir, Adi}, title = {{Tight Bounds on Online Checkpointing Algorithms}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.13}, URN = {urn:nbn:de:0030-drops-90179}, doi = {10.4230/LIPIcs.ICALP.2018.13}, annote = {Keywords: checkpoint, checkpointing algorithm, online algorithm, uniform distribution, discrepancy} }
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 14:1-14:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bensasson_et_al:LIPIcs.ICALP.2018.14, author = {Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael}, title = {{Fast Reed-Solomon Interactive Oracle Proofs of Proximity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.14}, URN = {urn:nbn:de:0030-drops-90183}, doi = {10.4230/LIPIcs.ICALP.2018.14}, annote = {Keywords: Interactive proofs, low degree testing, Reed Solomon codes, proximity testing} }
Amey Bhangale. NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 15:1-15:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhangale:LIPIcs.ICALP.2018.15, author = {Bhangale, Amey}, title = {{NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {15:1--15:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.15}, URN = {urn:nbn:de:0030-drops-90190}, doi = {10.4230/LIPIcs.ICALP.2018.15}, annote = {Keywords: Hypergraph coloring, Inapproximability, Schrijver graph} }
Aditya Bhaskara, Samira Daruki, and Suresh Venkatasubramanian. Sublinear Algorithms for MAXCUT and Correlation Clustering. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 16:1-16:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhaskara_et_al:LIPIcs.ICALP.2018.16, author = {Bhaskara, Aditya and Daruki, Samira and Venkatasubramanian, Suresh}, title = {{Sublinear Algorithms for MAXCUT and Correlation Clustering}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.16}, URN = {urn:nbn:de:0030-drops-90203}, doi = {10.4230/LIPIcs.ICALP.2018.16}, annote = {Keywords: Sublinear algorithms, Streaming algorithms, Core-sets, Maximum cut, Correlation clustering} }
Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., and Pasin Manurangsi. Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 17:1-17:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhattacharyya_et_al:LIPIcs.ICALP.2018.17, author = {Bhattacharyya, Arnab and Ghoshal, Suprovat and C. S., Karthik and Manurangsi, Pasin}, title = {{Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.17}, URN = {urn:nbn:de:0030-drops-90214}, doi = {10.4230/LIPIcs.ICALP.2018.17}, annote = {Keywords: Parameterized Complexity, Inapproximability, Even Set, Minimum Distance Problem, Shortest Vector Problem, Gap-ETH} }
Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, and Jeffrey Shallit. Rollercoasters and Caterpillars. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{biedl_et_al:LIPIcs.ICALP.2018.18, author = {Biedl, Therese and Biniaz, Ahmad and Cummings, Robert and Lubiw, Anna and Manea, Florin and Nowotka, Dirk and Shallit, Jeffrey}, title = {{Rollercoasters and Caterpillars}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.18}, URN = {urn:nbn:de:0030-drops-90224}, doi = {10.4230/LIPIcs.ICALP.2018.18}, annote = {Keywords: sequences, alternating runs, patterns in permutations, caterpillars} }
Davide Bilò. New algorithms for Steiner tree reoptimization. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bilo:LIPIcs.ICALP.2018.19, author = {Bil\`{o}, Davide}, title = {{New algorithms for Steiner tree reoptimization}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.19}, URN = {urn:nbn:de:0030-drops-90234}, doi = {10.4230/LIPIcs.ICALP.2018.19}, annote = {Keywords: Steiner tree problem, reoptimization, approximation algorithms} }
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, and Marianne Thieffry. Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 20:1-20:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{blasius_et_al:LIPIcs.ICALP.2018.20, author = {Bl\"{a}sius, Thomas and Freiberger, Cedric and Friedrich, Tobias and Katzmann, Maximilian and Montenegro-Retana, Felix and Thieffry, Marianne}, title = {{Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.20}, URN = {urn:nbn:de:0030-drops-90246}, doi = {10.4230/LIPIcs.ICALP.2018.20}, annote = {Keywords: random graphs, hyperbolic geometry, scale-free networks, bidirectional shortest path} }
Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, and Lin F. Yang. Approximate Convex Hull of Data Streams. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 21:1-21:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{blum_et_al:LIPIcs.ICALP.2018.21, author = {Blum, Avrim and Braverman, Vladimir and Kumar, Ananya and Lang, Harry and Yang, Lin F.}, title = {{Approximate Convex Hull of Data Streams}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.21}, URN = {urn:nbn:de:0030-drops-90254}, doi = {10.4230/LIPIcs.ICALP.2018.21}, annote = {Keywords: Convex Hulls, Streaming Algorithms, Epsilon Kernels, Sparse Coding} }
Andrej Bogdanov. Small Bias Requires Large Formulas. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 22:1-22:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bogdanov:LIPIcs.ICALP.2018.22, author = {Bogdanov, Andrej}, title = {{Small Bias Requires Large Formulas}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {22:1--22:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.22}, URN = {urn:nbn:de:0030-drops-90264}, doi = {10.4230/LIPIcs.ICALP.2018.22}, annote = {Keywords: formula lower bounds, natural proofs, pseudorandomness} }
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, and Luis Fernando Schultz Xavier da Silveira. Geodesic Obstacle Representation of Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 23:1-23:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bose_et_al:LIPIcs.ICALP.2018.23, author = {Bose, Prosenjit and Carmi, Paz and Dujmovic, Vida and Mehrabi, Saeed and Montecchiani, Fabrizio and Morin, Pat and Silveira, Luis Fernando Schultz Xavier da}, title = {{Geodesic Obstacle Representation of Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.23}, URN = {urn:nbn:de:0030-drops-90274}, doi = {10.4230/LIPIcs.ICALP.2018.23}, annote = {Keywords: Obstacle representation, Grid obstacle representation, Geodesic obstacle representation} }
Elette Boyle, Abhishek Jain, Manoj Prabhakaran, and Ching-Hua Yu. The Bottleneck Complexity of Secure Multiparty Computation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 24:1-24:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{boyle_et_al:LIPIcs.ICALP.2018.24, author = {Boyle, Elette and Jain, Abhishek and Prabhakaran, Manoj and Yu, Ching-Hua}, title = {{The Bottleneck Complexity of Secure Multiparty Computation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.24}, URN = {urn:nbn:de:0030-drops-90288}, doi = {10.4230/LIPIcs.ICALP.2018.24}, annote = {Keywords: distributed protocols, secure computation, communication complexity} }
Vladimir Braverman, Emanuele Viola, David P. Woodruff, and Lin F. Yang. Revisiting Frequency Moment Estimation in Random Order Streams. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{braverman_et_al:LIPIcs.ICALP.2018.25, author = {Braverman, Vladimir and Viola, Emanuele and Woodruff, David P. and Yang, Lin F.}, title = {{Revisiting Frequency Moment Estimation in Random Order Streams}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.25}, URN = {urn:nbn:de:0030-drops-90294}, doi = {10.4230/LIPIcs.ICALP.2018.25}, annote = {Keywords: Data Stream, Frequency Moments, Random Order, Space Complexity, Insertion Only Stream} }
Jaroslaw Byrka, Piotr Skowron, and Krzysztof Sornat. Proportional Approval Voting, Harmonic k-median, and Negative Association. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 26:1-26:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{byrka_et_al:LIPIcs.ICALP.2018.26, author = {Byrka, Jaroslaw and Skowron, Piotr and Sornat, Krzysztof}, title = {{Proportional Approval Voting, Harmonic k-median, and Negative Association}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.26}, URN = {urn:nbn:de:0030-drops-90307}, doi = {10.4230/LIPIcs.ICALP.2018.26}, annote = {Keywords: approximation algorithms, computational social choice, k-median, dependent rounding, negative association} }
Marco L. Carmosino, Russell Impagliazzo, and Manuel Sabin. Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 27:1-27:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{carmosino_et_al:LIPIcs.ICALP.2018.27, author = {Carmosino, Marco L. and Impagliazzo, Russell and Sabin, Manuel}, title = {{Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.27}, URN = {urn:nbn:de:0030-drops-90316}, doi = {10.4230/LIPIcs.ICALP.2018.27}, annote = {Keywords: Derandomization, Hardness vs Randomness, Fine-Grained Complexity, Average-Case Complexity, k-Orthogonal Vectors, k-CLIQUE} }
L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 28:1-28:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{celis_et_al:LIPIcs.ICALP.2018.28, author = {Celis, L. Elisa and Straszak, Damian and Vishnoi, Nisheeth K.}, title = {{Ranking with Fairness Constraints}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.28}, URN = {urn:nbn:de:0030-drops-90329}, doi = {10.4230/LIPIcs.ICALP.2018.28}, annote = {Keywords: Ranking, Fairness, Optimization, Matching, Approximation Algorithms} }
Deeparnab Chakrabarty and Chaitanya Swamy. Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 29:1-29:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chakrabarty_et_al:LIPIcs.ICALP.2018.29, author = {Chakrabarty, Deeparnab and Swamy, Chaitanya}, title = {{Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.29}, URN = {urn:nbn:de:0030-drops-90335}, doi = {10.4230/LIPIcs.ICALP.2018.29}, annote = {Keywords: Approximation algorithms, Clustering, Facility location, Primal-dual method} }
Deeparnab Chakrabarty and Maryam Negahbani. Generalized Center Problems with Outliers. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chakrabarty_et_al:LIPIcs.ICALP.2018.30, author = {Chakrabarty, Deeparnab and Negahbani, Maryam}, title = {{Generalized Center Problems with Outliers}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.30}, URN = {urn:nbn:de:0030-drops-90345}, doi = {10.4230/LIPIcs.ICALP.2018.30}, annote = {Keywords: Approximation Algorithms, Clustering, k-Center Problem} }
Timothy M. Chan, Yakov Nekrich, Saladi Rahul, and Konstantinos Tsakalidis. Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan_et_al:LIPIcs.ICALP.2018.31, author = {Chan, Timothy M. and Nekrich, Yakov and Rahul, Saladi and Tsakalidis, Konstantinos}, title = {{Orthogonal Point Location and Rectangle Stabbing Queries in 3-d}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.31}, URN = {urn:nbn:de:0030-drops-90352}, doi = {10.4230/LIPIcs.ICALP.2018.31}, annote = {Keywords: geometric data structures, orthogonal point location, rectangle stabbing, pointer machines, I/O model, word RAM model} }
L. Sunil Chandran, Yun Kuen Cheung, and Davis Issac. Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 32:1-32:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chandran_et_al:LIPIcs.ICALP.2018.32, author = {Chandran, L. Sunil and Cheung, Yun Kuen and Issac, Davis}, title = {{Spanning Tree Congestion and Computation of Generalized Gy\"{o}ri-Lov\'{a}sz Partition}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.32}, URN = {urn:nbn:de:0030-drops-90361}, doi = {10.4230/LIPIcs.ICALP.2018.32}, annote = {Keywords: Spanning Tree Congestion, Graph Sparsification, Graph Partitioning, Min-Max Graph Partitioning, k-Vertex-Connected Graphs, Gy\"{o}ri-Lov\'{a}sz Theorem} }
Moses Charikar and Shay Solomon. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 33:1-33:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{charikar_et_al:LIPIcs.ICALP.2018.33, author = {Charikar, Moses and Solomon, Shay}, title = {{Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.33}, URN = {urn:nbn:de:0030-drops-90370}, doi = {10.4230/LIPIcs.ICALP.2018.33}, annote = {Keywords: dynamic graph algorithms, maximum matching, worst-case bounds} }
Moses Charikar, Ofir Geri, Michael P. Kim, and William Kuszmaul. On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 34:1-34:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{charikar_et_al:LIPIcs.ICALP.2018.34, author = {Charikar, Moses and Geri, Ofir and Kim, Michael P. and Kuszmaul, William}, title = {{On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.34}, URN = {urn:nbn:de:0030-drops-90383}, doi = {10.4230/LIPIcs.ICALP.2018.34}, annote = {Keywords: edit distance, alignment, approximation algorithms, embedding, dimension reduction} }
Jiehua Chen, Danny Hermelin, Manuel Sorge, and Harel Yedidsion. How Hard Is It to Satisfy (Almost) All Roommates?. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 35:1-35:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ICALP.2018.35, author = {Chen, Jiehua and Hermelin, Danny and Sorge, Manuel and Yedidsion, Harel}, title = {{How Hard Is It to Satisfy (Almost) All Roommates?}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {35:1--35:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.35}, URN = {urn:nbn:de:0030-drops-90398}, doi = {10.4230/LIPIcs.ICALP.2018.35}, annote = {Keywords: NP-hard problems Data reduction rules Kernelizations Parameterized complexity analysis and algorithmics} }
Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan. A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 36:1-36:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chillara_et_al:LIPIcs.ICALP.2018.36, author = {Chillara, Suryajith and Limaye, Nutan and Srinivasan, Srikanth}, title = {{A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.36}, URN = {urn:nbn:de:0030-drops-90401}, doi = {10.4230/LIPIcs.ICALP.2018.36}, annote = {Keywords: Algebraic circuit complexity, Multilinear formulas, Lower Bounds} }
Siu-Wing Cheng and Yuchen Mao. Restricted Max-Min Fair Allocation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 37:1-37:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{cheng_et_al:LIPIcs.ICALP.2018.37, author = {Cheng, Siu-Wing and Mao, Yuchen}, title = {{Restricted Max-Min Fair Allocation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {37:1--37:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.37}, URN = {urn:nbn:de:0030-drops-90418}, doi = {10.4230/LIPIcs.ICALP.2018.37}, annote = {Keywords: Fair allocation, approximation, local search} }
Julia Chuzhoy, David H. K. Kim, and Rachit Nimavat. Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 38:1-38:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chuzhoy_et_al:LIPIcs.ICALP.2018.38, author = {Chuzhoy, Julia and Kim, David H. K. and Nimavat, Rachit}, title = {{Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.38}, URN = {urn:nbn:de:0030-drops-90423}, doi = {10.4230/LIPIcs.ICALP.2018.38}, annote = {Keywords: Node-disjoint paths, approximation algorithms, routing and layout} }
Alex Conway, Martín Farach-Colton, and Philip Shilane. Optimal Hashing in External Memory. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 39:1-39:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{conway_et_al:LIPIcs.ICALP.2018.39, author = {Conway, Alex and Farach-Colton, Mart{\'\i}n and Shilane, Philip}, title = {{Optimal Hashing in External Memory}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.39}, URN = {urn:nbn:de:0030-drops-90436}, doi = {10.4230/LIPIcs.ICALP.2018.39}, annote = {Keywords: hash tables, external memory algorthims, cache-oblivious algorithms, asymmetric data structures} }
Holger Dell, Martin Grohe, and Gaurav Rattan. Lovász Meets Weisfeiler and Leman. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 40:1-40:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dell_et_al:LIPIcs.ICALP.2018.40, author = {Dell, Holger and Grohe, Martin and Rattan, Gaurav}, title = {{Lov\'{a}sz Meets Weisfeiler and Leman}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.40}, URN = {urn:nbn:de:0030-drops-90444}, doi = {10.4230/LIPIcs.ICALP.2018.40}, annote = {Keywords: graph isomorphism, graph homomorphism numbers, tree width} }
Ilias Diakonikolas, Themis Gouleakis, John Peebles, and Eric Price. Sample-Optimal Identity Testing with High Probability. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 41:1-41:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{diakonikolas_et_al:LIPIcs.ICALP.2018.41, author = {Diakonikolas, Ilias and Gouleakis, Themis and Peebles, John and Price, Eric}, title = {{Sample-Optimal Identity Testing with High Probability}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.41}, URN = {urn:nbn:de:0030-drops-90459}, doi = {10.4230/LIPIcs.ICALP.2018.41}, annote = {Keywords: distribution testing, property testing, sample complexity} }
Ran Duan and Hanlin Ren. Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 42:1-42:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{duan_et_al:LIPIcs.ICALP.2018.42, author = {Duan, Ran and Ren, Hanlin}, title = {{Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {42:1--42:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.42}, URN = {urn:nbn:de:0030-drops-90467}, doi = {10.4230/LIPIcs.ICALP.2018.42}, annote = {Keywords: Graph Theory, Approximation Algorithms, Combinatorial Optimization} }
Ran Duan, Kaifeng Lyu, and Yuanhang Xie. Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 43:1-43:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{duan_et_al:LIPIcs.ICALP.2018.43, author = {Duan, Ran and Lyu, Kaifeng and Xie, Yuanhang}, title = {{Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {43:1--43:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.43}, URN = {urn:nbn:de:0030-drops-90475}, doi = {10.4230/LIPIcs.ICALP.2018.43}, annote = {Keywords: Graph Algorithm, Bottleneck Path, Combinatorial Optimization} }
Ran Duan, Yong Gu, and Le Zhang. Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 44:1-44:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{duan_et_al:LIPIcs.ICALP.2018.44, author = {Duan, Ran and Gu, Yong and Zhang, Le}, title = {{Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.44}, URN = {urn:nbn:de:0030-drops-90487}, doi = {10.4230/LIPIcs.ICALP.2018.44}, annote = {Keywords: Graph algorithms, Matrix multiplication, Non-decreasing paths} }
Bartlomiej Dudek and Pawel Gawrychowski. Edit Distance between Unrooted Trees in Cubic Time. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 45:1-45:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dudek_et_al:LIPIcs.ICALP.2018.45, author = {Dudek, Bartlomiej and Gawrychowski, Pawel}, title = {{Edit Distance between Unrooted Trees in Cubic Time}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {45:1--45:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.45}, URN = {urn:nbn:de:0030-drops-90492}, doi = {10.4230/LIPIcs.ICALP.2018.45}, annote = {Keywords: tree edit distance, dynamic programming, heavy light decomposition} }
Lech Duraj, Grzegorz Gutowski, and Jakub Kozik. A Note on Two-Colorability of Nonuniform Hypergraphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{duraj_et_al:LIPIcs.ICALP.2018.46, author = {Duraj, Lech and Gutowski, Grzegorz and Kozik, Jakub}, title = {{A Note on Two-Colorability of Nonuniform Hypergraphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.46}, URN = {urn:nbn:de:0030-drops-90505}, doi = {10.4230/LIPIcs.ICALP.2018.46}, annote = {Keywords: Property B, Nonuniform Hypergraphs, Hypergraph Coloring, Random Greedy Coloring} }
Zdenek Dvorák and Ken-ichi Kawarabayashi. Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 47:1-47:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.ICALP.2018.47, author = {Dvor\'{a}k, Zdenek and Kawarabayashi, Ken-ichi}, title = {{Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {47:1--47:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.47}, URN = {urn:nbn:de:0030-drops-90510}, doi = {10.4230/LIPIcs.ICALP.2018.47}, annote = {Keywords: non-approximability, chromatic number, minor-closed classes} }
Eduard Eiben and Iyad Kanj. How to Navigate Through Obstacles?. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 48:1-48:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{eiben_et_al:LIPIcs.ICALP.2018.48, author = {Eiben, Eduard and Kanj, Iyad}, title = {{How to Navigate Through Obstacles?}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.48}, URN = {urn:nbn:de:0030-drops-90528}, doi = {10.4230/LIPIcs.ICALP.2018.48}, annote = {Keywords: parameterized complexity and algorithms, motion planning, barrier coverage, barrier resilience, colored path, minimum constraint removal, planar graphs} }
Friedrich Eisenbrand, Christoph Hunkenschröder, and Kim-Manuel Klein. Faster Algorithms for Integer Programs with Block Structure. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 49:1-49:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{eisenbrand_et_al:LIPIcs.ICALP.2018.49, author = {Eisenbrand, Friedrich and Hunkenschr\"{o}der, Christoph and Klein, Kim-Manuel}, title = {{Faster Algorithms for Integer Programs with Block Structure}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {49:1--49:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.49}, URN = {urn:nbn:de:0030-drops-90537}, doi = {10.4230/LIPIcs.ICALP.2018.49}, annote = {Keywords: n-fold, Tree-fold, Integer Programming} }
Uriel Feige, Boaz Patt-Shamir, and Shai Vardi. On the Probe Complexity of Local Computation Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 50:1-50:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{feige_et_al:LIPIcs.ICALP.2018.50, author = {Feige, Uriel and Patt-Shamir, Boaz and Vardi, Shai}, title = {{On the Probe Complexity of Local Computation Algorithms}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.50}, URN = {urn:nbn:de:0030-drops-90543}, doi = {10.4230/LIPIcs.ICALP.2018.50}, annote = {Keywords: Local computation algorithms, sublinear algorithms} }
Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc. Fully-Dynamic Bin Packing with Little Repacking. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 51:1-51:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{feldkord_et_al:LIPIcs.ICALP.2018.51, author = {Feldkord, Bj\"{o}rn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, S\"{o}ren and Wajc, David}, title = {{Fully-Dynamic Bin Packing with Little Repacking}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {51:1--51:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.51}, URN = {urn:nbn:de:0030-drops-90556}, doi = {10.4230/LIPIcs.ICALP.2018.51}, annote = {Keywords: Bin Packing, Fully Dynamic, Recourse, Tradeoffs} }
Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, and Maximilian Wötzel. A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 52:1-52:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fichtenberger_et_al:LIPIcs.ICALP.2018.52, author = {Fichtenberger, Hendrik and Levi, Reut and Vasudev, Yadu and W\"{o}tzel, Maximilian}, title = {{A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {52:1--52:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.52}, URN = {urn:nbn:de:0030-drops-90563}, doi = {10.4230/LIPIcs.ICALP.2018.52}, annote = {Keywords: graph property testing, minor-free graphs} }
Fedor V. Fomin, Petr A. Golovach, and Fahad Panolan. Parameterized Low-Rank Binary Matrix Approximation. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 53:1-53:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fomin_et_al:LIPIcs.ICALP.2018.53, author = {Fomin, Fedor V. and Golovach, Petr A. and Panolan, Fahad}, title = {{Parameterized Low-Rank Binary Matrix Approximation}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {53:1--53:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.53}, URN = {urn:nbn:de:0030-drops-90571}, doi = {10.4230/LIPIcs.ICALP.2018.53}, annote = {Keywords: Binary matrices, clustering, low-rank approximation, fixed-parameter tractability} }
Michael A. Forbes, Sumanta Ghosh, and Nitin Saxena. Towards Blackbox Identity Testing of Log-Variate Circuits. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 54:1-54:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{forbes_et_al:LIPIcs.ICALP.2018.54, author = {Forbes, Michael A. and Ghosh, Sumanta and Saxena, Nitin}, title = {{Towards Blackbox Identity Testing of Log-Variate Circuits}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {54:1--54:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.54}, URN = {urn:nbn:de:0030-drops-90582}, doi = {10.4230/LIPIcs.ICALP.2018.54}, annote = {Keywords: hitting-set, depth-3, diagonal, derandomization, polynomial identity testing, log-variate, concentration, cone closed, basis isolation} }
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, and Nicole Wein. Finding Cliques in Social Networks: A New Distribution-Free Model. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 55:1-55:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fox_et_al:LIPIcs.ICALP.2018.55, author = {Fox, Jacob and Roughgarden, Tim and Seshadhri, C. and Wei, Fan and Wein, Nicole}, title = {{Finding Cliques in Social Networks: A New Distribution-Free Model}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.55}, URN = {urn:nbn:de:0030-drops-90596}, doi = {10.4230/LIPIcs.ICALP.2018.55}, annote = {Keywords: Graph algorithms, social networks, fixed-parameter tractability} }
Hao Fu, Jian Li, and Pan Xu. A PTAS for a Class of Stochastic Dynamic Programs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fu_et_al:LIPIcs.ICALP.2018.56, author = {Fu, Hao and Li, Jian and Xu, Pan}, title = {{A PTAS for a Class of Stochastic Dynamic Programs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.56}, URN = {urn:nbn:de:0030-drops-90609}, doi = {10.4230/LIPIcs.ICALP.2018.56}, annote = {Keywords: stochastic optimization, dynamic program, markov decision process, block policy, approximation algorithm} }
Buddhima Gamlath, Sangxia Huang, and Ola Svensson. Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 57:1-57:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gamlath_et_al:LIPIcs.ICALP.2018.57, author = {Gamlath, Buddhima and Huang, Sangxia and Svensson, Ola}, title = {{Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.57}, URN = {urn:nbn:de:0030-drops-90612}, doi = {10.4230/LIPIcs.ICALP.2018.57}, annote = {Keywords: Clustering, Semi-supervised Learning, Approximation Algorithms, k-Means, k-Median} }
Sumit Ganguly and David P. Woodruff. High Probability Frequency Moment Sketches. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 58:1-58:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ganguly_et_al:LIPIcs.ICALP.2018.58, author = {Ganguly, Sumit and Woodruff, David P.}, title = {{High Probability Frequency Moment Sketches}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {58:1--58:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.58}, URN = {urn:nbn:de:0030-drops-90623}, doi = {10.4230/LIPIcs.ICALP.2018.58}, annote = {Keywords: Data Streams, Frequency Moments, High Confidence} }
Shashwat Garg. Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 59:1-59:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{garg:LIPIcs.ICALP.2018.59, author = {Garg, Shashwat}, title = {{Quasi-PTAS for Scheduling with Precedences using LP Hierarchies}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {59:1--59:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.59}, URN = {urn:nbn:de:0030-drops-90638}, doi = {10.4230/LIPIcs.ICALP.2018.59}, annote = {Keywords: Approximation algorithms, hierarchies, scheduling, rounding techniques} }
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, and Veronika Slívová. ARRIVAL: Next Stop in CLS. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 60:1-60:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gartner_et_al:LIPIcs.ICALP.2018.60, author = {G\"{a}rtner, Bernd and Hansen, Thomas Dueholm and Hub\'{a}cek, Pavel and Kr\'{a}l, Karel and Mosaad, Hagar and Sl{\'\i}vov\'{a}, Veronika}, title = {{ARRIVAL: Next Stop in CLS}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {60:1--60:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.60}, URN = {urn:nbn:de:0030-drops-90641}, doi = {10.4230/LIPIcs.ICALP.2018.60}, annote = {Keywords: CLS, switch graphs, zero-player game, UP n coUP} }
Pawel Gawrychowski and Adam Karczmarz. Improved Bounds for Shortest Paths in Dense Distance Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 61:1-61:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2018.61, author = {Gawrychowski, Pawel and Karczmarz, Adam}, title = {{Improved Bounds for Shortest Paths in Dense Distance Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {61:1--61:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.61}, URN = {urn:nbn:de:0030-drops-90654}, doi = {10.4230/LIPIcs.ICALP.2018.61}, annote = {Keywords: shortest paths, dense distance graph, planar graph, Monge matrix} }
Pawel Gawrychowski and Przemyslaw Uznanski. Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 62:1-62:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2018.62, author = {Gawrychowski, Pawel and Uznanski, Przemyslaw}, title = {{Towards Unified Approximate Pattern Matching for Hamming and L\underline1 Distance}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {62:1--62:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.62}, URN = {urn:nbn:de:0030-drops-90669}, doi = {10.4230/LIPIcs.ICALP.2018.62}, annote = {Keywords: approximate pattern matching, conditional lower bounds, L\underline1 distance, Hamming distance} }
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, and Oren Weimann. A Faster Construction of Greedy Consensus Trees. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 63:1-63:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2018.63, author = {Gawrychowski, Pawel and Landau, Gad M. and Sung, Wing-Kin and Weimann, Oren}, title = {{A Faster Construction of Greedy Consensus Trees}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.63}, URN = {urn:nbn:de:0030-drops-90676}, doi = {10.4230/LIPIcs.ICALP.2018.63}, annote = {Keywords: phylogenetic trees, greedy consensus trees, dynamic trees} }
Pawel Gawrychowski, Liran Markin, and Oren Weimann. A Faster FPTAS for #Knapsack. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 64:1-64:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gawrychowski_et_al:LIPIcs.ICALP.2018.64, author = {Gawrychowski, Pawel and Markin, Liran and Weimann, Oren}, title = {{A Faster FPTAS for #Knapsack}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.64}, URN = {urn:nbn:de:0030-drops-90687}, doi = {10.4230/LIPIcs.ICALP.2018.64}, annote = {Keywords: knapsack, approximate counting, K-approximating sets and functions} }
Shay Golan, Tsvi Kopelowitz, and Ely Porat. Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 65:1-65:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{golan_et_al:LIPIcs.ICALP.2018.65, author = {Golan, Shay and Kopelowitz, Tsvi and Porat, Ely}, title = {{Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {65:1--65:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.65}, URN = {urn:nbn:de:0030-drops-90690}, doi = {10.4230/LIPIcs.ICALP.2018.65}, annote = {Keywords: Streaming approximate pattern matching, Dictionary matching} }
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, and Kaja Wille. Gray Codes and Symmetric Chains. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 66:1-66:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gregor_et_al:LIPIcs.ICALP.2018.66, author = {Gregor, Petr and J\"{a}ger, Sven and M\"{u}tze, Torsten and Sawada, Joe and Wille, Kaja}, title = {{Gray Codes and Symmetric Chains}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {66:1--66:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.66}, URN = {urn:nbn:de:0030-drops-90703}, doi = {10.4230/LIPIcs.ICALP.2018.66}, annote = {Keywords: Gray code, Hamilton cycle, hypercube, poset, symmetric chain} }
Martin Grohe, Daniel Neuen, Pascal Schweitzer, and Daniel Wiebking. An Improved Isomorphism Test for Bounded-Tree-Width Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 67:1-67:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{grohe_et_al:LIPIcs.ICALP.2018.67, author = {Grohe, Martin and Neuen, Daniel and Schweitzer, Pascal and Wiebking, Daniel}, title = {{An Improved Isomorphism Test for Bounded-Tree-Width Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.67}, URN = {urn:nbn:de:0030-drops-90714}, doi = {10.4230/LIPIcs.ICALP.2018.67}, annote = {Keywords: graph isomorphism, graph canonization, tree width, decompositions} }
Heng Guo and Mark Jerrum. A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 68:1-68:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{guo_et_al:LIPIcs.ICALP.2018.68, author = {Guo, Heng and Jerrum, Mark}, title = {{A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {68:1--68:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.68}, URN = {urn:nbn:de:0030-drops-90727}, doi = {10.4230/LIPIcs.ICALP.2018.68}, annote = {Keywords: Approximate counting, Network Reliability, Sampling, Markov chains} }
Heng Guo and Mark Jerrum. Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 69:1-69:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{guo_et_al:LIPIcs.ICALP.2018.69, author = {Guo, Heng and Jerrum, Mark}, title = {{Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {69:1--69:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.69}, URN = {urn:nbn:de:0030-drops-90739}, doi = {10.4230/LIPIcs.ICALP.2018.69}, annote = {Keywords: Hard disks model, Sampling, Markov chains} }
Anupam Gupta, Amit Kumar, and Jason Li. Non-Preemptive Flow-Time Minimization via Rejections. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 70:1-70:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gupta_et_al:LIPIcs.ICALP.2018.70, author = {Gupta, Anupam and Kumar, Amit and Li, Jason}, title = {{Non-Preemptive Flow-Time Minimization via Rejections}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {70:1--70:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.70}, URN = {urn:nbn:de:0030-drops-90740}, doi = {10.4230/LIPIcs.ICALP.2018.70}, annote = {Keywords: Scheduling, Rejection, Unrelated Machines, Non-Preemptive} }
Anupam Gupta, Ruta Mehta, and Marco Molinaro. Maximizing Profit with Convex Costs in the Random-order Model. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gupta_et_al:LIPIcs.ICALP.2018.71, author = {Gupta, Anupam and Mehta, Ruta and Molinaro, Marco}, title = {{Maximizing Profit with Convex Costs in the Random-order Model}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.71}, URN = {urn:nbn:de:0030-drops-90751}, doi = {10.4230/LIPIcs.ICALP.2018.71}, annote = {Keywords: Online algorithms, secretary problem, random order, convex duality} }
Manoj Gupta and Aditi Singh. Generic Single Edge Fault Tolerant Exact Distance Oracle. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 72:1-72:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gupta_et_al:LIPIcs.ICALP.2018.72, author = {Gupta, Manoj and Singh, Aditi}, title = {{Generic Single Edge Fault Tolerant Exact Distance Oracle}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {72:1--72:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.72}, URN = {urn:nbn:de:0030-drops-90766}, doi = {10.4230/LIPIcs.ICALP.2018.72}, annote = {Keywords: Fault Tolerant Algorithms, Graph Algorithms, Distance Oracles, Data-Structures} }
Tom Gur, Yang P. Liu, and Ron D. Rothblum. An Exponential Separation Between MA and AM Proofs of Proximity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 73:1-73:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gur_et_al:LIPIcs.ICALP.2018.73, author = {Gur, Tom and Liu, Yang P. and Rothblum, Ron D.}, title = {{An Exponential Separation Between MA and AM Proofs of Proximity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {73:1--73:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.73}, URN = {urn:nbn:de:0030-drops-90772}, doi = {10.4230/LIPIcs.ICALP.2018.73}, annote = {Keywords: Property testing, Probabilistic proof systems, Proofs of proximity} }
Rohit Gurjar, Thomas Thierauf, and Nisheeth K. Vishnoi. Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 74:1-74:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gurjar_et_al:LIPIcs.ICALP.2018.74, author = {Gurjar, Rohit and Thierauf, Thomas and Vishnoi, Nisheeth K.}, title = {{Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {74:1--74:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.74}, URN = {urn:nbn:de:0030-drops-90782}, doi = {10.4230/LIPIcs.ICALP.2018.74}, annote = {Keywords: Derandomization, Isolation Lemma, Total unimodularity, Near-shortest vectors in Lattices, Regular matroids} }
Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 75:1-75:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{haeupler_et_al:LIPIcs.ICALP.2018.75, author = {Haeupler, Bernhard and Shahrasbi, Amirbehshad and Vitercik, Ellen}, title = {{Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {75:1--75:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.75}, URN = {urn:nbn:de:0030-drops-90794}, doi = {10.4230/LIPIcs.ICALP.2018.75}, annote = {Keywords: Synchronization Strings, Channel Simulation, Coding for Interactive Communication} }
Bernhard Haeupler, Amirbehshad Shahrasbi, and Madhu Sudan. Synchronization Strings: List Decoding for Insertions and Deletions. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 76:1-76:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{haeupler_et_al:LIPIcs.ICALP.2018.76, author = {Haeupler, Bernhard and Shahrasbi, Amirbehshad and Sudan, Madhu}, title = {{Synchronization Strings: List Decoding for Insertions and Deletions}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {76:1--76:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.76}, URN = {urn:nbn:de:0030-drops-90807}, doi = {10.4230/LIPIcs.ICALP.2018.76}, annote = {Keywords: List Decoding, Insertions and Deletions, Synchronization Strings} }
Sariel Har-Peled, Piotr Indyk, and Sepideh Mahabadi. Approximate Sparse Linear Regression. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 77:1-77:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{harpeled_et_al:LIPIcs.ICALP.2018.77, author = {Har-Peled, Sariel and Indyk, Piotr and Mahabadi, Sepideh}, title = {{Approximate Sparse Linear Regression}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {77:1--77:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.77}, URN = {urn:nbn:de:0030-drops-90816}, doi = {10.4230/LIPIcs.ICALP.2018.77}, annote = {Keywords: Sparse Linear Regression, Approximate Nearest Neighbor, Sparse Recovery, Nearest Induced Flat, Nearest Subspace Search} }
Koyo Hayashi. A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 78:1-78:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hayashi:LIPIcs.ICALP.2018.78, author = {Hayashi, Koyo}, title = {{A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.78}, URN = {urn:nbn:de:0030-drops-90822}, doi = {10.4230/LIPIcs.ICALP.2018.78}, annote = {Keywords: Geodesic, CAT(0) Space, Cubical Complex} }
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 79:1-79:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{huang_et_al:LIPIcs.ICALP.2018.79, author = {Huang, Zhiyi and Tang, Zhihao Gavin and Wu, Xiaowei and Zhang, Yuhao}, title = {{Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {79:1--79:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.79}, URN = {urn:nbn:de:0030-drops-90830}, doi = {10.4230/LIPIcs.ICALP.2018.79}, annote = {Keywords: Vertex Weighted, Online Bipartite Matching, Randomized Primal-Dual} }
Jisu Jeong, Eun Jung Kim, and Sang-il Oum. Finding Branch-Decompositions of Matroids, Hypergraphs, and More. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 80:1-80:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{jeong_et_al:LIPIcs.ICALP.2018.80, author = {Jeong, Jisu and Kim, Eun Jung and Oum, Sang-il}, title = {{Finding Branch-Decompositions of Matroids, Hypergraphs, and More}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.80}, URN = {urn:nbn:de:0030-drops-90849}, doi = {10.4230/LIPIcs.ICALP.2018.80}, annote = {Keywords: branch-width, rank-width, carving-width, fixed-parameter tractability} }
Juan Jose Besa, William E. Devanny, David Eppstein, Michael T. Goodrich, and Timothy Johnson. Optimally Sorting Evolving Data. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 81:1-81:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{besa_et_al:LIPIcs.ICALP.2018.81, author = {Besa, Juan Jose and Devanny, William E. and Eppstein, David and Goodrich, Michael T. and Johnson, Timothy}, title = {{Optimally Sorting Evolving Data}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {81:1--81:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.81}, URN = {urn:nbn:de:0030-drops-90858}, doi = {10.4230/LIPIcs.ICALP.2018.81}, annote = {Keywords: Sorting, Evolving data, Insertion sort} }
Daniel M. Kane, Shachar Lovett, and Shay Moran. Generalized Comparison Trees for Point-Location Problems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 82:1-82:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kane_et_al:LIPIcs.ICALP.2018.82, author = {Kane, Daniel M. and Lovett, Shachar and Moran, Shay}, title = {{Generalized Comparison Trees for Point-Location Problems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {82:1--82:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.82}, URN = {urn:nbn:de:0030-drops-90862}, doi = {10.4230/LIPIcs.ICALP.2018.82}, annote = {Keywords: linear decision trees, comparison queries, point location problems} }
Zhuan Khye Koh and Laura Sanità. Stabilizing Weighted Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 83:1-83:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{koh_et_al:LIPIcs.ICALP.2018.83, author = {Koh, Zhuan Khye and Sanit\`{a}, Laura}, title = {{Stabilizing Weighted Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.83}, URN = {urn:nbn:de:0030-drops-90877}, doi = {10.4230/LIPIcs.ICALP.2018.83}, annote = {Keywords: combinatorial optimization, network bargaining, cooperative game} }
Alexandra Kolla, Ioannis Koutis, Vivek Madan, and Ali Kemal Sinop. Spectrally Robust Graph Isomorphism. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 84:1-84:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kolla_et_al:LIPIcs.ICALP.2018.84, author = {Kolla, Alexandra and Koutis, Ioannis and Madan, Vivek and Sinop, Ali Kemal}, title = {{Spectrally Robust Graph Isomorphism}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {84:1--84:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.84}, URN = {urn:nbn:de:0030-drops-90887}, doi = {10.4230/LIPIcs.ICALP.2018.84}, annote = {Keywords: Network Alignment, Graph Isomorphism, Graph Similarity} }
Martin Koutecký, Asaf Levin, and Shmuel Onn. A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 85:1-85:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{koutecky_et_al:LIPIcs.ICALP.2018.85, author = {Kouteck\'{y}, Martin and Levin, Asaf and Onn, Shmuel}, title = {{A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {85:1--85:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.85}, URN = {urn:nbn:de:0030-drops-90898}, doi = {10.4230/LIPIcs.ICALP.2018.85}, annote = {Keywords: integer programming, parameterized complexity, Graver basis, n-fold integer programming} }
Michael Lampis. Finer Tight Bounds for Coloring on Clique-Width. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 86:1-86:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{lampis:LIPIcs.ICALP.2018.86, author = {Lampis, Michael}, title = {{Finer Tight Bounds for Coloring on Clique-Width}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {86:1--86:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.86}, URN = {urn:nbn:de:0030-drops-90903}, doi = {10.4230/LIPIcs.ICALP.2018.86}, annote = {Keywords: Clique-width, SETH, Coloring} }
Christoph Lenzen and Reut Levi. A Centralized Local Algorithm for the Sparse Spanning Graph Problem. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 87:1-87:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{lenzen_et_al:LIPIcs.ICALP.2018.87, author = {Lenzen, Christoph and Levi, Reut}, title = {{A Centralized Local Algorithm for the Sparse Spanning Graph Problem}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {87:1--87:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.87}, URN = {urn:nbn:de:0030-drops-90919}, doi = {10.4230/LIPIcs.ICALP.2018.87}, annote = {Keywords: local, spanning graph, sparse} }
Sixue Liu. Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 88:1-88:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{liu:LIPIcs.ICALP.2018.88, author = {Liu, Sixue}, title = {{Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {88:1--88:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.88}, URN = {urn:nbn:de:0030-drops-90925}, doi = {10.4230/LIPIcs.ICALP.2018.88}, annote = {Keywords: Satisfiability, derandomization, local search} }
Gill Barequet, David Eppstein, Michael T. Goodrich, and Nil Mamano. Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 89:1-89:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{barequet_et_al:LIPIcs.ICALP.2018.89, author = {Barequet, Gill and Eppstein, David and Goodrich, Michael T. and Mamano, Nil}, title = {{Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {89:1--89:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.89}, URN = {urn:nbn:de:0030-drops-90937}, doi = {10.4230/LIPIcs.ICALP.2018.89}, annote = {Keywords: Voronoi diagram, stable matching, combinatorial complexity, lower bounds} }
Vasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang. Improved Algorithms for Adaptive Compressed Sensing. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 90:1-90:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{nakos_et_al:LIPIcs.ICALP.2018.90, author = {Nakos, Vasileios and Shi, Xiaofei and Woodruff, David P. and Zhang, Hongyang}, title = {{Improved Algorithms for Adaptive Compressed Sensing}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {90:1--90:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.90}, URN = {urn:nbn:de:0030-drops-90945}, doi = {10.4230/LIPIcs.ICALP.2018.90}, annote = {Keywords: Compressed Sensing, Adaptivity, High-Dimensional Vectors} }
Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen. Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 91:1-91:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{nirkhe_et_al:LIPIcs.ICALP.2018.91, author = {Nirkhe, Chinmay and Vazirani, Umesh and Yuen, Henry}, title = {{Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {91:1--91:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.91}, URN = {urn:nbn:de:0030-drops-90950}, doi = {10.4230/LIPIcs.ICALP.2018.91}, annote = {Keywords: quantum pcps, local hamiltonians, error-correcting codes} }
Krzysztof Onak, Baruch Schieber, Shay Solomon, and Nicole Wein. Fully Dynamic MIS in Uniformly Sparse Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 92:1-92:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{onak_et_al:LIPIcs.ICALP.2018.92, author = {Onak, Krzysztof and Schieber, Baruch and Solomon, Shay and Wein, Nicole}, title = {{Fully Dynamic MIS in Uniformly Sparse Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {92:1--92:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.92}, URN = {urn:nbn:de:0030-drops-90968}, doi = {10.4230/LIPIcs.ICALP.2018.92}, annote = {Keywords: dynamic graph algorithms, independent set, sparse graphs, graph arboricity} }
Rafail Ostrovsky, Yuval Rabani, and Arman Yousefi. Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 93:1-93:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ostrovsky_et_al:LIPIcs.ICALP.2018.93, author = {Ostrovsky, Rafail and Rabani, Yuval and Yousefi, Arman}, title = {{Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {93:1--93:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.93}, URN = {urn:nbn:de:0030-drops-90976}, doi = {10.4230/LIPIcs.ICALP.2018.93}, annote = {Keywords: Numerical Linear Algebra, Optimization} }
Felix Reidl and Magnus Wahlström. Parameterized Algorithms for Zero Extension and Metric Labelling Problems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 94:1-94:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{reidl_et_al:LIPIcs.ICALP.2018.94, author = {Reidl, Felix and Wahlstr\"{o}m, Magnus}, title = {{Parameterized Algorithms for Zero Extension and Metric Labelling Problems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {94:1--94:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.94}, URN = {urn:nbn:de:0030-drops-90989}, doi = {10.4230/LIPIcs.ICALP.2018.94}, annote = {Keywords: FPT, VCSP, cut problem, gap parameter} }
Andrei Romashchenko and Marius Zimand. An Operational Characterization of Mutual Information in Algorithmic Information Theory. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 95:1-95:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{romashchenko_et_al:LIPIcs.ICALP.2018.95, author = {Romashchenko, Andrei and Zimand, Marius}, title = {{An Operational Characterization of Mutual Information in Algorithmic Information Theory}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {95:1--95:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.95}, URN = {urn:nbn:de:0030-drops-90998}, doi = {10.4230/LIPIcs.ICALP.2018.95}, annote = {Keywords: Kolmogorov complexity, mutual information, communication complexity, secret key agreement} }
Clemens Rösner and Melanie Schmidt. Privacy Preserving Clustering with Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 96:1-96:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{rosner_et_al:LIPIcs.ICALP.2018.96, author = {R\"{o}sner, Clemens and Schmidt, Melanie}, title = {{Privacy Preserving Clustering with Constraints}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {96:1--96:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.96}, URN = {urn:nbn:de:0030-drops-91008}, doi = {10.4230/LIPIcs.ICALP.2018.96}, annote = {Keywords: Clustering, k-center, Constraints, Privacy, Lower Bounds, Fairness} }
Piotr Sankowski. NC Algorithms for Weighted Planar Perfect Matching and Related Problems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 97:1-97:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{sankowski:LIPIcs.ICALP.2018.97, author = {Sankowski, Piotr}, title = {{NC Algorithms for Weighted Planar Perfect Matching and Related Problems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {97:1--97:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.97}, URN = {urn:nbn:de:0030-drops-91011}, doi = {10.4230/LIPIcs.ICALP.2018.97}, annote = {Keywords: planar graph, NC algorithms, maximum cardinality matching, maximum weight matching, min-cost flow, maximum multiple-source multiple-sink flow, f-factors} }
Andreas Schmid and Jens M. Schmidt. Computing Tutte Paths. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 98:1-98:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{schmid_et_al:LIPIcs.ICALP.2018.98, author = {Schmid, Andreas and Schmidt, Jens M.}, title = {{Computing Tutte Paths}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {98:1--98:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.98}, URN = {urn:nbn:de:0030-drops-91029}, doi = {10.4230/LIPIcs.ICALP.2018.98}, annote = {Keywords: Tutte Path, Tutte Cycle, 2-Connected Planar Graph, Hamiltonian Cycle} }
Tasuku Soma and Yuichi Yoshida. A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 99:1-99:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{soma_et_al:LIPIcs.ICALP.2018.99, author = {Soma, Tasuku and Yoshida, Yuichi}, title = {{A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {99:1--99:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.99}, URN = {urn:nbn:de:0030-drops-91033}, doi = {10.4230/LIPIcs.ICALP.2018.99}, annote = {Keywords: Submodular Function, Approximation Algorithm, Discrete Convex Analysis} }
Daniele Miccianco and Jessica Sorrell. Ring Packing and Amortized FHEW Bootstrapping. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 100:1-100:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{miccianco_et_al:LIPIcs.ICALP.2018.100, author = {Miccianco, Daniele and Sorrell, Jessica}, title = {{Ring Packing and Amortized FHEW Bootstrapping}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {100:1--100:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.100}, URN = {urn:nbn:de:0030-drops-91047}, doi = {10.4230/LIPIcs.ICALP.2018.100}, annote = {Keywords: homomorphic encryption, bootstrapping, lattice-based cryptography} }
Anand Louis and Rakesh Venkat. Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 101:1-101:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{louis_et_al:LIPIcs.ICALP.2018.101, author = {Louis, Anand and Venkat, Rakesh}, title = {{Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {101:1--101:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.101}, URN = {urn:nbn:de:0030-drops-91057}, doi = {10.4230/LIPIcs.ICALP.2018.101}, annote = {Keywords: Semi-Random models, Vertex Expansion, Approximation Algorithms, Beyond Worst Case Analysis} }
Stefan Walzer. Load Thresholds for Cuckoo Hashing with Overlapping Blocks. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 102:1-102:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{walzer:LIPIcs.ICALP.2018.102, author = {Walzer, Stefan}, title = {{Load Thresholds for Cuckoo Hashing with Overlapping Blocks}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {102:1--102:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.102}, URN = {urn:nbn:de:0030-drops-91068}, doi = {10.4230/LIPIcs.ICALP.2018.102}, annote = {Keywords: Cuckoo Hashing, Unaligned Blocks, Hypergraph Orientability, Load Thresholds, Randomised Algorithms} }
Navneet Agarwal, Sanat Anand, and Manoj Prabhakaran. Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 103:1-103:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.ICALP.2018.103, author = {Agarwal, Navneet and Anand, Sanat and Prabhakaran, Manoj}, title = {{Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {103:1--103:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.103}, URN = {urn:nbn:de:0030-drops-91079}, doi = {10.4230/LIPIcs.ICALP.2018.103}, annote = {Keywords: Secure Multi-Party Computation, Combinatorial Characterization, Latin Hypercube, Permutation Hypercube Complex} }
Amy Babay, Michael Dinitz, and Zeyu Zhang. Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 104:1-104:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{babay_et_al:LIPIcs.ICALP.2018.104, author = {Babay, Amy and Dinitz, Michael and Zhang, Zeyu}, title = {{Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {104:1--104:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.104}, URN = {urn:nbn:de:0030-drops-91083}, doi = {10.4230/LIPIcs.ICALP.2018.104}, annote = {Keywords: Shallow-Light, Steiner Network, Fixed-Parameter Tractability} }
Ben Berger and Zvika Brakerski. Brief Announcement: Zero-Knowledge Protocols for Search Problems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 105:1-105:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{berger_et_al:LIPIcs.ICALP.2018.105, author = {Berger, Ben and Brakerski, Zvika}, title = {{Brief Announcement: Zero-Knowledge Protocols for Search Problems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {105:1--105:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.105}, URN = {urn:nbn:de:0030-drops-91099}, doi = {10.4230/LIPIcs.ICALP.2018.105}, annote = {Keywords: Zero-Knowledge, Search Problems, Interactive Proofs} }
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, and Samson Zhou. Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 106:1-106:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{blocki_et_al:LIPIcs.ICALP.2018.106, author = {Blocki, Jeremiah and Gandikota, Venkata and Grigorescu, Elena and Zhou, Samson}, title = {{Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {106:1--106:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.106}, URN = {urn:nbn:de:0030-drops-91102}, doi = {10.4230/LIPIcs.ICALP.2018.106}, annote = {Keywords: Relaxed locally correctable codes, computationally bounded channels, local expanders} }
Steven Chaplick, Minati De, Alexander Ravsky, and Joachim Spoerhase. Brief Announcement: Approximation Schemes for Geometric Coverage Problems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 107:1-107:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chaplick_et_al:LIPIcs.ICALP.2018.107, author = {Chaplick, Steven and De, Minati and Ravsky, Alexander and Spoerhase, Joachim}, title = {{Brief Announcement: Approximation Schemes for Geometric Coverage Problems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {107:1--107:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.107}, URN = {urn:nbn:de:0030-drops-91113}, doi = {10.4230/LIPIcs.ICALP.2018.107}, annote = {Keywords: balanced separators, maximum coverage, local search, approximation scheme, geometric approximation algorithms} }
Jing Chen, Bo Li, Yingkai Li, and Pinyan Lu. Brief Announcement: Bayesian Auctions with Efficient Queries. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 108:1-108:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ICALP.2018.108, author = {Chen, Jing and Li, Bo and Li, Yingkai and Lu, Pinyan}, title = {{Brief Announcement: Bayesian Auctions with Efficient Queries}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {108:1--108:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.108}, URN = {urn:nbn:de:0030-drops-91124}, doi = {10.4230/LIPIcs.ICALP.2018.108}, annote = {Keywords: The complexity of Bayesian mechanisms, quantile queries, value queries} }
Daniel Graf, Karim Labib, and Przemyslaw Uznanski. Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 109:1-109:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{graf_et_al:LIPIcs.ICALP.2018.109, author = {Graf, Daniel and Labib, Karim and Uznanski, Przemyslaw}, title = {{Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {109:1--109:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.109}, URN = {urn:nbn:de:0030-drops-91134}, doi = {10.4230/LIPIcs.ICALP.2018.109}, annote = {Keywords: fine-grained complexity, matrix multiplication, high dimensional geometry, pattern matching} }
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, and Meirav Zehavi. Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 110:1-110:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2018.110, author = {Lokshtanov, Daniel and Ramanujan, M. S. and Saurabh, Saket and Sharma, Roohani and Zehavi, Meirav}, title = {{Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {110:1--110:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.110}, URN = {urn:nbn:de:0030-drops-91146}, doi = {10.4230/LIPIcs.ICALP.2018.110}, annote = {Keywords: Polynomial Kernel, Directed Feedback Vertex Set, Treewidth Modulator} }
Sofya Raskhodnikova and Nithin Varma. Brief Announcement: Erasure-Resilience Versus Tolerance to Errors. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 111:1-111:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{raskhodnikova_et_al:LIPIcs.ICALP.2018.111, author = {Raskhodnikova, Sofya and Varma, Nithin}, title = {{Brief Announcement: Erasure-Resilience Versus Tolerance to Errors}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {111:1--111:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.111}, URN = {urn:nbn:de:0030-drops-91154}, doi = {10.4230/LIPIcs.ICALP.2018.111}, annote = {Keywords: Property testing, erasures, tolerance to errors, model separation} }
Mingyu Xiao and Hiroshi Nagamochi. Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 112:1-112:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{xiao_et_al:LIPIcs.ICALP.2018.112, author = {Xiao, Mingyu and Nagamochi, Hiroshi}, title = {{Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {112:1--112:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.112}, URN = {urn:nbn:de:0030-drops-91164}, doi = {10.4230/LIPIcs.ICALP.2018.112}, annote = {Keywords: FPT, Important Cuts, Graph Cuts, Graph Algorithms} }
Alejandro Aguirre, Gilles Barthe, Justin Hsu, and Alexandra Silva. Almost Sure Productivity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 113:1-113:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aguirre_et_al:LIPIcs.ICALP.2018.113, author = {Aguirre, Alejandro and Barthe, Gilles and Hsu, Justin and Silva, Alexandra}, title = {{Almost Sure Productivity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {113:1--113:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.113}, URN = {urn:nbn:de:0030-drops-91174}, doi = {10.4230/LIPIcs.ICALP.2018.113}, annote = {Keywords: Coinduction, Probabilistic Programming, Productivity} }
Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, and James Worrell. O-Minimal Invariants for Linear Loops. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 114:1-114:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{almagor_et_al:LIPIcs.ICALP.2018.114, author = {Almagor, Shaull and Chistikov, Dmitry and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{O-Minimal Invariants for Linear Loops}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {114:1--114:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.114}, URN = {urn:nbn:de:0030-drops-91188}, doi = {10.4230/LIPIcs.ICALP.2018.114}, annote = {Keywords: Invariants, linear loops, linear dynamical systems, non-termination, o-minimality} }
Antoine Amarilli and Charles Paperman. Topological Sorting with Regular Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 115:1-115:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{amarilli_et_al:LIPIcs.ICALP.2018.115, author = {Amarilli, Antoine and Paperman, Charles}, title = {{Topological Sorting with Regular Constraints}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {115:1--115:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.115}, URN = {urn:nbn:de:0030-drops-91193}, doi = {10.4230/LIPIcs.ICALP.2018.115}, annote = {Keywords: Topological sorting, shuffle problem, regular language} }
Albert Atserias, Stephan Kreutzer, and Marc Noy. On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 116:1-116:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{atserias_et_al:LIPIcs.ICALP.2018.116, author = {Atserias, Albert and Kreutzer, Stephan and Noy, Marc}, title = {{On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {116:1--116:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.116}, URN = {urn:nbn:de:0030-drops-91206}, doi = {10.4230/LIPIcs.ICALP.2018.116}, annote = {Keywords: topological graph theory, monadic second-order logic, random graphs, zero-one law, convergence law} }
Achim Blumensath and Felix Wolf. Bisimulation Invariant Monadic-Second Order Logic in the Finite. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 117:1-117:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{blumensath_et_al:LIPIcs.ICALP.2018.117, author = {Blumensath, Achim and Wolf, Felix}, title = {{Bisimulation Invariant Monadic-Second Order Logic in the Finite}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {117:1--117:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.117}, URN = {urn:nbn:de:0030-drops-91215}, doi = {10.4230/LIPIcs.ICALP.2018.117}, annote = {Keywords: bisimulation, monadic second-order logic, composition method} }
Lorenzo Clemente and Slawomir Lasota. Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 118:1-118:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{clemente_et_al:LIPIcs.ICALP.2018.118, author = {Clemente, Lorenzo and Lasota, Slawomir}, title = {{Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {118:1--118:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.118}, URN = {urn:nbn:de:0030-drops-91228}, doi = {10.4230/LIPIcs.ICALP.2018.118}, annote = {Keywords: timed automata, reachability relation, timed pushdown automata, linear arithmetic} }
Wojciech Czerwinski, Piotr Hofman, and Georg Zetzsche. Unboundedness Problems for Languages of Vector Addition Systems. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 119:1-119:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{czerwinski_et_al:LIPIcs.ICALP.2018.119, author = {Czerwinski, Wojciech and Hofman, Piotr and Zetzsche, Georg}, title = {{Unboundedness Problems for Languages of Vector Addition Systems}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {119:1--119:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.119}, URN = {urn:nbn:de:0030-drops-91235}, doi = {10.4230/LIPIcs.ICALP.2018.119}, annote = {Keywords: vector addition systems, decision problems, unboundedness, separability} }
Samir Datta, Anish Mukherjee, Nils Vortmeier, and Thomas Zeume. Reachability and Distances under Multiple Changes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 120:1-120:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{datta_et_al:LIPIcs.ICALP.2018.120, author = {Datta, Samir and Mukherjee, Anish and Vortmeier, Nils and Zeume, Thomas}, title = {{Reachability and Distances under Multiple Changes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {120:1--120:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.120}, URN = {urn:nbn:de:0030-drops-91245}, doi = {10.4230/LIPIcs.ICALP.2018.120}, annote = {Keywords: dynamic complexity, reachability, distances, complex changes} }
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, and James Worrell. When is Containment Decidable for Probabilistic Automata?. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 121:1-121:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{daviaud_et_al:LIPIcs.ICALP.2018.121, author = {Daviaud, Laure and Jurdzinski, Marcin and Lazic, Ranko and Mazowiecki, Filip and P\'{e}rez, Guillermo A. and Worrell, James}, title = {{When is Containment Decidable for Probabilistic Automata?}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {121:1--121:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.121}, URN = {urn:nbn:de:0030-drops-91251}, doi = {10.4230/LIPIcs.ICALP.2018.121}, annote = {Keywords: Probabilistic automata, Containment, Emptiness, Ambiguity} }
Gaëtan Douéneau-Tabot. On the Complexity of Infinite Advice Strings. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 122:1-122:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{doueneautabot:LIPIcs.ICALP.2018.122, author = {Dou\'{e}neau-Tabot, Ga\"{e}tan}, title = {{On the Complexity of Infinite Advice Strings}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {122:1--122:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.122}, URN = {urn:nbn:de:0030-drops-91260}, doi = {10.4230/LIPIcs.ICALP.2018.122}, annote = {Keywords: infinite words, advice automata, automatic structures, transducers} }
María Emilia Descotte, Diego Figueira, and Gabriele Puppis. Resynchronizing Classes of Word Relations. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 123:1-123:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{descotte_et_al:LIPIcs.ICALP.2018.123, author = {Descotte, Mar{\'\i}a Emilia and Figueira, Diego and Puppis, Gabriele}, title = {{Resynchronizing Classes of Word Relations}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {123:1--123:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.123}, URN = {urn:nbn:de:0030-drops-91270}, doi = {10.4230/LIPIcs.ICALP.2018.123}, annote = {Keywords: synchronized word relations, containment, resynchronization} }
John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani. Reachability Switching Games. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 124:1-124:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fearnley_et_al:LIPIcs.ICALP.2018.124, author = {Fearnley, John and Gairing, Martin and Mnich, Matthias and Savani, Rahul}, title = {{Reachability Switching Games}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {124:1--124:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.124}, URN = {urn:nbn:de:0030-drops-91282}, doi = {10.4230/LIPIcs.ICALP.2018.124}, annote = {Keywords: Deterministic Random Walks, Model Checking, Reachability, Simple Stochastic Game, Switching Systems} }
Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, and James Worrell. Costs and Rewards in Priced Timed Automata. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 125:1-125:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{franzle_et_al:LIPIcs.ICALP.2018.125, author = {Fr\"{a}nzle, Martin and Shirmohammadi, Mahsa and Swaminathan, Mani and Worrell, James}, title = {{Costs and Rewards in Priced Timed Automata}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {125:1--125:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.125}, URN = {urn:nbn:de:0030-drops-91297}, doi = {10.4230/LIPIcs.ICALP.2018.125}, annote = {Keywords: Priced Timed Automata, Pareto Domination, Diophantine Equations} }
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, and Szymon Torunczyk. First-Order Interpretations of Bounded Expansion Classes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 126:1-126:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gajarsky_et_al:LIPIcs.ICALP.2018.126, author = {Gajarsk\'{y}, Jakub and Kreutzer, Stephan and Nesetril, Jaroslav and Ossona de Mendez, Patrice and Pilipczuk, Michal and Siebertz, Sebastian and Torunczyk, Szymon}, title = {{First-Order Interpretations of Bounded Expansion Classes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {126:1--126:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.126}, URN = {urn:nbn:de:0030-drops-91300}, doi = {10.4230/LIPIcs.ICALP.2018.126}, annote = {Keywords: Logical interpretations/transductions, structurally sparse graphs, bounded expansion} }
Moses Ganardi, Danny Hucke, and Markus Lohrey. Randomized Sliding Window Algorithms for Regular Languages. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 127:1-127:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ganardi_et_al:LIPIcs.ICALP.2018.127, author = {Ganardi, Moses and Hucke, Danny and Lohrey, Markus}, title = {{Randomized Sliding Window Algorithms for Regular Languages}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {127:1--127:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.127}, URN = {urn:nbn:de:0030-drops-91317}, doi = {10.4230/LIPIcs.ICALP.2018.127}, annote = {Keywords: sliding windows, regular languages, randomized complexity} }
Anael Grandjean, Benjamin Hellouin de Menibus, and Pascal Vanier. Aperiodic Points in Z²-subshifts. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 128:1-128:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{grandjean_et_al:LIPIcs.ICALP.2018.128, author = {Grandjean, Anael and Hellouin de Menibus, Benjamin and Vanier, Pascal}, title = {{Aperiodic Points in Z²-subshifts}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {128:1--128:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.128}, URN = {urn:nbn:de:0030-drops-91323}, doi = {10.4230/LIPIcs.ICALP.2018.128}, annote = {Keywords: Subshifts of finite type, Wang tiles, periodicity, aperiodicity, computability, tilings} }
Mathieu Hoyrup, Diego Nava Saucedo, and Don M. Stull. Semicomputable Geometry. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 129:1-129:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hoyrup_et_al:LIPIcs.ICALP.2018.129, author = {Hoyrup, Mathieu and Nava Saucedo, Diego and Stull, Don M.}, title = {{Semicomputable Geometry}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {129:1--129:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.129}, URN = {urn:nbn:de:0030-drops-91336}, doi = {10.4230/LIPIcs.ICALP.2018.129}, annote = {Keywords: Computable set, Semicomputable set, Solovay reducibility, Left-ce real, Genericity} }
Stefan Kiefer. On Computing the Total Variation Distance of Hidden Markov Models. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 130:1-130:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kiefer:LIPIcs.ICALP.2018.130, author = {Kiefer, Stefan}, title = {{On Computing the Total Variation Distance of Hidden Markov Models}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {130:1--130:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.130}, URN = {urn:nbn:de:0030-drops-91344}, doi = {10.4230/LIPIcs.ICALP.2018.130}, annote = {Keywords: Labelled Markov Chains, Hidden Markov Models, Distance, Decidability, Complexity} }
Ines Klimann. To Infinity and Beyond. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 131:1-131:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{klimann:LIPIcs.ICALP.2018.131, author = {Klimann, Ines}, title = {{To Infinity and Beyond}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {131:1--131:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.131}, URN = {urn:nbn:de:0030-drops-91359}, doi = {10.4230/LIPIcs.ICALP.2018.131}, annote = {Keywords: automaton groups, growth of a group, exponential growth} }
Sang-Ki Ko, Reino Niskanen, and Igor Potapov. On the Identity Problem for the Special Linear Group and the Heisenberg Group. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 132:1-132:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ko_et_al:LIPIcs.ICALP.2018.132, author = {Ko, Sang-Ki and Niskanen, Reino and Potapov, Igor}, title = {{On the Identity Problem for the Special Linear Group and the Heisenberg Group}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {132:1--132:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.132}, URN = {urn:nbn:de:0030-drops-91367}, doi = {10.4230/LIPIcs.ICALP.2018.132}, annote = {Keywords: matrix semigroup, identity problem, special linear group, Heisenberg group, decidability} }
Dietrich Kuske and Nicole Schweikardt. Gaifman Normal Forms for Counting Extensions of First-Order Logic. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 133:1-133:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kuske_et_al:LIPIcs.ICALP.2018.133, author = {Kuske, Dietrich and Schweikardt, Nicole}, title = {{Gaifman Normal Forms for Counting Extensions of First-Order Logic}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {133:1--133:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.133}, URN = {urn:nbn:de:0030-drops-91375}, doi = {10.4230/LIPIcs.ICALP.2018.133}, annote = {Keywords: Finite model theory, Gaifman locality, modulo-counting quantifiers, fixed parameter tractable model-checking} }