Bernardo M. Ábrego

Orcid: 0000-0003-4695-5454

According to our database1, Bernardo M. Ábrego authored at least 40 papers between 1999 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Crossing Number of Twisted Graphs.
Graphs Comb., 2022

The outerplanar crossing number of the complete bipartite graph.
Discret. Appl. Math., 2022

2021
The crossing number of centrally symmetric complete geometric graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph.
Graphs Comb., 2020

On the Crossing Number of 2-Page Book Drawings of K<sub>n</sub> with Prescribed Number of Edges in Each Page.
Graphs Comb., 2020

2019
K<sub>1,3</sub>-covering red and blue points in the plane.
Discret. Math. Theor. Comput. Sci., 2019

2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018

2017
On the Rectilinear Local Crossing Number of <i>K<sub>m, n</sub></i>.
J. Inf. Process., 2017

The rectilinear local crossing number of K<sub>n</sub>.
J. Comb. Theory, Ser. A, 2017

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

2016
On the Number of Similar Instances of a Pattern in a Finite Set.
Electron. J. Comb., 2016

2015
Computational Geometry Column 61.
SIGACT News, 2015

Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Shellable Drawings and the Cylindrical Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2014

Non-Shellable Drawings of K<sub>n</sub> with Few Crossings.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Proximity graphs inside large weighted graphs.
Networks, 2013

More on the crossing number of K<sub>n</sub>: Monotone drawings.
Electron. Notes Discret. Math., 2013

The 2-Page Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2013

Shellable drawings and the cylindrical crossing number of $K_n$.
CoRR, 2013

2012
Visibility-preserving convexifications using single-vertex moves.
Inf. Process. Lett., 2012

On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n.
Discret. Comput. Geom., 2012

2011
There is a unique crossing-minimal rectilinear drawing of K<sub>18</sub>.
Electron. Notes Discret. Math., 2011

On $(\le k)$-edges, crossings, and halving lines of geometric drawings of K<sub>n</sub>
CoRR, 2011

On crossing numbers of geometric proximity graphs.
Comput. Geom., 2011

2010
On the Maximum Number of Translates in a Point Set.
Discret. Comput. Geom., 2010

3-symmetric and 3-decomposable geometric drawings of K<sub>n</sub>.
Discret. Appl. Math., 2010

2009
Matching Points with Squares.
Discret. Comput. Geom., 2009

2008
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K<sub>n</sub>.
J. Comb. Theory, Ser. A, 2008

A central approach to bound the number of crossings in a generalized configuration.
Electron. Notes Discret. Math., 2008

The maximum number of halving lines and the rectilinear crossing number of K<sub>n</sub> for n.
Electron. Notes Discret. Math., 2008

2007
Geometric drawings of <i>K</i><sub><i>n</i></sub> with few crossings.
J. Comb. Theory, Ser. A, 2007

2005
An Application of Fermat's Little Theorem: 11054.
Am. Math. Mon., 2005

A Lower Bound for the Rectilinear Crossing Number.
Graphs Comb., 2005

2004
The Envelope, Please: 10990.
Am. Math. Mon., 2004

Structural Results For Planar Sets With Many Similar Subsets.
Comb., 2004

Matching Points with Circles and Squares.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

2002
Convex Polyhedra in R<sup>3</sup> Spanning Omega (n<sup>4/3</sup>) Congruent Triangles.
J. Comb. Theory, Ser. A, 2002

The Unit Distance Problem for Centrally Symmetric Convex Polygons.
Discret. Comput. Geom., 2002

2000
On the Maximum Number of Equilateral Triangles, I.
Discret. Comput. Geom., 2000

1999
Tightness problems in the plane.
Discret. Math., 1999


  Loading...