| Publication | Date of Publication | Type |
|---|
Covering segments on a line with drones
Information Processing Letters | 2025-01-14 | Paper |
Constructing red-black spanners for mixed-charging vehicular networks
Theoretical Computer Science | 2024-12-12 | Paper |
| Computing random \(r\)-orthogonal Latin squares | 2024-09-16 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
Connectivity and stochastic robustness of synchronized multi-drone systems
Discrete Applied Mathematics | 2024-04-02 | Paper |
Computing balanced convex partitions of lines
Algorithmica | 2023-08-17 | Paper |
Constructing order type graphs using an axiomatic approach
(available as arXiv preprint) | 2023-03-21 | Paper |
| Improved Bounds for Permutation Arrays Under Chebyshev Distance | 2023-02-24 | Paper |
| Bounds for Permutation Arrays under Kendall Tau Metric | 2023-01-26 | Paper |
On maximum-sum matchings of points
Journal of Global Optimization | 2023-01-19 | Paper |
Computation of new diagonal graph Ramsey numbers
Electronic Journal of Graph Theory and Applications | 2022-11-29 | Paper |
| Computing balanced convex partitions of lines | 2022-10-13 | Paper |
Algorithms for Radon partitions with tolerance
Discrete Applied Mathematics | 2022-08-04 | Paper |
New algorithms and bounds for halving pseudolines
Discrete Applied Mathematics | 2022-08-04 | Paper |
Using permutation rational functions to obtain permutation arrays with large Hamming distance
Designs, Codes and Cryptography | 2022-07-13 | Paper |
| Failure and communication in a synchronized multi-drone system | 2022-03-24 | Paper |
Improved lower bounds for permutation arrays using permutation rational functions
(available as arXiv preprint) | 2021-10-04 | Paper |
Algorithms for Radon partitions with tolerance
Algorithms and Discrete Applied Mathematics | 2020-07-21 | Paper |
New algorithms and bounds for halving pseudolines
Algorithms and Discrete Applied Mathematics | 2020-07-21 | Paper |
New lower bounds for Tverberg partitions with tolerance in the plane
Discrete Applied Mathematics | 2020-06-29 | Paper |
On the robustness of a synchronized multi-robot system
Journal of Combinatorial Optimization | 2020-04-27 | Paper |
Constructing permutation arrays using partition and extension
Designs, Codes and Cryptography | 2020-01-31 | Paper |
A lower bound on permutation codes of distance \(n-1\)
Designs, Codes and Cryptography | 2020-01-09 | Paper |
| Equivalence Relations for Computing Permutation Polynomials | 2019-11-28 | Paper |
Computing melodic templates in oral music traditions
Applied Mathematics and Computation | 2019-11-25 | Paper |
New lower bounds for permutation arrays using contraction
Designs, Codes and Cryptography | 2019-09-12 | Paper |
On some matching problems under the color-spanning model
Theoretical Computer Science | 2019-08-20 | Paper |
A construction of product blocks with a fixed block size
(available as arXiv preprint) | 2019-07-24 | Paper |
On the fixed-parameter tractability of some matching problems under the color-spanning model
Frontiers in Algorithmics | 2019-04-26 | Paper |
Computing the \(k\)-resilience of a synchronized multi-robot system
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Monadic decomposition
Journal of the ACM | 2018-05-17 | Paper |
Optimizing squares covering a set of points
Theoretical Computer Science | 2018-05-17 | Paper |
Constructing permutation arrays from groups
Designs, Codes and Cryptography | 2018-04-16 | Paper |
Certifying and constructing minimally rigid graphs in the plane
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Curvature-bounded traversals of narrow corridors
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
The lifting model for reconfiguration
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Node overlap removal by growing a tree
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
A new algorithmic framework for basic problems on binary images
Discrete Applied Mathematics | 2017-05-12 | Paper |
Extending permutation arrays: improving MOLS bounds
Designs, Codes and Cryptography | 2017-04-12 | Paper |
Node overlap removal by growing a tree
Lecture Notes in Computer Science | 2017-02-21 | Paper |
On the 2-center problem under convex polyhedral distance function
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Representing permutations with few moves
SIAM Journal on Discrete Mathematics | 2016-10-20 | Paper |
Edge routing with ordered bundles
Computational Geometry | 2016-05-17 | Paper |
| Resilience of a synchronized multi-agent system | 2016-04-29 | Paper |
Optimizing some constructions with bars: new geometric knapsack problems
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
On the edge crossing properties of Euclidean minimum weight Laman graphs
Computational Geometry | 2016-01-18 | Paper |
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation | 2016-01-11 | Paper |
Embedding the double circle in a square grid of minimum size
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
On balanced 4-holes in bichromatic point sets
Computational Geometry | 2014-12-23 | Paper |
Balanced partitions of 3-colored geometric sets in the plane
Discrete Applied Mathematics | 2014-12-05 | Paper |
| Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\) | 2014-05-22 | Paper |
On the edge crossing properties of Euclidean minimum weight Laman graphs
Algorithms and Computation | 2014-01-14 | Paper |
Drawing permutations with few corners
Graph Drawing | 2013-12-20 | Paper |
Compatible Geometric Matchings
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
| Drawing the double circle on a grid of minimum size | 2013-05-29 | Paper |
A new framework for connected components labeling of binary images
Combinatorial Image Analaysis | 2013-04-04 | Paper |
Small work space algorithms for some basic problems on binary images
Combinatorial Image Analaysis | 2013-04-04 | Paper |
On the coarseness of bicolored point sets
Computational Geometry | 2012-10-12 | Paper |
Computing generalized ham-sandwich cuts
Information Processing Letters | 2012-07-25 | Paper |
Balanced line for a 3-colored point set in the plane
The Electronic Journal of Combinatorics | 2012-06-12 | 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 |
Edge routing with ordered bundles
Graph Drawing | 2012-03-09 | Paper |
On the red/blue spanning tree problem
Theoretical Computer Science | 2011-05-18 | Paper |
Voronoi diagram of polygonal chains under the discrete Fréchet distance
International Journal of Computational Geometry & Applications | 2010-09-30 | Paper |
Guarding a terrain by two watchtowers
Algorithmica | 2010-09-16 | Paper |
Maximum area independent sets in disk intersection graphs
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
On covering problems of Rado
Algorithmica | 2010-05-19 | Paper |
On characterizations of rigid graphs in the plane using spanning trees
Graphs and Combinatorics | 2009-12-09 | Paper |
Finding Nearest Larger Neighbors
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Transforming pseudo-triangulations
Information Processing Letters | 2009-07-21 | Paper |
On the Red/Blue Spanning Tree Problem
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Robust Point-Location in Generalized Voronoi Diagrams
Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence | 2009-05-20 | Paper |
Traversing a set of points with a minimum number of turns
Discrete & Computational Geometry | 2009-05-06 | Paper |
A PTAS for cutting out polygons with lines
Algorithmica | 2009-04-29 | Paper |
Orthogonal equipartitions
Computational Geometry | 2009-03-09 | Paper |
SLIDING DISKS IN THE PLANE
International Journal of Computational Geometry & Applications | 2009-03-02 | Paper |
Traversing a set of points with a minimum number of turns
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Clustered SplitsNetworks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Transforming Graphs with the Same Degree Sequence
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Matching points with rectangles and squares
Computational Geometry | 2008-11-19 | Paper |
On Covering Problems of Rado
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-07-10 | Paper |
On Some City Guarding Problems
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs
Computational Geometry | 2008-03-26 | Paper |
Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
Discrete and Computational Geometry | 2008-03-18 | Paper |
Sliding Disks in the Plane
Discrete and Computational Geometry | 2008-03-18 | Paper |
Straightening Drawings of Clustered Hierarchical Graphs
Lecture Notes in Computer Science | 2008-03-07 | Paper |
On finding widest empty curved corridors
Computational Geometry | 2007-10-12 | Paper |
RNA multiple structural alignment with longest common subsequences
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
A PTAS for Cutting Out Polygons with Lines
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Wiener indices of balanced binary trees
Discrete Applied Mathematics | 2007-03-08 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
The lifting model for reconfiguration
Discrete & Computational Geometry | 2006-08-11 | Paper |
Equitable subdivisions within polygonal regions
Computational Geometry | 2006-04-28 | Paper |
Moving coins
Computational Geometry | 2006-04-28 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
AN APPROXIMATE MORPHING BETWEEN POLYLINES
International Journal of Computational Geometry & Applications | 2005-08-23 | Paper |
Equipartitions of measures by 2-fans
Discrete & Computational Geometry | 2005-08-17 | Paper |
Enumerating pseudo-triangulations in the plane
Computational Geometry | 2005-05-12 | Paper |
| scientific article; zbMATH DE number 2152532 (Why is no real title available?) | 2005-04-05 | Paper |
| scientific article; zbMATH DE number 2149349 (Why is no real title available?) | 2005-03-30 | Paper |
A conjecture on Wiener indices in combinatorial chemistry
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2105035 (Why is no real title available?) | 2004-10-01 | Paper |
CYLINDRICAL HIERARCHY FOR DEFORMING NECKLACES
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Computing random $r$-orthogonal Latin squares
(available as arXiv preprint) | N/A | Paper |
