<h2>LIPIcs, Volume 55, ICALP 2016</h2>
<ul>
<li>
<span class="authors">Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi</span>
<span class="title">LIPIcs, Volume 55, ICALP'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016">10.4230/LIPIcs.ICALP.2016</a>
</li>
<li>
<span class="authors">Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi</span>
<span class="title">Front Matter, Table of Contents, Preface, Organization, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.0">10.4230/LIPIcs.ICALP.2016.0</a>
</li>
<li>
<span class="authors">Devavrat Shah</span>
<span class="title">Compute Choice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.1">10.4230/LIPIcs.ICALP.2016.1</a>
</li>
<li>
<span class="authors">Xavier Leroy</span>
<span class="title">Formally Verifying a Compiler: What Does It Mean, Exactly? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.2">10.4230/LIPIcs.ICALP.2016.2</a>
</li>
<li>
<span class="authors">Subhash Khot</span>
<span class="title">Hardness of Approximation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.3">10.4230/LIPIcs.ICALP.2016.3</a>
</li>
<li>
<span class="authors">Marta Z. Kwiatkowska</span>
<span class="title">Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.4">10.4230/LIPIcs.ICALP.2016.4</a>
</li>
<li>
<span class="authors">Mark de Berg, Kevin Buchin, Bart M. P. Jansen, and Gerhard Woeginger</span>
<span class="title">Fine-Grained Complexity Analysis of Two Classic TSP Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.5">10.4230/LIPIcs.ICALP.2016.5</a>
</li>
<li>
<span class="authors">Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, and Guy Kortsarz</span>
<span class="title">Bicovering: Covering Edges With Two Small Subsets of Vertices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.6">10.4230/LIPIcs.ICALP.2016.6</a>
</li>
<li>
<span class="authors">Chandra Chekuri, Alina Ene, and Marcin Pilipczuk</span>
<span class="title">Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.7">10.4230/LIPIcs.ICALP.2016.7</a>
</li>
<li>
<span class="authors">Martin Grohe</span>
<span class="title">Quasi-4-Connected Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.8">10.4230/LIPIcs.ICALP.2016.8</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Jesper Nederlof, and Tom C. van der Zanden</span>
<span class="title">Subexponential Time Algorithms for Embedding H-Minor Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.9">10.4230/LIPIcs.ICALP.2016.9</a>
</li>
<li>
<span class="authors">Stephane Durocher and Debajyoti Mondal</span>
<span class="title">Relating Graph Thickness to Planar Layers and Bend Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.10">10.4230/LIPIcs.ICALP.2016.10</a>
</li>
<li>
<span class="authors">Michael B. Cohen, Jelani Nelson, and David P. Woodruff</span>
<span class="title">Optimal Approximate Matrix Product in Terms of Stable Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.11">10.4230/LIPIcs.ICALP.2016.11</a>
</li>
<li>
<span class="authors">Tsuyoshi Ito and Stacey Jeffery</span>
<span class="title">Approximate Span Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.12">10.4230/LIPIcs.ICALP.2016.12</a>
</li>
<li>
<span class="authors">Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, and Seiichiro Tani</span>
<span class="title">Power of Quantum Computation with Few Clean Qubits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.13">10.4230/LIPIcs.ICALP.2016.13</a>
</li>
<li>
<span class="authors">Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, and Harumichi Nishimura</span>
<span class="title">Space-Efficient Error Reduction for Unitary Quantum Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.14">10.4230/LIPIcs.ICALP.2016.14</a>
</li>
<li>
<span class="authors">Itai Arad, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang</span>
<span class="title">Linear Time Algorithm for Quantum 2SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.15">10.4230/LIPIcs.ICALP.2016.15</a>
</li>
<li>
<span class="authors">Andrew M. Childs, Wim van Dam, Shih-Han Hung, and Igor E. Shparlinski</span>
<span class="title">Optimal Quantum Algorithm for Polynomial Interpolation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.16">10.4230/LIPIcs.ICALP.2016.16</a>
</li>
<li>
<span class="authors">Justin Thaler</span>
<span class="title">Lower Bounds for the Approximate Degree of Block-Composed Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.17">10.4230/LIPIcs.ICALP.2016.17</a>
</li>
<li>
<span class="authors">Zengfeng Huang and Pan Peng</span>
<span class="title">Dynamic Graph Stream Algorithms in o(n) Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.18">10.4230/LIPIcs.ICALP.2016.18</a>
</li>
<li>
<span class="authors">Vincent Cohen-Addad, Chris Schwiegelshohn, and Christian Sohler</span>
<span class="title">Diameter and k-Center in Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.19">10.4230/LIPIcs.ICALP.2016.19</a>
</li>
<li>
<span class="authors">Raphaël Clifford and Tatiana Starikovskaya</span>
<span class="title">Approximate Hamming Distance in a Stream</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.20">10.4230/LIPIcs.ICALP.2016.20</a>
</li>
<li>
<span class="authors">Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, and Saeed Seddighin</span>
<span class="title">Price of Competition and Dueling Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.21">10.4230/LIPIcs.ICALP.2016.21</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Popular Half-Integral Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.22">10.4230/LIPIcs.ICALP.2016.22</a>
</li>
<li>
<span class="authors">Meena Boppana, Rani Hod, Michael Mitzenmacher, and Tom Morgan</span>
<span class="title">Voronoi Choice Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.23">10.4230/LIPIcs.ICALP.2016.23</a>
</li>
<li>
<span class="authors">Aviv Adler, Constantinos Daskalakis, and Erik D. Demaine</span>
<span class="title">The Complexity of Hex and the Jordan Curve Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.24">10.4230/LIPIcs.ICALP.2016.24</a>
</li>
<li>
<span class="authors">Till Fluschnik, Danny Hermelin, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.25">10.4230/LIPIcs.ICALP.2016.25</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, and Saket Saurabh</span>
<span class="title">Kernelization of Cycle Packing with Relaxed Disjointness Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.26">10.4230/LIPIcs.ICALP.2016.26</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann and Dániel Marx</span>
<span class="title">The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.27">10.4230/LIPIcs.ICALP.2016.27</a>
</li>
<li>
<span class="authors">Dániel Marx and Valia Mitsou</span>
<span class="title">Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.28">10.4230/LIPIcs.ICALP.2016.28</a>
</li>
<li>
<span class="authors">Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, and Amit Sahai</span>
<span class="title">Do Distributed Differentially-Private Protocols Require Oblivious Transfer?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.29">10.4230/LIPIcs.ICALP.2016.29</a>
</li>
<li>
<span class="authors">Benoît Libert, Somindu C. Ramanna, and Moti Yung</span>
<span class="title">Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.30">10.4230/LIPIcs.ICALP.2016.30</a>
</li>
<li>
<span class="authors">Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, and Jalaj Upadhyay</span>
<span class="title">Block-Wise Non-Malleable Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.31">10.4230/LIPIcs.ICALP.2016.31</a>
</li>
<li>
<span class="authors">Richard J. Lipton, Rafail Ostrovsky, and Vassilis Zikas</span>
<span class="title">Provably Secure Virus Detection: Using The Observer Effect Against Malware</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.32">10.4230/LIPIcs.ICALP.2016.32</a>
</li>
<li>
<span class="authors">Neeraj Kayal, Chandan Saha, and Sébastien Tavenas</span>
<span class="title">An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.33">10.4230/LIPIcs.ICALP.2016.33</a>
</li>
<li>
<span class="authors">Joshua A. Grochow, Ketan D. Mulmuley, and Youming Qiao</span>
<span class="title">Boundaries of VP and VNP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.34">10.4230/LIPIcs.ICALP.2016.34</a>
</li>
<li>
<span class="authors">Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, and Ning Xie</span>
<span class="title">AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.35">10.4230/LIPIcs.ICALP.2016.35</a>
</li>
<li>
<span class="authors">Stephen Cook, Jeff Edmonds, Venkatesh Medabalimi, and Toniann Pitassi</span>
<span class="title">Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.36">10.4230/LIPIcs.ICALP.2016.36</a>
</li>
<li>
<span class="authors">Mark Bun and Justin Thaler</span>
<span class="title">Improved Bounds on the Sign-Rank of AC^0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.37">10.4230/LIPIcs.ICALP.2016.37</a>
</li>
<li>
<span class="authors">Avishay Tal</span>
<span class="title">On the Sensitivity Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.38">10.4230/LIPIcs.ICALP.2016.38</a>
</li>
<li>
<span class="authors">Jesper W. Mikkelsen</span>
<span class="title">Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.39">10.4230/LIPIcs.ICALP.2016.39</a>
</li>
<li>
<span class="authors">Noa Elad, Satyen Kale, and Joseph (Seffi) Naor</span>
<span class="title">Online Semidefinite Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.40">10.4230/LIPIcs.ICALP.2016.40</a>
</li>
<li>
<span class="authors">Sandy Heydrich and Rob van Stee</span>
<span class="title">Beating the Harmonic Lower Bound for Online Bin Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.41">10.4230/LIPIcs.ICALP.2016.41</a>
</li>
<li>
<span class="authors">Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, and Saeed Seddighin</span>
<span class="title">Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.42">10.4230/LIPIcs.ICALP.2016.42</a>
</li>
<li>
<span class="authors">Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, and Rotem Zach</span>
<span class="title">Carpooling in Social Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.43">10.4230/LIPIcs.ICALP.2016.43</a>
</li>
<li>
<span class="authors">Jaroslaw Blasiok and Jelani Nelson</span>
<span class="title">An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.44">10.4230/LIPIcs.ICALP.2016.44</a>
</li>
<li>
<span class="authors">Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Stefankovic</span>
<span class="title">Approximation via Correlation Decay When Strong Spatial Mixing Fails</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.45">10.4230/LIPIcs.ICALP.2016.45</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and Mark Jerrum</span>
<span class="title">A Complexity Trichotomy for Approximately Counting List H-Colourings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.46">10.4230/LIPIcs.ICALP.2016.46</a>
</li>
<li>
<span class="authors">Radu Curticapean</span>
<span class="title">Parity Separation: A Scientifically Proven Method for Permanent Weight Loss</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.47">10.4230/LIPIcs.ICALP.2016.47</a>
</li>
<li>
<span class="authors">Søren Dahlgaard</span>
<span class="title">On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.48">10.4230/LIPIcs.ICALP.2016.48</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis</span>
<span class="title">Incremental 2-Edge-Connectivity in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.49">10.4230/LIPIcs.ICALP.2016.49</a>
</li>
<li>
<span class="authors">Di Wang, Satish Rao, and Michael W. Mahoney</span>
<span class="title">Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.50">10.4230/LIPIcs.ICALP.2016.50</a>
</li>
<li>
<span class="authors">Thomas Dueholm Hansen and Uri Zwick</span>
<span class="title">Random-Edge Is Slower Than Random-Facet on Abstract Cubes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.51">10.4230/LIPIcs.ICALP.2016.51</a>
</li>
<li>
<span class="authors">Michael W. Mahoney, Satish Rao, Di Wang, and Peng Zhang</span>
<span class="title">Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.52">10.4230/LIPIcs.ICALP.2016.52</a>
</li>
<li>
<span class="authors">Zeyuan Allen-Zhu, Zhenyu Liao, and Yang Yuan</span>
<span class="title">Optimization Algorithms for Faster Computational Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.53">10.4230/LIPIcs.ICALP.2016.53</a>
</li>
<li>
<span class="authors">Jelena Marasevic, Clifford Stein, and Gil Zussman</span>
<span class="title">A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.54">10.4230/LIPIcs.ICALP.2016.54</a>
</li>
<li>
<span class="authors">Christian Sommer</span>
<span class="title">All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.55">10.4230/LIPIcs.ICALP.2016.55</a>
</li>
<li>
<span class="authors">Ilario Bonacina</span>
<span class="title">Total Space in Resolution Is at Least Width Squared</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.56">10.4230/LIPIcs.ICALP.2016.56</a>
</li>
<li>
<span class="authors">Christoph Berkholz and Jakob Nordström</span>
<span class="title">Supercritical Space-Width Trade-Offs for Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.57">10.4230/LIPIcs.ICALP.2016.57</a>
</li>
<li>
<span class="authors">Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, and R. Ryan Williams</span>
<span class="title">Deterministic Time-Space Trade-Offs for k-SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.58">10.4230/LIPIcs.ICALP.2016.58</a>
</li>
<li>
<span class="authors">Justin Thaler</span>
<span class="title">Semi-Streaming Algorithms for Annotated Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.59">10.4230/LIPIcs.ICALP.2016.59</a>
</li>
<li>
<span class="authors">Ben-David Shalev and Robin Kothari</span>
<span class="title">Randomized Query Complexity of Sabotaged and Composed Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.60">10.4230/LIPIcs.ICALP.2016.60</a>
</li>
<li>
<span class="authors">Mark Braverman, Ran Gelles, Jieming Mao, and Rafail Ostrovsky</span>
<span class="title">Coding for Interactive Communication Correcting Insertions and Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.61">10.4230/LIPIcs.ICALP.2016.61</a>
</li>
<li>
<span class="authors">Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, and David Richerby</span>
<span class="title">Amplifiers for the Moran Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.62">10.4230/LIPIcs.ICALP.2016.62</a>
</li>
<li>
<span class="authors">Ioannis Panageas and Nisheeth K. Vishnoi</span>
<span class="title">Mixing Time of Markov Chains, Dynamical Systems and Evolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.63">10.4230/LIPIcs.ICALP.2016.63</a>
</li>
<li>
<span class="authors">Jun Wan, Yu Xia, Liang Li, and Thomas Moscibroda</span>
<span class="title">Information Cascades on Arbitrary Topologies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.64">10.4230/LIPIcs.ICALP.2016.64</a>
</li>
<li>
<span class="authors">Samuel Hetterich</span>
<span class="title">Analysing Survey Propagation Guided Decimationon Random Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.65">10.4230/LIPIcs.ICALP.2016.65</a>
</li>
<li>
<span class="authors">Anupam Gupta, Guru Guruganesh, and Melanie Schmidt</span>
<span class="title">Approximation Algorithms for Aversion k-Clustering via Local k-Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.66">10.4230/LIPIcs.ICALP.2016.66</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty, Prachi Goyal, and Ravishankar Krishnaswamy</span>
<span class="title">The Non-Uniform k-Center Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.67">10.4230/LIPIcs.ICALP.2016.67</a>
</li>
<li>
<span class="authors">Maria-Florina Balcan, Nika Haghtalab, and Colin White</span>
<span class="title">k-Center Clustering Under Perturbation Resilience</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.68">10.4230/LIPIcs.ICALP.2016.68</a>
</li>
<li>
<span class="authors">Sara Ahmadian and Chaitanya Swamy</span>
<span class="title">Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.69">10.4230/LIPIcs.ICALP.2016.69</a>
</li>
<li>
<span class="authors">Frans Schalekamp, Anke van Zuylen, and Suzanne van der Ster</span>
<span class="title">A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.70">10.4230/LIPIcs.ICALP.2016.70</a>
</li>
<li>
<span class="authors">David Adjiashvili, Viktor Bindewald, and Dennis Michaels</span>
<span class="title">Robust Assignments via Ear Decompositions and Randomized Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.71">10.4230/LIPIcs.ICALP.2016.71</a>
</li>
<li>
<span class="authors">Klaus Jansen, Kim-Manuel Klein, and José Verschae</span>
<span class="title">Closing the Gap for Makespan Scheduling via Sparsification Techniques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.72">10.4230/LIPIcs.ICALP.2016.72</a>
</li>
<li>
<span class="authors">Gökalp Demirci and Shi Li</span>
<span class="title">Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.73">10.4230/LIPIcs.ICALP.2016.73</a>
</li>
<li>
<span class="authors">Bundit Laekhanukit</span>
<span class="title">Approximating Directed Steiner Problems via Tree Embedding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.74">10.4230/LIPIcs.ICALP.2016.74</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Yifeng Zhang</span>
<span class="title">Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.75">10.4230/LIPIcs.ICALP.2016.75</a>
</li>
<li>
<span class="authors">Shi Bai, Damien Stehlé, and Weiqiang Wen</span>
<span class="title">Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.76">10.4230/LIPIcs.ICALP.2016.76</a>
</li>
<li>
<span class="authors">Henry Yuen</span>
<span class="title">A Parallel Repetition Theorem for All Entangled Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.77">10.4230/LIPIcs.ICALP.2016.77</a>
</li>
<li>
<span class="authors">Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli</span>
<span class="title">Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.78">10.4230/LIPIcs.ICALP.2016.78</a>
</li>
<li>
<span class="authors">Jonah Brown-Cohen and Prasad Raghavendra</span>
<span class="title">Correlation Decay and Tractability of CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.79">10.4230/LIPIcs.ICALP.2016.79</a>
</li>
<li>
<span class="authors">Huck Bennett, Daniel Reichman, and Igor Shinkar</span>
<span class="title">On Percolation and NP-Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.80">10.4230/LIPIcs.ICALP.2016.80</a>
</li>
<li>
<span class="authors">Arturs Backurs, Nishanth Dikkala, and Christos Tzamos</span>
<span class="title">Tight Hardness Results for Maximum Weight Rectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.81">10.4230/LIPIcs.ICALP.2016.81</a>
</li>
<li>
<span class="authors">Kasper Green Larsen and Jelani Nelson</span>
<span class="title">The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.82">10.4230/LIPIcs.ICALP.2016.82</a>
</li>
<li>
<span class="authors">Alexandr Andoni, Assaf Naor, and Ofer Neiman</span>
<span class="title">Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.83">10.4230/LIPIcs.ICALP.2016.83</a>
</li>
<li>
<span class="authors">Yitong Yin</span>
<span class="title">Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.84">10.4230/LIPIcs.ICALP.2016.84</a>
</li>
<li>
<span class="authors">Facundo Mémoli, Anastasios Sidiropoulos, and Vijay Sridhar</span>
<span class="title">Quasimetric Embeddings and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.85">10.4230/LIPIcs.ICALP.2016.85</a>
</li>
<li>
<span class="authors">Mika Göös, Toniann Pitassi, and Thomas Watson</span>
<span class="title">The Landscape of Communication Complexity Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.86">10.4230/LIPIcs.ICALP.2016.86</a>
</li>
<li>
<span class="authors">Mark Braverman and Jon Schneider</span>
<span class="title">Information Complexity Is Computable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.87">10.4230/LIPIcs.ICALP.2016.87</a>
</li>
<li>
<span class="authors">Manoj M. Prabhakaran and Vinod M. Prabhakaran</span>
<span class="title">Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.88">10.4230/LIPIcs.ICALP.2016.88</a>
</li>
<li>
<span class="authors">Pavel Hrubes and Amir Yehudayoff</span>
<span class="title">On Isoperimetric Profiles and Computational Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.89">10.4230/LIPIcs.ICALP.2016.89</a>
</li>
<li>
<span class="authors">Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova</span>
<span class="title">Tolerant Testers of Image Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.90">10.4230/LIPIcs.ICALP.2016.90</a>
</li>
<li>
<span class="authors">Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin Varma</span>
<span class="title">Erasure-Resilient Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.91">10.4230/LIPIcs.ICALP.2016.91</a>
</li>
<li>
<span class="authors">Allan Grønlund and Kasper Green Larsen</span>
<span class="title">Towards Tight Lower Bounds for Range Reporting on the RAM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.92">10.4230/LIPIcs.ICALP.2016.92</a>
</li>
<li>
<span class="authors">Peyman Afshani and Jesper Sindahl Nielsen</span>
<span class="title">Data Structure Lower Bounds for Document Indexing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.93">10.4230/LIPIcs.ICALP.2016.93</a>
</li>
<li>
<span class="authors">Hubie Chen</span>
<span class="title">Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.94">10.4230/LIPIcs.ICALP.2016.94</a>
</li>
<li>
<span class="authors">Thomas Wilke</span>
<span class="title">Past, Present, and Infinite Future</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.95">10.4230/LIPIcs.ICALP.2016.95</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Thin MSO with a Probabilistic Path Quantifier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.96">10.4230/LIPIcs.ICALP.2016.96</a>
</li>
<li>
<span class="authors">Jean Goubault-Larrecq and Sylvain Schmitz</span>
<span class="title">Deciding Piecewise Testable Separability for Regular Tree Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.97">10.4230/LIPIcs.ICALP.2016.97</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee and Laurent Doyen</span>
<span class="title">Computation Tree Logic for Synchronization Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.98">10.4230/LIPIcs.ICALP.2016.98</a>
</li>
<li>
<span class="authors">Michal Skrzypczak and Igor Walukiewicz</span>
<span class="title">Deciding the Topological Complexity of Büchi Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.99">10.4230/LIPIcs.ICALP.2016.99</a>
</li>
<li>
<span class="authors">Ventsislav Chonev, Joël Ouaknine, and James Worrell</span>
<span class="title">On the Skolem Problem for Continuous Linear Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.100">10.4230/LIPIcs.ICALP.2016.100</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Pierre Carlier</span>
<span class="title">Analysing Decisive Stochastic Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.101">10.4230/LIPIcs.ICALP.2016.101</a>
</li>
<li>
<span class="authors">Daniel Gburek, Christel Baier, and Sascha Klüppelholz</span>
<span class="title">Composition of Stochastic Transition Systems Based on Spans and Couplings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.102">10.4230/LIPIcs.ICALP.2016.102</a>
</li>
<li>
<span class="authors">Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, and James Worrell</span>
<span class="title">On Restricted Nonnegative Matrix Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.103">10.4230/LIPIcs.ICALP.2016.103</a>
</li>
<li>
<span class="authors">Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, and James Worrell</span>
<span class="title">Proving the Herman-Protocol Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.104">10.4230/LIPIcs.ICALP.2016.104</a>
</li>
<li>
<span class="authors">Stefan Göller, Christoph Haase, Ranko Lazic, and Patrick Totzke</span>
<span class="title">A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.105">10.4230/LIPIcs.ICALP.2016.105</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan</span>
<span class="title">Reachability in Networks of Register Protocols under Stochastic Schedulers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.106">10.4230/LIPIcs.ICALP.2016.106</a>
</li>
<li>
<span class="authors">Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub</span>
<span class="title">A Program Logic for Union Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.107">10.4230/LIPIcs.ICALP.2016.107</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup</span>
<span class="title">The Decidable Properties of Subrecursive Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.108">10.4230/LIPIcs.ICALP.2016.108</a>
</li>
<li>
<span class="authors">Olivier Bournez, Daniel S. Graça, and Amaury Pouly</span>
<span class="title">Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.109">10.4230/LIPIcs.ICALP.2016.109</a>
</li>
<li>
<span class="authors">Mathieu Sablik and Michael Schraudner</span>
<span class="title">Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.110">10.4230/LIPIcs.ICALP.2016.110</a>
</li>
<li>
<span class="authors">Kazuyuki Asada and Naoki Kobayashi</span>
<span class="title">On Word and Frontier Languages of Unsafe Higher-Order Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.111">10.4230/LIPIcs.ICALP.2016.111</a>
</li>
<li>
<span class="authors">Mai Gehrke, Daniela Petrisan, and Luca Reggio</span>
<span class="title">The Schützenberger Product for Syntactic Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.112">10.4230/LIPIcs.ICALP.2016.112</a>
</li>
<li>
<span class="authors">Kohei Kishida</span>
<span class="title">Logic of Local Inference for Contextuality in Quantum Physics and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.113">10.4230/LIPIcs.ICALP.2016.113</a>
</li>
<li>
<span class="authors">Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis</span>
<span class="title">Minimizing Resources of Sweeping and Streaming String Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.114">10.4230/LIPIcs.ICALP.2016.114</a>
</li>
<li>
<span class="authors">Anaël Grandjean and Victor Poupet</span>
<span class="title">A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.115">10.4230/LIPIcs.ICALP.2016.115</a>
</li>
<li>
<span class="authors">Hellis Tamm</span>
<span class="title">New Interpretation and Generalization of the Kameda-Weiner Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.116">10.4230/LIPIcs.ICALP.2016.116</a>
</li>
<li>
<span class="authors">M. Praveen and B. Srivathsan</span>
<span class="title">Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.117">10.4230/LIPIcs.ICALP.2016.117</a>
</li>
<li>
<span class="authors">Laurent Feuilloley, Pierre Fraigniaud, and Juho Hirvonen</span>
<span class="title">A Hierarchy of Local Decision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.118">10.4230/LIPIcs.ICALP.2016.118</a>
</li>
<li>
<span class="authors">Manuel Bodirsky, Barnaby Martin, Michael Pinsker, and András Pongrácz</span>
<span class="title">Constraint Satisfaction Problems for Reducts of Homogeneous Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.119">10.4230/LIPIcs.ICALP.2016.119</a>
</li>
<li>
<span class="authors">Myrto Arapinis, Diego Figueira, and Marco Gaboardi</span>
<span class="title">Sensitivity of Counting Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.120">10.4230/LIPIcs.ICALP.2016.120</a>
</li>
<li>
<span class="authors">Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin</span>
<span class="title">The Complexity of Rational Synthesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.121">10.4230/LIPIcs.ICALP.2016.121</a>
</li>
<li>
<span class="authors">Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid</span>
<span class="title">On the Complexity of Grammar-Based Compression over Fixed Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.122">10.4230/LIPIcs.ICALP.2016.122</a>
</li>
<li>
<span class="authors">Georg Zetzsche</span>
<span class="title">The Complexity of Downward Closure Comparisons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.123">10.4230/LIPIcs.ICALP.2016.123</a>
</li>
<li>
<span class="authors">Gabriele Fici, Antonio Restivo, Manuel Silva, and Luca Q. Zamboni</span>
<span class="title">Anti-Powers in Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.124">10.4230/LIPIcs.ICALP.2016.124</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Ismaël Jecker, Christof Löding, and Sarah Winter</span>
<span class="title">On Equivalence and Uniformisation Problems for Finite Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.125">10.4230/LIPIcs.ICALP.2016.125</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Nathanaël Fijalkow</span>
<span class="title">The Bridge Between Regular Cost Functions and Omega-Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.126">10.4230/LIPIcs.ICALP.2016.126</a>
</li>
<li>
<span class="authors">Volker Diekert, Artur Jez, and Manfred Kufleitner</span>
<span class="title">Solutions of Word Equations Over Partially Commutative Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.127">10.4230/LIPIcs.ICALP.2016.127</a>
</li>
<li>
<span class="authors">Dmitry Chistikov and Christoph Haase</span>
<span class="title">The Taming of the Semi-Linear Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.128">10.4230/LIPIcs.ICALP.2016.128</a>
</li>
<li>
<span class="authors">Volker Diekert and Tobias Walter</span>
<span class="title">Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.129">10.4230/LIPIcs.ICALP.2016.129</a>
</li>
<li>
<span class="authors">Keerti Choudhary</span>
<span class="title">An Optimal Dual Fault Tolerant Reachability Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.130">10.4230/LIPIcs.ICALP.2016.130</a>
</li>
<li>
<span class="authors">Yun Kuen Cheung, Gramoz Goranci, and Monika Henzinger</span>
<span class="title">Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.131">10.4230/LIPIcs.ICALP.2016.131</a>
</li>
<li>
<span class="authors">Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, and Ely Porat</span>
<span class="title">Distance Labeling Schemes for Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.132">10.4230/LIPIcs.ICALP.2016.132</a>
</li>
<li>
<span class="authors">Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen</span>
<span class="title">Near Optimal Adjacency Labeling Schemes for Power-Law Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.133">10.4230/LIPIcs.ICALP.2016.133</a>
</li>
<li>
<span class="authors">Marco Chiesa, Andrei Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Shapira, and Scott Shenker</span>
<span class="title">On the Resiliency of Randomized Routing Against Multiple Edge Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.134">10.4230/LIPIcs.ICALP.2016.134</a>
</li>
<li>
<span class="authors">Prahladh Harsha, Rahul Jain, and Jaikumar Radhakrishnan</span>
<span class="title">Partition Bound Is Quadratically Tight for Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.135">10.4230/LIPIcs.ICALP.2016.135</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling</span>
<span class="title">Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.136">10.4230/LIPIcs.ICALP.2016.136</a>
</li>
<li>
<span class="authors">Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak</span>
<span class="title">Fast, Robust, Quantizable Approximate Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.137">10.4230/LIPIcs.ICALP.2016.137</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Calvin Newport</span>
<span class="title">Leader Election in Unreliable Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.138">10.4230/LIPIcs.ICALP.2016.138</a>
</li>
<li>
<span class="authors">Artur Czumaj and Peter Davies</span>
<span class="title">Faster Deterministic Communication in Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.139">10.4230/LIPIcs.ICALP.2016.139</a>
</li>
<li>
<span class="authors">Moshe Babaioff, Liad Blumrosen, and Noam Nisan</span>
<span class="title">Networks of Complements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.140">10.4230/LIPIcs.ICALP.2016.140</a>
</li>
<li>
<span class="authors">Piotr Krysta and Jinshan Zhang</span>
<span class="title">House Markets with Matroid and Knapsack Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.141">10.4230/LIPIcs.ICALP.2016.141</a>
</li>
<li>
<span class="authors">Gagan Goel, Stefano Leonardi, Vahab Mirrokni, Afshin Nikzad, and Renato Paes-Leme</span>
<span class="title">Reservation Exchange Markets for Internet Advertising</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.142">10.4230/LIPIcs.ICALP.2016.142</a>
</li>
<li>
<span class="authors">Sungjin Im, Janardhan Kulkarni, and Kamesh Munagala</span>
<span class="title">Competitive Analysis of Constrained Queueing Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.143">10.4230/LIPIcs.ICALP.2016.143</a>
</li>
<li>
<span class="authors">Colin Cooper and Nicolás Rivera</span>
<span class="title">The Linear Voting Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.144">10.4230/LIPIcs.ICALP.2016.144</a>
</li>
<li>
<span class="authors">Colin Cooper, Martin Dyer, Alan Frieze, and Nicolás Rivera</span>
<span class="title">Discordant Voting Processes on Finite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.145">10.4230/LIPIcs.ICALP.2016.145</a>
</li>
<li>
<span class="authors">Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, and Frederik Mallmann-Trenn</span>
<span class="title">Bounds on the Voter Model in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.146">10.4230/LIPIcs.ICALP.2016.146</a>
</li>
<li>
<span class="authors">Christoph Koch and Johannes Lengler</span>
<span class="title">Bootstrap Percolation on Geometric Inhomogeneous Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.147">10.4230/LIPIcs.ICALP.2016.147</a>
</li>
<li>
<span class="authors">Alessio Conte, Roberto Grossi, Andrea Marino, and Luca Versari</span>
<span class="title">Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.148">10.4230/LIPIcs.ICALP.2016.148</a>
</li>
<li>
<span class="authors">Kyriakos Axiotis and Dimitris Fotakis</span>
<span class="title">On the Size and the Approximability of Minimum Temporally Connected Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.149">10.4230/LIPIcs.ICALP.2016.149</a>
</li>
<li>
<span class="authors">Benjamin Doerr and Marvin Künnemann</span>
<span class="title">Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2016.150">10.4230/LIPIcs.ICALP.2016.150</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