8-12 July
2019

ICALP
2019
PROGRAM

Organized by

In Collaboration with

Contents
WELCOME.......................................................................................................................................................... 3
KEYNOTE SPEAKERS ........................................................................................................................................... 4
AWARD SESSION SPEAKERS............................................................................................................................... 6
SOCIAL DINNER .................................................................................................................................................. 8
DETAILED PROGRAMME .................................................................................................................................... 9
Monday 8 July 2019, Workshops Programme .............................................................................................. 9
Tuesday 9 July 2019..................................................................................................................................... 11
Wednesday 10 July 2019 ............................................................................................................................. 14
Thursday 11 July 2019 ................................................................................................................................. 17
Friday 12 July 2019 ...................................................................................................................................... 20
TRAVEL GUIDELINES ........................................................................................................................................ 22
Travelling to Patras ...................................................................................................................................... 22
Reaching Patras from Athens airport ...................................................................................................... 22
Reaching the Conference Venue ................................................................................................................. 23
From Patras Center.................................................................................................................................. 23
From Hotels near the Conference Venue ................................................................................................ 23
USEFUL INFORMATION.................................................................................................................................... 24
Phone numbers ........................................................................................................................................... 24
Health Insurance and Health Emergencies ................................................................................................. 24
Wifi at the Conference Site ......................................................................................................................... 24

2|PAGEWELCOME
Dear ICALP 2019 participant,
The International Colloquium on Automata, Languages and Programming (ICALP) is the main conference andannual meeting of the European Association for Theoretical Computer Science (EATCS). This international
conference was launched in 1972 and covers all aspects of theoretical computer science.
Traditionally ICALP’s scientific program is split into two tracks: Track A corresponds to Algorithms,
Complexity, and Games, and Track B to Automata, Logic, Semantics, and Theory of Programming. Since 2009,
Track C was introduced on Foundations of Networks and multi-agent systems: Models, Algorithms andInformation Management.
The 46th ICALP or ICALP 2019 is held at the Conference and Cultural Center of the University of Patras, Greeceon 8-12 July 2019. The congress is hosted by the University of Patras and its Department of Computer
Engineering and Informatics, and it is organized in cooperation with the European Association for TheoreticalComputer Science (EATCS).
The ICALP 2019 programme consists of 5 invited keynote talks, 4 keynote talks related to prestigious awards(EATCS Award, Presburger Award, Alonso Church Award), 5 best paper award talks, over 140 researchcontributions, and includes also the following thematic workshops that all take place on 8 July 2019:••••

Workshop on Theoretical Aspects of Fairness (WTAF 2019)
Parameterized Approximation Algorithms Workshop (PAAW 2019)
Workshop on Algorithmic Aspects of Temporal Graphs II
Logic and Computational Complexity Workshop (LCC 2019)

The University of Patras is the third largest university in Greece withrespect to the size of the student body, the staff, and the number of
departments. Together with its educational and research work, the richcampus life, the University of Patras attracts many candidate students
every year as their first and foremost choice for their Higher Education
studies. It includes 38 Departments organized in 9 Schools in almost allscientific domains, and has a high reputation in Medicine and in all https://www.upatras.gr/en
Engineering and Computer Science disciplines. The University of Patras has
about 50,000 Undergraduate and 4,000 Postgraduate students, more than
1100 Faculty members, about 300 Teaching and Technical staff, more than
2700 researchers, and about 800 administrative Personnel. The University
campus hosts in addition a number of research institutes as well as ascientific and technological park hosting various companies, all specializing
in innovative scientific & technological domains, including computer &information technology, communications, electrical engineering andelectronics, applied mathematics, pharmacology, biotechnologies,
chemical engineering, and sustainable development.
Patras, dubbed as Greece's Gate to the West, is a commercial hub, while
its busy port is a nodal point for trade and communication with Italy andthe rest of Western Europe. The city hosts also the Hellenic Open
University, thus overall contributing a large student population andrendering Patras a major scientific centre with a field of excellence intechnological education. The Rio-Antirrio bridge connects Patras'
easternmost suburb of Rio to the town of Antirrio, connecting the https://en.wikipedia.org/wiki/Patras
Peloponnese peninsula with mainland Greece.
Welcome to Patras. We wish you an exciting conference!
The ICALP 2019 Organizing Committee
3|PAGEKEYNOTE SPEAKERS

Michal Feldman
Tel-Aviv University, Israel
Auction Design under Interdependent Value
Keynote Lecture 1, Tuesday 9 July 2019 9am
We study combinatorial auctions with interdependent valuations. In such settings,
every agent has a private signal, and every agent has a valuation function that
depends on the private signals of all the agents. Interdependent valuations capture
settings where agents lack information to determine their own valuations. Examples
include auctions for artwork or oil drilling rights. For single item auctions andassume some restrictive conditions (the so-called single-crossing condition), fullwelfare can be achieved. However, in general, there are strong impossibility results
on welfare maximization in the interdependent setting. This is in contrast to settings
where agents are aware of their own valuations, where the optimal welfare canalways be obtained by an incentive compatible mechanism. Motivated by these
impossibility results, we study welfare maximization for interdependent valuations
through the lens of approximation. We introduce two valuation properties thatenable positive results. The first is a relaxed, parameterized version of single
crossing; the second is a submodularity condition over the signals. We obtain a hostof approximation guarantees under these two notions for various scenarios.

Mihalis Yannakakis
Columbia University,USA
Fixed point computation problems and facets of complexity
Keynote Lecture 2, Wednesday 10 July 2019 9am
Many problems from a wide variety of areas can be formulated mathematicallyas the problem of computing a fixed point of a suitable given multivariate function.
Examples include a variety of problems from game theory, economics,
optimization, stochastic analysis, verification, and others. In some problems there
is a unique fixed point (for example if the function is a contraction); in others there
may be multiple fixed points and any one of them is an acceptable solution; whilein other cases the desired object is a specific fixed point (for example the least fixed
point or greatest fixed point of a monotone function). In this talk we will discuss
several types of fixed point computation problems, their complexity, and some of
the common themes that have emerged: classes of problems for which there are
efficient algorithms, and other classes for which there seem to be serious
obstacles. My talk will be a survey of recent progress on the isomorphism and on
the similarity problem. I will focus on generic algorithmic strategies (as opposed
to algorithms tailored towards specific graph classes) that have proved to be
useful and interesting in various context, both theoretical and practical.
4|PAGE

