Остановите войну!
for scientists:
default search action
Jörg-Rüdiger Sack
- > Home > Persons > Jörg-Rüdiger Sack
Publications
- 2017
- [j55]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Maintaining anonymity using -privacy. J. Locat. Based Serv. 11(1): 1-28 (2017) - 2012
- [j47]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012) - [c46]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Techniques to protect privacy against inference attacks in location based services. IWGS@SIGSPATIAL/GIS 2012: 58-67 - 2011
- [j43]Matt Duckham, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Trans. Computers 60(8): 1100-1113 (2011) - 2010
- [j41]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44(4): 762-801 (2010) - [c40]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149 - 2009
- [j39]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A meeting scheduling problem respecting time and space. GeoInformatica 13(4): 453-481 (2009) - 2008
- [c37]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A Meeting Scheduling Problem Respecting Time and Space. AAIM 2008: 50-59 - 2007
- [j37]Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007) - [c35]Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack:
GlobeCon - A Scalable Framework for Context Aware Computing. EuroSSC 2007: 190-206 - [c34]Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95 - [c33]Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680 - 2006
- [c32]Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
How to Fit In Another Meeting. CollaborateCom 2006 - [c31]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - 2005
- [c30]Doron Nussbaum, Jörg-Rüdiger Sack, Hua Ye:
Concurrent Parallel Shortest Path Computation. PARCO 2005: 277-284 - 2004
- [c29]Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack:
Floating-Point Filter for the Line Intersection Algorithm. GIScience 2004: 94-105 - 2003
- [j35]Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack:
Parallel implementation of geometric shortest path algorithms. Parallel Comput. 29(10): 1445-1479 (2003) - 1996
- [c19]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34 - [c18]David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. SPAA 1996: 204-207 - 1995
- [c17]Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. CCCG 1995: 43-48 - 1993
- [j17]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling two-dimensional composite parts via translations. Int. J. Comput. Geom. Appl. 3(1): 71-84 (1993) - 1989
- [c11]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms 1989: 153-167
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 2023-09-28 03:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint