default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Braß
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j38]Peter Brass
, Ivo Vigan, Ning Xu:
Shortest path planning for a tethered robot. Comput. Geom. 48(9): 732-742 (2015)- [j37]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. Theor. Comput. Sci. 607: 96-112 (2015) - 2014
- [c17]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. AAIM 2014: 1-12 - [c16]Peter Brass, Ivo Vigan, Ning Xu:
Improved analysis of a multirobot graph exploration strategy. ICARCV 2014: 1906-1910 - 2013
- [c15]Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan:
Range-Aggregate Queries for Geometric Extent Problems. CATS 2013: 3-10 - [i6]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. CoRR abs/1311.3149 (2013) - 2011
- [j36]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
The Aligned k-Center Problem. Int. J. Comput. Geom. Appl. 21(2): 157-178 (2011) - [j35]Peter Brass, Flavio Cabrera-Mora, Andrea Gasparri, Jizhong Xiao:
Multirobot Tree and Graph Exploration. IEEE Trans. Robotics 27(4): 707-717 (2011) - [c14]Peter Brass, Hyeon-Suk Na:
Sensor redundancy check without geometric information. RACS 2011: 183-186 - 2010
- [j34]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) - [j33]Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Guarding a Polygon from Two Nearly-Opposite Directions. Int. J. Comput. Geom. Appl. 20(3): 327-339 (2010) - [j32]Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disk Packing. Int. J. Comput. Geom. Appl. 20(3): 341-360 (2010) - [j31]Peter Brass, Hyeon-Suk Na:
Finding the maximum bounded intersection of k out of n halfplanes. Inf. Process. Lett. 110(3): 113-115 (2010) - [j30]Tetsuo Asano, Peter Brass, Shinji Sasahara:
Disc Covering Problem with Application to Digital Halftoning. Theory Comput. Syst. 46(2): 157-173 (2010) - [c13]Flavio Cabrera-Mora, Jizhong Xiao, Peter Brass:
Multi-robot flooding algorithm for the exploration of unknown indoor environments. ICRA 2010: 5478-5483
2000 – 2009
- 2009
- [j29]Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping offline searchers and isoperimetric theorems. Comput. Geom. 42(2): 119-126 (2009) - [j28]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) - [j27]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) - [j26]Peter Brass:
Universal hash functions for an infinite universe and hash trees. Inf. Process. Lett. 109(10): 461-462 (2009) - [c12]Peter Brass, Andrea Gasparri, Flavio Cabrera-Mora, Jizhong Xiao:
Multi-robot tree and graph exploration. ICRA 2009: 2332-2337 - [i5]Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Computing k-Centers On a Line. CoRR abs/0902.3282 (2009) - 2008
- [j25]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) - [c11]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679 - [i4]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) - 2007
- [j24]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) - [j23]Peter Brass:
Multidimensional heaps and complementary range searching. Inf. Process. Lett. 102(4): 152-155 (2007) - [j22]Peter Brass:
Bounds on coverage and target detection capabilities for models of networks of mobile sensors. ACM Trans. Sens. Networks 3(2): 9 (2007) - [c10]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 - [c9]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 - [c8]Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem. ISAAC 2007: 65-74 - [i3]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) - 2006
- [j21]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) - 2005
- [b1]Peter Brass, William O. J. Moser, János Pach:
Research problems in discrete geometry. Springer 2005, pp. I-XII, 1-499 - [j20]Peter Braß, Mehrbod Sharifi:
A Lower Bound for Lebesgue's Universal Cover Problem. Int. J. Comput. Geom. Appl. 15(5): 537-544 (2005) - [j19]Peter Braß:
An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. SIAM J. Discret. Math. 19(1): 192-195 (2005) - [c7]Benyuan Liu, Peter Braß, Olivier Dousse, Philippe Nain, Donald F. Towsley:
Mobility improves coverage of sensor networks. MobiHoc 2005: 300-308 - 2004
- [j18]Peter Braß, Christian Knauer:
Testing congruence and symmetry for general 3-dimensional objects. Comput. Geom. 27(1): 3-11 (2004) - [c6]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 - [c5]Tetsuo Asano, Peter Braß, Shinji Sasahara:
Disc Covering Problem with Application to Digital Halftoning. ICCSA (3) 2004: 11-21 - 2003
- [j17]Peter Braß:
On finding maximum-cardinality symmetric subsets. Comput. Geom. 24(1): 19-25 (2003) - [j16]Peter Braß, Christian Knauer:
On counting point-hyperplane incidences. Comput. Geom. 25(1-2): 13-20 (2003) - [j15]Peter Braß, Laura Heinrich-Litan, Pat Morin:
Computing the Center of Area of a Convex Polygon. Int. J. Comput. Geom. Appl. 13(5): 439-445 (2003) - [j14]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) - [c4]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 - 2002
- [j13]Peter Braß:
Combinatorial Geometry Problems in Pattern Recognition. Discret. Comput. Geom. 28(4): 495-510 (2002) - [j12]Peter Braß, Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets. Int. J. Comput. Geom. Appl. 12(1-2): 115-124 (2002) - [j11]Peter Brass:
On the nonexistence of Hausdorff-like metrics for fuzzy sets. Pattern Recognit. Lett. 23(1-3): 39-43 (2002) - 2001
- [j10]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) - [j9]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 A 94(1): 178-179 (2001) - 2000
- [c3]Peter Braß, Christian Knauer:
Testing the congruence of d-dimensional point sets. SCG 2000: 310-314 - [c2]Peter Brass:
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. ESA 2000: 112-119 - [c1]Peter Braß:
On Finding Maximum-Cardinality Symmetric Subsets. JCDCG 2000: 106-112 - [i2]Peter Brass:
On the Approximation of Polygons by Subpolygons. EuroCG 2000: 59-61 - [i1]Peter Braß, Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets. EuroCG 2000: 104-107
1990 – 1999
- 1999
- [j8]Peter Braß:
On strongly normal tesselations. Pattern Recognit. Lett. 20(9): 957-960 (1999) - 1998
- [j7]Peter Braß:
On Point Sets with Many Unit Distances in Few Directions. Discret. Comput. Geom. 19(3): 355-366 (1998) - 1997
- [j6]Peter Braß:
On the Quantitative Steinitz Theorem in the Plane. Discret. Comput. Geom. 17(1): 111-117 (1997) - 1996
- [j5]Peter Braß:
Erds Distance Problems in Normed Spaces. Comput. Geom. 6: 195-214 (1996) - [j4]Peter Brass:
On the Erdős-diameter of sets. Discret. Math. 150(1-3): 415-419 (1996) - 1995
- [j3]Peter Brass:
Packing constants in graphs and connectivity. Discret. Math. 137(1-3): 353-355 (1995) - [j2]Peter Brass, Heiko Harborth, Hauke Nienborg:
On the maximum number of edges in a c4-free subgraph of qn. J. Graph Theory 19(1): 17-23 (1995) - 1992
- [j1]Peter Braß:
The maximum Number of Second Smallest Distances in Finite Planar Sets. Discret. Comput. Geom. 7: 371-379 (1992)
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 2024-10-10 21:17 CEST 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:
