Name: ICALP 2023
Start: 2023-07-10T08:00:00+02:00
End: 2023-07-14T18:00:00+02:00
Location: Heinz Nixdorf MuseumsForum (HNF)

ICALP 2023

from Monday, July 10, 2023 (8:00 AM) to Friday, July 14, 2023 (6:00 PM)

Monday, July 10, 2023

8:00 AM Registration
Registration
8:00 AM - 9:00 AM
Room: Foyer

9:00 AM

9:00 AM - 10:30 AM
Room: Seminar Room 4

9:00 AM - 10:30 AM
Room: Seminar Room 3

9:00 AM - 10:30 AM
Room: F0.231

9:00 AM - 10:30 AM
Room: F0.530

9:00 AM - 10:30 AM
Room: F2.211

9:00 AM - 10:30 AM
Room: F1.110

9:00 AM - 10:30 AM
Room: F0.225

9:00 AM - 10:30 AM
Room: Seminar Room 5

9:00 AM - 10:30 AM
Room: Seminar Room 1+2

10:30 AM Coffee break
Coffee break
10:30 AM - 11:00 AM
Room: Meeting Area

11:00 AM

11:00 AM - 12:30 PM
Room: Seminar Room 4

11:00 AM - 12:30 PM
Room: Seminar Room 3

11:00 AM - 12:30 PM
Room: F0.231

11:00 AM - 12:30 PM
Room: F0.530

11:00 AM - 12:30 PM
Room: F2.211

11:00 AM - 12:30 PM
Room: F1.110

11:00 AM - 12:30 PM
Room: F0.225

11:00 AM - 12:30 PM
Room: Seminar Room 5

11:00 AM - 12:30 PM
Room: Seminar Room 1+2

12:30 PM Lunch
Lunch
12:30 PM - 2:00 PM
Room: Lower Floor

2:00 PM

2:00 PM - 3:30 PM
Room: Seminar Room 4

2:00 PM - 3:30 PM
Room: Seminar Room 3

2:00 PM - 3:30 PM
Room: F0.231

2:00 PM - 3:30 PM
Room: F0.530

2:00 PM - 3:30 PM
Room: F2.211

2:00 PM - 3:30 PM
Room: F1.110

2:00 PM - 3:30 PM
Room: F0.225

2:00 PM - 3:30 PM
Room: Seminar Room 5

2:00 PM - 3:30 PM
Room: Seminar Room 1+2

3:30 PM Coffee break
Coffee break
3:30 PM - 4:00 PM
Room: Meeting Area

4:00 PM

4:00 PM - 5:30 PM
Room: Seminar Room 4

4:00 PM - 5:30 PM
Room: Seminar Room 3

4:00 PM - 5:30 PM
Room: F0.231

4:00 PM - 5:30 PM
Room: F0.530

4:00 PM - 5:30 PM
Room: F2.211

4:00 PM - 5:30 PM
Room: F1.110

4:00 PM - 5:30 PM
Room: F0.225

4:00 PM - 5:30 PM
Room: Seminar Room 5

4:00 PM - 5:30 PM
Room: Seminar Room 1+2

5:30 PM ICALP 2023 get together with drinks & food
ICALP 2023 get together with drinks & food
5:30 PM - 10:30 PM
Room: Meeting Area
Tuesday, July 11, 2023

8:00 AM Registration
Registration
8:00 AM - 8:45 AM
Room: Foyer
8:45 AM Opening Address - Sevag Gharibian
Opening Address
- Sevag Gharibian
8:45 AM - 9:00 AM
Room: Auditorium
9:00 AM
9:00 AM - 10:00 AM
Room: Auditorium
Contributions

9:00 AM Quantum codes, local testability and interactive proofs: state of the art and open questions - Thomas Vidick
10:00 AM Coffee Break
Coffee Break
10:00 AM - 10:30 AM
Room: Meeting Area
10:30 AM Efficient algorithms (+ parameterized complexity)
Efficient algorithms (+ parameterized complexity)
10:30 AM - 12:30 PM
Room: Seminar Room 1+2
Contributions

10:30 AM Approximating Long Cycle Above Dirac’s Guarantee - Kirill Simonov

10:55 AM Breaking the All Subsets Barrier for Min $k$-Cut - Vaishali Surianarayanan

11:20 AM Compound Logics for Modification Problems - Giannos Stamoulis

11:45 AM Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems - Shi Li

12:10 PM New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling - Spencer Compton
Distributed computing and networks
Distributed computing and networks
10:30 AM - 12:30 PM
Room: Seminar Room 4
Contributions

10:30 AM Optimal (degree+1)-Coloring in Congested Clique - Sam Coy

10:55 AM New Additive Emulators - Merav Parter

11:20 AM Protecting Single-Hop Radio Networks from Message Drops - Dmitry Paramonov

11:45 AM Approximation Algorithms for Network Design in Non-Uniform Fault Models - Rhea Jain

12:10 PM Frameworks for Nonclairvoyant Network Design with Deadlines or Delay - Noam Touitou
Probabilistic analysis
Probabilistic analysis
10:30 AM - 12:30 PM
Room: Seminar Room 5
Contributions

10:30 AM Nondeterministic Refutations for Nearest Boolean Vector - Andrej Bogdanov

10:55 AM Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem - Ittai Rubinstein

11:20 AM Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs - Andreas Göbel Leon Schiller

11:45 AM On Sparsification of Stochastic Packing Problems - Yusuf Hakan Kalaycı

12:10 PM The wrong direction of Jensen’s inequality is algorithmically right - Or Zamir
Mixed topics
Mixed topics
10:30 AM - 12:30 PM
Room: F0.530
Contributions

10:30 AM Searching for Regularity in Bounded Functions - Michael Whitmeyer

10:55 AM A Sparse Johnson-Lindenstrauss Transform using Fast Hashing - Jakob Bæk Tejs Houen

11:20 AM A Hyperbolic Extension of Kadison-Singer Type Results - Xinzhi Zhang

11:45 AM The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly - Daniel Hader

12:10 PM Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds - Marek Szykuła
Automata and Games
Automata and Games
10:30 AM - 12:30 PM
Room: Seminar Room 3
Contributions

10:30 AM Deterministic regular functions of infinite words - Emmanuel Filiot

10:55 AM On Semantically-Deterministic Automata - Bader Abu Radi

11:20 AM Algebraic Recognition of Regular Functions - Lê Thành Dũng Nguyễn

11:45 AM How to Play Optimally for Regular Objectives? - Pierre Vandenhove

12:10 PM Characterising memory in infinite games - Pierre Ohlmann
12:30 PM Lunch
Lunch
12:30 PM - 2:00 PM
Room: Lower Floor
2:00 PM
2:00 PM - 3:00 PM
Room: Auditorium
Contributions

2:00 PM The Skolem Landscape - James Worrell
3:00 PM Coffee break
Coffee break
3:00 PM - 3:30 PM
Room: Meeting Area
3:30 PM AGT/Social choice
AGT/Social choice
3:30 PM - 5:05 PM
Room: Seminar Room 1+2
Contributions

3:30 PM Low Sample Complexity Participatory Budgeting - Sahasrajit Sarmasarkar

3:55 PM Approximation Algorithms for Envy-Free Cake Division with Connected Pieces - Pooja Kulkarni

4:20 PM Truthful Matching with Online Items and Offline Agents - Simon Mauras

4:45 PM Stable Matching: Choosing Which Proposals to Make - Ishan Agarwal
Quantum computing
Quantum computing
3:30 PM - 5:05 PM
Room: Seminar Room 4
Contributions

3:30 PM #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint - Ben Young

3:55 PM Decidability of fully quantum nonlocal games with noisy maximally entangled states - Minglong Qin

4:20 PM Quantum cryptography with classical communication - Parallel remote state preparation for copy-protection, verification, and more - Alexandru Gheorghiu

4:45 PM Parallel self-testing of EPR pairs under computational assumptions - Honghao Fu
Data structures
Data structures
3:30 PM - 5:05 PM
Room: Seminar Room 5
Contributions

3:30 PM On Range Summary Queries - Pingan Cheng

3:55 PM Efficient Data Structures for Incremental Exact and Approximate Maximum Flow - Gramoz Goranci

4:20 PM Fault-Tolerant ST-Diameter Oracles - Davide Bilò

4:45 PM Optimal Adjacency Labels for Subgraphs of Cartesian Products - Nathaniel Harms Viktor Zamaraev
Sublinear algorithms, streaming
Sublinear algorithms, streaming
3:30 PM - 5:05 PM
Room: F0.530
Contributions

3:30 PM Lower Bounds for Pseudo-Deterministic Counting in a Stream - Shay Sapir

3:55 PM Streaming $k$-edit approximate pattern matching via string decomposition - Michal Koucky

4:20 PM Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics - Yu Chen

4:45 PM Sublinear Time Eigenvalue Approximation via Random Sampling - Archan Ray
Decision Procedures
Decision Procedures
3:30 PM - 5:05 PM
Room: Seminar Room 3
Contributions

3:30 PM Positivity Problems for Reversible Linear Recurrence Sequences - George Kenison Joris Nieuwveld

3:55 PM On the Limits of Decision: the Adjacent Fragment of First-Order Logic - Daumantas Kojelis Ian Pratt-Hartmann

4:20 PM The complexity of Presburger arithmetic with power or powers - Alessio Mansutti Dmitry Chistikov

4:45 PM On the complexity of diameter and related problems in permutation groups - Markus Lohrey
5:05 PM Break
Break
5:05 PM - 5:30 PM
Room: Meeting Area

5:30 PM Bus Transfer
Bus Transfer
5:30 PM - 6:00 PM

6:00 PM City Tour
City Tour
6:00 PM - 7:00 PM

7:00 PM Reception at historical City Hall
Reception at historical City Hall
7:00 PM - 10:00 PM
Wednesday, July 12, 2023

8:30 AM Registration
Registration
8:30 AM - 9:00 AM
Room: Meeting Area
9:00 AM
9:00 AM - 10:00 AM
Room: Auditorium
Contributions

9:00 AM (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem - Anna Karlin
10:00 AM Coffee break
Coffee break
10:00 AM - 10:30 AM
Room: Meeting Area
10:30 AM Approximation Algorithms
Approximation Algorithms
10:30 AM - 12:30 PM
Room: Seminar Room 1+2
Contributions

10:30 AM Finding Almost Tight Witness Trees - Dylan Hyatt-Denesik

10:55 AM Matching Augmentation via Simultaneous Contractions - Felix Hommelsheim

11:20 AM Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions - Ishan Bansal

11:45 AM An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs - Ramin Mousavi

12:10 PM A Tight $(1.5+\epsilon)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees - Hang Zhou
Computational geometry
Computational geometry
10:30 AM - 12:30 PM
Room: Seminar Room 4
Contributions

10:30 AM On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete $k$-Center for Small $k$ - Timothy M. Chan

10:55 AM Rerouting Planar Curves and Disjoint Paths - Takehiro Ito Yoshio Okamoto Yusuke Kobayashi Yuta Nozaki

11:20 AM Approximate Nearest Neighbor for Polygonal Curves under Frechet Distance - Haoqiang Huang

11:45 AM Ortho-radial Drawing in Near-linear Time - Yi-Jun Chang

12:10 PM The Geometry of Tree-Based Sorting - Magdalen Dobson
Random walks and related topics
Random walks and related topics
10:30 AM - 12:30 PM
Room: Seminar Room 5
Contributions

10:30 AM Parameter estimation for Gibbs distributions - Vladimir Kolmogorov

10:55 AM On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n) - Weiming Feng

11:20 AM Broadcasting with Random Matrices - Konstantinos Zampetakis

11:45 AM Improved mixing for the convex polygon triangulation flip walk - Daniel Frishberg

