Sunday, January 15, 2023

18:00 Reception


Monday, January 16, 2023

08:45 – 09:00 Official Opening

09:00 – 10:00 Invited Talk: Věra Kůrková (Some implications of high-dimensional geometry for classification by neural networks)

10:00 – 10:30 Coffee break

10:30 – 12:10 Session 1 (4 x 25 min)

  • The Complexity of Finding Tangles (Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff and Johannes Zink)
  • A spectral algorithm for finding maximum cliques in dense random intersection graphs (Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis)
  • Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth (Hauke Brinkop and Klaus Jansen)
  • More Effort Towards Multiagent Knapsack (Sushmita Gupta, Pallavi Jain and Sanjay Seetharaman)

12:30 – 14:00 Lunch

14:00 – 15:40 Session 2 (4 x 25 min)

  • Dominance Drawings for DAGs with Bounded Modular Width (Giacomo Ortali and Ioannis Tollis)
  • Morphing Planar Graph Drawings Through 3D (Kevin Buchin, William Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders and Alexander Wolff)
  • Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees (Jonathan Klawitter, Felix Klesen, Moritz Niederer and Alexander Wolff)
  • Parameterized Approaches to Orthogonal Compaction (Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff and Meirav Zehavi)

15:40 – 16:15 Coffee break

16:15 – 17:30 Session 3 (3 x 25 min)

  • Hardness of bounding influence via graph modification (Robert Barish and Tetsuo Shibuya)
  • Heuristics for Opinion Diffusion via Local Elections (Rica Gonen, Martin Koutecky, Roei Menashof and Nimrod Talmon)
  • On the Parameterized Complexity of $s$-club Cluster Deletion Problems (Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra Tappini)


Tuesday, January 17, 2023

08:30 – 12:30 Social events

12:30 – 14:00 Lunch

14:00 – 15:00 Invited talk: Gerth Stølting Brodal (Data Structure Design – Theory and Practice)

15:00 – 15:30 Coffee break

15:30 – 16:30 Best papers (2 x 30 min)

  • Balanced Substructures in Bicolored Graphs (P. S. Ardra, R. Krithika, Saket Saurabh and Roohani Sharma)
  • On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines (Kai Kahler and Klaus Jansen)

16:30 – 17:30 Best student papers (2 x 30 min)

  • On the 2-Layer Window Width Minimization Problem (Michael Bekos, Henry Förster, Michael Kaufmann, Stephen Kobourov, Myroslav Kryven, Axel Kuckuk and Lena Schlipf)
  • Sequentially Swapping Tokens: Further on Graph Classes (Hironori Kiya, Yuto Okada, Hirotaka Ono and Yota Otachi)

18:00 Business meeting and conference banquet


Wednesday, January 18, 2023

09:00 – 10:00 Invited talk: Sławomir Lasota (Ackermannian lower bound for the reachability problem of Petri nets)

10:00 – 10:30 Coffee break

10:30 – 12:10 Session 6 (4 x 25 min)

  • On the Preservation of Properties when Changing Communication Models (Olav Bunte, Louis van Gool and Tim Willemse)
  • Introduction to Routing Problems with Mandatory Transitions (Timothée Martinod and Christian Laforest)
  • Payment Scheduling in the Interval Debt Model (Tom Friedetzky, David Kutner, George Mertzios, Iain Stewart and Amitabh Trehan)
  • Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs (Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer and Petra Wolf)

12:30 – 14:00 Lunch

14:00 – 15:40 Session 7 (4 x 25 min)

  • Lower Bounds for Monotone $q$-Multilinear Boolean Circuits (Andrzej Lingas)
  • A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (Piotr Wojciechowski and K. Subramani)
  • Quantum complexity for vector domination problem (Andris Ambainis and Ansis Zvirbulis)
  • Learning through Imitation by using Formal Verification (Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina and Hillel Kugler)

15:40 – 16:15 Coffee break

16:15 – 17:30 Session 8 (3 x 25 min)

  • Delivery to Safety with Two Cooperating Robots (Jared Coleman, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce)
  • Space-Efficient STR-IC-LCS Computation (Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai)
  • The k-center Problem for Classes of Cyclic Words (Duncan Adamson, Argyrios Deligkas, Vladimir Gusev and Igor Potapov)