Jörg-Rüdiger Sack

According to our database1, Jörg-Rüdiger Sack
  • authored at least 121 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Comparison of approaches of geographic partitioning for data anonymization.
Journal of Geographical Systems, 2017

2016
Location-based anonymization: comparison and evaluation of the Voronoi-based aggregation system.
International Journal of Geographical Information Science, 2016

Approximating the Integral Fréchet Distance.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015
Approximating the Integral Fréchet Distance.
CoRR, 2015

A Novel Geographic Partitioning System for Anonymizing Health Care Data.
CoRR, 2015

Geographic Partitioning Techniques for the Anonymization of Health Care Data.
CoRR, 2015

Minimizing Walking Length in Map Matching.
Proceedings of the Topics in Theoretical Computer Science, 2015

Weighted Minimum Backward Frechet Distance.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
α-Visibility.
Comput. Geom., 2014

Similarity of polygonal curves in the presence of outliers.
Comput. Geom., 2014

Improved Algorithms for Partial Curve Matching.
Algorithmica, 2014

Minimum backward fréchet distance.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Improved Approximation for Time-Dependent Shortest Paths.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Finding paths with minimum shared edges.
J. Comb. Optim., 2013

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.
Discrete & Computational Geometry, 2013

Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492).
Dagstuhl Reports, 2013

Weighted Region Problem in Arrangement of Lines.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Similarity of Polygonal Curves in the Presence of Outliers
CoRR, 2012

Visiting All Sites with Your Dog
CoRR, 2012

CGTA-Awards 2011.
Comput. Geom., 2012

Finding Maximum Edge Bicliques in Convex Bipartite Graphs.
Algorithmica, 2012

Shortest Paths in Time-Dependent FIFO Networks.
Algorithmica, 2012

α-Visibility.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Techniques to protect privacy against inference attacks in location based services.
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on GeoStreaming, 2012

2011
Efficient, Decentralized Computation of the Topology of Spatial Regions.
IEEE Trans. Computers, 2011

Editorial.
J. Spatial Information Science, 2011

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
CoRR, 2011

Fréchet distance with speed limits.
Comput. Geom., 2011

Improved Algorithms for Partial Curve Matching.
Proceedings of the Algorithms - ESA 2011, 2011

Finding Paths with Minimum Shared Edges.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Staying Close to a Curve.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Discrete & Computational Geometry, 2010

Editorial.
Comput. Geom., 2010

10491 Summary - Representation, Analysis and Visualization of Moving Objects.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Gulls Data.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Finding Maximum Edge Bicliques in Convex Bipartite Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Speed-constrained geodesic fréchet distance inside a simple polygon.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
A meeting scheduling problem respecting time and space.
GeoInformatica, 2009

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

Shortest paths in time-dependent FIFO networks using edge load forecasts.
Proceedings of the Second International Workshop on Computational Transportation Science, 2009

Computing Fréchet Distance with Speed Limits.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Introduction to Special Issue.
Algorithmica, 2008

08451 Summary Report - Representation, Analysis and Visualization of Moving Objects.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 02.11., 2008

08451 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 02.11., 2008

Shortest Path Queries in Polygonal Domains.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

A Meeting Scheduling Problem Respecting Time and Space.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
On the longest increasing subsequence of a circular list.
Inf. Process. Lett., 2007

An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Shortest Path Queries Between Geometric Objects on Surfaces.
Proceedings of the Computational Science and Its Applications, 2007

GlobeCon - A Scalable Framework for Context Aware Computing.
Proceedings of the Smart Sensing and Context, 2007

2006
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

06101 Abstracts Collection -- Spatial Data: mining, processing and communicating.
Proceedings of the Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006, 2006

06101 Report -- Spatial Data: mining, processing and communicating.
Proceedings of the Spatial Data: mining, processing and communicating, 05.03. - 10.03.2006, 2006

How to Fit In Another Meeting.
Proceedings of the 2nd International ICST Conference on Collaborative Computing: Networking, 2006

2005
Determining approximate shortest paths on weighted polyhedral surfaces.
J. ACM, 2005

Concurrent Parallel Shortest Path Computation.
Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2004
Floating-Point Filter for the Line Intersection Algorithm.
Proceedings of the Geographic Information Science, Third International Conference, 2004

