@Proceedings{baier_et_al:LIPIcs.ICALP.2019,
title = {{LIPIcs, Volume 132, ICALP'19, Complete Volume}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019},
URN = {urn:nbn:de:0030-drops-108644},
doi = {10.4230/LIPIcs.ICALP.2019},
annote = {Keywords: Theory of computation}
}
@InProceedings{baier_et_al:LIPIcs.ICALP.2019.0,
author = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {0:i--0:xxxviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.0},
URN = {urn:nbn:de:0030-drops-105765},
doi = {10.4230/LIPIcs.ICALP.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{feldman:LIPIcs.ICALP.2019.1,
author = {Feldman, Michal},
title = {{Auction Design under Interdependent Values}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.1},
URN = {urn:nbn:de:0030-drops-105778},
doi = {10.4230/LIPIcs.ICALP.2019.1},
annote = {Keywords: Combinatorial auctions, Interdependent values, Welfare approximation}
}
@InProceedings{grohe:LIPIcs.ICALP.2019.2,
author = {Grohe, Martin},
title = {{Symmetry and Similarity}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.2},
URN = {urn:nbn:de:0030-drops-105787},
doi = {10.4230/LIPIcs.ICALP.2019.2},
annote = {Keywords: Graph Isomorphism, Graph Similarity, Graph Matching}
}
@InProceedings{svensson:LIPIcs.ICALP.2019.3,
author = {Svensson, Ola},
title = {{Approximately Good and Modern Matchings}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.3},
URN = {urn:nbn:de:0030-drops-105797},
doi = {10.4230/LIPIcs.ICALP.2019.3},
annote = {Keywords: Algorithms, Matchings, Computational Complexity}
}
@InProceedings{vaandrager:LIPIcs.ICALP.2019.4,
author = {Vaandrager, Frits},
title = {{Automata Learning and Galois Connections}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.4},
URN = {urn:nbn:de:0030-drops-105800},
doi = {10.4230/LIPIcs.ICALP.2019.4},
annote = {Keywords: Automaton Learning, Model Learning, Protocol Verification, Applications of Automata Learning, Galois Connections}
}
@InProceedings{yannakakis:LIPIcs.ICALP.2019.5,
author = {Yannakakis, Mihalis},
title = {{Fixed Point Computation Problems and Facets of Complexity}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {5:1--5:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.5},
URN = {urn:nbn:de:0030-drops-105812},
doi = {10.4230/LIPIcs.ICALP.2019.5},
annote = {Keywords: Fixed Point, Polynomial Time Algorithm, Computational Complexity}
}
@InProceedings{aaronson_et_al:LIPIcs.ICALP.2019.6,
author = {Aaronson, Scott and Cojocaru, Alexandru and Gheorghiu, Alexandru and Kashefi, Elham},
title = {{Complexity-Theoretic Limitations on Blind Delegated Quantum Computation}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.6},
URN = {urn:nbn:de:0030-drops-105826},
doi = {10.4230/LIPIcs.ICALP.2019.6},
annote = {Keywords: Quantum cryptography, Complexity theory, Delegated quantum computation, Computing on encrypted data}
}
@InProceedings{abboud_et_al:LIPIcs.ICALP.2019.7,
author = {Abboud, Amir and Georgiadis, Loukas and Italiano, Giuseppe F. and Krauthgamer, Robert and Parotsidis, Nikos and Trabelsi, Ohad and Uzna\'{n}ski, Przemys{\l}aw and Wolleb-Graf, Daniel},
title = {{Faster Algorithms for All-Pairs Bounded Min-Cuts}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.7},
URN = {urn:nbn:de:0030-drops-105833},
doi = {10.4230/LIPIcs.ICALP.2019.7},
annote = {Keywords: All-pairs min-cut, k-reachability, network coding, Directed graphs, fine-grained complexity}
}
@InProceedings{abboud:LIPIcs.ICALP.2019.8,
author = {Abboud, Amir},
title = {{Fine-Grained Reductions and Quantum Speedups for Dynamic Programming}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.8},
URN = {urn:nbn:de:0030-drops-105846},
doi = {10.4230/LIPIcs.ICALP.2019.8},
annote = {Keywords: Fine-Grained Complexity, Set-Cover, 3-SUM, k-Clique, k-SUM, Dynamic Programming, Quantum Algorithms}
}
@InProceedings{abrahamsen_et_al:LIPIcs.ICALP.2019.9,
author = {Abrahamsen, Mikkel and Giannopoulos, Panos and L\"{o}ffler, Maarten and Rote, G\"{u}nter},
title = {{Geometric Multicut}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.9},
URN = {urn:nbn:de:0030-drops-105850},
doi = {10.4230/LIPIcs.ICALP.2019.9},
annote = {Keywords: multicut, clustering, Steiner tree}
}
@InProceedings{afshani_et_al:LIPIcs.ICALP.2019.10,
author = {Afshani, Peyman and Freksen, Casper Benjamin and Kamma, Lior and Larsen, Kasper Green},
title = {{Lower Bounds for Multiplication via Network Coding}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.10},
URN = {urn:nbn:de:0030-drops-105861},
doi = {10.4230/LIPIcs.ICALP.2019.10},
annote = {Keywords: Circuit Complexity, Circuit Lower Bounds, Multiplication, Network Coding, Fine-Grained Complexity}
}
@InProceedings{agrawal_et_al:LIPIcs.ICALP.2019.11,
author = {Agrawal, Akanksha and Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar},
title = {{Path Contraction Faster Than 2^n}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.11},
URN = {urn:nbn:de:0030-drops-105874},
doi = {10.4230/LIPIcs.ICALP.2019.11},
annote = {Keywords: path contraction, exact exponential time algorithms, graph algorithms, enumerating connected sets, 3-disjoint connected subgraphs}
}
@InProceedings{alon_et_al:LIPIcs.ICALP.2019.12,
author = {Alon, Noga and Chechik, Shiri and Cohen, Sarel},
title = {{Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.12},
URN = {urn:nbn:de:0030-drops-105882},
doi = {10.4230/LIPIcs.ICALP.2019.12},
annote = {Keywords: replacement paths, distance sensitivity oracles, derandomization}
}
@InProceedings{ancona_et_al:LIPIcs.ICALP.2019.13,
author = {Ancona, Bertie and Henzinger, Monika and Roditty, Liam and Williams, Virginia Vassilevska and Wein, Nicole},
title = {{Algorithms and Hardness for Diameter in Dynamic Graphs}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.13},
URN = {urn:nbn:de:0030-drops-105891},
doi = {10.4230/LIPIcs.ICALP.2019.13},
annote = {Keywords: fine-grained complexity, graph algorithms, dynamic algorithms}
}
@InProceedings{andoni_et_al:LIPIcs.ICALP.2019.14,
author = {Andoni, Alexandr and Stein, Clifford and Zhong, Peilin},
title = {{Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.14},
URN = {urn:nbn:de:0030-drops-105906},
doi = {10.4230/LIPIcs.ICALP.2019.14},
annote = {Keywords: parallel algorithms, biconnectivity, 2-edge connectivity, the MPC model}
}
@InProceedings{andoni_et_al:LIPIcs.ICALP.2019.15,
author = {Andoni, Alexandr and Malkin, Tal and Nosatzki, Negev Shekel},
title = {{Two Party Distribution Testing: Communication and Security}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.15},
URN = {urn:nbn:de:0030-drops-105916},
doi = {10.4230/LIPIcs.ICALP.2019.15},
annote = {Keywords: distribution testing, communication complexity, security}
}
@InProceedings{arunachalam_et_al:LIPIcs.ICALP.2019.16,
author = {Arunachalam, Srinivasan and Chakraborty, Sourav and Lee, Troy and Paraashar, Manaswi and de Wolf, Ronald},
title = {{Two New Results About Quantum Exact Learning}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.16},
URN = {urn:nbn:de:0030-drops-105929},
doi = {10.4230/LIPIcs.ICALP.2019.16},
annote = {Keywords: quantum computing, exact learning, analysis of Boolean functions, Fourier sparse Boolean functions}
}
@InProceedings{assadi_et_al:LIPIcs.ICALP.2019.17,
author = {Assadi, Sepehr and Solomon, Shay},
title = {{When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17},
URN = {urn:nbn:de:0030-drops-105931},
doi = {10.4230/LIPIcs.ICALP.2019.17},
annote = {Keywords: Maximal Independent Set, Maximal Matching, Sublinear-Time Algorithms, Bounded Neighborhood Independence}
}
@InProceedings{awasthi_et_al:LIPIcs.ICALP.2019.18,
author = {Awasthi, Pranjal and Bakshi, Ainesh and Balcan, Maria-Florina and White, Colin and Woodruff, David P.},
title = {{Robust Communication-Optimal Distributed Clustering Algorithms}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.18},
URN = {urn:nbn:de:0030-drops-105942},
doi = {10.4230/LIPIcs.ICALP.2019.18},
annote = {Keywords: robust distributed clustering, communication complexity}
}
@InProceedings{axiotis_et_al:LIPIcs.ICALP.2019.19,
author = {Axiotis, Kyriakos and Tzamos, Christos},
title = {{Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {19:1--19:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.19},
URN = {urn:nbn:de:0030-drops-105952},
doi = {10.4230/LIPIcs.ICALP.2019.19},
annote = {Keywords: Knapsack, Fine-Grained Complexity, Dynamic Programming}
}
@InProceedings{bartal_et_al:LIPIcs.ICALP.2019.20,
author = {Bartal, Yair and Fandina, Nova and Neiman, Ofer},
title = {{Covering Metric Spaces by Few Trees}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.20},
URN = {urn:nbn:de:0030-drops-105967},
doi = {10.4230/LIPIcs.ICALP.2019.20},
annote = {Keywords: tree cover, Ramsey tree cover, probabilistic hierarchical family}
}
@InProceedings{bernardini_et_al:LIPIcs.ICALP.2019.21,
author = {Bernardini, Giulia and Gawrychowski, Pawe{\l} and Pisanti, Nadia and Pissis, Solon P. and Rosone, Giovanna},
title = {{Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.21},
URN = {urn:nbn:de:0030-drops-105973},
doi = {10.4230/LIPIcs.ICALP.2019.21},
annote = {Keywords: string algorithms, pattern matching, elastic-degenerate string, matrix multiplication, fast Fourier transform}
}
@InProceedings{bezakova_et_al:LIPIcs.ICALP.2019.22,
author = {Bez\'{a}kov\'{a}, Ivona and Galanis, Andreas and Goldberg, Leslie Ann and \v{S}tefankovi\v{c}, Daniel},
title = {{The Complexity of Approximating the Matching Polynomial in the Complex Plane}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.22},
URN = {urn:nbn:de:0030-drops-105983},
doi = {10.4230/LIPIcs.ICALP.2019.22},
annote = {Keywords: matchings, partition function, correlation decay, connective constant}
}
@InProceedings{biedl_et_al:LIPIcs.ICALP.2019.23,
author = {Biedl, Therese and Kindermann, Philipp},
title = {{Finding Tutte Paths in Linear Time}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.23},
URN = {urn:nbn:de:0030-drops-105991},
doi = {10.4230/LIPIcs.ICALP.2019.23},
annote = {Keywords: planar graph, Tutte path, Hamiltonian path, 2-walk, linear time}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2019.24,
author = {Bj\"{o}rklund, Andreas and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav},
title = {{Approximate Counting of k-Paths: Deterministic and in Polynomial Space}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.24},
URN = {urn:nbn:de:0030-drops-106001},
doi = {10.4230/LIPIcs.ICALP.2019.24},
annote = {Keywords: parameterized complexity, approximate counting, \{ k\}-Path}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2019.25,
author = {Bj\"{o}rklund, Andreas and Williams, Ryan},
title = {{Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.25},
URN = {urn:nbn:de:0030-drops-106018},
doi = {10.4230/LIPIcs.ICALP.2019.25},
annote = {Keywords: permanent, Hamiltonian cycle, orthogonal vectors}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2019.26,
author = {Bj\"{o}rklund, Andreas and Kaski, Petteri and Williams, Ryan},
title = {{Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {26:1--26:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.26},
URN = {urn:nbn:de:0030-drops-106023},
doi = {10.4230/LIPIcs.ICALP.2019.26},
annote = {Keywords: equation systems, polynomial method}
}
@InProceedings{brandao_et_al:LIPIcs.ICALP.2019.27,
author = {Brand\~{a}o, Fernando G. S. L. and Kalev, Amir and Li, Tongyang and Lin, Cedric Yen-Yu and Svore, Krysta M. and Wu, Xiaodi},
title = {{Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.27},
URN = {urn:nbn:de:0030-drops-106036},
doi = {10.4230/LIPIcs.ICALP.2019.27},
annote = {Keywords: quantum algorithms, semidefinite program, convex optimization}
}
@InProceedings{grilo:LIPIcs.ICALP.2019.28,
author = {Grilo, Alex B.},
title = {{A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.28},
URN = {urn:nbn:de:0030-drops-106044},
doi = {10.4230/LIPIcs.ICALP.2019.28},
annote = {Keywords: quantum computation, quantum cryptography, delegation of quantum computation}
}
@InProceedings{briceno_et_al:LIPIcs.ICALP.2019.29,
author = {Brice\~{n}o, Raimundo and Bulatov, Andrei A. and Dalmau, V{\'\i}ctor and Larose, Beno\^{i}t},
title = {{Dismantlability, Connectedness, and Mixing in Relational Structures}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.29},
URN = {urn:nbn:de:0030-drops-106059},
doi = {10.4230/LIPIcs.ICALP.2019.29},
annote = {Keywords: relational structure, constraint satisfaction problem, homomorphism, mixing properties, Gibbs measure}
}
@InProceedings{bun_et_al:LIPIcs.ICALP.2019.30,
author = {Bun, Mark and Mande, Nikhil S. and Thaler, Justin},
title = {{Sign-Rank Can Increase Under Intersection}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.30},
URN = {urn:nbn:de:0030-drops-106067},
doi = {10.4230/LIPIcs.ICALP.2019.30},
annote = {Keywords: Sign rank, dimension complexity, communication complexity, learning theory}
}
@InProceedings{cantu_et_al:LIPIcs.ICALP.2019.31,
author = {Cantu, Angel A. and Luchsinger, Austin and Schweller, Robert and Wylie, Tim},
title = {{Covert Computation in Self-Assembled Circuits}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.31},
URN = {urn:nbn:de:0030-drops-106075},
doi = {10.4230/LIPIcs.ICALP.2019.31},
annote = {Keywords: self-assembly, covert circuits}
}
@InProceedings{oliveira:LIPIcs.ICALP.2019.32,
author = {Oliveira, Igor Carboni},
title = {{Randomness and Intractability in Kolmogorov Complexity}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.32},
URN = {urn:nbn:de:0030-drops-106087},
doi = {10.4230/LIPIcs.ICALP.2019.32},
annote = {Keywords: computational complexity, randomness, circuit lower bounds, Kolmogorov complexity}
}
@InProceedings{chakraborty_et_al:LIPIcs.ICALP.2019.33,
author = {Chakraborty, Shantanav and Gily\'{e}n, Andr\'{a}s and Jeffery, Stacey},
title = {{The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.33},
URN = {urn:nbn:de:0030-drops-106092},
doi = {10.4230/LIPIcs.ICALP.2019.33},
annote = {Keywords: Quantum algorithms, Hamiltonian simulation, Quantum machine learning}
}
@InProceedings{chalopin_et_al:LIPIcs.ICALP.2019.34,
author = {Chalopin, J\'{e}r\'{e}mie and Chepoi, Victor and Moran, Shay and Warmuth, Manfred K.},
title = {{Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.34},
URN = {urn:nbn:de:0030-drops-106105},
doi = {10.4230/LIPIcs.ICALP.2019.34},
annote = {Keywords: VC-dimension, sample compression, Sauer-Shelah-Perles lemma, Sandwich lemma, maximum class, ample/extremal class, corner peeling, unique sink orientation}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ICALP.2019.35,
author = {Chattopadhyay, Arkadev and Filmus, Yuval and Koroth, Sajin and Meir, Or and Pitassi, Toniann},
title = {{Query-To-Communication Lifting for BPP Using Inner Product}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.35},
URN = {urn:nbn:de:0030-drops-106110},
doi = {10.4230/LIPIcs.ICALP.2019.35},
annote = {Keywords: lifting theorems, inner product, BPP Lifting, Deterministic Lifting}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2019.36,
author = {Chen, Xue and Price, Eric},
title = {{Estimating the Frequency of a Clustered Signal}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.36},
URN = {urn:nbn:de:0030-drops-106128},
doi = {10.4230/LIPIcs.ICALP.2019.36},
annote = {Keywords: sublinear algorithms, Fourier transform}
}
@InProceedings{cheng_et_al:LIPIcs.ICALP.2019.37,
author = {Cheng, Kuan and Jin, Zhengzhong and Li, Xin and Wu, Ke},
title = {{Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.37},
URN = {urn:nbn:de:0030-drops-106137},
doi = {10.4230/LIPIcs.ICALP.2019.37},
annote = {Keywords: Deterministic document exchange, error correcting code, block edit error}
}
@InProceedings{cheng_et_al:LIPIcs.ICALP.2019.38,
author = {Cheng, Siu-Wing and Mao, Yuchen},
title = {{Restricted Max-Min Allocation: Approximation and Integrality Gap}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.38},
URN = {urn:nbn:de:0030-drops-106143},
doi = {10.4230/LIPIcs.ICALP.2019.38},
annote = {Keywords: fair allocation, configuration LP, approximation, integrality gap}
}
@InProceedings{cheraghchi_et_al:LIPIcs.ICALP.2019.39,
author = {Cheraghchi, Mahdi and Kabanets, Valentine and Lu, Zhenjian and Myrisiotis, Dimitrios},
title = {{Circuit Lower Bounds for MCSP from Local Pseudorandom Generators}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.39},
URN = {urn:nbn:de:0030-drops-106156},
doi = {10.4230/LIPIcs.ICALP.2019.39},
annote = {Keywords: minimum circuit size problem (MCSP), circuit lower bounds, pseudorandom generators (PRGs), local PRGs, de Morgan formulas, branching programs, constant depth circuits}
}
@InProceedings{chlamtac_et_al:LIPIcs.ICALP.2019.40,
author = {Chlamt\'{a}\v{c}, Eden and Dinitz, Michael and Robinson, Thomas},
title = {{The Norms of Graph Spanners}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {40:1--40:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.40},
URN = {urn:nbn:de:0030-drops-106163},
doi = {10.4230/LIPIcs.ICALP.2019.40},
annote = {Keywords: spanners, approximations}
}
@InProceedings{cohenaddad_et_al:LIPIcs.ICALP.2019.41,
author = {Cohen-Addad, Vincent and Li, Jason},
title = {{On the Fixed-Parameter Tractability of Capacitated Clustering}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.41},
URN = {urn:nbn:de:0030-drops-106171},
doi = {10.4230/LIPIcs.ICALP.2019.41},
annote = {Keywords: approximation algorithms, fixed-parameter tractability, capacitated, k-median, k-means, clustering, core-sets, Euclidean}
}
@InProceedings{cohenaddad_et_al:LIPIcs.ICALP.2019.42,
author = {Cohen-Addad, Vincent and Gupta, Anupam and Kumar, Amit and Lee, Euiwoong and Li, Jason},
title = {{Tight FPT Approximations for k-Median and k-Means}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.42},
URN = {urn:nbn:de:0030-drops-106182},
doi = {10.4230/LIPIcs.ICALP.2019.42},
annote = {Keywords: approximation algorithms, fixed-parameter tractability, k-median, k-means, clustering, core-sets}
}
@InProceedings{cojaoghlan_et_al:LIPIcs.ICALP.2019.43,
author = {Coja-Oghlan, Amin and Gebhard, Oliver and Hahn-Klimroth, Max and Loick, Philipp},
title = {{Information-Theoretic and Algorithmic Thresholds for Group Testing}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.43},
URN = {urn:nbn:de:0030-drops-106196},
doi = {10.4230/LIPIcs.ICALP.2019.43},
annote = {Keywords: Group testing problem, phase transitions, information theory, efficient algorithms, sharp threshold, Bayesian inference}
}
@InProceedings{colcombet_et_al:LIPIcs.ICALP.2019.44,
author = {Colcombet, Thomas and Ouaknine, Jo\"{e}l and Semukhin, Pavel and Worrell, James},
title = {{On Reachability Problems for Low-Dimensional Matrix Semigroups}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.44},
URN = {urn:nbn:de:0030-drops-106209},
doi = {10.4230/LIPIcs.ICALP.2019.44},
annote = {Keywords: membership problem, half-space reachability problem, matrix semigroups, Heisenberg group, general linear group}
}
@InProceedings{cormode_et_al:LIPIcs.ICALP.2019.45,
author = {Cormode, Graham and Dark, Jacques and Konrad, Christian},
title = {{Independent Sets in Vertex-Arrival Streams}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.45},
URN = {urn:nbn:de:0030-drops-106212},
doi = {10.4230/LIPIcs.ICALP.2019.45},
annote = {Keywords: streaming algorithms, independent set size, lower bounds}
}
@InProceedings{dalirrooyfard_et_al:LIPIcs.ICALP.2019.46,
author = {Dalirrooyfard, Mina and Williams, Virginia Vassilevska and Vyas, Nikhil and Wein, Nicole and Xu, Yinzhan and Yu, Yuancheng},
title = {{Approximation Algorithms for Min-Distance Problems}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.46},
URN = {urn:nbn:de:0030-drops-106223},
doi = {10.4230/LIPIcs.ICALP.2019.46},
annote = {Keywords: fine-grained complexity, graph algorithms, diameter, radius, eccentricities}
}
@InProceedings{dalirrooyfard_et_al:LIPIcs.ICALP.2019.47,
author = {Dalirrooyfard, Mina and Williams, Virginia Vassilevska and Vyas, Nikhil and Wein, Nicole},
title = {{Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.47},
URN = {urn:nbn:de:0030-drops-106238},
doi = {10.4230/LIPIcs.ICALP.2019.47},
annote = {Keywords: approximation algorithms, fine-grained complexity, diameter, radius, eccentricities}
}
@InProceedings{duan_et_al:LIPIcs.ICALP.2019.48,
author = {Duan, Ran and Jin, Ce and Wu, Hongxun},
title = {{Faster Algorithms for All Pairs Non-Decreasing Paths Problem}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {48:1--48:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.48},
URN = {urn:nbn:de:0030-drops-106241},
doi = {10.4230/LIPIcs.ICALP.2019.48},
annote = {Keywords: graph optimization, matrix multiplication, non-decreasing paths}
}
@InProceedings{ducoffe:LIPIcs.ICALP.2019.49,
author = {Ducoffe, Guillaume},
title = {{Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {49:1--49:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.49},
URN = {urn:nbn:de:0030-drops-106254},
doi = {10.4230/LIPIcs.ICALP.2019.49},
annote = {Keywords: girth, weighted graphs, approximation algorithms}
}
@InProceedings{diaz_et_al:LIPIcs.ICALP.2019.50,
author = {D{\'\i}az, Josep and Kirousis, Lefteris and Kokonezi, Sofia and Livieratos, John},
title = {{Algorithmically Efficient Syntactic Characterization of Possibility Domains}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.50},
URN = {urn:nbn:de:0030-drops-106269},
doi = {10.4230/LIPIcs.ICALP.2019.50},
annote = {Keywords: collective decision making, computational social choice, judgment aggregation, logical relations, algorithm complexity}
}
@InProceedings{dorfler_et_al:LIPIcs.ICALP.2019.51,
author = {D\"{o}rfler, Julian and Ikenmeyer, Christian and Panova, Greta},
title = {{On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.51},
URN = {urn:nbn:de:0030-drops-106276},
doi = {10.4230/LIPIcs.ICALP.2019.51},
annote = {Keywords: Algebraic complexity theory, geometric complexity theory, Waring rank, plethysm coefficients, occurrence obstructions, multiplicity obstructions}
}
@InProceedings{eden_et_al:LIPIcs.ICALP.2019.52,
author = {Eden, Talya and Ron, Dana and Rosenbaum, Will},
title = {{The Arboricity Captures the Complexity of Sampling Edges}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {52:1--52:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.52},
URN = {urn:nbn:de:0030-drops-106287},
doi = {10.4230/LIPIcs.ICALP.2019.52},
annote = {Keywords: sampling, graph algorithms, arboricity, sublinear-time algorithms}
}
@InProceedings{ene_et_al:LIPIcs.ICALP.2019.53,
author = {Ene, Alina and Nguyen, Huy L.},
title = {{A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {53:1--53:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.53},
URN = {urn:nbn:de:0030-drops-106290},
doi = {10.4230/LIPIcs.ICALP.2019.53},
annote = {Keywords: submodular maximization, knapsack constraint, fast algorithms}
}
@InProceedings{ene_et_al:LIPIcs.ICALP.2019.54,
author = {Ene, Alina and Nguyen, Huy L.},
title = {{Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.54},
URN = {urn:nbn:de:0030-drops-106303},
doi = {10.4230/LIPIcs.ICALP.2019.54},
annote = {Keywords: submodular maximization, matroid constraints, fast running times}
}
@InProceedings{equi_et_al:LIPIcs.ICALP.2019.55,
author = {Equi, Massimo and Grossi, Roberto and M\"{a}kinen, Veli and Tomescu, Alexandru I.},
title = {{On the Complexity of String Matching for Graphs}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.55},
URN = {urn:nbn:de:0030-drops-106314},
doi = {10.4230/LIPIcs.ICALP.2019.55},
annote = {Keywords: exact pattern matching, graph query, graph search, labeled graphs, string matching, string search, strong exponential time hypothesis, heterogeneous networks, variation graphs}
}
@InProceedings{fearnley_et_al:LIPIcs.ICALP.2019.56,
author = {Fearnley, John and Gordon, Spencer and Mehta, Ruta and Savani, Rahul},
title = {{Unique End of Potential Line}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.56},
URN = {urn:nbn:de:0030-drops-106327},
doi = {10.4230/LIPIcs.ICALP.2019.56},
annote = {Keywords: P-matrix linear complementarity problem, unique sink orientation, contraction map, TFNP, total search problems, continuous local search}
}
@InProceedings{ficak_et_al:LIPIcs.ICALP.2019.57,
author = {Ficak, Miron and Kozik, Marcin and Ol\v{s}\'{a}k, Miroslav and Stankiewicz, Szymon},
title = {{Dichotomy for Symmetric Boolean PCSPs}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {57:1--57:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.57},
URN = {urn:nbn:de:0030-drops-106339},
doi = {10.4230/LIPIcs.ICALP.2019.57},
annote = {Keywords: promise constraint satisfaction problem, PCSP, algebraic approach}
}
@InProceedings{filmus_et_al:LIPIcs.ICALP.2019.58,
author = {Filmus, Yuval and Hambardzumyan, Lianna and Hatami, Hamed and Hatami, Pooya and Zuckerman, David},
title = {{Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {58:1--58:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.58},
URN = {urn:nbn:de:0030-drops-106340},
doi = {10.4230/LIPIcs.ICALP.2019.58},
annote = {Keywords: Boolean function analysis, coin flipping}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2019.59,
author = {Fomin, Fedor V. and Golovach, Petr A. and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav},
title = {{Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {59:1--59:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.59},
URN = {urn:nbn:de:0030-drops-106351},
doi = {10.4230/LIPIcs.ICALP.2019.59},
annote = {Keywords: Binary matroids, perturbed graphic matroids, spanning set, parameterized complexity}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2019.60,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and Zehavi, Meirav},
title = {{Decomposition of Map Graphs with Applications}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {60:1--60:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.60},
URN = {urn:nbn:de:0030-drops-106366},
doi = {10.4230/LIPIcs.ICALP.2019.60},
annote = {Keywords: Longest Cycle, Cycle Packing, Feedback Vertex Set, Map Graphs, FPT}
}
@InProceedings{friedrich_et_al:LIPIcs.ICALP.2019.61,
author = {Friedrich, Tobias and Rothenberger, Ralf},
title = {{The Satisfiability Threshold for Non-Uniform Random 2-SAT}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {61:1--61:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.61},
URN = {urn:nbn:de:0030-drops-106372},
doi = {10.4230/LIPIcs.ICALP.2019.61},
annote = {Keywords: random SAT, satisfiability threshold, sharpness, non-uniform distribution, 2-SAT}
}
@InProceedings{garg_et_al:LIPIcs.ICALP.2019.62,
author = {Garg, Ankit and Gupta, Nikhil and Kayal, Neeraj and Saha, Chandan},
title = {{Determinant Equivalence Test over Finite Fields and over Q}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.62},
URN = {urn:nbn:de:0030-drops-106382},
doi = {10.4230/LIPIcs.ICALP.2019.62},
annote = {Keywords: Determinant equivalence test, full matrix algebra isomorphism, Lie algebra}
}
@InProceedings{garg_et_al:LIPIcs.ICALP.2019.63,
author = {Garg, Naveen and Gupta, Anupam and Kumar, Amit and Singla, Sahil},
title = {{Non-Clairvoyant Precedence Constrained Scheduling}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.63},
URN = {urn:nbn:de:0030-drops-106394},
doi = {10.4230/LIPIcs.ICALP.2019.63},
annote = {Keywords: Online algorithms, Scheduling, Primal-Dual analysis, Nash welfare}
}
@InProceedings{gavinsky_et_al:LIPIcs.ICALP.2019.64,
author = {Gavinsky, Dmitry and Lee, Troy and Santha, Miklos and Sanyal, Swagato},
title = {{A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {64:1--64:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.64},
URN = {urn:nbn:de:0030-drops-106407},
doi = {10.4230/LIPIcs.ICALP.2019.64},
annote = {Keywords: query complexity, lower bounds}
}
@InProceedings{goldberg_et_al:LIPIcs.ICALP.2019.65,
author = {Goldberg, Paul W. and Hollender, Alexandros},
title = {{The Hairy Ball Problem is PPAD-Complete}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {65:1--65:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.65},
URN = {urn:nbn:de:0030-drops-106416},
doi = {10.4230/LIPIcs.ICALP.2019.65},
annote = {Keywords: Computational Complexity, TFNP, PPAD, End-of-Line}
}
@InProceedings{golovnev_et_al:LIPIcs.ICALP.2019.66,
author = {Golovnev, Alexander and Ilango, Rahul and Impagliazzo, Russell and Kabanets, Valentine and Kolokolova, Antonina and Tal, Avishay},
title = {{AC^0\lbrackp\rbrack Lower Bounds Against MCSP via the Coin Problem}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {66:1--66:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.66},
URN = {urn:nbn:de:0030-drops-106422},
doi = {10.4230/LIPIcs.ICALP.2019.66},
annote = {Keywords: Minimum Circuit Size Problem (MCSP), circuit lower bounds, AC0\lbrackp\rbrack, coin problem, hybrid argument, MKTP, biased random boolean functions}
}
@InProceedings{gupta_et_al:LIPIcs.ICALP.2019.67,
author = {Gupta, Anupam and Guruganesh, Guru and Peng, Binghui and Wajc, David},
title = {{Stochastic Online Metric Matching}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {67:1--67:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.67},
URN = {urn:nbn:de:0030-drops-106430},
doi = {10.4230/LIPIcs.ICALP.2019.67},
annote = {Keywords: stochastic, online, online matching, metric matching}
}
@InProceedings{guruswami_et_al:LIPIcs.ICALP.2019.68,
author = {Guruswami, Venkatesan and Jin, Lingfei and Xing, Chaoping},
title = {{Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.68},
URN = {urn:nbn:de:0030-drops-106449},
doi = {10.4230/LIPIcs.ICALP.2019.68},
annote = {Keywords: Erasure codes, Algebraic constructions, Linear algebra, Locally Repairable Codes, Explicit constructions}
}
@InProceedings{hamoudi_et_al:LIPIcs.ICALP.2019.69,
author = {Hamoudi, Yassine and Magniez, Fr\'{e}d\'{e}ric},
title = {{Quantum Chebyshev’s Inequality and Applications}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {69:1--69:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.69},
URN = {urn:nbn:de:0030-drops-106458},
doi = {10.4230/LIPIcs.ICALP.2019.69},
annote = {Keywords: Quantum algorithms, approximation algorithms, sublinear-time algorithms, Monte Carlo method, streaming algorithms, subgraph counting}
}
@InProceedings{haney_et_al:LIPIcs.ICALP.2019.70,
author = {Haney, Samuel and Liaee, Mehraneh and Maggs, Bruce M. and Panigrahi, Debmalya and Rajaraman, Rajmohan and Sundaram, Ravi},
title = {{Retracting Graphs to Cycles}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {70:1--70:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.70},
URN = {urn:nbn:de:0030-drops-106462},
doi = {10.4230/LIPIcs.ICALP.2019.70},
annote = {Keywords: Graph algorithms, Graph embedding, Planar graphs, Approximation algorithms}
}
@InProceedings{hegerfeld_et_al:LIPIcs.ICALP.2019.71,
author = {Hegerfeld, Falko and Kratsch, Stefan},
title = {{On Adaptive Algorithms for Maximum Matching}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {71:1--71:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.71},
URN = {urn:nbn:de:0030-drops-106477},
doi = {10.4230/LIPIcs.ICALP.2019.71},
annote = {Keywords: Matchings, Adaptive Analysis, Parameterized Complexity}
}
@InProceedings{hrubes_et_al:LIPIcs.ICALP.2019.72,
author = {Hrube\v{s}, Pavel and Natarajan Ramamoorthy, Sivaramakrishnan and Rao, Anup and Yehudayoff, Amir},
title = {{Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {72:1--72:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.72},
URN = {urn:nbn:de:0030-drops-106487},
doi = {10.4230/LIPIcs.ICALP.2019.72},
annote = {Keywords: Balancing sets, depth-2 threshold circuits, polynomials, majority, weighted thresholds}
}
@InProceedings{huang_et_al:LIPIcs.ICALP.2019.73,
author = {Huang, Zhiyi and Zhu, Xue},
title = {{Scalable and Jointly Differentially Private Packing}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {73:1--73:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.73},
URN = {urn:nbn:de:0030-drops-106498},
doi = {10.4230/LIPIcs.ICALP.2019.73},
annote = {Keywords: Joint differential privacy, packing, scalable algorithms}
}
@InProceedings{jansen_et_al:LIPIcs.ICALP.2019.74,
author = {Jansen, Klaus and Rohwedder, Lars},
title = {{Local Search Breaks 1.75 for Graph Balancing}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {74:1--74:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.74},
URN = {urn:nbn:de:0030-drops-106501},
doi = {10.4230/LIPIcs.ICALP.2019.74},
annote = {Keywords: graph, approximation algorithm, scheduling, integrality gap, local search}
}
@InProceedings{jansen_et_al:LIPIcs.ICALP.2019.75,
author = {Jansen, Klaus and Lassota, Alexandra and Rohwedder, Lars},
title = {{Near-Linear Time Algorithm for n-fold ILPs via Color Coding}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {75:1--75:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.75},
URN = {urn:nbn:de:0030-drops-106518},
doi = {10.4230/LIPIcs.ICALP.2019.75},
annote = {Keywords: Near-Linear Time Algorithm, n-fold ILP, Color Coding}
}
@InProceedings{jin:LIPIcs.ICALP.2019.76,
author = {Jin, Ce},
title = {{An Improved FPTAS for 0-1 Knapsack}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {76:1--76:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.76},
URN = {urn:nbn:de:0030-drops-106527},
doi = {10.4230/LIPIcs.ICALP.2019.76},
annote = {Keywords: approximation algorithms, knapsack, subset sum}
}
@InProceedings{kolmogorov:LIPIcs.ICALP.2019.77,
author = {Kolmogorov, Vladimir},
title = {{Testing the Complexity of a Valued CSP Language}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {77:1--77:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.77},
URN = {urn:nbn:de:0030-drops-106531},
doi = {10.4230/LIPIcs.ICALP.2019.77},
annote = {Keywords: Valued Constraint Satisfaction Problems, Exponential time algorithms, Exponential Time Hypothesis}
}
@InProceedings{kumar_et_al:LIPIcs.ICALP.2019.78,
author = {Kumar, Mrinal and Oliveira, Rafael and Saptharishi, Ramprasad},
title = {{Towards Optimal Depth Reductions for Syntactically Multilinear Circuits}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {78:1--78:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.78},
URN = {urn:nbn:de:0030-drops-106548},
doi = {10.4230/LIPIcs.ICALP.2019.78},
annote = {Keywords: arithmetic circuits, multilinear circuits, depth reduction, lower bounds}
}
@InProceedings{kurpisz:LIPIcs.ICALP.2019.79,
author = {Kurpisz, Adam},
title = {{Sum-Of-Squares Bounds via Boolean Function Analysis}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {79:1--79:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.79},
URN = {urn:nbn:de:0030-drops-106556},
doi = {10.4230/LIPIcs.ICALP.2019.79},
annote = {Keywords: SoS certificate, SoS rank, hypercube optimization, semidefinite programming}
}
@InProceedings{kuszmaul:LIPIcs.ICALP.2019.80,
author = {Kuszmaul, William},
title = {{Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {80:1--80:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.80},
URN = {urn:nbn:de:0030-drops-106568},
doi = {10.4230/LIPIcs.ICALP.2019.80},
annote = {Keywords: dynamic time warping, edit distance, approximation algorithm, tree metrics}
}
@InProceedings{lin:LIPIcs.ICALP.2019.81,
author = {Lin, Bingkai},
title = {{A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {81:1--81:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.81},
URN = {urn:nbn:de:0030-drops-106573},
doi = {10.4230/LIPIcs.ICALP.2019.81},
annote = {Keywords: set cover, FPT inapproximability, gap-producing reduction, (n, k)-universal set}
}
@InProceedings{matuschke_et_al:LIPIcs.ICALP.2019.82,
author = {Matuschke, Jannik and Schmidt-Kraepelin, Ulrike and Verschae, Jos\'{e}},
title = {{Maintaining Perfect Matchings at Low Cost}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {82:1--82:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.82},
URN = {urn:nbn:de:0030-drops-106582},
doi = {10.4230/LIPIcs.ICALP.2019.82},
annote = {Keywords: matchings, robust optimization, approximation algorithms}
}
@InProceedings{merino_et_al:LIPIcs.ICALP.2019.83,
author = {Merino, Arturo I. and Soto, Jos\'{e} A.},
title = {{The Minimum Cost Query Problem on Matroids with Uncertainty Areas}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {83:1--83:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.83},
URN = {urn:nbn:de:0030-drops-106592},
doi = {10.4230/LIPIcs.ICALP.2019.83},
annote = {Keywords: Minimum spanning tree, matroids, uncertainty, queries}
}
@InProceedings{mertz_et_al:LIPIcs.ICALP.2019.84,
author = {Mertz, Ian and Pitassi, Toniann and Wei, Yuanhao},
title = {{Short Proofs Are Hard to Find}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {84:1--84:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.84},
URN = {urn:nbn:de:0030-drops-106605},
doi = {10.4230/LIPIcs.ICALP.2019.84},
annote = {Keywords: automatizability, Resolution, SAT solvers, proof complexity}
}
@InProceedings{mizrachi_et_al:LIPIcs.ICALP.2019.85,
author = {Mizrachi, Eyal and Schwartz, Roy and Spoerhase, Joachim and Uniyal, Sumedha},
title = {{A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {85:1--85:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.85},
URN = {urn:nbn:de:0030-drops-106610},
doi = {10.4230/LIPIcs.ICALP.2019.85},
annote = {Keywords: submodular function, approximation algorithm, covering, packing}
}
@InProceedings{moseley:LIPIcs.ICALP.2019.86,
author = {Moseley, Benjamin},
title = {{Scheduling to Approximate Minimization Objectives on Identical Machines}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {86:1--86:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.86},
URN = {urn:nbn:de:0030-drops-106621},
doi = {10.4230/LIPIcs.ICALP.2019.86},
annote = {Keywords: Scheduling, LP rounding, Approximation Algorithms}
}
@InProceedings{mustafa:LIPIcs.ICALP.2019.87,
author = {Mustafa, Nabil H.},
title = {{Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {87:1--87:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.87},
URN = {urn:nbn:de:0030-drops-106632},
doi = {10.4230/LIPIcs.ICALP.2019.87},
annote = {Keywords: epsilon-nets, Geometric Set Systems}
}
@InProceedings{naor_et_al:LIPIcs.ICALP.2019.88,
author = {Naor, Joseph (Seffi) and Umboh, Seeun William and Williamson, David P.},
title = {{Tight Bounds for Online Weighted Tree Augmentation}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {88:1--88:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.88},
URN = {urn:nbn:de:0030-drops-106647},
doi = {10.4230/LIPIcs.ICALP.2019.88},
annote = {Keywords: Online algorithms, competitive analysis, tree augmentation, network design}
}
@InProceedings{parter_et_al:LIPIcs.ICALP.2019.89,
author = {Parter, Merav and Yogev, Eylon},
title = {{Optimal Short Cycle Decomposition in Almost Linear Time}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {89:1--89:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.89},
URN = {urn:nbn:de:0030-drops-106653},
doi = {10.4230/LIPIcs.ICALP.2019.89},
annote = {Keywords: Cycle decomposition, low-congestion cycle cover, graph sparsification}
}
@InProceedings{panagiotou_et_al:LIPIcs.ICALP.2019.90,
author = {Panagiotou, Konstantinos and Pasch, Matija},
title = {{Satisfiability Thresholds for Regular Occupation Problems}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {90:1--90:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.90},
URN = {urn:nbn:de:0030-drops-106665},
doi = {10.4230/LIPIcs.ICALP.2019.90},
annote = {Keywords: Constraint satisfaction problem, replica symmetric, contraction coefficient, first moment, second moment, small subgraph conditioning}
}
@InProceedings{rafiey_et_al:LIPIcs.ICALP.2019.91,
author = {Rafiey, Akbar and Rafiey, Arash and Santos, Thiago},
title = {{Toward a Dichotomy for Approximation of H-Coloring}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {91:1--91:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.91},
URN = {urn:nbn:de:0030-drops-106678},
doi = {10.4230/LIPIcs.ICALP.2019.91},
annote = {Keywords: Approximation algorithms, minimum cost homomorphism, randomized rounding}
}
@InProceedings{guruswami_et_al:LIPIcs.ICALP.2019.92,
author = {Guruswami, Venkatesan and Riazanov, Andrii},
title = {{Beating Fredman-Koml\'{o}s for Perfect k-Hashing}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {92:1--92:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.92},
URN = {urn:nbn:de:0030-drops-106687},
doi = {10.4230/LIPIcs.ICALP.2019.92},
annote = {Keywords: Coding theory, perfect hashing, hash family, graph entropy, zero-error information theory}
}
@InProceedings{sauerwald_et_al:LIPIcs.ICALP.2019.93,
author = {Sauerwald, Thomas and Zanetti, Luca},
title = {{Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {93:1--93:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.93},
URN = {urn:nbn:de:0030-drops-106696},
doi = {10.4230/LIPIcs.ICALP.2019.93},
annote = {Keywords: random walks, dynamic graphs, hitting times}
}
@InProceedings{sun_et_al:LIPIcs.ICALP.2019.94,
author = {Sun, Xiaoming and Woodruff, David P. and Yang, Guang and Zhang, Jialin},
title = {{Querying a Matrix Through Matrix-Vector Products}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {94:1--94:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.94},
URN = {urn:nbn:de:0030-drops-106709},
doi = {10.4230/LIPIcs.ICALP.2019.94},
annote = {Keywords: Communication complexity, linear algebra, sketching}
}
@InProceedings{thorup_et_al:LIPIcs.ICALP.2019.95,
author = {Thorup, Mikkel and Zamir, Or and Zwick, Uri},
title = {{Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {95:1--95:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95},
URN = {urn:nbn:de:0030-drops-106712},
doi = {10.4230/LIPIcs.ICALP.2019.95},
annote = {Keywords: Order queries, word RAM, lower bounds}
}
@InProceedings{watson:LIPIcs.ICALP.2019.96,
author = {Watson, Thomas},
title = {{Amplification with One NP Oracle Query}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {96:1--96:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.96},
URN = {urn:nbn:de:0030-drops-106726},
doi = {10.4230/LIPIcs.ICALP.2019.96},
annote = {Keywords: Amplification, NP, oracle, query}
}
@InProceedings{woodruff_et_al:LIPIcs.ICALP.2019.97,
author = {Woodruff, David P. and Yang, Guang},
title = {{Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {97:1--97:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.97},
URN = {urn:nbn:de:0030-drops-106733},
doi = {10.4230/LIPIcs.ICALP.2019.97},
annote = {Keywords: Communication complexity, multi-player communication, one-way communication, streaming complexity}
}
@InProceedings{xing_et_al:LIPIcs.ICALP.2019.98,
author = {Xing, Chaoping and Yuan, Chen},
title = {{Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {98:1--98:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.98},
URN = {urn:nbn:de:0030-drops-106745},
doi = {10.4230/LIPIcs.ICALP.2019.98},
annote = {Keywords: Locally Repairable Codes, Hypergraph}
}
@InProceedings{vanapeldoorn_et_al:LIPIcs.ICALP.2019.99,
author = {van Apeldoorn, Joran and Gily\'{e}n, Andr\'{a}s},
title = {{Improvements in Quantum SDP-Solving with Applications}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {99:1--99:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.99},
URN = {urn:nbn:de:0030-drops-106750},
doi = {10.4230/LIPIcs.ICALP.2019.99},
annote = {Keywords: quantum algorithms, semidefinite programming, shadow tomography}
}
@InProceedings{aburadi_et_al:LIPIcs.ICALP.2019.100,
author = {Abu Radi, Bader and Kupferman, Orna},
title = {{Minimizing GFG Transition-Based Automata}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {100:1--100:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.100},
URN = {urn:nbn:de:0030-drops-106761},
doi = {10.4230/LIPIcs.ICALP.2019.100},
annote = {Keywords: Minimization, Deterministic co-B\"{u}chi Automata}
}
@InProceedings{baazizi_et_al:LIPIcs.ICALP.2019.101,
author = {Baazizi, Mohamed-Amine and Colazzo, Dario and Ghelli, Giorgio and Sartiani, Carlo},
title = {{A Type System for Interactive JSON Schema Inference}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {101:1--101:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.101},
URN = {urn:nbn:de:0030-drops-106774},
doi = {10.4230/LIPIcs.ICALP.2019.101},
annote = {Keywords: JSON, type systems, interactive inference}
}
@InProceedings{balaji_et_al:LIPIcs.ICALP.2019.102,
author = {Balaji, Nikhil and Kiefer, Stefan and Novotn\'{y}, Petr and P\'{e}rez, Guillermo A. and Shirmohammadi, Mahsa},
title = {{On the Complexity of Value Iteration}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {102:1--102:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.102},
URN = {urn:nbn:de:0030-drops-106782},
doi = {10.4230/LIPIcs.ICALP.2019.102},
annote = {Keywords: Markov decision processes, Value iteration, Formal verification}
}
@InProceedings{barcelo_et_al:LIPIcs.ICALP.2019.103,
author = {Barcel\'{o}, Pablo and Hong, Chih-Duo and Le, Xuan-Bach and Lin, Anthony W. and Niskanen, Reino},
title = {{Monadic Decomposability of Regular Relations}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {103:1--103:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.103},
URN = {urn:nbn:de:0030-drops-106790},
doi = {10.4230/LIPIcs.ICALP.2019.103},
annote = {Keywords: Transducers, Automata, Synchronized Rational Relations, Ramsey Theory, Variable Independence, Automatic Structures}
}
@InProceedings{barcelo_et_al:LIPIcs.ICALP.2019.104,
author = {Barcel\'{o}, Pablo and Figueira, Diego and Romero, Miguel},
title = {{Boundedness of Conjunctive Regular Path Queries}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {104:1--104:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.104},
URN = {urn:nbn:de:0030-drops-106803},
doi = {10.4230/LIPIcs.ICALP.2019.104},
annote = {Keywords: regular path queries, boundedness, limitedness, distance automata}
}
@InProceedings{bell:LIPIcs.ICALP.2019.105,
author = {Bell, Paul C.},
title = {{Polynomially Ambiguous Probabilistic Automata on Restricted Languages}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {105:1--105:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.105},
URN = {urn:nbn:de:0030-drops-106814},
doi = {10.4230/LIPIcs.ICALP.2019.105},
annote = {Keywords: Probabilistic finite automata, ambiguity, undecidability, bounded language, emptiness}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2019.106,
author = {Boja\'{n}czyk, Miko{\l}aj and Kiefer, Sandra and Lhote, Nathan},
title = {{String-to-String Interpretations With Polynomial-Size Output}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {106:1--106:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.106},
URN = {urn:nbn:de:0030-drops-106821},
doi = {10.4230/LIPIcs.ICALP.2019.106},
annote = {Keywords: MSO, interpretations, pebble transducers, polyregular functions}
}
@InProceedings{brunet_et_al:LIPIcs.ICALP.2019.107,
author = {Brunet, Paul and Silva, Alexandra},
title = {{A Kleene Theorem for Nominal Automata}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {107:1--107:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.107},
URN = {urn:nbn:de:0030-drops-106834},
doi = {10.4230/LIPIcs.ICALP.2019.107},
annote = {Keywords: Kleene Theorem, Nominal automata, Bracket Algebra}
}
@InProceedings{carette_et_al:LIPIcs.ICALP.2019.108,
author = {Carette, Titouan and Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud},
title = {{Completeness of Graphical Languages for Mixed States Quantum Mechanics}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {108:1--108:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.108},
URN = {urn:nbn:de:0030-drops-106844},
doi = {10.4230/LIPIcs.ICALP.2019.108},
annote = {Keywords: Quantum Computing, Quantum Categorical Mechanics, Category Theory, Mixed States, Completely Positive Maps}
}
@InProceedings{casel_et_al:LIPIcs.ICALP.2019.109,
author = {Casel, Katrin and Day, Joel D. and Fleischmann, Pamela and Kociumaka, Tomasz and Manea, Florin and Schmid, Markus L.},
title = {{Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {109:1--109:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.109},
URN = {urn:nbn:de:0030-drops-106858},
doi = {10.4230/LIPIcs.ICALP.2019.109},
annote = {Keywords: Graph and String Parameters, NP-Completeness, Approximation Algorithms}
}
@InProceedings{ciobanu_et_al:LIPIcs.ICALP.2019.110,
author = {Ciobanu, Laura and Elder, Murray},
title = {{Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {110:1--110:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.110},
URN = {urn:nbn:de:0030-drops-106867},
doi = {10.4230/LIPIcs.ICALP.2019.110},
annote = {Keywords: Hyperbolic group, Existential theory, EDT0L language, PSPACE}
}
@InProceedings{dallago_et_al:LIPIcs.ICALP.2019.111,
author = {Dal Lago, Ugo and Gavazzo, Francesco and Yoshimizu, Akira},
title = {{Differential Logical Relations, Part I: The Simply-Typed Case}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {111:1--111:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.111},
URN = {urn:nbn:de:0030-drops-106879},
doi = {10.4230/LIPIcs.ICALP.2019.111},
annote = {Keywords: Logical Relations, lambda-Calculus, Program Equivalence, Semantics}
}
@InProceedings{dawar_et_al:LIPIcs.ICALP.2019.112,
author = {Dawar, Anuj and Gr\"{a}del, Erich and Pakusa, Wied},
title = {{Approximations of Isomorphism and Logics with Linear-Algebraic Operators}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {112:1--112:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.112},
URN = {urn:nbn:de:0030-drops-106887},
doi = {10.4230/LIPIcs.ICALP.2019.112},
annote = {Keywords: Finite Model Theory, Graph Isomorphism, Descriptive Complexity, Algebra}
}
@InProceedings{dell_et_al:LIPIcs.ICALP.2019.113,
author = {Dell, Holger and Roth, Marc and Wellnitz, Philip},
title = {{Counting Answers to Existential Questions}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {113:1--113:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.113},
URN = {urn:nbn:de:0030-drops-106894},
doi = {10.4230/LIPIcs.ICALP.2019.113},
annote = {Keywords: Conjunctive queries, graph homomorphisms, counting complexity, parameterized complexity, fine-grained complexity}
}
@InProceedings{dorfman_et_al:LIPIcs.ICALP.2019.114,
author = {Dorfman, Dani and Kaplan, Haim and Zwick, Uri},
title = {{A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {114:1--114:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.114},
URN = {urn:nbn:de:0030-drops-106909},
doi = {10.4230/LIPIcs.ICALP.2019.114},
annote = {Keywords: Energy Games, Mean Payoff Games, Scaling}
}
@InProceedings{etessami_et_al:LIPIcs.ICALP.2019.115,
author = {Etessami, Kousha and Martinov, Emanuel and Stewart, Alistair and Yannakakis, Mihalis},
title = {{Reachability for Branching Concurrent Stochastic Games}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {115:1--115:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.115},
URN = {urn:nbn:de:0030-drops-106917},
doi = {10.4230/LIPIcs.ICALP.2019.115},
annote = {Keywords: stochastic games, multi-type branching processes, concurrent games, minimax-polynomial equations, reachability, almost-sure, limit-sure}
}
@InProceedings{fortin:LIPIcs.ICALP.2019.116,
author = {Fortin, Marie},
title = {{FO = FO^3 for Linear Orders with Monotone Binary Relations}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {116:1--116:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.116},
URN = {urn:nbn:de:0030-drops-106923},
doi = {10.4230/LIPIcs.ICALP.2019.116},
annote = {Keywords: first-order logic, three-variable property, propositional dynamic logic}
}
@InProceedings{grohe_et_al:LIPIcs.ICALP.2019.117,
author = {Grohe, Martin and Kiefer, Sandra},
title = {{A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {117:1--117:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.117},
URN = {urn:nbn:de:0030-drops-106931},
doi = {10.4230/LIPIcs.ICALP.2019.117},
annote = {Keywords: Weisfeiler-Leman algorithm, finite-variable logic, isomorphism testing, planar graphs, bounded genus}
}
@InProceedings{hosseini_et_al:LIPIcs.ICALP.2019.118,
author = {Hosseini, Mehran and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Termination of Linear Loops over the Integers}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {118:1--118:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.118},
URN = {urn:nbn:de:0030-drops-106940},
doi = {10.4230/LIPIcs.ICALP.2019.118},
annote = {Keywords: Program Verification, Loop Termination, Linear Integer Programs, Affine While Loops}
}
@InProceedings{kiefer_et_al:LIPIcs.ICALP.2019.119,
author = {Kiefer, Stefan and Mayr, Richard and Shirmohammadi, Mahsa and Totzke, Patrick},
title = {{B\"{u}chi Objectives in Countable MDPs}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {119:1--119:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.119},
URN = {urn:nbn:de:0030-drops-106959},
doi = {10.4230/LIPIcs.ICALP.2019.119},
annote = {Keywords: Markov decision processes}
}
@InProceedings{loding_et_al:LIPIcs.ICALP.2019.120,
author = {L\"{o}ding, Christof and Pirogov, Anton},
title = {{Determinization of B\"{u}chi Automata: Unifying the Approaches of Safra and Muller-Schupp}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {120:1--120:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.120},
URN = {urn:nbn:de:0030-drops-106963},
doi = {10.4230/LIPIcs.ICALP.2019.120},
annote = {Keywords: B\"{u}chi automata, determinization, parity automata}
}
@InProceedings{molinalovett_et_al:LIPIcs.ICALP.2019.121,
author = {Molina Lovett, Antonio and Shallit, Jeffrey},
title = {{Optimal Regular Expressions for Permutations}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {121:1--121:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.121},
URN = {urn:nbn:de:0030-drops-106978},
doi = {10.4230/LIPIcs.ICALP.2019.121},
annote = {Keywords: regular expressions, lower bounds, divide-and-conquer}
}
@InProceedings{muscholl_et_al:LIPIcs.ICALP.2019.122,
author = {Muscholl, Anca and Puppis, Gabriele},
title = {{Equivalence of Finite-Valued Streaming String Transducers Is Decidable}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {122:1--122:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.122},
URN = {urn:nbn:de:0030-drops-106988},
doi = {10.4230/LIPIcs.ICALP.2019.122},
annote = {Keywords: String transducers, equivalence, Ehrenfeucht conjecture}
}
@InProceedings{nguyen_et_al:LIPIcs.ICALP.2019.123,
author = {Nguy\~{ê}n, L\^{e} Th\`{a}nh D\~{u}ng and Pradic, Pierre},
title = {{From Normal Functors to Logarithmic Space Queries}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {123:1--123:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.123},
URN = {urn:nbn:de:0030-drops-106994},
doi = {10.4230/LIPIcs.ICALP.2019.123},
annote = {Keywords: coherence spaces, elementary linear logic, semantic evaluation}
}
@InProceedings{picantin:LIPIcs.ICALP.2019.124,
author = {Picantin, Matthieu},
title = {{Automatic Semigroups vs Automaton Semigroups}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {124:1--124:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.124},
URN = {urn:nbn:de:0030-drops-107004},
doi = {10.4230/LIPIcs.ICALP.2019.124},
annote = {Keywords: Mealy machine, semigroup, rewriting system, automaticity, self-similarity}
}
@InProceedings{pin_et_al:LIPIcs.ICALP.2019.125,
author = {Pin, Jean-\'{E}ric and Reutenauer, Christophe},
title = {{A Mahler’s Theorem for Word Functions}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {125:1--125:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.125},
URN = {urn:nbn:de:0030-drops-107019},
doi = {10.4230/LIPIcs.ICALP.2019.125},
annote = {Keywords: group languages, interpolation series, pro-p metric, regularity preserving}
}
@InProceedings{place_et_al:LIPIcs.ICALP.2019.126,
author = {Place, Thomas and Zeitoun, Marc},
title = {{On All Things Star-Free}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {126:1--126:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.126},
URN = {urn:nbn:de:0030-drops-107028},
doi = {10.4230/LIPIcs.ICALP.2019.126},
annote = {Keywords: Regular languages, separation problem, star-free closure, group languages}
}
@InProceedings{raszyk_et_al:LIPIcs.ICALP.2019.127,
author = {Raszyk, Martin and Basin, David and Traytel, Dmitriy},
title = {{From Nondeterministic to Multi-Head Deterministic Finite-State Transducers}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {127:1--127:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.127},
URN = {urn:nbn:de:0030-drops-107037},
doi = {10.4230/LIPIcs.ICALP.2019.127},
annote = {Keywords: Formal languages, Nondeterminism, Multi-head automata, Finite transducers}
}
@InProceedings{reynier_et_al:LIPIcs.ICALP.2019.128,
author = {Reynier, Pierre-Alain and Villevalois, Didier},
title = {{Sequentiality of String-to-Context Transducers}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {128:1--128:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.128},
URN = {urn:nbn:de:0030-drops-107042},
doi = {10.4230/LIPIcs.ICALP.2019.128},
annote = {Keywords: Transducers, Sequentiality, Twinning Property, Two-Way Transducers}
}
@InProceedings{schmitz:LIPIcs.ICALP.2019.129,
author = {Schmitz, Sylvain},
title = {{The Parametric Complexity of Lossy Counter Machines}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {129:1--129:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.129},
URN = {urn:nbn:de:0030-drops-107056},
doi = {10.4230/LIPIcs.ICALP.2019.129},
annote = {Keywords: Counter machine, well-structured system, well-quasi-order, antichain, fast-growing complexity}
}
@InProceedings{urbat_et_al:LIPIcs.ICALP.2019.130,
author = {Urbat, Henning and Milius, Stefan},
title = {{Varieties of Data Languages}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {130:1--130:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.130},
URN = {urn:nbn:de:0030-drops-107063},
doi = {10.4230/LIPIcs.ICALP.2019.130},
annote = {Keywords: Nominal sets, Stone duality, Algebraic language theory, Data languages}
}
@InProceedings{akrida_et_al:LIPIcs.ICALP.2019.131,
author = {Akrida, Eleni C. and Mertzios, George B. and Nikoletseas, Sotiris and Raptopoulos, Christoforos and Spirakis, Paul G. and Zamaraev, Viktor},
title = {{How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {131:1--131:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.131},
URN = {urn:nbn:de:0030-drops-107071},
doi = {10.4230/LIPIcs.ICALP.2019.131},
annote = {Keywords: Temporal network, stochastic temporal graph, temporal path, #P-hard problem, polynomial-time approximation scheme}
}
@InProceedings{bonne_et_al:LIPIcs.ICALP.2019.132,
author = {Bonne, Matthias and Censor-Hillel, Keren},
title = {{Distributed Detection of Cliques in Dynamic Networks}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {132:1--132:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.132},
URN = {urn:nbn:de:0030-drops-107082},
doi = {10.4230/LIPIcs.ICALP.2019.132},
annote = {Keywords: distributed computing, subgraph detection, dynamic graphs}
}
@InProceedings{caragiannis_et_al:LIPIcs.ICALP.2019.133,
author = {Caragiannis, Ioannis and Fanelli, Angelo},
title = {{On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {133:1--133:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.133},
URN = {urn:nbn:de:0030-drops-107095},
doi = {10.4230/LIPIcs.ICALP.2019.133},
annote = {Keywords: Congestion games, approximate pure Nash equilibrium, potential functions, approximate price of stability}
}
@InProceedings{casteigts_et_al:LIPIcs.ICALP.2019.134,
author = {Casteigts, Arnaud and Peters, Joseph G. and Schoeters, Jason},
title = {{Temporal Cliques Admit Sparse Spanners}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {134:1--134:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.134},
URN = {urn:nbn:de:0030-drops-107108},
doi = {10.4230/LIPIcs.ICALP.2019.134},
annote = {Keywords: Dynamic networks, Temporal graphs, Temporal connectivity, Sparse spanners}
}
@InProceedings{censorhillel_et_al:LIPIcs.ICALP.2019.135,
author = {Censor-Hillel, Keren and Rabie, Mika\"{e}l},
title = {{Distributed Reconfiguration of Maximal Independent Sets}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {135:1--135:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.135},
URN = {urn:nbn:de:0030-drops-107111},
doi = {10.4230/LIPIcs.ICALP.2019.135},
annote = {Keywords: distributed graph algorithms, reconfiguration, maximal independent set}
}
@InProceedings{anagnostopoulos_et_al:LIPIcs.ICALP.2019.136,
author = {Anagnostopoulos, Aris and Cohen, Ilan R. and Leonardi, Stefano and {\L}\k{a}cki, Jakub},
title = {{Stochastic Graph Exploration}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {136:1--136:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.136},
URN = {urn:nbn:de:0030-drops-107122},
doi = {10.4230/LIPIcs.ICALP.2019.136},
annote = {Keywords: stochastic optimization, graph exploration, approximation algorithms}
}
@InProceedings{czyzowicz_et_al:LIPIcs.ICALP.2019.137,
author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Lafond, Manuel and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil},
title = {{Energy Consumption of Group Search on a Line}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {137:1--137:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.137},
URN = {urn:nbn:de:0030-drops-107138},
doi = {10.4230/LIPIcs.ICALP.2019.137},
annote = {Keywords: Evacuation, Exit, Line, Face-to-face Communication, Robots, Search}
}
@InProceedings{deligkas_et_al:LIPIcs.ICALP.2019.138,
author = {Deligkas, Argyrios and Fearnley, John and Melissourgos, Themistoklis and Spirakis, Paul G.},
title = {{Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {138:1--138:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.138},
URN = {urn:nbn:de:0030-drops-107141},
doi = {10.4230/LIPIcs.ICALP.2019.138},
annote = {Keywords: PPA, FIXP, ETR, consensus halving, circuit, reduction, complexity class}
}
@InProceedings{dobrev_et_al:LIPIcs.ICALP.2019.139,
author = {Dobrev, Stefan and Narayanan, Lata and Opatrny, Jaroslav and Pankratov, Denis},
title = {{Exploration of High-Dimensional Grids by Finite Automata}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {139:1--139:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.139},
URN = {urn:nbn:de:0030-drops-107153},
doi = {10.4230/LIPIcs.ICALP.2019.139},
annote = {Keywords: Multi-agent systems, finite state machines, high-dimensional grids, robot exploration, randomized agents, semi-synchronous and synchronous agents}
}
@InProceedings{emek_et_al:LIPIcs.ICALP.2019.140,
author = {Emek, Yuval and Kutten, Shay and Lavi, Ron and Moses Jr., William K.},
title = {{Deterministic Leader Election in Programmable Matter}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {140:1--140:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.140},
URN = {urn:nbn:de:0030-drops-107169},
doi = {10.4230/LIPIcs.ICALP.2019.140},
annote = {Keywords: programmable matter, geometric amoebot model, leader election}
}
@InProceedings{erlebach_et_al:LIPIcs.ICALP.2019.141,
author = {Erlebach, Thomas and Kammer, Frank and Luo, Kelin and Sajenko, Andrej and Spooner, Jakob T.},
title = {{Two Moves per Time Step Make a Difference}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {141:1--141:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.141},
URN = {urn:nbn:de:0030-drops-107176},
doi = {10.4230/LIPIcs.ICALP.2019.141},
annote = {Keywords: Temporal Graph Exploration, Algorithmic Graph Theory, NP-Complete Problem}
}
@InProceedings{ghaffari_et_al:LIPIcs.ICALP.2019.142,
author = {Ghaffari, Mohsen and Sayyadi, Ali},
title = {{Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {142:1--142:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.142},
URN = {urn:nbn:de:0030-drops-107187},
doi = {10.4230/LIPIcs.ICALP.2019.142},
annote = {Keywords: Distributed Computing, Message Passing Algorithms, Graph Coloring, Arboricity, Congested Clique Model, Randomized Algorithms}
}
@InProceedings{gupta_et_al:LIPIcs.ICALP.2019.143,
author = {Gupta, Siddharth and Kosowski, Adrian and Viennot, Laurent},
title = {{Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {143:1--143:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.143},
URN = {urn:nbn:de:0030-drops-107199},
doi = {10.4230/LIPIcs.ICALP.2019.143},
annote = {Keywords: Hopsets, Distance Oracles, Graph Algorithms, Data Structures}
}
@InProceedings{haeupler_et_al:LIPIcs.ICALP.2019.144,
author = {Haeupler, Bernhard and Kuhn, Fabian and Martinsson, Anders and Petrova, Kalina and Pfister, Pascal},
title = {{Optimal Strategies for Patrolling Fences}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {144:1--144:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.144},
URN = {urn:nbn:de:0030-drops-107202},
doi = {10.4230/LIPIcs.ICALP.2019.144},
annote = {Keywords: multi-agent systems, patrolling algorithms}
}
@InProceedings{im_et_al:LIPIcs.ICALP.2019.145,
author = {Im, Sungjin and Moseley, Benjamin and Pruhs, Kirk and Purohit, Manish},
title = {{Matroid Coflow Scheduling}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {145:1--145:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.145},
URN = {urn:nbn:de:0030-drops-107213},
doi = {10.4230/LIPIcs.ICALP.2019.145},
annote = {Keywords: Coflow Scheduling, Concurrent Open Shop, Matroid Scheduling}
}
@InProceedings{korman_et_al:LIPIcs.ICALP.2019.146,
author = {Korman, Amos and Rodeh, Yoav},
title = {{Multi-Round Cooperative Search Games with Multiple Players}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {146:1--146:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.146},
URN = {urn:nbn:de:0030-drops-107227},
doi = {10.4230/LIPIcs.ICALP.2019.146},
annote = {Keywords: Algorithmic Mechanism Design, Parallel Algorithms, Collaborative Search, Fault-Tolerance, Price of Anarchy, Price of Stability, Symmetric Equilibria}
}
@InProceedings{kowalski_et_al:LIPIcs.ICALP.2019.147,
author = {Kowalski, Dariusz R. and Mosteiro, Miguel A.},
title = {{Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {147:1--147:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.147},
URN = {urn:nbn:de:0030-drops-107239},
doi = {10.4230/LIPIcs.ICALP.2019.147},
annote = {Keywords: Anonymous Dynamic Networks, Counting, distributed algorithms}
}
@InProceedings{mallmanntrenn_et_al:LIPIcs.ICALP.2019.148,
author = {Mallmann-Trenn, Frederik and Maus, Yannic and Pajak, Dominik},
title = {{Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {148:1--148:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.148},
URN = {urn:nbn:de:0030-drops-107240},
doi = {10.4230/LIPIcs.ICALP.2019.148},
annote = {Keywords: population protocols, noisy communication, distributed averaging}
}
@InProceedings{oh_et_al:LIPIcs.ICALP.2019.149,
author = {Oh, Shunhao and Appavoo, Anuja Meetoo and Gilbert, Seth},
title = {{Periodic Bandits and Wireless Network Selection}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {149:1--149:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.149},
URN = {urn:nbn:de:0030-drops-107251},
doi = {10.4230/LIPIcs.ICALP.2019.149},
annote = {Keywords: multi-armed bandits, wireless network selection, periodicity in environment}
}
@InProceedings{scheideler_et_al:LIPIcs.ICALP.2019.150,
author = {Scheideler, Christian and Setzer, Alexander},
title = {{On the Complexity of Local Graph Transformations}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {150:1--150:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.150},
URN = {urn:nbn:de:0030-drops-107266},
doi = {10.4230/LIPIcs.ICALP.2019.150},
annote = {Keywords: Graphs transformations, NP-hardness, approximation algorithms}
}
@InProceedings{schmand_et_al:LIPIcs.ICALP.2019.151,
author = {Schmand, Daniel and Schr\"{o}der, Marc and Skopalik, Alexander},
title = {{Network Investment Games with Wardrop Followers}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {151:1--151:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.151},
URN = {urn:nbn:de:0030-drops-107272},
doi = {10.4230/LIPIcs.ICALP.2019.151},
annote = {Keywords: Network Investment Game, Wardrop Equilibrium, Subgame Perfect Nash Equilibrium}
}
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