| 2021 | Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets. | Florian Barth, Stefan Funke, Claudius Proissl |
| 2021 | Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. | Sam Barr, Therese Biedl |
| 2021 | Selected Neighbor Degree Forest Realization. | Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel |
| 2021 | On Geometric Priority Set Cover Problems. | Aritra Banik, Rajiv Raman, Saurabh Ray |
| 2021 | Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. | Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid |
| 2021 | Shortest Beer Path Queries in Outerplanar Graphs. | Joyce Bacic, Saeed Mehrabi, Michiel Smid |
| 2021 | Piecewise-Linear Farthest-Site Voronoi Diagrams. | Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland |
| 2021 | Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. | Takao Asano |
| 2021 | Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. | Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir |
| 2021 | Algorithms for Normalized Multiple Sequence Alignments. | Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fbio Viduani Martinez |
| 2021 | Skeletons and Minimum Energy Scheduling. | Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar |
| 2021 | A Characterization of Individualization-Refinement Trees. | Markus Anders, Jendrik Brachter, Pascal Schweitzer |
| 2021 | Feedback Vertex Set on Geometric Intersection Graphs. | Shinwoo An, Eunjin Oh |
| 2021 | Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. | Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle |
| 2021 | Machine Covering in the Random-Order Model. | Susanne Albers, Waldo Glvez, Maximilian Janke |
| 2021 | Grid Recognition: Classical and Parameterized Computational Perspectives. | Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | Size, Depth and Energy of Threshold Circuits Computing Parity Function. | Kei Uchizawa |
| 2020 | Online Primal-Dual Algorithms with Configuration Linear Programs. | Kim Thang Nguyen |
| 2020 | Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | Enumerating Range Modes. | Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | Weakly Submodular Function Maximization Using Local Submodularity Ratio. | Richard Santiago, Yuichi Yoshida |
| 2020 | A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. | Yoshifumi Sakai, Shunsuke Inenaga |
| 2020 | Approximation Algorithms for Generalized Path Scheduling. | Haozhou Pang, Mohammad R. Salavatipour |
| 2020 | How to Decompose a Graph into a Tree-Like Structure (Invited Talk). | Sang-il Oum |