Bernardo M. Ábrego

Julia Kinzel

Evgeniya Lagoda

Yakov Sapozhnikov

SIAM J. Discret. Math., 2024

There is a unique crossing-minimal rectilinear drawing of K_18.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2024

2022

The Crossing Number of Twisted Graphs.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Ana Paulina Figueroa

Eduardo Rivera-Campo

Graphs Comb., 2022

The outerplanar crossing number of the complete bipartite graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

The crossing number of centrally symmetric complete geometric graphs.

[BibT_eX]

[DOI]

Julia Dandurand

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph.

[BibT_eX]

[DOI]

Athena Sparks

Graphs Comb., 2020

On the Crossing Number of 2-Page Book Drawings of Kn with Prescribed Number of Edges in Each Page.

[BibT_eX]

[DOI]

Evgeniya Lagoda

Graphs Comb., 2020

2019

K1,3-covering red and blue points in the plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

2018

Bishellable drawings of Kn.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

2017

On the Rectilinear Local Crossing Number of Km, n.

[BibT_eX]

[DOI]

Kory Dondzila

Evgeniya Lagoda

Seyed Sajjadi

Yakov Sapozhnikov

J. Inf. Process., 2017

The rectilinear local crossing number of Kn.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2016

On the Number of Similar Instances of a Pattern in a Finite Set.

[BibT_eX]

[DOI]

Daniel J. Katz

Levon Kolesnikov

Electron. J. Comb., 2016

2015

Computational Geometry Column 61.

[BibT_eX]

[DOI]

SIGACT News, 2015

Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections.

[BibT_eX]

[DOI]

Csaba D. Tóth

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Shellable Drawings and the Cylindrical Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Non-Shellable Drawings of Kn with Few Crossings.

[BibT_eX]

[DOI]

Birgit Vogtenhuber

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Proximity graphs inside large weighted graphs.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

David Flores-Peñaloza

Networks, 2013

More on the crossing number of Kn: Monotone drawings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

The 2-Page Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Shellable drawings and the cylindrical crossing number of $K_n$.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Visibility-preserving convexifications using single-vertex moves.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

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

[BibT_eX]

[DOI]

Mario Cetina

Discret. Comput. Geom., 2012

2011

There is a unique crossing-minimal rectilinear drawing of K18.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On $(\le k)$-edges, crossings, and halving lines of geometric drawings of Kn

[BibT_eX]

[DOI]

Mario Cetina

CoRR, 2011

On crossing numbers of geometric proximity graphs.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

David Flores-Peñaloza

Ferran Hurtado

Vera Sacristán

Maria Saumell

Comput. Geom., 2011

2010

On the Maximum Number of Translates in a Point Set.

[BibT_eX]

[DOI]

Bernardo Llano

Discret. Comput. Geom., 2010

3-symmetric and 3-decomposable geometric drawings of Kn.

[BibT_eX]

[DOI]

Mario Cetina

Discret. Appl. Math., 2010

2009

Matching Points with Squares.

[BibT_eX]

[DOI]

Esther M. Arkin

Ferran Hurtado

Mikio Kano

Joseph S. B. Mitchell

Jorge Urrutia

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 Kn.

[BibT_eX]

[DOI]

József Balogh

J. Comb. Theory A, 2008

A central approach to bound the number of crossings in a generalized configuration.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

The maximum number of halving lines and the rectilinear crossing number of Kn for n.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2007

Geometric drawings of Kn with few crossings.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

2005

An Application of Fermat's Little Theorem: 11054.

[BibT_eX]

[DOI]

Shahin Amrabov

Am. Math. Mon., 2005

A Lower Bound for the Rectilinear Crossing Number.

[BibT_eX]

[DOI]

Graphs Comb., 2005

2004

The Envelope, Please: 10990.

[BibT_eX]

[DOI]

Rick Mabry

Am. Math. Mon., 2004

Structural Results For Planar Sets With Many Similar Subsets.

[BibT_eX]

[DOI]

György Elekes

Comb., 2004

Matching Points with Circles and Squares.

[BibT_eX]

[DOI]

Esther M. Arkin

Ferran Hurtado

Mikio Kano

Joseph S. B. Mitchell

Jorge Urrutia

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

2002

Convex Polyhedra in R3 Spanning Omega (n4/3) Congruent Triangles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

The Unit Distance Problem for Centrally Symmetric Convex Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

2000

On the Maximum Number of Equilateral Triangles, I.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

1999

Tightness problems in the plane.

[BibT_eX]

[DOI]

Jorge L. Arocha