Günter Rote - RankMe

238 papers A* 22A 11B 12C 5Misc 5Journal 138Unranked 44

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Gray code for arborescences of tournaments. CoRR Marthe Bonamy, Michael Hoffmann, Clément Legrand-Duchesne, Günter Rote
2026	J	`jnl`	Compatible Triangulations of Simple Polygons. CoRR Peyman Afshani, Boris Aronov, Kevin Buchin, Maike Buchin, Otfried Cheong, Katharina Klost, Carolin Rehs, Günter Rote
2025	A*	`conf`	Finding a Shortest Curve That Separates Few Objects from Many. SoCG Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote
2025	J	`jnl`	Finding a Shortest Curve that Separates Few Objects from Many. CoRR Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote
2025	J	`jnl`	Minimum spanning blob-trees. CoRR Katharina Klost, Marc J. van Kreveld, Daniel Perz, Günter Rote, Josef Tkadlec
2025	J	`jnl`	NumPSLA - An experimental research tool for pseudoline arrangements and order types. CoRR Günter Rote
2025	C	`conf`	On Solving Simple Curved Nonograms. IWOCA Maarten Löffler, Günter Rote, Soeren Terziadis, Alexandra Weinberger
2025	J	`jnl`	On Solving Simple Curved Nonograms. CoRR Maarten Löffler, Günter Rote, Soeren Terziadis, Alexandra Weinberger
2025	B	`conf`	Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed Automaton. MFCS Günter Rote
2025	J	`jnl`	Sweeping CoRR Therese Biedl, Erin W. Chambers, Irina Kostitsyna, Günter Rote
2025	—	`conf`	Sweeping x-monotone pseudolines. CCCG Therese Biedl, Erin W. Chambers, Irina Kostitsyna, Günter Rote
2024	A*	`conf`	Grid Peeling of Parabolas. SoCG Günter Rote, Moritz Rüber, Morteza Saghafian
2024	J	`jnl`	Grid Peeling of Parabolas. CoRR Günter Rote, Moritz Rüber, Morteza Saghafian
2024	J	`jnl`	On the Number of Compositions of Two Polycubes. Comput. Geom. Topol. Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha C. Osegueda, Günter Rote
2024	J	`jnl`	Optimal strategies in fractional games: vertex cover and domination. Ars Math. Contemp. Csilla Bujtás, Günter Rote, Zsolt Tuza
2024	J	`jnl`	Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton. CoRR Günter Rote
2024	J	`jnl`	Probabilistic Finite Automaton Emptiness is undecidable. CoRR Günter Rote
2024	J	`jnl`	Removing Popular Faces in Curve Arrangements. J. Graph Algorithms Appl. Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
2023	—	`conf`	Removing Popular Faces in Curve Arrangements. GD (2) Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
2022	J	`jnl`	An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. Discret. Comput. Geom. Eyal Ackerman, Balázs Keszegh, Günter Rote
2022	J	`jnl`	Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica Boris Klemz, Günter Rote
2022	J	`jnl`	Removing Popular Faces in Curve Arrangements. CoRR Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
2022	—	`conf`	The Two-Squirrel Problem and Its Relatives. JCDCGGG Sergey Bereg, Yuya Higashikawa, Naoki Katoh, László Kozma, Manuel Lafond, Günter Rote, Yuki Tokuni, Max Willert, Binhai Zhu
2021	J	`jnl`	Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
2020	A*	`conf`	An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. SoCG Eyal Ackerman, Balázs Keszegh, Günter Rote
2020	J	`jnl`	An almost optimal bound on the number of intersections of two simple polygons. CoRR Eyal Ackerman, Balázs Keszegh, Günter Rote
2020	J	`jnl`	Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles. Exp. Math. Jean-Philippe Labbé, Günter Rote, Günter M. Ziegler
2020	J	`jnl`	Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	J	`jnl`	Convex Equipartitions of Colored Point Sets. Discret. Comput. Geom. Pavle V. M. Blagojevic, Günter Rote, Johanna K. Steinmeyer, Günter M. Ziegler
2019	A*	`conf`	Every Collinear Set in a Planar Graph Is Free. SODA Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. CoRR Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	A*	`conf`	Geometric Multicut. ICALP Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	J	`jnl`	Geometric Multicut. CoRR Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	—	`conf`	Isotonic Regression by Dynamic Programming. SOSA Günter Rote
2019	J	`jnl`	Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results. CoRR Günter Rote
2019	—	`conf`	On Primal-Dual Circle Representations. SOSA Stefan Felsner, Günter Rote
2019	J	`jnl`	Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. ACM Trans. Algorithms Boris Klemz, Günter Rote
2019	J	`jnl`	Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom. Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber
2019	J	`jnl`	The Largest Quadrilateral in a Convex Polygon. CoRR Günter Rote
2019	A*	`conf`	The Maximum Number of Minimal Dominating Sets in a Tree. SODA Günter Rote
2019	J	`jnl`	The geometric dilation of three points. J. Comput. Geom. Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote
2018	B	`conf`	Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	J	`jnl`	Approximate Minimum-Weight Matching with Outliers under Translation. CoRR Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	J	`jnl`	Loopless Gray code enumeration and the Tower of Bucharest. Theor. Comput. Sci. Felix Herter, Günter Rote
2018	J	`jnl`	Point sets with many non-crossing perfect matchings. Comput. Geom. Andrei Asinowski, Günter Rote
2018	J	`jnl`	Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2018	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2017	J	`jnl`	Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. CoRR Boris Klemz, Günter Rote
2017	A	`conf`	Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. GD Boris Klemz, Günter Rote
2017	J	`jnl`	Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. CoRR Boris Klemz, Günter Rote
2017	J	`jnl`	Packing Short Plane Spanning Graphs in Complete Geometric Graphs. CoRR Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber
2017	J	`jnl`	Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener
2016	A	`conf`	Approximation and Hardness of Token Swapping. ESA Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2016	J	`jnl`	Congruence Testing of Point Sets in 4 Dimensions. CoRR Heuna Kim, Günter Rote
2016	A*	`conf`	Congruence Testing of Point Sets in 4-Space. SoCG Heuna Kim, Günter Rote
2016	Misc	`conf`	Loopless Gray Code Enumeration and the Tower of Bucharest. FUN Felix Herter, Günter Rote
2016	J	`jnl`	Loopless Gray Code Enumeration and the Tower of Bucharest. CoRR Felix Herter, Günter Rote
2016	B	`conf`	Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber
2016	J	`jnl`	Recursively-regular subdivisions and applications. J. Comput. Geom. Rafel Jaume, Günter Rote
2016	J	`jnl`	Shortest path to a segment and quickest visibility queries. J. Comput. Geom. Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie
2016	J	`jnl`	Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2016	A*	`conf`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2015	—	`conf`	Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques. MACIS Günter Rote
2015	J	`jnl`	Point sets with many non-crossing matchings. CoRR Andrei Asinowski, Günter Rote
2015	J	`jnl`	Quasi-parallel segments and characterization of unique bichromatic matchings. J. Comput. Geom. Andrei Asinowski, Tillmann Miltzow, Günter Rote
2015	B	`conf`	Saturated Simple and 2-simple Topological Graphs with Few Edges. WG Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2015	J	`jnl`	Saturated simple and 2-simple topological graphs with few edges. CoRR Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2015	A*	`conf`	Shortest Path to a Segment and Quickest Visibility Queries. SoCG Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie
2015	J	`jnl`	Triangulations with Circular Arcs. J. Graph Algorithms Appl. Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
2015	J	`jnl`	Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. CoRR Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2015	A	`conf`	λ > 4. ESA Gill Barequet, Günter Rote, Mira Shalah
2014	J	`jnl`	Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2014	—	`conf`	Graph Drawings with Relative Edge Length Specifications. CCCG Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote
2014	J	`jnl`	Plane Graphs with Parity Constraints. Graphs Comb. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
2014	—	`conf`	Quality Ratios of Measures for Graph Drawing Styles. CCCG Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote
2014	J	`jnl`	Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2014	J	`jnl`	Reprint of: Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote
2013	J	`jnl`	Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions. Discret. Comput. Geom. Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote
2013	J	`jnl`	Advantage in the discrete Voronoi game CoRR Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2013	J	`jnl`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles CoRR 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
2013	B	`conf`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 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
2013	—	`conf`	Convex hull alignment through translation. CCCG Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira
2013	J	`jnl`	Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2013	J	`jnl`	Flip Graphs of Bounded Degree Triangulations. Graphs Comb. Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann
2013	J	`jnl`	Memory-constrained algorithms for simple polygons. Comput. Geom. Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2013	J	`jnl`	On the Parameterization and the Geometry of the Configuration Space of a Single Planar Robot. J. WSCG Dror Atariah, Sunayana Ghosh, Günter Rote
2013	J	`jnl`	Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote
2013	J	`jnl`	Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings CoRR Andrei Asinowski, Tillmann Miltzow, Günter Rote
2013	J	`jnl`	The finest regular coarsening and recursively-regular subdivisions. CoRR Rafel Jaume, Günter Rote
2012	—	`conf`	Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. SCG Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote
2012	—	`conf`	Configuration space visualization. SCG Dror Atariah, Günter Rote
2012	Misc	`conf`	Monotone Paths in Planar Convex Subdivisions. COCOON Adrian Dumitrescu, Günter Rote, Csaba D. Tóth
2012	J	`jnl`	Pointed drawings of planar graphs. Comput. Geom. Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
2011	A*	`conf`	Collapse. SODA Günter Rote, Uri Zwick
2011	—	`conf`	Common Developments of Several Different Orthogonal Boxes. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiroaki Matsui, Günter Rote, Ryuhei Uehara
2011	J	`jnl`	Constant-Work-Space Algorithms for Geometric Problems. J. Comput. Geom. Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang
2011	—	`conf`	Convexifying Polygons Without Losing Visibilities. CCCG 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
2011	J	`jnl`	Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote
2011	J	`jnl`	Integer point sets minimizing average pairwise L Comput. Geom. Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2011	J	`jnl`	Lines Pinning Lines. Discret. Comput. Geom. Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote
2011	J	`jnl`	Memory-Constrained Algorithms for Simple Polygons CoRR Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz
2011	Misc	`conf`	Proper n-Cell Polycubes in n - 3 Dimensions. COCOON Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote
2011	A	`conf`	Realizing Planar Graphs as Convex Polytopes. GD Günter Rote
2011	J	`jnl`	Small Grid Embeddings of 3-Polytopes. Discret. Comput. Geom. Ares Ribó Mor, Günter Rote, André Schulz
2011	A	`conf`	Triangulations with Circular Arcs. GD Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
2010	J	`jnl`	Acyclic Orientation of Drawings. J. Graph Algorithms Appl. Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
2010	J	`jnl`	Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle
2010	J	`jnl`	Formulae and growth rates of high-dimensional polycubes. Comb. Ronnie Barequet, Gill Barequet, Günter Rote
2010	J	`jnl`	Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? CoRR Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2010	J	`jnl`	Locked and Unlocked Chains of Planar Shapes. Discret. Comput. Geom. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2010	J	`jnl`	Obnoxious Centers in Graphs. SIAM J. Discret. Math. Sergio Cabello, Günter Rote
2010	J	`jnl`	Welcome from the Editors-in-Chief. J. Comput. Geom. Kenneth L. Clarkson, Günter Rote
2009	J	`jnl`	Bounds on the quality of the PCA bounding boxes. Comput. Geom. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
2009	—	`conf`	Constant-Working-Space Algorithms for Geometric Problems. CCCG Tetsuo Asano, Günter Rote
2009	—	`conf`	Detecting Hotspots in Geographic Networks. AGILE Conf. Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle
2009	J	`jnl`	Fixed-parameter tractability and lower bounds for stabbing problems CoRR Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2009	J	`jnl`	Flip Graphs of Bounded-Degree Triangulations. Electron. Notes Discret. Math. Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann
2009	J	`jnl`	Formulae and Growth Rates of High-Dimensional Polycubes. Electron. Notes Discret. Math. Ronnie Barequet, Gill Barequet, Günter Rote
2009	—	`conf`	Integer Point Sets Minimizing Average Pairwise l CCCG Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
2009	B	`conf`	Plane Graphs with Parity Constraints. WADS Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
2009	J	`jnl`	Recovering Structure from Comput. Graph. Forum Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
2009	B	`conf`	Resolving Loads with Positive Interior Stresses. WADS Günter Rote, André Schulz
2009	J	`jnl`	Small grid embeddings of 3-polytopes CoRR Ares Ribó Mor, Günter Rote, André Schulz
2009	—	`conf`	The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC Panos Giannopoulos, Christian Knauer, Günter Rote
2009	J	`jnl`	The parameterized complexity of some geometric problems in unbounded dimension CoRR Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2009	A*	`conf`	Two Applications of Point Matching. Computational Geometry Günter Rote
2009	J	`jnl`	Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2008	J	`jnl`	Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comput. Geom. Robert L. Scot Drysdale, Günter Rote, Astrid Sturm
2008	A*	`conf`	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	Minimum-weight triangulation is NP-hard. J. ACM Wolfgang Mulzer, Günter Rote
2008	—	`conf`	Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote
2008	J	`jnl`	There Are Not Too Many Magic Configurations. Discret. Comput. Geom. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
2007	J	`jnl`	Computing the Fréchet distance between piecewise smooth curves. Comput. Geom. Günter Rote
2007	—	`conf`	Embedding 3-polytopes on a small grid. SCG Ares Ribó Mor, Günter Rote, André Schulz
2007	A*	`conf`	Matrix scaling by network flow. SODA Günter Rote, Martin Zachariasen
2007	—	`conf`	New upper bounds on the quality of the PCA bounding boxes in r SCG Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
2007	A*	`conf`	Obnoxious centers in graphs. SODA Sergio Cabello, Günter Rote
2007	J	`jnl`	On the geometric dilation of closed curves, graphs, and point sets. Comput. Geom. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
2007	J	`jnl`	Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. Sergio Cabello, Erik D. Demaine, Günter Rote
2007	—	`conf`	Pointed Drawings of Planar Graphs. CCCG Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
2007	—	`conf`	There are not too many magic configurations. SCG Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
2007	Misc	`conf`	Wooden Geometric Puzzles: Design and Hardness Proofs. FUN Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2006	—	`conf`	Acyclic Orientation of Drawings. SWAT Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
2006	J	`jnl`	Locked and Unlocked Chains of Planar Shapes CoRR Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2006	—	`conf`	Locked and unlocked chains of planar shapes. SCG Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
2006	—	`conf`	Minimum weight triangulation is NP-hard. SCG Wolfgang Mulzer, Günter Rote
2006	J	`jnl`	Minimum-weight triangulation is NP-hard CoRR Wolfgang Mulzer, Günter Rote
2006	J	`jnl`	Threshold arrangements and the knapsack problem. Appl. Math. Lett. Günter Rote, André Schulz
2005	C	`conf`	A pointed Delaunay pseudo-triangulation of a simple polygon. EuroCG Günter Rote, André Schulz
2005	C	`conf`	Improved lower bound on the geometric dilation of point sets. EuroCG Adrian Dumitrescu, Ansgar Grüne, Günter Rote
2005	A	`conf`	Matching Point Sets with Respect to the Earth Mover's Distance. ESA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005	C	`conf`	Matching point sets with respect to the Earth mover's distance. EuroCG Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005	B	`conf`	On Geometric Dilation and Halving Chords. WADS Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
2005	J	`jnl`	Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
2005	—	`ed.`	Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005 SCG Joseph S. B. Mitchell, Günter Rote
2005	J	`jnl`	Simple and optimal output-sensitive construction of contour trees using monotone paths. Comput. Geom. Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
2005	J	`jnl`	Strictly convex drawings of planar graphs CoRR Imre Bárány, Günter Rote
2005	A*	`conf`	Strictly convex drawings of planar graphs. SODA Günter Rote
2004	J	`jnl`	Covering with Ellipses. Algorithmica Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
2004	J	`jnl`	Non-Crossing Frameworks with Non-Crossing Reciprocals. Discret. Comput. Geom. David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley
2004	—	`conf`	On the Fréchet distance of a set of curves. CCCG Adrian Dumitrescu, Günter Rote
2003	—	`conf`	Finding a curve in a map. SCG Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
2003	—	`conf`	Incremental constructions con BRIO. SCG Nina Amenta, Sunghee Choi, Günter Rote
2003	A*	`conf`	Matching planar maps. SODA Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
2003	J	`jnl`	Matching planar maps. J. Algorithms Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
2003	Misc	`conf`	On Constrained Minimum Pseudotriangulations. COCOON Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu
2003	A	`conf`	Planar Embeddings of Graphs with Specified Edge Lengths. GD Sergio Cabello, Erik D. Demaine, Günter Rote
2003	—	`conf`	Planar minimally rigid graphs and pseudo-triangulations. SCG Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
2003	A*	`conf`	Pursuit-evasion with imprecise target location. SODA Günter Rote
2003	J	`jnl`	Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Discret. Comput. Geom. Robert Connelly, Erik D. Demaine, Günter Rote
2003	B	`conf`	The Zigzag Path of a Pseudo-Triangulation. WADS Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
2003	—	`conf`	The complexity of (un)folding. SCG Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
2002	A*	`conf`	Covering shapes by ellipses. SODA Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
2002	J	`jnl`	Crossing the Bridge at Night. Bull. EATCS Günter Rote
2002	—	`conf`	Pseudotriangulations, polytopes, and how to expand linkages. SCG Günter Rote
2002	A	`conf`	Toward Optimal Diffusion Matrices. IPDPS Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
2001	—	`conf`	Counting triangulations and pseudo-triangulations of wheels. CCCG Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
2001	—	`conf`	Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. Computational Discrete Mathematics Günter Rote
2001	B	`conf`	Fast 2-Variable Integer Programming. IPCO Friedrich Eisenbrand, Günter Rote
2001	—	`conf`	Fast Reduction of Ternary Quadratic Forms. CaLC Friedrich Eisenbrand, Günter Rote
2001	J	`jnl`	Generalized self-approaching curves. Discret. Appl. Math. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
2001	J	`jnl`	The Obnoxious Center Problem on a Tree. SIAM J. Discret. Math. Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote
2001	J	`jnl`	Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. Discret. Comput. Geom. Peter Braß, Günter Rote, Konrad J. Swanepoel
2000	J	`jnl`	A Central Limit Theorem for Convex Chains in the Square. Discret. Comput. Geom. Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang
2000	C	`conf`	Every Polygon Can Be Untangled. EuroCG Robert Connelly, Erik D. Demaine, Günter Rote
2000	A*	`conf`	Straighting Polygonal Arcs and Convexifying Polygonal Cycles. FOCS Robert Connelly, Erik D. Demaine, Günter Rote
2000	J	`jnl`	Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. Eur. J. Comb. Tamás Fleiner, Volker Kaibel, Günter Rote
1998	J	`jnl`	A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. IEEE Trans. Inf. Theory Mordecai J. Golin, Günter Rote
1998	J	`jnl`	A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 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
1998	J	`jnl`	Approximation of convex figures by pairs of rectangles. Comput. Geom. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
1998	J	`jnl`	Constant-Level Greedy Triangulations Approximate the MWT Well. J. Comb. Optim. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
1998	B	`conf`	Generalized Self-Approaching Curves. ISAAC Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
1998	J	`jnl`	Matching Convex Shapes with Respect to the Symmetric Difference. Algorithmica Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
1998	J	`jnl`	Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times. Acta Cybern. Günter Rote, Gerhard J. Woeginger
1998	J	`jnl`	The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1997	J	`jnl`	Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. Theor. Comput. Sci. Günter Rote
1997	J	`jnl`	Matching Shapes with a Reference Point. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Helmut Alt, Günter Rote
1997	—	`conf`	On the distribution of sums of vectors in general position. Contemporary Trends in Discrete Mathematics Jerrold R. Griggs, Günter Rote
1997	J	`jnl`	Three-clustering of Points in the Plane. Comput. Geom. Johann Hagauer, Günter Rote
1996	A	`conf`	Matching Convex Shapes with Respect to the Symmetric Difference. ESA Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
1996	B	`conf`	The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1996	J	`jnl`	Triangulations Intersect Nicely. Discret. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
1995	A*	`conf`	A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP Mordecai J. Golin, Günter Rote
1995	J	`jnl`	Counting Convex Polygons in Planar Point Sets. Inf. Process. Lett. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
1995	—	`conf`	Triangulations Intersect Nicely. SCG Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
1995	J	`jnl`	Vehicle routing in an automated warehouse: Analysis and optimization. Ann. Oper. Res. Rainer E. Burkard, Bernd Fruhwirth, Günter Rote
1994	—	`conf`	Matching Shapes with a Reference Point. SCG Helmut Alt, Oswin Aichholzer, Günter Rote
1994	J	`jnl`	The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. Inf. Process. Lett. Vladimir G. Deineko, René van Dal, Günter Rote
1993	J	`jnl`	A heuristic for decomposing traffic matrices in TDMA satellite communication. ZOR Methods Model. Oper. Res. Günter Rote, Andreas Vogel
1993	—	`conf`	Maintaining the Approximate Width of a Set of Points in the Plane. CCCG Günter Rote, Christian Schwarz, Jack Snoeyink
1993	—	`conf`	On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG Alon Efrat, Günter Rote, Micha Sharir
1993	J	`jnl`	On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. Alon Efrat, Günter Rote, Micha Sharir
1993	J	`jnl`	Shortest Paths for Line Segments. Algorithmica Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
1993	A	`conf`	Three-Clustering of Points in the Plane. ESA Johann Hagauer, Günter Rote
1992	A*	`conf`	A New Metric Between Polygons and How to Compute it. ICALP Günter Rote
1992	J	`jnl`	Counting Convex k-Gons in Planar Point Sets. Inf. Process. Lett. Günter Rote, Gerhard J. Woeginger
1992	—	`conf`	Degenerate Convex Hulls in High Dimensions without Extra Storage. SCG Günter Rote
1992	J	`jnl`	Finding Minimum Area k-gons. Discret. Comput. Geom. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Minimum-Link Paths Among Obstacles in the Plan. Algorithmica Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Simultaneous Inner and Outer Approximation of Shapes. Algorithmica Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1992	J	`jnl`	The convergence rate of the sandwich algorithm for approximating convex functions. Computing Günter Rote
1992	J	`jnl`	The n-line traveling salesman problem. Networks Günter Rote
1991	J	`jnl`	Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. Inf. Process. Lett. Günter Rote
1991	J	`jnl`	Counting k-Subsets and Convex k-gons in the Plane. Inf. Process. Lett. Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang
1991	J	`jnl`	Geometric Clusterings. J. Algorithms Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger
1990	A	`conf`	Approximation of Convex Figures by Pairs of Rectangles. STACS Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
1990	—	`conf`	Flattening a Rooted Tree. Applied Geometry And Discrete Mathematics Paul N. Hilfinger, Eugene L. Lawler, Günter Rote
1990	—	`conf`	Minimum-Link Paths Among Obstacles in the Plane. SCG Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
1990	—	`conf`	On Simultaneous Inner and Outer Approximation of Shapes. SCG Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1990	J	`jnl`	Shortest polygonal paths in space. Computing Rainer E. Burkard, Günter Rote, En-Yu Yao, Zhongliang Yu
1989	J	`jnl`	Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. Richard Pollack, Micha Sharir, Günter Rote
1989	J	`jnl`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. Herbert Edelsbrunner, Günter Rote, Emo Welzl
1987	J	`jnl`	Book review. Z. Oper. Research Günter Rote, Milan Vlach
1987	A*	`conf`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP Herbert Edelsbrunner, Günter Rote, Emo Welzl
1986	—	`conf`	On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays. Aegean Workshop on Computing Günter Rote
1985	J	`jnl`	A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion). Computing Günter Rote