E-LIB Suche - Ergebnisse für: Kusters, Vincent

1

Simultaneous Embeddings with Few Bends and Crossings:

Frati, Fabrizio ; Hoffmann, Michael ; Kusters, Vincent
Journal of Graph Algorithms and Applications. 23 (2019) 4 - p. 683-713 , 2019

Link: https://doi.org/10.7155/..

2

Arc diagrams, flip distances, and Hamiltonian triangulation:

Cardinal, Jean ; Hoffmann, Michael ; Kusters, Vincent..
Computational Geometry. 68 (2018) - p. 206-225 , 2018

Link: https://doi.org/10.1016/..

3

Column planarity and partially-simultaneous geometric embed..:

Barba, Luis ; Evans, William ; Hoffmann, Michael...
Journal of Graph Algorithms and Applications. 21 (2017) 6 - p. 983-1002 , 2017

Link: https://doi.org/10.7155/..

4

The Complexity of Simultaneous Geometric Graph Embedding:

Cardinal, Jean ; Kusters, Vincent
Journal of Graph Algorithms and Applications. 19 (2015) 1 - p. 259-272 , 2015

Link: https://doi.org/10.7155/..

5

On Universal Point Sets for Planar Graphs:

Cardinal, Jean ; Hoffmann, Michael ; Kusters, Vincent
Journal of Graph Algorithms and Applications. 19 (2015) 1 - p. 529-547 , 2015

Link: https://doi.org/10.7155/..

6

Formalising and analysing the control software of the Compa..:

Hwong, Yi Ling ; Keiren, Jeroen J.A. ; Kusters, Vincent J.J...
Science of Computer Programming. 78 (2013) 12 - p. 2435-2452 , 2013

Link: https://doi.org/10.1016/..

7

A splitting line model for directional relations:

, In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems,

Buchin, Kevin ; Kusters, Vincent ; Speckmann, Bettina.. - p. 142-151 , 2011

Link: https://dl.acm.org/doi/1..

8

Halving balls by a hyperplane in deterministic linear time:

Hoffmann, Michael ; Kusters, Vincent ; Miltzow, Tillmann
https://jocg.org/index.php/jocg/article/view/3113/2851. , 2020

Link: https://jocg.org/index.p..

9

Halving balls by a hyperplane in deterministic linear time:

Hoffmann, Michael ; id_orcid:0 000-0001-5307-7106 ; Kusters, Vincent.
info:eu-repo/semantics/altIdentifier/doi/10.20382/jocg.v11i1a23. , 2020

Link: https://hdl.handle.net/2..

10

The planar tree packing theorem:

Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael..
info:eu-repo/semantics/altIdentifier/doi/10.20382/jocg.v8i2a6. , 2017

Link: https://hdl.handle.net/2..

11

The planar tree packing theorem:

Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael..
https://jocg.org/index.php/jocg/article/view/3046/2770. , 2017

Link: https://jocg.org/index.p..

12

The Planar Tree Packing Theorem:

Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael.
doi:10.4230/LIPIcs.SoCG.2016.41. , 2016

Link: https://doi.org/10.4230/..

13

The Planar Tree Packing Theorem:

Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael..
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.SoCG.2016.41. , 2016

Link: https://hdl.handle.net/2..

14

Arc diagrams, flip distances, and Hamiltonian triangulation:

Cardinal, Jean ; Hoffmann, Michael ; Kusters, Vincent..
http://arxiv.org/abs/1611.02541. , 2016

Link: http://arxiv.org/abs/161..

15

The Planar Tree Packing Theorem:

Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael..
http://arxiv.org/abs/1603.07737. , 2016

Link: http://arxiv.org/abs/160..