| 2008 |
|---|
| 85 | EE | Hua Guo,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Shortest Path Queries in Polygonal Domains.
AAIM 2008: 200-211 |
| 84 | EE | 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 |
| 83 | EE | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack:
Introduction to Special Issue.
Algorithmica 50(2): 173-174 (2008) |
| 2007 |
|---|
| 82 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Norbert Zeh:
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings
Springer 2007 |
| 81 | EE | Kaiyuan Lu,
Doron Nussbaum,
Jörg-Rüdiger Sack:
GlobeCon - A Scalable Framework for Context Aware Computing.
EuroSSC 2007: 190-206 |
| 80 | EE | Hua Guo,
Anil Maheshwari,
Doron Nussbaum,
Jörg-Rüdiger Sack:
Shortest Path Queries Between Geometric Objects on Surfaces.
ICCSA (1) 2007: 82-95 |
| 79 | EE | 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 |
| 78 | EE | 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) |
| 2006 |
|---|
| 77 | | Jörg-Rüdiger Sack,
Monika Sester,
Peter van Oosterom,
Michael F. Worboys:
Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 76 | EE | 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 |
| 75 | EE | 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 |
| 74 | EE | 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 |
| 2005 |
|---|
| 73 | | Frank K. H. A. Dehne,
Alejandro López-Ortiz,
Jörg-Rüdiger Sack:
Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Springer 2005 |
| 72 | | Doron Nussbaum,
Jörg-Rüdiger Sack,
H. Ye:
Concurrent Parallel Shortest Path Computation.
PARCO 2005: 277-284 |
| 71 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Determining approximate shortest paths on weighted polyhedral surfaces.
J. ACM 52(1): 25-53 (2005) |
| 2004 |
|---|
| 70 | EE | Andras Frankel,
Doron Nussbaum,
Jörg-Rüdiger Sack:
Floating-Point Filter for the Line Intersection Algorithm.
GIScience 2004: 94-105 |
| 2003 |
|---|
| 69 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Michiel H. M. Smid:
Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings
Springer 2003 |
| 68 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths.
FCT 2003: 246-257 |
| 67 | EE | Mark Lanthier,
Doron Nussbaum,
Jörg-Rüdiger Sack:
Parallel implementation of geometric shortest path algorithms.
Parallel Computing 29(10): 1445-1479 (2003) |
| 2001 |
|---|
| 66 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings
Springer 2001 |
| 65 | EE | Mark Lanthier,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Approximating Shortest Paths on Weighted Polyhedral Surfaces.
Algorithmica 30(4): 527-562 (2001) |
| 64 | | 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) |
| 2000 |
|---|
| 63 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems.
STOC 2000: 286-295 |
| 62 | | Kurt Mehlhorn,
Jörg-Rüdiger Sack:
Editorial.
Comput. Geom. 17(1-2): 1-2 (2000) |
| 61 | | 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) |
| 1999 |
|---|
| 60 | | Frank K. H. A. Dehne,
Arvind Gupta,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings
Springer 1999 |
| 59 | EE | Mark Lanthier,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Shortest Anisotropic Paths on Terrains.
ICALP 1999: 524-533 |
| 58 | | Kurt Mehlhorn,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Editorial.
Comput. Geom. 12(3-4): 153-154 (1999) |
| 57 | EE | 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) |
| 56 | EE | M. D. Atkinson,
Jörg-Rüdiger Sack:
Pop-Stacks in Parallel.
Inf. Process. Lett. 70(2): 63-67 (1999) |
| 55 | | 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) |
| 1998 |
|---|
| 54 | EE | Mohammad Ghodsi,
Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification.
CCCG 1998 |
| 53 | EE | 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 |
|---|
| 52 | | Frank K. H. A. Dehne,
Andrew Rau-Chaplin,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings
Springer 1997 |
| 51 | EE | Anil Maheshwari,
Pat Morin,
Jörg-Rüdiger Sack:
Progressive TINs: Algorithms and Applications.
ACM-GIS 1997: 24-29 |
| 50 | EE | Mark Lanthier,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces.
Symposium on Computational Geometry 1997: 274-283 |
| 49 | EE | Mark Lanthier,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces.
Symposium on Computational Geometry 1997: 485-486 |
| 48 | EE | 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) |
| 47 | EE | 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) |
| 1996 |
|---|
| 46 | | Frank Fiala,
Evangelos Kranakis,
Jörg-Rüdiger Sack:
Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996
Carleton University Press 1996 |
| 45 | EE | David A. Hutchinson,
Mark Lanthier,
Anil Maheshwari,
Doron Nussbaum,
David Roytenberg,
Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling.
ACM-GIS 1996: 25-34 |
| 44 | | 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 |
| 43 | | Amitava Datta,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Direct Dominance Problems.
Nord. J. Comput. 3(1): 72-88 (1996) |
| 1995 |
|---|
| 42 | | Selim G. Akl,
Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings
Springer 1995 |
| 41 | | 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 |
| 40 | | Andrzej Lingas,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
Algorithmica 14(3): 261-289 (1995) |
| 39 | EE | 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) |
| 1994 |
|---|
| 38 | EE | Peter Epstein,
Jörg-Rüdiger Sack:
Generating Triangulations at Random.
ACM Trans. Model. Comput. Simul. 4(3): 267-278 (1994) |
| 37 | | 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) |
| 36 | | M. D. Atkinson,
Jörg-Rüdiger Sack:
Uniform Generation of Forests of Restricted Height.
Inf. Process. Lett. 50(6): 323-327 (1994) |
| 35 | | M. D. Atkinson,
Jörg-Rüdiger Sack:
Uniform Generation of Binary Trees in Parallel.
J. Parallel Distrib. Comput. 23(1): 101-103 (1994) |
| 1993 |
|---|
| 34 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro,
Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings
Springer 1993 |
| 33 | | Amitava Datta,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Optimal CREW-PRAM Algorithms for Direct Dominance Problems.
ESA 1993: 109-120 |
| 32 | | Andrzej Lingas,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Parallel Algorithms for Rectilinear Link Distance Problems.
IPPS 1993: 65-72 |
| 31 | | Doron Nussbaum,
Jörg-Rüdiger Sack:
Disassembling two-dimensional composite parts via translations.
Int. J. Comput. Geometry Appl. 3(1): 71-84 (1993) |
| 1992 |
|---|
| 30 | | 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) |
| 29 | | M. D. Atkinson,
Jörg-Rüdiger Sack:
Generating Binary Trees at Random.
Inf. Process. Lett. 41(1): 21-23 (1992) |
| 28 | | 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) |
| 1991 |
|---|
| 27 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings
Springer 1991 |
| 26 | | 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) |
| 1990 |
|---|
| 25 | EE | A. Knight,
J. May,
Jeff McAffer,
T. Nguyen,
Jörg-Rüdiger Sack:
A Computational geometry Workbench.
Symposium on Computational Geometry 1990: 370 |
| 24 | | 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) |
| 23 | | Jörg-Rüdiger Sack,
Thomas Strothotte:
A Characterization of Heaps and Its Applications
Inf. Comput. 86(1): 69-86 (1990) |
| 1989 |
|---|
| 22 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Nicola Santoro:
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings
Springer 1989 |
| 21 | | 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 |
| 20 | | Doron Nussbaum,
Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations.
Optimal Algorithms 1989: 153-167 |
| 19 | | 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 |
| 18 | | 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) |
| 17 | | 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) |
| 1988 |
|---|
| 16 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack:
A survey of paralle computational geometry algorithms.
Parcella 1988: 73-88 |
| 15 | | Jörg-Rüdiger Sack,
Subhash Suri:
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version).
STACS 1988: 312-321 |
| 14 | | 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 |
| 13 | | Otto Nurmi,
Jörg-Rüdiger Sack:
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).
WG 1988: 202-212 |
| 12 | | 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) |
| 11 | | James A. Dean,
Andrzej Lingas,
Jörg-Rüdiger Sack:
Recognizing polygons, or how to spy.
The Visual Computer 3(6): 344-355 (1988) |
| 1987 |
|---|
| 10 | | 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 |
| 9 | | 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 |
| 8 | EE | 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 |
| 7 | | A. Hasham,
Jörg-Rüdiger Sack:
Bounds for Min-Max Heaps.
BIT 27(3): 315-323 (1987) |
| 6 | | Andrzej Lingas,
Christos Levcopoulos,
Jörg-Rüdiger Sack:
Algorithms for Minimum Length Partitions of Polygons.
BIT 27(4): 474-479 (1987) |
| 5 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack:
Translation separability of sets of polygons.
The Visual Computer 3(4): 227-235 (1987) |
| 1986 |
|---|
| 4 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack:
Seperability of Sets of Polygons.
WG 1986: 237-251 |
| 3 | | 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) |
| 1985 |
|---|
| 2 | | Jörg-Rüdiger Sack,
Godfried T. Toussaint:
Translating Polygons in the Plane.
STACS 1985: 310-321 |
| 1 | | Jörg-Rüdiger Sack,
Thomas Strothotte:
An Algorithm for Merging Heaps.
Acta Inf. 22(2): 171-186 (1985) |