12:10 PM The Support of Open versus Closed Random Walks - He Sun
Computational and communication complexity, and hardness
Computational and communication complexity, and hardness
10:30 AM - 12:30 PM
Room: F0.530
Contributions

10:30 AM Low-depth arithmetic circuit lower bounds: Bypassing set-multilinearization - Bhargav Thankey Prashanth Amireddy

10:55 AM New PRGs for Unbounded-width/Adaptive-order Read-once Branching Programs - Hongxun Wu

11:20 AM The Communication Complexity of Set Intersection under Product Distributions - Tal Roth

11:45 AM Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation - Amir Azarmehr

12:10 PM Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra - Takehiro Ito Yoshio Okamoto Yusuke Kobayashi Yuta Nozaki
Logic and Graph Structure Theory
Logic and Graph Structure Theory
10:30 AM - 12:30 PM
Room: Seminar Room 3
Contributions

10:30 AM Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes - Nikolas Mählmann Szymon Toruńczyk

10:55 AM Flipper games for monadically stable graph classes - Nikolas Mählmann Pierre Ohlmann Szymon Toruńczyk Wojciech Przybyszewski

11:20 AM Canonical decompositions in monadically stable and bounded shrubdepth graph classes - Pierre Ohlmann Szymon Toruńczyk Wojciech Przybyszewski

11:45 AM Monadic NIP in monotone classes of relational structures - Ioannis Eleftheriadis

12:10 PM First Order Logic on Pathwidth Revisited Again - Michael Lampis
12:30 PM Lunch
Lunch
12:30 PM - 2:00 PM
Room: Lower Floor
2:00 PM
2:00 PM - 4:00 PM
Room: Auditorium
Contributions

2:00 PM Best Student Paper Track A: Minimum Chain Cover in Almost Linear Time - Manuel Cáceres

2:25 PM Best Student Paper Track B: The Identity Problem in $\mathbb{Z} \wr \mathbb{Z}$ is decidable - Ruiwen Dong

2:50 PM Best Paper Track A: Online Learning and Disambiguations of Partial Concept Classes - Tsun-Ming Cheung

3:15 PM Best Paper Track B: Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality - Henry Sinclair-Banks

3:40 PM Best Paper Track A: A 4/3 Approximation for 2-Vertex-Connectivity - Miguel Bosch Calvo
4:00 PM Coffee break
Coffee break
4:00 PM - 4:30 PM
Room: Meeting Area
4:30 PM
4:30 PM - 7:30 PM
Room: Auditorium
Contributions

4:30 PM Award Ceremony - Artur Czumaj

5:00 PM EATCS Award 2023 - Amos Fiat

5:45 PM EATCS General Assembly 2023 - Artur Czumaj
7:30 PM BBQ in HNF Garden
BBQ in HNF Garden
7:30 PM - 10:30 PM
Room: Garden
Thursday, July 13, 2023

8:30 AM Registration
Registration
8:30 AM - 9:00 AM
Room: Meeting Area
9:00 AM
9:00 AM - 10:00 AM
Room: Auditorium
Contributions

9:00 AM Context-Bounded Analysis of Concurrent Programs - Rupak Majumdar
10:00 AM Coffee break
Coffee break
10:00 AM - 10:30 AM
Room: Meeting Area
10:30 AM Quantum computing
Quantum computing
10:30 AM - 12:30 PM
Room: Seminar Room 1+2
Contributions

10:30 AM Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints - Ronald de Wolf

10:55 AM Simulating Markovian open quantum systems using higher-order series expansion - Chunhao Wang

11:20 AM Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians - Thiago Bergamaschi

11:45 AM Improved Hardness Results for the Guided Local Hamiltonian Problem - Ryu Hayakawa

12:10 PM Cumulative Memory Lower Bounds for Randomized and Quantum Computation - Niels Kornerup
Parameterized complexity
Parameterized complexity
10:30 AM - 12:30 PM
Room: Seminar Room 4
Contributions

10:30 AM Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar - Jan Jedelský

10:55 AM Parameterised and Fine-grained Subgraph Counting, modulo 2 - Marc Roth

11:20 AM Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth - Michał Wlodarczyk

11:45 AM Faster parameterized algorithms for modification problems to minor-closed classes - Giannos Stamoulis Laure Morelle

12:10 PM Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters - Hans L. Bodlaender
Approximation Algorithms
Approximation Algorithms
10:30 AM - 12:30 PM
Room: Seminar Room 5
Contributions

10:30 AM Connected k-Center and k-Diameter Clustering - Kelin Luo

10:55 AM Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering - Danny Vainstein Yossi Azar

11:20 AM Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm - Jun-Ting Hsieh

11:45 AM An EPTAS for Budgeted Matching and Budgeted Matroid Intersection - Ilan Doron

12:10 PM Scheduling under Non-Uniform Job and Machine Delays - David Stalfa
Graphs, hypergraphs and strings
Graphs, hypergraphs and strings
10:30 AM - 12:30 PM
Room: F0.530
Contributions

10:30 AM Local Computation Algorithms for Hypergraph Coloring - following Beck's approach - Andrzej Dorobisz

10:55 AM Nearly Tight Spectral Sparsification of Directed Hypergraphs - Kazusato Oko

11:20 AM Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player - Dani Dorfman

11:45 AM On Finding Constrained Independent Sets in Cycles - Ishay Haviv

12:10 PM Convergence of the number of period sets in strings - Eric Rivals Pengfei Wang
Models of Systems
Models of Systems
10:30 AM - 12:30 PM
Room: Seminar Room 3
Contributions

10:30 AM Action Codes - Thorsten Wißmann

10:55 AM Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity - Wojciech Rozowski

11:20 AM Population Protocols with Unordered Data - François Ladouceur

11:45 AM Nominal Topology for Data Languages - Fabian Birkmann Henning Urbat

12:10 PM Compositionality of planar perfect matchings, a universal and complete fragment of ZW-calculus - Titouan Carette
12:30 PM Lunch
Lunch
12:30 PM - 2:00 PM
Room: Lower Floor
2:00 PM
2:00 PM - 3:30 PM
Room: Auditorium
Contributions

2:00 PM Alonzo Church Award 2023 - Robbert Krebbers

2:44 PM Presburger Award 2023 - Aaron Bernstein

3:07 PM Presburger Award 2023 - Thatchaphol Saranurak
3:30 PM Coffee break
Coffee break
3:30 PM - 4:00 PM
Room: Meeting Area
4:00 PM Dynamic algorithms
Dynamic algorithms
4:00 PM - 5:10 PM
Room: Seminar Room 1+2
Contributions

4:00 PM Optimal Decremental Connectivity in Non-Sparse Graphs - Adam Karczmarz

4:25 PM Dynamic Averaging Load Balancing on Arbitrary Graphs - Lukas Hintze

4:50 PM Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs - Adam Karczmarz
Math programming
Math programming
4:00 PM - 5:10 PM
Room: Seminar Room 4
Contributions

4:00 PM Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching - Lichen Zhang

4:25 PM Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability - Tim Seppelt

4:50 PM Ellipsoid Fitting Up to a Constant - Jeff Xu Jun-Ting Hsieh
Property Testing
Property Testing
4:00 PM - 5:10 PM
Room: Seminar Room 5
Contributions

4:00 PM Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing - Hadley Black Iden Kalemaj

4:25 PM An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs - Pan Peng

4:50 PM Sample-based distance-approximation for subsequence-freeness - Omer Cohen Sidon
Verification and Testing
Verification and Testing
4:00 PM - 5:10 PM
Room: Seminar Room 3
Contributions

4:00 PM Checking Refinement of Asynchronous Programs against Context-Free Specifications - Pascal Baumann

4:25 PM Regular Methods for Operator Precedence Languages - Nicolas Mazzocchi Pavol Kebis

4:50 PM Black-box Testing Liveness Properties of Partially Observable Stochastic Systems - Vincent Grande
5:15 PM
5:15 PM - 6:15 PM
Room: Auditorium
Contributions

5:15 PM Opening Speech for the 50th ICALP Anniversary Session - Burkhard Monien

5:20 PM 50 Years of ICALP, Personal Reminiscences - Kurt Mehlhorn

5:50 PM From Formal Methods for Continuous Systems to the Safety of Neural Network Controllers - Thomas Henzinger
6:15 PM Break
Break
6:15 PM - 6:30 PM

6:30 PM Bus transfer
Bus transfer
6:30 PM - 7:00 PM

7:00 PM Conference dinner at Detmolder Brewery
Conference dinner at Detmolder Brewery
7:00 PM - 10:00 PM
Friday, July 14, 2023

8:30 AM Registration
Registration
8:30 AM - 9:00 AM
Room: Meeting Area
9:00 AM
9:00 AM - 10:00 AM
Room: Auditorium
Contributions

9:00 AM An Almost-Linear Time Algorithm for Maximum Flow and More - Rasmus Kyng
10:00 AM Coffee break
Coffee break
10:00 AM - 10:30 AM
Room: Meeting Area
10:30 AM Efficient algorithms
Efficient algorithms
10:30 AM - 12:30 PM
Room: Seminar Room 1+2
Contributions

10:30 AM Fast approximation of search trees on trees with centroid trees - Benjamin Aram Berendsohn Laszlo Kozma

10:55 AM Faster Matroid Partition Algorithms - Tatsuya Terao

11:20 AM Faster submodular maximization for several classes of matroids - Da Wei Zheng

11:45 AM On computing the vertex connectivity of 1-plane graphs - Karthik Murali

12:10 PM An Efficient Algorithm for All-Pairs Bounded Edge Connectivity - Shyan Akmal
Online Algorithms
Online Algorithms
10:30 AM - 12:30 PM
Room: Seminar Room 4
Contributions

10:30 AM A General Framework for Learning-Augmented Online Allocation - Debmalya Panigrahi

10:55 AM Online Demand Scheduling with Failovers - Rudy Zhou

11:20 AM Locality in online, dynamic, sequential, and distributed graph algorithms - Henrik Lievonen Jukka Suomela

11:45 AM Incremental Maximization via Continuization - David Weckbecker

12:10 PM Efficient Caching with Reserves via Marking - Sharat Ibrahimpur
Coding and Privacy
Coding and Privacy
10:30 AM - 12:30 PM
Room: Seminar Room 5
Contributions

10:30 AM Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery - Yihan Zhang

10:55 AM Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes - Kuan Cheng

11:20 AM List Decoding of Rank-Metric Codes with Row-to-Column Ratio Bigger Than 1/2 - Chaoping Xing

11:45 AM On Differentially Private Counting on Trees - Pasin Manurangsi

12:10 PM Triangle Counting with Local Edge Differential Privacy - Talya Eden
Complexity and Logic
Complexity and Logic
10:30 AM - 12:30 PM
Room: Seminar Room 3
Contributions

10:30 AM A dichotomy for succinct representations of homomorphisms - Christoph Berkholz Harry Vinall-Smeeth

10:55 AM Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting - Moritz Lichter

11:20 AM Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle? - Diptarka Chakraborty Gunjan Kumar

11:45 AM Network Satisfaction Problems Solved by k-Consistency - Manuel Bodirsky

12:10 PM The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems - Austen Z. Fan
12:30 PM Lunch
Lunch
12:30 PM - 2:00 PM
Room: Lower Floor
2:00 PM Session 1
Session 1
2:00 PM - 3:30 PM
Room: Auditorium
Contributions

2:00 PM Parallel algorithms strike back - Artur Czumaj

2:45 PM Allocating Indivisible Items in a Fair Manner - Kurt Mehlhorn
3:30 PM Coffee break
Coffee break
3:30 PM - 4:00 PM
Room: Meeting Area
4:00 PM Session 2
Session 2
4:00 PM - 5:30 PM
Room: Auditorium
Contributions

4:00 PM Sublinear Algorithms for the Analysis of very large graphs - Christian Sohler

4:45 PM Universal hashing, sequential and parallel and fast (most of the time) - Martin Dietzfelbinger