default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünter Rote
Person information
- affiliation: FU Berlin, Institute of Computer Science, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j99]Phoebe de Nooijer, Soeren Terziadis
, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. J. Graph Algorithms Appl. 28(2): 47-82 (2024)- [c89]Günter Rote, Moritz Rüber, Morteza Saghafian:
Grid Peeling of Parabolas. SoCG 2024: 76:1-76:18 - [i36]Günter Rote, Moritz Rüber, Morteza Saghafian:
Grid Peeling of Parabolas. CoRR abs/2402.15787 (2024) - [i35]Günter Rote:
Probabilistic Finite Automaton Emptiness is undecidable. CoRR abs/2405.03035 (2024) - [i34]Günter Rote:
Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton. CoRR abs/2412.05198 (2024) - 2023
- [c88]Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. GD (2) 2023: 18-33 - 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]Sergio Cabello, Günter Rote:
Obnoxious centers in graphs. SODA 2007: 98-107 - [c43]Günter Rote, Martin Zachariasen:
Matrix scaling by network flow. SODA 2007: 848-854 - 2006
- [j44]Günter Rote, André Schulz:
Threshold arrangements and the knapsack problem. Appl. Math. Lett. 19(1): 108-112 (2006) - [c42]Wolfgang Mulzer, Günter Rote:
Minimum weight triangulation is NP-hard. SCG 2006: 1-10 - [c41]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. SCG 2006: 61-70 - [c40]Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. SWAT 2006: 268-279 - [i7]Wolfgang Mulzer, Günter Rote:
Minimum-weight triangulation is NP-hard. CoRR abs/cs/0601002 (2006) - [i6]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. CoRR abs/cs/0604022 (2006) - 2005
- [j43]Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote:
Simple and optimal output-sensitive construction of contour trees using monotone paths. Comput. Geom. 30(2): 165-195 (2005) - [j42]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1-2): 31-61 (2005) - [c39]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 - [c38]Günter Rote:
Strictly convex drawings of planar graphs. SODA 2005: 728-734 - [c37]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote:
On Geometric Dilation and Halving Chords. WADS 2005: 244-255 - [e1]Joseph S. B. Mitchell, Günter Rote:
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. ACM 2005, ISBN 1-58113-991-8 [contents] - [i5]Adrian Dumitrescu, Ansgar Grüne, Günter Rote:
Improved lower bound on the geometric dilation of point sets. EuroCG 2005: 37-40 - [i4]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 - [i3]Günter Rote, André Schulz:
A pointed Delaunay pseudo-triangulation of a simple polygon. EuroCG 2005: 77-80 - [i2]Imre Bárány, Günter Rote:
Strictly convex drawings of planar graphs. CoRR abs/cs/0507030 (2005) - 2004
- [j41]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering with Ellipses. Algorithmica 38(1): 145-160 (2004) - [j40]David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley:
Non-Crossing Frameworks with Non-Crossing Reciprocals. Discret. Comput. Geom. 32(4): 567-600 (2004) - [c36]Adrian Dumitrescu, Günter Rote:
On the Fréchet distance of a set of curves. CCCG 2004: 162-165 - 2003
- [j39]Robert Connelly, Erik D. Demaine, Günter Rote:
Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Discret. Comput. Geom. 30(2): 205-239 (2003) - [j38]Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk:
Matching planar maps. J. Algorithms 49(2): 262-283 (2003) - [c35]Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu:
On Constrained Minimum Pseudotriangulations. COCOON 2003: 445-454 - [c34]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. SCG 2003: 154-163 - [c33]Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides:
The complexity of (un)folding. SCG 2003: 164-170 - [c32]Nina Amenta, Sunghee Choi, Günter Rote:
Incremental constructions con BRIO. SCG 2003: 211-219 - [c31]Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote:
Finding a curve in a map. SCG 2003: 384-385 - [c30]Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. GD 2003: 283-294 - [c29]Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk:
Matching planar maps. SODA 2003: 589-598 - [c28]Günter Rote:
Pursuit-evasion with imprecise target location. SODA 2003: 747-753 - [c27]Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation. WADS 2003: 377-388 - 2002
- [j37]Günter Rote:
Crossing the Bridge at Night. Bull. EATCS 78: 241- (2002) - [c26]Günter Rote:
Pseudotriangulations, polytopes, and how to expand linkages. SCG 2002: 133-134 - [c25]Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger:
Toward Optimal Diffusion Matrices. IPDPS 2002 - [c24]Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering shapes by ellipses. SODA 2002: 453-454 - 2001
- [j36]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized self-approaching curves. Discret. Appl. Math. 109(1-2): 3-24 (2001) - [j35]Peter Braß, Günter Rote, Konrad J. Swanepoel:
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. Discret. Comput. Geom. 26(1): 51-58 (2001) - [j34]Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote:
The Obnoxious Center Problem on a Tree. SIAM J. Discret. Math. 14(4): 498-509 (2001) - [c23]Günter Rote:
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. Computational Discrete Mathematics 2001: 119-135 - [c22]Friedrich Eisenbrand, Günter Rote:
Fast Reduction of Ternary Quadratic Forms. CaLC 2001: 32-44 - [c21]Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink:
Counting triangulations and pseudo-triangulations of wheels. CCCG 2001: 149-152 - [c20]Friedrich Eisenbrand, Günter Rote:
Fast 2-Variable Integer Programming. IPCO 2001: 78-89 - 2000
- [j33]Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang:
A Central Limit Theorem for Convex Chains in the Square. Discret. Comput. Geom. 23(1): 35-50 (2000) - [j32]Tamás Fleiner, Volker Kaibel, Günter Rote:
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. Eur. J. Comb. 21(1): 121-130 (2000) - [c19]Robert Connelly, Erik D. Demaine, Günter Rote:
Straighting Polygonal Arcs and Convexifying Polygonal Cycles. FOCS 2000: 432-442 - [i1]Robert Connelly, Erik D. Demaine, Günter Rote:
Every Polygon Can Be Untangled. EuroCG 2000: 62-65
1990 – 1999
- 1998
- [j31]Günter Rote, Gerhard J. Woeginger:
Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times. Acta Cybern. 13(4): 423-430 (1998) - [j30]Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica 21(1): 89-103 (1998) - [j29]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2): 77-87 (1998) - [j28]Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu:
Constant-Level Greedy Triangulations Approximate the MWT Well. J. Comb. Optim. 2(4): 361-369 (1998) - [j27]Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle:
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(3): 1-16 (1998) - [j26]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. 82: 125-158 (1998) - [j25]Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. IEEE Trans. Inf. Theory 44(5): 1770-1781 (1998) - [c18]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized Self-Approaching Curves. ISAAC 1998: 317-326 - 1997
- [j24]Johann Hagauer, Günter Rote:
Three-clustering of Points in the Plane. Comput. Geom. 8: 87-95 (1997) - [j23]Oswin Aichholzer, Helmut Alt, Günter Rote:
Matching Shapes with a Reference Point. Int. J. Comput. Geom. Appl. 7(4): 349-363 (1997) - [j22]Günter Rote:
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. Theor. Comput. Sci. 172(1-2): 303-308 (1997) - [c17]Jerrold R. Griggs, Günter Rote:
On the distribution of sums of vectors in general position. Contemporary Trends in Discrete Mathematics 1997: 139-142 - 1996
- [j21]Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu:
Triangulations Intersect Nicely. Discret. Comput. Geom. 16(4): 339-359 (1996) - [c16]Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. ESA 1996: 320-333 - [c15]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO 1996: 204-218 - 1995
- [j20]Rainer E. Burkard, Bernd Fruhwirth, Günter Rote:
Vehicle routing in an automated warehouse: Analysis and optimization. Ann. Oper. Res. 57(1): 29-44 (1995) - [j19]Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger:
Counting Convex Polygons in Planar Point Sets. Inf. Process. Lett. 56(1): 45-49 (1995) - [c14]Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote:
Triangulations Intersect Nicely. SCG 1995: 220-229 - [c13]Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP 1995: 256-267 - 1994
- [j18]Vladimir G. Deineko, René van Dal, Günter Rote:
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. Inf. Process. Lett. 51(3): 141-148 (1994) - [c12]Helmut Alt, Oswin Aichholzer, Günter Rote:
Matching Shapes with a Reference Point. SCG 1994: 85-92 - 1993
- [j17]Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap:
Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993) - [j16]Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. 3: 277-288 (1993) - [j15]Günter Rote, Andreas Vogel:
A heuristic for decomposing traffic matrices in TDMA satellite communication. ZOR Methods Model. Oper. Res. 38(3): 281-307 (1993) - [c11]Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG 1993: 115-120 - [c10]Günter Rote, Christian Schwarz, Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263 - [c9]Johann Hagauer, Günter Rote:
Three-Clustering of Points in the Plane. ESA 1993: 192-199 - 1992
- [j14]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992) - [j13]Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plan. Algorithmica 8(5&6): 431-459 (1992) - [j12]Günter Rote:
The convergence rate of the sandwich algorithm for approximating convex functions. Computing 48(3-4): 337-361 (1992) - [j11]David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger:
Finding Minimum Area k-gons. Discret. Comput. Geom. 7: 45-58 (1992) - [j10]Günter Rote, Gerhard J. Woeginger:
Counting Convex k-Gons in Planar Point Sets. Inf. Process. Lett. 41(4): 191-194 (1992) - [j9]Günter Rote:
The n-line traveling salesman problem. Networks 22(1): 91-108 (1992) - [c8]Günter Rote:
Degenerate Convex Hulls in High Dimensions without Extra Storage. SCG 1992: 26-32 - [c7]Günter Rote:
A New Metric Between Polygons and How to Compute it. ICALP 1992: 404-415 - 1991
- [j8]Günter Rote:
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. Inf. Process. Lett. 38(3): 123-127 (1991) - [j7]Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang:
Counting k-Subsets and Convex k-gons in the Plane. Inf. Process. Lett. 38(3): 149-151 (1991) - [j6]Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger:
Geometric Clusterings. J. Algorithms 12(2): 341-356 (1991) - 1990
- [j5]Rainer E. Burkard, Günter Rote, En-Yu Yao, Zhongliang Yu:
Shortest polygonal paths in space. Computing 45(1): 51-68 (1990) - [c6]Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plane. SCG 1990: 63-72 - [c5]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes. SCG 1990: 216-224 - [c4]Paul N. Hilfinger, Eugene L. Lawler, Günter Rote:
Flattening a Rooted Tree. Applied Geometry And Discrete Mathematics 1990: 335-340 - [c3]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of Convex Figures by Pairs of Rectangles. STACS 1990: 240-249
1980 – 1989
- 1989
- [j4]Richard Pollack, Micha Sharir, Günter Rote:
Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 4: 611-626 (1989) - [j3]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. 66(2): 157-180 (1989) - 1987
- [j2]Günter Rote, Milan Vlach:
Book review. Z. Oper. Research 31(1) (1987) - [c2]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP 1987: 364-375 - 1986
- [c1]Günter Rote:
On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays. Aegean Workshop on Computing 1986: 70-83 - 1985
- [j1]Günter Rote:
A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion). Computing 34(3): 191-219 (1985)
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 2025-03-04 21:25 CET 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:
