<h2>LIPIcs, Volume 107, ICALP 2018</h2>
<ul>
<li>
<span class="authors">Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella</span>
<span class="title">LIPIcs, Volume 107, ICALP'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018">10.4230/LIPIcs.ICALP.2018</a>
</li>
<li>
<span class="authors">Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.0">10.4230/LIPIcs.ICALP.2018.0</a>
</li>
<li>
<span class="authors">Theophanis Hadjistasi and Alexander A. Schwarzmann</span>
<span class="title">Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.1">10.4230/LIPIcs.ICALP.2018.1</a>
</li>
<li>
<span class="authors">Jaroslav Nesetril</span>
<span class="title">Sparsity - an Algorithmic Perspective (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.2">10.4230/LIPIcs.ICALP.2018.2</a>
</li>
<li>
<span class="authors">Sam Staton</span>
<span class="title">Probability Theory from a Programming Perspective (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.3">10.4230/LIPIcs.ICALP.2018.3</a>
</li>
<li>
<span class="authors">Richard Ryan Williams</span>
<span class="title">Lower Bounds by Algorithm Design: A Progress Report (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.4">10.4230/LIPIcs.ICALP.2018.4</a>
</li>
<li>
<span class="authors">Anders Aamand, Mathias Bæk Tejs Knudsen, and Mikkel Thorup</span>
<span class="title">Power of d Choices with Simple Tabulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.5">10.4230/LIPIcs.ICALP.2018.5</a>
</li>
<li>
<span class="authors">Anders Aamand, Niklas Hjuler, Jacob Holm, and Eva Rotenberg</span>
<span class="title">One-Way Trail Orientations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.6">10.4230/LIPIcs.ICALP.2018.6</a>
</li>
<li>
<span class="authors">Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc</span>
<span class="title">Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.7">10.4230/LIPIcs.ICALP.2018.7</a>
</li>
<li>
<span class="authors">Amir Abboud and Karl Bringmann</span>
<span class="title">Tighter Connections Between Formula-SAT and Shaving Logs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.8">10.4230/LIPIcs.ICALP.2018.8</a>
</li>
<li>
<span class="authors">Anna Adamaszek, Matthias Mnich, and Katarzyna Paluch</span>
<span class="title">New Approximation Algorithms for (1,2)-TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.9">10.4230/LIPIcs.ICALP.2018.9</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Haim Kaplan, and Micha Sharir</span>
<span class="title">Union of Hypercubes and 3D Minkowski Sums with Random Sizes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.10">10.4230/LIPIcs.ICALP.2018.10</a>
</li>
<li>
<span class="authors">Rotem Arnon-Friedman and Henry Yuen</span>
<span class="title">Noise-Tolerant Testing of High Entanglement of Formation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.11">10.4230/LIPIcs.ICALP.2018.11</a>
</li>
<li>
<span class="authors">Miriam Backens</span>
<span class="title">A Complete Dichotomy for Complex-Valued Holant^c</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.12">10.4230/LIPIcs.ICALP.2018.12</a>
</li>
<li>
<span class="authors">Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, and Adi Shamir</span>
<span class="title">Tight Bounds on Online Checkpointing Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.13">10.4230/LIPIcs.ICALP.2018.13</a>
</li>
<li>
<span class="authors">Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev</span>
<span class="title">Fast Reed-Solomon Interactive Oracle Proofs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.14">10.4230/LIPIcs.ICALP.2018.14</a>
</li>
<li>
<span class="authors">Amey Bhangale</span>
<span class="title">NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.15">10.4230/LIPIcs.ICALP.2018.15</a>
</li>
<li>
<span class="authors">Aditya Bhaskara, Samira Daruki, and Suresh Venkatasubramanian</span>
<span class="title">Sublinear Algorithms for MAXCUT and Correlation Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.16">10.4230/LIPIcs.ICALP.2018.16</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., and Pasin Manurangsi</span>
<span class="title">Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.17">10.4230/LIPIcs.ICALP.2018.17</a>
</li>
<li>
<span class="authors">Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, and Jeffrey Shallit</span>
<span class="title">Rollercoasters and Caterpillars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.18">10.4230/LIPIcs.ICALP.2018.18</a>
</li>
<li>
<span class="authors">Davide Bilò</span>
<span class="title">New algorithms for Steiner tree reoptimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.19">10.4230/LIPIcs.ICALP.2018.19</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, and Marianne Thieffry</span>
<span class="title">Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.20">10.4230/LIPIcs.ICALP.2018.20</a>
</li>
<li>
<span class="authors">Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, and Lin F. Yang</span>
<span class="title">Approximate Convex Hull of Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.21">10.4230/LIPIcs.ICALP.2018.21</a>
</li>
<li>
<span class="authors">Andrej Bogdanov</span>
<span class="title">Small Bias Requires Large Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.22">10.4230/LIPIcs.ICALP.2018.22</a>
</li>
<li>
<span class="authors">Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, and Luis Fernando Schultz Xavier da Silveira</span>
<span class="title">Geodesic Obstacle Representation of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.23">10.4230/LIPIcs.ICALP.2018.23</a>
</li>
<li>
<span class="authors">Elette Boyle, Abhishek Jain, Manoj Prabhakaran, and Ching-Hua Yu</span>
<span class="title">The Bottleneck Complexity of Secure Multiparty Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.24">10.4230/LIPIcs.ICALP.2018.24</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Emanuele Viola, David P. Woodruff, and Lin F. Yang</span>
<span class="title">Revisiting Frequency Moment Estimation in Random Order Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.25">10.4230/LIPIcs.ICALP.2018.25</a>
</li>
<li>
<span class="authors">Jaroslaw Byrka, Piotr Skowron, and Krzysztof Sornat</span>
<span class="title">Proportional Approval Voting, Harmonic k-median, and Negative Association</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.26">10.4230/LIPIcs.ICALP.2018.26</a>
</li>
<li>
<span class="authors">Marco L. Carmosino, Russell Impagliazzo, and Manuel Sabin</span>
<span class="title">Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.27">10.4230/LIPIcs.ICALP.2018.27</a>
</li>
<li>
<span class="authors">L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi</span>
<span class="title">Ranking with Fairness Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.28">10.4230/LIPIcs.ICALP.2018.28</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty and Chaitanya Swamy</span>
<span class="title">Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.29">10.4230/LIPIcs.ICALP.2018.29</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty and Maryam Negahbani</span>
<span class="title">Generalized Center Problems with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.30">10.4230/LIPIcs.ICALP.2018.30</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Yakov Nekrich, Saladi Rahul, and Konstantinos Tsakalidis</span>
<span class="title">Orthogonal Point Location and Rectangle Stabbing Queries in 3-d</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.31">10.4230/LIPIcs.ICALP.2018.31</a>
</li>
<li>
<span class="authors">L. Sunil Chandran, Yun Kuen Cheung, and Davis Issac</span>
<span class="title">Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.32">10.4230/LIPIcs.ICALP.2018.32</a>
</li>
<li>
<span class="authors">Moses Charikar and Shay Solomon</span>
<span class="title">Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.33">10.4230/LIPIcs.ICALP.2018.33</a>
</li>
<li>
<span class="authors">Moses Charikar, Ofir Geri, Michael P. Kim, and William Kuszmaul</span>
<span class="title">On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.34">10.4230/LIPIcs.ICALP.2018.34</a>
</li>
<li>
<span class="authors">Jiehua Chen, Danny Hermelin, Manuel Sorge, and Harel Yedidsion</span>
<span class="title">How Hard Is It to Satisfy (Almost) All Roommates?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.35">10.4230/LIPIcs.ICALP.2018.35</a>
</li>
<li>
<span class="authors">Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan</span>
<span class="title">A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.36">10.4230/LIPIcs.ICALP.2018.36</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Yuchen Mao</span>
<span class="title">Restricted Max-Min Fair Allocation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.37">10.4230/LIPIcs.ICALP.2018.37</a>
</li>
<li>
<span class="authors">Julia Chuzhoy, David H. K. Kim, and Rachit Nimavat</span>
<span class="title">Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.38">10.4230/LIPIcs.ICALP.2018.38</a>
</li>
<li>
<span class="authors">Alex Conway, Martín Farach-Colton, and Philip Shilane</span>
<span class="title">Optimal Hashing in External Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.39">10.4230/LIPIcs.ICALP.2018.39</a>
</li>
<li>
<span class="authors">Holger Dell, Martin Grohe, and Gaurav Rattan</span>
<span class="title">Lovász Meets Weisfeiler and Leman</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.40">10.4230/LIPIcs.ICALP.2018.40</a>
</li>
<li>
<span class="authors">Ilias Diakonikolas, Themis Gouleakis, John Peebles, and Eric Price</span>
<span class="title">Sample-Optimal Identity Testing with High Probability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.41">10.4230/LIPIcs.ICALP.2018.41</a>
</li>
<li>
<span class="authors">Ran Duan and Hanlin Ren</span>
<span class="title">Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.42">10.4230/LIPIcs.ICALP.2018.42</a>
</li>
<li>
<span class="authors">Ran Duan, Kaifeng Lyu, and Yuanhang Xie</span>
<span class="title">Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.43">10.4230/LIPIcs.ICALP.2018.43</a>
</li>
<li>
<span class="authors">Ran Duan, Yong Gu, and Le Zhang</span>
<span class="title">Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.44">10.4230/LIPIcs.ICALP.2018.44</a>
</li>
<li>
<span class="authors">Bartlomiej Dudek and Pawel Gawrychowski</span>
<span class="title">Edit Distance between Unrooted Trees in Cubic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.45">10.4230/LIPIcs.ICALP.2018.45</a>
</li>
<li>
<span class="authors">Lech Duraj, Grzegorz Gutowski, and Jakub Kozik</span>
<span class="title">A Note on Two-Colorability of Nonuniform Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.46">10.4230/LIPIcs.ICALP.2018.46</a>
</li>
<li>
<span class="authors">Zdenek Dvorák and Ken-ichi Kawarabayashi</span>
<span class="title">Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.47">10.4230/LIPIcs.ICALP.2018.47</a>
</li>
<li>
<span class="authors">Eduard Eiben and Iyad Kanj</span>
<span class="title">How to Navigate Through Obstacles?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.48">10.4230/LIPIcs.ICALP.2018.48</a>
</li>
<li>
<span class="authors">Friedrich Eisenbrand, Christoph Hunkenschröder, and Kim-Manuel Klein</span>
<span class="title">Faster Algorithms for Integer Programs with Block Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.49">10.4230/LIPIcs.ICALP.2018.49</a>
</li>
<li>
<span class="authors">Uriel Feige, Boaz Patt-Shamir, and Shai Vardi</span>
<span class="title">On the Probe Complexity of Local Computation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.50">10.4230/LIPIcs.ICALP.2018.50</a>
</li>
<li>
<span class="authors">Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc</span>
<span class="title">Fully-Dynamic Bin Packing with Little Repacking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>
</li>
<li>
<span class="authors">Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, and Maximilian Wötzel</span>
<span class="title">A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.52">10.4230/LIPIcs.ICALP.2018.52</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, and Fahad Panolan</span>
<span class="title">Parameterized Low-Rank Binary Matrix Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.53">10.4230/LIPIcs.ICALP.2018.53</a>
</li>
<li>
<span class="authors">Michael A. Forbes, Sumanta Ghosh, and Nitin Saxena</span>
<span class="title">Towards Blackbox Identity Testing of Log-Variate Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.54">10.4230/LIPIcs.ICALP.2018.54</a>
</li>
<li>
<span class="authors">Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, and Nicole Wein</span>
<span class="title">Finding Cliques in Social Networks: A New Distribution-Free Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.55">10.4230/LIPIcs.ICALP.2018.55</a>
</li>
<li>
<span class="authors">Hao Fu, Jian Li, and Pan Xu</span>
<span class="title">A PTAS for a Class of Stochastic Dynamic Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.56">10.4230/LIPIcs.ICALP.2018.56</a>
</li>
<li>
<span class="authors">Buddhima Gamlath, Sangxia Huang, and Ola Svensson</span>
<span class="title">Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.57">10.4230/LIPIcs.ICALP.2018.57</a>
</li>
<li>
<span class="authors">Sumit Ganguly and David P. Woodruff</span>
<span class="title">High Probability Frequency Moment Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.58">10.4230/LIPIcs.ICALP.2018.58</a>
</li>
<li>
<span class="authors">Shashwat Garg</span>
<span class="title">Quasi-PTAS for Scheduling with Precedences using LP Hierarchies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.59">10.4230/LIPIcs.ICALP.2018.59</a>
</li>
<li>
<span class="authors">Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, and Veronika Slívová</span>
<span class="title">ARRIVAL: Next Stop in CLS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.60">10.4230/LIPIcs.ICALP.2018.60</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski and Adam Karczmarz</span>
<span class="title">Improved Bounds for Shortest Paths in Dense Distance Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.61">10.4230/LIPIcs.ICALP.2018.61</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski and Przemyslaw Uznanski</span>
<span class="title">Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.62">10.4230/LIPIcs.ICALP.2018.62</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, and Oren Weimann</span>
<span class="title">A Faster Construction of Greedy Consensus Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.63">10.4230/LIPIcs.ICALP.2018.63</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Liran Markin, and Oren Weimann</span>
<span class="title">A Faster FPTAS for #Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.64">10.4230/LIPIcs.ICALP.2018.64</a>
</li>
<li>
<span class="authors">Shay Golan, Tsvi Kopelowitz, and Ely Porat</span>
<span class="title">Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.65">10.4230/LIPIcs.ICALP.2018.65</a>
</li>
<li>
<span class="authors">Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, and Kaja Wille</span>
<span class="title">Gray Codes and Symmetric Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.66">10.4230/LIPIcs.ICALP.2018.66</a>
</li>
<li>
<span class="authors">Martin Grohe, Daniel Neuen, Pascal Schweitzer, and Daniel Wiebking</span>
<span class="title">An Improved Isomorphism Test for Bounded-Tree-Width Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.67">10.4230/LIPIcs.ICALP.2018.67</a>
</li>
<li>
<span class="authors">Heng Guo and Mark Jerrum</span>
<span class="title">A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.68">10.4230/LIPIcs.ICALP.2018.68</a>
</li>
<li>
<span class="authors">Heng Guo and Mark Jerrum</span>
<span class="title">Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.69">10.4230/LIPIcs.ICALP.2018.69</a>
</li>
<li>
<span class="authors">Anupam Gupta, Amit Kumar, and Jason Li</span>
<span class="title">Non-Preemptive Flow-Time Minimization via Rejections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.70">10.4230/LIPIcs.ICALP.2018.70</a>
</li>
<li>
<span class="authors">Anupam Gupta, Ruta Mehta, and Marco Molinaro</span>
<span class="title">Maximizing Profit with Convex Costs in the Random-order Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.71">10.4230/LIPIcs.ICALP.2018.71</a>
</li>
<li>
<span class="authors">Manoj Gupta and Aditi Singh</span>
<span class="title">Generic Single Edge Fault Tolerant Exact Distance Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.72">10.4230/LIPIcs.ICALP.2018.72</a>
</li>
<li>
<span class="authors">Tom Gur, Yang P. Liu, and Ron D. Rothblum</span>
<span class="title">An Exponential Separation Between MA and AM Proofs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.73">10.4230/LIPIcs.ICALP.2018.73</a>
</li>
<li>
<span class="authors">Rohit Gurjar, Thomas Thierauf, and Nisheeth K. Vishnoi</span>
<span class="title">Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.74">10.4230/LIPIcs.ICALP.2018.74</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik</span>
<span class="title">Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.75">10.4230/LIPIcs.ICALP.2018.75</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, Amirbehshad Shahrasbi, and Madhu Sudan</span>
<span class="title">Synchronization Strings: List Decoding for Insertions and Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.76">10.4230/LIPIcs.ICALP.2018.76</a>
</li>
<li>
<span class="authors">Sariel Har-Peled, Piotr Indyk, and Sepideh Mahabadi</span>
<span class="title">Approximate Sparse Linear Regression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.77">10.4230/LIPIcs.ICALP.2018.77</a>
</li>
<li>
<span class="authors">Koyo Hayashi</span>
<span class="title">A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.78">10.4230/LIPIcs.ICALP.2018.78</a>
</li>
<li>
<span class="authors">Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang</span>
<span class="title">Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.79">10.4230/LIPIcs.ICALP.2018.79</a>
</li>
<li>
<span class="authors">Jisu Jeong, Eun Jung Kim, and Sang-il Oum</span>
<span class="title">Finding Branch-Decompositions of Matroids, Hypergraphs, and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.80">10.4230/LIPIcs.ICALP.2018.80</a>
</li>
<li>
<span class="authors">Juan Jose Besa, William E. Devanny, David Eppstein, Michael T. Goodrich, and Timothy Johnson</span>
<span class="title">Optimally Sorting Evolving Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.81">10.4230/LIPIcs.ICALP.2018.81</a>
</li>
<li>
<span class="authors">Daniel M. Kane, Shachar Lovett, and Shay Moran</span>
<span class="title">Generalized Comparison Trees for Point-Location Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.82">10.4230/LIPIcs.ICALP.2018.82</a>
</li>
<li>
<span class="authors">Zhuan Khye Koh and Laura Sanità</span>
<span class="title">Stabilizing Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.83">10.4230/LIPIcs.ICALP.2018.83</a>
</li>
<li>
<span class="authors">Alexandra Kolla, Ioannis Koutis, Vivek Madan, and Ali Kemal Sinop</span>
<span class="title">Spectrally Robust Graph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.84">10.4230/LIPIcs.ICALP.2018.84</a>
</li>
<li>
<span class="authors">Martin Koutecký, Asaf Levin, and Shmuel Onn</span>
<span class="title">A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.85">10.4230/LIPIcs.ICALP.2018.85</a>
</li>
<li>
<span class="authors">Michael Lampis</span>
<span class="title">Finer Tight Bounds for Coloring on Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.86">10.4230/LIPIcs.ICALP.2018.86</a>
</li>
<li>
<span class="authors">Christoph Lenzen and Reut Levi</span>
<span class="title">A Centralized Local Algorithm for the Sparse Spanning Graph Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.87">10.4230/LIPIcs.ICALP.2018.87</a>
</li>
<li>
<span class="authors">Sixue Liu</span>
<span class="title">Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.88">10.4230/LIPIcs.ICALP.2018.88</a>
</li>
<li>
<span class="authors">Gill Barequet, David Eppstein, Michael T. Goodrich, and Nil Mamano</span>
<span class="title">Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.89">10.4230/LIPIcs.ICALP.2018.89</a>
</li>
<li>
<span class="authors">Vasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang</span>
<span class="title">Improved Algorithms for Adaptive Compressed Sensing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.90">10.4230/LIPIcs.ICALP.2018.90</a>
</li>
<li>
<span class="authors">Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen</span>
<span class="title">Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.91">10.4230/LIPIcs.ICALP.2018.91</a>
</li>
<li>
<span class="authors">Krzysztof Onak, Baruch Schieber, Shay Solomon, and Nicole Wein</span>
<span class="title">Fully Dynamic MIS in Uniformly Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.92">10.4230/LIPIcs.ICALP.2018.92</a>
</li>
<li>
<span class="authors">Rafail Ostrovsky, Yuval Rabani, and Arman Yousefi</span>
<span class="title">Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.93">10.4230/LIPIcs.ICALP.2018.93</a>
</li>
<li>
<span class="authors">Felix Reidl and Magnus Wahlström</span>
<span class="title">Parameterized Algorithms for Zero Extension and Metric Labelling Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.94">10.4230/LIPIcs.ICALP.2018.94</a>
</li>
<li>
<span class="authors">Andrei Romashchenko and Marius Zimand</span>
<span class="title">An Operational Characterization of Mutual Information in Algorithmic Information Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.95">10.4230/LIPIcs.ICALP.2018.95</a>
</li>
<li>
<span class="authors">Clemens Rösner and Melanie Schmidt</span>
<span class="title">Privacy Preserving Clustering with Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.96">10.4230/LIPIcs.ICALP.2018.96</a>
</li>
<li>
<span class="authors">Piotr Sankowski</span>
<span class="title">NC Algorithms for Weighted Planar Perfect Matching and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.97">10.4230/LIPIcs.ICALP.2018.97</a>
</li>
<li>
<span class="authors">Andreas Schmid and Jens M. Schmidt</span>
<span class="title">Computing Tutte Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.98">10.4230/LIPIcs.ICALP.2018.98</a>
</li>
<li>
<span class="authors">Tasuku Soma and Yuichi Yoshida</span>
<span class="title">A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.99">10.4230/LIPIcs.ICALP.2018.99</a>
</li>
<li>
<span class="authors">Daniele Miccianco and Jessica Sorrell</span>
<span class="title">Ring Packing and Amortized FHEW Bootstrapping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.100">10.4230/LIPIcs.ICALP.2018.100</a>
</li>
<li>
<span class="authors">Anand Louis and Rakesh Venkat</span>
<span class="title">Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.101">10.4230/LIPIcs.ICALP.2018.101</a>
</li>
<li>
<span class="authors">Stefan Walzer</span>
<span class="title">Load Thresholds for Cuckoo Hashing with Overlapping Blocks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.102">10.4230/LIPIcs.ICALP.2018.102</a>
</li>
<li>
<span class="authors">Navneet Agarwal, Sanat Anand, and Manoj Prabhakaran</span>
<span class="title">Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.103">10.4230/LIPIcs.ICALP.2018.103</a>
</li>
<li>
<span class="authors">Amy Babay, Michael Dinitz, and Zeyu Zhang</span>
<span class="title">Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.104">10.4230/LIPIcs.ICALP.2018.104</a>
</li>
<li>
<span class="authors">Ben Berger and Zvika Brakerski</span>
<span class="title">Brief Announcement: Zero-Knowledge Protocols for Search Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.105">10.4230/LIPIcs.ICALP.2018.105</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, and Samson Zhou</span>
<span class="title">Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.106">10.4230/LIPIcs.ICALP.2018.106</a>
</li>
<li>
<span class="authors">Steven Chaplick, Minati De, Alexander Ravsky, and Joachim Spoerhase</span>
<span class="title">Brief Announcement: Approximation Schemes for Geometric Coverage Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.107">10.4230/LIPIcs.ICALP.2018.107</a>
</li>
<li>
<span class="authors">Jing Chen, Bo Li, Yingkai Li, and Pinyan Lu</span>
<span class="title">Brief Announcement: Bayesian Auctions with Efficient Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.108">10.4230/LIPIcs.ICALP.2018.108</a>
</li>
<li>
<span class="authors">Daniel Graf, Karim Labib, and Przemyslaw Uznanski</span>
<span class="title">Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.109">10.4230/LIPIcs.ICALP.2018.109</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, and Meirav Zehavi</span>
<span class="title">Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.110">10.4230/LIPIcs.ICALP.2018.110</a>
</li>
<li>
<span class="authors">Sofya Raskhodnikova and Nithin Varma</span>
<span class="title">Brief Announcement: Erasure-Resilience Versus Tolerance to Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.111">10.4230/LIPIcs.ICALP.2018.111</a>
</li>
<li>
<span class="authors">Mingyu Xiao and Hiroshi Nagamochi</span>
<span class="title">Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.112">10.4230/LIPIcs.ICALP.2018.112</a>
</li>
<li>
<span class="authors">Alejandro Aguirre, Gilles Barthe, Justin Hsu, and Alexandra Silva</span>
<span class="title">Almost Sure Productivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.113">10.4230/LIPIcs.ICALP.2018.113</a>
</li>
<li>
<span class="authors">Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, and James Worrell</span>
<span class="title">O-Minimal Invariants for Linear Loops</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.114">10.4230/LIPIcs.ICALP.2018.114</a>
</li>
<li>
<span class="authors">Antoine Amarilli and Charles Paperman</span>
<span class="title">Topological Sorting with Regular Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.115">10.4230/LIPIcs.ICALP.2018.115</a>
</li>
<li>
<span class="authors">Albert Atserias, Stephan Kreutzer, and Marc Noy</span>
<span class="title">On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.116">10.4230/LIPIcs.ICALP.2018.116</a>
</li>
<li>
<span class="authors">Achim Blumensath and Felix Wolf</span>
<span class="title">Bisimulation Invariant Monadic-Second Order Logic in the Finite</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.117">10.4230/LIPIcs.ICALP.2018.117</a>
</li>
<li>
<span class="authors">Lorenzo Clemente and Slawomir Lasota</span>
<span class="title">Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.118">10.4230/LIPIcs.ICALP.2018.118</a>
</li>
<li>
<span class="authors">Wojciech Czerwinski, Piotr Hofman, and Georg Zetzsche</span>
<span class="title">Unboundedness Problems for Languages of Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.119">10.4230/LIPIcs.ICALP.2018.119</a>
</li>
<li>
<span class="authors">Samir Datta, Anish Mukherjee, Nils Vortmeier, and Thomas Zeume</span>
<span class="title">Reachability and Distances under Multiple Changes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.120">10.4230/LIPIcs.ICALP.2018.120</a>
</li>
<li>
<span class="authors">Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, and James Worrell</span>
<span class="title">When is Containment Decidable for Probabilistic Automata?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.121">10.4230/LIPIcs.ICALP.2018.121</a>
</li>
<li>
<span class="authors">Gaëtan Douéneau-Tabot</span>
<span class="title">On the Complexity of Infinite Advice Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.122">10.4230/LIPIcs.ICALP.2018.122</a>
</li>
<li>
<span class="authors">María Emilia Descotte, Diego Figueira, and Gabriele Puppis</span>
<span class="title">Resynchronizing Classes of Word Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.123">10.4230/LIPIcs.ICALP.2018.123</a>
</li>
<li>
<span class="authors">John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani</span>
<span class="title">Reachability Switching Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.124">10.4230/LIPIcs.ICALP.2018.124</a>
</li>
<li>
<span class="authors">Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, and James Worrell</span>
<span class="title">Costs and Rewards in Priced Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.125">10.4230/LIPIcs.ICALP.2018.125</a>
</li>
<li>
<span class="authors">Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, and Szymon Torunczyk</span>
<span class="title">First-Order Interpretations of Bounded Expansion Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.126">10.4230/LIPIcs.ICALP.2018.126</a>
</li>
<li>
<span class="authors">Moses Ganardi, Danny Hucke, and Markus Lohrey</span>
<span class="title">Randomized Sliding Window Algorithms for Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.127">10.4230/LIPIcs.ICALP.2018.127</a>
</li>
<li>
<span class="authors">Anael Grandjean, Benjamin Hellouin de Menibus, and Pascal Vanier</span>
<span class="title">Aperiodic Points in Z²-subshifts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.128">10.4230/LIPIcs.ICALP.2018.128</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup, Diego Nava Saucedo, and Don M. Stull</span>
<span class="title">Semicomputable Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.129">10.4230/LIPIcs.ICALP.2018.129</a>
</li>
<li>
<span class="authors">Stefan Kiefer</span>
<span class="title">On Computing the Total Variation Distance of Hidden Markov Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.130">10.4230/LIPIcs.ICALP.2018.130</a>
</li>
<li>
<span class="authors">Ines Klimann</span>
<span class="title">To Infinity and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.131">10.4230/LIPIcs.ICALP.2018.131</a>
</li>
<li>
<span class="authors">Sang-Ki Ko, Reino Niskanen, and Igor Potapov</span>
<span class="title">On the Identity Problem for the Special Linear Group and the Heisenberg Group</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.132">10.4230/LIPIcs.ICALP.2018.132</a>
</li>
<li>
<span class="authors">Dietrich Kuske and Nicole Schweikardt</span>
<span class="title">Gaifman Normal Forms for Counting Extensions of First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.133">10.4230/LIPIcs.ICALP.2018.133</a>
</li>
<li>
<span class="authors">Jérôme Leroux</span>
<span class="title">Polynomial Vector Addition Systems With States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.134">10.4230/LIPIcs.ICALP.2018.134</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Reducing CMSO Model Checking to Highly Connected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.135">10.4230/LIPIcs.ICALP.2018.135</a>
</li>
<li>
<span class="authors">Dirk Nowotka and Aleksi Saarela</span>
<span class="title">An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.136">10.4230/LIPIcs.ICALP.2018.136</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">Separating Without Any Ambiguity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.137">10.4230/LIPIcs.ICALP.2018.137</a>
</li>
<li>
<span class="authors">Mikhail Raskin</span>
<span class="title">A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.138">10.4230/LIPIcs.ICALP.2018.138</a>
</li>
<li>
<span class="authors">Géraud Sénizergues and Armin Weiß</span>
<span class="title">The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.139">10.4230/LIPIcs.ICALP.2018.139</a>
</li>
<li>
<span class="authors">Michal Skrzypczak</span>
<span class="title">Unambiguous Languages Exhaust the Index Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.140">10.4230/LIPIcs.ICALP.2018.140</a>
</li>
<li>
<span class="authors">Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy</span>
<span class="title">The Beta-Bernoulli process and algebraic effects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.141">10.4230/LIPIcs.ICALP.2018.141</a>
</li>
<li>
<span class="authors">Sarah Winter</span>
<span class="title">Uniformization Problems for Synchronizations of Automatic Relations on Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.142">10.4230/LIPIcs.ICALP.2018.142</a>
</li>
<li>
<span class="authors">Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, and Sebastian Wiederrecht</span>
<span class="title">Congestion-Free Rerouting of Flows on DAGs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.143">10.4230/LIPIcs.ICALP.2018.143</a>
</li>
<li>
<span class="authors">Megumi Ando, Anna Lysyanskaya, and Eli Upfal</span>
<span class="title">Practical and Provably Secure Onion Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.144">10.4230/LIPIcs.ICALP.2018.144</a>
</li>
<li>
<span class="authors">Boris Aronov, Gali Bar-On, and Matthew J. Katz</span>
<span class="title">Resolving SINR Queries in a Dynamic Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.145">10.4230/LIPIcs.ICALP.2018.145</a>
</li>
<li>
<span class="authors">Vittorio Bilò, Luca Moscardelli, and Cosimo Vinci</span>
<span class="title">Uniform Mixed Equilibria in Network Congestion Games with Link Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.146">10.4230/LIPIcs.ICALP.2018.146</a>
</li>
<li>
<span class="authors">Sébastien Bouchard, Yoann Dieudonné, and Anissa Lamani</span>
<span class="title">Byzantine Gathering in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.147">10.4230/LIPIcs.ICALP.2018.147</a>
</li>
<li>
<span class="authors">Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev</span>
<span class="title">Temporal Vertex Cover with a Sliding Time Window</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.148">10.4230/LIPIcs.ICALP.2018.148</a>
</li>
<li>
<span class="authors">Flavio Chierichetti and Shahrzad Haddadan</span>
<span class="title">On the Complexity of Sampling Vertices Uniformly from a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.149">10.4230/LIPIcs.ICALP.2018.149</a>
</li>
<li>
<span class="authors">George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, and Paul G. Spirakis</span>
<span class="title">The Price of Stability of Weighted Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.150">10.4230/LIPIcs.ICALP.2018.150</a>
</li>
<li>
<span class="authors">Riccardo Colini-Baldeschi, Max Klimm, and Marco Scarsini</span>
<span class="title">Demand-Independent Optimal Tolls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.151">10.4230/LIPIcs.ICALP.2018.151</a>
</li>
<li>
<span class="authors">Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Saeed Seddighin</span>
<span class="title">Greedy Algorithms for Online Survivable Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.152">10.4230/LIPIcs.ICALP.2018.152</a>
</li>
<li>
<span class="authors">Ofer Grossman, Bernhard Haeupler, and Sidhanth Mohanty</span>
<span class="title">Algorithms for Noisy Broadcast with Erasures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.153">10.4230/LIPIcs.ICALP.2018.153</a>
</li>
<li>
<span class="authors">Tobias Harks, Martin Hoefer, Anja Huber, and Manuel Surek</span>
<span class="title">Efficient Black-Box Reductions for Separable Cost Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.154">10.4230/LIPIcs.ICALP.2018.154</a>
</li>
<li>
<span class="authors">Thomas Kesselheim and Bojana Kodric</span>
<span class="title">Price of Anarchy for Mechanisms with Risk-Averse Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.155">10.4230/LIPIcs.ICALP.2018.155</a>
</li>
<li>
<span class="authors">Dariusz R. Kowalski and Miguel A. Mosteiro</span>
<span class="title">Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.156">10.4230/LIPIcs.ICALP.2018.156</a>
</li>
<li>
<span class="authors">Orna Kupferman and Gal Vardi</span>
<span class="title">The Unfortunate-Flow Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.157">10.4230/LIPIcs.ICALP.2018.157</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, and Tigran Tonoyan</span>
<span class="title">Spanning Trees With Edge Conflicts and Wireless Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.158">10.4230/LIPIcs.ICALP.2018.158</a>
</li>
<li>
<span class="authors">Frederik Mallmann-Trenn, Cameron Musco, and Christopher Musco</span>
<span class="title">Eigenvector Computation and Community Detection in Asynchronous Gossip Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.159">10.4230/LIPIcs.ICALP.2018.159</a>
</li>
<li>
<span class="authors">Merav Parter</span>
<span class="title">(Delta+1) Coloring in the Congested Clique Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.160">10.4230/LIPIcs.ICALP.2018.160</a>
</li>
<li>
<span class="authors">Sarvar Patel, Giuseppe Persiano, and Kevin Yeo</span>
<span class="title">CacheShuffle: A Family of Oblivious Shuffles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.161">10.4230/LIPIcs.ICALP.2018.161</a>
</li>
<li>
<span class="authors">MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, and Vahab Mirrokni</span>
<span class="title">Brief Announcement: MapReduce Algorithms for Massive Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.162">10.4230/LIPIcs.ICALP.2018.162</a>
</li>
<li>
<span class="authors">Ran Ben Basat, Gil Einziger, and Roy Friedman</span>
<span class="title">Brief Announcement: Give Me Some Slack: Efficient Network Measurements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.163">10.4230/LIPIcs.ICALP.2018.163</a>
</li>
<li>
<span class="authors">Eli Ben-Sasson and Eden Saig</span>
<span class="title">Brief Announcement: Towards an Abstract Model of User Retention Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.164">10.4230/LIPIcs.ICALP.2018.164</a>
</li>
<li>
<span class="authors">Shantanu Das, Dariusz Dereniowski, and Przemyslaw Uznanski</span>
<span class="title">Brief Announcement: Energy Constrained Depth First Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2018.165">10.4230/LIPIcs.ICALP.2018.165</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