<h2>LIPIcs, Volume 132, ICALP 2019</h2>
<ul>
<li>
<span class="authors">Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi</span>
<span class="title">LIPIcs, Volume 132, ICALP'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019">10.4230/LIPIcs.ICALP.2019</a>
</li>
<li>
<span class="authors">Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.0">10.4230/LIPIcs.ICALP.2019.0</a>
</li>
<li>
<span class="authors">Michal Feldman</span>
<span class="title">Auction Design under Interdependent Values (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.1">10.4230/LIPIcs.ICALP.2019.1</a>
</li>
<li>
<span class="authors">Martin Grohe</span>
<span class="title">Symmetry and Similarity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.2">10.4230/LIPIcs.ICALP.2019.2</a>
</li>
<li>
<span class="authors">Ola Svensson</span>
<span class="title">Approximately Good and Modern Matchings (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.3">10.4230/LIPIcs.ICALP.2019.3</a>
</li>
<li>
<span class="authors">Frits Vaandrager</span>
<span class="title">Automata Learning and Galois Connections (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.4">10.4230/LIPIcs.ICALP.2019.4</a>
</li>
<li>
<span class="authors">Mihalis Yannakakis</span>
<span class="title">Fixed Point Computation Problems and Facets of Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.5">10.4230/LIPIcs.ICALP.2019.5</a>
</li>
<li>
<span class="authors">Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, and Elham Kashefi</span>
<span class="title">Complexity-Theoretic Limitations on Blind Delegated Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.6">10.4230/LIPIcs.ICALP.2019.6</a>
</li>
<li>
<span class="authors">Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemysław Uznański, and Daniel Wolleb-Graf</span>
<span class="title">Faster Algorithms for All-Pairs Bounded Min-Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.7">10.4230/LIPIcs.ICALP.2019.7</a>
</li>
<li>
<span class="authors">Amir Abboud</span>
<span class="title">Fine-Grained Reductions and Quantum Speedups for Dynamic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.8">10.4230/LIPIcs.ICALP.2019.8</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, and Günter Rote</span>
<span class="title">Geometric Multicut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.9">10.4230/LIPIcs.ICALP.2019.9</a>
</li>
<li>
<span class="authors">Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, and Kasper Green Larsen</span>
<span class="title">Lower Bounds for Multiplication via Network Coding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.10">10.4230/LIPIcs.ICALP.2019.10</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale</span>
<span class="title">Path Contraction Faster Than 2^n</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.11">10.4230/LIPIcs.ICALP.2019.11</a>
</li>
<li>
<span class="authors">Noga Alon, Shiri Chechik, and Sarel Cohen</span>
<span class="title">Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.12">10.4230/LIPIcs.ICALP.2019.12</a>
</li>
<li>
<span class="authors">Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein</span>
<span class="title">Algorithms and Hardness for Diameter in Dynamic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.13">10.4230/LIPIcs.ICALP.2019.13</a>
</li>
<li>
<span class="authors">Alexandr Andoni, Clifford Stein, and Peilin Zhong</span>
<span class="title">Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.14">10.4230/LIPIcs.ICALP.2019.14</a>
</li>
<li>
<span class="authors">Alexandr Andoni, Tal Malkin, and Negev Shekel Nosatzki</span>
<span class="title">Two Party Distribution Testing: Communication and Security</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.15">10.4230/LIPIcs.ICALP.2019.15</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald de Wolf</span>
<span class="title">Two New Results About Quantum Exact Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.16">10.4230/LIPIcs.ICALP.2019.16</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Shay Solomon</span>
<span class="title">When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.17">10.4230/LIPIcs.ICALP.2019.17</a>
</li>
<li>
<span class="authors">Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, and David P. Woodruff</span>
<span class="title">Robust Communication-Optimal Distributed Clustering Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.18">10.4230/LIPIcs.ICALP.2019.18</a>
</li>
<li>
<span class="authors">Kyriakos Axiotis and Christos Tzamos</span>
<span class="title">Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.19">10.4230/LIPIcs.ICALP.2019.19</a>
</li>
<li>
<span class="authors">Yair Bartal, Nova Fandina, and Ofer Neiman</span>
<span class="title">Covering Metric Spaces by Few Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.20">10.4230/LIPIcs.ICALP.2019.20</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Paweł Gawrychowski, Nadia Pisanti, Solon P. Pissis, and Giovanna Rosone</span>
<span class="title">Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.21">10.4230/LIPIcs.ICALP.2019.21</a>
</li>
<li>
<span class="authors">Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič</span>
<span class="title">The Complexity of Approximating the Matching Polynomial in the Complex Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.22">10.4230/LIPIcs.ICALP.2019.22</a>
</li>
<li>
<span class="authors">Therese Biedl and Philipp Kindermann</span>
<span class="title">Finding Tutte Paths in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.23">10.4230/LIPIcs.ICALP.2019.23</a>
</li>
<li>
<span class="authors">Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Approximate Counting of k-Paths: Deterministic and in Polynomial Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.24">10.4230/LIPIcs.ICALP.2019.24</a>
</li>
<li>
<span class="authors">Andreas Björklund and Ryan Williams</span>
<span class="title">Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.25">10.4230/LIPIcs.ICALP.2019.25</a>
</li>
<li>
<span class="authors">Andreas Björklund, Petteri Kaski, and Ryan Williams</span>
<span class="title">Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.26">10.4230/LIPIcs.ICALP.2019.26</a>
</li>
<li>
<span class="authors">Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu</span>
<span class="title">Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.27">10.4230/LIPIcs.ICALP.2019.27</a>
</li>
<li>
<span class="authors">Alex B. Grilo</span>
<span class="title">A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.28">10.4230/LIPIcs.ICALP.2019.28</a>
</li>
<li>
<span class="authors">Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, and Benoît Larose</span>
<span class="title">Dismantlability, Connectedness, and Mixing in Relational Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.29">10.4230/LIPIcs.ICALP.2019.29</a>
</li>
<li>
<span class="authors">Mark Bun, Nikhil S. Mande, and Justin Thaler</span>
<span class="title">Sign-Rank Can Increase Under Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.30">10.4230/LIPIcs.ICALP.2019.30</a>
</li>
<li>
<span class="authors">Angel A. Cantu, Austin Luchsinger, Robert Schweller, and Tim Wylie</span>
<span class="title">Covert Computation in Self-Assembled Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.31">10.4230/LIPIcs.ICALP.2019.31</a>
</li>
<li>
<span class="authors">Igor Carboni Oliveira</span>
<span class="title">Randomness and Intractability in Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.32">10.4230/LIPIcs.ICALP.2019.32</a>
</li>
<li>
<span class="authors">Shantanav Chakraborty, András Gilyén, and Stacey Jeffery</span>
<span class="title">The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.33">10.4230/LIPIcs.ICALP.2019.33</a>
</li>
<li>
<span class="authors">Jérémie Chalopin, Victor Chepoi, Shay Moran, and Manfred K. Warmuth</span>
<span class="title">Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.34">10.4230/LIPIcs.ICALP.2019.34</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, and Toniann Pitassi</span>
<span class="title">Query-To-Communication Lifting for BPP Using Inner Product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.35">10.4230/LIPIcs.ICALP.2019.35</a>
</li>
<li>
<span class="authors">Xue Chen and Eric Price</span>
<span class="title">Estimating the Frequency of a Clustered Signal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.36">10.4230/LIPIcs.ICALP.2019.36</a>
</li>
<li>
<span class="authors">Kuan Cheng, Zhengzhong Jin, Xin Li, and Ke Wu</span>
<span class="title">Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.37">10.4230/LIPIcs.ICALP.2019.37</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Yuchen Mao</span>
<span class="title">Restricted Max-Min Allocation: Approximation and Integrality Gap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.38">10.4230/LIPIcs.ICALP.2019.38</a>
</li>
<li>
<span class="authors">Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, and Dimitrios Myrisiotis</span>
<span class="title">Circuit Lower Bounds for MCSP from Local Pseudorandom Generators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.39">10.4230/LIPIcs.ICALP.2019.39</a>
</li>
<li>
<span class="authors">Eden Chlamtáč, Michael Dinitz, and Thomas Robinson</span>
<span class="title">The Norms of Graph Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.40">10.4230/LIPIcs.ICALP.2019.40</a>
</li>
<li>
<span class="authors">Vincent Cohen-Addad and Jason Li</span>
<span class="title">On the Fixed-Parameter Tractability of Capacitated Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.41">10.4230/LIPIcs.ICALP.2019.41</a>
</li>
<li>
<span class="authors">Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, and Jason Li</span>
<span class="title">Tight FPT Approximations for k-Median and k-Means</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.42">10.4230/LIPIcs.ICALP.2019.42</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, and Philipp Loick</span>
<span class="title">Information-Theoretic and Algorithmic Thresholds for Group Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.43">10.4230/LIPIcs.ICALP.2019.43</a>
</li>
<li>
<span class="authors">Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, and James Worrell</span>
<span class="title">On Reachability Problems for Low-Dimensional Matrix Semigroups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.44">10.4230/LIPIcs.ICALP.2019.44</a>
</li>
<li>
<span class="authors">Graham Cormode, Jacques Dark, and Christian Konrad</span>
<span class="title">Independent Sets in Vertex-Arrival Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.45">10.4230/LIPIcs.ICALP.2019.45</a>
</li>
<li>
<span class="authors">Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, and Yuancheng Yu</span>
<span class="title">Approximation Algorithms for Min-Distance Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.46">10.4230/LIPIcs.ICALP.2019.46</a>
</li>
<li>
<span class="authors">Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, and Nicole Wein</span>
<span class="title">Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.47">10.4230/LIPIcs.ICALP.2019.47</a>
</li>
<li>
<span class="authors">Ran Duan, Ce Jin, and Hongxun Wu</span>
<span class="title">Faster Algorithms for All Pairs Non-Decreasing Paths Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.48">10.4230/LIPIcs.ICALP.2019.48</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.49">10.4230/LIPIcs.ICALP.2019.49</a>
</li>
<li>
<span class="authors">Josep Díaz, Lefteris Kirousis, Sofia Kokonezi, and John Livieratos</span>
<span class="title">Algorithmically Efficient Syntactic Characterization of Possibility Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.50">10.4230/LIPIcs.ICALP.2019.50</a>
</li>
<li>
<span class="authors">Julian Dörfler, Christian Ikenmeyer, and Greta Panova</span>
<span class="title">On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.51">10.4230/LIPIcs.ICALP.2019.51</a>
</li>
<li>
<span class="authors">Talya Eden, Dana Ron, and Will Rosenbaum</span>
<span class="title">The Arboricity Captures the Complexity of Sampling Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.52">10.4230/LIPIcs.ICALP.2019.52</a>
</li>
<li>
<span class="authors">Alina Ene and Huy L. Nguyen</span>
<span class="title">A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.53">10.4230/LIPIcs.ICALP.2019.53</a>
</li>
<li>
<span class="authors">Alina Ene and Huy L. Nguyen</span>
<span class="title">Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.54">10.4230/LIPIcs.ICALP.2019.54</a>
</li>
<li>
<span class="authors">Massimo Equi, Roberto Grossi, Veli Mäkinen, and Alexandru I. Tomescu</span>
<span class="title">On the Complexity of String Matching for Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.55">10.4230/LIPIcs.ICALP.2019.55</a>
</li>
<li>
<span class="authors">John Fearnley, Spencer Gordon, Ruta Mehta, and Rahul Savani</span>
<span class="title">Unique End of Potential Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.56">10.4230/LIPIcs.ICALP.2019.56</a>
</li>
<li>
<span class="authors">Miron Ficak, Marcin Kozik, Miroslav Olšák, and Szymon Stankiewicz</span>
<span class="title">Dichotomy for Symmetric Boolean PCSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.57">10.4230/LIPIcs.ICALP.2019.57</a>
</li>
<li>
<span class="authors">Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, and David Zuckerman</span>
<span class="title">Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.58">10.4230/LIPIcs.ICALP.2019.58</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.59">10.4230/LIPIcs.ICALP.2019.59</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Decomposition of Map Graphs with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.60">10.4230/LIPIcs.ICALP.2019.60</a>
</li>
<li>
<span class="authors">Tobias Friedrich and Ralf Rothenberger</span>
<span class="title">The Satisfiability Threshold for Non-Uniform Random 2-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.61">10.4230/LIPIcs.ICALP.2019.61</a>
</li>
<li>
<span class="authors">Ankit Garg, Nikhil Gupta, Neeraj Kayal, and Chandan Saha</span>
<span class="title">Determinant Equivalence Test over Finite Fields and over Q</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.62">10.4230/LIPIcs.ICALP.2019.62</a>
</li>
<li>
<span class="authors">Naveen Garg, Anupam Gupta, Amit Kumar, and Sahil Singla</span>
<span class="title">Non-Clairvoyant Precedence Constrained Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.63">10.4230/LIPIcs.ICALP.2019.63</a>
</li>
<li>
<span class="authors">Dmitry Gavinsky, Troy Lee, Miklos Santha, and Swagato Sanyal</span>
<span class="title">A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.64">10.4230/LIPIcs.ICALP.2019.64</a>
</li>
<li>
<span class="authors">Paul W. Goldberg and Alexandros Hollender</span>
<span class="title">The Hairy Ball Problem is PPAD-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.65">10.4230/LIPIcs.ICALP.2019.65</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, and Avishay Tal</span>
<span class="title">AC^0[p] Lower Bounds Against MCSP via the Coin Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.66">10.4230/LIPIcs.ICALP.2019.66</a>
</li>
<li>
<span class="authors">Anupam Gupta, Guru Guruganesh, Binghui Peng, and David Wajc</span>
<span class="title">Stochastic Online Metric Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.67">10.4230/LIPIcs.ICALP.2019.67</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Lingfei Jin, and Chaoping Xing</span>
<span class="title">Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.68">10.4230/LIPIcs.ICALP.2019.68</a>
</li>
<li>
<span class="authors">Yassine Hamoudi and Frédéric Magniez</span>
<span class="title">Quantum Chebyshev’s Inequality and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.69">10.4230/LIPIcs.ICALP.2019.69</a>
</li>
<li>
<span class="authors">Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram</span>
<span class="title">Retracting Graphs to Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.70">10.4230/LIPIcs.ICALP.2019.70</a>
</li>
<li>
<span class="authors">Falko Hegerfeld and Stefan Kratsch</span>
<span class="title">On Adaptive Algorithms for Maximum Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.71">10.4230/LIPIcs.ICALP.2019.71</a>
</li>
<li>
<span class="authors">Pavel Hrubeš, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, and Amir Yehudayoff</span>
<span class="title">Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.72">10.4230/LIPIcs.ICALP.2019.72</a>
</li>
<li>
<span class="authors">Zhiyi Huang and Xue Zhu</span>
<span class="title">Scalable and Jointly Differentially Private Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.73">10.4230/LIPIcs.ICALP.2019.73</a>
</li>
<li>
<span class="authors">Klaus Jansen and Lars Rohwedder</span>
<span class="title">Local Search Breaks 1.75 for Graph Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.74">10.4230/LIPIcs.ICALP.2019.74</a>
</li>
<li>
<span class="authors">Klaus Jansen, Alexandra Lassota, and Lars Rohwedder</span>
<span class="title">Near-Linear Time Algorithm for n-fold ILPs via Color Coding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.75">10.4230/LIPIcs.ICALP.2019.75</a>
</li>
<li>
<span class="authors">Ce Jin</span>
<span class="title">An Improved FPTAS for 0-1 Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.76">10.4230/LIPIcs.ICALP.2019.76</a>
</li>
<li>
<span class="authors">Vladimir Kolmogorov</span>
<span class="title">Testing the Complexity of a Valued CSP Language</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.77">10.4230/LIPIcs.ICALP.2019.77</a>
</li>
<li>
<span class="authors">Mrinal Kumar, Rafael Oliveira, and Ramprasad Saptharishi</span>
<span class="title">Towards Optimal Depth Reductions for Syntactically Multilinear Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.78">10.4230/LIPIcs.ICALP.2019.78</a>
</li>
<li>
<span class="authors">Adam Kurpisz</span>
<span class="title">Sum-Of-Squares Bounds via Boolean Function Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.79">10.4230/LIPIcs.ICALP.2019.79</a>
</li>
<li>
<span class="authors">William Kuszmaul</span>
<span class="title">Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.80">10.4230/LIPIcs.ICALP.2019.80</a>
</li>
<li>
<span class="authors">Bingkai Lin</span>
<span class="title">A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.81">10.4230/LIPIcs.ICALP.2019.81</a>
</li>
<li>
<span class="authors">Jannik Matuschke, Ulrike Schmidt-Kraepelin, and José Verschae</span>
<span class="title">Maintaining Perfect Matchings at Low Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.82">10.4230/LIPIcs.ICALP.2019.82</a>
</li>
<li>
<span class="authors">Arturo I. Merino and José A. Soto</span>
<span class="title">The Minimum Cost Query Problem on Matroids with Uncertainty Areas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.83">10.4230/LIPIcs.ICALP.2019.83</a>
</li>
<li>
<span class="authors">Ian Mertz, Toniann Pitassi, and Yuanhao Wei</span>
<span class="title">Short Proofs Are Hard to Find</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.84">10.4230/LIPIcs.ICALP.2019.84</a>
</li>
<li>
<span class="authors">Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, and Sumedha Uniyal</span>
<span class="title">A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.85">10.4230/LIPIcs.ICALP.2019.85</a>
</li>
<li>
<span class="authors">Benjamin Moseley</span>
<span class="title">Scheduling to Approximate Minimization Objectives on Identical Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.86">10.4230/LIPIcs.ICALP.2019.86</a>
</li>
<li>
<span class="authors">Nabil H. Mustafa</span>
<span class="title">Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.87">10.4230/LIPIcs.ICALP.2019.87</a>
</li>
<li>
<span class="authors">Joseph (Seffi) Naor, Seeun William Umboh, and David P. Williamson</span>
<span class="title">Tight Bounds for Online Weighted Tree Augmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.88">10.4230/LIPIcs.ICALP.2019.88</a>
</li>
<li>
<span class="authors">Merav Parter and Eylon Yogev</span>
<span class="title">Optimal Short Cycle Decomposition in Almost Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.89">10.4230/LIPIcs.ICALP.2019.89</a>
</li>
<li>
<span class="authors">Konstantinos Panagiotou and Matija Pasch</span>
<span class="title">Satisfiability Thresholds for Regular Occupation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.90">10.4230/LIPIcs.ICALP.2019.90</a>
</li>
<li>
<span class="authors">Akbar Rafiey, Arash Rafiey, and Thiago Santos</span>
<span class="title">Toward a Dichotomy for Approximation of H-Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.91">10.4230/LIPIcs.ICALP.2019.91</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Andrii Riazanov</span>
<span class="title">Beating Fredman-Komlós for Perfect k-Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.92">10.4230/LIPIcs.ICALP.2019.92</a>
</li>
<li>
<span class="authors">Thomas Sauerwald and Luca Zanetti</span>
<span class="title">Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.93">10.4230/LIPIcs.ICALP.2019.93</a>
</li>
<li>
<span class="authors">Xiaoming Sun, David P. Woodruff, Guang Yang, and Jialin Zhang</span>
<span class="title">Querying a Matrix Through Matrix-Vector Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.94">10.4230/LIPIcs.ICALP.2019.94</a>
</li>
<li>
<span class="authors">Mikkel Thorup, Or Zamir, and Uri Zwick</span>
<span class="title">Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.95">10.4230/LIPIcs.ICALP.2019.95</a>
</li>
<li>
<span class="authors">Thomas Watson</span>
<span class="title">Amplification with One NP Oracle Query</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.96">10.4230/LIPIcs.ICALP.2019.96</a>
</li>
<li>
<span class="authors">David P. Woodruff and Guang Yang</span>
<span class="title">Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.97">10.4230/LIPIcs.ICALP.2019.97</a>
</li>
<li>
<span class="authors">Chaoping Xing and Chen Yuan</span>
<span class="title">Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.98">10.4230/LIPIcs.ICALP.2019.98</a>
</li>
<li>
<span class="authors">Joran van Apeldoorn and András Gilyén</span>
<span class="title">Improvements in Quantum SDP-Solving with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.99">10.4230/LIPIcs.ICALP.2019.99</a>
</li>
<li>
<span class="authors">Bader Abu Radi and Orna Kupferman</span>
<span class="title">Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.100">10.4230/LIPIcs.ICALP.2019.100</a>
</li>
<li>
<span class="authors">Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, and Carlo Sartiani</span>
<span class="title">A Type System for Interactive JSON Schema Inference (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.101">10.4230/LIPIcs.ICALP.2019.101</a>
</li>
<li>
<span class="authors">Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, and Mahsa Shirmohammadi</span>
<span class="title">On the Complexity of Value Iteration (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.102">10.4230/LIPIcs.ICALP.2019.102</a>
</li>
<li>
<span class="authors">Pablo Barceló, Chih-Duo Hong, Xuan-Bach Le, Anthony W. Lin, and Reino Niskanen</span>
<span class="title">Monadic Decomposability of Regular Relations (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.103">10.4230/LIPIcs.ICALP.2019.103</a>
</li>
<li>
<span class="authors">Pablo Barceló, Diego Figueira, and Miguel Romero</span>
<span class="title">Boundedness of Conjunctive Regular Path Queries (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.104">10.4230/LIPIcs.ICALP.2019.104</a>
</li>
<li>
<span class="authors">Paul C. Bell</span>
<span class="title">Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.105">10.4230/LIPIcs.ICALP.2019.105</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk, Sandra Kiefer, and Nathan Lhote</span>
<span class="title">String-to-String Interpretations With Polynomial-Size Output (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.106">10.4230/LIPIcs.ICALP.2019.106</a>
</li>
<li>
<span class="authors">Paul Brunet and Alexandra Silva</span>
<span class="title">A Kleene Theorem for Nominal Automata (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.107">10.4230/LIPIcs.ICALP.2019.107</a>
</li>
<li>
<span class="authors">Titouan Carette, Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart</span>
<span class="title">Completeness of Graphical Languages for Mixed States Quantum Mechanics (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.108">10.4230/LIPIcs.ICALP.2019.108</a>
</li>
<li>
<span class="authors">Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, and Markus L. Schmid</span>
<span class="title">Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.109">10.4230/LIPIcs.ICALP.2019.109</a>
</li>
<li>
<span class="authors">Laura Ciobanu and Murray Elder</span>
<span class="title">Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.110">10.4230/LIPIcs.ICALP.2019.110</a>
</li>
<li>
<span class="authors">Ugo Dal Lago, Francesco Gavazzo, and Akira Yoshimizu</span>
<span class="title">Differential Logical Relations, Part I: The Simply-Typed Case (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.111">10.4230/LIPIcs.ICALP.2019.111</a>
</li>
<li>
<span class="authors">Anuj Dawar, Erich Grädel, and Wied Pakusa</span>
<span class="title">Approximations of Isomorphism and Logics with Linear-Algebraic Operators (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.112">10.4230/LIPIcs.ICALP.2019.112</a>
</li>
<li>
<span class="authors">Holger Dell, Marc Roth, and Philip Wellnitz</span>
<span class="title">Counting Answers to Existential Questions (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.113">10.4230/LIPIcs.ICALP.2019.113</a>
</li>
<li>
<span class="authors">Dani Dorfman, Haim Kaplan, and Uri Zwick</span>
<span class="title">A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.114">10.4230/LIPIcs.ICALP.2019.114</a>
</li>
<li>
<span class="authors">Kousha Etessami, Emanuel Martinov, Alistair Stewart, and Mihalis Yannakakis</span>
<span class="title">Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.115">10.4230/LIPIcs.ICALP.2019.115</a>
</li>
<li>
<span class="authors">Marie Fortin</span>
<span class="title">FO = FO^3 for Linear Orders with Monotone Binary Relations (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.116">10.4230/LIPIcs.ICALP.2019.116</a>
</li>
<li>
<span class="authors">Martin Grohe and Sandra Kiefer</span>
<span class="title">A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.117">10.4230/LIPIcs.ICALP.2019.117</a>
</li>
<li>
<span class="authors">Mehran Hosseini, Joël Ouaknine, and James Worrell</span>
<span class="title">Termination of Linear Loops over the Integers (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.118">10.4230/LIPIcs.ICALP.2019.118</a>
</li>
<li>
<span class="authors">Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke</span>
<span class="title">Büchi Objectives in Countable MDPs (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.119">10.4230/LIPIcs.ICALP.2019.119</a>
</li>
<li>
<span class="authors">Christof Löding and Anton Pirogov</span>
<span class="title">Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.120">10.4230/LIPIcs.ICALP.2019.120</a>
</li>
<li>
<span class="authors">Antonio Molina Lovett and Jeffrey Shallit</span>
<span class="title">Optimal Regular Expressions for Permutations (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.121">10.4230/LIPIcs.ICALP.2019.121</a>
</li>
<li>
<span class="authors">Anca Muscholl and Gabriele Puppis</span>
<span class="title">Equivalence of Finite-Valued Streaming String Transducers Is Decidable (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.122">10.4230/LIPIcs.ICALP.2019.122</a>
</li>
<li>
<span class="authors">Lê Thành Dũng Nguyễn and Pierre Pradic</span>
<span class="title">From Normal Functors to Logarithmic Space Queries (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.123">10.4230/LIPIcs.ICALP.2019.123</a>
</li>
<li>
<span class="authors">Matthieu Picantin</span>
<span class="title">Automatic Semigroups vs Automaton Semigroups (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.124">10.4230/LIPIcs.ICALP.2019.124</a>
</li>
<li>
<span class="authors">Jean-Éric Pin and Christophe Reutenauer</span>
<span class="title">A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.125">10.4230/LIPIcs.ICALP.2019.125</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">On All Things Star-Free (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.126">10.4230/LIPIcs.ICALP.2019.126</a>
</li>
<li>
<span class="authors">Martin Raszyk, David Basin, and Dmitriy Traytel</span>
<span class="title">From Nondeterministic to Multi-Head Deterministic Finite-State Transducers (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.127">10.4230/LIPIcs.ICALP.2019.127</a>
</li>
<li>
<span class="authors">Pierre-Alain Reynier and Didier Villevalois</span>
<span class="title">Sequentiality of String-to-Context Transducers (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.128">10.4230/LIPIcs.ICALP.2019.128</a>
</li>
<li>
<span class="authors">Sylvain Schmitz</span>
<span class="title">The Parametric Complexity of Lossy Counter Machines (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.129">10.4230/LIPIcs.ICALP.2019.129</a>
</li>
<li>
<span class="authors">Henning Urbat and Stefan Milius</span>
<span class="title">Varieties of Data Languages (Track B: Automata, Logic, Semantics, and Theory of Programming)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.130">10.4230/LIPIcs.ICALP.2019.130</a>
</li>
<li>
<span class="authors">Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, and Viktor Zamaraev</span>
<span class="title">How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.131">10.4230/LIPIcs.ICALP.2019.131</a>
</li>
<li>
<span class="authors">Matthias Bonne and Keren Censor-Hillel</span>
<span class="title">Distributed Detection of Cliques in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.132">10.4230/LIPIcs.ICALP.2019.132</a>
</li>
<li>
<span class="authors">Ioannis Caragiannis and Angelo Fanelli</span>
<span class="title">On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.133">10.4230/LIPIcs.ICALP.2019.133</a>
</li>
<li>
<span class="authors">Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters</span>
<span class="title">Temporal Cliques Admit Sparse Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.134">10.4230/LIPIcs.ICALP.2019.134</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel and Mikaël Rabie</span>
<span class="title">Distributed Reconfiguration of Maximal Independent Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.135">10.4230/LIPIcs.ICALP.2019.135</a>
</li>
<li>
<span class="authors">Aris Anagnostopoulos, Ilan R. Cohen, Stefano Leonardi, and Jakub Łącki</span>
<span class="title">Stochastic Graph Exploration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.136">10.4230/LIPIcs.ICALP.2019.136</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende</span>
<span class="title">Energy Consumption of Group Search on a Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.137">10.4230/LIPIcs.ICALP.2019.137</a>
</li>
<li>
<span class="authors">Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, and Paul G. Spirakis</span>
<span class="title">Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.138">10.4230/LIPIcs.ICALP.2019.138</a>
</li>
<li>
<span class="authors">Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, and Denis Pankratov</span>
<span class="title">Exploration of High-Dimensional Grids by Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.139">10.4230/LIPIcs.ICALP.2019.139</a>
</li>
<li>
<span class="authors">Yuval Emek, Shay Kutten, Ron Lavi, and William K. Moses Jr.</span>
<span class="title">Deterministic Leader Election in Programmable Matter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.140">10.4230/LIPIcs.ICALP.2019.140</a>
</li>
<li>
<span class="authors">Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, and Jakob T. Spooner</span>
<span class="title">Two Moves per Time Step Make a Difference</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.141">10.4230/LIPIcs.ICALP.2019.141</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Ali Sayyadi</span>
<span class="title">Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.142">10.4230/LIPIcs.ICALP.2019.142</a>
</li>
<li>
<span class="authors">Siddharth Gupta, Adrian Kosowski, and Laurent Viennot</span>
<span class="title">Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.143">10.4230/LIPIcs.ICALP.2019.143</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, and Pascal Pfister</span>
<span class="title">Optimal Strategies for Patrolling Fences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.144">10.4230/LIPIcs.ICALP.2019.144</a>
</li>
<li>
<span class="authors">Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Manish Purohit</span>
<span class="title">Matroid Coflow Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.145">10.4230/LIPIcs.ICALP.2019.145</a>
</li>
<li>
<span class="authors">Amos Korman and Yoav Rodeh</span>
<span class="title">Multi-Round Cooperative Search Games with Multiple Players</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.146">10.4230/LIPIcs.ICALP.2019.146</a>
</li>
<li>
<span class="authors">Dariusz R. Kowalski and Miguel A. Mosteiro</span>
<span class="title">Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.147">10.4230/LIPIcs.ICALP.2019.147</a>
</li>
<li>
<span class="authors">Frederik Mallmann-Trenn, Yannic Maus, and Dominik Pajak</span>
<span class="title">Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.148">10.4230/LIPIcs.ICALP.2019.148</a>
</li>
<li>
<span class="authors">Shunhao Oh, Anuja Meetoo Appavoo, and Seth Gilbert</span>
<span class="title">Periodic Bandits and Wireless Network Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.149">10.4230/LIPIcs.ICALP.2019.149</a>
</li>
<li>
<span class="authors">Christian Scheideler and Alexander Setzer</span>
<span class="title">On the Complexity of Local Graph Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.150">10.4230/LIPIcs.ICALP.2019.150</a>
</li>
<li>
<span class="authors">Daniel Schmand, Marc Schröder, and Alexander Skopalik</span>
<span class="title">Network Investment Games with Wardrop Followers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2019.151">10.4230/LIPIcs.ICALP.2019.151</a>
</li>
</ul>
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