2003
Parallel implementation of geometric shortest path algorithms.
Parallel Computing, 2003

An Improved Approximation Algorithm for Computing Geometric Shortest Paths.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2001
Ray shooting from convex ranges.
Discrete Applied Mathematics, 2001

Approximating Shortest Paths on Weighted Polyhedral Surfaces.
Algorithmica, 2001

2000
An O(n log n) Algorithm for Finding a Shortest Central Link Segment.
Int. J. Comput. Geometry Appl., 2000

Editorial.
Comput. Geom., 2000

Approximation algorithms for geometric shortest path problems.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems.
Parallel Processing Letters, 1999

Pop-Stacks in Parallel.
Inf. Process. Lett., 1999

System development for parallel cellular automata and its applications.
Future Generation Comp. Syst., 1999

Editorial.
Comput. Geom., 1999

Shortest Anisotropic Paths on Terrains.
Proceedings of the Automata, 1999

1998
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.
Proceedings of the Algorithm Theory, 1998

A coarse grained parallel solution to terrain simplification.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci., 1997

Stage-graph Representations.
Discrete Applied Mathematics, 1997

Progressive TINs: Algorithms and Applications.
Proceedings of the GIS '97. Proceedings of the 5th International Workshop on Advances in Geographic Information Systems, 1997

Approximating Weighted Shortest Paths on Polyhedral Surfaces.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Approximating Weighted Shortest Paths on Polyhedral Surfaces.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Optimal Parallel Algorithms for Direct Dominance Problems.
Nord. J. Comput., 1996


Parallel Neighbourhood Modelling.
Proceedings of the GIS '96, 1996

1995
Analog Parallel Algorithms for Computational Geometry.
Parallel Algorithms Appl., 1995

Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
Algorithmica, 1995

Optimal Shooting: Characterizations and Applications.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

A note on approximations of rectilinear polygons.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Generating Triangulations at Random.
ACM Trans. Model. Comput. Simul., 1994

Uniform Generation of Binary Trees in Parallel.
J. Parallel Distrib. Comput., 1994

Uniform Generation of Forests of Restricted Height.
Inf. Process. Lett., 1994

A Workbench for Computational Geometry.
Algorithmica, 1994

1993
Disassembling two-dimensional composite parts via translations.
Int. J. Comput. Geometry Appl., 1993

Parallel Algorithms for Rectilinear Link Distance Problems.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Optimal CREW-PRAM Algorithms for Direct Dominance Problems.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Generating Binary Trees at Random.
Inf. Process. Lett., 1992

Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors.
Int. J. Comput. Geometry Appl., 1992

An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1992

1991
Computational Geometry Algorithms for the Systolic Screen.
Algorithmica, 1991

1990
A Characterization of Heaps and Its Applications
Inf. Comput., May, 1990

An Optimal Algorithm for Detecting Weak Visibility of a Polygon.
IEEE Trans. Computers, 1990

A Computational geometry Workbench.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.
Theor. Comput. Sci., 1989

Computing the configuration space for a robot on a mesh-of-processors.
Parallel Computing, 1989

An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon.
Proceedings of the STACS 89, 1989

Disassembling Two-Dimensional Composite Parts via Translations.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Computing the Configuration Space for a Robot on a Mesh-of-Processors.
Proceedings of the International Conference on Parallel Processing, 1989

1988
Recognizing polygons, or how to spy.
The Visual Computer, 1988

Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1988

Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors.
Proceedings of the SWAT 88, 1988

An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version).
Proceedings of the STACS 88, 1988

A survey of paralle computational geometry algorithms.
Proceedings of the Parcella '88, 1988

1987
Translation separability of sets of polygons.
The Visual Computer, 1987

Separability of pairs of polygons through single translations.
Robotica, 1987

Algorithms for Minimum Length Partitions of Polygons.
BIT, 1987

Bounds for Min-Max Heaps.
BIT, 1987

Computing on a Systolic Screen: Hulls, Contours and Applications.
Proceedings of the PARLE, 1987

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Computing the Link Center of a Simple Polygon.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Min-Max Heaps and Generalized Priority Queues.
Commun. ACM, 1986

Seperability of Sets of Polygons.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985
An Algorithm for Merging Heaps.
Acta Inf., 1985

Translating Polygons in the Plane.
Proceedings of the STACS 85, 1985


  Loading...