Jörg-Rüdiger Sack

J. Informetrics, 2022

Differential Privacy via a Truncated and Normalized Laplace Mechanism.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2022

Shortest paths among transient obstacles.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Differentially private facial obfuscation via generative adversarial networks.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2022

A new model and algorithms in firefighting theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures.

[BibT_eX]

[DOI]

Frank Bauernöppel

Comput. Geom., 2022

CGTA Awards.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Tamara Mtsentlintze

Comput. Geom., 2022

2021

Obfuscation of images via differential privacy: From facial images to general images.

[BibT_eX]

[DOI]

Mohammad Khodizadeh Nahari

Peer-to-Peer Netw. Appl., 2021

A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions.

[BibT_eX]

[DOI]

Nasser Ghadiri

Ahmad Baraani-Dastjerdi

Appl. Intell., 2021

Special Issue on Algorithms and Data Structures (WADS 2019).

[BibT_eX]

[DOI]

Zachary Friggstad

Mohammad R. Salavatipour

Algorithmica, 2021

2020

The Impact of Range Constraints on Utility in the Design of Differentially Private Mechanisms.

[BibT_eX]

[DOI]

Trans. Data Priv., 2020

Preface.

[BibT_eX]

[DOI]

Zachary Friggstad

Mohammad R. Salavatipour

Comput. Geom., 2020

Preface.

[BibT_eX]

[DOI]

Faith Ellen

Comput. Geom., 2020

An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures.

[BibT_eX]

[DOI]

Frank Bauernöppel

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A New Model in Firefighting Theory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Weighted minimum backward Fréchet distance.

[BibT_eX]

[DOI]

Amin Gheibi

Theor. Comput. Sci., 2019

Differentially Private Obfuscation of Facial Images.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Extraction, 2019

2018

Query Shortest Paths Amidst Growing Discs.

[BibT_eX]

[DOI]

CoRR, 2018

Editor's note.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Approximating the integral Fréchet distance.

[BibT_eX]

[DOI]

Christian Scheffer

Comput. Geom., 2018

Path Refinement in Weighted Regions.

[BibT_eX]

[DOI]

Algorithmica, 2018

Rectilinear Shortest Paths Among Transient Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

Time-Dependent Shortest Path Queries Among Growing Discs.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Maintaining anonymity using -privacy.

[BibT_eX]

[DOI]

J. Locat. Based Serv., 2017

Comparison of approaches of geographic partitioning for data anonymization.

[BibT_eX]

[DOI]

J. Geogr. Syst., 2017

2016

Location-based anonymization: comparison and evaluation of the Voronoi-based aggregation system.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2016

2015

A Novel Geographic Partitioning System for Anonymizing Health Care Data.

[BibT_eX]

[DOI]

CoRR, 2015

Geographic Partitioning Techniques for the Anonymization of Health Care Data.

[BibT_eX]

[DOI]

CoRR, 2015

Minimizing Walking Length in Map Matching.

[BibT_eX]

[DOI]

Amin Gheibi

Proceedings of the Topics in Theoretical Computer Science, 2015

2014

α-Visibility.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Similarity of polygonal curves in the presence of outliers.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Improved Algorithms for Partial Curve Matching.

[BibT_eX]

[DOI]

Algorithmica, 2014

Minimum backward fréchet distance.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Improved Approximation for Time-Dependent Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Finding paths with minimum shared edges.

[BibT_eX]

[DOI]

Hamid Zarrabi-Zadeh

J. Comb. Optim., 2013

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

Weighted Region Problem in Arrangement of Lines.

[BibT_eX]

[DOI]

Amin Gheibi

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Visiting All Sites with Your Dog

[BibT_eX]

[DOI]

Kaveh Shahbaz

CoRR, 2012

CGTA-Awards 2011.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Finding Maximum Edge Bicliques in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Shortest Paths in Time-Dependent FIFO Networks.

