LIPIcs, Volume 107, ICALP 2018

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