@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@InProceedings{leroux:LIPIcs.ICALP.2018.134,
author = {Leroux, J\'{e}r\^{o}me},
title = {{Polynomial Vector Addition Systems With States}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {134:1--134: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.134},
URN = {urn:nbn:de:0030-drops-91387},
doi = {10.4230/LIPIcs.ICALP.2018.134},
annote = {Keywords: Vector additions system with states, Reachability problem, Formal verification, Infinite state system, Linear algebra, Kosaraju-Sullivan algorithm}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2018.135,
author = {Lokshtanov, Daniel and Ramanujan, M. S. and Saurabh, Saket and Zehavi, Meirav},
title = {{Reducing CMSO Model Checking to Highly Connected Graphs}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {135:1--135: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.135},
URN = {urn:nbn:de:0030-drops-91391},
doi = {10.4230/LIPIcs.ICALP.2018.135},
annote = {Keywords: Fixed Parameter Tractability Model Checking Recursive Understanding}
}
@InProceedings{nowotka_et_al:LIPIcs.ICALP.2018.136,
author = {Nowotka, Dirk and Saarela, Aleksi},
title = {{An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {136:1--136: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.136},
URN = {urn:nbn:de:0030-drops-91404},
doi = {10.4230/LIPIcs.ICALP.2018.136},
annote = {Keywords: combinatorics on words, word equations, systems of equations}
}
@InProceedings{place_et_al:LIPIcs.ICALP.2018.137,
author = {Place, Thomas and Zeitoun, Marc},
title = {{Separating Without Any Ambiguity}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {137:1--137: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.137},
URN = {urn:nbn:de:0030-drops-91419},
doi = {10.4230/LIPIcs.ICALP.2018.137},
annote = {Keywords: Regular languages, separation problem, decidable characterizations}
}
@InProceedings{raskin:LIPIcs.ICALP.2018.138,
author = {Raskin, Mikhail},
title = {{A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {138:1--138: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.138},
URN = {urn:nbn:de:0030-drops-91428},
doi = {10.4230/LIPIcs.ICALP.2018.138},
annote = {Keywords: unambiguous automata, language complement, lower bound}
}
@InProceedings{senizergues_et_al:LIPIcs.ICALP.2018.139,
author = {S\'{e}nizergues, G\'{e}raud and Wei{\ss}, Armin},
title = {{The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {139:1--139: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.139},
URN = {urn:nbn:de:0030-drops-91437},
doi = {10.4230/LIPIcs.ICALP.2018.139},
annote = {Keywords: virtually free groups, context-free groups, isomorphism problem, structure tree, graph of groups}
}
@InProceedings{skrzypczak:LIPIcs.ICALP.2018.140,
author = {Skrzypczak, Michal},
title = {{Unambiguous Languages Exhaust the Index Hierarchy}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {140:1--140: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.140},
URN = {urn:nbn:de:0030-drops-91442},
doi = {10.4230/LIPIcs.ICALP.2018.140},
annote = {Keywords: unambiguous automata, parity games, infinite trees, index hierarchy}
}
@InProceedings{staton_et_al:LIPIcs.ICALP.2018.141,
author = {Staton, Sam and Stein, Dario and Yang, Hongseok and Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M.},
title = {{The Beta-Bernoulli process and algebraic effects}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {141:1--141: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.141},
URN = {urn:nbn:de:0030-drops-91456},
doi = {10.4230/LIPIcs.ICALP.2018.141},
annote = {Keywords: Beta-Bernoulli process, Algebraic effects, Probabilistic programming, Exchangeability}
}
@InProceedings{winter:LIPIcs.ICALP.2018.142,
author = {Winter, Sarah},
title = {{Uniformization Problems for Synchronizations of Automatic Relations on Words}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {142:1--142: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.142},
URN = {urn:nbn:de:0030-drops-91463},
doi = {10.4230/LIPIcs.ICALP.2018.142},
annote = {Keywords: automatic relation, uniformization, synchronization, transducer}
}
@InProceedings{akhoondianamiri_et_al:LIPIcs.ICALP.2018.143,
author = {Akhoondian Amiri, Saeed and Dudycz, Szymon and Schmid, Stefan and Wiederrecht, Sebastian},
title = {{Congestion-Free Rerouting of Flows on DAGs}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {143:1--143: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.143},
URN = {urn:nbn:de:0030-drops-91471},
doi = {10.4230/LIPIcs.ICALP.2018.143},
annote = {Keywords: Unsplittable Flows, Reconfiguration, DAGs, FPT, NP-Hardness}
}
@InProceedings{ando_et_al:LIPIcs.ICALP.2018.144,
author = {Ando, Megumi and Lysyanskaya, Anna and Upfal, Eli},
title = {{Practical and Provably Secure Onion Routing}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {144:1--144: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.144},
URN = {urn:nbn:de:0030-drops-91482},
doi = {10.4230/LIPIcs.ICALP.2018.144},
annote = {Keywords: Anonymity, traffic analysis, statistical privacy, differential privacy}
}
@InProceedings{aronov_et_al:LIPIcs.ICALP.2018.145,
author = {Aronov, Boris and Bar-On, Gali and Katz, Matthew J.},
title = {{Resolving SINR Queries in a Dynamic Setting}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {145:1--145: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.145},
URN = {urn:nbn:de:0030-drops-91495},
doi = {10.4230/LIPIcs.ICALP.2018.145},
annote = {Keywords: Wireless networks, SINR, dynamic insertion and deletion, interference cancellation, range searching}
}
@InProceedings{bilo_et_al:LIPIcs.ICALP.2018.146,
author = {Bil\`{o}, Vittorio and Moscardelli, Luca and Vinci, Cosimo},
title = {{Uniform Mixed Equilibria in Network Congestion Games with Link Failures}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {146:1--146: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.146},
URN = {urn:nbn:de:0030-drops-91508},
doi = {10.4230/LIPIcs.ICALP.2018.146},
annote = {Keywords: Network Congestion Games, Fault-Tolerant Routing, Nash Equilibria, Price of Anarchy, Price of Stability}
}
@InProceedings{bouchard_et_al:LIPIcs.ICALP.2018.147,
author = {Bouchard, S\'{e}bastien and Dieudonn\'{e}, Yoann and Lamani, Anissa},
title = {{Byzantine Gathering in Polynomial Time}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {147:1--147: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.147},
URN = {urn:nbn:de:0030-drops-91511},
doi = {10.4230/LIPIcs.ICALP.2018.147},
annote = {Keywords: gathering, deterministic algorithm, mobile agent, Byzantine fault, polynomial time}
}
@InProceedings{akrida_et_al:LIPIcs.ICALP.2018.148,
author = {Akrida, Eleni C. and Mertzios, George B. and Spirakis, Paul G. and Zamaraev, Viktor},
title = {{Temporal Vertex Cover with a Sliding Time Window}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {148:1--148: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.148},
URN = {urn:nbn:de:0030-drops-91522},
doi = {10.4230/LIPIcs.ICALP.2018.148},
annote = {Keywords: Temporal networks, temporal vertex cover, APX-hard, approximation algorithm, Exponential Time Hypothesis}
}
@InProceedings{chierichetti_et_al:LIPIcs.ICALP.2018.149,
author = {Chierichetti, Flavio and Haddadan, Shahrzad},
title = {{On the Complexity of Sampling Vertices Uniformly from a Graph}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {149:1--149: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.149},
URN = {urn:nbn:de:0030-drops-91538},
doi = {10.4230/LIPIcs.ICALP.2018.149},
annote = {Keywords: Social Networks, Sampling, Graph Exploration, Lower Bounds}
}
@InProceedings{christodoulou_et_al:LIPIcs.ICALP.2018.150,
author = {Christodoulou, George and Gairing, Martin and Giannakopoulos, Yiannis and Spirakis, Paul G.},
title = {{The Price of Stability of Weighted Congestion Games}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {150:1--150: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.150},
URN = {urn:nbn:de:0030-drops-91541},
doi = {10.4230/LIPIcs.ICALP.2018.150},
annote = {Keywords: Congestion games, price of stability, Nash equilibrium, approximate equilibrium, potential games}
}
@InProceedings{colinibaldeschi_et_al:LIPIcs.ICALP.2018.151,
author = {Colini-Baldeschi, Riccardo and Klimm, Max and Scarsini, Marco},
title = {{Demand-Independent Optimal Tolls}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {151:1--151: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.151},
URN = {urn:nbn:de:0030-drops-91553},
doi = {10.4230/LIPIcs.ICALP.2018.151},
annote = {Keywords: nonatomic congestion games, efficiency of equlibria, tolls}
}
@InProceedings{dehghani_et_al:LIPIcs.ICALP.2018.152,
author = {Dehghani, Sina and Ehsani, Soheil and Hajiaghayi, MohammadTaghi and Liaghat, Vahid and Seddighin, Saeed},
title = {{Greedy Algorithms for Online Survivable Network Design}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {152:1--152: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.152},
URN = {urn:nbn:de:0030-drops-91569},
doi = {10.4230/LIPIcs.ICALP.2018.152},
annote = {Keywords: survivable network design, online, greedy}
}
@InProceedings{grossman_et_al:LIPIcs.ICALP.2018.153,
author = {Grossman, Ofer and Haeupler, Bernhard and Mohanty, Sidhanth},
title = {{Algorithms for Noisy Broadcast with Erasures}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {153:1--153: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.153},
URN = {urn:nbn:de:0030-drops-91576},
doi = {10.4230/LIPIcs.ICALP.2018.153},
annote = {Keywords: noisy broadcast, error correction, erasures, distributed computing with noise}
}
@InProceedings{harks_et_al:LIPIcs.ICALP.2018.154,
author = {Harks, Tobias and Hoefer, Martin and Huber, Anja and Surek, Manuel},
title = {{Efficient Black-Box Reductions for Separable Cost Sharing}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {154:1--154: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.154},
URN = {urn:nbn:de:0030-drops-91587},
doi = {10.4230/LIPIcs.ICALP.2018.154},
annote = {Keywords: Cost Sharing, Price of Stability, Matroids, Connection Games}
}
@InProceedings{kesselheim_et_al:LIPIcs.ICALP.2018.155,
author = {Kesselheim, Thomas and Kodric, Bojana},
title = {{Price of Anarchy for Mechanisms with Risk-Averse Agents}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {155:1--155: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.155},
URN = {urn:nbn:de:0030-drops-91599},
doi = {10.4230/LIPIcs.ICALP.2018.155},
annote = {Keywords: Mechanism Design, Price of Anarchy, Risk Aversion, Smoothness}
}
@InProceedings{kowalski_et_al:LIPIcs.ICALP.2018.156,
author = {Kowalski, Dariusz R. and Mosteiro, Miguel A.},
title = {{Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {156:1--156: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.156},
URN = {urn:nbn:de:0030-drops-91602},
doi = {10.4230/LIPIcs.ICALP.2018.156},
annote = {Keywords: Anonymous Dynamic Networks, Counting, Boolean functions, distributed algorithms, deterministic algorithms}
}
@InProceedings{kupferman_et_al:LIPIcs.ICALP.2018.157,
author = {Kupferman, Orna and Vardi, Gal},
title = {{The Unfortunate-Flow Problem}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {157:1--157: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.157},
URN = {urn:nbn:de:0030-drops-91613},
doi = {10.4230/LIPIcs.ICALP.2018.157},
annote = {Keywords: Flow Network, Graph Algorithms, Games}
}
@InProceedings{halldorsson_et_al:LIPIcs.ICALP.2018.158,
author = {Halld\'{o}rsson, Magn\'{u}s M. and Kortsarz, Guy and Mitra, Pradipta and Tonoyan, Tigran},
title = {{Spanning Trees With Edge Conflicts and Wireless Connectivity}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {158:1--158: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.158},
URN = {urn:nbn:de:0030-drops-91627},
doi = {10.4230/LIPIcs.ICALP.2018.158},
annote = {Keywords: spanning trees, wireless capacity, aggregation, approximation algorithms}
}
@InProceedings{mallmanntrenn_et_al:LIPIcs.ICALP.2018.159,
author = {Mallmann-Trenn, Frederik and Musco, Cameron and Musco, Christopher},
title = {{Eigenvector Computation and Community Detection in Asynchronous Gossip Models}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {159:1--159: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.159},
URN = {urn:nbn:de:0030-drops-91639},
doi = {10.4230/LIPIcs.ICALP.2018.159},
annote = {Keywords: block model, community detection, distributed clustering, eigenvector computation, gossip algorithms, population protocols}
}
@InProceedings{parter:LIPIcs.ICALP.2018.160,
author = {Parter, Merav},
title = {{(Delta+1) Coloring in the Congested Clique Model}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {160:1--160: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.160},
URN = {urn:nbn:de:0030-drops-91640},
doi = {10.4230/LIPIcs.ICALP.2018.160},
annote = {Keywords: Distributed Graph Algorithms, Coloring, Congested Clique}
}
@InProceedings{patel_et_al:LIPIcs.ICALP.2018.161,
author = {Patel, Sarvar and Persiano, Giuseppe and Yeo, Kevin},
title = {{CacheShuffle: A Family of Oblivious Shuffles}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {161:1--161: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.161},
URN = {urn:nbn:de:0030-drops-91651},
doi = {10.4230/LIPIcs.ICALP.2018.161},
annote = {Keywords: Shuffling, Data-Oblivious Algorithms}
}
@InProceedings{bateni_et_al:LIPIcs.ICALP.2018.162,
author = {Bateni, MohammadHossein and Behnezhad, Soheil and Derakhshan, Mahsa and Hajiaghayi, MohammadTaghi and Mirrokni, Vahab},
title = {{Brief Announcement: MapReduce Algorithms for Massive Trees}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {162:1--162: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.162},
URN = {urn:nbn:de:0030-drops-91666},
doi = {10.4230/LIPIcs.ICALP.2018.162},
annote = {Keywords: MapReduce, Trees}
}
@InProceedings{benbasat_et_al:LIPIcs.ICALP.2018.163,
author = {Ben Basat, Ran and Einziger, Gil and Friedman, Roy},
title = {{Brief Announcement: Give Me Some Slack: Efficient Network Measurements}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {163:1--163: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.163},
URN = {urn:nbn:de:0030-drops-91672},
doi = {10.4230/LIPIcs.ICALP.2018.163},
annote = {Keywords: Streaming, Algorithms, Sliding window, Lower bounds}
}
@InProceedings{bensasson_et_al:LIPIcs.ICALP.2018.164,
author = {Ben-Sasson, Eli and Saig, Eden},
title = {{Brief Announcement: Towards an Abstract Model of User Retention Dynamics}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {164:1--164: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.164},
URN = {urn:nbn:de:0030-drops-91682},
doi = {10.4230/LIPIcs.ICALP.2018.164},
annote = {Keywords: information elicitation, proper scoring rules, retention complexity}
}
@InProceedings{das_et_al:LIPIcs.ICALP.2018.165,
author = {Das, Shantanu and Dereniowski, Dariusz and Uznanski, Przemyslaw},
title = {{Brief Announcement: Energy Constrained Depth First Search}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {165:1--165: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.165},
URN = {urn:nbn:de:0030-drops-91693},
doi = {10.4230/LIPIcs.ICALP.2018.165},
annote = {Keywords: DFS traversal, distributed algorithm, graph exploration, piecemeal exploration, online exploration}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing