Alberto Márquez

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Hamiltonian triangular refinements and space-filling curves.
J. Computational Applied Mathematics, 2019

2018
Preface.
Electronic Notes in Discrete Mathematics, 2018

Shortcut sets for the locus of plane Euclidean networks.
Applied Mathematics and Computation, 2018

Computing Optimal Shortcuts for Networks.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2016
Shortcut sets for plane Euclidean networks (Extended abstract).
Electronic Notes in Discrete Mathematics, 2016

2014
There are simple and robust refinements (almost) as good as Delaunay.
Mathematics and Computers in Simulation, 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.
Applied Mathematics and Computation, 2014

Computing the Tutte polynomial of Archimedean tilings.
Applied Mathematics and Computation, 2014

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

The resolving number of a graph.
Discrete Mathematics & Theoretical Computer Science, 2013

The determining number of Kneser graphs.
Discrete Mathematics & Theoretical Computer Science, 2013

On the metric dimension, the upper dimension and the resolving number of graphs.
Discrete Applied Mathematics, 2013

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

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

2011
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.
Computers & Mathematics with Applications, 2011

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

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

Hexagonal Tilings: Tutte Uniqueness.
Ars Comb., 2010

2009
Local refinement based on the 7-triangle longest-edge partition.
Mathematics and Computers in Simulation, 2009

Monochromatic geometric k-factors in red-blue sets with white and Steiner points.
Electronic Notes in Discrete Mathematics, 2009

Preface.
Eur. J. Comb., 2009

Compatible geometric matchings.
Comput. Geom., 2009

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

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

Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics, 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

2007
Dilation-free graphs in the l1 metric.
Networks, 2007

Preface.
Electronic Notes in Discrete Mathematics, 2007

Editorial.
Comput. Geom., 2007

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


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

2005
Rebuilding convex sets in graphs.
Discrete Mathematics, 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

2004
Extremal Graphs without Topological Complete Subgraphs.
SIAM J. Discrete 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

2003
Locally grid graphs: classification and Tutte uniqueness.
Discrete Mathematics, 2003

Motion Planning and Visibility Problems using the Polar Diagram.
Proceedings of the Eurographics 2003, 2003

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

Diagonal flips in outer-triangulations on closed surfaces.
Discrete Mathematics, 2002

Single bend wiring on surfaces.
Discrete Applied Mathematics, 2002

An aperiodic tiles machine.
Comput. Geom., 2002

2001
Infinite graph embeddings on tubular surfaces.
Electronic Notes in Discrete Mathematics, 2001

Miscellaneous properties of embeddings of line, total and middle graphs.
Discrete Mathematics, 2001

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

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

Spanners in l1.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Geometric Tree Graphs of Points in Convex Position.
Discrete Applied Mathematics, 1999

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

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

1997
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

1996
The center of an infinite graph.
Discrete Mathematics, 1996

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


  Loading...