| Publication | Date of Publication | Type |
|---|
The Voronoi diagram of rotating rays with applications to floodlight illumination
Algorithmica | 2026-03-20 | Paper |
Computing the coarseness measure of a bicolored point set over guillotine partitions
Results in Applied Mathematics | 2025-01-06 | Paper |
Rectilinear convex hull of points in 3D and applications
Journal of Global Optimization | 2024-10-14 | Paper |
| The rectilinear convex hull of line segments | 2024-05-29 | Paper |
Center of maximum-sum matchings of bichromatic points
Discrete Mathematics | 2024-01-17 | Paper |
| scientific article; zbMATH DE number 7788584 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7740860 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Matching random colored points with rectangles
Journal of Combinatorial Optimization | 2023-04-14 | Paper |
Separating bichromatic point sets in the plane by restricted orientation convex hulls
Journal of Global Optimization | 2023-04-03 | Paper |
| scientific article; zbMATH DE number 7662671 (Why is no real title available?) | 2023-03-13 | Paper |
On maximum-sum matchings of points
Journal of Global Optimization | 2023-01-19 | Paper |
Rectilinear convex hull of points in 3D
(available as arXiv preprint) | 2022-10-13 | Paper |
Rectilinear Convex Hull of Points in 3D
(available as arXiv preprint) | 2022-09-13 | Paper |
Characterizations of some complexity classes between \(\Theta_2^{\mathrm{P}}\) and \(\Delta_2^{\mathrm{P}}\)
STACS 92 | 2022-08-18 | Paper |
Trees whose even-degree vertices induce a path are antimagic
Discussiones Mathematicae Graph Theory | 2022-07-01 | Paper |
Maximum box problem on stochastic points
Algorithmica | 2022-01-18 | Paper |
Optimizing generalized kernels of polygons
Journal of Global Optimization | 2021-08-17 | Paper |
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Journal of Global Optimization | 2021-04-28 | Paper |
Shortest watchman tours in simple polygons under rotated monotone visibility
(available as arXiv preprint) | 2021-04-21 | Paper |
Convex quadrangulations of bichromatic point sets
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
Maximum rectilinear convex subsets
SIAM Journal on Computing | 2021-02-08 | Paper |
Caterpillars are antimagic
Mediterranean Journal of Mathematics | 2021-01-28 | Paper |
Matching random colored points with rectangles
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Maximum box problem on stochastic points
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Maximum rectilinear convex subsets
(available as arXiv preprint) | 2020-01-30 | Paper |
Antimagic labelings of caterpillars
Applied Mathematics and Computation | 2019-11-26 | Paper |
Antimagic labelings of caterpillars
Applied Mathematics and Computation | 2019-11-26 | Paper |
Capturing points with a rotating polygon (and a 3D extension)
Theory of Computing Systems | 2019-06-27 | Paper |
Matching points with disks with a common intersection
Discrete Mathematics | 2019-06-18 | Paper |
Matching points with disks with a common intersection
Discrete Mathematics | 2019-06-18 | Paper |
$K_{1,3}$-covering red and blue points in the plane
(available as arXiv preprint) | 2019-05-23 | Paper |
| $K_{1,3}$-covering red and blue points in the plane | 2019-05-23 | Paper |
Stabbing segments with rectilinear objects
Applied Mathematics and Computation | 2019-03-29 | Paper |
Stabbing circles for sets of segments in the plane
Algorithmica | 2018-04-11 | Paper |
On Hamiltonian alternating cycles and paths
Computational Geometry | 2018-02-19 | Paper |
On Hamiltonian alternating cycles and paths
Computational Geometry | 2018-02-19 | Paper |
On the \(\mathcal{O}_\beta\)-hull of a planar point set
Computational Geometry | 2018-02-19 | Paper |
| Characteristic polynomials of production matrices for geometric graphs | 2018-01-18 | Paper |
| Production matrices for geometric graphs | 2017-02-13 | Paper |
Stabbing circles for sets of segments in the plane
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Stabbing segments with rectilinear objects
Lecture Notes in Computer Science | 2015-09-29 | Paper |
Balanced partitions of 3-colored geometric sets in the plane
Discrete Applied Mathematics | 2014-12-05 | Paper |
New results on stabbing segments with a polygon
Computational Geometry | 2014-11-24 | Paper |
| Some structural, metric and convex properties of the boundary of a graph | 2014-02-19 | Paper |
On the number of edges in geometric graphs without empty triangles
Graphs and Combinatorics | 2014-02-14 | Paper |
New results on stabbing segments with a polygon
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Rectilinear convex hull with minimum area
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Separability of point sets by \(k\)-level linear classification trees
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
On the coarseness of bicolored point sets
Computational Geometry | 2012-10-12 | Paper |
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics | 2012-06-18 | Paper |
Distinguishing trees in linear time
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
The class cover problem with boxes
Computational Geometry | 2012-05-18 | Paper |
ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Stabbers of line segments in the plane
Computational Geometry | 2011-06-17 | Paper |
Red-blue separability problems in 3D
Computational Science and Its Applications — ICCSA 2003 | 2011-03-18 | Paper |
Fitting a two-joint orthogonal chain to a point set
Computational Geometry | 2011-01-21 | Paper |
On the determining number and the metric dimension of graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
On the determining number and the metric dimension of graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Extremal graph theory for metric dimension and diameter
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Extremal graph theory for metric dimension and diameter
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Extremal graph theory for metric dimension and diameter
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Facility location problems in the plane based on reverse nearest neighbor queries
European Journal of Operational Research | 2009-11-17 | Paper |
Small weak epsilon-nets
Computational Geometry | 2009-06-18 | Paper |
| Graphs of maximum and minimum order with fixed metric dimension and diameter | 2009-05-22 | Paper |
Extremal Graph Theory for Metric Dimension and Diameter
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On finding widest empty curved corridors
Computational Geometry | 2007-10-12 | Paper |
On the metric dimension of some families of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Some structural, metric and convex properties on the boundary of a graph
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
International Journal of Computational Geometry & Applications | 2006-05-10 | Paper |
RED-BLUE SEPARABILITY PROBLEMS IN 3D
International Journal of Computational Geometry & Applications | 2005-08-23 | Paper |
On the Steiner, geodetic and hull numbers of graphs
Discrete Mathematics | 2005-06-01 | Paper |
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics | 2004-11-12 | Paper |
Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
Computational Geometry | 2003-10-14 | Paper |
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics | 2001-04-04 | Paper |
Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
RAIRO - Theoretical Informatics and Applications | 1997-04-13 | Paper |
