| Publication | Date of Publication | Type |
|---|
Computing conforming partitions with low stabbing number for rectilinear polygons
Information and Computation | 2026-03-20 | Paper |
Approximation algorithms for minimum ply covering of points with unit squares and unit disks
Theoretical Computer Science | 2024-12-12 | Paper |
| Cops and robbers on 1-planar graphs | 2024-10-14 | Paper |
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Minimum ply covering of points with unit squares
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Clustering Moving Entities in Euclidean Space. | 2023-11-02 | Paper |
| Cops and Robbers on 1-Planar Graphs | 2023-09-02 | Paper |
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
Bottleneck convex subsets: finding \(k\) large convex sets in a point set
(available as arXiv preprint) | 2023-03-30 | Paper |
On the restricted \(k\)-Steiner tree problem
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Computing the \(k\)-visibility region of a point in a polygon
Theory of Computing Systems | 2021-06-11 | Paper |
| On the restricted 1-Steiner tree problem | 2021-04-21 | Paper |
Robustness and asymptotics of the projection median
Journal of Multivariate Analysis | 2021-03-12 | Paper |
Local routing in convex subdivisions
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
| Computing the \(k\)-crossing visibility region of a point in a polygon | 2020-02-25 | Paper |
Integrated rank-weighted depth
Journal of Multivariate Analysis | 2019-10-01 | Paper |
A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
Theoretical Computer Science | 2019-09-10 | Paper |
Polygon simplification by minimizing convex corners
Theoretical Computer Science | 2019-09-10 | Paper |
A simple linear-space data structure for constant-time range minimum query
Theoretical Computer Science | 2019-05-02 | Paper |
On Combinatorial Depth Measures
International Journal of Computational Geometry & Applications | 2019-04-24 | Paper |
Relating graph thickness to planar layers and bend complexity
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Drawing plane triangulations with few segments
Computational Geometry | 2018-11-19 | Paper |
| The projection median as a weighted average | 2018-06-05 | Paper |
Competitive online routing on Delaunay triangulations
International Journal of Computational Geometry & Applications | 2018-02-22 | Paper |
Thickness and colorability of geometric graphs
Computational Geometry | 2018-01-19 | Paper |
| Relating graph thickness to planar layers and bend complexity | 2017-12-19 | Paper |
Guarding orthogonal art galleries with sliding cameras
Computational Geometry | 2017-09-08 | Paper |
Computing conforming partitions of orthogonal polygons with minimum stabbing number
Theoretical Computer Science | 2017-09-07 | Paper |
Guarding monotone art galleries with sliding cameras in linear time
Journal of Discrete Algorithms | 2017-07-13 | Paper |
Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Polygon simplification by minimizing convex corners
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Linear-space data structures for range frequency queries on arrays and trees
Algorithmica | 2016-03-23 | Paper |
A 3-approximation algorithm for guarding orthogonal art galleries with sliding cameras
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Guarding monotone art galleries with sliding cameras in linear time
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Linear-space data structures for range minority query in arrays
Algorithmica | 2015-09-02 | Paper |
Low space data structures for geometric range mode query
Theoretical Computer Science | 2015-05-22 | Paper |
Plane 3-trees: embeddability and approximation
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Theoretical Computer Science | 2015-05-18 | Paper |
Local routing in convex subdivisions
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Linear-space data structures for range mode query in arrays
Theory of Computing Systems | 2015-02-05 | Paper |
On graphs that are not PCGs
Theoretical Computer Science | 2015-01-30 | Paper |
Searching on a line: a complete characterization of the optimal solution
Theoretical Computer Science | 2015-01-28 | Paper |
Trade-Offs in Planar Polyline Drawings
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Drawing planar graphs with reduced height
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Robust nonparametric simplification of polygonal chains
International Journal of Computational Geometry & Applications | 2014-12-01 | Paper |
Cycle-maximal triangle-free graphs
Discrete Mathematics | 2014-11-20 | Paper |
Competitive online routing on Delaunay triangulations
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Bounding the locality of distributed routing algorithms
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Indexed geometric jumbled pattern matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Drawing HV-Restricted Planar Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras
Lecture Notes in Computer Science | 2014-03-31 | Paper |
On balanced +-contact representations
Graph Drawing | 2013-12-20 | Paper |
Thickness and colorability of geometric graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear-space data structures for range frequency queries on arrays and trees
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Guarding orthogonal art galleries using sliding cameras: algorithmic and hardness results
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Revisiting the problem of searching on a line
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A simple linear-space data structure for constant-time range minimum query
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Plane 3-trees: embeddability and approximation (extended abstract)
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A note on minimum-segment drawings of planar graphs
Journal of Graph Algorithms and Applications | 2013-07-09 | Paper |
Bounding the locality of distributed routing algorithms
Distributed Computing | 2013-06-25 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Range majority in constant time and linear space
Information and Computation | 2013-06-06 | Paper |
On graphs that are not PCGs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
A note on improving the performance of approximation algorithms for radiation therapy
Information Processing Letters | 2013-03-28 | Paper |
Robust nonparametric data approximation of point sets via data reduction
Algorithms and Computation | 2013-03-21 | Paper |
Cool-lex order and \(k\)-ary Catalan structures
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Discrete Applied Mathematics | 2013-01-18 | Paper |
Hamiltonian Paths and Cycles in Planar Graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Computing partitions of rectilinear polygons with minimum stabbing number
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Linear-space data structures for range mode query in arrays | 2012-08-23 | Paper |
Linear-space data structures for range minority query in arrays
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On the hardness of point-set embeddability (extended abstract)
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
Graph Drawing | 2012-03-09 | Paper |
Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Reconstructing polygons from scanner data
Theoretical Computer Science | 2011-07-27 | Paper |
Untangled monotonic chains and adaptive range search
Theoretical Computer Science | 2011-07-27 | Paper |
Range Majority in Constant Time and Linear Space
Automata, Languages and Programming | 2011-07-06 | Paper |
Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
Computational Geometry | 2011-06-17 | Paper |
An improved line-separable algorithm for discrete unit disk cover
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Algorithms and Computation | 2009-12-17 | Paper |
Reconstructing polygons from scanner data
Algorithms and Computation | 2009-12-17 | Paper |
Untangled monotonic chains and adaptive range search
Algorithms and Computation | 2009-12-17 | Paper |
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Kinetic maintenance of mobile \(k\)-centres on trees
Discrete Applied Mathematics | 2009-06-30 | Paper |
The projection median of a set of points
Computational Geometry | 2009-06-18 | Paper |
BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
Kinetic Maintenance of Mobile k-Centres on Trees
Algorithms and Computation | 2008-05-27 | Paper |
Balancing Traffic Load Using One-Turn Rectilinear Routing
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
Distributed Computing and Networking | 2008-03-06 | Paper |
THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
International Journal of Computational Geometry & Applications | 2006-09-04 | Paper |
Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
Discrete Mathematics | 2003-04-28 | Paper |
The rectilinear crossing number of \(K_{10}\) is 62
The Electronic Journal of Combinatorics | 2001-06-18 | Paper |
The rectilinear crossing number of \(K_{10}\) is 62
The Electronic Journal of Combinatorics | 2001-06-18 | Paper |
The rectilinear crossing number of \(K_{10}\) is 62
The Electronic Journal of Combinatorics | 2001-06-18 | Paper |
