default search action
Thomas C. van Dijk
Person information
- affiliation: Julius Maximilians University of Würzburg, Institute of Computer Science, Germany
- affiliation: Utrecht University, Department of Information and Computing Sciences, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c31]Jonathan Klawitter, Felix Klesen
, Joris Y. Scholl, Thomas C. van Dijk, Alexander Zaft:
Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints. GIScience 2023: 5:1-5:16 - [i8]Jonathan Klawitter, Felix Klesen, Joris Y. Scholl, Thomas C. van Dijk, Alexander Zaft:
Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints. CoRR abs/2306.17348 (2023) - 2022
- [c30]Thomas C. van Dijk, Tim Janiak:
Algorithmically-assisted interactive metro map design (demo paper): "it looks like you're designing a metro map. would you like help?". SIGSPATIAL/GIS 2022: 94:1-94:4 - 2021
- [c29]Timon Behr, Thomas C. van Dijk, Axel Forsch, Jan-Henrik Haunert
Map Matching for Semi-Restricted Trajectories. GIScience (II) 2021: 12:1-12:16 - [c28]Wouter Duivesteijn, Thomas C. van Dijk:
Exceptional Gestalt Mining: Combining Magic Cards to Make Complex Coalitions Thrive. MLSA@PKDD/ECML 2021: 191-204 - 2020
- [j9]Steven Chaplick
Bundled Crossings Revisited. J. Graph Algorithms Appl. 24(4): 621-655 (2020) - [c27]Thomas C. van Dijk, Norbert Fischer, Bernhard Häussner:
Algorithmic Improvement of Crowdsourced Data: Intrinsic Quality Measures, Local Optima, and Consensus. SIGSPATIAL/GIS 2020: 433-436
2010 – 2019
- 2019
- [c26]Steven Chaplick
Bundled Crossings Revisited. GD 2019: 63-77 - [c25]Thomas C. van Dijk, Andre Löffler:
Practical Topologically Safe Rounding of Geographic Networks. SIGSPATIAL/GIS 2019: 239-248 - 2018
- [c24]Björn Barz, Thomas C. van Dijk, Bert Spaan, Joachim Denzler:
Putting User Reputation on the Map: Unsupervised Quality Control for Crowdsourced Historical Data. GeoHumanities@SIGSPATIAL 2018: 3:1-3:6 - [c23]Thomas C. van Dijk, Dieter Lutz:
Realtime linear cartograms and metro maps. SIGSPATIAL/GIS 2018: 488-491 - [c22]Thomas C. van Dijk, Tobias Greiner, Bas den Heijer, Nadja Henning, Felix Klesen
Wüpstream: efficient enumeration of upstream features (GIS cup). SIGSPATIAL/GIS 2018: 626-629 - [c21]Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. ISAAC 2018: 61:1-61:13 - [i7]Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff:
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. CoRR abs/1806.02851 (2018) - [i6]Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. CoRR abs/1812.04263 (2018) - 2017
- [j8]Michael A. Bekos
Improved Approximation Algorithms for Box Contact Representations. Algorithmica 77(3): 902-920 (2017) - [j7]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp
Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. 21(5): 873-913 (2017) - [c20]Thomas C. van Dijk, Fabian Lipp
Computing Storyline Visualizations with Few Block Crossings. GD 2017: 365-378 - [c19]Benedikt Budig, Thomas C. van Dijk:
Journeys of the Past: A Hidden Markov Approach to Georeferencing Historical Itineraries. GIR 2017: 7:1-7:10 - [c18]Thomas C. van Dijk, Alexander Wolff:
Algorithmically-Guided User Interaction. SIGSPATIAL/GIS 2017: 11:1-11:4 - [i5]Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff:
Computing Storyline Visualizations with Few Block Crossings. CoRR abs/1709.01055 (2017) - 2016
- [j6]Thomas C. van Dijk, Jan-Henrik Haunert
Location-dependent generalization of road networks based on equivalent destinations. Comput. Graph. Forum 35(3): 451-460 (2016) - [j5]Michael A. Bekos
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. J. Graph Algorithms Appl. 20(1): 133-158 (2016) - [j4]Benedikt Budig, Thomas C. van Dijk, Alexander Wolff:
Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. ACM Trans. Spatial Algorithms Syst. 2(4): 13:1-13:24 (2016) - [c17]Andre Löffler, Thomas C. van Dijk, Alexander Wolff:
Snapping Graph Drawings to the Grid Optimally. GD 2016: 144-151 - [c16]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp
Block Crossings in Storyline Visualizations. GD 2016: 382-398 - [c15]Benedikt Budig, Thomas C. van Dijk, Fabian Feitsch, Mauricio Giraldo Arteaga:
Polygon consensus: smart crowdsourcing for extracting building footprints from historical maps. SIGSPATIAL/GIS 2016: 66:1-66:4 - [c14]Benedikt Budig, Thomas C. van Dijk, Felix Kirchner:
Glyph Miner: A System for Efficiently Extracting Glyphs from Early Prints in the Context of OCR. JCDL 2016: 31-34 - [c13]Marjan van den Akker, Hans L. Bodlaender
Robust Recoverable Path Using Backup Nodes. SOFSEM 2016: 95-106 - [i4]Andre Löffler, Thomas C. van Dijk, Alexander Wolff:
Snapping Graph Drawings to the Grid Optimally. CoRR abs/1608.08844 (2016) - [i3]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. CoRR abs/1609.00321 (2016) - 2015
- [c12]Benedikt Budig, Thomas C. van Dijk:
Active Learning for Classifying Template Matches in Historical Maps. Discovery Science 2015: 33-47 - [c11]Lukas Beckmann, Benedikt Budig, Thomas C. van Dijk, Johannes Schamel:
There and back again: using fréchet-distance diagrams to find trajectory turning points. SIGSPATIAL/GIS 2015: 76:1-76:4 - [c10]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. WALCOM 2015: 222-233 - 2014
- [b1]Thomas C. van Dijk:
Wireless Sensor Networks : Structure and Algorithms. Utrecht University, Netherlands, 2014 - [j3]Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69(3): 685-740 (2014) - [j2]Thomas C. van Dijk, Jan-Henrik Haunert
Interactive focus maps using least-squares optimization. Int. J. Geogr. Inf. Sci. 28(10): 2052-2075 (2014) - [c9]Michael A. Bekos
Improved Approximation Algorithms for Box Contact Representations. ESA 2014: 87-99 - [c8]Benedikt Budig, Thomas C. van Dijk, Alexander Wolff:
Matching labels and markers in historical maps: an algorithm with interactive postprocessing. MapInteract@GIS 2014: 22-28 - [c7]Markus Chimani, Thomas C. van Dijk, Jan-Henrik Haunert
How to eat a graph: computing selection sequences for the continuous generalization of road networks. SIGSPATIAL/GIS 2014: 243-252 - [c6]Thomas C. van Dijk, Arthur van Goethem, Jan-Henrik Haunert
Map Schematization with Circular Arcs. GIScience 2014: 1-17 - [i2]Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. CoRR abs/1403.4861 (2014) - [i1]Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1408.3325 (2014) - 2013
- [c5]Thomas C. van Dijk, Krzysztof Fleszar, Jan-Henrik Haunert
Road segment selection with strokes and stability. MapInteract 2013: 72-77 - [c4]Thomas C. van Dijk, Arthur van Goethem, Jan-Henrik Haunert
Accentuating focus maps via partial schematization. SIGSPATIAL/GIS 2013: 418-421 - [c3]Thomas C. van Dijk, Jan-Henrik Haunert
A Probabilistic Model for Road Selection in Mobile Maps. W2GIS 2013: 214-222 - 2010
- [j1]Hans L. Bodlaender
A Cubic Kernel for Feedback Vertex Set and Loop Cutset. Theory Comput. Syst. 46(3): 566-597 (2010)
2000 – 2009
- 2009
- [c2]Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. ESA 2009: 554-565 - 2008
- [c1]Hans L. Bodlaender
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. SWAT 2008: 102-113
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-08-05 21:21 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: