Partitioning a polygon into two mirror congruent pieces.
Dania El-Khechen, Thomas Fevens, John Iacono und Günter Rote
In: Proceedings of the 20th Canadian Conference on Computational Geometry,
Montréal, August 13–15, 2008, pp. 131–134.
| 118. |
Fixed-parameter
tractability and lower bounds for stabbing problems.
Panos Giannopoulos, Christian Knauer, Günter Rote und Daniel
Werner
In: Abstracts of the 25th European Workshop on Computational Geometry
(EuroCG'09), Brüssel, März 2009, pp. 281–284.
|
| 118a. |
Fixed-parameter
tractability and lower bounds for stabbing problems.
Panos Giannopoulos, Christian Knauer, Günter Rote und Daniel
Werner
Manuskript, Juni 2009, 28 Seiten, zur Veröffentlichung eingereicht,
Computational Geometry, Theory and Applications. (Special issue for the
25th European Workshop on Computational Geometry (EuroCG'09)). arXiv:0906.3896 [cs.CG].
|
| 119. |
Two
applications of point matching.
Günter Rote
In: Abstracts of the 25th European Workshop on Computational Geometry
(EuroCG'09), Brüssel, März 2009, pp. 187–189.
|
| 120. |
Formulae
and growth rates of high-dimensional polycubes.
Ronnie Barequet, Gill Barequet und Günter Rote
In: European Conference on Combinatorics, Graph Theory and Applications
(EuroComb 2009), Bordeaux, September 2009, Herausgeber: Jaroslav Nešetril
und André Raspaud, Electronic
Notes in Discrete Mathematics 34 (2009), 459–463. doi:10.1016/j.endm.2009.07.076
|
| 120a. |
Formulae
and growth rates of high-dimensional polycubes.
Ronnie Barequet, Gill Barequet und Günter Rote
Combinatorica 30 (2010), 257–275. doi:10.1007/s00493-010-2448-8
|
| 121. |
The
parameterized complexity of some geometric problems in unbounded dimension.
Panos Giannopoulos, Christian Knauer und Günter Rote
In: Proc. 4th Int. Workshop on Parameterized and Exact
Computation-IWPEC 2009, Copenhagen, September 2009, Herausgeber: Jianer
Chen und Fedor V. Fomin, Lecture Notes in Computer Science,
5917, Springer-Verlag, 2009, pp. 198–209. doi:10.1007/978-3-642-11269-0_16,
arXiv:0906.3469 [cs.CG].
|
| 122. |
Plane graphs
with parity constraints.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter
Rote, Bettina Speckmann und Birgit Vogtenhuber
In: Algorithms and Data Structures Symposium-WADS 2009, Banff, August
2009, Herausgeber: Frank Dehne, Ian Munro, Jörg-Rüdiger
Sack und Roberto Tamassia, Lecture Notes in Computer Science,
5664, Springer-Verlag, 2009, pp. 13–24. doi:10.1007/978-3-642-03367-4_2
|
| 122a. |
Plane graphs
with parity constraints.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter
Rote, Bettina Speckmann und Birgit Vogtenhuber
erscheint in Graphs and Combinatorics (2013), 23 Seiten. doi:10.1007/s00373-012-1247-y
|
| 123. |
Resolving
loads with positive interior stresses.
Günter Rote und André Schulz
In: Algorithms and Data Structures Symposium-WADS 2009, Banff, August
2009, Herausgeber: Frank Dehne, Ian Munro, Jörg-Rüdiger
Sack und Roberto Tamassia, Lecture Notes in Computer Science,
5664, Springer-Verlag, 2009, pp. 530–541. doi:10.1007/978-3-642-03367-4_46
|
| 124. |
Flip
graphs of bounded-degree triangulations.
Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter
Rote, André Schulz und Bettina Speckmann
erscheint in Graphs and Combinatorics (2012), 17 Seiten, doi:10.1007/s00373-012-1229-0
arXiv:0903.2184 [math.CO].
|
| 124a. |
Flip
graphs of bounded-degree triangulations.
Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter
Rote, André Schulz und Bettina Speckmann
In: European Conference on Combinatorics, Graph Theory and Applications
(EuroComb 2009), Bordeaux, September 2009, Herausgeber: Jaroslav Nešetril
und André Raspaud, Electronic
Notes in Discrete Mathematics 34 (2009), 509–513. doi:10.1016/j.endm.2009.07.084
|
| 125. |
Constant-work-space
algorithms for geometric problems.
Tetsuo Asano, Wolfgang Mulzer, Günter Rote und Yajun Wang
Journal of Computational Geometry 2 (2011),
46–68.
|
| 125a. |
Constant-working-space
algorithms for geometric problems.
Tetsuo Asano und Günter Rote
In: Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, August 17–19, 2009, pp. 87–90.
(Dies ist eine vorläufige Kurzversion mit Teilergebnissen von 125.)
|
| 126. |
Integer
point sets minimizing average pairwise l1 distance: What is the optimal shape
of a town?
Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer,
Daria Schymura und Mariano Zelke
In: Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, August 17–19, 2009, pp. 145–148.
|
| 126a. |
Integer
point sets minimizing average pairwise L1 distance: What is the optimal shape
of a town?
Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer,
Daria Schymura und Mariano Zelke
Computational Geometry, Theory and Applications 44 (2011),
82–94. (Special issue for the 21st Canadian Conference
on Computational Geometry, Vancouver, 2009) doi:10.1016/j.comgeo.2010.09.004,
arXiv:1009.5628.
|
| 127. |
Lines pinning lines.
Boris Aronov, Otfried Cheong, Xavier Goaoc und Günter Rote
Discrete and Computational Geometry 45 (2011), 230–260. doi:10.1007/s00454-010-9288-6,
arXiv:1002.3294 [math.MG].
|
| 128. |
Partial
least-squares point matching under translations.
Günter Rote
In: 26th European Workshop on Computational Geometry (EuroCG'10), Dortmund,
März 2010, pp. 249–251, Herausgeber: Jan Vahrenhold.
|
| 129. |
Collapse.
Günter Rote und Uri Zwick
In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), San Francisco, January 2011, pp. 606–613.
|
| 130. |
Proper
n-cell polycubes in n - 3 dimensions.
Andrei Asinowski, Ronnie Barequet, Gill Barequet und Günter
Rote
In: "Computing and Combinatorics". Proceedings of the 17th Annual International
Computing and Combinatorics Conference (COCOON 2011), Dallas, Texas, August
2011. Herausgeber: Bin Fu und Ding-Zhu Du. Lecture Notes in Computer
Science 6842, Springer-Verlag, 2011, pp. 181–191. doi:10.1007/978-3-642-22685-4_16
|
| 130a. |
Proper
n-cell polycubes in n - 3 dimensions.
Andrei Asinowski, Ronnie Barequet, Gill Barequet und Günter
Rote
Journal of Integer Sequences 15
(2012), Artikel 12.8.4, 16 Seiten.
|
| 131. |
Monotone
paths in planar convex subdivisions and polytopes.
Adrian Dumitrescu, Günter Rote und Csaba D. Tóth
erscheint in: "Discrete Geometry", Herausgeber: Antoine Deza, Fields Institute
Communications Series on Discrete Geometry and Optimization Springer-Verlag,
2013.
|
| 131a. |
Monotone
paths in planar convex subdivisions.
Adrian Dumitrescu, Günter Rote und Csaba D. Tóth
In: "Computing and Combinatorics". Proceedings of the 18th Annual
International Computing and Combinatorics Conference (COCOON 2012),
Sidney, August 2012. Herausgeber: Joachim Gudmundsson, Julian
Mestre und Taso Viglas. Lecture Notes in Computer Science,
7434, Springer-Verlag, 2012, pp. 240–251. doi:10.1007/978-3-642-32241-9_21
|
| 131b. |
Long
monotone paths in convex subdivisions.
Günter Rote
In: Abstracts of the 27th European Workshop on Computational Geometry
(EuroCG'11), Morschach, Schweiz, März 2011, pp. 183–184,
Herausgeber: Michael Hoffmann.
|
| 132. |
Common
developments of several different orthogonal boxes.
Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Günter Rote
und Ryuhei Uehara
In: Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Vancouver, August 10–12, 2011, pp. 77–82.
|
| 133. |
Convexifying
polygons without losing visibilities.
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida
Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz,
Diane L. Souvaine und Andrew Winslow
In: Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Vancouver, August 10–12, 2011, pp. 229–234.
|
| 134. |
Triangulations
with circular arcs.
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech
Dobiášová, Bert Jüttler und Günter Rote
In: "Graph Drawing". GD 2011, Proceedings of the 19th International Symposium
on Graph Drawing, Eindhoven, September 2011, Revised Selected Papers.
Herausgeber: Marc van Kreveld und Bettina Speckmann, Lecture Notes in
Computer Science, 7034, Springer-Verlag, 2012, pp. 296–307. doi:10.1007/978-3-642-25878-7_29
|
| 135. |
Realizing
planar graphs as convex polytopes.
Günter Rote
In: "Graph Drawing". GD 2011, Proceedings of the 19th International Symposium
on Graph Drawing, Eindhoven, September 2011, Revised Selected Papers.
Herausgeber: Marc van Kreveld und Bettina Speckmann, Lecture Notes in
Computer Science, 7034, Springer-Verlag, 2012, pp. 238–241. doi:10.1007/978-3-642-25878-7_23
|
| 136. |
Memory-constrained
algorithms for simple polygons.
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer,
Günter Rote und André Schulz
Manuskript, Juni 2012, 14 Seiten, erscheint in Computational
Geometry, Theory and Applications (2013), (Special issue for the
28th European Workshop on Computational Geometry (EuroCG'12)). arXiv:1112.5904 [cs.CG].
|
| 136a. |
Memory-constrained
algorithms for simple polygons.
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer,
Günter Rote und André Schulz
In: Abstracts of the 28th European Workshop on Computational Geometry
(EuroCG'12), Assisi, Italien, März 2012, pp. 49–52, Herausgeber:
Walter Didimo und Giuseppe Liotta.
|
| 137. |
Coloring
dynamic point sets on a line.
Jean Cardinal, Nathann Cohen, Sébastien Collette, Michael Hoffmann,
Stefan Langerman und Günter Rote
In: Abstracts of the 28th European Workshop on Computational Geometry
(EuroCG'12), Assisi, Italien, März 2012, pp. 209–212, Herausgeber:
Walter Didimo und Giuseppe Liotta.
|
| 138. |
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles.
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette,
Thomas Hackl, Michael Hoffmann, Kolja Knauer, Stefan Langerman, Michal
Lasoń, Piotr Micek, Günter Rote und Torsten Ueckerdt
Manuskript, Feber 2013, arXiv:1302.2426.
|
| 139. |
Add
isotropic Gaussian kernels at own risk: more and more resilient modes in
higher dimensions.
Herbert Edelsbrunner, Brittany Terese Fasy und Günter Rote
In: Proceedings of the 28th Annual Symposium on Computational
Geometry, Chapel Hill, USA, June 17–20, 2012. Association
for Computing Machinery, 2012, pp. 91–100, doi:10.1145/2261250.2261265
|
| 139a. |
Add
isotropic Gaussian kernels at own risk: more and more resilient modes in
higher dimensions.
Herbert Edelsbrunner, Brittany Terese Fasy und Günter Rote
Revidierte Fassung, erscheint bei Discrete and Computational Geometry, 2013.
|
| 140. |
Configuration
space visualization (video).
Dror Atariah und Günter Rote
In: Proceedings of the 28th Annual Symposium on Computational
Geometry, Chapel Hill, USA, June 17–20, 2012. Association
for Computing Machinery, 2012, pp. 415–416. doi:10.1145/2261250.2261313
|
| 141. |
Optimally
solving a transportation problem using Voronoi diagrams.
Darius Geiß, Rolf Klein, Rainer Penninger und Günter Rote
Manuskript, Juni 2012, 15 Seiten, erscheint in Computational
Geometry, Theory and Applications (2013), (Special issue for the
28th European Workshop on Computational Geometry (EuroCG'12)). arXiv:1206.3057 [math.MG].
|
| 142. |
There
is no triangulation of the torus with vertex degrees 5, 6, . . . , 6, 7 and related
results: geometric proofs for combinatorial theorems.
Ivan Izmestiev, Robert B. Kusner, Günter Rote, Boris Springborn und
John M. Sullivan
erscheint in Geometriae Dedicata (2013). doi:10.1007/s10711-012-9782-5,
arXiv:1207.3605 [math.CO].
|
| 143. |
The degree of
convexity.
Günter Rote
zur Veröffentlichung eingereicht, in: Abstracts of the 29th European
Workshop on Computational Geometry (EuroCG'13), Braunschweig, März 2013,
Herausgeber: Sándor Fekete.
|
| 144. |
Quasi-parallel segments and characterization of unique bichromatic matchings.
Andrei Asinowski, Tillmann Miltzow und Günter Rote
in Arbeit (2013).
| 145. |
The
infimum of the volumes of convex polytopes of any given facet areas is
0.
N. V. Abrosimov, E. Makai, jr., A. D. Mednykh, Yu. G. Nikonorov und
Günter Rote
Manuskript, arXiv:1304.6579 [math.DG],
April 2013, 40 Seiten.
| | 146. |
Advantage
in the discrete Voronoi game.
Dániel Gerbner, Viola Mészáros, Dömötör
Pálvölgyi, Alexey Pokrovskiy und Günter Rote
Manuskript, arXiv:1303.0523 [math.CO],
März 2013, 14 Seiten.
| | 147. |
Most general position.
Jan Kyncl, Alexander Pilz, Günter Rote und André Schulz
in Arbeit (2013).
| |