Peter Braß

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: The Aligned k-Center Problem. Int. J. Comput. Geometry Appl. 21(2): 157-178 (2011)

Peter Brass, Flavio Cabrera-Mora, Andrea Gasparri, Jizhong Xiao: Multirobot Tree and Graph Exploration. IEEE Transactions on Robotics 27(4): 707-717 (2011)

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin: Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010)

Peter Brass, Hyeon-Suk Na, Chan-Su Shin: Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geometry Appl. 20(3): 327-339 (2010)

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw: A Lower Bound on the Area of a 3-Coloured Disk Packing. Int. J. Comput. Geometry Appl. 20(3): 341-360 (2010)

Peter Brass, Hyeon-Suk Na: Finding the maximum bounded intersection of k out of n halfplanes. Inf. Process. Lett. 110(3): 113-115 (2010)

Tetsuo Asano, Peter Brass, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. 46(2): 157-173 (2010)

Flavio Cabrera-Mora, Jizhong Xiao, Peter Brass: Multi-robot flooding algorithm for the exploration of unknown indoor environments. ICRA 2010: 5478-5483

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009)

Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin: On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. 42(3): 207-213 (2009)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009)

Peter Brass: Universal hash functions for an infinite universe and hash trees. Inf. Process. Lett. 109(10): 461-462 (2009)

Peter Brass, Andrea Gasparri, Flavio Cabrera-Mora, Jizhong Xiao: Multi-robot tree and graph exploration. ICRA 2009: 2332-2337

Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Computing k-Centers On a Line. CoRR abs/0902.3282 (2009)

Hee-Kap Ahn, Peter Brass, Chan-Su Shin: Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40(2): 171-177 (2008)

Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin: Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw: A Lower Bound on the Area of a 3-Coloured Disk Packing. CoRR abs/0804.1173 (2008)

Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On simultaneous planar graph embeddings. Comput. Geom. 36(2): 117-130 (2007)

Peter Brass: Multidimensional heaps and complementary range searching. Inf. Process. Lett. 102(4): 152-155 (2007)

Peter Brass: Bounds on coverage and target detection capabilities for models of networks of mobile sensors. TOSN 3(2): 9 (2007)

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CATS 2007: 7-14

Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw: A Lower Bound on the Area of a 3-Coloured Disc Packing. CCCG 2007: 101-104

Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin: Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74

Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CoRR abs/cs/0703037 (2007)

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006)

Peter Brass, William O. J. Moser, János Pach: Research problems in discrete geometry. Springer 2005, pp. I-XII, 1-499

Peter Braß, Mehrbod Sharifi: A Lower Bound for Lebesgue's Universal Cover Problem. Int. J. Comput. Geometry Appl. 15(5): 537-544 (2005)

Peter Braß: An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. SIAM J. Discrete Math. 19(1): 192-195 (2005)

Benyuan Liu, Peter Braß, Olivier Dousse, Philippe Nain, Donald F. Towsley: Mobility improves coverage of sensor networks. MobiHoc 2005: 300-308

Peter Braß, Christian Knauer: Testing congruence and symmetry for general 3-dimensional objects. Comput. Geom. 27(1): 3-11 (2004)

Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron: Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267

Tetsuo Asano, Peter Braß, Shinji Sasahara: Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) 2004: 11-21

Peter Braß: On finding maximum-cardinality symmetric subsets. Comput. Geom. 24(1): 19-25 (2003)

Peter Braß, Christian Knauer: On counting point-hyperplane incidences. Comput. Geom. 25(1-2): 13-20 (2003)

Peter Braß, Laura Heinrich-Litan, Pat Morin: Computing the Center of Area of a Convex Polygon. Int. J. Comput. Geometry Appl. 13(5): 439-445 (2003)

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß: Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. SIAM J. Comput. 32(6): 1621-1653 (2003)

Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On Simultaneous Planar Graph Embeddings. WADS 2003: 243-255

Peter Braß: Combinatorial Geometry Problems in Pattern Recognition. Discrete & Computational Geometry 28(4): 495-510 (2002)

Peter Braß, Christian Knauer: Testing the Congruence of d-Dimensional Point Sets. Int. J. Comput. Geometry Appl. 12(1-2): 115-124 (2002)

Peter Brass: On the nonexistence of Hausdorff-like metrics for fuzzy sets. Pattern Recognition Letters 23(1-3): 39-43 (2002)

Peter Braß, Günter Rote, Konrad J. Swanepoel: Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. Discrete & Computational Geometry 26(1): 51-58 (2001)

Peter Braß, János Pach: The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n). J. Comb. Theory, Ser. A 94(1): 178-179 (2001)

Peter Braß, Christian Knauer: Testing the congruence of d-dimensional point sets. Symposium on Computational Geometry 2000: 310-314

Peter Brass: Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. ESA 2000: 112-119

Peter Braß: On Finding Maximum-Cardinality Symmetric Subsets. JCDCG 2000: 106-112

Peter Brass: On the Approximation of Polygons by Subpolygons. EuroCG 2000: 59-61

Peter Braß, Christian Knauer: Testing the Congruence of d-Dimensional Point Sets. EuroCG 2000: 104-107

Peter Braß: On strongly normal tesselations. Pattern Recognition Letters 20(9): 957-960 (1999)

Peter Braß: On Point Sets with Many Unit Distances in Few Directions. Discrete & Computational Geometry 19(3): 355-366 (1998)

Peter Braß: On the Quantitative Steinitz Theorem in the Plane. Discrete & Computational Geometry 17(1): 111-117 (1997)

Peter Braß: Erds Distance Problems in Normed Spaces. Comput. Geom. 6: 195-214 (1996)

Peter Brass: Packing constants in graphs and connectivity. Discrete Mathematics 137(1-3): 353-355 (1995)

Peter Brass, Heiko Harborth, Hauke Nienborg: On the maximum number of edges in a c₄-free subgraph of q_n. Journal of Graph Theory 19(1): 17-23 (1995)

Peter Braß: The maximum Number of Second Smallest Distances in Finite Planar Sets. Discrete & Computational Geometry 7: 371-379 (1992)