Frits Vaandrager
Radboud University, The Netherlands
Automata Learning and Galois Connections
Keynote Lecture 3, Wednesday 10 July 2019 14.30pm
Automata learning is emerging as an effective technique for obtaining statemachine models of software and hardware systems. I will present an overview ofrecent work in which we used active automata learning to find standard violations
and security vulnerabilities in implementations of network protocols such as TCP
and SSH. Also, I will discuss applications of automata learning to support
refactoring of legacy control software and identifying job patterns in
manufacturing systems. As a guiding theme in my presentation, I will show how
Galois connections (adjunctions) help us to scale the application of learningalgorithms to practical problems.

Ola Svensson
EPFL, Switzerland
Approximately Good and Modern Matchings
Keynote Lecture 4, Thursday 11 July 2019 9am
The matching problem is one of our favorite benchmark problems. Work on it
has contributed to the development of many core concepts of computerscience, including the equation of efficiency with polynomial timecomputation in the groundbreaking work by Edmonds in 1965.However, halfa century later, we still do not have full understanding of the complexity of thematching problem in several models of computation such as parallel, online,
and streaming algorithms. In this talk we survey some of the major challenges
and report some recent progress. My talk will be a survey of recent progresson the isomorphism and on the similarity problem. I will focus on genericalgorithmic strategies (as opposed to algorithms tailored towards specificgraph classes) that have proved to be useful and interesting in various context,
both theoretical and practical.

5|PAGEMartin Grohe
RWTH Aachen, Germany
Symmetry and Similarity
Keynote Lecture 5, Friday 12 July 2019 9am
Deciding if two graphs are isomorphic, or equivalently, computing the symmetries
of a graph, is a fundamental algorithmic problem. It has many interesting
applications, and it is one of the few natural problems in the class NP whose
complexity status is still unresolved. Three years ago, Babai (STOC 2016) gave aquasi-polynomial time isomorphism algorithm. Despite of this breakthrough, thequestion for a polynomial algorithm remains wide open. Related to theisomorphism problem is the problem of determining the similarity between
graphs. Variations of this problems are known as robust graph isomorphism orgraph matching (the latter in the machine learning and computer vision
literature). This problem is significantly harder than the isomorphism problem,
both from a complexity theoretical and from a practical point of view, but for
many applications it is the more relevant problem.

AWARD SESSION SPEAKERS

Thomas A. Henzinger
Institute of Science and Technology, Austria
Model Checking Game Properties of Multi-Agent Systems
EATCS Award talk, Thursday 11 July 2019 16.45pm
At the 25th ICALP in Aalborg, Denmark, in 1998 I gave an invited lecture with thesame title. I will report on new developments and challenges in this area which
combine graph games used in model checking with concepts from algorithmic
game theory such as auctions and equilibria.

6|PAGE

Karl Bringmann
Max-Planck-Institut für Informatik
Fine-Grained Complexity of Dynamic Programming Problems
Presburger Award talk, Thursday 11 July 2019 17.30pm
Fine-grained complexity theory yields tight running-time lower bounds based onassumptions such as the Strong Exponential Time Hypothesis (SETH). Thisapproach was particularly successful for many textbook dynamic programming
problems, explaining long-standing lack of algorithmic progress. In this talk we
focus on a line of research that was triggered by a fine-grained lower bound for
the Frechet distance and resulted in tight bounds for many other classicalproblems, including sequence similarity problems such as edit distance andlongest common subsequence, as well as regular expression pattern matching,tree edit distance, and compressed string problems.

Kasper Green Larsen
Aarhus University, Denmark
A Quest Towards Strong Unconditional Lower Bounds EATCS Award talk,Presburger Award talk, Thursday 11 July 2019 17.55pm
One of the holy grails of theoretical computer science, is to prove strong
unconditional lower bounds on the time needed to solve computational problems
in realistic models of computation. Unfortunately we are very far from this goal inmost settings. One of the areas where we've been quiet succesful, is in proving
lower bounds for data structures and problems of a similar online flavour. In thistalk, I will survey the state-of-the-art results and techniques in data structure lower
bounds and the barriers we face in improving our techniques. Much of the focus will
be on my own contributions to this area, but also on recent progress in areas
outside of data structures where our techniques have found exciting applications.

Murdoch James Gabbay
Heriot-Watt University, UK
Nominal techniques, past and future
Alonso Church Award talk, Thursday 11 July 2019 18.20pm
It has been eighteen years since the 2001 journal paper which introduced nominal
techniques. What have we learned, and how can we apply these lessons to the
future? I will in brief overview describe the essence of nominal techniques as I
currently understand them -- and where we can go from here.
7|PAGESOCIAL DINNER
The ICALP 2019 social dinner will take place at the Omega Yachting Club, well known for its exquisite andunique cuisine, in a picturesque location by the sea with spectacular views at dusk, overlooking the Patras
gulf and the Charilaos Trikoupis fully suspended bridge.

Map 1: O'mega Yacht Club on the map

8|PAGEDETAILED PROGRAMME
Monday 8 July 2019, Workshops
Programme
WTAF 2019 – Room II.8

PAAW 2019 – Room II.9
Time
09:30 10:00
10:00 10:30
10:30 11:00
11:00 11:30
11:30 12:00
12:00 12:30
12:30 13:00
13:00 14:30
14:30 15:00

15:00 15:30
15:30 16:00
16:00 16:30
16:30 17:00
17:00 18:00

Talk
Andreas Emil Feldmann: Parameterized
Approximation Algorithms for Bidirected
Steiner Network Problems
Ljiljana Brankovic: Combining Two Worlds:
Parameterised Approximation for Vertex
Cover
Cornelius Brand: Extensor-Coding:Parameterized Approximation through
Abstract Algebraic Methods
Break
Jan Marcinkowski: Constant Factor FPT
Approximation for Capacitated k-Median
Jason Li: Tight FPT Approximations for kMedian and k-Means
Johannes Blum: Inapproximability of kCenter on Graphs of Low Skeleton
Dimension
Lunch
Bundit Laekhanukit: Independent Set,
Induced Matching, and Pricing: Connections
and Tight (Subexponential Time)
Approximation Hardnesses
Bingkai Lin: A Simple Gap-producing
Reduction for the Parameterized Set Cover
ProblemBreakLars Rohwedder: Empowering theConfiguration-IP - New PTAS Results for
Scheduling with Setup Times
Mingyu Xiao: New Results on Polynomial
Inapproximability and Fixed Parameter
Approximability of Edge Dominating Set

Time
08:45 –
09:00
09:00 –
10:00
10:00 –
10:30
10:30 –
11:00
11:00 –
11:30
11:30 –
12:00

