| Publication | Date of Publication | Type |
|---|
Sorting under partial (interval order) information
Journal of Computational Geometry | 2024-11-22 | Paper |
Removing popular faces in curve arrangements
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
Shortest paths in portalgons
| 2024-10-16 | Paper |
Removing popular faces in curve arrangements
| 2024-10-14 | Paper |
Hard Diagrams of the Unknot
Experimental Mathematics | 2024-10-02 | Paper |
Minimum link fencing
| 2024-09-11 | Paper |
Segment visibility counting queries in polygons
| 2024-09-11 | Paper |
Preprocessing imprecise points for the Pareto front
| 2024-07-19 | Paper |
Nearest-neighbor decompositions of drawings
| 2024-05-27 | Paper |
Adjacency graphs of polyhedral surfaces
Discrete \& Computational Geometry | 2024-05-21 | Paper |
Pushing blocks by sweeping lines
| 2024-05-16 | Paper |
On cyclic solutions to the min-max latency multi-robot patrolling problem
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7779759 (Why is no real title available?)
| 2023-12-16 | Paper |
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology | 2023-12-16 | Paper |
scientific article; zbMATH DE number 7759291 (Why is no real title available?)
| 2023-11-02 | Paper |
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Minimum color spanning circle in imprecise setup
| 2023-03-30 | Paper |
Rectangular spiral galaxies are still hard
Computational Geometry | 2023-01-09 | Paper |
scientific article; zbMATH DE number 7633284 (Why is no real title available?)
| 2022-12-15 | Paper |
How to fit a tree in a box
Graphs and Combinatorics | 2022-09-28 | Paper |
Minimum color spanning circle of imprecise points
Theoretical Computer Science | 2022-08-25 | Paper |
scientific article; zbMATH DE number 7561502 (Why is no real title available?)
| 2022-07-21 | Paper |
Convex partial transversals of planar regions
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559265 (Why is no real title available?)
| 2022-07-18 | Paper |
Preprocessing Ambiguous Imprecise Points
| 2022-07-18 | Paper |
Unit disk representations of embedded trees, outerplanar and multi-legged graphs
| 2022-07-01 | Paper |
Embedding ray intersection graphs and global curve simplification
| 2022-07-01 | Paper |
Global Curve Simplification
| 2022-05-11 | Paper |
Mapping multiple regions to the grid with bounded Hausdorff distance
| 2022-03-25 | Paper |
Finding a Battleship of Uncertain Shape
| 2022-02-17 | Paper |
Labeling nonograms: boundary labeling for curve arrangements
Computational Geometry | 2021-09-17 | Paper |
Largest and smallest area triangles on imprecise points
Computational Geometry | 2021-09-16 | Paper |
Hard Diagrams of the Unknot
| 2021-04-28 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
Geometric multicut: shortest fences for separating groups of objects in the plane
Discrete \& Computational Geometry | 2020-10-23 | Paper |
Dynamic smooth compressed quadtrees
| 2020-08-18 | Paper |
On optimal polyline simplification using the Hausdorff and Fréchet distance
| 2020-08-18 | Paper |
Maximum-area triangle in a convex polygon, revisited
Information Processing Letters | 2020-08-04 | Paper |
On optimal polyline simplification using the Hausdorff and Fréchet distance
| 2020-08-04 | Paper |
Multi-colored spanning graphs
Theoretical Computer Science | 2020-08-03 | Paper |
A fully polynomial time approximation scheme for the smallest diameter of imprecise points
Theoretical Computer Science | 2020-03-12 | Paper |
Most vital segment barriers
| 2020-01-16 | Paper |
Lombardi drawings of knots and links
| 2020-01-13 | Paper |
Approximating \((k,\ell)\)-center clustering for curves
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Theoretical analysis of beaconless geocast protocols in 1D
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Region-based approximation algorithms for visibility between imprecise locations
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
Algorithmica | 2019-05-21 | Paper |
Segmentation of trajectories on non-monotone criteria
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry | 2019-02-27 | Paper |
Lombardi drawings of knots and links
Lecture Notes in Computer Science | 2019-02-20 | Paper |
How to fit a tree in a box
Lecture Notes in Computer Science | 2019-02-15 | Paper |
On the complexity of barrier resilience for fat regions and bounded ply
Computational Geometry | 2018-10-31 | Paper |
Segmentation of trajectories on nonmonotone criteria
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On the complexity of barrier resilience for fat regions
| 2018-10-17 | Paper |
Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
| 2018-08-13 | Paper |
A refined definition for groups of moving entities and its computation
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
Central trajectories
| 2018-06-05 | Paper |
A refined definition for groups of moving entities and its computation
| 2018-04-19 | Paper |
Homotopy measures for representative trajectories
| 2018-03-02 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
On the complexity of minimum-link path problems
| 2018-01-30 | Paper |
Grouping time-varying data for interactive exploration
| 2018-01-30 | Paper |
Trajectory grouping structure under geodesic distance
| 2017-10-10 | Paper |
Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
| 2017-09-29 | Paper |
Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
| 2017-08-22 | Paper |
Recognizing a DOG is hard, but not when it is thin and unit
| 2017-07-17 | Paper |
Listing all maximal cliques in large sparse real-world graphs
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
scientific article; zbMATH DE number 6707504 (Why is no real title available?)
| 2017-04-24 | Paper |
Adjacency-preserving spatial treemaps
| 2017-03-30 | Paper |
Strict Confluent Drawing
| 2017-03-30 | Paper |
Connected rectilinear graphs on point sets
| 2017-03-09 | Paper |
Flow computations on imprecise terrains
| 2017-03-09 | Paper |
Unions of onions: preprocessing imprecise points for fast onion decomposition
| 2017-03-09 | Paper |
The flip diameter of rectangulations and convex subdivisions
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2017-03-03 | Paper |
Multi-colored spanning graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Linear-size universal point sets for one-bend drawings
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Minimizing co-location potential of moving entities
SIAM Journal on Computing | 2016-10-28 | Paper |
Counting carambolas
Graphs and Combinatorics | 2016-06-09 | Paper |
Mixed Map Labeling
Lecture Notes in Computer Science | 2015-09-21 | Paper |
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Optimizing airspace closure with respect to politicians' egos
Theoretical Computer Science | 2015-05-26 | Paper |
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Computing similarity between piecewise-linear functions
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
The flip diameter of rectangulations and convex subdivisions
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Computing correlation between piecewise-linear functions
SIAM Journal on Computing | 2014-02-04 | Paper |
Terrain visibility with multiple viewpoints
Algorithms and Computation | 2014-01-14 | Paper |
Colored spanning graphs for set visualization
Graph Drawing | 2013-12-20 | Paper |
Strict confluent drawing
Graph Drawing | 2013-12-20 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
Dynamic planar point location with sub-logarithmic local updates
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Discrete \& Computational Geometry | 2013-08-05 | Paper |
Median trajectories
Algorithmica | 2013-06-25 | Paper |
Optimal 3D angular resolution for low-degree graphs
Journal of Graph Algorithms and Applications | 2013-04-09 | Paper |
How many potatoes are in a mesh?
Algorithms and Computation | 2013-03-21 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
SIAM Journal on Computing | 2012-11-29 | Paper |
Removing local extrema from imprecise terrains
Computational Geometry | 2012-05-18 | Paper |
Planar and poly-arc Lombardi drawings
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Preprocessing imprecise points for Delaunay triangulation: simplified and extended
Algorithmica | 2011-11-07 | Paper |
Detecting commuting patterns by clustering subtrajectories
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Geometric Computations on Indecisive Points
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Flow Computations on Imprecise Terrains
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Adjacency-preserving spatial treemaps
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Tracking moving objects with few handovers
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The directed Hausdorff distance between imprecise point sets
Theoretical Computer Science | 2011-07-27 | Paper |
Existence and computation of tours through imprecise points
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Peeling meshed potatoes
Algorithmica | 2011-05-10 | Paper |
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing | 2011-04-04 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Optimal 3D angular resolution for low-degree graphs
Graph Drawing | 2011-02-11 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Graph Drawing | 2011-02-11 | Paper |
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
Computational Geometry | 2011-01-31 | Paper |
Listing all maximal cliques in sparse graphs in near-optimal time
Algorithms and Computation | 2010-12-09 | Paper |
SMOOTHING IMPRECISE 1.5D TERRAINS
International Journal of Computational Geometry & Applications | 2010-09-30 | Paper |
Median trajectories
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Polychromatic 4-coloring of guillotine subdivisions
Information Processing Letters | 2010-08-20 | Paper |
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry | 2010-03-16 | Paper |
Optimization for first order Delaunay triangulations
Computational Geometry | 2010-03-16 | Paper |
Largest and smallest convex hulls for imprecise points
Algorithmica | 2010-02-23 | Paper |
The directed Hausdorff distance between imprecise point sets
Algorithms and Computation | 2009-12-17 | Paper |
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry | 2009-11-16 | Paper |
Shape Fitting on Point Sets with Probability Distributions
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Connect the Dot: Computing Feed-Links with Minimum Dilation
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Delaunay Triangulation of Imprecise Points Simplified and Extended
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Connected Rectilinear Graphs on Point Sets
Graph Drawing | 2009-03-03 | Paper |
Approximating largest convex hulls for imprecise points
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Optimization for First Order Delaunay Triangulations
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Smoothing Imprecise 1.5D Terrains
Approximation and Online Algorithms | 2009-02-12 | Paper |
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Detecting Commuting Patterns by Clustering Subtrajectories
Algorithms and Computation | 2009-01-29 | Paper |
Preprocessing Imprecise Points and Splitting Triangulations
Algorithms and Computation | 2009-01-29 | Paper |
Approximating Largest Convex Hulls for Imprecise Points
Approximation and Online Algorithms | 2008-02-20 | Paper |
Largest and Smallest Tours and Convex Hulls for Imprecise Points
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Generating realistic terrains with higher-order Delaunay triangulations
Computational Geometry | 2007-03-12 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
