Ivor van der Hoog

Orcid: 0009-0006-2624-0231

Affiliations:
  • Technical University of Denmark, Lyngby, Denmark
  • Universiteit Utrecht, The Netherlands (former)


According to our database1, Ivor van der Hoog authored at least 35 papers between 2017 and 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
5
10
15
6
4
1
1
2
3
8
1
3
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Smoothing the Gap Between NP and ER.
SIAM J. Comput., 2024

Sorting under partial (interval order) information.
J. Comput. Geom., 2024

Local Density and its Distributed Approximation.
CoRR, 2024

Simpler Optimal Sorting from a Directed Acyclic Graph.
CoRR, 2024

Barking dogs: A Fréchet distance variant for detour detection.
CoRR, 2024

Faster and Deterministic Subtrajectory Clustering.
CoRR, 2024

Adaptive Out-Orientations with Applications.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic Dynamic Time Warping.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Data Structures for Approximate Fréchet Distance for Realistic Curves.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Snake in Optimal Space and Time.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Tight Bounds for Sorting Under Partial Information.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Simple and Robust Dynamic Two-Dimensional Convex Hull.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
On Modelling, Structuring and Capturing Geometric Information.
PhD thesis, 2022

On the discrete Fréchet distance in a graph.
J. Comput. Geom., 2022

Approximate Discrete Fréchet distance: simplified, extended and structured.
CoRR, 2022

Adaptive Out-Orientations with Applications.
CoRR, 2022

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity.
CoRR, 2022

Preprocessing Imprecise Points for the Pareto Front.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Segment Visibility Counting Queries in Polygons.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Topological stability of kinetic <i>k</i>-centers.
Theor. Comput. Sci., 2021

Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020
Maximum-area triangle in a convex polygon, revisited.
Inf. Process. Lett., 2020

Trajectory Visibility.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
A Framework for Robust Realistic Geometric Computations.
CoRR, 2019

Smoothed Analysis of Order Types.
CoRR, 2019

Topological Stability of Kinetic k-centers.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Preprocessing Ambiguous Imprecise Points.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Dynamic Smooth Compressed Quadtrees.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Dynamic smooth compressed quadtrees (Fullversion).
CoRR, 2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited.
CoRR, 2017

Maximum-Area Triangle in a Convex Polygon, Revisited.
CoRR, 2017


  Loading...