Lower bounds for the maximum number of spanning trees of a planar graph.
Ares Ribó Mor and Günter Rote
Manuscript, March 2009, (in preparation).
| 94. |
Minimum-weight
triangulation is NP-hard.
Wolfgang Mulzer and Günter Rote
Technical report B-05-23-revised, Freie Universität Berlin,
Institut für Informatik, February 2008, 45 pages, arXiv:cs/0601002 [cs.CG]. Complete version
with additional appendices.
|
| 94a. |
Minimum
weight triangulation is NP-hard.
Wolfgang Mulzer and Günter Rote
In: Proceedings of the 22nd Annual Symposium on Computational
Geometry, Sedona, June 5–7, 2006. Association for
Computing Machinery, 2006, pp. 1–10. doi:10.1145/1137856.1137859
|
| 94b. |
Minimum-weight
triangulation is NP-hard.
Wolfgang Mulzer and Günter Rote
Journal of the ACM 55, no. 2 (May
2008), Article 11, 29 pp. doi:10.1145/1346330.1346336
See Note
on priority
|
| 95. |
Acyclic
orientation of drawings.
Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote
In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT).
Riga, July 2006, Editors: Lars Arge and Rusins Freivalds. Lecture Notes
in Computer Science, 4059, Springer-Verlag, 2006, pp. 266–277.
doi:10.1007/11785293_26
|
| 95a. |
Acyclic
orientation of drawings.
Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote
In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi,
March 2006, pp. 207–210.
|
| 95b. |
Acyclic
orientation of drawings.
Eyal Ackerman, Kevin Buchin, Christian Knauer, and Günter Rote
Journal of Graph Algorithms and
Applications 14, No. 2 (2010), 367–384. doi:10.7155/jgaa.00211
|
| 96. |
Piecewise linear
Morse theory.
Günter Rote
In: Oberwolfach Reports, 3, European Mathematical Society -
Publishing House, 2006, pp. 696–698. doi:10.4171/OWR/2006/12
|
| 97. |
On
the bounding boxes obtained by principal component analysis.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter
Rote
In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi,
March 2006, pp. 193–196.
|
| 97a. |
Upper
and lower bounds on the quality of the PCA bounding boxes.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter
Rote
In: WSCG'2007, Prof. 15th Int. Conf. in Central Europe on Computer Graphics,
Visualization and Computer Vision, Plzen, Czech Republic, January 29 - February
1, 2007, Editors: Jarek Rossignac and Vaclav Skala, pp. 185–192.
|
| 98. |
Obnoxious centers in
graphs.
Sergio Cabello and Günter Rote
In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), New Orleans, January 2007, pp. 98–107, SIAM. doi:10.1145/1283383.1283395
|
| 98a. |
Obnoxious centers in
graphs.
Sergio Cabello and Günter Rote
SIAM Journal on Discrete Mathematics 24 (2010), 1713–1730. doi:10.1137/09077638X
|
| 99. |
Approximation
of an open polygonal curve with a minimum number of circular arcs and
biarcs.
R. L. Scot Drysdale, Günter Rote, and Astrid Sturm
Computational Geometry, Theory
and Applications 41 (2008), 31–47. doi:10.1016/j.comgeo.2007.10.009
|
| 99a. |
Approximation
of an open polygonal curve with a minimum number of circular arcs.
R. L. Scot Drysdale, Günter Rote, and Astrid Sturm
(Preliminary version of 99 with partial results.)
In: Abstracts of the 22nd European Workshop on Computational Geometry, Delphi,
March 2006, pp. 25–28.
|
| 100. |
Matrix scaling by
network flow.
Günter Rote and Martin Zachariasen
In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), New Orleans, January 2007, pp. 848–854, SIAM. doi:10.1145/1283383.1283474
|
| 101. |
Meshing of surfaces.
Jean-Daniel Boissonnat, David Cohen-Steiner, Bernard Mourrain, Günter
Rote, and Gert Vegter
In: "Effective Computational Geometry for Curves and Surfaces". Editors:
Jean-Daniel Boissonnat and Monique Teillaud, Chapter 5. Mathematics and
Visualization, Springer-Verlag, 2006, pp. 181–229. doi:10.1007/978-3-540-33259-6_5
|
| 102. |
Computational
topology: an introduction.
Günter Rote and Gert Vegter
In: "Effective Computational Geometry for Curves and Surfaces". Editors:
Jean-Daniel Boissonnat and Monique Teillaud, Chapter 7. Mathematics and
Visualization, Springer-Verlag, 2006, pp. 277–312. doi:10.1007/978-3-540-33259-6_7
|
| 103. |
Pseudo-triangulations
— a survey.
Günter Rote, Francisco Santos, and Ileana Streinu
In: Surveys on Discrete and Computational Geometry—Twenty
Years Later. Editors: Jacob E. Goodman, János Pach,
and Richard Pollack, Contemporary Mathematics, volume 453,
American Mathematical Society, 2008, pp. 343–410. arXiv:math/0612672 [math.CO].
|
| 104. |
Wooden
geometric puzzles: design and hardness proofs.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, and Gerard
Tel
In: Proceedings of the fourth conference on Fun with Algorithms
(FUN 2007). Castiglioncello, June 2007, Editors: Pilu Crescenzi,
Giuseppe Prencipe, and Geppino Pucci. Lecture Notes in Computer
Science, 4475, Springer-Verlag, 2007, pp. 16–29. doi:10.1007/978-3-540-72914-3_4
|
| 104a. |
Wooden
geometric puzzles: design and hardness proofs.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, and Gerard
Tel
Theory of Computing Systems 44 (2009), 160–174. doi:10.1007/s00224-008-9104-3
|
| 105. |
Convex
approximation by spherical patches.
Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, and Gert
Vegter
In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz,
March 2007, pp. 26–29.
|
| 106. |
How difficult
is it to walk the dog?
Kevin Buchin, Maike Buchin, Christian Knauer, Günter Rote, and Carola
Wenk
In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz,
March 2007, pp. 170–173.
|
| 107. |
There
are not too many magic configurations.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter
Rote
In: Proceedings of the 23rd Annual Symposium on Computational
Geometry, Gyeongju, South Korea, June 6–8, 2007. Association
for Computing Machinery, 2007, pp. 142–149. doi:10.1145/1247069.1247098
|
| 107a. |
There
are not too many magic configurations.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter
Rote
Discrete and Computational Geometry 39 (2008), 3–16. doi:10.1007/s00454-007-9023-0
|
| 107b. |
There
are not too many magic configurations.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, and Günter
Rote
In: Twentieth Anniversary Volume—Discrete & Computational Geometry. Editors:
Jacob E. Goodman, János Pach, and Richard Pollack, Springer-Verlag, New
York 2008, pp. 1–14. (This is identical to 107a.) doi:10.1007/978-0-387-87363-3_1
|
| 108. |
Embedding
3-polytopes on a small grid.
Ares Ribó Mor, Günter Rote, and André Schulz
In: Proceedings of the 23rd Annual Symposium on Computational
Geometry, Gyeongju, South Korea, June 6–8, 2007. Association
for Computing Machinery, 2007, pp. 112–118. doi:10.1145/1247069.1247086
|
| 108a. |
Small grid
embeddings of 3-polytopes.
Ares Ribó Mor, Günter Rote, and André Schulz
Discrete and Computational Geometry 45 (2011), 65–87. doi:10.1007/s00454-010-9301-0,
arXiv:0908.0488 [cs.CG].
|
| 109. |
New
upper bounds on the quality of PCA bounding boxes in R2 and
R3.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter
Rote
In: Proceedings of the 23rd Annual Symposium on Computational
Geometry, Gyeongju, South Korea, June 6–8, 2007. Association
for Computing Machinery, 2007, pp. 275–283. doi:10.1145/1247069.1247119
|
| 109a. |
New
upper bounds on the quality of PCA bounding boxes in R2 and
R3.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter
Rote
In: Abstracts of the 23rd European Workshop on Computational Geometry, Graz,
March 2007, pp. 122–125.
|
| 109b. |
Bounds
on the quality of the PCA bounding boxes.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, and Günter
Rote
Computational Geometry, Theory and
Applications 42 (2009), 772–789. doi:10.1016/j.comgeo.2008.02.007
|
| 110. |
Pointed drawings
of planar graphs.
Oswin Aichholzer, Günter Rote, André Schulz, and Birgit
Vogtenhuber
In: Proceedings of the 19th Canadian
Conference on Computational Geometry, Ottawa, August 20–22, 2007,
Editor: Prosenjit Bose, pp. 237–240.
|
| 110a. |
Pointed drawings
of planar graphs.
Oswin Aichholzer, Günter Rote, André Schulz, and Birgit
Vogtenhuber
Computational Geometry, Theory and
Applications 45 (2012), 482–494. doi:10.1016/j.comgeo.2010.08.001
|
| 111. |
On
the maximum size of an anti-chain of linearly separable sets and convex
pseudo-discs.
Rom Pinchasi and Günter Rote
Israel Journal of Mathematics 172 (2009), 337–348. doi:10.1007/s11856-009-0076-z,
arXiv:0707.0311 [math.MG].
|
| 112. |
Geometric
clustering: fixed-parameter tractability and lower bounds with respect to the
dimension.
Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter
Rote
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), San Francisco, January 2008, pp. 836–843, SIAM. doi:10.1145/1347082.1347174
|
| 112a. |
Geometric
clustering: fixed-parameter tractability and lower bounds with respect to the
dimension.
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, and
Günter Rote
ACM Transactions on Algorithms 7 (2011),
Article 43, 27 pages. doi:10.1145/2000807.2000811
|
| 113. |
Seed
polytopes for incremental approximation.
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon
Plantinga, Günter Rote, Astrid Sturm, and Gert Vegter
In: Abstracts of the 24th European Workshop on Computational Geometry, Nancy,
March 2008, pp. 13–16.
|
| 113a. |
Recovering
structure from r-sampled objects.
Oswin Aichholzer, Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga,
Günter Rote, Astrid Sturm, and Gert Vegter
In: Eurographics Symposium on Geometry Processing, Berlin,
July 2009, Editors: Marc Alexa, Michael Kazhdan, Computer
Graphics Forum 28 (2009), pp. 1349–1360. doi:10.1111/j.1467-8659.2009.01512.x
|
| 114. |
Detecting
hotspots in geographic networks.
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun
Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, and Thomas
Wolle
In: Advances in GIScience. Proceedings of the 12th AGILE International
Conference on Geographic Information Science, Hannover, Germany,
June 2009, Editors: Monika Sester, Lars Bernard, Volker Paelke.
Lecture Notes in Geoinformation and Cartography, Springer-Verlag,
2009, pp. 217–231. Best paper award. doi:10.1007/978-3-642-00318-9_11
|
| 114a. |
Finding
the most relevant fragments in networks.
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun
Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, and Thomas
Wolle
Journal of Graph Algorithms and
Applications 14 (2010), 307–336. doi:10.7155/jgaa.00209
|
| 115. |
Curve
intersection by the Subdivision-Supercomposition Method.
Günter Rote
Technical report ACS-TR-361503-01, Freie Universität Berlin, Institut
für Informatik, May 2008, 12 pages.
|
| 116. |
Partitioning a polygon into two mirror congruent pieces.
Dania El-Khechen, Thomas Fevens, John Iacono, and Günter Rote
In: Proceedings of the 20th Canadian
Conference on Computational Geometry, Montréal, August 13–15,
2008, pp. 131–134.
|
| 117. |
Fixed-parameter
tractability and lower bounds for stabbing problems.
Panos Giannopoulos, Christian Knauer, Günter Rote, and Daniel
Werner
In: Abstracts of the 25th European Workshop on Computational Geometry
(EuroCG'09), Brussels, March 2009, pp. 281–284.
|
| 117a. |
Fixed-parameter
tractability and lower bounds for stabbing problems.
Panos Giannopoulos, Christian Knauer, Günter Rote, and Daniel
Werner
Computational Geometry, Theory and Applications 46 (2013),
839–860. (Special issue for the 25th European Workshop
on Computational Geometry (EuroCG'09)). doi:10.1016/j.comgeo.2011.06.005,
arXiv:0906.3896 [cs.CG].
|
| 118. |
Two
applications of point matching.
Günter Rote
In: Abstracts of the 25th European Workshop on Computational Geometry
(EuroCG'09), Brussels, March 2009, pp. 187–189.
See Note
on priority
|
| 119. |
Formulae
and growth rates of high-dimensional polycubes.
Ronnie Barequet, Gill Barequet, and Günter Rote
In: European Conference on Combinatorics, Graph Theory and
Applications (EuroComb 2009), Bordeaux, September 2009, Editors:
Jaroslav Nešetřil and André Raspaud, Electronic Notes in
Discrete Mathematics 34 (2009), 459–463. doi:10.1016/j.endm.2009.07.076
|
| 119a. |
Formulae
and growth rates of high-dimensional polycubes.
Ronnie Barequet, Gill Barequet, and Günter Rote
Combinatorica 30 (2010), 257–275. doi:10.1007/s00493-010-2448-8
|
| 120. |
The
parameterized complexity of some geometric problems in unbounded dimension.
Panos Giannopoulos, Christian Knauer, and Günter Rote
In: Proc. 4th Int. Workshop on Parameterized and Exact
Computation—IWPEC 2009, Copenhagen, September 2009, Editors:
Jianer Chen and 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].
|
| 121. |
Plane graphs
with parity constraints.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter
Rote, Bettina Speckmann, and Birgit Vogtenhuber
In: Algorithms and Data Structures Symposium—WADS 2009, Banff,
August 2009, Editors: Frank Dehne, Ian Munro, Jörg-Rüdiger
Sack, and Roberto Tamassia, Lecture Notes in Computer Science,
5664, Springer-Verlag, 2009, pp. 13–24. doi:10.1007/978-3-642-03367-4_2
|
| 121a. |
Plane graphs
with parity constraints.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter
Rote, Bettina Speckmann, and Birgit Vogtenhuber
Graphs and Combinatorics 30 (2014), 47–69 doi:10.1007/s00373-012-1247-y
|
| 122. |
Resolving
loads with positive interior stresses.
Günter Rote and André Schulz
In: Algorithms and Data Structures Symposium—WADS 2009, Banff,
August 2009, Editors: Frank Dehne, Ian Munro, Jörg-Rüdiger
Sack, and Roberto Tamassia, Lecture Notes in Computer Science,
5664, Springer-Verlag, 2009, pp. 530–541. doi:10.1007/978-3-642-03367-4_46
|
| 123. |
Flip
graphs of bounded-degree triangulations.
Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter
Rote, André Schulz, and Bettina Speckmann
Graphs and Combinatorics 29 (2013), 1577–1593. doi:10.1007/s00373-012-1229-0
arXiv:0903.2184 [math.CO].
|
| 123a. |
Flip
graphs of bounded-degree triangulations.
Oswin Aichholzer, Thomas Hackl, Davíd Orden, Pedro Ramos, Günter
Rote, André Schulz, and Bettina Speckmann
In: European Conference on Combinatorics, Graph Theory and
Applications (EuroComb 2009), Bordeaux, September 2009, Editors:
Jaroslav Nešetřil and André Raspaud, Electronic Notes in
Discrete Mathematics 34 (2009), 509–513. doi:10.1016/j.endm.2009.07.084
|
| 124. |
Constant-work-space
algorithms for geometric problems.
Tetsuo Asano, Wolfgang Mulzer, Günter Rote, and Yajun Wang
Journal of Computational
Geometry 2 (2011), 46–68. doi:10.20382/jocg.v2i1a4
|
| 124a. |
Constant-working-space
algorithms for geometric problems.
Tetsuo Asano and Günter Rote
In: Proceedings of the 21st Canadian
Conference on Computational Geometry, Vancouver, August 17–19, 2009,
pp. 87–90.
(This is a preliminary short version with parts of the results of 124.)
|
| 125. |
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, and Mariano Zelke
In: Proceedings of the 21st Canadian
Conference on Computational Geometry, Vancouver, August 17–19, 2009,
pp. 145–148.
|
| 125a. |
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, and 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.
See Python
programs and numerical results
|
| 126. |
Lines pinning lines.
Boris Aronov, Otfried Cheong, Xavier Goaoc, and Günter Rote
Discrete and Computational Geometry 45 (2011), 230–260. doi:10.1007/s00454-010-9288-6,
arXiv:1002.3294 [math.MG].
|
| 127. |
Partial
least-squares point matching under translations.
Günter Rote
In: 26th European Workshop on Computational Geometry (EuroCG'10), Dortmund,
March 2010, pp. 249–251, Editor: Jan Vahrenhold.
|
| 128. |
Collapse.
Günter Rote and Uri Zwick
In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), San Francisco, January 2011, pp. 606–613, SIAM.
|
| 129. |
Zitate zählen (Proper
citation counting; in German).
Günter Rote
Internat. Math. Nachrichten 213 (2010), 1–5.
|
| 130. |
Proper
n-cell polycubes in n - 3 dimensions.
Andrei Asinowski, Ronnie Barequet, Gill Barequet, and Günter
Rote
In: "Computing and Combinatorics". Proceedings of the 17th Annual International
Computing and Combinatorics Conference (COCOON 2011), Dallas, Texas, August
2011. Editors: Bin Fu and 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, and Günter
Rote
Journal of Integer Sequences 15
(2012), Article 12.8.4, 16 pages.
|
| 131. |
Monotone
paths in planar convex subdivisions and polytopes.
Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth
In: "Discrete Geometry and Optimization", Editors: Károly
Bezdek, Antoine Deza, and Yinyu Ye, Fields Institute Communications
69, Springer-Verlag, 2013, pp. 79–104. doi:10.1007/978-3-319-00200-2_6
|
| 131a. |
Monotone
paths in planar convex subdivisions.
Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth
In: "Computing and Combinatorics". Proceedings of the 18th Annual
International Computing and Combinatorics Conference (COCOON 2012),
Sydney, August 2012. Editors: Joachim Gudmundsson, Julian
Mestre, and 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, Switzerland, March 2011, pp. 183–184, Editor:
Michael Hoffmann.
|
| 132. |
Common
developments of several different orthogonal boxes.
Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Günter
Rote, and Ryuhei Uehara
In: Proceedings of the 23rd 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
Dujmović, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz,
Diane L. Souvaine, and Andrew Winslow
In: Proceedings of the 23rd Canadian
Conference on Computational Geometry, Vancouver, August 10–12, 2011,
pp. 229–234.
|
| 134. |
Triangulations
with circular arcs.
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Kateřina
Čech Dobiášová, Bert Jüttler, and Günter
Rote
In: "Graph Drawing". GD 2011, Proceedings of the 19th International Symposium
on Graph Drawing, Eindhoven, September 2011, Revised Selected Papers. Editors:
Marc van Kreveld and Bettina Speckmann, Lecture Notes in Computer
Science, 7034, Springer-Verlag, 2012, pp. 296–307. doi:10.1007/978-3-642-25878-7_29
|
| 134a. |
Triangulations
with circular arcs.
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Kateřina
Čech Dobiášová, Bert Jüttler, and Günter
Rote
Journal of Graph Algorithms and
Applications 19, no. 1 (2015), 43–65. doi:10.7155/jgaa.00346
|
| 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. Editors:
Marc van Kreveld and 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, and André Schulz
Computational Geometry, Theory and Applications 46 (2013),
959–969. (Special issue for the 28th European Workshop
on Computational Geometry (EuroCG'12)). doi:10.1016/j.comgeo.2013.04.005.
arXiv:1112.5904 [cs.CG].
|
| 136a. |
Reprint
of: Memory-constrained algorithms for simple polygons.
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer,
Günter Rote, and André Schulz
Computational Geometry, Theory and Applications 47 (2014),
469–479. (Special issue for the 28th European Workshop
on Computational Geometry (EuroCG'12)). doi:10.1016/j.comgeo.2013.11.004
arXiv:1112.5904 [cs.CG].
|
| 136b. |
Memory-constrained
algorithms for simple polygons.
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer,
Günter Rote, and André Schulz
In: Abstracts of the 28th European Workshop on Computational Geometry
(EuroCG'12), Assisi, Italy, March 2012, pp. 49–52, Editors: Walter
Didimo and Giuseppe Liotta.
|
| 137. |
Coloring
dynamic point sets on a line.
Jean Cardinal, Nathann Cohen, Sébastien Collette, Michael Hoffmann,
Stefan Langerman, and Günter Rote
In: Abstracts of the 28th European Workshop on Computational Geometry
(EuroCG'12), Assisi, Italy, March 2012, pp. 209–212, Editors: Walter
Didimo and Giuseppe Liotta.
|
| 137a. |
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, and Torsten Ueckerdt
In: Algorithms and Data Structures Symposium—WADS 2013,
August 2013, Editors: Frank Dehne, Roberto Solis-Oba, and
Jörg-Rüdiger Sack, Lecture Notes in Computer Science,
8037, Springer-Verlag, 2013, pp. 73–84. doi:10.1007/978-3-642-40104-6_7
arXiv:1302.2426 [cs.CG].
|
| 138. |
Add
isotropic Gaussian kernels at own risk: more and more resilient modes in
higher dimensions.
Herbert Edelsbrunner, Brittany Terese Fasy, and 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
|
| 138a. |
Add
isotropic Gaussian kernels at own risk: more and more resilient modes in
higher dimensions.
Herbert Edelsbrunner, Brittany Terese Fasy, and Günter Rote
Discrete and Computational Geometry, 49 (2013), 797–822. doi:10.1007/s00454-013-9517-x
|
| 139. |
Configuration
space visualization (video).
Dror Atariah and 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
|
| 140. |
Optimally
solving a transportation problem using Voronoi diagrams.
Darius Geiß, Rolf Klein, Rainer Penninger, and Günter
Rote
Computational Geometry, Theory and Applications 46 (2013),
1009–1016. (Special issue for the 28th European
Workshop on Computational Geometry (EuroCG'12)) doi:10.1016/j.comgeo.2013.05.005,
arXiv:1206.3057 [math.MG].
|
| 140a. |
(Unauthorized)
Reprint of: Optimally solving a transportation problem using Voronoi
diagrams.
Darius Geiß, Rolf Klein, Rainer Penninger, and Günter
Rote
Computational Geometry, Theory and Applications 47 (2014),
499–506. (Special issue for the 28th European
Workshop on Computational Geometry (EuroCG'12)) doi:10.1016/j.comgeo.2013.11.003,
arXiv:1206.3057 [math.MG].
|
| 141. |
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, and
John M. Sullivan
Geometriae Dedicata 166 (2013), 15–29. doi:10.1007/s10711-012-9782-5,
arXiv:1207.3605 [math.CO].
|
| 142. |
Topological
hypergraphs.
Sarit Buzaglo, Rom Pinchasi, and Günter Rote
In: Thirty Essays on Geometric Graph Theory, Editor: János
Pach, Springer-Verlag, 2013, pp. 71–81. doi:10.1007/978-1-4614-0110-0_6
|
| 143. |
The degree of
convexity.
Günter Rote
In: Abstracts of the 29th European Workshop on Computational Geometry
(EuroCG'13), Braunschweig, March 2013, Editor: Sándor Fekete,
pp. 69–72.
See Note
after publication (2017)
|
| 144. |
Quasi-parallel
segments and characterization of unique bichromatic matchings.
Andrei Asinowski, Tillmann Miltzow, and Günter Rote
Journal of Computational
Geometry 6 (2015), 185–219. doi:10.20382/jocg.v6i1a8, arXiv:1302.4400 [cs.CG].
|
| 144a. |
Quasi-parallel
segments and characterization of unique bichromatic matchings (extended
abstract).
Andrei Asinowski, Tillmann Miltzow, and Günter Rote
In: Abstracts of the 29th European Workshop on Computational Geometry
(EuroCG'13), Braunschweig, March 2013, Editor: Sándor Fekete,
pp. 225–228.
|
| 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, and
Günter Rote
Stud. Sci. Math. Hungarica 51 (2014), 466–519. doi:10.1556/SScMath.51.2014.4.1292,
arXiv:1304.6579 [math.DG].
|
| 146. |
Advantage
in the discrete Voronoi game.
Dániel Gerbner, Viola Mészáros, Dömötör
Pálvölgyi, Alexey Pokrovskiy, and Günter Rote
Journal of Graph Algorithms and
Applications 18, no. 3 (2014), 439–455. doi:10.7155/jgaa.00331, arXiv:1303.0523 [math.CO].
|
| 147. |
Convex
hull alignment through translation.
Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, and
Rodrigo I. Silveira
In: Proceedings of the 25th Canadian Conference on Computational Geometry,
(CCCG'2013), Waterloo, Ontario, August 2013, pp. 295–300.
|
| 148. |
Finitely
many smooth d-polytopes with n lattice points.
Tristram Bogart, Christian Haase, Milena Hering, Benjamin Lorenz, Benjamin
Nill, Andreas Paffenholz, Günter Rote, Francisco Santos, and Hal
Schenck
Israel Journal of Mathematics 207 (2015), 301–329. doi:10.1007/s11856-015-1175-7,
arXiv:1010.3887 [math.CO].
|
| 149. |
On
the parameterization and the geometry of the configuration space of a single
planar robot.
Dror Atariah, Sunayana Ghosh, and Günter Rote
Journal of WSCG 21 (2013), 11–20.
Papers from the 21st International Conference on Computer Graphics,
Visualization and Computer Vision, Plzeń, Czech Republic, June 24-27,
2013.
|
| 150. |
Recursively-regular
subdivisions and applications.
Rafel Jaume and Günter Rote
Journal of Computational
Geometry 7 (2016), 185–220. doi:10.20382/jocg.v7i1a10, arXiv:1310.4372 [cs.CG].
|
| 151. |
Lexicographic
Fréchet matchings (extended abstract).
Günter Rote
In: Abstracts of the 30th European Workshop on Computational Geometry
(EuroCG'14), Ein-Gedi, Israel, March 2014, Editors: Paz Carmi, Matthew Katz,
and Shakhar Smorodinsky, 4 pages.
|
| 152. |
λ > 4 (extended abstract).
Gill Barequet, Günter Rote, and Mira Shalah
In: Abstracts of the 30th European Workshop on Computational Geometry
(EuroCG'14), Ein-Gedi, Israel, March 2014, Editors: Paz Carmi, Matthew Katz,
and Shakhar Smorodinsky, 4 pages.
See Note
|
| 152a. |
λ > 4.
Gill Barequet, Günter Rote, and Mira Shalah
In: "Algorithms—ESA 2015", Proc. 23rd Annual European
Symposium on Algorithms, Patras, 2015. Editors: Nikhil
Bansal and Irene Finocchi. Lecture Notes in Computer Science
9294, Springer-Verlag, 2015, pp. 83–94. doi:10.1007/978-3-662-48350-3_8
See Note
|
| 152b. |
λ > 4: An improved lower bound
on the growth constant of polyominoes.
Gill Barequet, Günter Rote, and Mira Shalah
Communications of the ACM 59, No. 7, July 2016, 88–95.
doi:10.1145/2851485
See Note
|
| 153. |
Quality
ratios of measures for graph drawing styles.
Michael Hoffmann, Marc van Kreveld, Vincent Kusters, and Günter
Rote
In: Proceedings of the
26th Canadian Conference on Computational Geometry, (CCCG'2014), Halifax,
August 2014, 7 pages.
|
| 154. |
Graph
drawings with relative edge length specifications.
Oswin Aichholzer, Michael Hoffmann, Marc van Kreveld, and Günter
Rote
In: Proceedings of the
26th Canadian Conference on Computational Geometry, (CCCG'2014), August 2014,
7 pages.
|
| 155. |
Search
for the end of a path in the d-dimensional grid and in other graphs.
Dániel Gerbner, Balázs Keszegh, Dömötör
Pálvölgyi, Günter Rote, and Gábor Wiener
Ars Mathematica
Contemporanea 12 (no. 2) (2017), 301–314. doi:10.26493/1855-3974.788.89a
|
| 156. |
Point
sets with many non-crossing matchings.
Andrei Asinowski and Günter Rote
Computational Geometry, Theory
and Applications 68 (2018), 7–33. doi:10.1016/j.comgeo.2017.05.006,
arXiv:1502.04925 [cs.CG].
|
| 157. |
Shortest
path to a segment and quickest visibility queries.
Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell,
Valentin Polishchuk, Günter Rote, Lena Schlipf, and Topi Talvitie
Journal of Computational Geometry
7 (2016), 77–100 (Special issue for the 31st International
Symposium on Computational Geometry (SoCG 2015)). doi:10.20382/jocg.v7i2a5
|
| 157a. |
Shortest
path to a segment and quickest visibility queries.
Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell,
Valentin Polishchuk, Günter Rote, Lena Schlipf, and Topi Talvitie
In: 31st International Symposium on Computational Geometry (SoCG 2015),
Eindhoven, June 2015. Editors: Lars Arge and János Pach, Leibniz
International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2015, Vol. 34, pp. 658–673. doi:10.4230/LIPIcs.SOCG.2015.658
|
| 157b. |
Shortest
inspection-path queries in simple polygons.
Christian Knauer, Günter Rote, and Lena Schlipf
(preliminary version of partial results from 157.)
In: Abstracts of the 24th European Workshop on Computational Geometry, Nancy,
March 2008, pp. 153–156.
|
| 158. |
Saturated
simple and 2-simple topological graphs with few edges.
Péter Hajnal, Alexander Igamberdiev, Günter Rote, and André
Schulz
In: 41st International Workshop on Graph-Theoretic Concepts in
Computer Science—WG 2015, Garching, Germany, June 2015, Revised
Papers. Editor: Ernst Mayr, Lecture Notes in Computer Science,
9224, Springer-Verlag, 2016, pp. 391–405. doi:10.1007/978-3-662-53174-7_28,
arXiv:1503.01386 [cs.CG].
|
| 158a. |
Saturated
simple and 2-simple topological graphs with few edges.
Péter Hajnal, Alexander Igamberdiev, Günter Rote, and André
Schulz
Journal of Graph Algorithms and
Applications 22, no. 1 (2017), 117–138, special
issue on "Graph Drawing Beyond Planarity". doi:10.7155/jgaa.00460
|
| 159. |
Windrose
planarity: embedding graphs with direction-constrained edges.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di
Donato, Philipp Kindermann, Günter Rote, and Ignaz Rutter
In: Proceedings of the 27th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA16), San Francisco, January 2016, Editor:
Robert Krauthgamer, pp. 985–996, SIAM. doi:10.1137/1.9781611974331.ch70,
|
| 159a. |
Windrose
planarity: embedding graphs with direction-constrained edges.
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di
Donato, Philipp Kindermann, Günter Rote, and Ignaz Rutter
ACM Transactions on Algorithms 14 (September 2018),
Article 54, 54:1–54:24. doi:10.1145/3239561 arXiv:1510.02659 [cs.CG].
|
| 160. |
Optimal
triangulation of saddle surfaces.
Dror Atariah, Günter Rote, and Mathijs Wintraecken
Beiträge zur Algebra und Geometrie—Contributions to Algebra
and Geometry 59, no. 1 (2018), 113–126. doi:10.1007/s13366-017-0351-9,
arXiv:1511.01361 [math.MG].
|
| 161. |
Congruence
testing of point sets in three and four dimensions—Results and techniques
(invited talk).
Günter Rote
In: Sixth International Conference on Mathematical Aspects of Computer
and Information Sciences—MACIS 2015, November 2015, Editors: Ilias
S. Kotsireas, Siegfried Rump, and Chee Yap, Lecture Notes in Computer
Science, 9582, Springer-Verlag, 2016, pp. 50–59. doi:10.1007/978-3-319-32859-1_4
|
| 162. |
Congruence
testing of point sets in 4-space.
Heuna Kim and Günter Rote
In: 32st International Symposium on Computational Geometry (SoCG 2016),
Boston, June 2016. Editors: Sándor Fekete and Anna Lubiw, Leibniz
International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2016, Vol. 51, pp. 48:1–48:16. doi:10.4230/LIPIcs.SOCG.2016.48
|
| 162a. |
Congruence
testing of point sets in 4 dimensions.
Heuna Kim and Günter Rote
Manuscript, March 2016, 41 pages, arXiv:1603.07269 [cs.CC].
|
| 163. |
Approximation
and hardness for token swapping.
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis
Thomas, and Takeaki Uno
In: "Algorithms—ESA 2016", Proc. 24th Annual European
Symposium on Algorithms, Aarhus, 2016. Editors: Piotr Sankowski
and Christos Zaroliagis. Leibniz International Proceedings in
Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für
Informatik, 2016, pp. 185:1–185:15. doi:10.4230/LIPIcs.ESA.2016.185,
arXiv:1602.05150 [cs.CC],
19 pages.
|
| 164. |
Loopless
Gray code enumeration and the Tower of Bucharest.
Felix Herter and Günter Rote
In: Proceedings of the 8th International Conference on Fun with
Algorithms (FUN 2016). La Maddalena, Italy, June 8-10, 2016. Editors:
Erik D. Demaine and Fabrizio Grandoni, Leibniz International Proceedings
in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für
Informatik, 2016, Vol. 49, pp. 19:1–19:19. doi:10.4230/LIPIcs.FUN.2016.19,
arXiv:1604.06707 [cs.DM].
See Note
on the python programs in the appendix
|
| 164a. |
Loopless
Gray code enumeration and the Tower of Bucharest.
Felix Herter and Günter Rote
Theoretical Computer Science 748 (2018), 40–54,
special issue for FUN'2016. doi:10.1016/j.tcs.2017.11.017.
|
| 165. |
Packing
short plane spanning trees in complete geometric graphs.
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz,
Günter Rote, André van Renssen, Marcel Roeloffzen, and Birgit
Vogtenhuber
In: "27th International Symposium on Algorithms and Computation (ISAAC
2016)", Editor: Seok-Hee Hong. Leibniz International Proceedings
in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für
Informatik, 2016, Vol. 64, pp. 9:1–9:12. doi:10.4230/LIPIcs.ISAAC.2016.9.
|
| 165a. |
Packing
plane spanning graphs with short edges in complete geometric graphs.
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André
van Renssen, Marcel Roeloffzen, Günter Rote, and Birgit Vogtenhuber
Computational Geometry, Theory
and Applications 82 (2019), 1–15. doi:10.1016/j.comgeo.2019.04.001,
arXiv:1703.05863 [cs.CG].
|
| 166. |
Convex
equipartitions of colored point sets.
Pavle V. M. Blagojević, Günter Rote, Johanna K. Steinmeyer, and
Günter M. Ziegler
Discrete and Computational Geometry 61 (2019), 355–363, doi:10.1007/s00454-017-9959-7,
arXiv:1705.03953 [math.CO].
|
| 167. |
Ordered
level planarity and geodesic planarity.
Boris Klemz and Günter Rote
In: Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG
2017), Malmö, Sweden, April 2017, pp. 269–272.
|
| 167a. |
Ordered
level planarity, geodesic planarity and bi-monotonicity.
Boris Klemz and Günter Rote
In: "Graph Drawing and Network Visualization". GD 2017, Proceedings
of the 25th International Symposium on Graph Drawing and Network
Visualization, Boston, September 2017, Revised Selected Papers. Editors:
Frabrizio Frati and Kwan-Liu Ma, Lecture Notes in Computer Science,
10692, Springer-Verlag, 2018, pp. 440–453, doi:10.1007/978-3-319-73915-1_34.
Best paper award.
|
| 167b. |
Ordered
level planarity and its relationship to geodesic planarity, bi-monotonicity, and
variations of level planarity.
Boris Klemz and Günter Rote
ACM Transactions on Algorithms 15 (2019), Article 53, 53:1–53:25.
doi:10.1145/3359587, arXiv:1708.07428 [cs.CG].
|
| 168. |
Linear-time
algorithms for maximum-weight induced matchings and minimum chain covers in
convex bipartite graphs.
Boris Klemz and Günter Rote
Algorithmica 84 (2022), 1064–1080. doi:10.1007/s00453-021-00904-w,
arXiv:1711.04496 [cs.DS].
|
| 169. |
Area
difference bounds for dissections of a square into an odd number of
triangles.
Jean-Philippe Labbé, Günter Rote, and Günter M.
Ziegler
Experimental Mathematics 29 (2020), 253–275, doi:10.1080/10586458.2018.1459961,
arXiv:1708.02891 [math.MG]
|
| 170. |
On
primal-dual circle representations.
Stefan Felsner and Günter Rote
In: Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA 2019),
San Diego, January 2019, Editors: Jeremy Fineman and Michael Mitzenmacher,
OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2019, Vol. 69, pp. 8:1–8:18. doi:10.4230/OASIcs.SOSA.2019.8
|
| 170a. |
On
primal-dual circle representations.
Stefan Felsner and Günter Rote
In: Abstracts of the 34th European Workshop on Computational Geometry (EuroCG
2018), Berlin, March 2018, pp. 72:1–72:6.
|
| 171. |
The algebraic
conspiracy.
Günter Rote and Mikkel Abrahamsen
In: Oberwolfach Reports, 14, European Mathematical Society
- Publishing House, 2017, pp. 1180–1182. doi:10.4171/OWR/2017/19
|
| 172. |
Approximate
minimum-weight matching with outliers under translation.
Pankaj Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote,
Micha Sharir, and Allen Xiao
In: "29th International Symposium on Algorithms and Computation (ISAAC
2018), Jiaoxi, Yilan, Taiwan, December 2018". Editors: Wen-Lian Hsu,
Der-Tsai Lee, and Chung-Shou Liao. Leibniz International Proceedings
in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für
Informatik, 2015, Vol. 123, pp. 26:1–26:13. doi:10.4230/LIPIcs.ISAAC.2018.26
|
| 173. |
Every
collinear set in a planar graph is free.
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, and
Günter Rote
In: Proceedings of the 30th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA19), San Diego, January 2019, Editor:
Timothy Chan. pp. 1521–1538, SIAM. doi:10.1137/1.9781611975482.92,
arXiv:1811.03432 [math.CO].
|
| 173a. |
Every
collinear set in a planar graph is free.
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, and
Günter Rote
Discrete and Computational Geometry 65 (2021), 999–1027, doi:10.1007/s00454-019-00167-x
|
| 174. |
The
maximum number of minimal dominating sets in a tree.
Günter Rote
In: Proceedings of the 30th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA19), San Diego, January 2019, Editor:
Timothy Chan. pp. 1201–1214, SIAM. doi:10.1137/1.9781611975482.73
|
| 174a. |
Minimal
dominating sets in a tree: counting, enumeration, and extremal results.
Günter Rote
Manuscript, March 2019, submitted for publication. arXiv:1903.04517 [cs.DM].
|
| 175. |
Isotonic
regression by dynamic programming.
Günter Rote
In: Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA 2019),
San Diego, January 2019, Editors: Jeremy Fineman and Michael Mitzenmacher,
OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2019, Vol. 69, pp. 1:1–1:18 doi:10.4230/OASIcs.SOSA.2019.1
|
| 176. |
Geometric
multicut.
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, and Günter
Rote
In: 46th International Colloquium on Automata, Languages, and Programming
(ICALP 2019), Patras, July 2019. Editors: Christel Baier, Ioannis
Chatzigiannakis, Paola Flocchini, and Stefano Leonardi. Leibniz International
Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für
Informatik, 2019, Vol. 132, pp. 9:1–9:15. doi:10.4230/LIPIcs.ICALP.2019.9,
arXiv:1902.04045 [cs.CG].
|
| 176a. |
Geometric
multicut: shortest fences for separating groups of objects in the plane.
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, and Günter
Rote
Discrete & Computational Geometry 64 (2020), 575–607, doi:10.1007/s00454-020-00232-w.
|
| 177. |
Random
polytopes and the wet part for arbitrary probability distributions.
Imre Bárány, Matthieu Fradelizi, Xavier Goaoc, Alfredo Hubard,
and Günter Rote
Annales Henri
Lebesgue 3 (2020), 701–715. doi:10.5802/ahl.44, arXiv:1902.06519 [math.PR].
|
| 178. |
The
number of convex polyominoes with given height and width.
Kevin Buchin, Man-Kwun Chiu, Stefan Felsner, Günter Rote, and
André Schulz
Manuscript, March 2019, 18 pages, arXiv:1903.01095 [math.CO], submitted for
publication.
|
| 179. |
Characterization
of the response maps of alternating-current networks.
Günter Rote
Electronic Journal
of Linear Algebra, 36 (2020), 697–703. doi:10.13001/ela.2020.4981, arXiv:1904.02031 [math.CO],
See Note
on Priority
|
| 180. |
The
geometric dilation of three points.
Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, and Günter
Rote
Journal of Computational
Geometry 10, no. 1 (2019), 532–549. doi:10.20382/jocg.v10i1a18
|
| 181. |
An
improved upper bound on the growth constant of polyiamonds.
Gill Barequet, Günter Rote, and Mira Shalah
in: European Conference on Combinatorics, Graph Theory and Applications
(EuroComb 2019), Bratislava, 26–30 August 2019, Editors:
Jaroslav Nešetřil and Martin Škoviera, Acta Mathematica
Universitatis Comenianae (AMUC) 88 (2019), pp. 429–436.
|
| 182. |
The
largest contained quadrilateral and the smallest enclosing parallelogram of a
convex polygon.
Günter Rote
Manuscript, June 2019, 11 pages, arXiv:1905.11203 [cs.CG].
|
| 183. |
FPT
algorithms for diverse collections of hitting sets.
Julien Baste, Lars Jaffke, Tomáš Masařík,
Geevarghese Philip, and Günter Rote
Algorithms
12 (2019), Article 254, 18 pages. doi:10.3390/a12120254, arXiv:1911.05032 [cs.DS].
See Errata
|
| 183a. |
Reprint
of: FPT algorithms for diverse collections of hitting sets.
Julien Baste, Lars Jaffke, Tomáš Masařík,
Geevarghese Philip, and Günter Rote
In: "New Frontiers in Parameterized Complexity and Algorithms".
Editors: Frances Rosamond, Neeldhara Misra, and Meirav
Zehavi. MDPI, 2024, pp. 122–139. doi:10.3390/books978-3-7258-1302-5.
|
| 184. |
PL Morse theory
in low dimensions.
Romain Grunert, Wolfgang Kühnel, and Günter Rote
Advances in Geometry 23 (2023), 135–150. doi:10.1515/advgeom-2022-0027
arXiv:1912.05054 [math.GT]
|
| 185. |
An
almost optimal bound on the number of intersections of two simple
polygons.
Eyal Ackerman, Balázs Keszegh, and Günter Rote
In: 36th International Symposium on Computational Geometry (SoCG 2020),
Zürich, June 2020. Editors: Sergio Cabello and Danny Z. Chen, Leibniz
International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2020, Vol. 164, pp. 1:1–1:18. doi:10.4230/LIPIcs.SOCG.2020.1
arXiv:2002.05680 [math.CO].
|
| 185a. |
An
almost optimal bound on the number of intersections of two simple
polygons.
Eyal Ackerman, Balázs Keszegh, and Günter Rote
Discrete and Computational Geometry 68 (2022), 1049–1077, doi:10.1007/s00454-022-00438-0.
|
| 186. |
Optimal
strategies in fractional games: vertex cover and domination.
Csilla Bujtás, Günter Rote, and Zsolt Tuza
Ars Mathematica Contemporanea
24 (no. #P3.05) (2024), 1–19. doi:10.26493/1855-3974.2771.4df
arXiv:2105.03890 [math.CO].
|
| 187. |
On
the number of compositions of two polycubes.
Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda,
and Günter Rote
Computing in Geometry and
Topology 3, no. 1 (2024), 4:1–4:18. doi:10.57717/cgt.v3i1.41
|
| 187a. |
On
the number of compositions of two polycubes.
Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda,
and Günter Rote
In: Extended Abstracts EuroComb 2021, European Conference on
Combinatorics, Graph Theory and Applications, Editors: Jaroslav
Nešetřil, Guillem Perarnau, Juanjo Rué, and Oriol
Serra, Springer-Verlag, 2021, pp. 71–77. doi:10.1007/978-3-030-83823-2_12
|
| 188. |
Removing
popular faces in curve arrangements.
Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana
Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter
Rote
In: "Graph Drawing and Network Visualization". GD 2023, Proceedings
of the 31th International Symposium on Graph Drawing and Network
Visualization, Palermo, September 2023, Revised Selected Papers, Part II.
Editors: Michael A. Bekos and Markus Chimani, Lecture Notes in Computer
Science, 14466, Springer-Verlag, 2023, pp. 18–33. doi:10.1007/978-3-031-49275-4_2.
Full version in arXiv:2202.12175
[cs.CG]
|
| 188a. |
Removing
popular faces in curve arrangements.
Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana
Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter
Rote
Journal of Graph Algorithms and Applications
(2024), submitted for publication.
|
| 188b. |
Removing
popular faces in curve arrangements by inserting one more curve.
Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana
Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter
Rote
In: Abstracts of
the 38th European Workshop on Computational Geometry (EuroCG 2022), Perugia,
March 14–16, 2022, Editors: Emilio Di Giacomo and Fabrizio Montecchiani,
pp. 38:1–38:8.
|
| 189. |
Towards
a geometric understanding of the 4-dimensional point groups.
Laith Rastanawi and Günter Rote
Manuscript, May 2022, arXiv:2205.04965 [math.MG]
|
| 190. |
The
Generalized Combinatorial Lasoń–Alon–Zippel–Schwartz
Nullstellensatz Lemma.
Günter Rote
Manuscript, May 2023, arXiv:2305.10900 [math.CO]
|
| 191. |
Grid peeling of
parabolas.
Günter Rote, Moritz Rüber, and Morteza Saghafian
In: 40th International Symposium on Computational Geometry (SoCG 2024),
Athens, June 2024. Editors: Wolfgang Mulzer and Jeff M. Phillips, Leibniz
International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum
für Informatik, 2024, Vol. 293, pp. 76:1–76:18. doi:10.4230/LIPIcs.SOCG.2024.76
arXiv:2402.15787 [cs.CG].
|
| 192. |
Probabilistic
Finite Automaton Emptiness is undecidable.
Günter Rote
Manuscript, June 2024, 63 pages, arXiv:2405.03035 [cs.FL]
|
| 193. |
Probabilistic
Finite Automaton Emptiness is undecidable for a fixed automaton.
Günter Rote
Manuscript, December 2024, 27 pages, arXiv:2412.05198 [cs.FL]
|