Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jörg-Rüdiger Sack
2010 – today
- 2013
[j48]Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack: An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry 50(1): 124-184 (2013)- [e15]Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack (Eds.): Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science 8037, Springer 2013, ISBN 978-3-642-40103-9
- 2012
- [j47]Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack: Shortest Paths in Time-Dependent FIFO Networks. Algorithmica 62(1-2): 416-435 (2012)
- [j46]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)
- [j45]
- [c44]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh: α-Visibility. SWAT 2012: 1-12
- [i3]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Visiting All Sites with Your Dog. CoRR abs/1211.4559 (2012)
- [i2]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer: Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012)
- 2011
- [j44]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011)
- [j43]
- [j42]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)
- [c43]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Staying Close to a Curve. CCCG 2011
- [c42]Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh: Finding Paths with Minimum Shared Edges. COCOON 2011: 567-578
- [c41]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529
- [e14]Frank Dehne, John Iacono, Jörg-Rüdiger Sack (Eds.): Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6844, Springer 2011, ISBN 978-3-642-22299-3
- [i1]Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack: An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. CoRR abs/1102.3165 (2011)
- 2010
- [j41]
- [j40]Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)
- [c40]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182
- [c39]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
2000 – 2009
- 2009
- [j39]Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks: Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. 42(6-7): 722 (2009)
- [j38]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)
- [c38]Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110
- [c37]Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack: Shortest paths in time-dependent FIFO networks using edge load forecasts. GIS-IWCTS 2009: 1-6
- [e13]Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (Eds.): Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5664, Springer 2009, ISBN 978-3-642-03366-7
- 2008
- [j37]Frank K. H. A. Dehne, Jörg-Rüdiger Sack: Introduction to Special Issue. Algorithmica 50(2): 173-174 (2008)
- [c36]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
- [c35]Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211
- 2007
- [j36]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)
- [c34]Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack: GlobeCon - A Scalable Framework for Context Aware Computing. EuroSSC 2007: 190-206
- [c33]Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95
- [c32]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
- [e12]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh (Eds.): Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings. Lecture Notes in Computer Science 4619, Springer 2007, ISBN 978-3-540-73948-7
- 2006
- [c31]Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom: 06101 Report -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating 2006
- [c30]Jörg-Rüdiger Sack, Monika Sester, Michael F. Worboys, Peter van Oosterom: 06101 Abstracts Collection -- Spatial Data: mining, processing and communicating. Spatial Data: mining, processing and communicating 2006
- [c29]Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109
- [e11]Jörg-Rüdiger Sack, Monika Sester, Peter van Oosterom, Michael F. Worboys (Eds.): Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006. Dagstuhl Seminar Proceedings 06101, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j35]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005)
- [c28]Doron Nussbaum, Jörg-Rüdiger Sack, H. Ye: Concurrent Parallel Shortest Path Computation. PARCO 2005: 277-284
- [e10]Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack (Eds.): Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings. Lecture Notes in Computer Science 3608, Springer 2005, ISBN 3-540-28101-0
- 2004
- [c27]Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack: Floating-Point Filter for the Line Intersection Algorithm. GIScience 2004: 94-105
- 2003
- [j34]Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack: Parallel implementation of geometric shortest path algorithms. Parallel Computing 29(10): 1445-1479 (2003)
- [c26]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257
- [e9]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid (Eds.): Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Lecture Notes in Computer Science 2748, Springer 2003, ISBN 3-540-40545-3
- 2001
- [j33]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001)
- [j32]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Ray shooting from convex ranges. Discrete Applied Mathematics 108(3): 259-267 (2001)
- [e8]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Lecture Notes in Computer Science 2125, Springer 2001, ISBN 3-540-42423-7
- 2000
- [j31]
- [j30]Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geometry Appl. 10(2): 157-188 (2000)
- [c25]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295
1990 – 1999
- 1999
- [j29]
- [j28]C. Hecker, David Roytenberg, Jörg-Rüdiger Sack, Z. Wang: System development for parallel cellular automata and its applications. Future Generation Comp. Syst. 16(2-3): 235-247 (1999)
- [j27]
- [j26]Anil Maheshwari, Jörg-Rüdiger Sack: Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Processing Letters 9(1): 31-42 (1999)
- [c24]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533
- [e7]Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0
- 1998
- [c23]Mohammad Ghodsi, Jörg-Rüdiger Sack: A coarse grained parallel solution to terrain simplification. CCCG 1998
- [c22]Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22
- 1997
- [j25]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Stage-graph Representations. Discrete Applied Mathematics 75(1): 71-80 (1997)
- [j24]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997)
- [c21]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 274-283
- [c20]Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 485-486
- [c19]Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack: Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29
- [e6]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Lecture Notes in Computer Science 1272, Springer 1997, ISBN 3-540-63307-3
- 1996
- [j23]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996)
- [c18]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack: Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34
- [c17]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
- [e5]Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack (Eds.): Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996. Carleton University Press 1996, ISBN 0-88629-307-3
- 1995
- [j22]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995)
- [j21]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Natana Valiveti, Boris Flach: Analog Parallel Algorithms for Computational Geometry. Parallel Algorithms Appl. 5(1): 1-14 (1995)
- [c16]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231
- [e4]Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (Eds.): Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8
- 1994
- [j20]Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack: A Workbench for Computational Geometry. Algorithmica 11(4): 404-428 (1994)
- [j19]M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994)
- [j18]M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Binary Trees in Parallel. J. Parallel Distrib. Comput. 23(1): 101-103 (1994)
- [j17]Peter Epstein, Jörg-Rüdiger Sack: Generating Triangulations at Random. ACM Trans. Model. Comput. Simul. 4(3): 267-278 (1994)
- 1993
- [j16]Doron Nussbaum, Jörg-Rüdiger Sack: Disassembling two-dimensional composite parts via translations. Int. J. Comput. Geometry Appl. 3(1): 71-84 (1993)
- [c15]Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA 1993: 109-120
- [c14]Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72
- [e3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides (Eds.): Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8
- 1992
- [j15]Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 8: 131-152 (1992)
- [j14]Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack: Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geometry Appl. 2(3): 221-239 (1992)
- [j13]M. D. Atkinson, Jörg-Rüdiger Sack: Generating Binary Trees at Random. Inf. Process. Lett. 41(1): 21-23 (1992)
- 1991
- [j12]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro: Computational Geometry Algorithms for the Systolic Screen. Algorithmica 6(5): 734-761 (1991)
- [e2]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (Eds.): Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings. Lecture Notes in Computer Science 519, Springer 1991, ISBN 3-540-54343-0
- 1990
- [j11]Jörg-Rüdiger Sack, Thomas Strothotte: A Characterization of Heaps and Its Applications. Inf. Comput. 86(1): 69-86 (1990)
- [j10]Jörg-Rüdiger Sack, Subhash Suri: An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers 39(10): 1213-1219 (1990)
- [c13]A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack: A Computational geometry Workbench. Symposium on Computational Geometry 1990: 370
1980 – 1989
- 1989
- [j9]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack: Computing the configuration space for a robot on a mesh-of-processors. Parallel Computing 12(2): 221-231 (1989)
- [j8]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. 66(2): 181-203 (1989)
- [c12]Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack: Computing the Configuration Space for a Robot on a Mesh-of-Processors. ICPP (3) 1989: 40-47
- [c11]Doron Nussbaum, Jörg-Rüdiger Sack: Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms 1989: 153-167
- [c10]Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107
- [e1]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (Eds.): Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings. Lecture Notes in Computer Science 382, Springer 1989, ISBN 3-540-51542-9
- 1988
- [j7]William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988)
- [j6]James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack: Recognizing polygons, or how to spy. The Visual Computer 3(6): 344-355 (1988)
- [c9]Frank K. H. A. Dehne, Jörg-Rüdiger Sack: A survey of paralle computational geometry algorithms. Parcella 1988: 73-88
- [c8]Jörg-Rüdiger Sack, Subhash Suri: An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS 1988: 312-321
- [c7]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic: A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. SWAT 1988: 154-162
- [c6]Otto Nurmi, Jörg-Rüdiger Sack: Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). WG 1988: 202-212
- 1987
- [j5]
- [j4]Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack: Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987)
- [j3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack: Translation separability of sets of polygons. The Visual Computer 3(4): 227-235 (1987)
- [c5]William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10
- [c4]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385
- [c3]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro: Computing on a Systolic Screen: Hulls, Contours and Applications. PARLE (1) 1987: 121-133
- 1986
- [j2]M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte: Min-Max Heaps and Generalized Priority Queues. Commun. ACM 29(10): 996-1000 (1986)
- [c2]
- 1985
- [j1]Jörg-Rüdiger Sack, Thomas Strothotte: An Algorithm for Merging Heaps. Acta Inf. 22(2): 171-186 (1985)
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team