12:00 –
12:30
12:30 –
13:45
13:45 –
14:45
14:45 –
15:00
15:00 –
15:30
15:30 –
16:00

Talk
Introduction
Vasilis Gkatzelis: Maximizing the Nash Social
Welfare: Incentives and Tractability (invited
talk)
Break
Session 1
Ioannis Caragiannis. Nikolai Gravin and Xin
Huang: Envy-freeness up to Any Item With HighNash welfare: The Virtue of Donating Items
Elad Aigner-Horev and Erel Segal-Halevi: Envyfree Matchings in Bipartite Graphs and their
Applications to Fair Division
Lee Cohen. Yishay Mansour and Zachary C.
Lipton: Efficient Candidate Screening under
Multiple Tests and Implications for Statistical
Discrimination
Fedor Sandomirskiy and Erel Segal-Halevi: Fair
Division with Minimal Sharing
Lunch
Vangelis Markakis: Approximate Relaxations of
Envy-Freeness (invited talk)BreakSession 2
Zbigniew Lonc and Miroslaw Truszczynski: On
Maximin Share Allocations on Cycles
Theofilos Triommatis and Aris Pagourtzis:
Approximate Counting of Semi-Fair Allocations
via #Knapsack Computations

Open problem session

9|PAGE

Time
9:309:55
9:5510:20

10:2010:45
10:4511:15
11:1511:40
11:4012:05
12:0512:30

12:3012:55

13:0014:30
14:3014:55
14:5515:20
15:2015:45
15:4516:10
16:1016:40
16:4017:05
17:0517:30
17:3017:55

Temporal Graphs II – Room I.4
Talk
Kitty Meeks: Optimising reachability byreordering
Argyrios Deligkas: On
minimizing/maximizing reachability sets
in temporal graphs by independent timedelaysChristos Zaroliagis: Multimodal dynamic
journey planning

9:009:10
9:1010:00

Break

10:0010:30
10:3010:55

Thomas Erlebach: A game of cops androbbers on graphs with periodic edgeconnectivity

10:5511:20

Arnaud Casteigts: A few sparsification
techniques preserving temporalconnectivity
Spyros Kontogiannis: Exploring earliestarrival paths in large-scale, timedependent networks via combinatorial
oraclesFrancesco Pasquale: Self-stabilizationand expansion of a simple dynamic
random graph model for Bitcoin-like
unstructured P2P networks
Lunch break
Malte Renken: Comparing temporalgraphs with time warping
Prithwish Basu: Clustering andsummarizing temporal graphs
Polina Rozenshtein: The networkuntangling problem: From interactions
to activity timelines
Zwi Lotker: The tale of two clocks

Break
Marco Piangerelli: TDA and Persistent
Homology: a new method for analysing
temporal graphs
Amitabh Trehan: Temporal evolution ofself-healing graphs
Nicola Santoro: On infinity, continuity,
regularity, and time-varying graphs

10 | P A G E

LCC 2019 – Room I.10
Talk
1st Session

Time
Opening

Daniel Leivant: Finite functions as data objects:
A new paradigm to complexity certification(invited talk)Break
Amirhossein Akbar Tabatabai:
Witnessing Games in Generalized Bounded
Arithmetic
Carlos Camino, Volker Diekert, Besik Dundua
and Mircea Marin: About a Conway-type result
for tree language

11:2011:40
11:4012:30
12:3513:00

Break
2nd Session
Thomas Zeume: Dynamic Descriptive
Complexity of Reachability (invited talk)
Eleni Bakali, Aggeliki Chalki and Aris Pagourtzis:
Descriptive complexity of classes of easy-todecide counting problems

13:0014:30

Lunch Break3rd Session

14:3015:20

Thomas Seiller: Semantics and complexity lower
bounds (invited talk)

15:2015:45

Le Thanh Dung Nguyen:
Logarithmic space queries and regulartransductions in the elementary affine lambdacalculus
Raheleh Jalali: Proof Complexity of Focused
Calculis

15:4516:10
16:1016:40

Break
4th Session

16:4017:30
17:3017:55
17:5518:00

Raamya: First order logic with least fixed point
operator (invited talk)Arved Friedemann, Jay Morgan: Using
Satisfiablity Solvers for Problems in Machine
Learning
ClosingTuesday 9 July 20198:00

Registration

8:45

Opening Address

9:00

Keynote Lecture 1: Michal Feldman (Tel-Aviv University, Israel)
Auction Design under Interdependent Value
Room: I.4, Session Chair: Paola Flocchini

10:00

Break
Track: A
Session A.1.1
Room: I.4
Chair: Jiri Sgall

Track: A
Session A.2.1
Room: I.10
Chair: Paul Spirakis

Track: A
Session A.3.1
Room: II.8
Chair: Leslie Goldberg

Track: B
Session B.1
Room: II.9
Chair: Christel Baier

10:30

Seffi Naor, Seeun William
Umboh and David
Williamson.
Tight Bounds for Online
Weighted Tree
Augmentation

Alexandr Andoni, Tal
Malkin and Negev Shekel
Nosatzki.
Two Party Distribution
Testing: Communicationand Security

Vladimir Kolmogorov.
Testing the complexity of avalued CSP language

Paul Bell.
Polynomially Ambiguous
Probabilistic Automata on
Restricted Languages

10:55

Anupam Gupta, Guru
Guruganesh, Binghui Pengand David Wajc.
Stochastic Online Metric
Matching

Angel Cantu, Austin
Luchsinger, Robert
Schweller and Tim Wylie.
Covert Computation in
Self-Assembled Circuits

Raimundo Briceño, Andrei
Bulatov, Victor Dalmau
and Benoit Larose.
Dismantlability,
connectedness, and mixing
in relational structures

Pablo Barcelo, Chih-Duo
Hong, Xuan-Bach Le,
Anthony W. Lin and Reino
Niskanen.
Monadic Decomposabilityof Regular Relations

11:20

Naveen Garg, Anupam
Gupta, Amit Kumar and
Sahil Singla.
Non-clairvoyant
Precedence Constrained
Scheduling

Zhiyi Huang and Xue Zhu.
Scalable and Jointly
Differentially Private
Packing

Miron Ficak, Marcin Kozik,
Miroslav Olšák and
Szymon Stankiewicz.
Dichotomy for symmetric
Boolean PCSPs

Paul Brunet and Alexandra
Silva.
A Kleene Theorem for
Nominal Automata

11:45

12:00

Break
Track: A
Session A.1.2
Room: I.4
Chair: Stefano Leonardi

Track: A
Session A.2.2
Room: I.10
Chair: Igor Carboni Oliveira

Track: A
Session A.3.2
Room: II.8
Chair: Kazuo Iwama

Track: B
Session B.2
Room: II.9
Chair: Volker Diekert

Sepehr Assadi and Shay
Solomon.
When Algorithms for
Maximal Independent Set
and Maximal Matching
Run in Sublinear TimeAlexander Golovnev, Rahul
Ilango, Russell Impagliazzo,
Valentine Kabanets,
Antonina Kolokolova andAvishay Tal.
AC^0[p] Lower Bounds
against MCSP via the Coin
ProblemAmir Abboud.
Fine-Grained Reductions
and Quantum Speedups
for Dynamic Programming

Katrin Casel, Joel Day,
Pamela Fleischmann,
Tomasz Kociumaka, Florin
Manea and Markus L.
Schmid.
Graph and String
Parameters: Connections
Between Pathwidth,

11 | P A G E

Cutwidth and the Locality
Number
12:25

Jannik Matuschke, Ulrike
Schmidt-Kraepelin and
José Verschae.
Maintaining Perfect
Matchings at Low Cost

Mahdi Cheraghchi,
Valentine Kabanets,
Zhenjian Lu and Dimitrios
Myrisiotis.
Circuit Lower Bounds for
MCSP from Local
Pseudorandom Generators

Alex Bredariol Grilo.
A simple protocol forverifiable delegation ofquantum computation in
one round

Martin Grohe and Sandra
Kiefer.
A Linear Upper Bound on
the Weisfeiler-Leman
Dimension of Graphs ofBounded Genus

12:50

Falko Hegerfeld andStefan Kratsch.
On adaptive algorithms
for maximum matching

Mrinal Kumar, Ramprasad
Saptharishi and Rafael
Oliveira.
Towards Optimal Depth
Reductions for
Syntactically Multilinear
Circuits

Yassine Hamoudi andFrederic Magniez.
Quantum Chebyshev's
Inequality and Applications

Anuj Dawar, Erich Grädel
and Wied Pakusa
Approximations of
Isomorphism and Logics
with Linear-Algebraic
Operators

13:15

Lunch
Track: A
Session A.1.3
Room: I.4
Chair: Sandeep Sen

Track: A
Session A.2.4
Room: I.10
Chair: Amir Abboud

Track: A
Session A.3.3
Room: II.8
Chair: Andreas Wiese

14:30

David P. Woodruff andGuang Yang.
Separating k-Player fromt-Player One-Way
Communication, with
Applications to Data
Streams

Thomas Watson.
Amplification with One NP
Oracle Query

Benjamin Moseley.
Scheduling to Approximate
Minimization Objectives on
Identical Machines

14:55

Graham Cormode,
Jacques Dark andChristian Konrad.
Independent Sets in
Vertex-Arrival Streams

Igor Carboni Oliveira.
Randomness andIntractability in
Kolmogorov Complexity

Siu-Wing Cheng andYuchen Mao.
Restricted Max-Min
Allocation: Approximation
and Integrality Gap

15:20

Amin Coja-Oghlan, Oliver
Gebhard, Maximilian
Hahn-Klimroth and Philipp
Loick.
Information-theoretic andalgorithmic thresholds forgroup testing

Dmitry Gavinsky, Troy Lee,
Miklos Santha andSwagato Sanyal.
A composition theorem for
randomized querycomplexity via max-conflictcomplexity

Kyriakos Axiotis andChristos Tzamos.
Capacitated Dynamic
Programming: Faster
Knapsack and Graph
Algorithms

15:45

Talya Eden, Dana Ron andWill Rosenbaum.
The Arboricity Captures
the Complexity ofSampling Edges

Yuval Filmus, Lianna
Hambardzumyan, Hamed
Hatami, Pooya Hatami andDavid Zuckerman.
Biasing Boolean Functions
and Collective CoinFlipping Protocols over
Arbitrary ProductDistributions

Ce Jin.
An Improved FPTAS for 0-1
Knapsack

12 | P A G E

16:10
Break
Track: A
Session A.1.4
Room: I.4
Chair: Artur Czumaj

Track: A
Session A.2.4
Room: I.10
Chair: Thomas Erlebach

Track: A
Session A.3.4
Room: II.8
Chair: Kazuo Iwama

Track: A
Session A.4.1
Room: II.9
Chair: Sandeep Sen

16:40

Venkatesan Guruswami,
Lingfei Jin and Chaoping
Xing.
Constructions ofmaximally recoverable
local reconstruction codes
via function fields

Klaus Jansen and Lars
Rohwedder.
Local search breaks 1.75
for Graph Balancing

Srinivasan Arunachalam,
Sourav Chakraborty, Troy
Lee, Manaswi Paraashar
and Ronald de Wolf.
Two new results about
quantum exact learning

Mikkel Thorup, Or Zamir
and Uri Zwick.
Dynamic ordered sets withapproximate queries,
approximate heaps and soft
heaps

17:05

Chaoping Xing and Chen
Yuan.
Construction of optimal
locally recoverable codesand connection withhypergraphMina Dalirrooyfard,
Virginia Vassilevska
Williams, Nikhil Vyas andNicole Wein.
Tight Approximation
Algorithms for Bichromatic
Graph Diameter andRelated Problems

Scott Aaronson, Alexandru
Cojocaru, Alexandru
Gheorghiu and Elham
Kashefi.
Complexity-theoretic
limitations on blinddelegated quantum
computation

Bertie Ancona, Monika
Henzinger, Liam Roditty,
Virginia Vassilevska
Williams and Nicole Wein.
Algorithms and Hardnessfor Diameter in Dynamic
Graphs

17:30

Andrii Riazanov andVenkatesan Guruswami.
Beating Fredman-Komlós
for perfect k-hashing

Mina Dalirrooyfard,
Virginia Vassilevska
Williams, Nikhil Vyas,
Nicole Wein, Yinzhan Xu
and Yuancheng Yu.
Approximation Algorithms
for Min-Distance Problems

Shantanav Chakraborty,
András Gilyén and Stacey
Jeffery.
The power of blockencoded matrix powers:
improved regression
techniques via faster
Hamiltonian simulation

Eden Chlamtac, Michael
Dinitz and Thomas
Robinson.
The Norms of Graph
Spanners

17:55

Kuan Cheng, ZhengzhongJin, Xin Li and Ke Wu.
Block Edit Errors withTranspositions.
Deterministic Document
Exchange Protocols andAlmost Optimal Binary
Codes

Akbar Rafiey, Arash Rafiey
and Thiago Santos.
Toward a Dichotomy for
Approximation of Hcoloring

Fernando G.S.L. Brandao,
Amir Kalev, Tongyang Li,
Cedric Yen-Yu Lin, Krysta
M.Svore and Xiaodi Wu.
Quantum SDP Solvers.
Large Speed-ups,
Optimality, andApplications to Quantum
Learning

Yair Bartal, Nova Fandina
and Ofer Neiman.
Covering Metric Spaces by
Few Trees

18:20
Break
18:30
Welcome Reception

20:30

13 | P A G E

Wednesday 10 July 2019
9:00

Keynote Lecture 2: Mihalis Yannakakis (Co lumbia University, USA)
Fixed point computation problems and facets of complexity
Room: I.4, Session Chair: Paul Spirakis

10:00

Break
Track: A
Session A.1.5
Room: I.4
Chair: Benjamin Moseley

Track: A
Session A.2.5
Room: I.10
Chair: Lefteris Kirousis

Track: B
Session B.3
Room: II.9
Chair: Florin Manea

Track: C
Session C.1
Room: II.8
Chair: Evangelos Kranakis

10:30

Eyal Mizrachi, Roy
Schwartz, Joachim
Spoerhase and Sumedha
Uniyal.
A Tight Approximation for
Submodular Maximization
with Mixed Packing and
Covering Constraints

Tobias Friedrich and Ralf
Rothenberger.
The Satisfiability Thresholdfor Non-Uniform Random
2-SAT

Titouan Carette,
Emmanuel Jeandel, Simon
Perdrix and Renaud
Vilmart.
Completeness of Graphical
Languages for Mixed
States Quantum
Mechanics

Arnaud Casteigts, JosephPeters and Jason Schoeters.
Temporal Cliques Admit
Sparse Spanners

10:55

Alina Ene and Huy
Nguyen.
A Nearly-linear Time
Algorithm for Submodular
Maximization with a
Knapsack Constraint

Thomas Sauerwald andLuca Zanetti.
Random Walks on
Dynamic Graphs: Mixing
Times, Hitting Times, andReturn Probabilities

Henning Urbat and Stefan
Milius.
Varieties of Data
Languages

Matthias Bonne and Keren
Censor-Hillel.
Distributed Detection ofCliques in Dynamic
Networks

11:20

Alina Ene and Huy
Nguyen.
Towards Nearly-linear
Time Algorithms for
Submodular Maximization
with a Matroid Constraint

Matija Pasch andKonstantinos Panagiotou.
Satisfiability Thresholds forRegular Occupation
Problems

Ugo Dal Lago, Francesco
Gavazzo and Akira
Yoshimizu.
Differential Logical
Relations

Dariusz Kowalski and Miguel
A. Mosteiro.
Polynomial Anonymous
Dynamic Distributed
Computing without a
Unique Leader

11:45

12:00

Break
Track: A
Session A.1.6
Room: I.4
Chair: Ioannis Caragiannis

Track: A
Session A.2.6
Room: I.10
Chair: Giuseppe Italiano

Track: B
Session B.4
Room: II.9
Chair: Erich Gradel

Track: C
Session C.2
Room: II.8
Chair: Arnaud Casteigts

Fedor Fomin, Petr
Golovach, Daniel
Lokshtanov, Saket
Saurabh and Meirav
Zehavi.
Covering Vectors bySpaces in Perturbed
Graphic Matroids andTheir Duals

Massimo Equi, Roberto
Grossi, Veli Mäkinen andAlexandru I. Tomescu.
On the Complexity ofString Matching for Graphs

Thomas Place and Marc
Zeitoun.
On all things star-freeThomas Erlebach, Frank
Kammer, Kelin Luo, Andrej
Sajenko and Jakob Spooner.
Two Moves per Time Step
Make a Difference

14 | P A G E

12:25

Akanksha Agrawal, Fedor
Fomin, Daniel Lokshtanov,
Saket Saurabh andPrafullkumar Tale.
Path Contraction Fasterthan 2^nGiulia Bernardini, Pawel
Gawrychowski, Nadia
Pisanti, Solon Pissis andGiovanna Rosone.
Even Faster ElasticDegenerate String
Matching via Fast Matrix
Multiplication

Antonio Molina Lovett andJeffrey Shallit.
Optimal Regular
Expressions for
Permutations

Eleni C. Akrida, George
Mertzios, Sotiris
Nikoletseas, Christoforos
Raptopoulos, Paul Spirakis
and Viktor Zamaraev.
How fast can we reach atarget vertex in stochastic
temporal graphs?

12:50

Fedor Fomin, Daniel
Lokshtanov, Fahad
Panolan, Saket Saurabh
and Meirav Zehavi.
Decomposition of Map
Graphs with Applications

William Kuszmaul.
Dynamic Time Warping inStrongly Subquadratic
Time: Algorithms for the
LowDistance Regime andApproximate Evaluation

Mohamed-Amine Baazizi,
Dario Colazzo, Giorgio
Ghelli and Carlo Sartiani.
A Type System forInteractive JSON Schema
InferenceFrederik Mallmann-Trenn,
Yannic Maus and Dominik
Pajak.
Noidy Conmunixatipn: On
the Convergence of the
Averaging Population
Protocol

13:15

Lunch
14:30

Keynote Lecture 3: Frits Vaandrager (Radboud University, Netherlands)
Automata Learning and Galois Connections
Room: I.4, Session Chair: Christel Baier

15:30
Break
Track: A
Session A.1.7
Room: I.4
Chair: Aris
Anagnostopoulos

Track: A
Session A.2.7
Room: I.10
Chair: Paul Spirakis

Track: B
Session B.5
Room: II.9
Chair: Anca Muscholl

Track: C
Session C.3
Room: II.8
Chair: Jukka Suomela

15:45

Vincent Cohen-Addad,
Anupam Gupta, Amit
Kumar, Euiwoong Lee andJason Li.
Tight FPT Approximationsfor k-Median and k-Means

Pavel Hrube,
Sivaramakrishnan
Natarajan Ramamoorthy,
Anup Rao and Amir
Yehudayoff.
Lower Bounds on
Balancing Sets and Depth2 Threshold Circuits

Dani Dorfman, Haim
Kaplan and Uri Zwick.
A Faster Deterministic
Exponential Time
Algorithm for Energy
Games and Mean Payoff
Games

Argyrios Deligkas, John
Fearnley, Themistoklis
Melissourgos and Paul
Spirakis.
Computing Exact Solutionsof Consensus Halving and
the Borsuk-Ulam Theorem

16:10

Vincent Cohen-Addad andJason Li.
On the Fixed-Parameter
Tractability of Capacitated
Clustering.

Peyman Afshani, Casper
Benjamin Freksen, Lior
Kamma and Kasper Green
Larsen.
Lower Bounds forMultiplication via Network
CodingKousha Etessami, EmanuelMartinov, Alistair Stewart
and Mihalis Yannakakis.
Reachability for Branching
Concurrent Stochastic
Games

Sungjin Im, Benjamin
Moseley, Kirk Pruhs andManish Purohit.
Matroid Coflow Scheduling

16:35

Pranjal Awasthi, Ainesh
Bakshi, Maria-Florina
Balcan, Colin White andDavid P.Woodruff.
Robust CommunicationOptimal Distributed
Clustering

Ian Mertz, Toniann Pitassi
and Yuanhao Wei.
Short Proofs are Hard to
Find

Bader Abu Radi and Orna
Kupferman.
Minimizing GFG TransitionBased Automata

15 | P A G E

17:00
Break
17:15

Special issue of TCS on M. Nivat
Room: I.4
Chair: Paul Spirakis

17:45
EATCS General Assembly
Room: I.4
20:00
Cocktail

16 | P A G EThursday 11 July 2019
9:00

Keynote Lecture 4: Ola Svensson (EPFL, Switzerland)
Approximately Good and Modern Matchings
Room: I.4, Session Chair: Stefano Leonardi

10:00

Break
Track: A
Session A.1.8
Room: I.4
Chair: Josep Diaz

Track: A
Session A.2.8
Room: I.10
Chair: Karl Bringmann

Track: B
Session B.6
Room: II.9
Chair: Martin Grohe

Track: C
Session C.4
Room: II.8
Chair: Jukka Suomela

10:30

Andreas Björklund, Daniel
Lokshtanov, Saket
Saurabh and Meirav
Zehavi.
Approximate Counting of
k-Paths: Deterministic andin Polynomial Space

Mikkel Abrahamsen, Panos
Giannopoulos, Maarten
Löffler and Günter Rote.
Geometric Multicut

Pablo Barceló, Diego
Figueira and MiguelRomero Orth.
Boundedness ofConjunctive Regular Path
Queries

Christian Scheideler andAlexander Setzer.
On the Complexity of Local
Graph Transformations

10:55

Andreas Björklund and
Ryan Williams.
Computing permanents
and counting Hamiltonian
cycles by listing dissimilar
vectors

Jérémie Chalopin, Victor
Chepoi, Shay Moran and
Manfred K. Warmuth.
Unlabeled sample
compression schemes andcorner peelings for ample
and maximum classes

Le Thanh Dung Nguyen
and Pierre Pradic.
From Normal Functors to
Logarithmic Space Queries

Siddharth Gupta, Adrian
Kosowski and Laurent
Viennot.
Exploiting Hopsets:
Improved Distance Oracles
for Graphs of Constant
Highway Dimension and
Beyond

11:20

Ivona Bezakova, Andreas
Galanis, Leslie Ann
Goldberg and Daniel
Stefankovic.
The complexity of
approximating thematching polynomial in
the complex plane

Nabil Mustafa.
Computing Optimal
Epsilon-nets is as Easy as
Finding an Unhit Set

Holger Dell, Marc Roth andPhilip Wellnitz.
Counting Answers to
Existential Questions

Mohsen Ghaffari and Ali
Sayyadi.
Distributed ArboricityDependent Graph Coloring
via All-to-All
Communication

11:45

12:00

Break
Track: A
Session A.1.9
Room: I.4
Chair: Andreas Wiese

Track: A
Session A.2.9
Room: I.10
Chair: Stefano Leonardi

Track: B
Session B.7
Room: II.9
Chair: Marc Zeitoun

Track: C
Session C.5
Room: II.8
Chair: Joseph Peters

Klaus Jansen, Alexandra
Lassota and Lars
Rohwedder.
Near-Linear Time
Algorithm for n-fold ILPs
via Color Coding

John Fearnley, Spencer
Gordon, Ruta Mehta andRahul Savani.
Unique End of Potential
Line

Jean-Eric Pin andChristophe Reutenauer.
A Mahler’s theorem forword functions

Amos Korman and Yoav
Rodeh.
Multi-Round Cooperative
Search Games with Multiple
Players

17 | P A G E

12:25Arturo Merino and JoseSoto.
The minimum cost query
problem on matroids withuncertainty areas

Paul Goldberg andAlexandros Hollender.
The Hairy Ball Problem is
PPAD-complete

Matthieu Picantin.
Automatic semigroups vs
automaton semigroups

Ioannis Caragiannis andAngelo Fanelli.
On approximate pure Nashequilibria in weighted
congestion game withpolynomial latencies

12:50

Adam Kurpisz.
Sum-of-Squares bounds
via boolean function
analysis

Josep Díaz, Lefteris
Kirousis, Sofia Kokonezi
and John Livieratos.
Algorithmically Efficient
Syntactic Characterizationof Possibility Domains

Murray Elder and Laura
Ciobanu.
Solutions sets to systems ofequations in hyperbolic
groups are EDT0L in
PSPACE

Daniel Schmand, Marc
Schroder and Alexander
Skopalik.
Network Investment Games
with Wardrop Followers

13:15

Lunch

Track: A
Session A.1.10
Room: I.4
Chair: Shay Solomon

Track: A
Session A.2.10
Room: I.10
Chair: Karl Bringmann

Track: B
Session B.8
Room: II.9
Chair: Jean-Eric Pin

Track: C
Session C.6
Room: II.8
Chair: Ioannis Caragiannis

14:30

Ran Duan, Ce Jin andHongxun Wu.
Faster Algorithms for All
Pairs Nondecreasing Paths
ProblemJulian Dörfler, ChristianIkenmeyer and Greta
Panova.
On geometric complexity
theory: Multiplicity
obstructions are stronger
than occurrence
obstructions

Anca Muscholl andGabriele Puppis.
Equivalence of FiniteValued Streaming String
Transducers is Decidable

Ilan Cohen, Jakubcki,
Stefano Leonardi and Aris
Anagnostopoulos.
Stochastic Graph
exploration

14:55

Guillaume Ducoffe.
Faster approximation
algorithms for computing
shortest cycles onweighted graphs

Andreas Björklund, Petteri
Kaski and Ryan Williams.
Solving systems ofpolynomial equations by aparity-counting selfreduction

Mikolaj Bojanczyk, Sandra
Kiefer and Nathan Lhote.
String-to-stringinterpretations withpolynomial size output

Shunhao Oh, Anuja Meetoo
Appavoo and Seth Gilbert.
Periodic Bandits andWireless Network Selection

15:20

Amir Abboud, Loukas
Georgiadis, Giuseppe
F.Italiano, Robert
Krauthgamer, Nikos
Parotsidis, Ohad Trabelsi,
Przemysław Uznanski andDaniel Wolleb-Graf.
Faster Algorithms for AllPairs Bounded Min-Cuts

Thomas Colcombet, JoëlOuaknine, Pavel Semukhin
and James Worrell.
On reachability problems
for low dimensional matrix
semigroups

Pierre-Alain Reynier andDidier Villevalois.
Sequentiality of String-toContext Transducers

15:45

Alexandr Andoni, Clifford
Stein and Peilin Zhong.
Log Diameter Rounds
Algorithms for 2-Vertex
and 2-Edge Connectivity

Ankit Garg, Nikhil Gupta,
Neeraj Kayal and Chandan
Saha.
Determinant equivalence
test over finite fields andover Q

Martin Raszyk, David Basinand Dmitriy Traytel.
From Nondeterministic to
Multi-Head Deterministic
Finite-State Transducers

18 | P A G E

16:10

Break
Awards Session
Chair: Paul Spirakis
Room: I.4
16:30

ICALP Best paper awards
Appointment of EATCS Fellows
Fedor Fomin, Rocco de Nicola, Dana Ron
EATCS Distinguished Dissertation Awards
Arturs Backurs, Robert Robere, Sepehr Assadi
16:45

EATCS Award
Thomas A. Henzinger
Model Checking Game Properties of Multi -Agent Systems
17:30

Presburger Award
Karl Bringmann
Fine-Grained Complexity of Dynamic Programming Problems
17:55

Presburger Award
Kasper Green Larsen
A Quest Towards Strong Unconditional Lower Bounds

18:20

Alonso Church Award
Murdoch J. Gabbay and Andrew M. Pitts
Nominal techniques, past and future
18:45

End of Awards Session

20:30

Conference Dinner

19 | P A G E

Friday 12 July 2019
9:00

Keynote Lecture 5: Martin Grohe (RWTH Aachen University, Germany)
Symmetry and Similarity
Room: I.4, Session Chair: Anca Muscholl

10:00

Break
Track: A
Session A.1.11
Room: I.4
Chair: Christos Zaroliagis

Track: A
Session A.2.11
Room: I.10
Chair: Ioannis Caragiannis

Track: B
Session B.9
Room: II.9
Chair: Mikolaj Bojanczyk

Track: C
Session C.1
Room: II.8
Chair: Euripides Markou

10:30

Noga Alon, Shiri Chechik
and Sarel Cohen.
Deterministic
Combinatorial
Replacement Paths andDistance Sensitivity
Oracles

Xiaoming Sun, David P.
Woodruff, Guang Yang andJialin Zhang.
Querying a Matrix throughMatrix-Vector Products

Mehran Hosseini, Joel
Ouaknine and James
Worrell.
On Termination of Integer
Linear Loops

Stefan Dobrev, Lata
Narayanan, Jaroslav
Opatrny and Denis
Pankratov.
Exploration of HighDimensional Grids by Finite
Automata

10:55

Therese Biedl and Philipp
Kindermann.
Finding Tutte paths inlinear timeMark Bun, Nikhil Mandeand Justin Thaler.
Sign-Rank Can Increase
Under Intersection

Stefan Kiefer, Richard
Mayr, Mahsa
Shirmohammadi and
Patrick Totzke.
Büchi Objectives inCountable MDPs

Yuval Emek, Shay Kutten,
Ron Lavi and William K.
Moses Jr.
Deterministic Leader
Election in Programmable
Matter

11:20

Samuel Haney, Mehraneh
Liaee, Bruce M.Maggs,
Rajmohan Rajaraman,
Debmalya Panigrahi andRavi Sundaram.
Retracting Graphs to
CyclesArkadev Chattopadhyay,
Yuval Filmus, Sajin Koroth,
Or Meir and Toniann
Pitassi.
Query-to-communication
lifting for BPP using innerproduct

Sylvain Schmitz.
The Parametric Complexityof Lossy Counter Machines

Bernhard Haeupler, FabianKuhn, Anders Martinsson,
Kalina Petrova and Pascal
Pfister.
Optimal Strategies forPatrolling Fences

11:45

Merav Parter and Eylon
Yogev.
Optimal Short Cycle
Decomposition in Almost
Linear Time

Xue Chen and Eric Price.
Estimating the frequency
of a clustered signal

Nikhil Balaji, Stefan Kiefer,
Petr Novotný, Guillermo A.
Pérez and Mahsa
Shirmohammadi.
On the Complexity of Value
Iteration

Jurek Czyzowicz,
Konstantinos Georgiou,
Ryan Killick, Evangelos
Kranakis, Danny Krizanc,
Lata Narayanan, ManuelLafond, Jaroslav Opatrny
and Sunil Shende.
Energy Consumption ofGroup Search on a Line

12:10

12:30

Break
Best paper Track A
Room: I.4, Chair: Stefano Leonardi
Bingkai Lin.
A Simple Gap-producing Reduction for the Parameterized Set Cover Problem

20 | P A G E

12:55

Best student paper Track A
Room: I.4, Chair: Stefano Leonardi
Joran van Apeldoorn and Andras Gilyen.
Improvements in Quantum SDP-Solving with Applications

13:20
Lunch

14:30

Best paper Track B
Room: I.4, Chair: Christel Baier
Christof Löding and Anton Pirogov.
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp

14:55

Best student paper Track B
Room: I.4, Chair: Christel BaierMarie Fortin.
FO = FO3 for linear orders with monotone binary relations

15:20

Best paper Track C
Room: I.4, Chair: Paola Flocchini
Keren Censor-Hillel and Mikaël Rabie.
Distributed Reconfiguration of Maximal Independent Sets

15:45

ICALP 2019 Epilogue
Room: I.4

15:50

The on-line version of the conference schedule is available at the following URL (one may also follow thecorresponding QR code):

https://icalp2019.upatras.gr/calendar.php

21 | P A G E

TRAVEL GUIDELINES
Travelling to Patras
By SeaThere are direct overnight trips via ferries departing from Italy (ports of Ancona, Bari, Brindisi or Trieste). Forschedule and prices look at the websites of Anek Lines, Minoan Lines, and Superfast Ferries.
By Plane
From Araxos airport which is located 50 Km West of Patras and it is served by several airline companies(e.g.,Ryanair, LTU, TUIfly, SkyExpress, etc), especially in the period May to October. From Araxos, you canreach Patras either by bus, or by taxi (approx. 40-50 Euros).
From Athens International Airport "Eleftherios Venizelos" which is located 250 Km East of Patras. There areregular flights connecting Athens to most European cities.

Reaching Patras from Athens airport
By CarSeveral car rental agencies operate on the airport. The new “Attiki Odos” high-speed toll motorway connects
the airport with Athens and the main greek highways. Leave the airport following initially the signs to ATHINA
and then to ELEFSINA to enter “Attiki Odos”. From that point on just stay on the highway following the signs
to ELEFSINA, subsequenty to KORINTHOS, and finally to PATRA. After Korinthos, the highway splits into two
and you must follow the right way (there are signs to PATRA). The total distance between Athens airport andPatras is about 250km. To reach Patras, take the exit “PATRA-CENTRE / PORT”, and then follow the signs to“Port” (ΛΙΜΑΝΙ).
By Train
The “Proastiakos” (suburban) railway, operated by “Trainose”, connects Athens airport to the railway
network of the rest of Greece operated by the “OSE” company. You can take the train from the airport withdirection to Piraeus port and then change at railway station «Kato Acharnai» to line Piraeus – Athens – Kiato
with direction to Kiato. At the Kiato station passengers, with final destination Patras, transfer to buses serving
the Kiato-Patras line. Trainose bus replacement service operates between Kiato and Patras (and vice versa)
due to ongoing infrastructure works on the railway line between those two stations. Tickets can be purchased
through the Trainose web application https://tickets.trainose.gr/ (by selecting a specific train and thenclicking on the "Seat selection and passengers" button) or through Android/iOS applications.
By BusThe “KTEL Achaias” intercity bus company has regular buses to Patras. You must first get to the Kifisos Bus
Station. You can get there from the airport, either by taxi or by taking the X93 express bus (24-hour service,
7 days per week) that departs just outside the airport terminal at the Arrival level. The bus stop is next toArrival Exit 5. You can buy ticket on the bus. Either way it takes about 60 min to get there, and the bus runs
approximately every 30 minutes 24 hours a day, seven days a week. Kifisos Bus Station is the last stop of X93.

22 | P A G E

From Kifisos Bus Station there is a bus to Patra almost every 30 minutes. The first bus departs around 05:30
and the last one around 22:30. Trip time is around 3 hours 10 minutes (or 2 hours 40 minutes for an “express”bus). You must buy a ticket before boarding. There is a big ticket hall at the east side of the station. Head forthe booth with the signs “Achaia” and/or “Patra”. There is no need to reserve tickets in advance, you willusually find a ticket for a bus leaving in the next hour. Ask at the ticket booth for directions on how to findthe proper bus.

Reaching the Conference Venue
From Patras Center
By Suburban Railway
The Patras Suburban Railway (ΠΡΟΑΣΤΙΚΟΣ) runs every hour, 7 days per week, connecting Patra's main train
station to the University Campus. Trains depart from Patra's main station at xx:34, with the first train
departing at 06:34 and the last one at 22:34. To reach the University Campus, you get off at "Kastelokampos"(fourth station) and transfer to a connecting local bus (ΠΡΟΑΣΤΙΑΚΟΣ) that brings you to the Campus. The
conference venue is close to the first bus stop within the Campus (rail bus stop). You can buy tickets in the
train station (the ticket is also valid for the connecting bus).
By BusFrom the city center, take bus No 6 (starting point at Ermou street), or bus No 9 (starting point at Othonosand Amalias street), heading at University (ΠΑΝΕΠΙΣΤΗΜΙΟ) or Hospital (ΝΟΣΟΚΟΜΕΙΟ) – in case of doubt,
confirm with the driver. Bus No 6 runs every 15 minutes, while bus No 9 every 60 minutes. The conference
venue is close to the second bus stop within the campus. You must buy a ticket before getting on the bus,
either from the special booths of the Local Bus company in the city center, or from some kiosk.

From Hotels near the Conference Venue
From Airotel Achaia Beach Hotel
Take the bus from the suburban railway stop "Kastelokampos" (about 350m from the hotel). Buses depart at
xx:48.
From Castello Hotel
By walking (about 600m from the hotel).
From Porto Rio Hotel
Take the bus from the suburban railway stop "Kastelokampos" (about 800m from the hotel). Buses depart at
xx:48.
From Tzaki Hotel
Take the train from the suburban railway stop "Bozaitika" (about 550m from the hotel), departing at xx:44,
get off at "Kastelokampos" (next stop) and transfer to the connecting local bus that brings you to the Campus.
Alternatively, take the bus from the bus stop "No 6 & No9 University-Hospital" (about 800m from the hotel).

23 | P A G E

USEFUL INFORMATION
Phone numbers
Intercity Buses (KTEL) : +30 2610 623 886-8
TRAINOSE: +30 2610 274180, +30 14511
Emergency: 112
Police: 100
Ambulance: 166
Fire Brigade: 199
Taxi: +30 2610 450000; +30 2610 326000, +30 2610 346700
Organizing Committee Emergency Contact : +30 6970948148 ; +30 6995624134 ; +30 6944629550

Health Insurance and Health Emergencies
The Organizers will accept no liability for personal injuries sustained by or for loss or damage to property
belonging to ICALP 2019 participants, either during or as a result of the Congress or during all events.
Participants are strongly recommended to seek insurance coverage for health and accident, lost luggage andtrip cancellation.

Wifi at the Conference Site
There is a Wifi Network available, please follow the instructions to connect:

Step 1: Enable Wifi access to your device, andselect the UPatras Guest network

Step 2: Press the "Sign in" button
Step 3:Press the "I accept" button

24 | P A G E

USERNAME:

guest

PASSWORD:

icalp2019

Step 4: Type "guest" in the username
field,"icalp2019" in the password field, andpress the “continue” button

25 | P A G E

ICALP 2019 Co-Organizing Institutions

ICALP 2019 Organizing Committee
•
•
•
•
•

ICALP 2019 OC Local Support Team
•
•
•
•
•
•
•
•

Efstratios Gallopoulos
John Garofalakis
Christos Kaklamanis
Sotiris Nikoletseas (chair)
Christos Zaroliagis (chair)

Andreas Bardoutsos
Anastasia Kampyli
Emmanouil Kerimakis
Paraskevi Machaira
Anna Panidou
Anastasios Papadopoulos
Andreas Paraskevopoulos
Nikolaos Zacharatos

Contact: icalp2019@ceid.upatras.gr

ICALP 2019 Sponsors