default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernardo M. Ábrego
Person information
- affiliation: California State University at Northridge, Department of Mathematics, Northridge, CA, USA
- affiliation (PhD 2001): Rutgers University, New Brunswick, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Bernardo M. Ábrego, Silvia Fernández-Merchant
, Oswin Aichholzer, Jesús Leaños, Gelasio Salazar:
There is a unique crossing-minimal rectilinear drawing of K_18. Ars Math. Contemp. 24(2): 2 (2024)- [j34]Bernardo M. Ábrego, Julia Kinzel, Silvia Fernández-Merchant, Evgeniya Lagoda, Yakov Sapozhnikov:
On Book Crossing Numbers of the Complete Graph. SIAM J. Discret. Math. 38(2): 1686-1700 (2024) - [c6]Bernardo M. Ábrego, Silvia Fernández-Merchant:
On the crossing number of symmetric configurations. CCCG 2024: 271-277 - 2022
- [j33]Bernardo M. Ábrego, Silvia Fernández-Merchant:
The outerplanar crossing number of the complete bipartite graph. Discret. Appl. Math. 321: 379-384 (2022) - [j32]Bernardo M. Ábrego, Silvia Fernández-Merchant, Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
The Crossing Number of Twisted Graphs. Graphs Comb. 38(5): 134 (2022) - 2021
- [c5]Bernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant:
The crossing number of centrally symmetric complete geometric graphs. LAGOS 2021: 275-279 - 2020
- [j31]Bernardo M. Ábrego, Silvia Fernández-Merchant, Athena Sparks:
The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph. Graphs Comb. 36(2): 205-220 (2020) - [j30]Bernardo M. Ábrego, Silvia Fernández-Merchant, Evgeniya Lagoda, Pedro Ramos:
On the Crossing Number of 2-Page Book Drawings of Kn with Prescribed Number of Edges in Each Page. Graphs Comb. 36(2): 303-318 (2020)
2010 – 2019
- 2019
- [j29]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
K1,3-covering red and blue points in the plane. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j28]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. SIAM J. Discret. Math. 32(4): 2482-2492 (2018) - 2017
- [j27]Bernardo M. Ábrego, Silvia Fernández-Merchant:
The rectilinear local crossing number of Kn. J. Comb. Theory A 151: 131-145 (2017) - [j26]Bernardo M. Ábrego, Kory Dondzila, Silvia Fernández-Merchant, Evgeniya Lagoda, Seyed Sajjadi, Yakov Sapozhnikov:
On the Rectilinear Local Crossing Number of Km, n. J. Inf. Process. 25: 542-550 (2017) - [i7]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
$K_{1, 3}$-covering red and blue points in the plane. CoRR abs/1707.06856 (2017) - 2016
- [j25]Bernardo M. Ábrego, Silvia Fernández-Merchant, Daniel J. Katz, Levon Kolesnikov:
On the Number of Similar Instances of a Pattern in a Finite Set. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j24]Bernardo M. Ábrego, Adrian Dumitrescu, Silvia Fernández, Csaba D. Tóth:
Computational Geometry Column 61. SIGACT News 46(2): 65-77 (2015) - [c4]Bernardo M. Ábrego, Silvia Fernández-Merchant, Csaba D. Tóth:
Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections. GD 2015: 541 - [i6]Bernardo M. Ábrego, Silvia Fernández-Merchant, Daniel J. Katz, Levon Kolesnikov:
On The Number of Similar Instances of a Pattern in a Finite Set. CoRR abs/1501.00076 (2015) - [i5]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. CoRR abs/1510.00549 (2015) - 2014
- [j23]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
Shellable Drawings and the Cylindrical Crossing Number of Kn. Discret. Comput. Geom. 52(4): 743-753 (2014) - [c3]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Birgit Vogtenhuber:
Non-Shellable Drawings of Kn with Few Crossings. CCCG 2014 - 2013
- [j22]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
The 2-Page Crossing Number of Kn. Discret. Comput. Geom. 49(4): 747-777 (2013) - [j21]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
More on the crossing number of Kn: Monotone drawings. Electron. Notes Discret. Math. 44: 411-414 (2013) - [j20]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán, Maria Saumell:
Proximity graphs inside large weighted graphs. Networks 61(1): 29-39 (2013) - [i4]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
Shellable drawings and the cylindrical crossing number of $K_n$. CoRR abs/1309.3665 (2013) - 2012
- [j19]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n. Discret. Comput. Geom. 48(1): 192-215 (2012) - [j18]Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. Inf. Process. Lett. 112(5): 161-163 (2012) - [c2]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
The 2-page crossing number of Kn. SCG 2012: 397-404 - [i3]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
The 2-page crossing number of Kn. CoRR abs/1206.5669 (2012) - 2011
- [j17]Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristán, Maria Saumell:
On crossing numbers of geometric proximity graphs. Comput. Geom. 44(4): 216-233 (2011) - [j16]Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
There is a unique crossing-minimal rectilinear drawing of K18. Electron. Notes Discret. Math. 38: 547-552 (2011) - [i2]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
On $(\le k)$-edges, crossings, and halving lines of geometric drawings of Kn. CoRR abs/1102.5065 (2011) - [i1]Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. CoRR abs/1105.3435 (2011) - 2010
- [j15]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
3-symmetric and 3-decomposable geometric drawings of Kn. Discret. Appl. Math. 158(12): 1240-1258 (2010) - [j14]Bernardo M. Ábrego, Silvia Fernández-Merchant, Bernardo Llano:
On the Maximum Number of Translates in a Point Set. Discret. Comput. Geom. 43(1): 1-20 (2010)
2000 – 2009
- 2009
- [j13]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - 2008
- [j12]Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
The maximum number of halving lines and the rectilinear crossing number of Kn for n. Electron. Notes Discret. Math. 30: 261-266 (2008) - [j11]Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
A central approach to bound the number of crossings in a generalized configuration. Electron. Notes Discret. Math. 30: 273-278 (2008) - [j10]Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn. J. Comb. Theory A 115(7): 1257-1264 (2008) - 2007
- [j9]Bernardo M. Ábrego, Silvia Fernández-Merchant:
Geometric drawings of Kn with few crossings. J. Comb. Theory A 114(2): 373-379 (2007) - 2005
- [j8]Bernardo M. Ábrego, Silvia Fernández-Merchant:
A Lower Bound for the Rectilinear Crossing Number. Graphs Comb. 21(3): 293-300 (2005) - [j7]Shahin Amrabov, Bernardo M. Ábrego:
An Application of Fermat's Little Theorem: 11054. Am. Math. Mon. 112(8): 751 (2005) - 2004
- [j6]Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant:
Structural Results For Planar Sets With Many Similar Subsets. Comb. 24(4): 541-554 (2004) - [j5]Rick Mabry, Bernardo M. Ábrego:
The Envelope, Please: 10990. Am. Math. Mon. 111(9): 825-826 (2004) - [c1]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Circles and Squares. JCDCG 2004: 1-15 - 2002
- [j4]Bernardo M. Ábrego, Silvia Fernández-Merchant:
The Unit Distance Problem for Centrally Symmetric Convex Polygons. Discret. Comput. Geom. 28(4): 467-473 (2002) - [j3]Bernardo M. Ábrego, Silvia Fernández-Merchant:
Convex Polyhedra in R3 Spanning Omega (n4/3) Congruent Triangles. J. Comb. Theory A 98(2): 406-409 (2002) - 2000
- [j2]Bernardo M. Ábrego, Silvia Fernández-Merchant:
On the Maximum Number of Equilateral Triangles, I. Discret. Comput. Geom. 23(1): 129-135 (2000)
1990 – 1999
- 1999
- [j1]Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara:
Tightness problems in the plane. Discret. Math. 194(1-3): 1-11 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
