Alfredo García

Orcid: 0000-0002-6519-1472

Affiliations:
  • University of Zaragoza, Zaragoza, Spain


According to our database1, Alfredo García authored at least 33 papers between 1995 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.
Discret. Comput. Geom., January, 2024

2023
Empty Triangles in Generalized Twisted Drawings of K<sub>n</sub>.
J. Graph Algorithms Appl., 2023

2022
Shooting Stars in Simple Drawings of K<sub>m, n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
Total domination in plane triangulations.
Discret. Math., 2021

On plane subgraphs of complete topological drawings.
Ars Math. Contemp., 2021

2020
Packing plane spanning trees into a point set.
Comput. Geom., 2020

Plane augmentation of plane graphs to meet parity constraints.
Appl. Math. Comput., 2020

2018
Colored ray configurations.
Comput. Geom., 2018

On Hamiltonian alternating cycles and paths.
Comput. Geom., 2018

2017
Polynomially solvable cases of the bipartite traveling salesman problem.
Eur. J. Oper. Res., 2017

2016
Configurations of Non-crossing Rays and Related Problems.
Discret. Comput. Geom., 2016

2015
Geometric Biplane Graphs II: Graph Augmentation.
Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs Comb., 2015

Blocking the k-Holes of Point Sets in the Plane.
Graphs Comb., 2015

2014
Compatible spanning trees.
Comput. Geom., 2014

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

2011
Augmenting the Rigidity of a Graph in <i>R</i><sup>2</sup>.
Algorithmica, 2011

2010
Augmenting the Connectivity of Outerplanar Graphs.
Algorithmica, 2010

2009
On triconnected and cubic plane graphs on given point sets.
Comput. Geom., 2009

Compatible geometric matchings.
Comput. Geom., 2009

2008
Augmenting the connectivity of geometric graphs.
Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.
Comput. Geom., 2008

2007
On embedding triconnected cubic graphs on point sets.
Electron. Notes Discret. Math., 2007

2006
Moving coins.
Comput. Geom., 2006

2002
A note on the traveling repairman problem.
Networks, 2002

Packing trees into planar graphs.
J. Graph Theory, 2002

On the minimum size of visibility graphs.
Inf. Process. Lett., 2002

2000
Lower bounds on the number of crossing-free subgraphs of K<sub>N</sub>.
Comput. Geom., 2000

1998
An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays.
Inf. Process. Lett., 1998

A Lower Bound for the Number of Polygonizations of N Points in the Plane.
Ars Comb., 1998

1996
Using Total Monotonicity for Two Optimization Problems on the Plane.
Inf. Process. Lett., 1996

1995
The Order of Points on the Second Convex Hull of a Simple Polygon.
Discret. Comput. Geom., 1995

Lower bounds for the number noncrossing free subgraphs of K<sub>n</sub>.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995


  Loading...