| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7788584 (Why is no real title available?) | 2024-01-15 | Paper |
On approximating shortest paths in weighted triangular tessellations
Artificial Intelligence | 2023-06-27 | Paper |
| On polynomials associated to Voronoi diagrams of point sets and crossing numbers | 2023-04-24 | Paper |
Separating bichromatic point sets in the plane by restricted orientation convex hulls
Journal of Global Optimization | 2023-04-03 | Paper |
On approximating shortest paths in weighted triangular tessellations
(available as arXiv preprint) | 2022-07-13 | Paper |
Analysis of self-equilibrated networks through cellular modelling
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
Analysis of self-equilibrated networks through cellular modelling
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
Optimizing generalized kernels of polygons
Journal of Global Optimization | 2021-08-17 | Paper |
Rainbow polygons for colored point sets in the plane
Discrete Mathematics | 2021-06-14 | 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 |
Maximum rectilinear convex subsets
SIAM Journal on Computing | 2021-02-08 | Paper |
Cellular morphogenesis of three-dimensional tensegrity structures
Computer Methods in Applied Mechanics and Engineering | 2020-04-09 | Paper |
Generation of planar tensegrity structures through cellular multiplication
Applied Mathematical Modelling | 2020-03-27 | Paper |
Maximum rectilinear convex subsets
(available as arXiv preprint) | 2020-01-30 | Paper |
Capturing points with a rotating polygon (and a 3D extension)
Theory of Computing Systems | 2019-06-27 | Paper |
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
Discrete Applied Mathematics | 2019-06-06 | 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 |
| Decomposition of multiple coverings into more parts | 2019-05-06 | Paper |
| Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets | 2018-12-06 | Paper |
Spectrum graph coloring and applications to Wi-Fi channel assignment
Symmetry | 2018-08-13 | Paper |
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
IEEE Transactions on Computers | 2018-06-12 | Paper |
On the \(\mathcal{O}_\beta\)-hull of a planar point set
Computational Geometry | 2018-02-19 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Bounds on spectrum graph coloring | 2017-02-13 | Paper |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
On the Fiedler value of large planar graphs
Linear Algebra and its Applications | 2014-02-19 | Paper |
Flip graphs of bounded degree triangulations
Graphs and Combinatorics | 2014-02-14 | Paper |
Binary labelings for plane quadrangulations and their relatives
(available as arXiv preprint) | 2014-02-03 | Paper |
| Binary labelings for plane quadrangulations and their relatives | 2014-02-03 | Paper |
| On the Fiedler value of large planar graphs (extended abstract) | 2013-11-01 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Bijections for Baxter families and related objects
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Bijections for Baxter families and related objects
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Decomposition of multiple coverings into more parts
Discrete & Computational Geometry | 2010-11-08 | Paper |
The number of generalized balanced lines
Discrete & Computational Geometry | 2010-11-08 | Paper |
New results on lower bounds for the number of \((\leq k)\)-facets
European Journal of Combinatorics | 2009-11-30 | Paper |
| Embedding quadrangulations on a 2-book | 2009-05-22 | Paper |
scientific article; zbMATH DE number 5555978 (Why is no real title available?)
(available as arXiv preprint) | 2009-05-22 | Paper |
| Balanced lines in two-coloured point sets | 2009-05-20 | Paper |
New results on lower bounds for the number of (⩽ k)-facets
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
Discrete & Computational Geometry | 2007-10-11 | Paper |
Assymptotically efficient triangulations of the d-cube∗
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
From graphs to tensegrity structures: geometric and symbolic approaches
Publicacions Matemàtiques | 2007-04-05 | Paper |
From graphs to tensegrity structures: geometric and symbolic approaches
Publicacions Matemàtiques | 2007-04-05 | Paper |
Combinatorial pseudo-triangulations
Discrete Mathematics | 2007-02-13 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry | 2005-05-04 | Paper |
The polytope of non-crossing graphs on a planar point set
Discrete & Computational Geometry | 2005-04-15 | Paper |
The polytope of non-crossing graphs on a planar point set
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Non-crossing frameworks with non-crossing reciprocals
Discrete & Computational Geometry | 2005-02-23 | Paper |
Asymptotically efficient triangulations of the \(d\)-cube
Discrete & Computational Geometry | 2004-02-05 | Paper |
Comparison of Box-Tiao and Johansen canonical estimators of cointegrating vectors in VEC(1) models
Journal of Econometrics | 1995-11-28 | Paper |
Rainbow ortho-convex 4-sets in k-colored point sets
(available as arXiv preprint) | N/A | Paper |
