default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvor van der Hoog
Person information
- affiliation: Technical University of Denmark, Lyngby, Denmark
- affiliation (former): Universiteit Utrecht, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Emil Toftegaard Gæde, Inge Li Gørtz
, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. ALENEX 2024: 144-156- [c16]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. ESA 2024: 70:1-70:18 - [c15]Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog:
Snake in Optimal Space and Time. FUN 2024: 3:1-3:15 - [c14]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. MFCS 2024: 63:1-63:17 - [c13]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - [c12]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. SODA 2024: 3062-3088 - [i23]Ivor van der Hoog, Thijs van der Horst, Tim Ophelders:
Faster and Deterministic Subtrajectory Clustering. CoRR abs/2402.13117 (2024) - [i22]Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider:
Barking dogs: A Fréchet distance variant for detour detection. CoRR abs/2402.13159 (2024) - [i21]Ivor van der Hoog, Daniel Rutschmann:
Tight Bounds for Sorting Under Partial Information. CoRR abs/2404.08468 (2024) - [i20]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. CoRR abs/2406.20065 (2024) - [i19]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simpler Optimal Sorting from a Directed Acyclic Graph. CoRR abs/2407.21591 (2024) - 2023
- [c11]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. SoCG 2023: 40:1-40:18 - [i18]Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. CoRR abs/2310.18068 (2023) - [i17]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - [i16]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2310.18146 (2023) - 2022
- [b1]Ivor van der Hoog:
On Modelling, Structuring and Capturing Geometric Information. Utrecht University, Netherlands, 2022 - [c10]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. SoCG 2022: 36:1-36:18 - [c9]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet Distance Queries for Segments. ESA 2022: 29:1-29:14 - [c8]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. ISAAC 2022: 58:1-58:16 - [c7]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Imprecise Points for the Pareto Front. SODA 2022: 3144-3167 - [i15]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. CoRR abs/2201.02121 (2022) - [i14]Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. CoRR abs/2201.03490 (2022) - [i13]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet distance queries for segments. CoRR abs/2203.01794 (2022) - [i12]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. CoRR abs/2209.14079 (2022) - [i11]Aleksander B. G. Christiansen, Jacob Holm, Ivor van der Hoog, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2209.14087 (2022) - [i10]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. CoRR abs/2209.14094 (2022) - [i9]Ivor van der Hoog, Eva Rotenberg, Sampson Wong:
Approximate Discrete Fréchet distance: simplified, extended and structured. CoRR abs/2212.07124 (2022) - 2021
- [j2]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological stability of kinetic k-centers. Theor. Comput. Sci. 866: 145-159 (2021) - [c6]Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen:
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. WADS 2021: 627-640 - [i8]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Imprecise Points for the Pareto Front. CoRR abs/2101.06079 (2021) - 2020
- [j1]Ivor van der Hoog, Vahideh Keikha, Maarten Löffler, Ali Mohades, Jérôme Urhausen:
Maximum-area triangle in a convex polygon, revisited. Inf. Process. Lett. 161: 105943 (2020) - [c5]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
Smoothing the gap between NP and ER. FOCS 2020: 1022-1033 - [c4]Patrick Eades, Ivor van der Hoog, Maarten Löffler, Frank Staals:
Trajectory Visibility. SWAT 2020: 23:1-23:22
2010 – 2019
- 2019
- [c3]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Ambiguous Imprecise Points. SoCG 2019: 42:1-42:16 - [c2]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-centers. WALCOM 2019: 43-55 - [i7]Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Ambiguous Imprecise Points. CoRR abs/1903.08280 (2019) - [i6]Ivor van der Hoog, Tillmann Miltzow, Martijn van Schaik:
Smoothed Analysis of Order Types. CoRR abs/1907.04645 (2019) - [i5]Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow:
A Framework for Robust Realistic Geometric Computations. CoRR abs/1912.02278 (2019) - 2018
- [c1]Ivor van der Hoog, Elena Khramtcova, Maarten Löffler:
Dynamic Smooth Compressed Quadtrees. SoCG 2018: 45:1-45:15 - [i4]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-Centers. CoRR abs/1810.00794 (2018) - 2017
- [i3]Vahideh Keikha, Maarten Löffler, Jérôme Urhausen, Ivor van der Hoog:
Maximum-Area Triangle in a Convex Polygon, Revisited. CoRR abs/1705.11035 (2017) - [i2]Vahideh Keikha, Maarten Löffler, Ali Mohades, Ivor van der Hoog:
Maximum-Area Quadrilateral in a Convex Polygon, Revisited. CoRR abs/1708.00681 (2017) - [i1]Ivor van der Hoog, Elena Khramtcova, Maarten Löffler:
Dynamic smooth compressed quadtrees (Fullversion). CoRR abs/1712.05591 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
