Javier Tejel

Leonardo Martínez-Sandoval

CoRR, 2022

Empty Triangles in Generalized Twisted Drawings of Kn.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Maximum Rectilinear Convex Subsets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

SIAM J. Comput., 2021

Rainbow polygons for colored point sets in the plane.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Mikio Kano

Discret. Math., 2021

Total domination in plane triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2021

On plane subgraphs of complete topological drawings.

[BibT_eX]

[DOI]

Javier Tejel Altarriba

Alexander Pilz

Ars Math. Contemp., 2021

2020

Plane augmentation of plane graphs to meet parity constraints.

[BibT_eX]

[DOI]

Juan C. Catana-Salazar

Alfredo García

CoRR, 2020

Plane augmentation of plane graphs to meet parity constraints.

[BibT_eX]

[DOI]

Juan C. Catana-Salazar

Silvia Fernández-Merchant

Appl. Math. Comput., 2020

2019

K1,3-covering red and blue points in the plane.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Discret. Math. Theor. Comput. Sci., 2019

2018

Colored ray configurations.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

Comput. Geom., 2018

On Hamiltonian alternating cycles and paths.

[BibT_eX]

[DOI]

Mercè Claverol

Delia Garijo

Carlos Seara

Comput. Geom., 2018

2017

Polynomially solvable cases of the bipartite traveling salesman problem.

[BibT_eX]

[DOI]

Silvia Fernández-Merchant

Eur. J. Oper. Res., 2017

$K_{1, 3}$-covering red and blue points in the plane.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

CoRR, 2017

2016

Configurations of Non-crossing Rays and Related Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

2015

Geometric Biplane Graphs II: Graph Augmentation.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Blocking the k-Holes of Point Sets in the Plane.

[BibT_eX]

[DOI]

Javier Cano

Graphs Comb., 2015

2014

Compatible spanning trees.

[BibT_eX]

[DOI]

Clemens Huemer

Comput. Geom., 2014

2013

Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon.

[BibT_eX]

[DOI]

Pedro Jodrá

Algorithmica, 2013

2011

Augmenting the Rigidity of a Graph in R2.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Augmenting the Connectivity of Outerplanar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

On triconnected and cubic plane graphs on given point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2009

2008

Augmenting the connectivity of geometric graphs.

[BibT_eX]

[DOI]

Manuel Abellanas

Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.

[BibT_eX]

[DOI]

Manuel Abellanas

Prosenjit Bose

Comput. Geom., 2008

2007

On embedding triconnected cubic graphs on point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

2006

Moving coins.

[BibT_eX]

[DOI]

Manuel Abellanas

Sergey Bereg

David Rappaport

Comput. Geom., 2006

2002

A note on the traveling repairman problem.

[BibT_eX]

[DOI]

Pedro Jodrá

Networks, 2002

Packing trees into planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

On the minimum size of visibility graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2000

Lower bounds on the number of crossing-free subgraphs of KN.

[BibT_eX]

[DOI]

Comput. Geom., 2000

1998

An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays.

[BibT_eX]

[DOI]

Pedro Jodrá

Inf. Process. Lett., 1998

A Lower Bound for the Number of Polygonizations of N Points in the Plane.

[BibT_eX]

Ars Comb., 1998

1996

Using Total Monotonicity for Two Optimization Problems on the Plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

1995

The Order of Points on the Second Convex Hull of a Simple Polygon.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Lower bounds for the number noncrossing free subgraphs of Kn.

[BibT_eX]

[DOI]