default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Verbeek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c47]Jacco Johannes Egbert Kiezebrink, Wieger R. Punter, Odysseas Papapetrou, Kevin Verbeek:
Synopses for Summarizing Spatial Data Streams. EDBT 2025: 284-296- 2024
- [c46]Sarita de Berg
, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. LATIN (1) 2024: 254-269 - [i24]Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. CoRR abs/2401.01289 (2024) - [i23]Maxim Snoep, Bettina Speckmann, Kevin Verbeek:
Polycube Layouts via Iterative Dual Loops. CoRR abs/2402.00652 (2024) - 2023
- [j24]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom. 109: 101923 (2023) - [c45]Max van Mulken, Bettina Speckmann, Kevin Verbeek:
Density Approximation for Moving Groups. WADS 2023: 675-688 - [i22]Thijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
A Monotone Interleaving Distance for Merge Trees. CoRR abs/2312.11113 (2023) - 2022
- [j23]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. Algorithmica 84(1): 216-233 (2022) - [j22]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. Comput. Geom. Topol. 1(1): 2:1-2:21 (2022) - [j21]Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal morphs of planar orthogonal drawings. J. Comput. Geom. 13(1): 263-297 (2022) - [c44]Pantea Haghighatkhah, Antske Fokkens, Pia Sommerauer, Bettina Speckmann, Kevin Verbeek:
Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection. EMNLP 2022: 8395-8416 - [c43]Bram Custers, Wouter Meulemans, Marcel Roeloffzen, Bettina Speckmann, Kevin Verbeek:
Physically consistent map matching. SIGSPATIAL/GIS 2022: 56:1-56:4 - [c42]Pantea Haghighatkhah, Antske Fokkens, Pia Sommerauer, Bettina Speckmann, Kevin Verbeek:
Story Trees: Representing Documents using Topological Persistence. LREC 2022: 2413-2429 - [i21]Max van Mulken, Bettina Speckmann, Kevin Verbeek:
Density Approximation for Kinetic Groups. CoRR abs/2212.03685 (2022) - [i20]Pantea Haghighatkhah, Antske Fokkens, Pia Sommerauer, Bettina Speckmann, Kevin Verbeek:
Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection. CoRR abs/2212.04273 (2022) - 2021
- [j20]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) - [c41]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann:
Stable Visual Summaries for Trajectory Collections. PacificVis 2021: 61-70 - [c40]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. SoCG 2021: 55:1-55:15 - [c39]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Route Reconstruction from Traffic Flow via Representative Trajectories. SIGSPATIAL/GIS 2021: 41-52 - [c38]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Coordinated Schematization for Visualizing Mobility Patterns on Networks. GIScience (II) 2021: 7:1-7:16 - [c37]Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Volume from Outlines on Terrains. GIScience (I) 2021: 16:1-16:15 - [c36]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. MFCS 2021: 56:1-56:19 - [c35]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. WADS 2021: 243-257 - [i19]Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek:
Polygon-Universal Graphs. CoRR abs/2103.06916 (2021) - [i18]Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. CoRR abs/2105.09047 (2021) - [i17]Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. CoRR abs/2105.09922 (2021) - 2020
- [j19]Eduardo Faccin Vernier, Max Sondag, João Luiz Dihl Comba, Bettina Speckmann, Alexandru C. Telea, Kevin Verbeek:
Quantitative Comparison of Time-Dependent Treemaps. Comput. Graph. Forum 39(3): 393-404 (2020) - [c34]Max Sondag, Wouter Meulemans, Christoph Schulz, Kevin Verbeek, Daniel Weiskopf, Bettina Speckmann:
Uncertainty Treemaps. PacificVis 2020: 111-120 - [c33]Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Ordered Strip Packing. LATIN 2020: 258-270 - [i16]Bram Custers, Wouter Meulemans, Bettina Speckmann, Kevin Verbeek:
Route Reconstruction from Traffic Flow via Representative Trajectories. CoRR abs/2012.05019 (2020)
2010 – 2019
- 2019
- [j18]Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing paths with geographic constraints. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j17]Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing representative networks for braided rivers. J. Comput. Geom. 10(1): 423-443 (2019) - [j16]Thom Castermans, Kevin Verbeek, Bettina Speckmann, Michel A. Westenberg, Rob Koopman, Shenghui Wang, Hein van den Berg, Arianna Betti:
SolarView: Low Distortion Radial Embedding with a Focus. IEEE Trans. Vis. Comput. Graph. 25(10): 2969-2982 (2019) - [c32]Thom Castermans, Bettina Speckmann, Kevin Verbeek:
A Practical Algorithm for Spatial Agglomerative Clustering. ALENEX 2019: 174-185 - [c31]Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings II. GD 2019: 33-45 - [c30]Onur Derin, Aniket Mitra, Matei Stroila, Bram Custers, Wouter Meulemans, Marcel Roeloffzen, Kevin Verbeek:
Understanding Movement in Context with Heterogeneous Data. MOVE++@SIGSPATIAL 2019: 1:1-1:4 - [c29]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-centers. WALCOM 2019: 43-55 - [i15]Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Stability analysis of kinetic orientation-based shape descriptors. CoRR abs/1903.11445 (2019) - [i14]Eduardo Faccin Vernier, Max Sondag, João Comba, Bettina Speckmann, Alexandru C. Telea, Kevin Verbeek:
Quantitative Comparison of Time-Dependent Treemaps. CoRR abs/1906.06014 (2019) - [i13]Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings II. CoRR abs/1908.08365 (2019) - [i12]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann:
Spatially and Temporally Coherent Visual Summaries. CoRR abs/1912.00719 (2019) - 2018
- [j15]Bettina Speckmann, Kevin Verbeek:
Homotopic 𝒞-oriented routing with few links and thick edges. Comput. Geom. 67: 11-28 (2018) - [j14]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table cartogram. Comput. Geom. 68: 174-185 (2018) - [j13]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. 73: 24-34 (2018) - [j12]Max Sondag, Bettina Speckmann, Kevin Verbeek:
Stable Treemaps via Local Moves. IEEE Trans. Vis. Comput. Graph. 24(1): 729-738 (2018) - [c28]Willem Sonke, Kevin Verbeek, Wouter Meulemans, Eric Verbeek, Bettina Speckmann:
Optimal Algorithms for Compact Linear Layouts. PacificVis 2018: 1-10 - [c27]Arthur van Goethem, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings. SoCG 2018: 42:1-42:14 - [c26]Willem Sonke, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann, Kevin Verbeek:
Volume-based similarity of linear features on terrains. SIGSPATIAL/GIS 2018: 444-447 - [c25]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. LATIN 2018: 260-274 - [c24]Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. LATIN 2018: 805-819 - [i11]Arthur van Goethem, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings. CoRR abs/1801.02455 (2018) - [i10]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
- [c23]Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing Representative Networks for Braided Rivers. SoCG 2017: 48:1-48:16 - [c22]Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing Paths with Geographic Constraints. GD 2017: 454-461 - [c21]Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek:
Non-Crossing Geometric Steiner Arborescences. ISAAC 2017: 54:1-54:13 - [c20]Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek:
Complexity Measures for Mosaic Drawings. WALCOM 2017: 149-160 - [i9]Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability. CoRR abs/1704.08000 (2017) - [i8]Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek:
Agglomerative Clustering of Growing Squares. CoRR abs/1706.10195 (2017) - [i7]Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing paths with geographic constraints. CoRR abs/1708.05486 (2017) - [i6]Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. CoRR abs/1708.06062 (2017) - 2016
- [j11]Kevin Verbeek, Subhash Suri:
Metric embedding, hyperbolic space, and social networks. Comput. Geom. 59: 1-12 (2016) - [j10]Subhash Suri, Kevin Verbeek:
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. Int. J. Comput. Geom. Appl. 26(3-4): 151-166 (2016) - [j9]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict confluent drawing. J. Comput. Geom. 7(1): 22-46 (2016) - [c19]Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek:
Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. ESA 2016: 22:1-22:16 - [c18]Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek:
Most Likely Voronoi Diagrams in Higher Dimensions. FSTTCS 2016: 31:1-31:14 - [c17]Matt Duckham, Marc J. van Kreveld, Ross Purves, Bettina Speckmann, Yaguang Tao, Kevin Verbeek, Jo Wood:
Modeling Checkpoint-Based Movement with the Earth Mover's Distance. GIScience 2016: 225-239 - [c16]Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek:
Bundled Crossings in Embedded Graphs. LATIN 2016: 454-468 - [i5]Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek:
Mapping polygons to the grid with small Hausdorff and Fréchet distance. CoRR abs/1606.06660 (2016) - 2015
- [j8]Kevin Buchin, Bettina Speckmann, Kevin Verbeek:
Angle-Restricted Steiner Arborescences for Flow Map Layout. Algorithmica 72(2): 656-685 (2015) - [j7]Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181: 21-32 (2015) - [j6]Bettina Speckmann, Kevin Verbeek:
Algorithms for Necklace Maps. Int. J. Comput. Geom. Appl. 25(1): 15-36 (2015) - [c15]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG 2015: 421-435 - [c14]Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz:
Geometric k Shortest Paths. SODA 2015: 1616-1625 - 2014
- [c13]Kevin Verbeek, Subhash Suri:
Metric Embedding, Hyperbolic Space, and Social Networks. SoCG 2014: 501 - [c12]Subhash Suri, Kevin Verbeek:
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. ISAAC 2014: 338-350 - 2013
- [c11]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table Cartograms. ESA 2013: 421-432 - [c10]Subhash Suri, Kevin Verbeek, Hakan Yildiz:
On the Most Likely Convex Hull of Uncertain Points. ESA 2013: 791-802 - [c9]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. GD 2013: 352-363 - [c8]Stephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek:
Combinatorial and Geometric Properties of Planar Laman Graphs. SODA 2013: 1668-1678 - [i4]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. CoRR abs/1308.6824 (2013) - 2012
- [j5]David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-Universal and Constrained Rectangular Layouts. SIAM J. Comput. 41(3): 537-564 (2012) - [c7]Kevin Verbeek:
Homotopic $\mathcal{C}$-Oriented Routing. GD 2012: 272-278 - [i3]Stephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek:
Combinatorial and Geometric Properties of Planar Laman Graphs. CoRR abs/1209.6506 (2012) - 2011
- [j4]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) - [j3]Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
On Planar Supports for Hypergraphs. J. Graph Algorithms Appl. 15(4): 533-549 (2011) - [j2]Kevin Buchin, Bettina Speckmann, Kevin Verbeek:
Flow Map Layout via Spiral Trees. IEEE Trans. Vis. Comput. Graph. 17(12): 2536-2544 (2011) - [c6]Kevin Buchin, Bettina Speckmann, Kevin Verbeek:
Angle-Restricted Steiner Arborescences for Flow Map Layout. ISAAC 2011: 250-259 - [i2]Kevin Buchin, Bettina Speckmann, Kevin Verbeek:
Angle-Restricted Steiner Arborescences for Flow Map Layout. CoRR abs/1109.3316 (2011) - 2010
- [j1]Bettina Speckmann, Kevin Verbeek:
Necklace Maps. IEEE Trans. Vis. Comput. Graph. 16(6): 881-889 (2010) - [c5]Bettina Speckmann, Kevin Verbeek:
Homotopic Rectilinear Routing with Few Links and Thick Edges. LATIN 2010: 468-479
2000 – 2009
- 2009
- [c4]Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek:
Rectangular cartograms: the game. SCG 2009: 96-97 - [c3]David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-universal rectangular layouts. SCG 2009: 267-276 - [c2]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. GD 2009: 183-194 - [c1]Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
On Planar Supports for Hypergraphs. GD 2009: 345-356 - [i1]David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-Universal Rectangular Layouts. CoRR abs/0901.3924 (2009)
Coauthor Index
[i23] [c45] [i22] [j23] [j22] [j21] [c44] [c43] [c42] [i21] [i20] [c41] [c40] [c39] [c38] [c37] [c36] [i19] [i18] [j19] [c34] [c33] [i16] [j18] [j17] [j16] [c32] [c31] [i14] [i13] [i12] [j15] [j12] [c28] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [i9] [i8] [i7] [j9] [c17] [j8] [j6] [c14] [c9] [i4] [j5] [j4] [j3] [j2] [c6] [i2] [j1] [c5] [c4] [c3] [c2] [c1] [i1]
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-11-20 21:57 CET 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:
