• Publications
• Influence
Rebuilding convex sets in graphs
• Computer Science, Mathematics
• Discret. Math.
• 1 July 2005
We show that every convex set of vertices in a graph is the convex hull of the collection of its contour vertices. Expand
• 47
• 8
• PDF
The difference between the metric dimension and the determining number of a graph
• Mathematics, Computer Science
• Appl. Math. Comput.
• 15 December 2014
We study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. Expand
• 15
• 5
Applied Mathematics and Computation Computing the Tutte polynomial of Archimedean tilings
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known methodExpand
• 25
• 4
Triangle-Free Planar Graphs and Segment Intersection Graphs
• Computer Science, Mathematics
• J. Graph Algorithms Appl.
• 2002
• 42
• 3
Labeling Subway Lines
• Computer Science
• ISAAC
• 24 June 2009
We present algorithms for labeling points on a line with axis-parallel rectangular labels of equal height. Expand
• 21
• 2
• PDF
The determining number of Kneser graphs
• Mathematics, Computer Science
• Discret. Math. Theor. Comput. Sci.
• 28 January 2013
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. Expand
• 10
• 2
Compact Grid Representation of Graphs
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Expand
• 3
• 2
Geometric Tree Graphs of Points in Convex Position
• Computer Science, Mathematics
• Discret. Appl. Math.
• 15 April 1999
We concentrate on the geometric tree graph of a set of n points in convex position, denoted by Gn, and prove the existence of Hamiltonian cycles and the fact that they have maximum connectivity. Expand
• 28
• 1
Computational Geometry on Surfaces
• Mathematics
• Springer Netherlands
• 2001
• 29
• 1
Steiner distance and convexity in graphs
• Computer Science, Mathematics
• Eur. J. Comb.
• 1 April 2008
We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. Expand
• 35
• 1
• PDF