Maximum-Area Triangle in a Convex Polygon, Revisited. - Vahideh Keikha; Maarten Löffler; Jérôme Urhausen; Ivor van der Hoog (CoRR, 2017)

Maximum-Area Quadrilateral in a Convex Polygon, Revisited. - Vahideh Keikha; Maarten Löffler; Ali Mohades; Ivor van der Hoog (CoRR, 2017)

Dynamic smooth compressed quadtrees (Fullversion). - Ivor van der Hoog; Elena Khramtcova; Maarten Löffler (CoRR, 2017)

Dynamic Smooth Compressed Quadtrees. - Ivor van der Hoog; Elena Khramtcova; Maarten Löffler (SoCG, 2018)

Preprocessing Ambiguous Imprecise Points. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (SoCG, 2019)

Topological Stability of Kinetic k-centers. - Ivor van der Hoog; Marc J. van Kreveld; Wouter Meulemans; Kevin Verbeek; Jules Wulms (WALCOM, 2019)

Smoothed Analysis of Order Types. - Ivor van der Hoog; Tillmann Miltzow; Martijn van Schaik (CoRR, 2019)

A Framework for Robust Realistic Geometric Computations. - Jeff Erickson 001; Ivor van der Hoog; Tillmann Miltzow (CoRR, 2019)

Trajectory Visibility. - Patrick Eades; Ivor van der Hoog; Maarten Löffler; Frank Staals (SWAT, 2020)

Maximum-area triangle in a convex polygon, revisited. - Ivor van der Hoog; Vahideh Keikha; Maarten Löffler; Ali Mohades; Jérôme Urhausen (Inf. Process. Lett., 2020)

Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. - Ivor van der Hoog; Mees van de Kerkhof; Marc J. van Kreveld; Maarten Löffler; Frank Staals; Jérôme Urhausen; Jordi L. Vermeulen (WADS, 2021)

Topological stability of kinetic k-centers. - Ivor van der Hoog; Marc J. van Kreveld; Wouter Meulemans; Kevin Verbeek; Jules Wulms (Theor. Comput. Sci., 2021)

Efficient Fréchet Distance Queries for Segments. - Maike Buchin; Ivor van der Hoog; Tim Ophelders; Lena Schlipf; Rodrigo I. Silveira; Frank Staals (ESA, 2022)

Segment Visibility Counting Queries in Polygons. - Kevin Buchin; Bram Custers; Ivor van der Hoog; Maarten Löffler; Aleksandr Popov 001; Marcel Roeloffzen; Frank Staals (ISAAC, 2022)

Preprocessing Imprecise Points for the Pareto Front. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (SODA, 2022)

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. - Jacob Holm; Ivor van der Hoog; Eva Rotenberg (CoRR, 2022)

Adaptive Out-Orientations with Applications. - Aleksander B. G. Christiansen; Jacob Holm; Ivor van der Hoog; Eva Rotenberg; Chris Schwiegelshohn (CoRR, 2022)

Approximate Discrete Fréchet distance: simplified, extended and structured. - Ivor van der Hoog; Eva Rotenberg; Sampson Wong (CoRR, 2022)

On the discrete Fréchet distance in a graph. - Anne Driemel; Ivor van der Hoog; Eva Rotenberg (J. Comput. Geom., 2022)

On Modelling, Structuring and Capturing Geometric Information. - Ivor van der Hoog (2022)

Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. - Jacob Holm; Ivor van der Hoog; Eva Rotenberg (SoCG, 2023)

Simple and Robust Dynamic Two-Dimensional Convex Hull. - Emil Toftegaard Gæde; Inge Li Gørtz; Ivor van der Hoog; Christoffer Krogh; Eva Rotenberg (ALENEX, 2024)

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. - Ivor van der Hoog; Irene Parada; Eva Rotenberg (ESA, 2024)

Tight Bounds for Sorting Under Partial Information. - Ivor van der Hoog; Daniel Rutschmann (FOCS, 2024)

Snake in Optimal Space and Time. - Philip Bille; Martín Farach-Colton; Inge Li Gørtz; Ivor van der Hoog (FUN, 2024)

Data Structures for Approximate Fréchet Distance for Realistic Curves. - Ivor van der Hoog; Eva Rotenberg; Sampson Wong (ISAAC, 2024)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. - Ivor van der Hoog; André Nusser; Eva Rotenberg; Frank Staals (MFCS, 2024)

Dynamic Dynamic Time Warping. - Karl Bringmann; Nick Fischer; Ivor van der Hoog; Evangelos Kipouridis; Tomasz Kociumaka; Eva Rotenberg (SODA, 2024)

Adaptive Out-Orientations with Applications. - Chandra Chekuri; Aleksander Bjørn Grodt Christiansen; Jacob Holm; Ivor van der Hoog; Kent Quanrud; Eva Rotenberg; Chris Schwiegelshohn (SODA, 2024)

Faster and Deterministic Subtrajectory Clustering. - Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (CoRR, 2024)

Barking dogs: A Fréchet distance variant for detour detection. - Ivor van der Hoog; Fabian Klute; Irene Parada; Patrick Schnider (CoRR, 2024)

Sorting under partial (interval order) information. - Ivor van der Hoog; Irina Kostitsyna; Maarten Löffler; Bettina Speckmann (J. Comput. Geom., 2024)

Smoothing the Gap Between NP and ER. - Jeff Erickson 001; Ivor van der Hoog; Tillmann Miltzow (SIAM J. Comput., 2024)

Efficient Greedy Discrete Subtrajectory Clustering. - Ivor van der Hoog; Lara Ost; Eva Rotenberg; Daniel Rutschmann (SoCG, 2025)

Faster, Deterministic and Space Efficient Subtrajectory Clustering. - Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (ICALP, 2025)

Simpler Optimal Sorting from a Directed Acyclic Graph. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (SOSA, 2025)

Local Density and Its Distributed Approximation. - Aleksander Bjørn Grodt Christiansen; Ivor van der Hoog; Eva Rotenberg (STACS, 2025)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees. - Emil Toftegaard Gæde; Ivor van der Hoog; Eva Rotenberg; Tord Stordalen (CoRR, 2025)

Instance-Optimal Imprecise Convex Hull. - Sarita de Berg; Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann; Sampson Wong (CoRR, 2025)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. - Ernestine Großmann; Ivor van der Hoog; Henrik Reinstädtler; Eva Rotenberg; Christian Schulz 003; Juliette Vlieghe (CoRR, 2025)

Simple Universally Optimal Dijkstra. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (CoRR, 2025)

Fréchet Distance in Unweighted Planar Graphs. - Ivor van der Hoog; Thijs van der Horst; Eva Rotenberg; Lasse Wulf (CoRR, 2025)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (CoRR, 2025)

Simpler and Faster Contiguous Art Gallery. - Sarita de Berg; Jacobus Conradi; Ivor van der Hoog; Frank Staals (CoRR, 2025)

Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm. - Jacobus Conradi; Ivor van der Hoog; Thijs van der Horst; Tim Ophelders (CoRR, 2025)