[BibT_eX]

[DOI]

Frank Dehne

Algorithmica, 2012

Techniques to protect privacy against inference attacks in location based services.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM SIGSPATIAL International Workshop on GeoStreaming, 2012

2011

Efficient, Decentralized Computation of the Topology of Spatial Regions.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2011

Editorial.

[BibT_eX]

[DOI]

J. Spatial Inf. Sci., 2011

Fréchet distance with speed limits.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Staying Close to a Curve.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2010

10491 Summary - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

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

10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

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

10491 Results of the break-out group: Gulls Data.

[BibT_eX]

[DOI]

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

10491 Results of the break-out group: Aggregation.

[BibT_eX]

[DOI]

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

Speed-constrained geodesic fréchet distance inside a simple polygon.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

A meeting scheduling problem respecting time and space.

[BibT_eX]

[DOI]

GeoInformatica, 2009

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

[BibT_eX]

[DOI]

Joseph Zaks

Comput. Geom., 2009

Shortest paths in time-dependent FIFO networks using edge load forecasts.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Computational Transportation Science, 2009

Computing Fréchet Distance with Speed Limits.

[BibT_eX]

[DOI]

Kaveh Shahbaz

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Introduction to Special Issue.

[BibT_eX]

[DOI]

Algorithmica, 2008

08451 Summary Report - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 02.11., 2008

08451 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 02.11., 2008

Shortest Path Queries in Polygonal Domains.

[BibT_eX]

[DOI]

Hua Guo

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

On the longest increasing subsequence of a circular list.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Shortest Path Queries Between Geometric Objects on Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2007

GlobeCon - A Scalable Framework for Context Aware Computing.

[BibT_eX]

[DOI]

Kaiyuan Lu

Proceedings of the Smart Sensing and Context, 2007

2006

Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

06101 Abstracts Collection -- Spatial Data: mining, processing and communicating.

[BibT_eX]

[DOI]

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

06101 Report -- Spatial Data: mining, processing and communicating.

[BibT_eX]

[DOI]

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

How to Fit In Another Meeting.

[BibT_eX]

[DOI]

Proceedings of the 2nd International ICST Conference on Collaborative Computing: Networking, 2006

2005

Determining approximate shortest paths on weighted polyhedral surfaces.

[BibT_eX]

[DOI]

J. ACM, 2005

Concurrent Parallel Shortest Path Computation.

[BibT_eX]

Hua Ye

Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2004

Floating-Point Filter for the Line Intersection Algorithm.

[BibT_eX]

[DOI]

Andras Frankel

Proceedings of the Geographic Information Science, Third International Conference, 2004

2003

Parallel implementation of geometric shortest path algorithms.

[BibT_eX]

[DOI]

Parallel Comput., 2003

An Improved Approximation Algorithm for Computing Geometric Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2001

Ray shooting from convex ranges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Approximating Shortest Paths on Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Algorithmica, 2001

2000

An O(n log n) Algorithm for Finding a Shortest Central Link Segment.

[BibT_eX]

[DOI]

Hristo N. Djidjev

Int. J. Comput. Geom. Appl., 2000

Approximation algorithms for geometric shortest path problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Link Distance Problems.

[BibT_eX]

[DOI]

Hristo N. Djidjev

Proceedings of the Handbook of Computational Geometry, 2000

1999

Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1999

Pop-Stacks in Parallel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

System development for parallel cellular automata and its applications.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 1999

Editorial.

[BibT_eX]

[DOI]

Jorge Urrutia

Comput. Geom., 1999

Shortest Anisotropic Paths on Terrains.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1998

A coarse grained parallel solution to terrain simplification.

[BibT_eX]

[DOI]

Mohammad Ghodsi

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Planar Stage Graphs: Characterizations and Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Stage-graph Representations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Early Experiences in Implementing the Buffer Tree.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Progressive TINs: Algorithms and Applications.

[BibT_eX]

