| Publication | Date of Publication | Type |
|---|
| Reducing Computational and Statistical Complexity in Machine Learning Through Cardinality Sparsity | 2023-02-16 | Paper |
| On the \(k\)-colored rainbow sets in fixed dimensions | 2022-06-29 | Paper |
| Cause I'm a genial imprecise point: outlier detection for uncertain data | 2022-03-24 | Paper |
Clustering geometrically-modeled points in the aggregated uncertainty model
Fundamenta Informaticae | 2022-03-09 | Paper |
Largest and smallest area triangles on imprecise points
Computational Geometry | 2021-09-16 | Paper |
Maximum-area triangle in a convex polygon, revisited
Information Processing Letters | 2020-08-04 | Paper |
A space-time trade-off for computing the visibility polygon in the multi-pass model
Soft Computing | 2020-07-15 | Paper |
On approximability of minimum color-spanning ball in high dimensions
Discrete Applied Mathematics | 2020-05-18 | Paper |
A fully polynomial time approximation scheme for the smallest diameter of imprecise points
Theoretical Computer Science | 2020-03-12 | Paper |
Geodesic center of a simple polygon using a logarithmic number of extra variables
Fundamenta Informaticae | 2019-12-06 | Paper |
Fast Fréchet distance between curves with long edges
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
International Journal of Foundations of Computer Science | 2018-05-17 | Paper |
Planar maximum-box problem revisited
Theoretical Computer Science | 2018-05-17 | Paper |
Approximation algorithms for color spanning diameter
Information Processing Letters | 2018-04-05 | Paper |
\(\alpha\)-concave hull, a generalization of convex hull
Theoretical Computer Science | 2017-11-06 | Paper |
Separability of imprecise points
Computational Geometry | 2017-07-05 | Paper |
Data imprecision under \(\lambda\)-geometry model
Information Sciences | 2017-05-16 | Paper |
1.5D terrain guarding problem parameterized by guard range
Theoretical Computer Science | 2017-01-09 | Paper |
Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Efficiently approximating color-spanning balls
Theoretical Computer Science | 2016-05-18 | Paper |
Separating bichromatic point sets by L-shapes
Computational Geometry | 2016-01-15 | Paper |
A fixed-parameter algorithm for guarding 1.5D terrains
Theoretical Computer Science | 2015-07-24 | Paper |
Computing the smallest color-spanning axis-parallel square
Algorithms and Computation | 2014-01-14 | Paper |
Uncertain Voronoi diagram
Information Processing Letters | 2010-08-20 | Paper |
Dynamic polar diagram
Information Processing Letters | 2010-06-09 | Paper |
Hyperbolic Voronoi Diagram
Computational Science and Its Applications - ICCSA 2006 | 2009-02-12 | Paper |
The Reachability Problem in a Concave Region: A New Context
Lecture Notes in Computer Science | 2008-09-30 | Paper |
| scientific article; zbMATH DE number 1728323 (Why is no real title available?) | 2002-04-15 | Paper |
