The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jörg-Rüdiger Sack: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mohammad Ghodsi, Jörg-Rüdiger Sack
    A coarse grained parallel solution to terrain simplification. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  2. A. Knight, J. May, Jeff McAffer, T. Nguyen, Jörg-Rüdiger Sack
    A Computational geometry Workbench. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:370- [Conf]
  3. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:274-283 [Conf]
  4. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:485-486 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  6. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal CREW-PRAM Algorithms for Direct Dominance Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:109-120 [Conf]
  7. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    An Improved Approximation Algorithm for Computing Geometric Shortest Paths. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:246-257 [Conf]
  8. David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
    Parallel Neighbourhood Modelling. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1996, pp:25-34 [Conf]
  9. Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack
    Progressive TINs: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1997, pp:24-29 [Conf]
  10. Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack
    Floating-Point Filter for the Line Intersection Algorithm. [Citation Graph (0, 0)][DBLP]
    GIScience, 2004, pp:94-105 [Conf]
  11. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Optimal Shooting: Characterizations and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:220-231 [Conf]
  12. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Shortest Anisotropic Paths on Terrains. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:524-533 [Conf]
  13. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
    Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:376-385 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:40-47 [Conf]
  15. Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
    Parallel Algorithms for Rectilinear Link Distance Problems. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:65-72 [Conf]
  16. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
    Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:98-109 [Conf]
  17. Doron Nussbaum, Jörg-Rüdiger Sack
    Disassembling Two-Dimensional Composite Parts via Translations. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:153-167 [Conf]
  18. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    A survey of paralle computational geometry algorithms. [Citation Graph (0, 0)][DBLP]
    Parcella, 1988, pp:73-88 [Conf]
  19. Doron Nussbaum, Jörg-Rüdiger Sack, H. Ye
    Concurrent Parallel Shortest Path Computation. [Citation Graph (0, 0)][DBLP]
    PARCO, 2005, pp:277-284 [Conf]
  20. Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro
    Computing on a Systolic Screen: Hulls, Contours and Applications. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1987, pp:121-133 [Conf]
  21. David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
    Parallel Neighborhood Modeling. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:204-207 [Conf]
  22. Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:96-107 [Conf]
  23. Jörg-Rüdiger Sack, Subhash Suri
    An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:312-321 [Conf]
  24. Jörg-Rüdiger Sack, Godfried T. Toussaint
    Translating Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:310-321 [Conf]
  25. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximation algorithms for geometric shortest path problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:286-295 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:154-162 [Conf]
  27. Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:11-22 [Conf]
  28. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    Seperability of Sets of Polygons. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:237-251 [Conf]
  29. Otto Nurmi, Jörg-Rüdiger Sack
    Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:202-212 [Conf]
  30. Jörg-Rüdiger Sack, Thomas Strothotte
    An Algorithm for Merging Heaps. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:2, pp:171-186 [Journal]
  31. Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro
    Computational Geometry Algorithms for the Systolic Screen. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:5, pp:734-761 [Journal]
  32. Peter Epstein, J. Kavanagh, A. Knight, J. May, T. Nguyen, Jörg-Rüdiger Sack
    A Workbench for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:4, pp:404-428 [Journal]
  33. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Shortest Paths on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:4, pp:527-562 [Journal]
  34. Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:3, pp:261-289 [Journal]
  35. A. Hasham, Jörg-Rüdiger Sack
    Bounds for Min-Max Heaps. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:3, pp:315-323 [Journal]
  36. Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
    Algorithms for Minimum Length Partitions of Polygons. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:4, pp:474-479 [Journal]
  37. M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte
    Min-Max Heaps and Generalized Priority Queues. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:10, pp:996-1000 [Journal]
  38. Kurt Mehlhorn, Jörg-Rüdiger Sack
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:1-2 [Journal]
  39. Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:153-154 [Journal]
  40. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Stage-graph Representations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:1, pp:71-80 [Journal]
  41. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
    Ray shooting from convex ranges. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:259-267 [Journal]
  42. Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:131-152 [Journal]
  43. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  44. Jörg-Rüdiger Sack, Thomas Strothotte
    A Characterization of Heaps and Its Applications [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:1, pp:69-86 [Journal]
  45. Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Finding a Shortest Central Link Segment. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:2, pp:157-188 [Journal]
  46. Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
    Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:221-239 [Journal]
  47. Doron Nussbaum, Jörg-Rüdiger Sack
    Disassembling two-dimensional composite parts via translations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:71-84 [Journal]
  48. M. D. Atkinson, Jörg-Rüdiger Sack
    Generating Binary Trees at Random. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:1, pp:21-23 [Journal]
  49. M. D. Atkinson, Jörg-Rüdiger Sack
    Uniform Generation of Forests of Restricted Height. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:6, pp:323-327 [Journal]
  50. M. D. Atkinson, Jörg-Rüdiger Sack
    Pop-Stacks in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:2, pp:63-67 [Journal]
  51. Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
    On the longest increasing subsequence of a circular list. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:2, pp:55-59 [Journal]
  52. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    Determining approximate shortest paths on weighted polyhedral surfaces. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:1, pp:25-53 [Journal]
  53. M. D. Atkinson, Jörg-Rüdiger Sack
    Uniform Generation of Binary Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:101-103 [Journal]
  54. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal Parallel Algorithms for Direct Dominance Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:1, pp:72-88 [Journal]
  55. 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. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:12, n:2, pp:221-231 [Journal]
  56. Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack
    Parallel implementation of geometric shortest path algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2003, v:29, n:10, pp:1445-1479 [Journal]
  57. Anil Maheshwari, Jörg-Rüdiger Sack
    Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:31-42 [Journal]
  58. Jörg-Rüdiger Sack, Subhash Suri
    An Optimal Algorithm for Detecting Weak Visibility of a Polygon. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:10, pp:1213-1219 [Journal]
  59. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
    Planar Stage Graphs: Characterizations and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:239-255 [Journal]
  60. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
    Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:181-203 [Journal]
  61. Peter Epstein, Jörg-Rüdiger Sack
    Generating Triangulations at Random. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 1994, v:4, n:3, pp:267-278 [Journal]
  62. James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack
    Recognizing polygons, or how to spy. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:344-355 [Journal]
  63. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    Translation separability of sets of polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1987, v:3, n:4, pp:227-235 [Journal]
  64. Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack
    GlobeCon - A Scalable Framework for Context Aware Computing. [Citation Graph (0, 0)][DBLP]
    EuroSSC, 2007, pp:190-206 [Conf]
  65. Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
    Shortest Path Queries Between Geometric Objects on Surfaces. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2007, pp:82-95 [Conf]
  66. C. Hecker, David Roytenberg, Jörg-Rüdiger Sack, Z. Wang
    System development for parallel cellular automata and its applications. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 1999, v:16, n:2-3, pp:235-247 [Journal]

  67. Shortest Path Queries in Polygonal Domains. [Citation Graph (, )][DBLP]


  68. A Meeting Scheduling Problem Respecting Time and Space. [Citation Graph (, )][DBLP]


  69. Speed-constrained geodesic fréchet distance inside a simple polygon. [Citation Graph (, )][DBLP]


  70. Computing Fréchet Distance with Speed Limits. [Citation Graph (, )][DBLP]


  71. Finding Maximum Edge Bicliques in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]


  72. 06101 Abstracts Collection -- Spatial Data: mining, processing and communicating. [Citation Graph (, )][DBLP]


  73. 06101 Report -- Spatial Data: mining, processing and communicating. [Citation Graph (, )][DBLP]


  74. Shortest paths in time-dependent FIFO networks using edge load forecasts. [Citation Graph (, )][DBLP]


  75. An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. [Citation Graph (, )][DBLP]


  76. Introduction to Special Issue. [Citation Graph (, )][DBLP]


  77. Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. [Citation Graph (, )][DBLP]


  78. Editorial. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002