Conveners
Track A-2: Distributed computing and networks
- Yossi Azar (Session Chair)
Track A-2: Quantum computing
- Thomas Vidick (Session Chair)
Track A-2: Computational geometry
- Laszlo Kozma (Session Chair)
Track A-2: Parameterized complexity
- Debmalya Panigrahi (Session Chair)
Track A-2: Math programming
- Ronald de Wolf (Session Chair)
Track A-2: Online Algorithms
- Petra Berenbrink (Session Chair)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shunichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki
Abstract: In this paper, we consider a transformation of $k$ disjoint paths in a graph. For a graph and a pair of $k$ disjoint paths $\mathcal{P}$ and $\mathcal{Q}$ connecting the same set of terminal pairs, we aim to determine whether $\mathcal{P}$ can be...
Laure Morelle, Ignasi Sau, Giannos Stamoulis and Dimitrios M. Thilikos
Abstract: Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a {\em $k$-apex} of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. Our first result is an algorithm that decides whether $G$ is a $k$-apex of ${\cal...
Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi and Jukka Suomela
Abstract: In this work, we give a unifying view of locality in four settings: distributed algorithms, sequential greedy algorithms, dynamic algorithms, and online algorithms.
We introduce a new model of computing, called the online-LOCAL model: the adversary reveals the nodes of the input...