\begin{thebibliography}{100}

\bibitem{AAFMRS13}
Bernardo~M. {\'A}brego, Oswin Aichholzer, Silvia Fern{\'a}ndez-Merchant, Pedro
  Ramos, and Gelasio Salazar.
\newblock The 2-{P}age {C}rossing {N}umber of {$K_n$}.
\newblock {\em Discrete Comput. Geom.}, 49(4):747--777, 2013.

\bibitem{AAFMRS13b}
Bernardo~M. {{\'A}brego}, Oswin {Aichholzer}, Silvia {Fern{\'a}ndez-Merchant},
  Pedro {Ramos}, and Gelasio {Salazar}.
\newblock More on the crossing number of ${K}_n$: Monotone drawings.
\newblock {\em Electronic Notes in Discrete Mathematics}, 44(0):411--414, 2013.

\bibitem{AAFMRS14}
Bernardo~M. {{\'A}brego}, Oswin {Aichholzer}, Silvia {Fern{\'a}ndez-Merchant},
  Pedro {Ramos}, and Gelasio {Salazar}.
\newblock Shellable drawings and the cylindrical crossing number of {$K_n$}.
\newblock {\em Discrete Comput. Geom.}, 52(4):743--753, 2014.

\bibitem{ACFMLS12}
Bernardo~M. \'Abrego, Mario Cetina, Silvia Fern\'{a}ndez-Merchant, Jes\'us
  Lea\~nos, and Gelasio Salazar.
\newblock On {$\leq k$}-edges, crossings, and halving lines of geometric
  drawings of {$K_n$}.
\newblock {\em Discrete Comput. Geom.}, 48(1):192--215, 2012.

\bibitem{ADFMLS16}
Bernardo~M. {{\'A}brego}, Julia {Dandurand}, Silvia {Fern{\'a}ndez-Merchant},
  Evgeniya {Lagoda}, and Yakov {Sapozhnikov}.
\newblock {Book crossing numbers of the complete graph and small local convex
  crossing numbers}.
\newblock {\em ArXiv e-prints}, July 2016.
\newblock \arxiv{1607.00131} (last accessed 9/21/2017).

\bibitem{ADFMLSS17}
Bernardo~M. {{\'A}brego}, Kory Dondzila, Silvia {Fern{\'a}ndez-Merchant},
  Evgeniya Lagoda, Seyed Sajjadi, and Yakov Sapozhnikov.
\newblock On the rectilinear local crossing number of {$K_{m,n}$}.
\newblock {\em Journal of Information Processing}, 25:542--550, August 2017.

\bibitem{AFM17}
Bernardo~M. \'{A}brego and Silvia Fern\'{a}ndez-Merchant.
\newblock The rectilinear local crossing number of {$K_n$}.
\newblock {\em J. Combin. Theory Ser. A}, 151:131--145, 2017.

\bibitem{AFMS12}
Bernardo~M. \'{A}brego, Silvia Fern\'{a}ndez-Merchant, and Gelasio Salazar.
\newblock The rectilinear crossing number of {$K_n$}: Closing in (or are we?).
\newblock In J\'{a}nos Pach, editor, {\em Thirty Essays on Geometric Graph
  Theory}, pages 563--567. Springer, 2012.

\bibitem{A19}
Eyal Ackerman.
\newblock On topological graphs with at most four crossings per edge.
\newblock {\em Comput. Geom.}, 85:101574, 31, 2019.

\bibitem{AP13}
Eyal Ackerman and Rom Pinchasi.
\newblock On the degenerate crossing number.
\newblock {\em Discrete Comput. Geom.}, 49(3):695--702, 2013.

\bibitem{AS14}
Eyal Ackerman and Marcus Schaefer.
\newblock A crossing lemma for the pair-crossing number.
\newblock In Christian Duncan and Antonios Symvonis, editors, {\em Proceedings
  of the 22nd {I}nternational {S}ymposium ({GD}'14) {S}eptember 24--26, 2014},
  volume 8871 of {\em Lecture Notes in Computer Science}, pages 222--233.
  Springer-Verlag, Berlin, 2014.

\bibitem{AR04}
Jay Adamsson and R.~Bruce Richter.
\newblock Arrangements, circular arrangements and the crossing number of {$C_7
  \times C_n$}.
\newblock {\em Journal of Combinatorial Theory, Series B}, 90(1):21---39, 2004.

\bibitem{AAPGCHLRNU16}
O.~{Aichholzer}, G.~{Araujo-Pardo}, N.~{Garc{\'{\i}}a-Col{\'{\i}}n},
  T.~{Hackl}, D.~{Lara}, C.~{Rubio-Montiel}, and J.~{Urrutia}.
\newblock Geometric achromatic and pseudoachromatic indices.
\newblock {\em Graphs Combin.}, 32(2):431--451, 2016.

\bibitem{A13}
Oswin Aichholzer.
\newblock On the rectilinear crossing number.
\newblock Summary of results at
  \url{http://www.ist.tugraz.at/staff/aichholzer/research/rp/triangulations/crossing/}
  (last accessed 9/21/2017).

\bibitem{AFMFHTPVZ19b}
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano,
  Irene Parada, Birgit Vogtenhuber, and Francisco Zaragoza.
\newblock On the 2-colored crossing number.
\newblock In Daniel Archambault and Csaba~D. T{\'o}th, editors, {\em Graph
  Drawing and Network Visualization}, pages 87--100, Cham, 2019. Springer
  International Publishing.

\bibitem{AOR06}
Oswin Aichholzer, David Orden, and Pedro~A Ramos.
\newblock On the structure of sets attaining the rectilinear crossing number.
\newblock In {\em Proc. 22nd European Workshop on Computational Geometry
  EuroCG}, volume~6, pages 43--46, 2006.

\bibitem{ACNS82}
M.~Ajtai, V.~Chv{\'a}tal, M.~M. Newborn, and E.~Szemer{\'e}di.
\newblock Crossing-free subgraphs.
\newblock In {\em Theory and practice of combinatorics}, volume~60 of {\em
  North-Holland Math. Stud.}, pages 9--12. North-Holland, Amsterdam, 1982.

\bibitem{AFP16}
Md.~Jawaherul Alam, Martin Fink, and Sergey Pupyrev.
\newblock The bundled crossing number.
\newblock In {\em Graph drawing and network visualization}, volume 9801 of {\em
  Lecture Notes in Comput. Sci.}, pages 399--412. Springer, Cham, 2016.

\bibitem{A08}
Michael~O. Albertson.
\newblock Chromatic number, independence ratio, and crossing number.
\newblock {\em Ars Math. Contemp.}, 1(1):1--6, 2008.

\bibitem{ACF09}
Michael~O. Albertson, Daniel~W. Cranston, and Jacob Fox.
\newblock Crossings, colorings, and cliques.
\newblock {\em Electron. J. Combin.}, 16(1):Research Paper 45, 2009.

\bibitem{AADM18}
Carlos~A. Alfaro, Alan Arroyo, Marek Der\v{n}\'{a}r, and Bojan Mohar.
\newblock The crossing number of the cone of a graph.
\newblock {\em SIAM J. Discrete Math.}, 32(3):2080--2093, 2018.

\bibitem{A00}
Noga Alon.
\newblock Algebraic and probabilistic methods in discrete mathematics.
\newblock {\em Geom. Funct. Anal.}, Special Volume, Part II:455--470, 2000.
\newblock GAFA 2000 (Tel Aviv, 1999).

\bibitem{ABFH12}
Matthew Alpert, Jens-P. Bode, Elie Feder, and Heiko Harborth.
\newblock The minimum of the maximum rectilinear crossing numbers of small
  cubic graphs.
\newblock In {\em Proceedings of the {F}orty-{T}hird {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and
  {C}omputing}, volume 214, pages 187--197, 2012.

\bibitem{AFH09}
Matthew Alpert, Elie Feder, and Heiko Harborth.
\newblock The maximum of the maximum rectilinear crossing numbers of
  {$d$}-regular graphs of order {$n$}.
\newblock {\em Electron. J. Combin.}, 16(1):Research Paper 54, 2009.

\bibitem{AFHK09}
Matthew Alpert, Elie Feder, Heiko Harborth, and Sheldon Klein.
\newblock The maximum rectilinear crossing number of the {$n$} dimensional cube
  graph.
\newblock In {\em Proceedings of the {F}ortieth {S}outheastern {I}nternational
  {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}, volume
  195, pages 147--158, 2009.

\bibitem{AFI11}
Matthew Alpert, Elie Feder, and Yehuda Isseroff.
\newblock The maximum rectilinear crossing number of generalized wheel graphs.
\newblock In {\em Proceedings of the {F}orty-{S}econd {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and
  {C}omputing}, volume 209, pages 33--46, 2011.

\bibitem{ADLDBFMR15}
Patrizio Angelini, Giordano Da~Lozzo, Giuseppe Di~Battista, Fabrizio Frati,
  Maurizio Patrignani, and Vincenzo Roselli.
\newblock Relaxing the constraints of clustered planarity.
\newblock {\em Comput. Geom.}, 48(2):42--75, 2015.

\bibitem{ABFJKPR10}
Patrizio Angelini, Giuseppe Di~Battista, Fabrizio Frati, V\'{\i}t Jel\'{\i}nek,
  Jan Kratochv\'{\i}l, Maurizio Patrignani, and Ignaz Rutter.
\newblock Testing planarity of partially embedded graphs.
\newblock In {\em Proceedings of the Twenty-First Annual ACM-SIAM Symposium on
  Discrete Algorithms}, SODA '10, pages 202--221, Philadelphia, PA, USA, 2010.
  Society for Industrial and Applied Mathematics.

\bibitem{AGKN12}
Patrizio Angelini, Markus Geyer, Michael Kaufmann, and Daniel Neuwirth.
\newblock On a tree and a path with no geometric simultaneous embedding.
\newblock {\em J. Graph Algorithms Appl.}, 16(1):37--83, 2012.

\bibitem{AGSV17}
Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, and Satyanarayana
  Vusirikala.
\newblock On the rectilinear crossing number of complete uniform hypergraphs.
\newblock {\em Comput. Geom.}, 61:38--47, 2017.

\bibitem{AS15}
Anurag Anshu and Saswata Shannigrahi.
\newblock A lower bound on the crossing number of uniform hypergraphs.
\newblock {\em Discrete Applied Mathematics}, pages~--, 2015.

\bibitem{A09}
Dan Archdeacon.
\newblock Open problems.
\newblock In {\em Topics in topological graph theory}, volume 128 of {\em
  Encyclopedia Math. Appl.}, pages 313--336. Cambridge Univ. Press, Cambridge,
  2009.

\bibitem{AB01}
Dan Archdeacon and C.~Paul Bonnington.
\newblock Two maps on one surface.
\newblock {\em J. Graph Theory}, 36(4):198--216, 2001.

\bibitem{ABS11}
Evmorfia Argyriou, Michael Bekos, and Antonios Symvonis.
\newblock The straight-line {RAC} drawing problem is {NP}-hard.
\newblock In {\em SOFSEM 2011: Theory and Practice of Computer Science}, volume
  6543 of {\em Lecture Notes in Computer Science}, pages 74--85. Springer
  Berlin / Heidelberg, 2011.

\bibitem{ABKS10}
Evmorfia Argyriou, Michael~A. Bekos, Michael Kaufmann, and Antonios Symvonis.
\newblock On metro-line crossing minimization.
\newblock {\em J. Graph Algorithms Appl.}, 14(1):75--96, 2010.

\bibitem{A96}
Englebert Arnold.
\newblock {\em Die Ankerwicklungen und Ankerkonstruktionen der
  Gleichstrom-Dynamomaschinen}.
\newblock Springer, Berlin, 2nd edition edition, 1896.

\bibitem{A86}
Kouhei Asano.
\newblock The crossing number of {$K_{1,3,n}$} and {$K_{2,3,n}$}.
\newblock {\em J. Graph Theory}, 10(1):1--8, 1986.

\bibitem{A06}
Daniel Ashlock.
\newblock {\em Evolutionary computation for modeling and optimization}.
\newblock Springer, New York, 2006.

\bibitem{ACCCHSSTW19}
John Asplund, Gregory Clark, Garner Cochran, \'{E}va Czabarka, Arran Hamm, Gwen
  Spencer, L\'{a}szl\'{o} Sz\'{e}kely, Libby Taylor, and Zhiyu Wang.
\newblock Using block designs in crossing number bounds.
\newblock {\em J. Combin. Des.}, 27(10):586--597, 2019.

\bibitem{ADHJ19}
John Asplund, Thao Do, Arran Hamm, and Vishesh Jain.
\newblock On the {$k$}-planar local crossing number.
\newblock {\em Discrete Math.}, 342(4):927--933, 2019.

\bibitem{ADHSTW18}
John Asplund, Thao Do, Arran Hamm, L\'{a}szl\'{o} Sz\'{e}kely, Libby Taylor,
  and Zhiyu Wang.
\newblock {$k$}-planar crossing number of random graphs and random regular
  graphs.
\newblock {\em Discrete Appl. Math.}, 247:419--422, 2018.

\bibitem{AB10}
Mikhail~J. Atallah and Marina Blanton, editors.
\newblock {\em Algorithms and theory of computation handbook}.
\newblock Chapman \& Hall/CRC Applied Algorithms and Data Structures Series.
  CRC Press, Boca Raton, FL, second edition, 2010.

\bibitem{A68}
Gail~Adele Atneosen.
\newblock {\em On the Embeddability of Compacta in {N}-Books: Intrinsic and
  Extrinsic Properties}.
\newblock ProQuest LLC, Ann Arbor, MI, 1968.
\newblock Thesis (Ph.D.)--Michigan State University.

\bibitem{ABBGHNR13}
Christopher Auer, Christian Bachmaier, Franz~J. Brandenburg, Andreas
  Glei{\ss}ner, Kathrin Hanauer, Daniel Neuwirth, and Josef Reislhuber.
\newblock Recognizing outer $1$-planar graphs in linear time.
\newblock In Wismath and Wolff \cite{WW13}, pages 108--119.

\bibitem{ABGR15}
Christopher Auer, Franz~J Brandenburg, Andreas Glei{\ss}ner, and Josef
  Reislhuber.
\newblock 1-planarity of graphs with a rotation system.
\newblock {\em Journal of Graph Algorithms and Applications}, 19(1):67--86,
  2015.

\bibitem{ACGKMP99}
G.~Ausiello, P.~Crescenzi, G.~Gambosi, V.~Kann, A.~Marchetti-Spaccamela, and
  M.~Protasi.
\newblock {\em Complexity and approximation}.
\newblock Springer-Verlag, Berlin, 1999.

\bibitem{B07}
Christian Bachmaier.
\newblock A radial adaptation of the sugiyama framework for visualizing
  hierarchical information.
\newblock {\em IEEE Trans. Vis. Comput. Graph}, 13(3):583--594, 2007.

\bibitem{BBBF09}
Christian Bachmaier, Franz~J. Brandenburg, Wolfgang Brunner, and Raymund
  F{\"u}l{\"o}p.
\newblock Coordinate assignment for cyclic level graphs.
\newblock In {\em Computing and combinatorics}, volume 5609 of {\em Lecture
  Notes in Comput. Sci.}, pages 66--75. Springer, Berlin, 2009.

\bibitem{BBBH11}
Christian Bachmaier, Franz~J. Brandenburg, Wolfgang Brunner, and Ferdinand
  H{\"u}bner.
\newblock Global {$k$}-level crossing reduction.
\newblock {\em J. Graph Algorithms Appl.}, 15(5):631--659, 2011.

\bibitem{BBF05}
Christian Bachmaier, Franz~J. Brandenburg, and Michael Forster.
\newblock Radial level planarity testing and embedding in linear time.
\newblock {\em J. Graph Algorithms Appl.}, 9(1):53--97, 2005.

\bibitem{BJL14}
Samuel Bald, Matthew~P. Johnson, and Ou~Liu.
\newblock Maximum rectilinear crossing number.
\newblock Talk at 2014 Fall Workshop on Computational Geometry, University of
  Connecticut, US, 2014.

\bibitem{BJL16}
Samuel Bald, Matthew~P. Johnson, and Ou~Liu.
\newblock Approximating the maximum rectilinear crossing number.
\newblock In Thang~N. Dinh and My~T. Thai, editors, {\em Computing and
  Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh
  City, Vietnam, August 2-4, 2016, Proceedings}, volume 9797 of {\em Lecture
  Notes in Computer Science}, pages 455--467. Springer, 2016.

\bibitem{BFK15}
Martin Balko, Radoslav Fulek, and Jan {Kyn{\v c}l}.
\newblock Crossing numbers and combinatorial characterization of monotone
  drawings of {$K_n$}.
\newblock {\em Discrete Comput. Geom.}, 53(1):107--143, 2015.

\bibitem{BK15}
Martin {Balko} and Jan {Kyn{\v c}l}.
\newblock Bounding the pseudolinear crossing number of {$K_n$} via simulated
  annealing.
\newblock In Pedro Ramos and Rodrigo~I. Silveira, editors, {\em Abstracts XVI
  Spanish Meeting on Computational Geometry}, pages 37--40, 2015.

\bibitem{BLPRS07}
J{\'o}zsef Balogh, Bernardo~M. Lea{\~n}os, Shengjun Pan, R.~Bruce Richter, and
  Gelasio Salazar.
\newblock The convex hull of every optimal pseudolinear drawing of {$K_n$} is a
  triangle.
\newblock {\em Australas. J. Combin.}, 38:155--162, 2007.

\bibitem{BLS19}
J{\'o}zsef {Balogh}, Bernard {Lidick{\'y}}, and Gelasio {Salazar}.
\newblock Closing in on {H}ill's conjecture.
\newblock {\em SIAM J. Discrete Math.}, 33(3):1261--1276, 2019.

\bibitem{B1885}
R~Baltzer.
\newblock Eine {E}rinnerung an {M\"{o}bius} und seinen {F}reund {W}eiske.
\newblock In {\em Berichte {\"{u}}ber die Verhandlungen der K{\"{o}}niglich
  S{\"{a}}chsischen Gesellschaft der Wissenschaften zu Leipzig.
  Mathematisch-Physische Classe.}, volume~37, pages 1--6, Leipzig, 1885. S.
  Hirzel.

\bibitem{BCE13b}
Michael~J. Bannister, Sergio Cabello, and David Eppstein.
\newblock Parameterized complexity of 1-planarity.
\newblock In {\em Algorithms and data structures}, volume 8037 of {\em Lecture
  Notes in Comput. Sci.}, pages 97--108. Springer, Heidelberg, 2013.

\bibitem{BE14b}
Michael~J. Bannister and David Eppstein.
\newblock Crossing minimization for 1-page and 2-page drawings of graphs with
  bounded treewidth.
\newblock In {\em Graph drawing}, volume 8871 of {\em Lecture Notes in Comput.
  Sci.}, pages 210--221. Springer, Heidelberg, 2014.

\bibitem{BES13b}
Michael~J. Bannister, David Eppstein, and Joseph~A. Simons.
\newblock Fixed parameter tractability of crossing minimization of
  almost-trees.
\newblock In {\em Graph drawing}, volume 8242 of {\em Lecture Notes in Comput.
  Sci.}, pages 340--351. Springer, Cham, 2013.

\bibitem{B70}
Calvin~Pascal Barton.
\newblock {\em The Rectilinear Crossing Number for Complete Simple Graphs in
  $E_2$}.
\newblock PhD thesis, The University of Texas at Austin, Austin, Texas, 1970.

\bibitem{BVRK12}
Andreas Bauer, Julian Vordermeier, Ignaz Rutter, and Michael Kaufmann.
\newblock Cycle{X}ings.
\newblock \url{http://i11www.iti.uni-karlsruhe.de/projects/cyclexings/index}
  (last accessed 1/9/2013), 2012.
\newblock Game presented at {\em Graph Drawing '12}.

\bibitem{BB05}
Michael Baur and Ulrik Brandes.
\newblock Crossing reduction in circular layouts.
\newblock In Juraj Hromkovic, Manfred Nagl, and Bernhard Westfechtel, editors,
  {\em Graph-Theoretic Concepts in Computer Science}, volume 3353 of {\em
  Lecture Notes in Computer Science}, pages 332--343. Springer Berlin
  Heidelberg, 2005.

\bibitem{BGGP10}
Laurent Beaudou, Antoine Gerbaud, Roland Grappe, and Fr{\'e}d{\'e}ric Palesi.
\newblock Drawing disconnected graphs on the {K}lein bottle.
\newblock {\em Graphs Combin.}, 26(4):471--481, 2010.

\bibitem{BEW95}
Richard~A. Becker, Stephen~G. Eick, and Allan~R. Wilks.
\newblock Visualizing network data.
\newblock {\em IEEE Transactions on Visualization and Computer Graphics},
  1(1):16--28, March 1995.

\bibitem{BW10}
Lowell Beineke and Robin Wilson.
\newblock The early history of the brick factory problem.
\newblock {\em Math. Intelligencer}, 32(2):41--48, 2010.

\bibitem{B97}
Lowell~W. Beineke.
\newblock Topology.
\newblock In {\em Graph connections}, volume~5 of {\em Oxford Lecture Ser.
  Math. Appl.}, pages 155--175. Oxford Univ. Press, New York, 1997.

\bibitem{BR80}
Lowell~W. Beineke and Richard~D. Ringeisen.
\newblock On the crossing numbers of products of cycles and graphs of order
  four.
\newblock {\em J. Graph Theory}, 4(2):145--155, 1980.

\bibitem{BBKR15a}
Michael~A. {Bekos}, Till {Bruckdorfer}, Michael {Kaufmann}, and Chrysanthi~N.
  {Raftopoulou}.
\newblock 1-planar graphs have constant book thickness.
\newblock In Nikhil Bansal and Irene Finocchi, editors, {\em Algorithms - {ESA}
  2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015,
  Proceedings}, volume 9294 of {\em Lecture Notes in Computer Science}, pages
  130--141. Springer, 2015.

\bibitem{BBKR17}
Michael~A. Bekos, Till Bruckdorfer, Michael Kaufmann, and Chrysanthi~N.
  Raftopoulou.
\newblock The book thickness of 1-planar graphs is constant.
\newblock {\em Algorithmica}, 79(2):444--465, 2017.

\bibitem{BNUW07}
Marc Benkert, Martin N{\"o}llenburg, Takeaki Uno, and Alexander Wolff.
\newblock Minimizing intra-edge crossings in wiring diagrams and public
  transportation maps.
\newblock In {\em Graph drawing}, volume 4372 of {\em Lecture Notes in Comput.
  Sci.}, pages 270--281. Springer, Berlin, 2007.

\bibitem{BETF19}
Patrick Bennett, Sean English, and Maria Talanda-Fisher.
\newblock Weighted {T}ur\'{a}n problems with applications.
\newblock {\em Discrete Math.}, 342(8):2165--2172, 2019.

\bibitem{BJYZ11}
Sergey Bereg, Minghui Jiang, Boting Yang, and Binhai Zhu.
\newblock On the red/blue spanning tree problem.
\newblock {\em Theor. Comput. Sci.}, 412:2459--2467, May 2011.

\bibitem{BK79}
Frank Bernhart and Paul~C. Kainen.
\newblock The book thickness of a graph.
\newblock {\em J. Combin. Theory Ser. B}, 27(3):320--331, 1979.

\bibitem{B10}
Jacques Bertin.
\newblock {\em Semiology of Graphics - Diagrams, Networks, Maps}.
\newblock ESRI, 2010.
\newblock This book was originally published in French in 1967; this
  translation is based on the second edition from 1974.

\bibitem{BBD09}
Therese Biedl, Franz~J. Brandenburg, and Xiaotie Deng.
\newblock On the complexity of crossings in permutations.
\newblock {\em Discrete Math.}, 309(7):1813--1823, 2009.

\bibitem{B91}
Daniel Bienstock.
\newblock Some provably hard crossing number problems.
\newblock {\em Discrete Comput. Geom.}, 6(5):443--459, 1991.

\bibitem{BD92}
Daniel Bienstock and Nathaniel Dean.
\newblock New results on rectilinear crossing numbers and plane embeddings.
\newblock {\em J. Graph Theory}, 16(5):389--398, 1992.

\bibitem{BD93}
Daniel Bienstock and Nathaniel Dean.
\newblock Bounds for rectilinear crossing numbers.
\newblock {\em J. Graph Theory}, 17(3):333--348, 1993.

\bibitem{BDGHL18}
Carla Binucci, Emilio Di~Giacomo, Md.~Iqbal Hossain, and Giuseppe Liotta.
\newblock 1-page and 2-page drawings with bounded number of crossings per edge.
\newblock {\em European J. Combin.}, 68:24--37, 2018.

\bibitem{BK64}
Jaroslav Bla{\v{z}}ek and Milan Koman.
\newblock A minimal problem concerning complete plane graphs.
\newblock In {\em Theory of {G}raphs and its {A}pplications ({P}roc. {S}ympos.
  {S}molenice, 1963)}, pages 113--117. Publ. House Czechoslovak Acad. Sci.,
  Prague, 1964.

\bibitem{BK67}
Jaroslav Bla{\v{z}}ek and Milan Koman.
\newblock On an extremal problem concerning graphs.
\newblock {\em Comment. Math. Univ. Carolinae}, 8:49--52, 1967.

\bibitem{BK70}
Jaroslav Bla{\v{z}}ek and Milan Koman.
\newblock Pr\r{u}se\v{c}\'{\i}kov\'{e} \v{c}\'{\i}slo \'{u}pln\'{y}ch
  $k$-chromatick\'{y}ch graf\r{u} ({T}he number of intersection points of
  complete {$k$}-chromatic graphs).
\newblock In {\em Mathematika (geometrie a teorie graf\r{u})}, pages 69--84.
  Univ. Karlova, Prague, 1970.

\bibitem{BFH13}
Jens-P. Bode, Elie Feder, and Heiko Harborth.
\newblock Extremal values of the maximum rectilinear crossing numbers of
  $2$-regular graphs.
\newblock {\em Bull. Inst. Combin. Appl.}, 69:95--100, 2013.

\bibitem{BFHHL14}
Jens-P. Bode, Elie Feder, Heiko Harborth, David Horowitz, and Tamar Lichter.
\newblock Extremal values of the maximum rectilinear crossing number of cycles
  with diagonals.
\newblock {\em Congr. Numer.}, 220:33--48, 2014.

\bibitem{BFHHL15}
Jens-P. Bode, Elie Feder, Heiko Harborth, David Horowitz, and Tamar Lichter.
\newblock Extremal values of the maximum rectilinear crossing number of
  {$(p,q)$}-graphs.
\newblock {\em Congr. Numer.}, 223:139--149, 2015.

\bibitem{BSW83}
R.~Bodendiek, H.~Schumacher, and K.~Wagner.
\newblock Bemerkungen zu einem {S}echsfarbenproblem von {G}. {R}ingel.
\newblock {\em Abh. Math. Sem. Univ. Hamburg}, 53:41--52, 1983.

\bibitem{BCSV10}
Drago Bokal, {\'E}va Czabarka, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock General lower bounds for the minor crossing number of graphs.
\newblock {\em Discrete Comput. Geom.}, 44(2):463--483, 2010.

\bibitem{BFM06}
Drago Bokal, Ga{\v{s}}per Fijav{\v{z}}, and Bojan Mohar.
\newblock The minor crossing number.
\newblock {\em SIAM J. Discrete Math.}, 20(2):344--356, 2006.

\bibitem{BFW08}
Drago Bokal, Ga{\v{s}}per Fijav{\v{z}}, and David~R. Wood.
\newblock The minor crossing number of graphs with an excluded minor.
\newblock {\em Electron. J. Combin.}, 15(1):Research Paper 4, 2008.

\bibitem{B51}
Edgar~F. Borgatta.
\newblock A diagnostic note on the construction of sociograms and action
  diagrams.
\newblock {\em Group Psychotherapy}, 3:300--308, 1951.

\bibitem{BPT06}
K{\'a}roly~J. B{\"o}r{\"o}czky, J{\'a}nos Pach, and G{\'e}za T{\'o}th.
\newblock Planar crossing numbers of graphs embeddable in another surface.
\newblock {\em Internat. J. Found. Comput. Sci.}, 17(5):1005--1015, 2006.

\bibitem{B95}
Oleg~V. Borodin.
\newblock A new proof of the {$6$} color theorem.
\newblock {\em J. Graph Theory}, 19(4):507--521, 1995.

\bibitem{B18}
Franz~J. Brandenburg.
\newblock Recognizing optimal 1-planar graphs in linear time.
\newblock {\em Algorithmica}, 80(1):1--28, 2018.

\bibitem{BMP05}
Peter Brass, William Moser, and J\'{a}nos Pach.
\newblock {\em Research Problems in Discrete Geometry}.
\newblock Springer, New York, 2005.

\bibitem{B45}
Urie Bronfenbrenner.
\newblock {\em The measurement of sociometric status, structure and
  development}.
\newblock Number~6 in Sociometry monographs. New York: Beacon House, 1945.

\bibitem{BK12}
Till Bruckdorfer and Michael Kaufmann.
\newblock Mad at edge crossings? {B}reak the edges!
\newblock In Evangelos Kranakis, Danny Krizanc, and Flaminia Luccio, editors,
  {\em Fun with Algorithms}, volume 7288 of {\em Lecture Notes in Computer
  Science}, pages 40--50. Springer Berlin / Heidelberg, 2012.

\bibitem{BCGJM?}
Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Juenger, and
  Petra Mutzel.
\newblock {\em Crossings and Planarization}, chapter~2, pages 43--86.
\newblock In Tamassia \cite{T13?}, 2013.

\bibitem{BEJKMW06}
Christoph Buchheim, Dietmar Ebner, Michael J{\"u}nger, Gunnar~W. Klau, Petra
  Mutzel, and Ren{\'e} Weiskircher.
\newblock Exact crossing minimization.
\newblock In {\em Graph drawing}, volume 3843 of {\em Lecture Notes in Comput.
  Sci.}, pages 37--48. Springer, Berlin, 2006.

\bibitem{BH05}
Christoph Buchheim and Seok-Hee Hong.
\newblock Crossing minimization for symmetries.
\newblock {\em Theory Comput. Syst.}, 38(3):293--311, 2005.

\bibitem{BJMP06}
Christoph Buchheim, Michael J{\"u}nger, Annette Menze, and Merijam Percan.
\newblock Bimodal crossing minimization.
\newblock In {\em Computing and combinatorics}, volume 4112 of {\em Lecture
  Notes in Comput. Sci.}, pages 497--506. Springer, Berlin, 2006.

\bibitem{BZ06}
Christoph Buchheim and Lanbo Zheng.
\newblock Fixed linear crossing minimization by reduction to the maximum cut
  problem.
\newblock In {\em Computing and combinatorics}, volume 4112 of {\em Lecture
  Notes in Comput. Sci.}, pages 507--516. Springer, Berlin, 2006.

\bibitem{BH11}
Boris Bukh and Alfredo Hubard.
\newblock Space crossing numbers.
\newblock In Ferran Hurtado and Marc~J. van Kreveld, editors, {\em Proceedings
  of the 27th {ACM} Symposium on Computational Geometry, Paris, France, June
  13-15, 2011}, pages 163--170. ACM, 2011.

\bibitem{B09}
B.S. Burdick.
\newblock {\em Mathematical works printed in the Americas, 1554-1700}.
\newblock John Hopkins University Press, 2009.

\bibitem{BFH19}
Alewyn~P. Burger, Elie Feder, and Heiko Harborth.
\newblock Numbers of crossings for the cycle graphs.
\newblock {\em Geombinatorics}, 28(3):158--169, 2019.

\bibitem{BH18}
Alewyn~P. Burger and Heiko Harborth.
\newblock Numbers of crossings in drawings of the {P}etersen graph.
\newblock {\em Geombinatorics}, 27(3):97--102, 2018.

\bibitem{BS84}
Jonathan~F. Buss and Peter~W. Shor.
\newblock On the pagenumber of planar graphs.
\newblock In {\em Proceedings of the sixteenth annual ACM symposium on Theory
  of computing}, STOC '84, pages 98--100, New York, NY, USA, 1984. ACM.

\bibitem{C13}
Sergio Cabello.
\newblock Hardness of {A}pproximation for {C}rossing {N}umber.
\newblock {\em Discrete Comput. Geom.}, 49(2):348--358, 2013.

\bibitem{CM10}
Sergio Cabello and Bojan Mohar.
\newblock Adding one edge to planar graphs makes crossing number hard.
\newblock In {\em Computational geometry ({SCG}'10)}, pages 68--76. ACM, New
  York, 2010.

\bibitem{CM13}
Sergio {Cabello} and Bojan {Mohar}.
\newblock Adding one edge to planar graphs makes crossing number and
  $1$-planarity hard.
\newblock {\em SIAM Journal on Computing}, 42(5):1803--1829, 2013.

\bibitem{CMS15}
Sergio Cabello, Bojan Mohar, and Robert {\v{S}}{\'a}mal.
\newblock Drawing a disconnected graph on the torus (extended abstract).
\newblock {\em Electronic Notes in Discrete Mathematics}, 49:779 -- 786, 2015.
\newblock The Eight European Conference on Combinatorics, Graph Theory and
  Applications, EuroComb 2015.

\bibitem{CGN19}
Grant Cairns, Emily Groves, and Yuri Nikolayevsky.
\newblock Bad drawings of small complete graphs.
\newblock {\em Australas. J. Combin.}, 75:322--342, 2019.

\bibitem{CdC16}
Sylvain {Carpentier} and Adan Medrano~Martin {del Campo}.
\newblock {Tropical Embeddings of Metric Graphs}.
\newblock {\em ArXiv e-prints}, April 2016.
\newblock \arxiv{1604.06176} (last accessed 9/21/2017).

\bibitem{CDMY16}
Dustin Cartwright, Andrew Dudzik, Madhusudan Manjunath, and Yuan Yao.
\newblock Embeddings and immersions of tropical curves.
\newblock {\em Collect. Math.}, 67(1):1--19, 2016.

\bibitem{CMG13}
Sangwon Chae, Aditi Majumder, and M.~Gopi.
\newblock {HD-GraphViz}: highly distributed graph visualization on tiled
  displays.
\newblock In {\em Proceedings of the Eighth Indian Conference on Computer
  Vision, Graphics and Image Processing}, ICVGIP '12, pages 43:1--43:8, New
  York, NY, USA, 2012. ACM.

\bibitem{CG09}
J{\'e}r{\'e}mie Chalopin and Daniel Gon{\c c}alves.
\newblock Every planar graph is the intersection graph of segments in the
  plane: extended abstract.
\newblock In Michael Mitzenmacher, editor, {\em {STOC}}, pages 631--638. ACM,
  2009.

\bibitem{CGO11}
J{\'e}r{\'e}mie Chalopin, Daniel Gon{\c{c}}alves, and Pascal Ochem.
\newblock Planar graphs have 1-string representations.
\newblock {\em Discrete Comput. Geom.}, 43(3):626--647, 2010.

\bibitem{CFGLMS15}
{Timothy}~{M}. Chan, {Fabrizio} Frati, Carsten Gutwenger, Anna Lubiw, Petra
  Mutzel, and Marcus Schaefer.
\newblock Drawing partially embedded and simultaneously planar graphs.
\newblock {\em Journal of Graph Algorithms and Applications}, 19(2):681--706,
  2015.

\bibitem{CDKPRW19}
Steven Chaplick, Thomas~C. van Dijk, Myroslav Kryven, Ji{-}won Park, Alexander
  Ravsky, and Alexander Wolff.
\newblock Bundled crossings revisited.
\newblock In Daniel Archambault and Csaba~D. T{\'o}th, editors, {\em Graph
  Drawing and Network Visualization}, pages 63--77, Cham, 2019. Springer
  International Publishing.

\bibitem{CS18}
Chandra Chekuri and Anastasios Sidiropoulos.
\newblock Approximation algorithms for {E}uler genus and related problems.
\newblock {\em SIAM J. Comput.}, 47(4):1610--1643, 2018.

\bibitem{CL98}
Hsiao-Feng~Steven Chen and D.~T. Lee.
\newblock On crossing minimization problem.
\newblock {\em IEEE Trans. on CAD of Integrated Circuits and Systems},
  17(5):406--418, 1998.

\bibitem{CK03}
Zhi-Zhong Chen and Mitsuharu Kouno.
\newblock A linear-time algorithm for $7$-coloring $1$-planar graphs (extended
  abstract).
\newblock In {\em Mathematical foundations of computer science 2003}, volume
  2747 of {\em Lecture Notes in Comput. Sci.}, pages 348--357. Springer,
  Berlin, 2003.

\bibitem{C08b}
Markus Chimani.
\newblock {\em Computing crossing numbers}.
\newblock PhD thesis, Technische Universit{\"{a}}t Dortmund, Dortmund, 2008.

\bibitem{CDHK11}
Markus Chimani, Martin Derka, Petr Hlin{\v{e}}ny, and Mat\v{e}j
  Klus\'{a}\v{c}ek.
\newblock How not to characterize planar-emulable graphs.
\newblock In Costas~S. Iliopoulos and William~F. Smyth, editors, {\em
  Combinatorial Algorithms}, volume 7056 of {\em Lecture Notes in Computer
  Science}, pages 106--120, Berlin, 2011. Springer.

\bibitem{CFKUVW18}
Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel
  Valtr, and Alexander Wolff.
\newblock On the maximum crossing number.
\newblock {\em J. Graph Algorithms Appl.}, 22(1):67--87, 2018.

\bibitem{CG15}
{Markus} {Chimani} and {Carsten} {Gutwenger}.
\newblock Hypergraph and minor crossing number problems.
\newblock {\em Journal of Graph Algorithms and Applications}, 19(1):191--222,
  2015.

\bibitem{CGMW10}
Markus Chimani, Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong.
\newblock Layer-free upward crossing minimization.
\newblock {\em ACM J. Exp. Algorithmics}, 15:Paper 2.2, 27, 2010.

\bibitem{CHS20}
Markus Chimani, Petr Hlin\v{e}n\'{y}, and Gelasio Salazar.
\newblock Toroidal grid minors and stretch in embedded graphs.
\newblock {\em J. Combin. Theory Ser. B}, 140:323--371, 2020.

\bibitem{CJS08}
Markus Chimani, Michael J{\"u}nger, and Michael Schulz.
\newblock Crossing minimization meets simultaneous drawing.
\newblock In {\em Visualization Symposium, 2008. PacificVIS '08.}, pages
  33--40. IEEE, 2008.

\bibitem{CKMV19}
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, and Pavel Valtr.
\newblock Crossing numbers of beyond-planar graphs.
\newblock In Daniel Archambault and Csaba~D. T{\'o}th, editors, {\em Graph
  Drawing and Network Visualization}, pages 78--86, Cham, 2019. Springer
  International Publishing.

\bibitem{CZ13}
Markus Chimani and Robert Zeranski.
\newblock Upward planarity testing via {SAT}.
\newblock In Walter Didimo and Maurizio Patrignani, editors, {\em Graph
  Drawing}, volume 7704 of {\em Lecture Notes in Computer Science}, pages
  248--259. Springer Berlin Heidelberg, 2013.

\bibitem{CZ14}
Markus Chimani and Robert Zeranski.
\newblock An exact approach to upward crossing minimization.
\newblock In {\em SIAM Meeting on Algorithm Engineering \& Experiments
  (ALENEX'14)}, 2014.

\bibitem{C34}
Chaim Chojnacki (Haim~Hanani).
\newblock {\"{U}}ber wesentlich unpl{\"{a}}ttbare {K}urven im
  drei-dimensionalen {R}aume.
\newblock {\em Fundamenta Mathematicae}, 23:135--142, 1934.

\bibitem{CRS13}
Robin Christian, R.~Bruce Richter, and Gelasio Salazar.
\newblock Zarankiewicz's conjecture is finite for each fixed {$m$}.
\newblock {\em J. Combin. Theory Ser. B}, 103(2):237--247, 2013.

\bibitem{CK97}
Marek Chrobak and Goos Kant.
\newblock Convex grid drawings of {$3$}-connected planar graphs.
\newblock {\em Internat. J. Comput. Geom. Appl.}, 7(3):211--223, 1997.

\bibitem{C1889}
G.~Chrystal.
\newblock {\em Algebra: {A}n elementary text-book for the higher classes of
  secondary schools and for colleges}.
\newblock Adam and Charles Black, Edinburgh, 1889.

\bibitem{CLTR85}
Fan R.~K. Chung, Frank~Thomson Leighton, and Arnold~L. Rosenberg.
\newblock Embedding graphs in books: a layout problem with applications to
  {VLSI} design.
\newblock In {\em Graph theory with applications to algorithms and computer
  science ({K}alamazoo, {M}ich., 1984)}, Wiley-Intersci. Publ., pages 175--188.
  Wiley, New York, 1985.

\bibitem{C11}
Julia Chuzhoy.
\newblock An algorithm for the graph crossing number problem [extended
  abstract].
\newblock In {\em S{TOC}'11---{P}roceedings of the 43rd {ACM} {S}ymposium on
  {T}heory of {C}omputing}, pages 303--312. ACM, New York, 2011.

\bibitem{C92}
Robert~J. Cimikowski.
\newblock Graph planarization and skewness.
\newblock In {\em Proceedings of the {T}wenty-third {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory, and
  {C}omputing ({B}oca {R}aton, {FL}, 1992)}, volume~88, pages 21--32, 1992.

\bibitem{C06}
Robert~J. Cimikowski.
\newblock An analysis of some linear graph layout heuristics.
\newblock {\em Journal of Heuristics}, 12:143--153, 2006.

\bibitem{CM07}
Robert~J. Cimikowski and Brendan Mumey.
\newblock Approximating the fixed linear crossing number.
\newblock {\em Discrete Appl. Math.}, 155(17):2202--2210, 2007.

\bibitem{CHN19}
Kieran Clancy, Michael Haythorpe, and Alex Newcombe.
\newblock A survey of graphs with known or bounded crossing numbers.
\newblock {\em ArXiv e-prints}, 2019.
\newblock \arxiv{1901.05155} (last accessed 2/3/2020).

\bibitem{CG18}
Gregory~J. Clark and Gwen Spencer.
\newblock New bounds on the biplanar crossing number of low-dimensional
  hypercubes: how low can you go?
\newblock {\em Bull. Inst. Combin. Appl.}, 83:52--60, 2018.

\bibitem{C85}
William~Kingdon Clifford.
\newblock {\em The common sense of the exact sciences}.
\newblock Appleton, New York, 1885.

\bibitem{CELR97}
R.~F. Cohen, P.~Eades, Tao Lin, and F.~Ruskey.
\newblock Three-dimensional graph drawing.
\newblock {\em Algorithmica}, 17(2):199--208, 1997.

\bibitem{CSSV06}
{\'E}va Czabarka, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock Biplanar crossing numbers. {I}. {A} survey of results and problems.
\newblock In {\em More sets, graphs and numbers}, volume~15 of {\em Bolyai Soc.
  Math. Stud.}, pages 57--77. Springer, Berlin, 2006.

\bibitem{CSSV08}
{\'E}va Czabarka, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock Biplanar crossing numbers. {II}. {C}omparing crossing numbers and
  biplanar crossing numbers using the probabilistic method.
\newblock {\em Random Structures Algorithms}, 33(4):480--496, 2008.

\bibitem{CSW17}
\'{E}va Czabarka, L\'{a}szl\'{o}~A. Sz\'{e}kely, and Stephan Wagner.
\newblock Inducibility in binary trees and crossings in random tanglegrams.
\newblock {\em SIAM J. Discrete Math.}, 31(3):1732--1750, 2017.

\bibitem{CH13}
J{\'u}lius Czap and D{\'a}vid Hud{\'a}k.
\newblock On drawings and decompositions of 1-planar graphs.
\newblock {\em The Electronic Journal of Combinatorics}, 20(2):P54, 2013.

\bibitem{dKPS13}
E.~de~Klerk, D.~V. Pasechnik, and G.~Salazar.
\newblock Improved lower bounds on book crossing numbers of complete graphs.
\newblock {\em SIAM J. Discrete Math.}, 27(2):619--633, 2013.

\bibitem{dKMPRS06}
Etienne {de Klerk}, John Maharry, Dmitrii~V. Pasechnik, R.~Bruce Richter, and
  Gelasio Salazar.
\newblock Improved bounds for the crossing numbers of {$K_{m,n}$} and {$K_n$}.
\newblock {\em SIAM J. Discrete Math.}, 20(1):189--202, 2006.

\bibitem{dKP12}
Etienne {de Klerk} and Dmitrii~V. Pasechnik.
\newblock Improved lower bounds for the $2$-page crossing numbers of
  {$K_{m,n}$} and {$K_n$} via semidefinite programming.
\newblock {\em SIAM Journal on Optimization}, 22(2):581--595, 2012.

\bibitem{dKPS14}
Etienne de~Klerk, Dmitrii~V. Pasechnik, and Gelasio Salazar.
\newblock Book drawings of complete bipartite graphs.
\newblock {\em Discrete Appl. Math.}, 167:80--93, 2014.

\bibitem{dKPS07}
Etienne de~Klerk, Dmitrii~V. Pasechnik, and Alexander Schrijver.
\newblock Reduction of symmetric semidefinite programs using the regular
  *-representation.
\newblock {\em Math. Program}, 109(2-3), 2007.

\bibitem{D36}
M.~Dehn.
\newblock \"{U}ber kombinatorische {T}opologie.
\newblock {\em Acta Math.}, 67(1):123--168, 1936.

\bibitem{DDR08}
Erik~D. Demaine, Martin~L. Demaine, and Tom Rodgers, editors.
\newblock {\em A lifetime of puzzles}.
\newblock A K Peters Ltd., Wellesley, MA, 2008.

\bibitem{DMS08}
Matt DeVos, Bojan Mohar, and Robert {\v{S}}{\'a}mal.
\newblock Unexpected behaviour of crossing sequences.
\newblock In {\em The {I}nternational {C}onference on {T}opological and
  {G}eometric {G}raph {T}heory}, volume~31 of {\em Electron. Notes Discrete
  Math.}, pages 259--264. Elsevier Sci. B. V., Amsterdam, 2008.

\bibitem{DP98}
T.~K. Dey and J.~Pach.
\newblock Extremal problems for geometric hypergraphs.
\newblock {\em Discrete Comput. Geom.}, 19(4):473--484, 1998.

\bibitem{DGDLM11}
Emilio Di~Giacomo, Walter Didimo, Giuseppe Liotta, and Henk Meijer.
\newblock Area, curve complexity, and crossing resolution of non-planar graph
  drawings.
\newblock {\em Theory Comput. Syst.}, 49(3):565--575, 2011.

\bibitem{DEGM05}
Matthew Dickerson, David Eppstein, Michael~T. Goodrich, and Jeremy~Y. Meng.
\newblock Confluent drawings: visualizing non-planar diagrams in a planar way.
\newblock {\em J. Graph Algorithms Appl.}, 9(1):31--52, 2005.

\bibitem{D13}
Walter Didimo.
\newblock Density of straight-line 1-planar graph drawings.
\newblock {\em Inf. Process. Lett.}, 113(7):236--240, April 2013.

\bibitem{DEL11}
Walter Didimo, Peter Eades, and Giuseppe Liotta.
\newblock Drawing graphs with right angle crossings.
\newblock {\em Theor. Comput. Sci}, 412(39):5156--5166, 2011.

\bibitem{DV12}
Hristo Djidjev and Imrich V{\v{r}}{\v{t}}o.
\newblock Planar crossing numbers of graphs of bounded genus.
\newblock {\em Discrete \& Computational Geometry}, pages 1--23, 2012.

\bibitem{DV13}
Cristian Dobre and Juan Vera.
\newblock Exploiting symmetry in copositive programs via semidefinite
  hierarchies.
\newblock {\em Optimization Online}, 2013.

\bibitem{D59}
Henry~Ernest Dudeney.
\newblock {\em Amusements in mathematics}.
\newblock Dover Publications Inc., New York, 1959.

\bibitem{DEW17}
Vida Dujmovi\'{c}, David Eppstein, and David~R. Wood.
\newblock Structure of graphs with locally restricted crossings.
\newblock {\em SIAM J. Discrete Math.}, 31(2):805--824, 2017.

\bibitem{DGMW11}
Vida Dujmovi{\'c}, Joachim Gudmundsson, Pat Morin, and Thomas Wolle.
\newblock Notes on large angle crossing graphs.
\newblock {\em Chicago Journal of Theoretical Computer Science}, 2011(4), June
  2011.

\bibitem{DMS14}
Vida {Dujmovi\,{c}}, Pat {Morin}, and Adam {Sheffer}.
\newblock Crossings in grid drawings.
\newblock {\em Electron. J. Combin.}, 21(1):P1.41, 2014.

\bibitem{DW04}
Vida Dujmovi{\'c} and Sue Whitesides.
\newblock An efficient fixed parameter tractable algorithm for 1-sided crossing
  minimization.
\newblock {\em Algorithmica}, 40(1):15--31, 2004.

\bibitem{DEGKN11}
Christian Duncan, David Eppstein, Michael Goodrich, Stephen Kobourov, and
  Martin N\"{o}llenburg.
\newblock Lombardi drawings of graphs.
\newblock In Ulrik Brandes and Sabine Cornelsen, editors, {\em Graph Drawing},
  volume 6502 of {\em Lecture Notes in Computer Science}, pages 195--207.
  Springer Berlin / Heidelberg, 2011.

\bibitem{DEKW06}
Christian~A. Duncan, Alon Efrat, Stephen Kobourov, and Carola Wenk.
\newblock Drawing with fat edges.
\newblock {\em Internat. J. Found. Comput. Sci.}, 17(5):1143--1163, 2006.

\bibitem{DFMHVHT19}
Frank Duque, Ruy Fabila-Monroy, C{\'e}sar Hern{\'a}ndez-V{\'e}lez, and Carlos
  Hidalgo-Toscano.
\newblock Counting the number of crossings in geometric graphs.
\newblock {\em ArXiv e-prints}, 2019.
\newblock \arxiv{1904.11037} (last accessed 4/30/2019).

\bibitem{DGAHVLM18}
Frank {Duque}, Hern\'{a}n {Gonz{\'a}lez-Aguilar}, C\'{e}sar
  {Hern{\'a}ndez-V{\'e}lez}, Jes\'{u}s {Lea{\~n}os}, and Carolina {Medina}.
\newblock The complexity of computing the cylindrical and the {$t$}-circle
  crossing number of a graph.
\newblock {\em Electron. J. Combin.}, 25(2):Paper 2.43, 11, 2018.

\bibitem{DGM16}
Stephane Durocher, Ellen Gethnery, and Debajyoti Mondalz.
\newblock On the biplanar crossing number of {$K_n$}.
\newblock Accepted to CCCG 2016, Vancouver, British Columbia. Available at
  \url{http://www.cs.umanitoba.ca/~durocher/research/pubs/durocherCCCG2016.pdf}
  (last accessed 7/19/2016), 2016.

\bibitem{DM16}
Zden\v{e}k Dvo\v{r}\'{a}k and Bojan Mohar.
\newblock Crossing numbers of periodic graphs.
\newblock {\em J. Graph Theory}, 83(1):34--43, 2016.

\bibitem{EdM96}
P.~Eades and C.~F.~X. de~Mendon\c{c}a~N.
\newblock Vertex splitting and tension-free layout.
\newblock In {\em Graph drawing ({P}assau, 1995)}, volume 1027 of {\em Lecture
  Notes in Comput. Sci.}, pages 202--211. Springer, Berlin, 1996.

\bibitem{EFL96}
Peter Eades, Qing-Wen Feng, and Xuemin Lin.
\newblock Straight-line drawing algorithms for hierarchical graphs and
  clustered graphs.
\newblock In {\em Graph drawing}, volume 1190 of {\em Lecture Notes in Comput.
  Sci.}, pages 113--128, London, UK, 1997. Springer.

\bibitem{EL92}
Peter Eades and Wei Lai.
\newblock {\em Algorithms for Disjoint Node Images}, volume~14.
\newblock Key Centre for Software Technology, Department of Computer Science,
  University of Queensland, January 1992.

\bibitem{ELMS91}
Peter Eades, Wei Lai, Kazuo Misue, and Kozo Sugiyama.
\newblock Preserving the mental map of a diagram.
\newblock Technical Report IIAS-RR-91-16E, Fujitsu Limited, Japan, August 1991.

\bibitem{EMKW86}
Peter Eades, Brendan~D. McKay, and Nicholas~C. Wormald.
\newblock On an edge crossing problem.
\newblock In {\em Proc. 9th Australian Computer Science Conference}, volume
  327, page 334, 1986.

\bibitem{EW94}
Peter Eades and Nicholas~C. Wormald.
\newblock Edge crossings in drawings of bipartite graphs.
\newblock {\em Algorithmica}, 11(4):379--403, 1994.

\bibitem{E73}
Roger~B. Eggleton.
\newblock {\em Crossing Numbers of graphs}.
\newblock PhD thesis, University of Calgary, Calgary, 1973.

\bibitem{E86}
Roger~B. Eggleton.
\newblock Rectilinear drawings of graphs.
\newblock {\em Utilitas Math.}, 29:149--172, 1986.

\bibitem{EK01}
Markus Eiglsperger and Michael Kaufmann.
\newblock An approach for mixed upward planarization.
\newblock In Frank Dehne, J\"{o}rg-R\"{u}diger Sack, and Roberto Tamassia,
  editors, {\em Algorithms and Data Structures}, volume 2125 of {\em Lecture
  Notes in Computer Science}, pages 352--364. Springer Berlin / Heidelberg,
  2001.

\bibitem{E17}
Noam~D. Elkies.
\newblock Crossing numbers of complete graphs.
\newblock In {\em The mathematics of various entertaining subjects. {V}ol. 2},
  pages 218--249. Princeton Univ. Press, Princeton, NJ, 2017.

\bibitem{ESZ06}
M.~N. Ellingham, Chris Stephens, and Xiaoya Zha.
\newblock The nonorientable genus of complete tripartite graphs.
\newblock {\em J. Combin. Theory Ser. B}, 96(4):529--559, 2006.

\bibitem{EM99}
Hikoe Enomoto and Miki~Shimabara Miyauchi.
\newblock Embedding graphs into a three page book with ${O}(m \log n)$
  crossings of edges over the spine.
\newblock {\em SIAM J. Disc.~Math.}, 12(3):337--341, 1999.

\bibitem{EMK99}
Hikoe Enomoto, Miki~Shimabara Miyauchi, and Katsuhiro Ota.
\newblock Lower bounds for the number of edge-crossings over the spine in a
  topological book embedding of a graph.
\newblock {\em Discrete Appl. Math.}, 92(2-3):149--155, 1999.

\bibitem{E13a}
David Eppstein.
\newblock A brief history of curves in graph drawing.
\newblock
  \url{https://11011110.github.io/blog/2013/04/08/brief-history-of.html} (last
  accessed 9/21/2017).

\bibitem{E13}
David Eppstein.
\newblock An early reference on crossing minimization.
\newblock
  \url{https://11011110.github.io/blog/2013/03/27/early-reference-on.html}
  (last accessed 9/21/2017).

\bibitem{EGM07}
David Eppstein, Michael~T. Goodrich, and Jeremy~Yu Meng.
\newblock Confluent layered drawings.
\newblock {\em Algorithmica}, 47(4):439--452, 2007.

\bibitem{EH14}
David Eppstein and Tony Huynh.
\newblock Bounds on chromatic number of $k$-planar graphs, 2014.
\newblock
  \url{http://mathoverflow.net/questions/168440/bounds-on-chromatic-number-of-k-planar-graphs}
  (Online; accessed 28-May-2014).

\bibitem{EvKMS09}
David Eppstein, Marc van Kreveld, Elena Mumford, and Bettina Speckmann.
\newblock Edges and switches, tunnels and bridges.
\newblock {\em Comput. Geom.}, 42(8):790--802, 2009.

\bibitem{EK68}
Paul Erd\H{o}s and Gyula Katona, editors.
\newblock {\em Theory of graphs}, volume 1966 of {\em Proceedings of the
  Colloquium held at Tihany, Hungary, September}.
\newblock Academic Press, New York-London; Akad\'emiai Kiad\'o, Budapest, 1968.

\bibitem{EKMSTWYY12}
Lars Erickson, John Kim, Andrew McConvey, Nathaniel Shar, Charles Tomlinson,
  David Wang, Derrek Yager, and Elyse Yeage.
\newblock Linear crossing numbers of graphs, 2012.
\newblock Results of a Combinatorics REGS program
  (\url{http://www.math.uiuc.edu/~west/regs/crossnum.html}, last accessed
  9/21/2017)).

\bibitem{ES75}
S.~Even and Y.~Shiloah.
\newblock {NP}-completeness of several arrangement problems.
\newblock Technical Report~43, Technion, Israel Institute of Technology, Haifa,
  Israel, January 1975.

\bibitem{FM07}
Igor Fabrici and Tom{\'a}{\v{s}} Madaras.
\newblock The structure of 1-planar graphs.
\newblock {\em Discrete Math.}, 307(7-8):854--865, 2007.

\bibitem{FHKLSS18}
Joshua {Fallon}, Kirsten {Hogenson}, Lauren {Keough}, Mario {Lomel{\'{\i}}},
  Marcus {Schaefer}, and Pablo {Sober{\'o}n}.
\newblock {A Note on the Maximum Rectilinear Crossing Number of Spiders}.
\newblock {\em ArXiv e-prints}, abs/1808.00385, 2018.
\newblock \arxiv{1808.00385} (last accessed 10/15/2018).

\bibitem{FdFM01}
L.~Faria, C.~M.~H. de~Figueiredo, and C.~F.~X. Mendon\c{c}a.
\newblock S{PLITTING} {NUMBER} is {NP}-complete.
\newblock {\em Discrete Appl. Math.}, 108(1-2):65--83, 2001.
\newblock International Workshop on Graph-Theoretic Concepts in Computer
  Science (Smolenice Castle, 1998).

\bibitem{FdFRV13}
Luerbio Faria, Celina M.~H. Figueiredo, R.~Bruce Richter, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock The same upper bound for both: The 2-page and the rectilinear
  crossing numbers of the n-cube.
\newblock In Andreas Brandstädt, Klaus Jansen, and Rüdiger Reischuk, editors,
  {\em Graph-Theoretic Concepts in Computer Science}, volume 8165 of {\em
  Lecture Notes in Computer Science}, pages 249--260. Springer Berlin
  Heidelberg, 2013.

\bibitem{FSM16}
Zahra {Fatemi}, Mostafa {Salehi}, and Matteo {Magnani}.
\newblock {A simple multiforce layout for multiplex networks}.
\newblock {\em ArXiv e-prints}, July 2016.
\newblock \arxiv{1607.03914} (last accessed 9/21/2017).

\bibitem{F11}
Elie Feder.
\newblock The maximum rectilinear crossing number of the wheel graph.
\newblock In {\em Proceedings of the {F}orty-{S}econd {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and
  {C}omputing}, volume 210, pages 21--32, 2011.

\bibitem{FG09}
Elie Feder and David Garber.
\newblock The orchard crossing number of an abstract graph.
\newblock In {\em Proceedings of the {F}ortieth {S}outheastern {I}nternational
  {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}, volume
  197, pages 3--19, 2009.

\bibitem{FG11}
Elie Feder and David Garber.
\newblock On the orchard crossing number of the complete bipartite graphs
  {$K_{n,n}$}.
\newblock {\em The Electronic Journal of Combinatorics}, 18, October 2011.

\bibitem{FG14}
Elie Feder and David Garber.
\newblock On the orchard crossing number of prisms, ladders and other related
  graphs.
\newblock {\em J. Combin. Math. Combin. Comput.}, 91:215--232, 2014.

\bibitem{FHHK10}
Elie Feder, Heiko Harborth, Steven Herzberg, and Sheldon Klein.
\newblock The maximum rectilinear crossing number of the {P}etersen graph.
\newblock In {\em Proceedings of the {F}orty-{F}irst {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and
  {C}omputing}, volume 206, pages 31--40, 2010.

\bibitem{FHL16}
Elie Feder, Heiko Harborth, and Tamar Lichter.
\newblock Maximum rectilinear crossing numbers for game board graphs.
\newblock {\em Congr. Numer.}, 226:87--102, 2016.

\bibitem{FHL17}
Elie Feder, Heiko Harborth, and Tamar Lichter.
\newblock Maximum rectilinear crossing numbers of polyomino graphs.
\newblock {\em Congr. Numer.}, 229:29--53, 2017.

\bibitem{FYX12}
Kai Feng, Yaoyao Ye, and Jiang Xu.
\newblock A formal study on topology and floorplan characteristics of mesh and
  torus-based optical networks-on-chip.
\newblock {\em Microprocessors and Microsystems}, 2012.

\bibitem{FKP10}
Henning Fernau, Michael Kaufmann, and Mathias Poths.
\newblock Comparing trees via crossing minimization.
\newblock {\em J. Comput. System Sci.}, 76(7):593--608, 2010.

\bibitem{FDPK13?}
Darya Filippova, Geet Duggal, Rob Patro, and Carl Kingsford.
\newblock Chromovis: Feature-rich layouts of chromosome conformation graphs.
\newblock Unpublished manuscript at
  \url{http://www.cs.cmu.edu/~dfilippo/projects/chromovis/chromovisGD2013.pdf}
  (last accessed 9/21/2017), 2013.

\bibitem{F03}
Steven~R. Finch.
\newblock {\em Mathematical constants}, volume~94 of {\em Encyclopedia of
  Mathematics and its Applications}.
\newblock Cambridge University Press, Cambridge, 2003.

\bibitem{FHSV16}
Martin Fink, John Hershberger, Subhash Suri, and Kevin Verbeek.
\newblock Bundled crossings in embedded graphs.
\newblock In {\em L{ATIN} 2016: theoretical informatics}, volume 9644 of {\em
  Lecture Notes in Comput. Sci.}, pages 454--468. Springer, Berlin, 2016.

\bibitem{FP13b}
Martin Fink and Sergey Pupyrev.
\newblock Metro-line crossing minimization: hardness, approximations, and
  tractable cases.
\newblock In {\em Graph drawing}, volume 8242 of {\em Lecture Notes in Comput.
  Sci.}, pages 328--339. Springer, Cham, 2013.

\bibitem{FPW15}
Martin Fink, Sergey Pupyrev, and Alexander Wolff.
\newblock Ordering metro lines by block crossings.
\newblock {\em J. Graph Algorithms Appl.}, 19(1):111--153, 2015.

\bibitem{FPS13}
Jacob Fox, J{\'a}nos Pach, and Andrew Suk.
\newblock The number of edges in {$k$}-quasi-planar graphs.
\newblock {\em SIAM J. Discrete Math.}, 27(1):550--561, 2013.

\bibitem{FPS16b}
Jacob {Fox}, J\'{a}nos {Pach}, and Andrew {Suk}.
\newblock Approximating the rectilinear crossing number.
\newblock In {\em Graph drawing and network visualization}, volume 9801 of {\em
  Lecture Notes in Comput. Sci.}, pages 413--426. Springer, Cham, 2016.

\bibitem{FHSV05}
Radoslav Fulek, Hongmei He, Ondrej S{\'y}kora, and Imrich V{\v{r}}{\v{t}}o.
\newblock Outerplanar crossing numbers of 3-row meshes, {H}alin graphs and
  complete p-partite graphs.
\newblock In Peter Vojt{\'a}s, M{\'a}ria Bielikov{\'a}, Bernadette
  Charron-Bost, and Ondrej S{\'y}kora, editors, {\em {SOFSEM} 2005: Theory and
  Practice of Computer Science, 31st Conference on Current Trends in Theory and
  Practice of Computer Science, Liptovsk{\'y} {J}{\'a}n, Slovakia, January
  22-28, 2005, Proceedings}, volume 3381 of {\em Lecture Notes in Computer
  Science}, pages 376--379. Springer, 2005.

\bibitem{FK18}
Radoslav Fulek and Jan Kyn\v{c}l.
\newblock The {$\Bbb Z_2$}-genus of {K}uratowski minors.
\newblock In {\em 34th {I}nternational {S}ymposium on {C}omputational
  {G}eometry}, volume~99 of {\em LIPIcs. Leibniz Int. Proc. Inform.}, pages
  Art. No. 40, 14. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018.

\bibitem{FK19}
Radoslav Fulek and Jan Kyn\v{c}l.
\newblock Counterexample to an {E}xtension of the {H}anani-{T}utte {T}heorem on
  the {S}urface of {G}enus 4.
\newblock {\em Combinatorica}, 39(6):1267--1279, 2019.

\bibitem{FPSS12b}
Radoslav Fulek, Michael~J. Pelsmajer, Marcus Schaefer, and Daniel
  {\v{S}}tefankovi{\v{c}}.
\newblock Adjacent crossings do matter.
\newblock {\em J. Graph Algorithms Appl.}, 16(3):759--782, 2012.

\bibitem{FK76}
W.~H. Furry and D.~J. Kleitman.
\newblock Maximal rectilinear crossing of cycles.
\newblock {\em Studies in Appl. Math.}, 56(2):159--167, 1976/77.

\bibitem{GSM10}
Graeme Gange, Peter~J. Stuckey, and Kim Marriott.
\newblock Optimal $k$-level planarization and crossing minimization.
\newblock In Ulrik Brandes and Sabine Cornelsen, editors, {\em Graph Drawing},
  volume 6502 of {\em Lecture Notes in Computer Science}, pages 238--249.
  Springer, 2010.

\bibitem{GMS01}
Enrique Garcia-Moreno and Gelasio Salazar.
\newblock Bounding the crossing number of a graph in terms of the crossing
  number of a minor with small maximum degree.
\newblock {\em J. Graph Theory}, 36(3):168--173, 2001.

\bibitem{GJMP80}
M.~R. Garey, D.~S. Johnson, G.~L. Miller, and C.~H. Papadimitriou.
\newblock The complexity of coloring circular arcs and chords.
\newblock {\em SIAM J. Algebraic Discrete Methods}, 1(2):216--227, 1980.

\bibitem{GJ79}
Michael~R. Garey and David~S. Johnson.
\newblock {\em Computers and intractability}.
\newblock W. H. Freeman and Co., San Francisco, Calif., 1979.
\newblock A guide to the theory of NP-completeness, A Series of Books in the
  Mathematical Sciences.

\bibitem{GJ83}
Michael~R. Garey and David~S. Johnson.
\newblock Crossing number is {NP}-complete.
\newblock {\em SIAM Journal on Algebraic and Discrete Methods}, 4(3):312--316,
  1983.

\bibitem{GT01b}
Ashim Garg and Roberto Tamassia.
\newblock On the computational complexity of upward and rectilinear planarity
  testing.
\newblock {\em SIAM J. Comput.}, 31(2):601--625, 2001.

\bibitem{GJPSS06}
Elisabeth Gassner, Michael J{\"u}nger, Merijam Percan, Marcus Schaefer, and
  Michael Schulz.
\newblock Simultaneous graph embeddings with fixed edges.
\newblock In {\em Graph-theoretic concepts in computer science}, volume 4271 of
  {\em Lecture Notes in Comput. Sci.}, pages 325--335. Springer, Berlin, 2006.

\bibitem{G00}
Carl~Friedrich Gau{\ss}.
\newblock {\em Werke. {B}and {VIII}}.
\newblock B.G. Teubner, Leipzig, 1900.

\bibitem{GH99}
Cyril Gavoille and Nicolas Hanusse.
\newblock Compact routing tables for graphs of bounded genus (extended
  abstract).
\newblock In {\em Automata, languages and programming ({P}rague, 1999)}, volume
  1644 of {\em Lecture Notes in Comput. Sci.}, pages 351--360. Springer,
  Berlin, 1999.

\bibitem{G15}
Maximilian Gei{\ss}er.
\newblock Kreuzungsminimierung bei simulatner einbettung planarer graphen.
\newblock Bachelor thesis, Karlsruhe Institute of Technology, Karlsruhe,
  Germany, 2015.

\bibitem{GHLPRY17}
Ellen Gethner, Leslie Hogben, Bernard Lidick{\'y}, Florian Pfender, Amanda
  Ruiz, and Michael Young.
\newblock On crossing numbers of complete tripartite and balanced complete
  multipartite graphs.
\newblock {\em J. Graph Theory}, 84(4):552--565, 2017.

\bibitem{GM14}
Mark Ginn and Faith Miller.
\newblock The crossing number of {$K_{3,3,n}$}.
\newblock {\em Congr. Numer.}, 221:49--54, 2014.

\bibitem{GS04}
Lev~Yu. Glebsky and Gelasio Salazar.
\newblock The crossing number of {$C_m \times C_n$} is as conjectured for $n
  \geq m(m+1)$.
\newblock {\em Journal of Graph Theory}, 47(1):53--72, 2004.

\bibitem{BG07}
Alexander Grigoriev and Hans~L. Bodlaender.
\newblock Algorithms for graphs embeddable with few crossings per edge.
\newblock {\em Algorithmica}, 49(1):1--11, 2007.

\bibitem{GKT13}
Alexander {Grigoriev}, Athanassios {Koutsonas}, and Dimitrios~M. {Thilikos}.
\newblock {Nearly Planar Graphs and $\lambda$-flat Graphs}.
\newblock {\em ArXiv e-prints}, November 2013.
\newblock \arxiv{1311.0137} (last accessed 9/21/2017).

\bibitem{G89}
Patrick Groenveld.
\newblock On global wire ordering for macro-cell routing.
\newblock In {\em 26th Conference on Design Automation Conference}, pages
  155--160. IEEE, 1989.

\bibitem{G01}
Martin Grohe.
\newblock Computing crossing numbers in quadratic time.
\newblock In {\em Proceedings of the 32nd ACM Symposium on Theory of
  Computing}, pages 231--236, july~6--8 2001.

\bibitem{G78}
Jonathan~L. Gross.
\newblock An infinite family of octahedral crossing numbers.
\newblock {\em J. Graph Theory}, 2(2):171--178, 1978.

\bibitem{G72b}
Branko Gr{\"u}nbaum.
\newblock {\em Arrangements and spreads}.
\newblock Conference Board of the Mathematical Sciences Regional Conference
  Series in Mathematics, No. 10. American Mathematical Society Providence,
  R.I., 1972.

\bibitem{G60}
Richard~K. Guy.
\newblock A combinatorial problem.
\newblock {\em Nabla (Bull. Malayan Math. Soc)}, 7:68--72, 1960.

\bibitem{G68}
Richard~K. Guy.
\newblock The planar and toroidal crossing numbers of {$K_{n}$}.
\newblock In Hans Sachs, Heinz-J\"{u}rgen Vo\ss, and Hansjoachim Walther,
  editors, {\em Beitr\"{a}ge zur {G}raphentheorie}, pages 37--39, Leipzig,
  1968. B.G. Teubner.

\bibitem{G69}
Richard~K. Guy.
\newblock The decline and fall of {Z}arankiewicz's theorem.
\newblock In {\em Proof {T}echniques in {G}raph {T}heory ({P}roc. {S}econd
  {A}nn {A}rbor {G}raph {T}heory {C}onf., {A}nn {A}rbor, {M}ich., 1968)}, pages
  63--69. Academic Press, New York, 1969.

\bibitem{G71b}
Richard~K. Guy.
\newblock Latest results on crossing numbers.
\newblock In {\em Recent {T}rends in {G}raph {T}heory ({P}roc. {C}onf., {N}ew
  {Y}ork, 1970)}, pages 143--156. Lecture Notes in Mathematics, Vol. 186.
  Springer, Berlin, 1971.

\bibitem{G71}
Richard~K. Guy.
\newblock Unsolved combinatorial problems.
\newblock In {\em Combinatorial {M}athematics and its {A}pplications ({P}roc.
  {C}onf., {O}xford, 1969)}, pages 121--127. Academic Press, London, 1971.

\bibitem{G72}
Richard~K. Guy.
\newblock Crossing numbers of graphs.
\newblock In {\em Graph theory and applications ({P}roc. {C}onf., {W}estern
  {M}ichigan {U}niv., {K}alamazoo, {M}ich., 1972; dedicated to the memory of
  {J}. {W}. {T}. {Y}oungs)}, pages 111--124. Lecture Notes in Math., Vol. 303,
  Springer, Berlin, 1972.

\bibitem{GH73}
Richard~K. Guy and Anthony Hill.
\newblock The crossing number of the complement of a circuit.
\newblock {\em Discrete Math.}, 5:335--344, 1973.

\bibitem{GJ69}
Richard~K. Guy and T.~A. Jenkyns.
\newblock The toroidal crossing number of {$K_{m,n}$}.
\newblock {\em J. Combinatorial Theory}, 6:235--250, 1969.

\bibitem{GJS68}
Richard~K. Guy, Tom Jenkyns, and Jonathan Schaer.
\newblock The toroidal crossing number of the complete graph.
\newblock {\em J. Combinatorial Theory}, 4:376--390, 1968.

\bibitem{H64}
Frank Harary.
\newblock Recent results in topological graph theory.
\newblock {\em Acta Math. Acad. Sci. Hungar}, 15:405--411, 1964.

\bibitem{H65}
Frank Harary.
\newblock On minimally nonplanar graphs.
\newblock {\em Ann. Univ. Sci. Budapest. E\"otv\"os Sect. Math.}, 8:13--15,
  1965.

\bibitem{H69}
Frank Harary.
\newblock Determinants, permanents and bipartite graphs.
\newblock {\em Math. Mag.}, 42:146--148, 1969.

\bibitem{H83}
Frank Harary.
\newblock Maximum versus minimum invariants for graphs.
\newblock {\em J. Graph Theory}, 7(3):275--284, 1983.

\bibitem{HH63}
Frank Harary and Anthony Hill.
\newblock On the number of crossings in a complete graph.
\newblock {\em Proc. Edinburgh Math. Soc. (2)}, 13:333--338, 1962/1963.

\bibitem{HKR99}
Frank Harary, Paul~C. Kainen, and Adrian Riskin.
\newblock Every graph of cyclic bandwidth 3 is toroidal.
\newblock {\em Bull. Inst. Combin. Appl.}, 27:81--84, 1999.

\bibitem{HKS73}
Frank Harary, Paul~C. Kainen, and Allen~J. Schwenk.
\newblock Toroidal graphs with arbitrarily high crossing numbers.
\newblock {\em Nanta Math.}, 6(1):58--67, 1973.

\bibitem{HS71}
Frank Harary and Allen Schwenk.
\newblock Trees with {H}amiltonian square.
\newblock {\em Mathematika}, 18:138--140, 1971.

\bibitem{HS72}
Frank Harary and Allen Schwenk.
\newblock A new crossing number for bipartite graphs.
\newblock {\em Utilitas Math.}, 1:203--209, 1972.

\bibitem{H71}
Heiko Harborth.
\newblock {\"U}ber die {K}reuzungszahl vollst{\"a}ndiger, {$n$}-geteilter
  {G}raphen.
\newblock {\em Math. Nachr.}, 48:179--188, 1971.

\bibitem{H76a}
Heiko Harborth.
\newblock Aufgabe 750, 1976.

\bibitem{H76}
Heiko Harborth.
\newblock Parity of numbers of crossings for complete {$n$}-partite graphs.
\newblock {\em Math. Slovaca}, 26(2):77--95, 1976.

\bibitem{H78}
Heiko Harborth.
\newblock Crossings on edges in drawings of complete multipartite graphs.
\newblock In {\em Combinatorics ({P}roc. {F}ifth {H}ungarian {C}olloq.,
  {K}eszthely, 1976), {V}ol. {I}}, volume~18 of {\em Colloq. Math. Soc. J\'anos
  Bolyai}, pages 539--551. North-Holland, Amsterdam-New York, 1978.

\bibitem{H85}
Heiko Harborth.
\newblock Drawings of graphs and multiple crossings.
\newblock In {\em Graph theory with applications to algorithms and computer
  science ({K}alamazoo, {M}ich., 1984)}, Wiley-Intersci. Publ., pages 413--421.
  Wiley, New York, 1985.

\bibitem{H88b}
Heiko Harborth.
\newblock {D}arstellungen des vollst{\"a}ndigen {G}raphen ohne {K}anten mit
  wenigen {K}reuzungen.
\newblock In {\em Graphen und Netzwerke—Theorie und Anwendungen}, pages
  179--181. TH Ilmenau, 1988.

\bibitem{H88}
Heiko Harborth.
\newblock Drawings of the cycle graph.
\newblock In {\em Nineteenth Southeastern Conference on Combinatorics, Graph
  Theory, and Computing (Baton Rouge, LA, 1988)}, volume~66, pages 15--22,
  1988.

\bibitem{H91}
Heiko Harborth.
\newblock Maximum number of crossings for the cube graph.
\newblock In {\em Proceedings of the {T}wenty-second {S}outheastern
  {C}onference on {C}ombinatorics, {G}raph {T}heory, and {C}omputing ({B}aton
  {R}ouge, {LA}, 1991)}, volume~82, pages 117--122, 1991.

\bibitem{H02}
Heiko Harborth.
\newblock Special numbers of crossings for complete graphs.
\newblock {\em Discrete Math.}, 244(1-3):95--102, 2002.

\bibitem{H16b}
Heiko Harborth.
\newblock The maximum crossing number of the {P}etersen graph.
\newblock {\em Geombinatorics}, 26(1):16--22, 2016.

\bibitem{HM74}
Heiko Harborth and Ingrid Mengersen.
\newblock Edges without crossings in drawings of complete graphs.
\newblock {\em J. Combinatorial Theory Ser. B}, 17:299--311, 1974.

\bibitem{HM90}
Heiko Harborth and Ingrid Mengersen.
\newblock Edges with at most one crossing in drawings of the complete graph.
\newblock In {\em Topics in combinatorics and graph theory ({O}berwolfach,
  1990)}, pages 757--763. Physica, Heidelberg, 1990.

\bibitem{HM92}
Heiko Harborth and Ingrid Mengersen.
\newblock Drawings of the complete graph with maximum number of crossings.
\newblock In {\em Proceedings of the {T}wenty-third {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory, and
  {C}omputing ({B}oca {R}aton, {FL}, 1992)}, volume~88, pages 225--228, 1992.

\bibitem{HT96}
Heiko Harborth and Christian Th{\"u}rmann.
\newblock Numbers of edges without crossings in rectilinear drawings of the
  complete graph.
\newblock In {\em Proceedings of the {T}wenty-seventh {S}outheastern
  {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and
  {C}omputing ({B}aton {R}ouge, {LA}, 1996)}, volume 119, pages 79--83, 1996.

\bibitem{HT14}
Heiko Harborth and Christian Th{\"u}rmann.
\newblock Maximum rectilinear crossing number in drawings of the complete graph
  with a given convex hull.
\newblock {\em Congr. Numer.}, 221:121--127, 2014.

\bibitem{HZ95}
Heiko Harborth and Sophie Zahn.
\newblock Maximum number of crossings in drawings of small graphs.
\newblock In {\em Graph theory, combinatorics, and algorithms, {V}ol.\ 1, 2
  ({K}alamazoo, {MI}, 1992)}, Wiley-Intersci. Publ., pages 485--495. Wiley, New
  York, 1995.

\bibitem{HSM10}
Hongmei He, Ana S{\u{a}}l{\u{a}}gean, and Erkki M{\"a}kinen.
\newblock One- and two-page crossing numbers for some types of graphs.
\newblock {\em Int. J. Comput. Math.}, 87(8):1667--1679, 2010.

\bibitem{HSMV15}
Hongmei He, Ana S{\u{a}}l{\u{a}}gean, Erkki M{\"a}kinen, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock Various heuristic algorithms to minimise the two-page crossing
  numbers of graphs.
\newblock {\em Open Comput. Sci.}, 5(1):22--40, 2015.

\bibitem{H98w}
Steve Hedetniemi.
\newblock Open problems in combinatorial optimization.
\newblock \url{http://www.cs.clemson.edu/~hedet/algorithms.html} (last accessed
  1/9/2013).

\bibitem{HVLS17}
C\'{e}sar Hern\'{a}ndez-V\'{e}lez, Jes\'{u}s Lea\~{n}os, and Gelasio Salazar.
\newblock On the pseudolinear crossing number.
\newblock {\em J. Graph Theory}, 84(3):297--310, 2017.

\bibitem{H16}
J.~Hjelmslev.
\newblock Die {G}eometrie der {W}irklichkeit.
\newblock {\em Acta Math.}, 40(1):35--66, 1916.

\bibitem{H23}
J.~Hjelmslev.
\newblock Die nat\"{u}rliche {G}eometrie.
\newblock {\em Abhandlungen aus dem Mathematischen Seminar der Universit\"{a}t
  Hamburg}, 2:1--36, 1923.

\bibitem{H03}
Petr Hlin{\v{e}}ny.
\newblock Crossing-number critical graphs have bounded path-width.
\newblock {\em J. Combin. Theory Ser. B}, 88(2):347--367, 2003.

\bibitem{H06}
Petr Hlin{\v{e}}n{\'y}.
\newblock Crossing number is hard for cubic graphs.
\newblock {\em J. Combin. Theory Ser. B}, 96(4):455--471, 2006.

\bibitem{HD16}
Petr Hlinen{\'{y}} and Marek Dern{\'{a}}r.
\newblock Crossing number is hard for kernelization.
\newblock In S{\'{a}}ndor~P. Fekete and Anna Lubiw, editors, {\em 32nd
  International Symposium on Computational Geometry, SoCG 2016, June 14-18,
  2016, Boston, MA, {USA}}, volume~51 of {\em LIPIcs}, pages 42:1--42:10.
  Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.

\bibitem{HS15}
Petr Hlin{\v{e}}n{\'y} and Gelasio Salazar.
\newblock {\em Algorithms and Computation: 26th International Symposium, ISAAC
  2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, chapter On Hardness
  of the Joint Crossing Number, pages 603--613.
\newblock Springer Berlin Heidelberg, Berlin, Heidelberg, 2015.

\bibitem{HT18}
Petr Hlin\v{e}n\'{y} and Carsten Thomassen.
\newblock Deciding parity of graph crossing number.
\newblock {\em SIAM J. Discrete Math.}, 32(3):1962--1965, 2018.

\bibitem{H05}
Pak~Tung Ho.
\newblock The crossing number of {$K_{4,n}$} on the real projective plane.
\newblock {\em Discrete Math.}, 304(1-3):23--33, 2005.

\bibitem{H08}
Pak~Tung Ho.
\newblock The crossing number of {$K_{1,m,n}$}.
\newblock {\em Discrete Math.}, 308(24):5996--6002, 2008.

\bibitem{H09}
Pak~Tung Ho.
\newblock The toroidal crossing number of {$K_{4,n}$}.
\newblock {\em Discrete Math.}, 309(10):3238--3248, 2009.

\bibitem{H96}
Dorit~S. Hochbaum, editor.
\newblock {\em Approximation Algorithms for {NP}-Hard Problems}.
\newblock PWS Publishing Company, Boston, MA, 1996.

\bibitem{H06b}
Danny Holten.
\newblock Hierarchical edge bundles: Visualization of adjacency relations in
  hierarchical data.
\newblock {\em {IEEE} Trans. Vis. Comput. Graph.}, 12(5):741--748, 2006.

\bibitem{HELP12}
Seok-Hee Hong, Peter Eades, Giuseppe Liotta, and Sheung-Hung Poon.
\newblock {F}{\'a}ry's theorem for 1-planar graphs.
\newblock In Joachim Gudmundsson, Juli{\'a}n Mestre, and Taso Viglas, editors,
  {\em Computing and Combinatorics - 18th Annual International Conference,
  {COCOON} 2012}, volume 7434 of {\em Lecture Notes in Computer Science}, pages
  335--346. Springer, 2012.

\bibitem{H12}
Daniel Hoske.
\newblock Book embedding with fixed page assignments.
\newblock Bachelor thesis, Karlsruhe Institute of Technology, Karlsruhe,
  Germany, 2012.

\bibitem{H74}
G{\"u}nter Hotz.
\newblock {\em Schaltkreistheorie}.
\newblock Walter de Gruyter, Berlin-New York, 1974.

\bibitem{HHL12}
Maolin Huang, Weidong Huang, and Chun-Cheng Lin.
\newblock Evaluating force-directed algorithms with a new framework.
\newblock In {\em 27th ACM Symposium on Applied Computing}, 2012.

\bibitem{H08a}
Weidong Huang.
\newblock An eye tracking study into the effects of graph layout.
\newblock {\em CoRR}, abs/0810.4431, 2008.
\newblock \arxiv{0810.4431} (last accessed 9/21/2017).

\bibitem{HEHL12}
Weidong Huang, Peter Eades, Seok-Hee Hong, and Chun-Cheng Lin.
\newblock Improving multiple aesthetics produces better graph drawings.
\newblock {\em Journal of Visual Languages \&\ Computing}, 2012.

\bibitem{HZ08}
Yuanqiu Huang and Tinglei Zhao.
\newblock The crossing number of {$K_{1,4,n}$}.
\newblock {\em Discrete Math.}, 308(9):1634--1638, 2008.

\bibitem{HHE08}
Weidong Huanh, Seok-Hee Hong, and Peter Eaders.
\newblock Effects of crossing angles.
\newblock In {\em PacificVis}, pages 41--46. IEEE, 2008.

\bibitem{HPSS07}
Peter Hui, Michael~J. Pelsmajer, Marcus Schaefer, and Daniel
  \v{S}tefankovi\v{c}.
\newblock Train tracks and confluent drawings.
\newblock {\em Algorithmica}, 47(4):465--479, 2007.

\bibitem{I08}
Kazumasa Ishiguro.
\newblock The minimum non-crossing edge number of graphs.
\newblock Talk at $20$th Workshop on Topological Graph Theory, Yokohama
  National University, Japan, 2008.

\bibitem{J71}
H.~F. Jensen.
\newblock An upper bound for the rectilinear crossing number of the complete
  graph.
\newblock {\em J. Combinatorial Theory Ser. B}, 10:212--216, 1971.

\bibitem{JS03}
Hector~A. Juarez and Gelasio Salazar.
\newblock Optimal meshes of curves in the {K}lein bottle.
\newblock {\em J. Combin. Theory Ser. B}, 88(1):185--188, 2003.

\bibitem{K14}
Paul Kainen.
\newblock Personal communication, August 2014.

\bibitem{K68}
Paul~C. Kainen.
\newblock On a problem of {P}. {E}rd{\H o}s.
\newblock {\em J. Combinatorial Theory}, 5:374--377, 1968.

\bibitem{K72}
Paul~C. Kainen.
\newblock A lower bound for crossing numbers of graphs with applications to
  {$K_{n}$}, {$K_{p,\,q}$}, and {$Q(d)$}.
\newblock {\em J. Combinatorial Theory Ser. B}, 12:287--298, 1972.

\bibitem{K72b}
Paul~C. Kainen.
\newblock On the stable crossing number of cubes.
\newblock {\em Proc. Amer. Math. Soc.}, 36:55--62, 1972.

\bibitem{K73}
Paul~C. Kainen.
\newblock Thickness and coarseness of graphs.
\newblock {\em Abh. Math. Sem. Univ. Hamburg}, 39:88--95, 1973.

\bibitem{K74}
Paul~C. Kainen.
\newblock Some recent results in topological graph theory.
\newblock In {\em Graphs and combinatorics ({P}roc. {C}apital {C}onf., {G}eorge
  {W}ashington {U}niv., {W}ashington, {D}.{C}., 1973)}, pages 76--108. Lecture
  Notes in Math., Vol. 406. Springer, Berlin, 1974.

\bibitem{K90}
Paul~C. Kainen.
\newblock The book thickness of a graph. {II}.
\newblock In {\em Proceedings of the {T}wentieth {S}outheastern {C}onference on
  {C}ombinatorics, {G}raph {T}heory, and {C}omputing ({B}oca {R}aton, {FL},
  1989)}, volume~71, pages 127--132, 1990.

\bibitem{K11}
Paul~C. Kainen.
\newblock Outerplanar crossing numbers of planar graphs.
\newblock {\em Bull. Inst. Combin. Appl.}, 61:69--76, 2011.

\bibitem{KW78}
Paul~C. Kainen and Arthur~T. White.
\newblock On stable crossing numbers.
\newblock {\em J. Graph Theory}, 2(3):181--187, 1978.

\bibitem{KT?}
Konstantinos~G. Kakoulis and Ioannis~G. Tollis.
\newblock {\em Labeling algorithms}, chapter~15, pages 489--516.
\newblock In Tamassia \cite{T13?}, 2013.

\bibitem{KPRSV08}
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, and Oleg
  Verbitsky.
\newblock Obfuscated drawings of planar graphs.
\newblock {\em CoRR}, abs/0803.0858, 2008.
\newblock \arxiv{0803.0858}, see version 3 (last accessed 9/21/2017).

\bibitem{KGB97}
N.~Kapur, D.~Ghosh, and F.~Brglez.
\newblock Optimization of placement driven by the cost of wire crossing.
\newblock Technical Report 1997-TR@CBL-08-Kapur, CBL, North Carolina State
  University, Oct 1997.

\bibitem{KPTU18b}
Michael Kaufmann, J\'{a}nos Pach, G\'{e}za T\'{o}th, and Torsten Ueckerdt.
\newblock The number of crossings in multigraphs with no empty lens.
\newblock In {\em Graph drawing and network visualization}, volume 11282 of
  {\em Lecture Notes in Comput. Sci.}, pages 242--254. Springer, Cham, 2018.

\bibitem{KU14}
Michael Kaufmann and Torsten Ueckerdt.
\newblock The density of fan-planar graphs.
\newblock {\em CoRR}, abs/1403.6184, 2014.
\newblock \arxiv{1403.6184} (last accessed 9/21/2017).

\bibitem{KR07}
Ken-ichi Kawarabayashi and Bruce Reed.
\newblock Computing crossing number in linear time.
\newblock In {\em S{TOC}'07---{P}roceedings of the 39th {A}nnual {ACM}
  {S}ymposium on {T}heory of {C}omputing}, pages 382--390. ACM, New York, 2007.

\bibitem{K1669}
Athanasius Kircher.
\newblock {\em Ars magna sciendi, in {XII} libros digesta}.
\newblock Janssonium {\`a} Waesberge, Amsterdam, 1669.
\newblock Online at \url{https://books.google.com/books?id=Gwynp56UqnEC} (last
  accessed 5/17/2019).

\bibitem{KSSH12}
Lars~Kristian Klauske, Christoph~Daniel Schulze, Miro Sp{\"o}nemann, and
  Reinhard von Hanxleden.
\newblock Improved layout for data flow diagrams with port constraints.
\newblock In {\em Proceedings of the 7th International Conference on the Theory
  and Application of Diagrams (DIAGRAMS'12)}, LNCS. Springer, 2012.

\bibitem{K70}
Daniel~J. Kleitman.
\newblock The crossing number of {$K_{5,n}$}.
\newblock {\em J. Combinatorial Theory}, 9:315--323, 1970.

\bibitem{K76}
Daniel~J. Kleitman.
\newblock A note on the parity of the number of crossings of a graph.
\newblock {\em J. Combinatorial Theory Ser. B}, 21(1):88--89, 1976.

\bibitem{KRS96}
Mari{\'a}n Kle{\v{s}}{\v{c}}, R.~Bruce Richter, and Ian Stobert.
\newblock The crossing number of {$C_5\times C_n$}.
\newblock {\em J. Graph Theory}, 22(3):239--243, 1996.

\bibitem{K1889}
A.~Kleyer and J.~Sachs.
\newblock {\em Lehrbuch der ebenen {E}lementar-{G}eometrie ({P}lanimetrie)}.
\newblock J. Maier, 1889.

\bibitem{KMNT13}
Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, and Hisao Tamaki.
\newblock A linear edge kernel for two-layer crossing minimization.
\newblock In Ding-Zhu Du and Guochuan Zhang, editors, {\em Computing and
  Combinatorics}, volume 7936 of {\em Lecture Notes in Computer Science}, pages
  458--468. Springer Berlin Heidelberg, 2013.

\bibitem{KT12}
Yasuaki Kobayashi and Hisao Tamaki.
\newblock A fast and simple subexponential fixed parameter algorithm for
  one-sided crossing minimization.
\newblock In Leah Epstein and Paolo Ferragina, editors, {\em Algorithms – ESA
  2012}, volume 7501 of {\em Lecture Notes in Computer Science}, pages
  683--694. Springer Berlin / Heidelberg, 2012.

\bibitem{KM04}
Petr Kolman and Ji{\v{r}}{\'\i} Matou{\v{s}}ek.
\newblock Crossing number, pair-crossing number, and expansion.
\newblock {\em J. Combin. Theory Ser. B}, 92(1):99--113, 2004.

\bibitem{K65}
Milan Koman.
\newblock 0 pr\'{a}ci pra\v{z}sk\'{e}ho semin\'{a}\v{r}e teorie graf\r{u}.
\newblock In {\em V\v{e}deck\'{a} pr\'{a}ce kateder matematiky na
  Pedagogick\'{y}ch institutech v {\v{C}SSR}}, pages 89--95. Samostatn\'{a}
  pedagogick\'{a} fakulta, Plze\v{n}, 1965.

\bibitem{K69}
Milan Koman.
\newblock On the crossing numbers of graphs.
\newblock {\em Acta Univ. Carolinae--Math. et Phys.}, 10(nos. 1--2):9--46,
  1969.

\bibitem{K75}
Milan Koman.
\newblock A note on the crossing number of {$K_{m,n}$} on the {K}lein bottle.
\newblock In {\em Recent advances in graph theory ({P}roc. {S}econd
  {C}zechoslovak {S}ympos., {P}rague, 1974)}, pages 327--334. Academia, Prague,
  1975.

\bibitem{K78}
Milan Koman.
\newblock New upper bounds for the crossing number of {$K_{n}$} on the {K}lein
  bottle.
\newblock {\em \v Casopis P\v est. Mat.}, 103(3):282--288, 1978.

\bibitem{KM08}
Vladimir~P. Korzhik and Bojan Mohar.
\newblock Minimal obstructions for 1-immersions and hardness of 1-planarity
  testing.
\newblock In Ioannis~G. Tollis and Maurizio Patrignani, editors, {\em Graph
  Drawing}, volume 5417 of {\em Lecture Notes in Computer Science}, pages
  302--312. Springer, 2008.

\bibitem{KNPSS15b}
Irina {Kostitsyna}, Martin {N{\"o}llenburg}, Valentin {Polishchuk}, Andr{\'e}
  {Schulz}, and Darren {Strash}.
\newblock On minimizing crossings in storyline visualizations.
\newblock In {\em Graph drawing and network visualization}, volume 9411 of {\em
  Lecture Notes in Comput. Sci.}, pages 192--198. Springer, Cham, 2015.

\bibitem{K91}
Jan Kratochv{\'{\i}}l.
\newblock String graphs. {I}. {T}he number of critical nonstring graphs is
  infinite.
\newblock {\em J. Combin. Theory Ser. B}, 52(1):53--66, 1991.

\bibitem{K98}
Jan Kratochv\'{\i}l.
\newblock Crossing number of abstract topological graphs.
\newblock {\em Lecture Notes in Computer Science}, 1547:238--245, 1998.

\bibitem{KM91}
Jan Kratochv\'{\i}l and Ji\v{r}\'{\i} Matou{\v{s}}ek.
\newblock String graphs requiring exponential representations.
\newblock {\em Journal of Combinatorial Theory, Series B}, 53:1--4, 1991.

\bibitem{vK11}
Marc~van Kreveld.
\newblock Bold graph drawings.
\newblock {\em Computational Geometry}, 44(9):499 -- 506, 2011.

\bibitem{KMBW01}
Eriola Kruja, Joe Marks, Ann Blair, and Richard~C. Waters.
\newblock A short note on the history of graph drawing.
\newblock In Petra Mutzel, Michael J{\"u}nger, and Sebastian Leipert, editors,
  {\em Graph Drawing}, volume 2265 of {\em Lecture Notes in Computer Science},
  pages 272--286. Springer, 2001.

\bibitem{LE02}
Wei Lai and Peter Eades.
\newblock Removing edge-node intersections in drawings of graphs.
\newblock {\em Inform. Process. Lett.}, 81(2):105--110, 2002.

\bibitem{L09}
Joshua~K. Lambert.
\newblock {\em Determining the biplanar crossing number of {$C_{K} \times C_{L}
  \times C_{M} \times C_{N}$}}.
\newblock PhD thesis, North Dakota State University, 2009.

\bibitem{LRMZ15}
D.~Lara, C.~Rubio-Montiel, and F.~Zaragoza.
\newblock Grundy and pseudo-grundy indices for complete geometric graphs.
\newblock In Pedro Ramos and Rodrigo~I. Silveira, editors, {\em Abstracts XVI
  Spanish Meeting on Computational Geometry}, pages 73--76, 2015.

\bibitem{L00}
J.~Lawrence.
\newblock Mutation polynomials and oriented matroids.
\newblock {\em Discrete Comput. Geom.}, 24(2-3):365--389, 2000.

\bibitem{LLRIRM14}
Jes\'{u}s Lea{\~n}os, Mario Lomeli, Marcelino Ram{\'{\i}}rez-Ib{\'a}{\~n}ez,
  and Luis~Manuel Rivera-Mart{\'{\i}}nez.
\newblock {The second convex hull of every optimal rectilinear drawing of $K_n$
  is a triangle}.
\newblock {\em ArXiv e-prints}, November 2014.
\newblock \arxiv{1411.1699} (last accessed 9/21/2017).

\bibitem{LM69}
B.~Leclerc and B.~Monjardet.
\newblock {Probl\`{e}mes ouverts. Repr\'{e}sentation graphique d'un graphe.}
\newblock {\em Math. et Sci. humaines}, 26:51--57, 1969.

\bibitem{L19}
Yoonah Lee.
\newblock On genus $g$ orientable crossing numbers of small complete graphs.
\newblock {\em ArXiv e-prints}, 2019.
\newblock \arxiv{1902.02759} (last accessed 4/2/2019).

\bibitem{L83}
F.~T. Leighton.
\newblock {\em Complexity Issues in {VLSI}: Optimal Layouts for the
  Shuffle-Exchange Graph and Other Networks}.
\newblock MIT Press, Cambridge, MA, 1983.

\bibitem{L84}
Frank~Thomson Leighton.
\newblock New lower bound techniques for {VLSI}.
\newblock {\em Math. Systems Theory}, 17(1):47--70, 1984.

\bibitem{L72}
Roy~B. Levow.
\newblock On {T}utte's algebraic approach to the theory of crossing numbers.
\newblock In {\em Proceedings of the {T}hird {S}outheastern {C}onference on
  {C}ombinatorics, {G}raph {T}heory, and {C}omputing}, pages 315--314, Boca
  Raton, Fla., 1972. Florida Atlantic Univ.

\bibitem{LE03}
Xuemin Lin and Peter Eades.
\newblock Towards area requirements for drawing hierarchically planar graphs.
\newblock {\em Theor. Comput. Sci.}, 292(3):679--695, 2003.

\bibitem{L1517}
Ramon Llull.
\newblock {\em Illuminati sacre pagine pfessoris amplissimi magistri Raymundi
  Lull Ars magna}.
\newblock Jacques Mareschal, Simon Vincent, London, 1517.
\newblock Online at \url{https://archive.org/details/bub_gb_rG_yINh8V1gC} (last
  accessed 5/17/2019).

\bibitem{L13}
Lorena~Mercedes L\'{o}pez.
\newblock Rectilinear crossing numbers of complete graphs with specific nested
  sequence of convex hulls.
\newblock Master's thesis, California State University, Northridge, 2013.

\bibitem{MR08}
Dengju Ma and Han Ren.
\newblock The projective plane crossing numbers of circular graphs.
\newblock {\em J. Syst. Sci. Complex.}, 21(2):316--322, 2008.

\bibitem{M91}
Tom Madej.
\newblock Bounds for the crossing number of the ${N}$-cube.
\newblock {\em Journal of Graph Theory}, 15(1):81--97, 1991.

\bibitem{M88}
E.~M{\"a}kinen.
\newblock On circular layouts.
\newblock {\em International Journal of Computer Mathematics}, 24(1):29--37,
  1988.

\bibitem{M83}
Anthony Mansfield.
\newblock Determining the thickness of graphs is {NP}-hard.
\newblock {\em Math. Proc. Cambridge Philos. Soc.}, 93(1):9--23, 1983.

\bibitem{MS95}
Malgorzata Marek-Sadowska and Majid Sarrafzadeh.
\newblock The crossing distribution problem.
\newblock {\em IEEE Trans. on CAD of Integrated Circuits and Systems},
  14(4):423--433, 1995.

\bibitem{MKNF87}
Sumio Masuda, Toshinobu Kashiwabara, Kazuo Nakajima, and Toshio Fujisawa.
\newblock On the {NP}-completeness of a computer network layout problem.
\newblock In {\em International Symposium on Circuits and Systems}, pages
  292--295. IEEE, 1987.

\bibitem{MNKF90}
Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, and Toshio Fujisawa.
\newblock Crossing minimization in linear embeddings of graphs.
\newblock {\em IEEE Trans. Comput.}, 39(1):124--127, 1990.

\bibitem{M14}
Ji{\v{r}}{\'{\i}} Matou{\v{s}}ek.
\newblock Near-optimal separators in string graphs.
\newblock {\em Combin. Probab. Comput.}, 23(1):135--139, 2014.

\bibitem{M85}
Michael May.
\newblock Computer-generated multi-row schematics.
\newblock {\em Comput. Aided Des.}, 17:25--29, January 1985.

\bibitem{MC12}
Andrew McConvey.
\newblock Highly non-convex crossing sequences.
\newblock Master's thesis, University of Waterloo, Waterloo, 2012.

\bibitem{MS08}
Tamara Mchedlidze and Antonios Symvonis.
\newblock Spine crossing minimization in upward topological book embeddings.
\newblock In Ioannis~G. Tollis and Maurizio Patrignani, editors, {\em Graph
  Drawing}, volume 5417 of {\em Lecture Notes in Computer Science}, pages
  445--446. Springer, 2008.

\bibitem{MPR15}
Dan McQuillan, Shengjun Pan, and R.~Bruce Richter.
\newblock On the crossing number of {$K_{13}$}.
\newblock {\em J. Combin. Theory Ser. B}, 115:224--235, 2015.

\bibitem{MR16}
Dan McQuillan and R.~Bruce Richter.
\newblock On the crossing number of {$K_n$} without computer assistance.
\newblock {\em J. Graph Theory}, 82(4):387--432, 2016.

\bibitem{M78}
Ingrid Mengersen.
\newblock Die {M}aximalzahl von kreuzungsfreien {K}anten in {D}arstellungen von
  vollst\"{a}ndigen {$n$}-geteilten {G}raphen.
\newblock {\em Math. Nachr.}, 85:131--139, 1978.

\bibitem{MELS95}
K.~Misue, P.~Eades, W.~Lai, and K.~Sugiyama.
\newblock Layout adjustment and the mental map.
\newblock {\em Journal of visual languages and computing}, 6(2):183--210, 1995.

\bibitem{M05}
Miki Miyauchi.
\newblock Embedding a graph into a $d + 1$-page book with $\lceil m \log_d
  n\rceil$ edge-crossings over the spine.
\newblock {\em IEICE Transactions}, 88-A(5):1136--1139, 2005.

\bibitem{M93}
Miki~Shimabara Miyauchi.
\newblock Algorithms for embedding graphs into a $3$-page book.
\newblock In G.~{Di Battista}, P.~Eades, H.~{de} Fraysseix, P.~Rosenstiehl, and
  R.~Tamassia, editors, {\em Proc. {ALCOM} Int. Work. Graph Drawing, GD}, pages
  79--80. Centre D'Analyse et de Math{\'e}matique Sociales, Paris Sorbonne,
  26--29~September 1993.

\bibitem{M99a}
Bojan Mohar.
\newblock Drawing graphs in the hyperbolic plane.
\newblock In Jan Kratochv{\'{\i}}l, editor, {\em Proceedings of the 7th
  {I}nternational {S}ymposium ({GD}'99) held at \v {S}ti\v r\'\i n {C}astle,
  {S}eptember 15--19, 1999}, volume 1731 of {\em Lecture Notes in Computer
  Science}, pages 127--136. Springer-Verlag, Berlin, 1999.

\bibitem{M99}
Bojan Mohar.
\newblock A linear time algorithm for embedding graphs in an arbitrary surface.
\newblock {\em SIAM J. Discrete Math.}, 12(1):6--26, 1999.

\bibitem{M08}
Bojan Mohar.
\newblock Crossing numbers of graphs on the plane and on other surfaces.
\newblock In {\em Abstracts of the 20th Workshop on Topological Graph Theory in
  Yokohama}, Yokohama, Japan, 2008.

\bibitem{M09}
Bojan Mohar.
\newblock The genus crossing number.
\newblock {\em Ars Math. Contemp.}, 2(2):157--162, 2009.

\bibitem{MS11}
Bojan Mohar and Tamon Stephen.
\newblock Expected crossing numbers.
\newblock {\em Electronic Notes in Discrete Mathematics}, 38(0):651--656, 2011.

\bibitem{MT01}
Bojan Mohar and Carsten Thomassen.
\newblock {\em Graphs on surfaces}.
\newblock Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins
  University Press, Baltimore, MD, 2001.

\bibitem{FML14}
Ruy~Fabila Monroy and Jorge L{\'{o}}pez.
\newblock Computational search of small point sets with small rectilinear
  crossing number.
\newblock {\em J. Graph Algorithms Appl.}, 18(3):393--399, 2014.

\bibitem{M65}
J.~W. Moon.
\newblock On the distribution of crossings in random complete graphs.
\newblock {\em J. Soc. Indust. Appl. Math.}, 13:506--510, 1965.

\bibitem{M34}
Jacob~Levy Moreno.
\newblock {\em Who shall survive?: A new approach to the problem of human
  interrelations.}
\newblock Nervous and Mental Disease Publishing Co, Washington, D.C., 1934.

\bibitem{M53}
Jacob~Levy Moreno.
\newblock {\em Who shall survive?: A new approach to the problem of human
  interrelations.}
\newblock Beacon House Inc, Beacon, N.Y., 1934.

\bibitem{MS01}
I.~Moscovich and I.~Stewart.
\newblock {\em 1000 {P}lay {T}hinks: {P}uzzles, {P}aradoxes, {I}llusions \&
  {G}ames}.
\newblock Workman Pub., 2001.

\bibitem{MUV02}
Xavier Mu{\~{n}}oz, Walter Unger, and Imrich V{\v{r}}{\v{t}}o.
\newblock One sided crossing minimization is {NP}-hard for sparse graphs.
\newblock In {\em Graph drawing ({V}ienna, 2001)}, volume 2265 of {\em Lecture
  Notes in Comput. Sci.}, pages 115--123. Springer, Berlin, 2002.

\bibitem{M19}
Marine Musulyan.
\newblock Local crossing numbers of the product of planar graphs and cycles.
\newblock Master's thesis, California State University, Northridge, Northridge,
  May 2019.

\bibitem{M01}
Petra Mutzel.
\newblock An alternative method to crossing minimization on hierarchical
  graphs.
\newblock {\em SIAM J. Optim.}, 11(4):1065--1080, 2001.

\bibitem{M09b}
Petra Mutzel.
\newblock The crossing number of graphs: Theory and computation.
\newblock In Susanne Albers, Helmut Alt, and Stefan N{\"a}her, editors, {\em
  Efficient Algorithms}, volume 5760 of {\em Lecture Notes in Computer
  Science}, pages 305--317. Springer, 2009.

\bibitem{MZ99b}
Petra Mutzel and Thomas Ziegler.
\newblock The constrained crossing minimization problem.
\newblock In {\em Graph drawing (\v {S}ti\v r\'\i n {C}astle, 1999)}, volume
  1731 of {\em Lecture Notes in Comput. Sci.}, pages 175--185. Springer,
  Berlin, 1999.

\bibitem{MZ99}
Petra Mutzel and Thomas Ziegler.
\newblock The constrained crossing minimization problem---a first approach.
\newblock In {\em Operations {R}esearch {P}roceedings 1998 ({Z}urich)}, pages
  125--134. Springer, Berlin, 1999.

\bibitem{N03}
Nagi~H. Nahas.
\newblock On the crossing number of {$K_{m,n}$}.
\newblock {\em Electron. J. Combin.}, 10:Note 8, 2003.

\bibitem{N98}
Seiya Negami.
\newblock Diagonal flips in triangulations on closed surfaces, estimating upper
  bounds.
\newblock {\em Yokohama Math. J.}, 45(2):113--124, 1998.

\bibitem{N01}
Seiya Negami.
\newblock Crossing numbers of graph embedding pairs on closed surfaces.
\newblock {\em Journal of Graph Theory}, 36(1):8--23, 2001.

\bibitem{N89}
Frances~J. Newbery.
\newblock Edge concentration: a method for clustering directed graphs.
\newblock In {\em Proceedings of the 2nd International Workshop on Software
  configuration management}, SCM '89, pages 76--85, New York, NY, USA, 1989.
  ACM.

\bibitem{N68}
T.~A.~J. Nicholson.
\newblock Permutation procedure for minimising the number of crossings in a
  network.
\newblock {\em Proc. Inst. Elec. Engrs.}, 115:21--26, 1968.

\bibitem{N40}
Mary~L. Northway.
\newblock A method for depicting social relationships obtained by sociometric
  testing.
\newblock {\em Sociometry}, 3(2):pp. 144--150, April 1940.

\bibitem{OTU13}
Yoshio {Okamoto}, Yuichi {Tatsu}, and Yushi {Uno}.
\newblock {Exact and fixed-parameter algorithms for metro-line crossing
  minimization problems}.
\newblock {\em ArXiv e-prints}, June 2013.
\newblock \arxiv{1306.3538} (last accessed 9/21/2017).

\bibitem{O13}
Bogdan Oporowski.
\newblock Personal communication, March 2013.

\bibitem{OZ09}
Bogdan Oporowski and David Zhao.
\newblock Coloring graphs with crossings.
\newblock {\em Discrete Math.}, 309(9):2948--2951, 2009.

\bibitem{O71}
Alvin Owens.
\newblock On the biplanar crossing number.
\newblock {\em Transactions on Circuit Theory}, 18(2):277 -- 280, March 1971.

\bibitem{PPST05}
J{\'a}nos Pach, Rom Pinchasi, Micha Sharir, and G{\'e}za T{\'o}th.
\newblock Topological graphs with no large grids.
\newblock {\em Graphs Combin.}, 21(3):355--364, 2005.

\bibitem{PRTT06}
J{\'a}nos Pach, Rado{\v{s}} Radoi{\v{c}}i{\'c}, G{\'a}bor Tardos, and G{\'e}za
  T{\'o}th.
\newblock Improving the crossing lemma by finding more crossings in sparse
  graphs.
\newblock {\em Discrete Comput. Geom.}, 36(4):527--552, 2006.

\bibitem{PSTT15}
J{\'a}nos Pach, L{\'a}szl{\'o}~A. Sz{\'e}kely, Csaba T{\'o}th, and G{\'e}za
  T{\'o}th.
\newblock Note on k-planar crossing numbers.
\newblock Submitted to {\em Computational Geometry: Theory and Applications}.
  Special Issue in Memoriam Ferran Hurtado.

\bibitem{PSTT18}
J\'{a}nos Pach, L\'{a}szl\'{o}~A. Sz\'{e}kely, Csaba~D. T\'{o}th, and G\'{e}za
  T\'{o}th.
\newblock Note on {$k$}-planar crossing numbers.
\newblock {\em Comput. Geom.}, 68:2--6, 2018.

\bibitem{PT97}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Graphs drawn with few crossings per edge.
\newblock {\em Combinatorica}, 17(3):427--439, 1997.

\bibitem{PT00b}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Thirteen problems on crossing numbers.
\newblock {\em Geombinatorics}, 9(4):194--207, 2000.

\bibitem{PT00}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Which crossing number is it anyway?
\newblock {\em J. Combin. Theory Ser. B}, 80(2):225--246, 2000.

\bibitem{PT04}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Monotone drawings of planar graphs.
\newblock {\em J. Graph Theory}, 46(1):39--47, 2004.

\bibitem{PT06a}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Crossing number of toroidal graphs.
\newblock In {\em Topics in discrete mathematics}, volume~26 of {\em Algorithms
  Combin.}, pages 581--590. Springer, Berlin, 2006.

\bibitem{PT09}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Degenerate crossing numbers.
\newblock {\em Discrete Comput. Geom.}, 41(3):376--384, 2009.

\bibitem{PT112}
J{\'a}nos Pach and G{\'e}za T{\'o}th.
\newblock Monotone crossing number.
\newblock In Marc~J. van Kreveld and Bettina Speckmann, editors, {\em Graph
  Drawing}, volume 7034 of {\em Lecture Notes in Computer Science}, pages
  278--289. Springer, 2011.

\bibitem{PT18}
{J\'{a}nos} Pach and {G\'{e}za} T\'{o}th.
\newblock A crossing lemma for multigraphs.
\newblock In {\em 34th {I}nternational {S}ymposium on {C}omputational
  {G}eometry}, volume~99 of {\em LIPIcs. Leibniz Int. Proc. Inform.}, pages
  Art. No. 65, 13. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018.

\bibitem{P06}
Shengjun Pan.
\newblock On the crossing numbers of complete graphs.
\newblock Master's thesis, University of Waterloo, 2006.

\bibitem{PR07}
Shengjun Pan and R.~Bruce Richter.
\newblock The crossing number of {$K_{11}$} is 100.
\newblock {\em J. Graph Theory}, 56(2):128--134, 2007.

\bibitem{PSS09c}
Michael~J. Pelsmajer, Marcus Schaefer, and Despina Stasi.
\newblock Strong {H}anani--{T}utte on the projective plane.
\newblock {\em SIAM Journal on Discrete Mathematics}, 23(3):1317--1323, 2009.

\bibitem{PSS07c}
Michael~J. Pelsmajer, Marcus Schaefer, and {\v S}tefankovi{\v c}.
\newblock Crossing numbers and parameterized complexity.
\newblock In Seok-Hee Hong, Takao Nishizeki, and Wu~Quan, editors, {\em Graph
  Drawing}, volume 4875 of {\em Lecture Notes in Computer Science}, pages
  31--36. Springer, 2007.

\bibitem{PSS05a}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel {\v S}tefankovi{\v c}.
\newblock Removing even crossings.
\newblock In Stefan Felsner, editor, {\em 2005 European Conference on
  Combinatorics, Graph Theory and Applications (EuroComb '05)}, volume~AE of
  {\em DMTCS Proceedings}, pages 105--109. Discrete Mathematics and Theoretical
  Computer Science, April 2005.

\bibitem{PSS07d}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel {\v{S}}tefankovi{\v{c}}.
\newblock Removing even crossings.
\newblock {\em J. Combin. Theory Ser. B}, 97(4):489--500, 2007.

\bibitem{PSS08}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel {\v S}tefankovi{\v c}.
\newblock Odd crossing number and crossing number are not the same.
\newblock {\em Discrete Comput. Geom.}, 39(1):442--454, 2008.

\bibitem{PSS09}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel {\v{S}}tefankovi{\v{c}}.
\newblock Removing even crossings on surfaces.
\newblock {\em European J. Combin.}, 30(7):1704--1717, 2009.

\bibitem{PSS08d}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel \v{S}tefankovi\v{c}.
\newblock Crossing numbers and parameterized complexity.
\newblock In {\em Graph drawing}, volume 4875 of {\em Lecture Notes in Comput.
  Sci.}, pages 31--36. Springer, Berlin, 2008.

\bibitem{PSS10}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel \v{S}tefankovi\v{c}.
\newblock Removing independently even crossings.
\newblock {\em SIAM Journal on Discrete Mathematics}, 24(2):379--393, 2010.

\bibitem{PSS09d}
Michael~J. Pelsmajer, Marcus Schaefer, and Daniel \v{S}tefankovi\v{c}.
\newblock Crossing numbers of graphs with rotation systems.
\newblock {\em Algorithmica}, 60:679--702, 2011.
\newblock 10.1007/s00453-009-9343-y.

\bibitem{PRS91}
B.~L. Piazza, R.~D. Ringeisen, and S.~K. Stueckle.
\newblock Properties of nonminimum crossings for some classes of graphs.
\newblock In {\em Graph theory, combinatorics, and applications. {V}ol.\ 2
  ({K}alamazoo, {MI}, 1988)}, Wiley-Intersci. Publ., pages 975--989. Wiley, New
  York, 1991.

\bibitem{P12}
Marco Pierobon.
\newblock Minimization of the crossing number in a reconciled tree.
\newblock Master's thesis, Universit\'{a} deglie Studi di Padova, Padua, Italy,
  2012.

\bibitem{PR04b}
Benny Pinontoan and R.~Bruce Richter.
\newblock Crossing numbers of sequences of graphs. {I}. {G}eneral tiles.
\newblock {\em Australas. J. Combin.}, 30:197--206, 2004.

\bibitem{P17}
Rafael~Veiga Pocai.
\newblock Inapproximability ratios for crossing number.
\newblock In {\em L{AGOS}'17---{IX} {L}atin and {A}merican {A}lgorithms,
  {G}raphs and {O}ptimization}, volume~62 of {\em Electron. Notes Discrete
  Math.}, pages 117--122. Elsevier Sci. B. V., Amsterdam, 2017.

\bibitem{P02}
Helen~C. Purchase.
\newblock Metrics for graph drawing aesthetics.
\newblock {\em J. Vis. Lang. Comput}, 13(5):501--516, 2002.

\bibitem{P04a}
Helen~C. Purchase.
\newblock {\em Computer Graphics and Multimedia: Applications, Problems and
  Solutions}, chapter Evaluating Graph Drawing Aesthetics: defining and
  exploring a new empirical research area, pages 145--178.
\newblock Idea Group Publishing, 2004.

\bibitem{RR19b}
Marcel Radermacher and Ignaz Rutter.
\newblock Geometric crossing-minimization---a scalable randomized approach.
\newblock In {\em 27th {A}nnual {E}uropean {S}ymposium on {A}lgorithms}, volume
  144 of {\em LIPIcs. Leibniz Int. Proc. Inform.}, pages Art. No. 76, 16.
  Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2019.

\bibitem{RS01}
R.~Bruce Richter and Gelasio Salazar.
\newblock The crossing number of {$C_6\times C_n$}.
\newblock {\em Australas. J. Combin.}, 23:135--143, 2001.

\bibitem{RS05}
R.~Bruce Richter and Gelasio Salazar.
\newblock Two maps with large representativity on one surface.
\newblock {\em J. Graph Theory}, 50(3):234--245, 2005.

\bibitem{RS96}
R.~Bruce Richter and J.~{\v{S}}ir{\'a}{\v{n}}.
\newblock The crossing number of {$K_{3,n}$} in a surface.
\newblock {\em J. Graph Theory}, 21(1):51--54, 1996.

\bibitem{RT95}
R.~Bruce Richter and Carsten Thomassen.
\newblock Intersections of curve systems and the crossing number of {$C_5\times
  C_5$}.
\newblock {\em Discrete Comput. Geom.}, 13(2):149--159, 1995.

\bibitem{RT97}
R.~Bruce Richter and Carsten Thomassen.
\newblock Relations between crossing numbers of complete and complete bipartite
  graphs.
\newblock {\em Amer. Math. Monthly}, 104(2):131--137, 1997.

\bibitem{R96}
R.~D. Ringeisen.
\newblock Two old extremal graph drawing conjectures: progress and
  perspectives.
\newblock {\em Congr. Numer.}, 115:91--103, 1996.
\newblock Surveys in graph theory (San Francisco, CA, 1995).

\bibitem{RSP91}
R.~D. Ringeisen, S.~K. Stueckle, and B.~L. Piazza.
\newblock Subgraphs and bounds on maximum crossings.
\newblock {\em Bull. Inst. Combin. Appl.}, 2:33--46, 1991.

\bibitem{RB78}
Richard~D. Ringeisen and Lowell~W. Beineke.
\newblock The crossing number of {$C_{3}\times C_{n}$}.
\newblock {\em J. Combin. Theory Ser. B}, 24(2):134--136, 1978.

\bibitem{R64}
G.~Ringel.
\newblock Extremal problems in the theory of graphs.
\newblock In {\em Theory of {G}raphs and its {A}pplications ({P}roc. {S}ympos.
  {S}molenice, 1963)}, pages 85--90. Publ. House Czechoslovak Acad. Sci.,
  Prague, 1964.

\bibitem{R81}
G.~Ringel.
\newblock A nine color theorem for the torus and the {K}lein bottle.
\newblock In {\em The theory and applications of graphs ({K}alamazoo, {M}ich.,
  1980)}, pages 507--515. Wiley, New York, 1981.

\bibitem{R65}
Gerhard Ringel.
\newblock Ein {S}echsfarbenproblem auf der {K}ugel.
\newblock {\em Abh. Math. Sem. Univ. Hamburg}, 29:107--117, 1965.

\bibitem{R93}
Adrian Riskin.
\newblock The projective plane crossing number of {$C_3\times C_n$}.
\newblock {\em J. Graph Theory}, 17(6):683--693, 1993.

\bibitem{R01}
Adrian Riskin.
\newblock On the nonembeddability and crossing numbers of some toroidal graphs
  on the {K}lein bottle.
\newblock {\em Discrete Math.}, 234(1-3):77--88, 2001.

\bibitem{R03}
Adrian Riskin.
\newblock On the outerplanar crossing numbers of {$K_{m,n}$}.
\newblock {\em Bull. Inst. Combin. Appl.}, 39:16--20, 2003.

\bibitem{R07b}
Adrian Riskin.
\newblock The biplanar crossing number of {$C^4_n$}.
\newblock {\em Bull. Inst. Combin. Appl.}, 49:79--85, 2007.

\bibitem{R07}
Adrian Riskin.
\newblock The circular {$k$}-partite crossing number of {$K_{m,n}$}.
\newblock {\em Australas. J. Combin.}, 38:207--210, 2007.

\bibitem{S64}
Thomas~L. Saaty.
\newblock The minimum number of intersections in complete graphs.
\newblock {\em Proc. Nat. Acad. Sci. U.S.A.}, 52:688--690, 1964.

\bibitem{S69}
Thomas~L. Saaty.
\newblock Symmetry and the crossing number for complete graphs.
\newblock {\em J. Res. Nat. Bur. Standards Sect. B}, 73B:177--186, 1969.

\bibitem{SSS13}
Dharna Satsangi, Kamal Srivastava, and Gursaran Srivastava.
\newblock ${K}$-page crossing number minimization problem: An evaluation of
  heuristics and its solution using {GESAKP}.
\newblock {\em Memetic Computing}, 5(4):255--274, 2013.

\bibitem{S10b}
Marcus Schaefer.
\newblock Complexity of some geometric and topological problems.
\newblock In {\em Graph drawing}, volume 5849 of {\em Lecture Notes in Comput.
  Sci.}, pages 334--344. Springer, Berlin, 2010.

\bibitem{S14d}
Marcus Schaefer.
\newblock Picking planar edges; or, drawing a graph with a planar subgraph.
\newblock In {\em Graph drawing}, volume 8871 of {\em Lecture Notes in Comput.
  Sci.}, pages 13--24. Springer, Heidelberg, 2014.

\bibitem{S18}
Marcus Schaefer.
\newblock {\em Crossing numbers of graphs}.
\newblock Discrete Mathematics and its Applications (Boca Raton). CRC Press,
  Boca Raton, FL, 2018.

\bibitem{SSS03}
Marcus Schaefer, Eric Sedgwick, and Daniel {\v{S}}tefankovi{\v{c}}.
\newblock Recognizing string graphs in {NP}.
\newblock {\em J. Comput. System Sci.}, 67(2):365--380, 2003.
\newblock Special issue on STOC2002 (Montreal, QC).

\bibitem{SSS08}
Marcus Schaefer, Eric Sedgwick, and Daniel \v{S}tefankovi\v{c}.
\newblock Computing {D}ehn twists and geometric intersection numbers in
  polynomial time.
\newblock In {\em Proceedings of the 20th Canadian Conference on Computational
  Geometry}, pages 111--114, 2008.

\bibitem{SS05}
Marcus Schaefer and Daniel {\v{S}}tefankovi{\v{c}}.
\newblock Decidability of string graphs.
\newblock {\em J. Comput. System Sci.}, 68(2):319--334, 2004.

\bibitem{SS13}
Marcus Schaefer and Daniel {\v S}tefankovi{\v c}.
\newblock Block additivity of ${\ZN_2}$-embeddings.
\newblock In Wismath and Wolff \cite{WW13}, pages 185--195.

\bibitem{SS15}
Marcus Schaefer and Daniel Stefankovic.
\newblock The degenerate crossing number and higher-genus embeddings.
\newblock In Emilio~Di Giacomo and Anna Lubiw, editors, {\em Graph Drawing and
  Network Visualization - 23rd International Symposium, {GD} 2015, Los Angeles,
  CA, USA, September 24-26, 2015, Revised Selected Papers}, volume 9411 of {\em
  Lecture Notes in Computer Science}, pages 63--74. Springer, 2015.

\bibitem{SU97}
Edward~R. Scheinerman and Daniel~H. Ullman.
\newblock {\em Fractional graph theory}.
\newblock Wiley-Interscience Series in Discrete Mathematics and Optimization.
  John Wiley \& Sons Inc., New York, 1997.

\bibitem{SW94}
Edward~R. Scheinerman and Herbert~S. Wilf.
\newblock The rectilinear crossing number of a complete graph and {S}ylvester's
  ``four point problem'' of geometric probability.
\newblock {\em Amer. Math. Monthly}, 101(10):939--943, 1994.

\bibitem{S90a}
Walter Schnyder.
\newblock Embedding planar graphs on the grid.
\newblock In {\em Proceedings of the first annual ACM-SIAM symposium on
  Discrete algorithms}, SODA '90, pages 138--148, Philadelphia, PA, USA, 1990.
  Society for Industrial and Applied Mathematics.

\bibitem{SSvH13}
Christoph~Daniel Schulze, Miro Sp{\"o}nemann, and Reinhard von Hanxleden.
\newblock Drawing layered graphs with port constraints.
\newblock {\em Journal of Visual Languages \& Computing}, 2013.

\bibitem{S84}
H.~Schumacher.
\newblock Ein {$7$}-{F}arbensatz {$1$}-einbettbarer {G}raphen auf der
  projektiven {E}bene.
\newblock {\em Abh. Math. Sem. Univ. Hamburg}, 54:5--14, 1984.

\bibitem{S86}
H.~Schumacher.
\newblock Zur {S}truktur {$1$}-planarer {G}raphen.
\newblock {\em Math. Nachr.}, 125:291--300, 1986.

\bibitem{S90}
H.~Schumacher.
\newblock On {$2$}-embeddable graphs.
\newblock In {\em Topics in combinatorics and graph theory ({O}berwolfach,
  1990)}, pages 651--661. Physica, Heidelberg, 1990.

\bibitem{SSSV96a}
Farhad Shahrokhi, O.~S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  Vr{\v{t}}o.
\newblock The crossing number of a graph on a compact {$2$}-manifold.
\newblock {\em Adv. Math.}, 123(2):105--119, 1996.

\bibitem{SSSV95}
Farhad Shahrokhi, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock Book embeddings and crossing numbers.
\newblock In {\em Graph-theoretic concepts in computer science ({H}errsching,
  1994)}, volume 903 of {\em Lecture Notes in Comput. Sci.}, pages 256--268.
  Springer, Berlin, 1995.

\bibitem{SSSV00}
Farhad Shahrokhi, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock A new lower bound for the bipartite crossing number with
  applications.
\newblock {\em Theoret. Comput. Sci.}, 245(2):281--294, 2000.
\newblock Algorithms for future technologies (Saarbr{\"u}cken, 1997).

\bibitem{SSSV01}
Farhad Shahrokhi, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock On bipartite drawings and the linear arrangement problem.
\newblock {\em SIAM J. Comput.}, 30(6):1773--1789, 2001.

\bibitem{SSSV03}
Farhad Shahrokhi, Ondrej S{\'y}kora, Laszlo~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock Bounds for convex crossing numbers.
\newblock In {\em Computing and combinatorics}, volume 2697 of {\em Lecture
  Notes in Comput. Sci.}, pages 487--495. Springer, Berlin, 2003.

\bibitem{SSSV04}
Farhad Shahrokhi, Ondrej S{\'y}kora, Laszlo~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock The gap between crossing numbers and convex crossing numbers.
\newblock In {\em Towards a theory of geometric graphs}, volume 342 of {\em
  Contemp. Math.}, pages 249--258. Amer. Math. Soc., Providence, RI, 2004.

\bibitem{SSSV07}
Farhad Shahrokhi, Ondrej S{\'y}kora, L{\'a}szl{\'o}~A. Sz{\'e}kely, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock On {$k$}-planar crossing numbers.
\newblock {\em Discrete Appl. Math.}, 155(9):1106--1115, 2007.

\bibitem{SSSV97}
Farhad Shahrokhi, Ondrej S\'ykora, L\'aszl\'o~A. Sz\'ekely, and Imrich
  Vr\v{t}o.
\newblock Crossing numbers: bounds and applications.
\newblock In {\em Intuitive geometry ({B}udapest, 1995)}, volume~6 of {\em
  Bolyai Soc. Math. Stud.}, pages 179--206. J\'anos Bolyai Math. Soc.,
  Budapest, 1997.

\bibitem{SSSV96b}
Farhad Shahrokhi, L{\'a}szl{\'o}~A. Sz{\'e}kely, O.~S{\'y}kora, and Imrich
  Vr{\v{t}}o.
\newblock Drawings of graphs on surfaces with few crossings.
\newblock {\em Algorithmica}, 16(1):118--131, 1996.

\bibitem{SSSV96}
Farhad Shahrokhi, L{\'a}szl{\'o}~A. Sz{\'e}kely, Ondrej S{\'y}kora, and Imrich
  V{\v{r}}{\v{t}}o.
\newblock The book crossing number of a graph.
\newblock {\em J. Graph Theory}, 21(4):413--424, 1996.

\bibitem{SV99}
Farhad Shahrokhi and Imrich V{\v{r}}{\v{t}}o.
\newblock On $3$-layer crossings and pseudo arrangements.
\newblock In {\em Graph drawing (\v {S}ti\v r\'\i n {C}astle, 1999)}, volume
  1731 of {\em Lecture Notes in Comput. Sci.}, pages 225--231. Springer,
  Berlin, 1999.

\bibitem{SZ19}
Alireza Shavali and Hamid Zarrabi-Zadeh.
\newblock New bounds on $k$-planar crossing numbers.
\newblock {\em ArXiv e-prints}, November 2019.
\newblock \arxiv{1911.06403} (last accessed 11/21/2019).

\bibitem{S71}
David~A. Singer.
\newblock The rectilinear crossing number of certain graphs, 1971.
\newblock Manuscript at
  \url{http://www.cwru.edu/artsci/math/singer/publish/Rectilinear_crossings.pdf}
  (last accessed 1/9/2013).

\bibitem{S04x}
David Singmaster.
\newblock Sources in recreational mathematics. {A}n annotated bibliography,
  2004.

\bibitem{ST99}
Janet~M. Six and Ioannis~G. Tollis.
\newblock Circular drawings of biconnected graphs.
\newblock In Michael~T. Goodrich and Catherine~C. McGeoch, editors, {\em
  Algorithm Engineering and Experimentation, International Workshop {ALENEX}
  '99, Baltimore, {MD}, {USA}, January 15-16, 1999, Selected Papers}, volume
  1619 of {\em Lecture Notes in Computer Science}, pages 57--73. Springer,
  1999.

\bibitem{S14b}
Athena~C. Sparks.
\newblock The cylindrical crossing number of the complete bipartite graph.
\newblock Master's thesis, California State University, Northridge, May 2014.

\bibitem{S04b}
Joel Spencer.
\newblock The biplanar crossing number of the random graph.
\newblock In {\em Towards a theory of geometric graphs}, volume 342 of {\em
  Contemp. Math.}, pages 269--271. Amer. Math. Soc., Providence, RI, 2004.

\bibitem{ST02}
Joel Spencer and G{\'e}za T{\'o}th.
\newblock Crossing numbers of random graphs.
\newblock {\em Random Structures Algorithms}, 21(3-4):347--358, 2002.
\newblock Random structures and algorithms (Poznan, 2001).

\bibitem{S12}
Matthias~F. Stallmann.
\newblock A heuristic for bottleneck crossing minimization and its performance
  on general crossing minimization: Hypothesis and experimental study.
\newblock {\em J. Exp. Algorithmics}, 17(1):1.3:1.1--1.3:1.30, July 2012.

\bibitem{SG10}
Matthias~F. Stallmann and Saurabh Gupta.
\newblock Bottleneck crossing minimization in layered graphs.
\newblock Technical Report TR-2010-13, North Carolina State University, June
  2010.

\bibitem{S1893}
H.~Staudacher.
\newblock {\em Lehrbuch der Kombinatorik}.
\newblock J. Maier, 1893.

\bibitem{S23}
Ernst Steinitz.
\newblock \"{U}ber die {M}aximalzahl der {D}oppelpunkte bei ebenen {P}olygonen
  von gerader {S}eitenzahl.
\newblock {\em Math. Z.}, 17(1):116--129, 1923.

\bibitem{STT81}
Kozo Sugiyama, Sh{\^o}jir{\^o} Tagawa, and Mitsuhiko Toda.
\newblock Methods for visual understanding of hierarchical system structures.
\newblock {\em IEEE Trans. Systems Man Cybernet.}, 11(2):109--125, 1981.

\bibitem{S09}
Chaitanya Swamy.
\newblock {CO}452/652: Integer programming, 2009.
\newblock Homework Assignment at
  \url{http://www.math.uwaterloo.ca/~cswamy/courses/co652/as3.pdf} (last
  accessed 1/9/2013).

\bibitem{S97}
L\'{a}szl\'{o}~A. Sz\'{e}kely.
\newblock Crossing numbers and hard {Erd\H{o}s} problems in discrete geometry.
\newblock {\em Combin. Probab. Comput.}, 6(3):353--358, 1997.

\bibitem{S04}
L{\'a}szl{\'o}~A. Sz{\'e}kely.
\newblock A successful concept for measuring non-planarity of graphs: the
  crossing number.
\newblock {\em Discrete Math.}, 276(1-3):331--352, 2004.

\bibitem{S05}
L{\'a}szl{\'o}~A. Sz{\'e}kely.
\newblock Progress on crossing number problems.
\newblock In Peter Vojt{\'a}s, M{\'a}ria Bielikov{\'a}, Bernadette
  Charron-Bost, and Ondrej S{\'y}kora, editors, {\em {SOFSEM} 2005: Theory and
  Practice of Computer Science, 31st Conference on Current Trends in Theory and
  Practice of Computer Science, Liptovsk{\'y} {J}{\'a}n, Slovakia, January
  22-28, 2005, Proceedings}, volume 3381 of {\em Lecture Notes in Computer
  Science}, pages 53--61. Springer, 2005.

\bibitem{S08}
L{\'a}szl{\'o}~A. Sz{\'e}kely.
\newblock An optimality criterion for the crossing number.
\newblock {\em Ars Math. Contemp.}, 1(1):32--37, 2008.

\bibitem{S16}
L{\'a}szl{\'o}~A. Sz{\'e}kely.
\newblock Tur{\'a}n's {B}rick {F}actory problem: The status of the conjectures
  of {Z}arankiewicz and {H}ill.
\newblock In Ralucca Gera, Stephen Hedetniemi, and Craig Larson, editors, {\em
  Graph Theory: Favorite Conjectures and Open Problems - 1}, pages 211--230.
  Springer, 2016.

\bibitem{T1877}
Peter~Guthrie Tait.
\newblock Some elementary properties of closed plane curves.
\newblock {\em Messenger of Mathematics}, pages 132--133, 1877.

\bibitem{T13?}
Roberto Tamassia, editor.
\newblock {\em Handbook of Graph Drawing and Visualization}.
\newblock Discrete Mathematics and Its Applications. Chapman and Hall/CRC,
  2013.

\bibitem{TT16}
Hiroyuki Tanaka and Masakazu Teragaito.
\newblock Triple crossing numbers of graphs.
\newblock {\em Commun. Math. Res.}, 32(1):1--38, 2016.

\bibitem{T07a}
Terence Tao.
\newblock The crossing number inequality.
\newblock
  \url{http://terrytao.wordpress.com/2007/09/18/the-crossing-number-inequality/}
  (last accessed 2014/4/18).

\bibitem{TV06}
Terence Tao and Van Vu.
\newblock {\em Additive combinatorics}, volume 105 of {\em Cambridge Studies in
  Advanced Mathematics}.
\newblock Cambridge University Press, Cambridge, 2006.

\bibitem{TT07}
G{\'a}bor Tardos and G{\'e}za T{\'o}th.
\newblock Crossing stars in topological graphs.
\newblock {\em SIAM J. Discrete Math.}, 21(3):737--749, 2007.

\bibitem{T88}
Carsten Thomassen.
\newblock Rectilinear drawings of graphs.
\newblock {\em J. Graph Theory}, 12(3):335--341, 1988.

\bibitem{T95a}
Carsten Thomassen.
\newblock Embeddings and minors.
\newblock In {\em Handbook of combinatorics, {V}ol.\ 1}, pages 301--349.
  Elsevier, Amsterdam, 1995.

\bibitem{T11}
Carsten Thomassen.
\newblock Personal communication, November 2011.

\bibitem{T00}
Christian Th\"{u}rmann.
\newblock {Minimale Anzahl von Kanten mit wenigen Kreuzungen in geradlinigen
  Darstellungen des vollst\"{a}ndigen Graphen}.
\newblock Master's thesis, {Technischen Universit\"{a}t Braunschweig}, Germany,
  2000.

\bibitem{T07}
G{\'e}za T{\'o}th.
\newblock Note on the pair-crossing number and the odd-crossing number.
\newblock In Prosenjit Bose, editor, {\em Proceedings of the 19th Annual
  Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22,
  2007, Carleton University, Ottawa, Canada}, pages 3--6. Carleton University,
  Ottawa, Canada, 2007.

\bibitem{T08}
G{\'e}za T{\'o}th.
\newblock Note on the pair-crossing number and the odd-crossing number.
\newblock {\em Discrete Comput. Geom.}, 39(4):791--799, 2008.

\bibitem{T12}
G{\'e}za T{\'o}th.
\newblock A better bound for the pair-crossing number.
\newblock In J\'{a}nos Pach, editor, {\em Thirty Essays on Geometric Graph
  Theory}, pages 563--567. Springer, 2012.

\bibitem{T06}
Alan Tucker.
\newblock {\em Applied combinatorics}.
\newblock John Wiley \& Sons Inc., New York, fifth edition, 2006.

\bibitem{T77}
Paul Tur\'{a}n.
\newblock A note of welcome.
\newblock {\em Journal of Graph Theory}, 1(1):7--9, 1977.

\bibitem{T70}
William~T. Tutte.
\newblock Toward a theory of crossing numbers.
\newblock {\em J. Combinatorial Theory}, 8:45--53, 1970.

\bibitem{U88}
Walter Unger.
\newblock On the {$k$}-colouring of circle-graphs.
\newblock In {\em S{TACS} 88 ({B}ordeaux, 1988)}, volume 294 of {\em Lecture
  Notes in Comput. Sci.}, pages 61--72, Berlin, 1988. Springer.

\bibitem{U92}
Walter Unger.
\newblock The complexity of colouring circle graphs (extended abstract).
\newblock In {\em 9th Annual Symposium on Theoretical Aspects of Computer
  Science}, volume 577 of {\em lncs}, pages 389--400, Cachan, France,
  13--15~February 1992. Springer.

\bibitem{U55}
K.~Urbanik.
\newblock Solution du probl\`{e}me pos\'{e} par {P}. {T}ur\'{a}n.
\newblock {\em Comptes Rendus}, pages 200--201, 1955.

\bibitem{UW19a}
John~C. Urschel and Jake Wellens.
\newblock Testing $k$-planarity is {NP}-complete.
\newblock {\em ArXiv e-prints}, 2019.
\newblock \arxiv{1907.02104} (last accessed 2/10/2020).

\bibitem{V04}
Pavel Valtr.
\newblock On the pair-crossing number.
\newblock In {\em Combinatorial and Computational Geometry}, volume~52 of {\em
  Math. Sci. Res. Inst. Publ.}, pages 569--575. Cambridge University Press,
  Cambridge, 2005.

\bibitem{V08}
Oleg Verbitsky.
\newblock On the obfuscation complexity of planar graphs.
\newblock {\em Theoret. Comput. Sci.}, 396(1-3):294--300, 2008.

\bibitem{Vx}
Imrich V{\v{r}}{\v{t}}o.
\newblock Crossing numbers of graphs: a bibliography.
\newblock Available at \url{ftp://ftp.ifi.savba.sk/pub/imrich/crobib.pdf} (last
  accessed 2/3/2020), 2011.
\newblock Last updated: January 15th, 2014.

\bibitem{W01}
Vance Waddle.
\newblock Graph layout for displaying data structures.
\newblock In Joe Marks, editor, {\em Graph Drawing}, volume 1984 of {\em
  Lecture Notes in Computer Science}, pages 241--252. Springer, January~01
  2000.

\bibitem{W06}
Uli Wagner.
\newblock On a geometric generalization of the upper bound theorem.
\newblock In {\em FOCS: IEEE Symposium on Foundations of Computer Science
  (FOCS)}, pages 635--645. IEEE Computer Society, 2006.

\bibitem{W07}
W.~D. Wallis.
\newblock {\em A beginner's guide to graph theory}.
\newblock Birkh\"auser Boston Inc., Boston, MA, second edition, 2007.

\bibitem{W17}
Jiun{-}Jie Wang.
\newblock Layouts for plane graphs on constant number of tracks.
\newblock {\em CoRR}, abs/1708.02114, 2017.
\newblock \arxiv{1708.02114} (last accessed 9/21/2017).

\bibitem{W14}
Yi-Kai {Wang}.
\newblock {MAX-CSP, Graph Cuts and Statistical Physics}.
\newblock {\em ArXiv e-prints}, November 2014.
\newblock \arxiv{1412.0340} (last accessed 9/21/2017).

\bibitem{W77}
John~N. Warfield.
\newblock Crossing theory and hierarchy mapping.
\newblock {\em IEEE Trans. Systems Man Cybernet.}, SMC-7(7):505--523, 1977.

\bibitem{W70}
Mark~E. Watkins.
\newblock A special crossing number for bipartite graphs: {A} research problem.
\newblock {\em Ann. New York Acad. Sci.}, 175:405--410, 1970.

\bibitem{W84}
Arthur~T. White.
\newblock {\em Graphs, groups and surfaces}, volume~8 of {\em North-Holland
  Mathematics Studies}.
\newblock North-Holland Publishing Co., Amsterdam, second edition, 1984.

\bibitem{W97}
Herbert~S. Wilf.
\newblock On crossing numbers, and some unsolved problems.
\newblock In {\em Combinatorics, geometry and probability ({C}ambridge, 1993)},
  pages 557--562. Cambridge Univ. Press, Cambridge, 1997.

\bibitem{W05}
Wynand Winterbach.
\newblock {The crossing number of a graph in the plane}.
\newblock Master's thesis, University of Stellenbosch, South Africa, 2005.

\bibitem{WW13}
Stephen Wismath and Alexander Wolff, editors.
\newblock {\em Graph drawing}, volume 8242 of {\em Lecture Notes in Computer
  Science}, Berlin, 2013. Springer-Verlag.

\bibitem{W67}
Ludwig Wittgenstein.
\newblock {\em Wittgenstein und der Wiener Kreis: Gespr{\"{a}}che aufgezeichnet
  von Friedrich Waismann}, volume~3.
\newblock Suhrkamp, 1967.

\bibitem{W71}
D.~R. Woodall.
\newblock Thrackles and deadlock.
\newblock In {\em Combinatorial {M}athematics and its {A}pplications ({P}roc.
  {C}onf., {O}xford, 1969)}, pages 335--347. Academic Press, London, 1971.

\bibitem{W93}
D.~R. Woodall.
\newblock Cyclic-order graphs and {Z}arankiewicz's crossing-number conjecture.
\newblock {\em J. Graph Theory}, 17(6):657--671, 1993.

\bibitem{WSP12}
Andreas Wotzlaw, Ewald Speckenmeyer, and Stefan Porschen.
\newblock Generalized {$k$}-ary tanglegrams on level graphs: A
  satisfiability-based approach and its evaluation.
\newblock {\em Discrete Appl. Math.}, 160(16-17):2349--2363, November 2012.

\bibitem{WRX11}
Yong~Xiang Wu, Han Ren, and Tu~Xu.
\newblock The crossing number of two-maps on orientable surfaces.
\newblock {\em J. Math. Res. Exposition}, 31(4):643--648, 2011.

\bibitem{Y86}
Mihalis Yannakakis.
\newblock Four pages are necessary and sufficient for planar graphs.
\newblock In {\em Proceedings of the eighteenth annual ACM symposium on Theory
  of computing}, STOC '86, pages 104--108, New York, NY, USA, 1986. ACM.

\bibitem{Y89}
Mihalis Yannakakis.
\newblock Embedding planar graphs in four pages.
\newblock {\em J. Comput. System Sci.}, 38(1):36--67, 1989.
\newblock 18th Annual ACM Symposium on Theory of Computing (Berkeley, CA,
  1986).

\bibitem{Z12}
Carol~T. Zamfirescu.
\newblock (2)-pancyclic graphs.
\newblock {\em Discrete Applied Mathematics}, 161(7–8):1128 -- 1136, 2013.

\bibitem{Z53}
K.~Zarankiewicz.
\newblock The solution of a certain problem on graphs of {P}. {T}uran.
\newblock {\em Bull. Acad. Polon. Sci. Cl. III.}, 1:167--168, 1953.

\bibitem{Z19}
Xin Zhang.
\newblock Upper bound on the sum of powers of the degrees of graphs with few
  crossings per edge.
\newblock {\em Appl. Math. Comput.}, 350:163--169, 2019.

\bibitem{ZB07}
Lanbo Zheng and Christoph Buchheim.
\newblock A new exact algorithm for the two-sided crossing minimization
  problem.
\newblock In Andreas Dress, Yinfeng Xu, and Binhai Zhu, editors, {\em
  Combinatorial Optimization and Applications}, volume 4616 of {\em Lecture
  Notes in Computer Science}, pages 301--310. Springer Berlin / Heidelberg,
  2007.

\end{thebibliography}
