TBD, meanwhile you can see the list of accepted papers below.

WADS 2023 Accepted Papers

  • Jongmin Choi, Jaegun Lee and Hee-Kap Ahn. Efficient k-center algorithms for planar points in convex position.
  • Yuan Sha and Joachim Gudmundsson. Approximating the discrete center line segment in linear time.
  • Tereza Klimošová and Vibha Sahlot. 3-Coloring C_4 or C_3-free Diameter Two Graphs.
  • Adrian Dumitrescu and Csaba Toth. Observation Routes and External Watchman Routes.
  • Ofek Gila, Michael Goodrich and Robert Tarjan. Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent.
  • Baruch Schieber and Pranav Sitaraman. Quick Minimization of Tardy Processing Time on a Single Machine.
  • Rusul J. Alsaedi, Joachim Gudmundsson and André van Renssen. The Mutual Visibility Problem for Fat Robots.
  • Chengyuan Deng, Jie Gao, Jalaj Upadhyay and Chen Wang. Differentially Private Range Query on Shortest Paths.
  • Marek Chrobak and Neal Young. Classification via two-way comparisons.
  • Julia Baligacs, Yann Disser, Farehe Soheil and David Weckbecker. Tight analysis of the lazy algorithm for open online dial-a-ride.
  • Shaleen Deep, Xiao Hu and Paraschos Koutris. General Space-Time Tradeoffs via Relational Queries.
  • Sayan Bandyapadhyay, Zachary Friggstad and Ramin Mousavi. A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.
  • Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh and Meirav Zehavi. An ETH-Tight Algorithm for Bidirected Steiner Connectivity.
  • Davide Bilò, Luciano Gualà, Stefano Leucci and Luca Pepè Sciarria. Finding Diameter-Reducing Shortcuts in Trees.
  • Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann and Martin Schirneck. Compact Distance Oracles with Large Sensitivity and Low Stretch.
  • Jatin Batra, Syamantak Das and Agastya Vibhuti Jha. Tight Approximation Algorithms for Ordered Covering.
  • Shinwoo An, Kyungjin Cho and Eunjin Oh. Faster Algorithms for Cycle Hitting Problems1 on Disk Graphs.
  • Xiuge Chen, Rajesh Chitnis, Patrick Eades and Anthony Wirth. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs.
  • Joan Boyar, Lene M. Favrholdt, Shahin Kamali and Kim S. Larsen. Online Interval Scheduling with Predictions.
  • A. Karim Abu-Affash, Paz Carmi, Ori Luwisch and Joseph Mitchell. Geometric Spanning Trees Minimizing the Wiener Index.
  • Ian DeHaan and Zachary Friggstad. Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.
  • Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan and Kirill Simonov. Socially Fair Matching: Exact and Approximation Algorithms.
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto. Algorithmic Theory of Qubit Routing.
  • Younan Gao. Adaptive Data Structures for 2D Dominance Colored Range Counting.
  • Paolo Pellizzoni, Andrea Pietracaprina and Geppino Pucci. Fully dynamic clustering and diversity maximization in doubling metrics.
  • Tamal K. Dey, Tao Hou, and Salman Parsa. Revisiting Graph Persistence for Updates and Efficiency.
  • Hung-Yeh Lee, Hsuan-Yu Liao and Wing-Kai Hon. Colored Constrained Spanning Tree on Directed Graphs.
  • Bradley McCoy, Hsien-Chih Chang, Brittany Terese Fasy, David L. Millman and Carola Wenk. From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy.
  • Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-Ichi Maezawa and Akira Suzuki. Reconfiguration of Time-Respecting Arborescences.
  • Gang Liu and Haitao Wang. Geometric Hitting Set for Line-Constrained Disks.
  • Kevin Buchin, Seyed Erfan Hosseini Sereshgi, Brittany Terese Fasy and Carola Wenk. On Length-Sensitive Fréchet Similarity.
  • Max van Mulken, Bettina Speckmann and Kevin Verbeek. Density Approximation for Moving Groups.
  • Jens Kristian Refsgaard Schou, Gerth Stølting Brodal, Casper Moldrup Rysgaard and Rolf Svenning. Space Efficient Functional Off-line Partial Persistent Trees with Applications to Planar Point Location.
  • Aritra Banik, Prahlad Narasimhan Kasthurirangan and Venkatesh Raman. Dominator Coloring and CD Coloring in Almost Cluster Graphs.
  • Prosenjit Bose, Anthony D’Angelo and Stephane Durocher. Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon.
  • Evripidis Bampis, Bruno Escoffier, Niklas Hahn and Michalis Xefteris. Online TSP with Known Locations.
  • Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng and Runze Wang. Hardness of Graph-Structured Algebraic and Symbolic Problems.
  • Alexander Dobler and Martin Nöllenburg. Block Crossings in One-Sided Tanglegrams.
  • Mark de Berg and Geert van Wordragen. Improved Bounds for Discrete Voronoi Games.
  • Magnus Berg, Joan Boyar, Lene Favrholdt and Kim S. Larsen. Online Minimum Spanning Trees with Weight Predictions.
  • Haitao Wang. Dynamic Convex Hulls under Window-Sliding Updates.
  • Simon Weber and Joel Widmer. Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
  • David Eppstein. Lower Bounds for Non-Adaptive Shortest Path Relaxation.
  • Wing-Kai Hon, Meng-Tsung Tsai and Hung-Lung Wang. Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs.
  • Michael Goodrich and Evrim Ozel. External-Memory Sorting with Comparison Errors.
  • Guillermo Esteban, Dan Halperin, Victor Ruiz, Vera Sacristan and Rodrigo Silveira. Shortest coordinated motion for square robots.
  • Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev and Chrysanthi Raftopoulou. Linear Layouts of Bipartite Planar Graphs.

CCCG 2023 Accepted Papers