• László Kozma, Exact exponential algorithms for two poset problems
  • Amotz Bar-Noy, Keerti Choudhary, David Peleg and Dror Rawitz. Graph Realizations: Maximum Degree in Vertex Neighborhoods
  • David Eppstein, Daniel Frishberg and Elham Havvaei. Simplifying Activity-on-Edge Graphs
  • Nader Bshouty, Catherine Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi and Yara Zaknoon. Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
  • Da Qi Chen, R. Ravi and Hassene Aissi. Vertex Downgrading to Minimize Connectivity
  • Seiichiro Tani, Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
  • Ioana Bercea and Guy Even, A Dynamic Space-Efficient Filter with Constant Time Operations
  • Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz and Anna Zych-Pawlewicz. Recoloring Interval Graphs with Limited Recourse Budget
  • Prosenjit Bose, Saeed Mehrabi and Debajyoti Mondal. Parameterized Complexity of Two-Interval Pattern Problem
  • Haim Kaplan and Jay Tenenbaum. Locality Sensitive Hashing for set-queries, motivated by group recommendations
  • Glencora Borradaile, David Eppstein, William Maxwell and Amir Nayyeri. Low-stretch spanning trees of graphs with bounded width
  • Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin and Jungwoo Yang. Sea-rise Flooding on Massive Dynamic Terrains
  • Max Bannach, Malte Skambath and Till Tantau. Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time
  • Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi and Morteza Saghafian. Preclustering Algorithms for Imprecise Points
  • Bart M. P. Jansen and Jari J.H. de Kroon. Preprocessing Vertex Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies
  • Stephane Durocher and Md Yeakub Hassan. Clustering Moving Entities in Euclidean Space
  • Chenglin Fan, Anna Gilbert, Benjamin Raichel, Rishi Sonthalia and Gregory Van Buskirk. Generalized Metric Repair on Graphs
  • Saket Saurabh, Uéverton Dos Santos Souza and Prafullkumar Tale. On the Parameterized Complexity of Grid Contraction
  • Sivakumar Rathinam, R Ravi, Jung Yun Bae and Kaarthik Sundar. Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem
  • Arturs Backurs and Sariel Har-Peled. Submodular Clustering in Low Dimensions
  • Ilan Newman and Yuri Rabinovich. Online embedding of metrics
  • Joachim Spoerhase, Sabine Storandt and Johannes Zink. Simplification of Polyline Bundles
  • Akanksha Agrawal, Sudeshna Kolay and Meirav Zehavi. Parameter Analysis for Guarding Terrains
  • Niels Grüttemeier, Christian Komusiewicz and Nils Morawietz. Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
  • Ian Munro, Bryce Sandlund and Corwin Sinnamon. Space-Efficient Data Structures for Lattices
  • Patrick Eades, Ivor van der Hoog, Maarten Löffler and Frank Staals. Trajectory Visibility
  • Sujoy Bhore, Paz Carmi, Sudeshna Kolay and Meirav Zehavi. Parameterized Study of Steiner Tree on Unit Disk Graphs
  • Mikko Koivisto and Antti Röyskö. Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs
  • Jean Cardinal and Aurélien Ooms. Sparse Regression via Range Counting
  • Steven Chaplick, Myroslav Kryven, Henry Förster and Alexander Wolff. Drawing Graphs with Circular Arcs and Right Angle Crossings
  • Ahmad Biniaz, Prosenjit Bose, Anna Lubiw and Anil Maheshwari. Bounded-Angle Minimum Spanning Trees
  • Kevin Buchin, Anne Driemel and Martijn Struijs. On the hardness of computing an average curve
  • Esther Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen Kobourov and Joseph S.B. Mitchell. Computing $\beta$-Stretch Paths in Drawings of Graphs
  • Antonio Molina Lovett and Bryce Sandlund. A Simple Algorithm for Minimum Cuts in Near-Linear Time