| Publication | Date of Publication | Type |
|---|
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 |
Matching random colored points with rectangles
Journal of Combinatorial Optimization | 2023-04-14 | Paper |
On maximum-sum matchings of points
Journal of Global Optimization | 2023-01-19 | Paper |
Rectilinear convex hull of points in 3D
| 2022-10-13 | Paper |
Rectilinear Convex Hull of Points in 3D
| 2022-09-13 | Paper |
On weighted sums of numbers of convex polygons in point sets
Discrete & Computational Geometry | 2022-08-25 | Paper |
Maximum box problem on stochastic points
Algorithmica | 2022-01-18 | Paper |
On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon
Applied Mathematics and Computation | 2021-11-15 | Paper |
Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
Acta Mathematica Hungarica | 2021-10-25 | Paper |
Computing the depth distribution of a set of boxes
Theoretical Computer Science | 2021-08-27 | Paper |
Maximum rectilinear convex subsets
SIAM Journal on Computing | 2021-02-08 | Paper |
Matching random colored points with rectangles
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Computing coverage kernels under restricted settings
Theoretical Computer Science | 2020-04-06 | Paper |
Maximum box problem on stochastic points
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Maximum rectilinear convex subsets
| 2020-01-30 | Paper |
The intersection graph of the disks with diameters the sides of a convex \(n\)-gon
Discrete Mathematics | 2019-12-17 | 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
| 2019-05-23 | Paper |
Adaptive computation of the swap-insert correction distance
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
Computational Geometry | 2018-11-19 | Paper |
On the diameter of tree associahedra
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Computing coverage kernels under restricted settings
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Computing balanced islands in two colored point sets in the plane
Information Processing Letters | 2018-04-05 | Paper |
Colored ray configurations
Computational Geometry | 2018-02-19 | Paper |
Interval selection in the streaming model
Theoretical Computer Science | 2017-11-06 | Paper |
Depth distribution in high dimensions
| 2017-10-23 | Paper |
Drawing the almost convex set in an integer grid of minimum size
Computational Geometry | 2017-09-08 | Paper |
On guillotine cutting sequences
| 2017-08-31 | Paper |
New results on the coarseness of bicolored point sets
Information Processing Letters | 2017-04-20 | Paper |
Non-crossing Monotone Paths and Binary Trees in Edge-ordered Complete Geometric Graphs
| 2017-03-15 | Paper |
The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
Annals of Operations Research | 2017-03-03 | Paper |
Locating a single facility and a high-speed line
European Journal of Operational Research | 2016-06-23 | Paper |
Optimizing some constructions with bars: new geometric knapsack problems
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
Interval selection in the streaming model
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Adaptive computation of the swap-insert correction distance
Lecture Notes in Computer Science | 2015-10-02 | Paper |
Embedding the double circle in a square grid of minimum size
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry | 2015-04-16 | Paper |
Bichromatic 2-center of pairs of points
Computational Geometry | 2015-03-06 | Paper |
On the number of radial orderings of planar point sets.
| 2015-02-09 | Paper |
On balanced 4-holes in bichromatic point sets
Computational Geometry | 2014-12-23 | Paper |
New results on stabbing segments with a polygon
Computational Geometry | 2014-11-24 | Paper |
The 1-median and 1-highway problem
European Journal of Operational Research | 2014-07-27 | Paper |
Maximum-weight planar boxes in \(O(n^2)\) time (and better)
Information Processing Letters | 2014-04-30 | Paper |
New results on stabbing segments with a polygon
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Drawing the double circle on a grid of minimum size
| 2013-05-29 | Paper |
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry | 2013-01-25 | Paper |
Locating a service facility and a rapid transit line
Lecture Notes in Computer Science | 2013-01-07 | Paper |
The 1-center and 1-highway problem
Lecture Notes in Computer Science | 2013-01-07 | Paper |
On the number of radial orderings of colored planar point sets
Lecture Notes in Computer Science | 2013-01-07 | Paper |
On the coarseness of bicolored point sets
Computational Geometry | 2012-10-12 | Paper |
Computing optimal islands
Operations Research Letters | 2012-07-13 | Paper |
Bichromatic 2-center of pairs of points
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
The class cover problem with boxes
Computational Geometry | 2012-05-18 | Paper |
The maximum box problem for moving points in the plane
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Finding all pure strategy Nash equilibria in a planar location game
European Journal of Operational Research | 2011-08-09 | Paper |