[DOI]

Pat Morin

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.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Optimal Parallel Algorithms for Direct Dominance Problems.

[BibT_eX]

Amitava Datta

Nord. J. Comput., 1996

Parallel Neighborhood Modeling.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Parallel Neighbourhood Modelling.

[BibT_eX]

[DOI]

Proceedings of the GIS '96, 1996

1995

Analog Parallel Algorithms for Computational Geometry.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1995

Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.

[BibT_eX]

[DOI]

Algorithmica, 1995

Optimal Shooting: Characterizations and Applications.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

A note on approximations of rectilinear polygons.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Generating Triangulations at Random.

[BibT_eX]

[DOI]

Peter Epstein

ACM Trans. Model. Comput. Simul., 1994

Uniform Generation of Binary Trees in Parallel.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Uniform Generation of Forests of Restricted Height.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

A Workbench for Computational Geometry.

[BibT_eX]

[DOI]

Algorithmica, 1994

1993

Disassembling two-dimensional composite parts via translations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

Parallel Algorithms for Rectilinear Link Distance Problems.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Parallel Processing Symposium, 1993

Optimal CREW-PRAM Algorithms for Direct Dominance Problems.

[BibT_eX]

[DOI]

Amitava Datta

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Generating Binary Trees at Random.

[BibT_eX]

[DOI]

Robert L. (Scot) Drysdale III

Inf. Process. Lett., 1992

Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors.

[BibT_eX]

[DOI]

Matthew Dickerson

Int. J. Comput. Geom. Appl., 1992

An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Hristo N. Djidjev

Discret. Comput. Geom., 1992

1991

Computational Geometry Algorithms for the Systolic Screen.

[BibT_eX]

[DOI]

Anne-Lise Hassenklover

Nicola Santoro

Algorithmica, 1991

1990

A Characterization of Heaps and Its Applications

[BibT_eX]

[DOI]

Thomas Strothotte

Inf. Comput., May, 1990

An Optimal Algorithm for Detecting Weak Visibility of a Polygon.

[BibT_eX]

[DOI]

Subhash Suri

IEEE Trans. Computers, 1990

A Computational geometry Workbench.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.

[BibT_eX]

[DOI]

Christos Levcopoulos

Theor. Comput. Sci., 1989

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

[BibT_eX]

[DOI]

Anne-Lise Hassenklover

Parallel Comput., 1989

1988

Recognizing polygons, or how to spy.

[BibT_eX]

[DOI]

James A. Dean

Vis. Comput., 1988

Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Sue Whitesides

Chee-Keng Yap

Discret. Comput. Geom., 1988

Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).

[BibT_eX]

[DOI]

Otto Nurmi

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.

[BibT_eX]

[DOI]

Ivan Stojmenovic

Proceedings of the SWAT 88, 1988

An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version).

[BibT_eX]

[DOI]

Subhash Suri

Proceedings of the STACS 88, 1988

A survey of paralle computational geometry algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parcella '88, 1988

1987

Translation separability of sets of polygons.

[BibT_eX]

[DOI]

Vis. Comput., 1987

Separability of pairs of polygons through single translations.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Robotica, 1987

Algorithms for Minimum Length Partitions of Polygons.

[BibT_eX]

[DOI]

Christos Levcopoulos

BIT, 1987

Bounds for Min-Max Heaps.

[BibT_eX]

[DOI]

A. Hasham

BIT, 1987

Computing on a Systolic Screen: Hulls, Contours and Applications.

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the PARLE, 1987

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).

[BibT_eX]

[DOI]

Christos Levcopoulos

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Min-Max Heaps and Generalized Priority Queues.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Seperability of Sets of Polygons.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985

An Algorithm for Merging Heaps.

[BibT_eX]

[DOI]

Thomas Strothotte

Acta Informatica, 1985

Translating Polygons in the Plane.

[BibT_eX]

[DOI]