Gelasio Salazar

J. Comb. Theory, Ser. B, 2020

Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces.

[BibT_eX]

[DOI]

Éric Colin de Verdière

Edgardo Roldán-Pensado

Discret. Comput. Geom., 2020

2019

On the Number of Unknot Diagrams.

[BibT_eX]

[DOI]

Jorge L. Ramírez Alfonsín

SIAM J. Discret. Math., 2019

Closing in on Hill's Conjecture.

[BibT_eX]

[DOI]

Bernard Lidický

SIAM J. Discret. Math., 2019

2018

Levi's Lemma, pseudolinear drawings of Kn, and empty triangles.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

2017

On the Pseudolinear Crossing Number.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Arrangements of pseudocircles on surfaces.

[BibT_eX]

[DOI]

Edgardo Roldán-Pensado

CoRR, 2017

Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem).

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

Large Area Convex Holes in Random Point Sets.

[BibT_eX]

[DOI]

Octavio Arizmendi

SIAM J. Discret. Math., 2016

Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Characterizing 2-crossing-critical graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

Book Embeddings of Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Embedding a Graph-Like Continuum in Some Surface.

[BibT_eX]

[DOI]

Robin Christian

J. Graph Theory, 2015

On the Decay of Crossing Numbers of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

On Hardness of the Joint Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Shellable Drawings and the Cylindrical Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Book drawings of complete bipartite graphs.

[BibT_eX]

[DOI]

Etienne de Klerk

Dmitrii V. Pasechnik

Discret. Appl. Math., 2014

The Optimal Drawings of $K_{5, n}$.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Improved Lower Bounds on Book Crossing Numbers of Complete Graphs.

[BibT_eX]

[DOI]

Etienne de Klerk

Dmitrii V. Pasechnik

SIAM J. Discret. Math., 2013

Zarankiewicz's Conjecture is finite for each fixed m.

[BibT_eX]

[DOI]

Robin Christian

J. Comb. Theory, Ser. B, 2013

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

More on the crossing number of Kn: Monotone drawings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

The Erdős-Sós Conjecture for Geometric Graphs.

[BibT_eX]

[DOI]

Ruy Fabila Monroy

Luis Felipe Barba Flores

Dolores Lara

Cynthia A. Rodríguez Villalobos

Francisco Zaragoza

Discret. Math. Theor. Comput. Sci., 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

Large convex holes in random point sets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

Comput. Geom., 2013

Making a Graph Crossing-Critical by Multiplying its Edges.

[BibT_eX]

[DOI]

Laurent Beaudou

Electron. J. Comb., 2013

2012

Nested cycles in large triangulations and crossing-critical graphs.

[BibT_eX]

[DOI]

Robin Thomas

J. Comb. Theory, Ser. B, 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

Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m.

[BibT_eX]

[DOI]

Robin Christian

Electron. Notes Discret. Math., 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

Convexifying Monotone Polygons while Maintaining Internal Visibility.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

The Number of Generalized Balanced Lines.

[BibT_eX]

[DOI]

David Orden

Discret. Comput. Geom., 2010

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

[BibT_eX]

[DOI]

Mario Cetina

Discret. Appl. Math., 2010

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. Comb. Theory, Ser. A, 2008

A note on harmonic subgraphs in labelled geometric graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Stars and Bonds in Crossing-Critical Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 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

Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position.

[BibT_eX]

[DOI]

Boris G. Pittel

Random Struct. Algorithms, 2007

The crossing number of a projective graph is quadratic in the face-width.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Simple Euclidean Arrangements with No (>= 5)-Gons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

The convex hull of every optimal pseudolinear drawing of Kn is a triangle.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

Approximating the Crossing Number of Toroidal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Improved Bounds for the Crossing Numbers of Km, n and Kn.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Nearly light cycles in embedded graphs and crossing-critical graphs.

[BibT_eX]

[DOI]

Mario Lomelí-Haro

J. Graph Theory, 2006

On the length of longest alternating paths for multicoloured point sets in convex position.

[BibT_eX]

[DOI]

Criel Merino

Jorge Urrutia

Discret. Math., 2006

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

On the Crossing Number of Almost Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Two maps with large representativity on one surface.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.

[BibT_eX]

[DOI]

Criel Merino

Jorge Urrutia

Graphs Comb., 2005

On the crossing numbers of loop networks and generalized Petersen graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

The crossing number of Cm × Cn is as conjectured for n >= m(m + 1).

[BibT_eX]

[DOI]

Lev Yu. Glebsky

J. Graph Theory, 2004

An Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments.

[BibT_eX]

[DOI]

Edgardo Ugalde

Graphs Comb., 2004

Embedding grids in surfaces.

[BibT_eX]

[DOI]

James F. Geelen

Eur. J. Comb., 2004

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Optimal meshes of curves in the Klein bottle.

[BibT_eX]

[DOI]

Hector A. Juarez

J. Comb. Theory, Ser. B, 2003

Small meshes of curves and their role in the analysis of optimal meshes.

[BibT_eX]

[DOI]

Discret. Math., 2003

Infinite families of crossing-critical graphs with given average degree.

[BibT_eX]

[DOI]

Discret. Math., 2003

Spanning Trees of Multicoloured Point Sets with Few Intersections.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

The Crossing Number of P(N, 3).

[BibT_eX]

[DOI]

Graphs Comb., 2002

2001

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree.

[BibT_eX]

[DOI]

Enrique García-Moreno

J. Graph Theory, 2001

Drawings of Cm?Cn with One Disjoint Family II.

[BibT_eX]

[DOI]

Hector A. Juarez

J. Comb. Theory, Ser. B, 2001

The crossing number of C6 × Cn.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

2000

A lower bound for the crossing number of Cm × Cn.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

On a Crossing Number Result of Richter and Thomassen.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2000

1999

On the Intersections of Systems of Curves.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1999

Drawings of Cm×Cn with One Disjoint Family.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1999

1998

On the crossing number of cm × cn.

[BibT_eX]

[DOI]