Alberto Márquez

According to our database1, Alberto Márquez authored at least 62 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Hamiltonian triangular refinements and space-filling curves.
J. Comput. Appl. Math., 2019

Computing optimal shortcuts for networks.
Eur. J. Oper. Res., 2019

The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application.
Electron. Notes Discret. Math., 2018

Electron. Notes Discret. Math., 2018

Shortcut sets for the locus of plane Euclidean networks.
Appl. Math. Comput., 2018

Shortcut sets for plane Euclidean networks (Extended abstract).
Electron. Notes Discret. Math., 2016

There are simple and robust refinements (almost) as good as Delaunay.
Math. Comput. Simul., 2014

Monochromatic geometric k-factors for bicolored point sets with auxiliary points.
Inf. Process. Lett., 2014

The difference between the metric dimension and the determining number of a graph.
Appl. Math. Comput., 2014

Computing the Tutte polynomial of Archimedean tilings.
Appl. Math. Comput., 2014

Resolving sets for Johnson and Kneser graphs.
Eur. J. Comb., 2013

The resolving number of a graph.
Discret. Math. Theor. Comput. Sci., 2013

The determining number of Kneser graphs.
Discret. Math. Theor. Comput. Sci., 2013

On the metric dimension, the upper dimension and the resolving number of graphs.
Discret. Appl. Math., 2013

Cover Contact Graphs.
J. Comput. Geom., 2012

Reporting Bichromatic Segment Intersections from Point Sets.
Int. J. Comput. Geom. Appl., 2012

Separability of Point Sets by k-Level Linear Classification Trees.
Int. J. Comput. Geom. Appl., 2012

e-DANTE: an ant colony oriented depth search procedure.
Soft Comput., 2011

Stabbers of line segments in the plane.
Comput. Geom., 2011

Towards a new framework for domination.
Comput. Math. Appl., 2011

Compact Grid Representation of Graphs.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Transforming Triangulations on Nonplanar Surfaces.
SIAM J. Discret. Math., 2010

Hexagonal Tilings: Tutte Uniqueness.
Ars Comb., 2010

Local refinement based on the 7-triangle longest-edge partition.
Math. Comput. Simul., 2009

Monochromatic geometric k-factors in red-blue sets with white and Steiner points.
Electron. Notes Discret. Math., 2009

Tutte Uniqueness of Locally Grid Graphs.
Ars Comb., 2009

Geometric Realization of Möbius Triangulations.
SIAM J. Discret. Math., 2008

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

Steiner distance and convexity in graphs.
Eur. J. Comb., 2008

DANTE - The Combination between an Ant Colony Optimization Algorithm and a Depth Search Method.
Proceedings of the 8th International Conference on Hybrid Intelligent Systems (HIS 2008), 2008

Dilation-free graphs in the <i>l</i><sub>1</sub> metric.
Networks, 2007

Electron. Notes Discret. Math., 2007

Comput. Geom., 2007

Embedding graphs without edge accumulation points in tubular surfaces.
Ars Comb., 2007

A new 2D tessellation for angle problems: The polar diagram.
Comput. Geom., 2006

Rebuilding convex sets in graphs.
Discret. Math., 2005

Matricial construction of k-colourings on square lattice.
Ars Comb., 2005

Quadrangulations and 2-colorations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Extremal Graphs without Topological Complete Subgraphs.
SIAM J. Discret. Math., 2004

Euclidean position in Euclidean 2-orbifolds.
Comput. Geom., 2004

Collision Detection Using Polar Diagrams.
Proceedings of the 12-th International Conference in Central Europe on Computer Graphics, 2004

Locally grid graphs: classification and Tutte uniqueness.
Discret. Math., 2003

Transforming triangulations of polygons on non planar surfaces
CoRR, 2003

Motion Planning and Visibility Problems using the Polar Diagram.
Proceedings of the 24th Annual Conference of the European Association for Computer Graphics, 2003

Triangle-Free Planar Graphs and Segment Intersection Graphs.
J. Graph Algorithms Appl., 2002

Diagonal flips in outer-triangulations on closed surfaces.
Discret. Math., 2002

Single bend wiring on surfaces.
Discret. Appl. Math., 2002

An aperiodic tiles machine.
Comput. Geom., 2002

Infinite graph embeddings on tubular surfaces.
Electron. Notes Discret. Math., 2001

Miscellaneous properties of embeddings of line, total and middle graphs.
Discret. Math., 2001

Labeling Subway Lines.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Size of a Graph Without Topological Complete Subgraphs.
SIAM J. Discret. Math., 2000

Spanners in l<sub>1</sub>.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

On the connectivity of infinite graphs and 2-complexes.
Discret. Math., 1999

Geometric Tree Graphs of Points in Convex Position.
Discret. Appl. Math., 1999

Triangle-Free Planar Graphs as Segments Intersection Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Geometric tree graphs of points in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Diameter of a set on the cylinder.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

The width of a convex set on the sphere.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

The center of an infinite graph.
Discret. Math., 1996

On a Visibility Representation of Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995