Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünter Rote
Person information
- affiliation: FU Berlin, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j98]Boris Klemz
, Günter Rote:
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica 84(4): 1064-1080 (2022)- [j97]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. Discret. Comput. Geom. 68(4): 1049-1077 (2022) - [i33]Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. CoRR abs/2202.12175 (2022) - 2021
- [j96]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. 65(4): 999-1027 (2021) - 2020
- [j95]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020) - [j94]Jean-Philippe Labbé, Günter Rote, Günter M. Ziegler:
Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles. Exp. Math. 29(3): 253-275 (2020) - [c87]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. SoCG 2020: 1:1-1:18 - [i32]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An almost optimal bound on the number of intersections of two simple polygons. CoRR abs/2002.05680 (2020)
2010 – 2019
- 2019
- [j93]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12(12): 254 (2019) - [j92]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber:
Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom. 82: 1-15 (2019) - [j91]Pavle V. M. Blagojevic, Günter Rote, Johanna K. Steinmeyer, Günter M. Ziegler:
Convex Equipartitions of Colored Point Sets. Discret. Comput. Geom. 61(2): 355-363 (2019) - [j90]Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote:
The geometric dilation of three points. J. Comput. Geom. 10(1): 532-549 (2019) - [j89]Boris Klemz, Günter Rote:
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. ACM Trans. Algorithms 15(4): 53:1-53:25 (2019) - [c86]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. ICALP 2019: 9:1-9:15 - [c85]Günter Rote:
Isotonic Regression by Dynamic Programming. SOSA 2019: 1:1-1:18 - [c84]Stefan Felsner, Günter Rote:
On Primal-Dual Circle Representations. SOSA 2019: 8:1-8:18 - [c83]Günter Rote:
The Maximum Number of Minimal Dominating Sets in a Tree. SODA 2019: 1201-1214 - [c82]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph Is Free. SODA 2019: 1521-1538 - [i31]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. CoRR abs/1902.04045 (2019) - [i30]Günter Rote:
Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results. CoRR abs/1903.04517 (2019) - [i29]Günter Rote:
The Largest Quadrilateral in a Convex Polygon. CoRR abs/1905.11203 (2019) - [i28]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR abs/1911.05032 (2019) - 2018
- [j88]Andrei Asinowski, Günter Rote:
Point sets with many non-crossing perfect matchings. Comput. Geom. 68: 7-33 (2018) - [j87]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22(1): 117-138 (2018) - [j86]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms 14(4): 54:1-54:24 (2018) - [j85]Felix Herter, Günter Rote:
Loopless Gray code enumeration and the Tower of Bucharest. Theor. Comput. Sci. 748: 40-54 (2018) - [c81]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC 2018: 26:1-26:13 - [i27]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers under Translation. CoRR abs/1810.10466 (2018) - 2017
- [j84]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12(2): 301-314 (2017) - [c80]Boris Klemz, Günter Rote:
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. GD 2017: 440-453 - [i26]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Graphs in Complete Geometric Graphs. CoRR abs/1703.05863 (2017) - [i25]Boris Klemz, Günter Rote:
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. CoRR abs/1708.07428 (2017) - [i24]Boris Klemz, Günter Rote:
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. CoRR abs/1711.04496 (2017) - 2016
- [j83]Gill Barequet, Günter Rote, Mira Shalah:
λ > 4: an improved lower bound on the growth constant of polyominoes. Commun. ACM 59(7): 88-95 (2016) - [j82]Rafel Jaume, Günter Rote:
Recursively-regular subdivisions and applications. J. Comput. Geom. 7(1): 185-220 (2016) - [j81]Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. J. Comput. Geom. 7(2): 77-100 (2016) - [c79]Heuna Kim, Günter Rote:
Congruence Testing of Point Sets in 4-Space. SoCG 2016: 48:1-48:16 - [c78]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Approximation and Hardness of Token Swapping. ESA 2016: 66:1-66:15 - [c77]Felix Herter, Günter Rote:
Loopless Gray Code Enumeration and the Tower of Bucharest. FUN 2016: 19:1-19:19 - [c76]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC 2016: 9:1-9:12 - [c75]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA 2016: 985-996 - [i23]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR abs/1602.05150 (2016) - [i22]Heuna Kim, Günter Rote:
Congruence Testing of Point Sets in 4 Dimensions. CoRR abs/1603.07269 (2016) - [i21]Felix Herter, Günter Rote:
Loopless Gray Code Enumeration and the Tower of Bucharest. CoRR abs/1604.06707 (2016) - 2015
- [j80]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. J. Graph Algorithms Appl. 19(1): 43-65 (2015) - [j79]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. 6(1): 185-219 (2015) - [c74]Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest Path to a Segment and Quickest Visibility Queries. SoCG 2015: 658-673 - [c73]Gill Barequet, Günter Rote, Mira Shalah:
λ > 4. ESA 2015: 83-94 - [c72]Günter Rote:
Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques. MACIS 2015: 50-59 - [c71]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated Simple and 2-simple Topological Graphs with Few Edges. WG 2015: 391-405 - [i20]Andrei Asinowski, Günter Rote:
Point sets with many non-crossing matchings. CoRR abs/1502.04925 (2015) - [i19]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. CoRR abs/1503.01386 (2015) - [i18]Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR abs/1510.02659 (2015) - 2014
- [j78]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47(3): 469-479 (2014) - [j77]Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Reprint of: Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. 47(3): 499-506 (2014) - [j76]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber:
Plane Graphs with Parity Constraints. Graphs Comb. 30(1): 47-69 (2014) - [j75]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. 18(3): 439-457 (2014) - [c70]Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote:
Graph Drawings with Relative Edge Length Specifications. CCCG 2014 - [c69]Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote:
Quality Ratios of Measures for Graph Drawing Styles. CCCG 2014 - 2013
- [j74]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. 46(7): 839-860 (2013) - [j73]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Memory-constrained algorithms for simple polygons. Comput. Geom. 46(8): 959-969 (2013) - [j72]Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. 46(8): 1009-1016 (2013) - [j71]Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions. Discret. Comput. Geom. 49(4): 797-822 (2013) - [j70]Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded Degree Triangulations. Graphs Comb. 29(6): 1577-1593 (2013) - [j69]Dror Atariah, Sunayana Ghosh, Günter Rote:
On the Parameterization and the Geometry of the Configuration Space of a Single Planar Robot. J. WSCG 21(1): 11-20 (2013) - [c68]Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira:
Convex hull alignment through translation. CCCG 2013 - [c67]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i17]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i16]Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings. CoRR abs/1302.4400 (2013) - [i15]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. CoRR abs/1303.0523 (2013) - [i14]Rafel Jaume, Günter Rote:
The finest regular coarsening and recursively-regular subdivisions. CoRR abs/1310.4372 (2013) - 2012
- [j68]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed drawings of planar graphs. Comput. Geom. 45(9): 482-494 (2012) - [c66]Adrian Dumitrescu, Günter Rote, Csaba D. Tóth:
Monotone Paths in Planar Convex Subdivisions. COCOON 2012: 240-251 - [c65]Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. SCG 2012: 91-100 - [c64]Dror Atariah, Günter Rote:
Configuration space visualization. SCG 2012: 415-416 - 2011
- [j67]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? Comput. Geom. 44(2): 82-94 (2011) - [j66]Ares Ribó Mor, Günter Rote, André Schulz:
Small Grid Embeddings of 3-Polytopes. Discret. Comput. Geom. 45(1): 65-87 (2011) - [j65]Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote:
Lines Pinning Lines. Discret. Comput. Geom. 45(2): 230-260 (2011) - [j64]Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang:
Constant-Work-Space Algorithms for Geometric Problems. J. Comput. Geom. 2(1): 46-68 (2011) - [j63]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote:
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011) - [c63]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara:
Common Developments of Several Different Orthogonal Boxes. CCCG 2011 - [c62]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. CCCG 2011 - [c61]Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote:
Proper n-Cell Polycubes in n - 3 Dimensions. COCOON 2011: 180-191 - [c60]Günter Rote:
Realizing Planar Graphs as Convex Polytopes. GD 2011: 238-241 - [c59]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. GD 2011: 296-307 - [c58]Günter Rote, Uri Zwick:
Collapse. SODA 2011: 603-613 - [i13]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Memory-Constrained Algorithms for Simple Polygons. CoRR abs/1112.5904 (2011) - 2010
- [j62]Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and growth rates of high-dimensional polycubes. Comb. 30(3): 257-275 (2010) - [j61]Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote:
Locked and Unlocked Chains of Planar Shapes. Discret. Comput. Geom. 44(2): 439-462 (2010) - [j60]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [j59]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14(2): 367-384 (2010) - [j58]Kenneth L. Clarkson, Günter Rote:
Welcome from the Editors-in-Chief. J. Comput. Geom. 1(1): 1-2 (2010) - [j57]Sergio Cabello, Günter Rote:
Obnoxious Centers in Graphs. SIAM J. Discret. Math. 24(4): 1713-1730 (2010) - [i12]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? CoRR abs/1009.5628 (2010)
2000 – 2009
- 2009
- [j56]Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter:
Recovering Structure from r-Sampled Objects. Comput. Graph. Forum 28(5): 1349-1360 (2009) - [j55]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42(8): 772-789 (2009) - [j54]Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and Growth Rates of High-Dimensional Polycubes. Electron. Notes Discret. Math. 34: 459-463 (2009) - [j53]Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded-Degree Triangulations. Electron. Notes Discret. Math. 34: 509-513 (2009) - [j52]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44(2): 160-174 (2009) - [c57]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c56]Tetsuo Asano, Günter Rote:
Constant-Working-Space Algorithms for Geometric Problems. CCCG 2009: 87-90 - [c55]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? CCCG 2009: 145-148 - [c54]Panos Giannopoulos, Christian Knauer, Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC 2009: 198-209 - [c53]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber:
Plane Graphs with Parity Constraints. WADS 2009: 13-24 - [c52]Günter Rote, André Schulz:
Resolving Loads with Positive Interior Stresses. WADS 2009: 530-541 - [i11]Günter Rote:
Two Applications of Point Matching. Computational Geometry 2009 - [i10]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
The parameterized complexity of some geometric problems in unbounded dimension. CoRR abs/0906.3469 (2009) - [i9]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. CoRR abs/0906.3896 (2009) - [i8]Ares Ribó Mor, Günter Rote, André Schulz:
Small grid embeddings of 3-polytopes. CoRR abs/0908.0488 (2009) - 2008
- [j51]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39(2): 118-133 (2008) - [j50]Robert L. Scot Drysdale, Günter Rote, Astrid Sturm:
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comput. Geom. 41(1-2): 31-47 (2008) - [j49]Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote:
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 39(1-3): 3-16 (2008) - [j48]Wolfgang Mulzer, Günter Rote:
Minimum-weight triangulation is NP-hard. J. ACM 55(2): 11:1-11:29 (2008) - [c51]Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote:
Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG 2008 - [c50]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA 2008: 836-843 - 2007
- [j47]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote:
On the geometric dilation of closed curves, graphs, and point sets. Comput. Geom. 36(1): 16-38 (2007) - [j46]Günter Rote:
Computing the Fréchet distance between piecewise smooth curves. Comput. Geom. 37(3): 162-174 (2007) - [j45]Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007) - [c49]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs. CCCG 2007: 237-240 - [c48]Ares Ribó Mor, Günter Rote, André Schulz:
Embedding 3-polytopes on a small grid. SCG 2007: 112-118 - [c47]Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote:
There are not too many magic configurations. SCG 2007: 142-149 - [c46]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3. SCG 2007: 275-283 - [c45]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. FUN 2007: 16-29 - [c44]