default search action
Vincent Kusters
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j10]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving balls by a hyperplane in deterministic linear time. J. Comput. Geom. 11(1): 576-614 (2020)
2010 – 2019
- 2019
- [j9]Fabrizio Frati
, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. J. Graph Algorithms Appl. 23(4): 683-713 (2019) - 2018
- [j8]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68: 206-225 (2018) - 2017
- [j7]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 27(1-2): 57-84 (2017) - [j6]Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell
Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. 21(6): 983-1002 (2017) - [j5]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. J. Comput. Geom. 8(2): 109-177 (2017) - 2016
- [j4]Oswin Aichholzer
Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 26(3-4): 167-184 (2016) - [c15]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. SoCG 2016: 41:1-41:15 - [i8]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. CoRR abs/1603.07737 (2016) - [i7]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR abs/1611.02541 (2016) - 2015
- [j3]Jean Cardinal, Vincent Kusters:
The Complexity of Simultaneous Geometric Graph Embedding. J. Graph Algorithms Appl. 19(1): 259-272 (2015) - [j2]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19(1): 529-547 (2015) - [c14]Fabrizio Frati
Simultaneous Embeddings with Few Bends and Crossings. GD 2015: 166-179 - [c13]Vincent Kusters, Bettina Speckmann
Towards Characterizing Graphs with a Sliceable Rectangular Dual. GD 2015: 460-471 - [c12]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. ISAAC 2015: 505-516 - [c11]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS 2015: 197-210 - [i6]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. CoRR abs/1507.08080 (2015) - [i5]Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. CoRR abs/1508.07921 (2015) - 2014
- [c10]Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote:
Quality Ratios of Measures for Graph Drawing Styles. CCCG 2014 - [c9]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. ESA 2014: 566-578 - [c8]William Evans, Vincent Kusters, Maria Saumell, Bettina Speckmann
Column Planarity and Partial Simultaneous Geometric Embedding. GD 2014: 259-271 - [c7]Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC 2014: 15-26 - [i4]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. CoRR abs/1405.1894 (2014) - 2013
- [j1]Yi-Ling Hwong, Jeroen J. A. Keiren
Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider. Sci. Comput. Program. 78(12): 2435-2452 (2013) - [c6]Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira:
Convex hull alignment through translation. CCCG 2013 - [c5]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. WADS 2013: 353-364 - [i3]Jean Cardinal, Vincent Kusters:
The Complexity of Simultaneous Geometric Graph Embedding. CoRR abs/1302.7127 (2013) - 2012
- [c4]Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema:
Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71 - [c3]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. TJJCCGG 2012: 30-41 - [i2]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. CoRR abs/1209.3594 (2012) - 2011
- [c2]Yi-Ling Hwong, Vincent J. J. Kusters, Tim A. C. Willemse
Analysing the Control Software of the Compact Muon Solenoid Experiment at the Large Hadron Collider. FSEN 2011: 174-189 - [c1]Kevin Buchin
A splitting line model for directional relations. GIS 2011: 142-151 - [i1]Yi-Ling Hwong, Vincent J. J. Kusters, Tim A. C. Willemse:
Analysing the Control Software of the Compact Muon Solenoid Experiment at the Large Hadron Collider. CoRR abs/1101.5324 (2011)
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-05-08 21:00 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: