Günter Rote
Orcid: 0000-0002-0351-5945Affiliations:
- FU Berlin, Institute of Computer Science, Germany
According to our database1,
Günter Rote
authored at least 170 papers
between 1985 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2022
Discret. Comput. Geom., 2022
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.
Algorithmica, 2022
2021
2020
Exp. Math., 2020
Discret. Comput. Geom., 2020
2019
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity.
ACM Trans. Algorithms, 2019
CoRR, 2019
Comput. Geom., 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
ACM Trans. Algorithms, 2018
J. Graph Algorithms Appl., 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
2017
Ars Math. Contemp., 2017
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
2016
Commun. ACM, 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
J. Comput. Geom., 2015
Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015
2014
Comput. Geom., 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
On the Parameterization and the Geometry of the Configuration Space of a Single Planar Robot.
J. WSCG, 2013
Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.
Discret. Comput. Geom., 2013
Comput. Geom., 2013
Comput. Geom., 2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.
ACM Trans. Algorithms, 2011
Integer point sets minimizing average pairwise L<sub>1</sub> distance: What is the optimal shape of a town?
Comput. Geom., 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Graph Drawing - 19th International Symposium, 2011
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?
CoRR, 2010
2009
Electron. Notes Discret. Math., 2009
CoRR, 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
Proceedings of the Advances in GIScience, 2009
2008
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs.
Comput. Geom., 2008
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Partitioning a Polygon into Two Mirror Congruent Pieces.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
J. Graph Algorithms Appl., 2007
Comput. Geom., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
New upper bounds on the quality of the PCA bounding boxes in r<sup>2</sup> and r<sup>3</sup>.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
2006
2005
Simple and optimal output-sensitive construction of contour trees using monotone paths.
Comput. Geom., 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Discret. Comput. Geom., 2003
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
Crossing the Bridge at Night.
Bull. EATCS, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
2001
Discret. Comput. Geom., 2001
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the Cryptography and Lattices, International Conference, 2001
Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001
2000
Discret. Comput. Geom., 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Every Polygon Can Be Untangled.
EuroCG, 2000
1998
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs.
IEEE Trans. Inf. Theory, 1998
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998
J. Graph Algorithms Appl., 1998
Acta Cybern., 1998
1997
Theor. Comput. Sci., 1997
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
1995
Ann. Oper. Res., 1995
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
Inf. Process. Lett., 1994
1993
ZOR Methods Model. Oper. Res., 1993
Comput. Geom., 1993
Maintaining the Approximate Width of a Set of Points in the Plane.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Computing, 1992
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992
1991
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation.
Inf. Process. Lett., 1991
1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
1989
Theor. Comput. Sci., 1989
1987
1986
Proceedings of the VLSI Algorithms and Architectures, 1986
1985
A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion).
Computing, 1985