% $ biblatex auxiliary file $
% $ biblatex bbl format version 2.5 $
% Do not modify the above lines!
%
% This is an auxiliary file used by the 'biblatex' package.
% This file may safely be deleted. It will be recreated by
% biber as required.
%
\begingroup
\makeatletter
\@ifundefined{ver@biblatex.sty}
  {\@latex@error
     {Missing 'biblatex' package}
     {The bibliography requires the 'biblatex' package.}
      \aftergroup\endinput}
  {}
\endgroup


\refsection{0}
  \sortlist{nty}{nty}
    \entry{AAFMRS13b}{article}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod}{}{}{}{}}%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{703441cc46fb09f6875c897bba8448ce}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1571-0653}
      \field{journaltitle}{Electronic Notes in Discrete Mathematics}
      \field{title}{More on the crossing number of ${K}_n$: Monotone drawings}
      \field{volume}{44}
      \field{year}{2013}
      \field{pages}{411\bibrangedash 414}
      \range{pages}{4}
      \verb{doi}
      \verb http://dx.doi.org/10.1016/j.endm.2013.10.064
      \endverb
      \verb{url}
      \verb http://www.sciencedirect.com/science/article/pii/S1571065313002801
      \endverb
    \endentry
    \entry{AAFMRS14}{article}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod}{}{}{}{}}%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{703441cc46fb09f6875c897bba8448ce}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{Shellable drawings and the cylindrical crossing number of {$K_n$}}
      \field{volume}{52}
      \field{year}{2014}
      \field{pages}{743\bibrangedash 753}
      \range{pages}{11}
      \verb{doi}
      \verb 10.1007/s00454-014-9635-0
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00454-014-9635-0
      \endverb
    \endentry
    \entry{AAFMRS13}{article}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{703441cc46fb09f6875c897bba8448ce}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{The 2-{P}age {C}rossing {N}umber of {$K_n$}}
      \field{volume}{49}
      \field{year}{2013}
      \field{pages}{747\bibrangedash 777}
      \range{pages}{31}
    \endentry
    \entry{ACFMLS12}{article}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=0aa3792e4ca1bd952333d8e1253d0d7f}{Cetina}{C\bibinitperiod}{Mario}{M\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=bd890a8f73b9a5c017b00099304025a1}{Lea\~{n}os}{L\bibinitperiod}{Jes\'{u}s}{J\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{4d9a4a07592f1882bc0566404a184fd9}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{1}
      \field{title}{On {$\leq k$}-edges, crossings, and halving lines of geometric drawings of {$K_n$}}
      \field{volume}{48}
      \field{year}{2012}
      \field{pages}{192\bibrangedash 215}
      \range{pages}{24}
      \verb{doi}
      \verb 10.1007/s00454-012-9403-y
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00454-012-9403-y
      \endverb
    \endentry
    \entry{ADFMLS16}{article}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod}{}{}{}{}}%
        {{hash=d2ca257d753e73e6bc23991df77e949b}{Dandurand}{D\bibinitperiod}{Julia}{J\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=0af90ca90c7cf5076414577ed4d7f098}{Lagoda}{L\bibinitperiod}{Evgeniya}{E\bibinitperiod}{}{}{}{}}%
        {{hash=029ab8525671c772bd8d94cb21c7b41c}{Sapozhnikov}{S\bibinitperiod}{Yakov}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{f2d37ec39365d02837c62bef4282c202}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{07}
      \field{note}{\arxiv{1607.00131} (last accessed 9/21/2017)}
      \field{title}{{Book crossing numbers of the complete graph and small local convex crossing numbers}}
      \field{year}{2016}
      \verb{eprint}
      \verb 1607.00131
      \endverb
      \keyw{Mathematics - Combinatorics,05C10,05C62,52C10,68R10}
    \endentry
    \entry{ADFMLSS17}{article}{}
      \name{author}{6}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod}{}{}{}{}}%
        {{hash=f3c9b25aea34a8cc63f7ece9a4f984d7}{Dondzila}{D\bibinitperiod}{Kory}{K\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=0af90ca90c7cf5076414577ed4d7f098}{Lagoda}{L\bibinitperiod}{Evgeniya}{E\bibinitperiod}{}{}{}{}}%
        {{hash=69fc666641fc24ad89ad6fbc6f2661b4}{Sajjadi}{S\bibinitperiod}{Seyed}{S\bibinitperiod}{}{}{}{}}%
        {{hash=029ab8525671c772bd8d94cb21c7b41c}{Sapozhnikov}{S\bibinitperiod}{Yakov}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{96a2f7246f49b4d35231550fe7cd6059}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Information Processing}
      \field{month}{08}
      \field{title}{On the Rectilinear Local Crossing Number of {$K_{m,n}$}}
      \field{volume}{25}
      \field{year}{2017}
      \field{pages}{542\bibrangedash 550}
      \range{pages}{9}
      \verb{doi}
      \verb 10.2197/ipsjjip.25.542
      \endverb
    \endentry
    \entry{AFM19}{incollection}{}
      \name{author}{2}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Tokyo University}%
      }
      \strng{namehash}{c93ef307887e11762ea27edbcf6b51b9}
      \strng{fullhash}{c93ef307887e11762ea27edbcf6b51b9}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Collection of Abstracts for the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG$^3$)}
      \field{note}{Available at \url{http://www.jcdcgg.u-tokai.ac.jp/JCDCG3_2019_abstracts_v1.pdf} (last accessed 4/6/2021)}
      \field{title}{On the convex crossing number}
      \field{year}{2019}
      \field{pages}{19\bibrangedash 20}
      \range{pages}{2}
    \endentry
    \entry{AFM17}{article}{}
      \name{author}{2}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c93ef307887e11762ea27edbcf6b51b9}
      \strng{fullhash}{c93ef307887e11762ea27edbcf6b51b9}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0097-3165}
      \field{journaltitle}{J. Combin. Theory Ser. A}
      \field{title}{The rectilinear local crossing number of {$K_n$}}
      \field{volume}{151}
      \field{year}{2017}
      \field{pages}{131\bibrangedash 145}
      \range{pages}{15}
      \verb{doi}
      \verb 10.1016/j.jcta.2017.04.003
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/j.jcta.2017.04.003
      \endverb
    \endentry
    \entry{AFMFMBR19}{incollection}{}
      \name{author}{5}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=c90bc40d5550eef8f682f973a91d1ef5}{Figueroa}{F\bibinitperiod}{A.\bibnamedelimi P.}{A\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=48932b246abda7261f3360e1673c2c56}{Montellano-Ballesteros}{M\bibinithyphendelim B\bibinitperiod}{J.\bibnamedelimi J.}{J\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=c50d3b856499c434fab1d23baa0b5e47}{Rivera-Campo}{R\bibinithyphendelim C\bibinitperiod}{E.}{E\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Tokyo University}%
      }
      \strng{namehash}{622b93996bbdfa6b80b717f750936a96}
      \strng{fullhash}{353327d08c39d881fed6f2196ba71447}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Collection of Abstracts for the 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG$^3$)}
      \field{note}{Available at \url{http://www.jcdcgg.u-tokai.ac.jp/JCDCG3_2019_abstracts_v1.pdf} (last accessed 4/6/2021)}
      \field{title}{Crossings in twisted graphs}
      \field{year}{2019}
      \field{pages}{21\bibrangedash 22}
      \range{pages}{2}
    \endentry
    \entry{AFMS12}{incollection}{}
      \name{author}{3}{}{%
        {{hash=88b4663facef8e133a439aa83a45ca60}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{46c7e8fe0447193d6f9d204ea3ce508f}
      \strng{fullhash}{46c7e8fe0447193d6f9d204ea3ce508f}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Thirty Essays on Geometric Graph Theory}
      \field{isbn}{978-1-4614-0109-4}
      \field{title}{The rectilinear crossing number of ${K}_n$: Closing in (or are we?)}
      \field{year}{2012}
      \field{pages}{563\bibrangedash 567}
      \range{pages}{5}
    \endentry
    \entry{AFMLR20}{article}{}
      \name{author}{4}{}{%
        {{hash=ec26eb5ffab8ec837efd88be0611f7f5}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo}{B\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=0af90ca90c7cf5076414577ed4d7f098}{Lagoda}{L\bibinitperiod}{Evgeniya}{E\bibinitperiod}{}{}{}{}}%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0a00b8a2e3a9833d858a2ae2c3533806}
      \strng{fullhash}{f56d9b41d6ad1bbf146124b16704215d}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{2}
      \field{title}{On the crossing number of 2-page book drawings of {$K_n$} with prescribed number of edges in each page}
      \field{volume}{36}
      \field{year}{2020}
      \field{pages}{303\bibrangedash 318}
      \range{pages}{16}
    \endentry
    \entry{AFMS20}{article}{}
      \name{author}{3}{}{%
        {{hash=ec26eb5ffab8ec837efd88be0611f7f5}{\'{A}brego}{\'{A}\bibinitperiod}{Bernardo}{B\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=cc1406b3ca29925013b54f73c04cd0fd}{Sparks}{S\bibinitperiod}{Athena}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0bc4fc13af485a78481e606be6ee8ef4}
      \strng{fullhash}{0bc4fc13af485a78481e606be6ee8ef4}
      \field{sortinit}{\'{A}}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{2}
      \field{title}{The bipartite-cylindrical crossing number of the complete bipartite graph}
      \field{volume}{36}
      \field{year}{2020}
      \field{pages}{205\bibrangedash 220}
      \range{pages}{16}
      \verb{doi}
      \verb 10.1007/s00373-019-02076-5
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00373-019-02076-5
      \endverb
    \endentry
    \entry{A19}{article}{}
      \name{author}{1}{}{%
        {{hash=e6f0c2549ea035fdec58d89007eff76b}{Ackerman}{A\bibinitperiod}{Eyal}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e6f0c2549ea035fdec58d89007eff76b}
      \strng{fullhash}{e6f0c2549ea035fdec58d89007eff76b}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{title}{On topological graphs with at most four crossings per edge}
      \field{volume}{85}
      \field{year}{2019}
      \field{pages}{101574\bibrangessep 31}
      \range{pages}{2}
      \verb{doi}
      \verb 10.1016/j.comgeo.2019.101574
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.comgeo.2019.101574
      \endverb
    \endentry
    \entry{AP13}{article}{}
      \name{author}{2}{}{%
        {{hash=e6f0c2549ea035fdec58d89007eff76b}{Ackerman}{A\bibinitperiod}{Eyal}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e57f9cc019f1abcfca1c3d29f71bd78a}{Pinchasi}{P\bibinitperiod}{Rom}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{796d10dd14b3c0e89e66a63e531fad88}
      \strng{fullhash}{796d10dd14b3c0e89e66a63e531fad88}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{3}
      \field{title}{On the degenerate crossing number}
      \field{volume}{49}
      \field{year}{2013}
      \field{pages}{695\bibrangedash 702}
      \range{pages}{8}
    \endentry
    \entry{AS14}{incollection}{}
      \name{author}{2}{}{%
        {{hash=e6f0c2549ea035fdec58d89007eff76b}{Ackerman}{A\bibinitperiod}{Eyal}{E\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=3023d2e116016c87f3dd1211296f75ab}{Duncan}{D\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=3839c51471c23b88caf43bd6728b939f}{Symvonis}{S\bibinitperiod}{Antonios}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer-Verlag}%
      }
      \strng{namehash}{c066bc2d29c41a9f23fc2b0bde244046}
      \strng{fullhash}{c066bc2d29c41a9f23fc2b0bde244046}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 22nd {I}nternational {S}ymposium ({GD}'14) {S}eptember 24--26, 2014}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{A crossing lemma for the pair-crossing number}
      \field{volume}{8871}
      \field{year}{2014}
      \field{pages}{222\bibrangedash 233}
      \range{pages}{12}
    \endentry
    \entry{AR04}{article}{}
      \name{author}{2}{}{%
        {{hash=a45dc414f18005f673a26bb1b9888d77}{Adamsson}{A\bibinitperiod}{Jay}{J\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e28d653273d166f0e1787991c7f645a9}
      \strng{fullhash}{e28d653273d166f0e1787991c7f645a9}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{Journal of Combinatorial Theory, Series B}
      \field{number}{1}
      \field{title}{Arrangements, circular arrangements and the crossing number of {$C_7 \times C_n$}}
      \field{volume}{90}
      \field{year}{2004}
      \field{pages}{21\bibrangedash 39}
      \range{pages}{19}
    \endentry
    \entry{AAPGCHLRNU16}{article}{}
      \name{author}{7}{}{%
        {{hash=8ea2d8712cb3a4050c8cf39fadc83cab}{{Aichholzer}}{A\bibinitperiod}{O.}{O\bibinitperiod}{}{}{}{}}%
        {{hash=77b53c187a327ac6c5d179c34434f54f}{{Araujo-Pardo}}{A\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
        {{hash=d1e6b9da7633dd91c2ebab6b77243b65}{{Garc\'{\i{}}a-Col\'{\i{}}n}}{G\bibinitperiod}{N.}{N\bibinitperiod}{}{}{}{}}%
        {{hash=af3208365e9464e4567fa1a412ef3af8}{{Hackl}}{H\bibinitperiod}{T.}{T\bibinitperiod}{}{}{}{}}%
        {{hash=75a7d5c90f665490ddaec7484fe40032}{{Lara}}{L\bibinitperiod}{D.}{D\bibinitperiod}{}{}{}{}}%
        {{hash=0722a99631a0219fb6f353cd808f7b46}{{Rubio-Montiel}}{R\bibinitperiod}{C.}{C\bibinitperiod}{}{}{}{}}%
        {{hash=7c0dc8b2042411cb57b6a61cbc20d517}{{Urrutia}}{U\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{319fe63ad4c84957842fa5ca2679ff8b}
      \strng{fullhash}{ef7dfaf892f2f3dbfd76f968abd8b1a0}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{2}
      \field{title}{Geometric achromatic and pseudoachromatic indices}
      \field{volume}{32}
      \field{year}{2016}
      \field{pages}{431\bibrangedash 451}
      \range{pages}{21}
      \verb{doi}
      \verb 10.1007/s00373-015-1610-x
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00373-015-1610-x
      \endverb
    \endentry
    \entry{A13}{misc}{}
      \name{author}{1}{}{%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{9587ccf5d366d31ef307ad94be451c86}
      \strng{fullhash}{9587ccf5d366d31ef307ad94be451c86}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Summary of results at \url{http://www.ist.tugraz.at/staff/aichholzer/research/rp/triangulations/crossing/} (last accessed 9/21/2017)}
      \field{title}{On the Rectilinear Crossing Number}
    \endentry
    \entry{ADFMGQH20}{article}{}
      \name{author}{5}{}{%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=33489a30bb8428b2d858e62e41f57b05}{Duque}{D\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=efca33c63198cd7a50a4a3c3455479de}{Fabila-Monroy}{F\bibinithyphendelim M\bibinitperiod}{Ruy}{R\bibinitperiod}{}{}{}{}}%
        {{hash=b31c0d790640cd9ae41471691a9a84fd}{Garc\'{\i{}}a-Quintero}{G\bibinithyphendelim Q\bibinitperiod}{Oscar\bibnamedelima E.}{O\bibinitperiod\bibinitdelim E\bibinitperiod}{}{}{}{}}%
        {{hash=42b5e1b5451732b7ee89db8e68557f71}{Hidalgo-Toscano}{H\bibinithyphendelim T\bibinitperiod}{Carlos}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f4842932eb058697948b50ae5ab6cd8d}
      \strng{fullhash}{d5080ce63861f789038cb0c5bfc0c5a3}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{3}
      \field{title}{An ongoing project to improve the rectilinear and the pseudolinear crossing constants}
      \field{volume}{24}
      \field{year}{2020}
      \field{pages}{421\bibrangedash 432}
      \range{pages}{12}
      \verb{doi}
      \verb 10.7155/jgaa.00540
      \endverb
      \verb{url}
      \verb https://doi.org/10.7155/jgaa.00540
      \endverb
    \endentry
    \entry{AFMFHTPVZ19b}{inproceedings}{}
      \name{author}{7}{}{%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=efca33c63198cd7a50a4a3c3455479de}{Fabila-Monroy}{F\bibinithyphendelim M\bibinitperiod}{Ruy}{R\bibinitperiod}{}{}{}{}}%
        {{hash=326680290e0c0b99226a7c6c5525379e}{Fuchs}{F\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
        {{hash=42b5e1b5451732b7ee89db8e68557f71}{Hidalgo-Toscano}{H\bibinithyphendelim T\bibinitperiod}{Carlos}{C\bibinitperiod}{}{}{}{}}%
        {{hash=1fbdb2b64c79ea245aec6061b3fe0a30}{Parada}{P\bibinitperiod}{Irene}{I\bibinitperiod}{}{}{}{}}%
        {{hash=74b26b9799625f7bbad994391b38d433}{Vogtenhuber}{V\bibinitperiod}{Birgit}{B\bibinitperiod}{}{}{}{}}%
        {{hash=0434b9b288f88f6e58861dc4f812debb}{Zaragoza}{Z\bibinitperiod}{Francisco}{F\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=58dc474a1a65276a2a818af139e0964f}{Archambault}{A\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=aae880d79266219814a56d27fd81777c}{T\'{o}th}{T\bibinitperiod}{Csaba\bibnamedelima D.}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{f4842932eb058697948b50ae5ab6cd8d}
      \strng{fullhash}{bc75c6b62702e7aa8c4bcf7c948696e3}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing and Network Visualization}
      \field{isbn}{978-3-030-35802-0}
      \field{title}{On the 2-Colored Crossing Number}
      \field{year}{2019}
      \field{pages}{87\bibrangedash 100}
      \range{pages}{14}
    \endentry
    \entry{AOR06}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=9587ccf5d366d31ef307ad94be451c86}{Aichholzer}{A\bibinitperiod}{Oswin}{O\bibinitperiod}{}{}{}{}}%
        {{hash=a6eaf9ac74e6e883638732f333edc7d9}{Orden}{O\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=2e54b269975d8b5dab5d72524149d15e}{Ramos}{R\bibinitperiod}{Pedro\bibnamedelima A}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{285ea61e247512898b6299775984096e}
      \strng{fullhash}{285ea61e247512898b6299775984096e}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proc. 22nd European Workshop on Computational Geometry EuroCG}
      \field{title}{On the structure of sets attaining the rectilinear crossing number}
      \field{volume}{6}
      \field{year}{2006}
      \field{pages}{43\bibrangedash 46}
      \range{pages}{4}
    \endentry
    \entry{ACNS82}{incollection}{}
      \name{author}{4}{}{%
        {{hash=b17dabe05a326b574386ff265d0ab849}{Ajtai}{A\bibinitperiod}{M.}{M\bibinitperiod}{}{}{}{}}%
        {{hash=fb63af860c8349a88e09481a7acffdfa}{Chv\'{a}tal}{C\bibinitperiod}{V.}{V\bibinitperiod}{}{}{}{}}%
        {{hash=110a21d3057f69599967bda4d54a0b6c}{Newborn}{N\bibinitperiod}{M.\bibnamedelimi M.}{M\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=03c8f768b372b021d0fa237c0df576bb}{Szemer\'{e}di}{S\bibinitperiod}{E.}{E\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Amsterdam}%
      }
      \list{publisher}{1}{%
        {North-Holland}%
      }
      \strng{namehash}{fc6d3d4f20838af6f5d4146fe2f87bd4}
      \strng{fullhash}{36dcb07c94e77348e19d7f9ab69bcd95}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Theory and practice of combinatorics}
      \field{series}{North-Holland Math. Stud.}
      \field{title}{Crossing-free subgraphs}
      \field{volume}{60}
      \field{year}{1982}
      \field{pages}{9\bibrangedash 12}
      \range{pages}{4}
    \endentry
    \entry{AFP16}{incollection}{}
      \name{author}{3}{}{%
        {{hash=9d9fd66afdeccc3a4c569a42e147c7f8}{Alam}{A\bibinitperiod}{Md.\bibnamedelimi Jawaherul}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=85f84740d637f4a8a002e1edf639165e}{Fink}{F\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=5ab199a65487e55d374000d386c01a78}{Pupyrev}{P\bibinitperiod}{Sergey}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{7c9750cdfa9a36f7548a2c0a14dcfb36}
      \strng{fullhash}{7c9750cdfa9a36f7548a2c0a14dcfb36}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing and network visualization}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{The bundled crossing number}
      \field{volume}{9801}
      \field{year}{2016}
      \field{pages}{399\bibrangedash 412}
      \range{pages}{14}
    \endentry
    \entry{A08}{article}{}
      \name{author}{1}{}{%
        {{hash=0ebbb02961e645ca56846ec01d17e8ac}{Albertson}{A\bibinitperiod}{Michael\bibnamedelima O.}{M\bibinitperiod\bibinitdelim O\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0ebbb02961e645ca56846ec01d17e8ac}
      \strng{fullhash}{0ebbb02961e645ca56846ec01d17e8ac}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1855-3966}
      \field{journaltitle}{Ars Math. Contemp.}
      \field{number}{1}
      \field{title}{Chromatic number, independence ratio, and crossing number}
      \field{volume}{1}
      \field{year}{2008}
      \field{pages}{1\bibrangedash 6}
      \range{pages}{6}
    \endentry
    \entry{ACF09}{article}{}
      \name{author}{3}{}{%
        {{hash=0ebbb02961e645ca56846ec01d17e8ac}{Albertson}{A\bibinitperiod}{Michael\bibnamedelima O.}{M\bibinitperiod\bibinitdelim O\bibinitperiod}{}{}{}{}}%
        {{hash=65e4edbef3df32f9ac3ec6ee63921220}{Cranston}{C\bibinitperiod}{Daniel\bibnamedelima W.}{D\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
        {{hash=3f0a67a902c8bcd7eb3fbad276c47365}{Fox}{F\bibinitperiod}{Jacob}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{68a41649fc381eb60afc12401206fe9a}
      \strng{fullhash}{68a41649fc381eb60afc12401206fe9a}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-8926}
      \field{journaltitle}{Electron. J. Combin.}
      \field{number}{1}
      \field{title}{Crossings, colorings, and cliques}
      \field{volume}{16}
      \field{year}{2009}
      \field{pages}{Research Paper 45}
      \range{pages}{-1}
    \endentry
    \entry{APMF20}{article}{}
      \name{author}{3}{}{%
        {{hash=aef5f6fb60473018c827b0bd91d85265}{Alemany-Puig}{A\bibinithyphendelim P\bibinitperiod}{Llu\'{\i{}}s}{L\bibinitperiod}{}{}{}{}}%
        {{hash=cdbb080241ee2937b7193a65f7bf1a06}{Mora}{M\bibinitperiod}{Merc\`{e}}{M\bibinitperiod}{}{}{}{}}%
        {{hash=64a53b7568ffa080b6712e42ea96301f}{Ferrer-i-Cancho}{F\bibinithyphendelim i\bibinithyphendelim C\bibinitperiod}{Ramon}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ad90573bbf401789c2419d8337b44164}
      \strng{fullhash}{ad90573bbf401789c2419d8337b44164}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2003.03353} (last accessed 11/24/2020)}
      \field{title}{Reappraising the distribution of the number of edge crossings of graphs on a sphere}
      \field{year}{2020}
      \verb{eprint}
      \verb 2003.03353
      \endverb
    \endentry
    \entry{AADM18}{article}{}
      \name{author}{4}{}{%
        {{hash=5aa0f3f6a571845745ac7ac7a7743fa2}{Alfaro}{A\bibinitperiod}{Carlos\bibnamedelima A.}{C\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=9cf3d2482ddde2ed01ed21e49b5c07fb}{Arroyo}{A\bibinitperiod}{Alan}{A\bibinitperiod}{}{}{}{}}%
        {{hash=0332c0f921e557d0bb7f60352bece538}{Der\v{n}\'{a}r}{D\bibinitperiod}{Marek}{M\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{acb40f51dd53451cec62e0d4d27f074a}
      \strng{fullhash}{caf9a0ac89fcf5ed2ae4d01605bb34c4}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{3}
      \field{title}{The crossing number of the cone of a graph}
      \field{volume}{32}
      \field{year}{2018}
      \field{pages}{2080\bibrangedash 2093}
      \range{pages}{14}
      \verb{doi}
      \verb 10.1137/17M1115320
      \endverb
      \verb{url}
      \verb https://doi.org/10.1137/17M1115320
      \endverb
    \endentry
    \entry{A00}{article}{}
      \name{author}{1}{}{%
        {{hash=f7a4a7818d41bcfdc8addc9e20cdcbd8}{Alon}{A\bibinitperiod}{Noga}{N\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f7a4a7818d41bcfdc8addc9e20cdcbd8}
      \strng{fullhash}{f7a4a7818d41bcfdc8addc9e20cdcbd8}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1016-443X}
      \field{journaltitle}{Geom. Funct. Anal.}
      \field{note}{GAFA 2000 (Tel Aviv, 1999)}
      \field{title}{Algebraic and probabilistic methods in discrete mathematics}
      \field{volume}{Special Volume, Part II}
      \field{year}{2000}
      \field{pages}{455\bibrangedash 470}
      \range{pages}{16}
    \endentry
    \entry{ABFH12}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=671a8cc74b7ee92e90729e7b728369d2}{Alpert}{A\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
        {{hash=19fc6fe46524c35d27f4fcc492b37bc4}{Bode}{B\bibinitperiod}{Jens-P.}{J\bibinithyphendelim P\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{130c8a822c45843513bdbb47b73573c5}
      \strng{fullhash}{f5d5fc269bf3fa5810b015296314d200}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}orty-{T}hird {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The minimum of the maximum rectilinear crossing numbers of small cubic graphs}
      \field{volume}{214}
      \field{year}{2012}
      \field{pages}{187\bibrangedash 197}
      \range{pages}{11}
    \endentry
    \entry{AFH09}{article}{}
      \name{author}{3}{}{%
        {{hash=671a8cc74b7ee92e90729e7b728369d2}{Alpert}{A\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a3ebbec8420d0e8d2ddcb4da30165b8b}
      \strng{fullhash}{a3ebbec8420d0e8d2ddcb4da30165b8b}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-8926}
      \field{journaltitle}{Electron. J. Combin.}
      \field{number}{1}
      \field{title}{The maximum of the maximum rectilinear crossing numbers of {$d$}-regular graphs of order {$n$}}
      \field{volume}{16}
      \field{year}{2009}
      \field{pages}{Research Paper 54}
      \range{pages}{-1}
    \endentry
    \entry{AFHK09}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=671a8cc74b7ee92e90729e7b728369d2}{Alpert}{A\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=aa8ee4772ad592a64c95bcfd71ec6096}{Klein}{K\bibinitperiod}{Sheldon}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{130c8a822c45843513bdbb47b73573c5}
      \strng{fullhash}{1cf7cfc101b1db59a03afbcb036f7cd4}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}ortieth {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The maximum rectilinear crossing number of the {$n$} dimensional cube graph}
      \field{volume}{195}
      \field{year}{2009}
      \field{pages}{147\bibrangedash 158}
      \range{pages}{12}
    \endentry
    \entry{AFI11}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=671a8cc74b7ee92e90729e7b728369d2}{Alpert}{A\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=a39ee67f53d5c3def0d25b2570b1bcb5}{Isseroff}{I\bibinitperiod}{Yehuda}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{097766e633f8b4910a424c35273fc899}
      \strng{fullhash}{097766e633f8b4910a424c35273fc899}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}orty-{S}econd {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The maximum rectilinear crossing number of generalized wheel graphs}
      \field{volume}{209}
      \field{year}{2011}
      \field{pages}{33\bibrangedash 46}
      \range{pages}{14}
    \endentry
    \entry{ABKS20}{article}{}
      \name{author}{4}{}{%
        {{hash=4259398955b405dd29f826122a4c7575}{Angelini}{A\bibinitperiod}{Patrizio}{P\bibinitperiod}{}{}{}{}}%
        {{hash=a72aa002a82c1ac2f7e33776b9f69912}{Bekos}{B\bibinitperiod}{Michael\bibnamedelima A.}{M\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d21e642f9bb7c290f6027bc948364c34}{Schneck}{S\bibinitperiod}{Thomas}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8bc0afb4c47849f5915b3c9f9c2f704f}
      \strng{fullhash}{9085ca34e94d99ea2260fd99f32fc63f}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Graph Algorithms and Applications}
      \field{number}{4}
      \field{title}{Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity}
      \field{volume}{24}
      \field{year}{2020}
      \field{pages}{573\bibrangedash 601}
      \range{pages}{29}
      \verb{doi}
      \verb 10.7155/jgaa.00531
      \endverb
    \endentry
    \entry{ADLDBFMR15}{article}{}
      \name{author}{6}{}{%
        {{hash=4259398955b405dd29f826122a4c7575}{Angelini}{A\bibinitperiod}{Patrizio}{P\bibinitperiod}{}{}{}{}}%
        {{hash=fa5ac2cff647f99df68503c7a325cfc8}{Da\bibnamedelima Lozzo}{D\bibinitperiod\bibinitdelim L\bibinitperiod}{Giordano}{G\bibinitperiod}{}{}{}{}}%
        {{hash=3c61c372f07400c4c0d39a760d0ed16f}{Di\bibnamedelima Battista}{D\bibinitperiod\bibinitdelim B\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=ecc048123c454e371e2a99677d54ec4d}{Frati}{F\bibinitperiod}{Fabrizio}{F\bibinitperiod}{}{}{}{}}%
        {{hash=c443f4519e06a4a6cd62fca1a19d92ec}{Patrignani}{P\bibinitperiod}{Maurizio}{M\bibinitperiod}{}{}{}{}}%
        {{hash=6826e07ba03f396eb171b68583e45337}{Roselli}{R\bibinitperiod}{Vincenzo}{V\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8bc0afb4c47849f5915b3c9f9c2f704f}
      \strng{fullhash}{6bd4adf6eb4a5edc978f4aaca9a7dad9}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{number}{2}
      \field{title}{Relaxing the constraints of clustered planarity}
      \field{volume}{48}
      \field{year}{2015}
      \field{pages}{42\bibrangedash 75}
      \range{pages}{34}
      \verb{doi}
      \verb 10.1016/j.comgeo.2014.08.001
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/j.comgeo.2014.08.001
      \endverb
    \endentry
    \entry{ADLFS20}{article}{}
      \name{author}{4}{}{%
        {{hash=4259398955b405dd29f826122a4c7575}{Angelini}{A\bibinitperiod}{Patrizio}{P\bibinitperiod}{}{}{}{}}%
        {{hash=fa5ac2cff647f99df68503c7a325cfc8}{Da\bibnamedelima Lozzo}{D\bibinitperiod\bibinitdelim L\bibinitperiod}{Giordano}{G\bibinitperiod}{}{}{}{}}%
        {{hash=fe3dd2427bc2d9b812d78bae1cd0f855}{F\"{o}rster}{F\bibinitperiod}{Henry}{H\bibinitperiod}{}{}{}{}}%
        {{hash=d21e642f9bb7c290f6027bc948364c34}{Schneck}{S\bibinitperiod}{Thomas}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8bc0afb4c47849f5915b3c9f9c2f704f}
      \strng{fullhash}{807c88c0f1749ff0946be6d6a6a41186}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.DM}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2008.09329} (last accessed 1/7/2021)}
      \field{title}{$2$-Layer $k$-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth}
      \field{year}{2020}
      \verb{eprint}
      \verb 2008.09329
      \endverb
    \endentry
    \entry{ABFJKPR10}{inproceedings}{}
      \name{author}{7}{}{%
        {{hash=4259398955b405dd29f826122a4c7575}{Angelini}{A\bibinitperiod}{Patrizio}{P\bibinitperiod}{}{}{}{}}%
        {{hash=3c61c372f07400c4c0d39a760d0ed16f}{Di\bibnamedelima Battista}{D\bibinitperiod\bibinitdelim B\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=ecc048123c454e371e2a99677d54ec4d}{Frati}{F\bibinitperiod}{Fabrizio}{F\bibinitperiod}{}{}{}{}}%
        {{hash=3129a0271b78d8633893f78a1e98122b}{Jel\'{\i{}}nek}{J\bibinitperiod}{V\'{\i{}}t}{V\bibinitperiod}{}{}{}{}}%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c443f4519e06a4a6cd62fca1a19d92ec}{Patrignani}{P\bibinitperiod}{Maurizio}{M\bibinitperiod}{}{}{}{}}%
        {{hash=33140dd44f57dc4a8e11a32a9a9a9f1d}{Rutter}{R\bibinitperiod}{Ignaz}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Austin, Texas}%
      }
      \list{publisher}{2}{%
        {Society for Industrial}%
        {Applied Mathematics}%
      }
      \strng{namehash}{8bc0afb4c47849f5915b3c9f9c2f704f}
      \strng{fullhash}{0ff42d135fd6b63055d03f74f6ac3f4a}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}
      \field{isbn}{978-0-898716-98-6}
      \field{series}{SODA '10}
      \field{title}{Testing planarity of partially embedded graphs}
      \field{year}{2010}
      \field{pages}{202\bibrangedash 221}
      \range{pages}{20}
    \endentry
    \entry{AGKN12}{article}{}
      \name{author}{4}{}{%
        {{hash=4259398955b405dd29f826122a4c7575}{Angelini}{A\bibinitperiod}{Patrizio}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f484c7eccbb2dede4e7d95d7682ac3e6}{Geyer}{G\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d22b8874dc650afee4999362d8e09290}{Neuwirth}{N\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8bc0afb4c47849f5915b3c9f9c2f704f}
      \strng{fullhash}{b65caf7336ec3633d32e94c2aa74448c}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{On a tree and a path with no geometric simultaneous embedding}
      \field{volume}{16}
      \field{year}{2012}
      \field{pages}{37\bibrangedash 83}
      \range{pages}{47}
    \endentry
    \entry{AGSV17}{article}{}
      \name{author}{4}{}{%
        {{hash=bc47228a2e33549728eb4b07e94f9c86}{Anshu}{A\bibinitperiod}{Anurag}{A\bibinitperiod}{}{}{}{}}%
        {{hash=2c64529248d25a2be5528711ab370c4b}{Gangopadhyay}{G\bibinitperiod}{Rahul}{R\bibinitperiod}{}{}{}{}}%
        {{hash=34445e70b8ad904ce8caeff84a87190d}{Shannigrahi}{S\bibinitperiod}{Saswata}{S\bibinitperiod}{}{}{}{}}%
        {{hash=d874dd4a70ec3a1e279dfb08389f5f66}{Vusirikala}{V\bibinitperiod}{Satyanarayana}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5a38c52fe9541cc698c422414843959e}
      \strng{fullhash}{6fa950779d3e719008ab3e654a38b91c}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{title}{On the rectilinear crossing number of complete uniform hypergraphs}
      \field{volume}{61}
      \field{year}{2017}
      \field{pages}{38\bibrangedash 47}
      \range{pages}{10}
      \verb{doi}
      \verb 10.1016/j.comgeo.2016.11.001
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/j.comgeo.2016.11.001
      \endverb
    \endentry
    \entry{AS15}{article}{}
      \name{author}{2}{}{%
        {{hash=bc47228a2e33549728eb4b07e94f9c86}{Anshu}{A\bibinitperiod}{Anurag}{A\bibinitperiod}{}{}{}{}}%
        {{hash=34445e70b8ad904ce8caeff84a87190d}{Shannigrahi}{S\bibinitperiod}{Saswata}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c52ddf85c8f4ce40e1a5be57ef338aaa}
      \strng{fullhash}{c52ddf85c8f4ce40e1a5be57ef338aaa}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{title}{A lower bound on the crossing number of uniform hypergraphs}
      \field{volume}{209}
      \field{year}{2016}
      \field{pages}{11\bibrangedash 15}
      \range{pages}{5}
      \verb{doi}
      \verb 10.1016/j.dam.2015.10.009
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.dam.2015.10.009
      \endverb
    \endentry
    \entry{A09}{incollection}{}
      \name{author}{1}{}{%
        {{hash=52618efe59948a5751ee0f91b540c69f}{Archdeacon}{A\bibinitperiod}{Dan}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cambridge}%
      }
      \list{publisher}{1}{%
        {Cambridge Univ. Press}%
      }
      \strng{namehash}{52618efe59948a5751ee0f91b540c69f}
      \strng{fullhash}{52618efe59948a5751ee0f91b540c69f}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Topics in topological graph theory}
      \field{series}{Encyclopedia Math. Appl.}
      \field{title}{Open problems}
      \field{volume}{128}
      \field{year}{2009}
      \field{pages}{313\bibrangedash 336}
      \range{pages}{24}
    \endentry
    \entry{AB01}{article}{}
      \name{author}{2}{}{%
        {{hash=52618efe59948a5751ee0f91b540c69f}{Archdeacon}{A\bibinitperiod}{Dan}{D\bibinitperiod}{}{}{}{}}%
        {{hash=ff52f4fbd5ff0ea96f2278ae23d8c738}{Bonnington}{B\bibinitperiod}{C.\bibnamedelimi Paul}{C\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0d09fc3c5f53d0d5b8feb90aaeb4a036}
      \strng{fullhash}{0d09fc3c5f53d0d5b8feb90aaeb4a036}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{4}
      \field{title}{Two maps on one surface}
      \field{volume}{36}
      \field{year}{2001}
      \field{pages}{198\bibrangedash 216}
      \range{pages}{19}
    \endentry
    \entry{ABKS10}{article}{}
      \name{author}{4}{}{%
        {{hash=fd76234ff3b41957fc42e2e4c546f56e}{Argyriou}{A\bibinitperiod}{Evmorfia}{E\bibinitperiod}{}{}{}{}}%
        {{hash=a72aa002a82c1ac2f7e33776b9f69912}{Bekos}{B\bibinitperiod}{Michael\bibnamedelima A.}{M\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=3839c51471c23b88caf43bd6728b939f}{Symvonis}{S\bibinitperiod}{Antonios}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bb52fc053c9974f2a7dc15003285de5b}
      \strng{fullhash}{e8127f5ff5184a03d519e7486d040847}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{On metro-line crossing minimization}
      \field{volume}{14}
      \field{year}{2010}
      \field{pages}{75\bibrangedash 96}
      \range{pages}{22}
    \endentry
    \entry{ABS11}{incollection}{}
      \name{author}{3}{}{%
        {{hash=fd76234ff3b41957fc42e2e4c546f56e}{Argyriou}{A\bibinitperiod}{Evmorfia}{E\bibinitperiod}{}{}{}{}}%
        {{hash=494cbc8760edd9d2e32fbaffa6d4b821}{Bekos}{B\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=3839c51471c23b88caf43bd6728b939f}{Symvonis}{S\bibinitperiod}{Antonios}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{39a91888d9feadbfe8becedc54a406bc}
      \strng{fullhash}{39a91888d9feadbfe8becedc54a406bc}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{SOFSEM 2011: Theory and Practice of Computer Science}
      \field{isbn}{978-3-642-18380-5}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{The Straight-Line {RAC} Drawing Problem Is {NP}-Hard}
      \field{volume}{6543}
      \field{year}{2011}
      \field{pages}{74\bibrangedash 85}
      \range{pages}{12}
    \endentry
    \entry{A96}{book}{}
      \name{author}{1}{}{%
        {{hash=cfdc747ff0e1d83b3baade50df906a84}{Arnold}{A\bibinitperiod}{Englebert}{E\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{cfdc747ff0e1d83b3baade50df906a84}
      \strng{fullhash}{cfdc747ff0e1d83b3baade50df906a84}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{2nd edition}
      \field{title}{Die Ankerwicklungen und Ankerkonstruktionen der Gleichstrom-Dynamomaschinen}
      \field{year}{1896}
      \field{pages}{312}
      \range{pages}{1}
    \endentry
    \entry{AKPSVW20}{inproceedings}{}
      \name{author}{6}{}{%
        {{hash=9cf3d2482ddde2ed01ed21e49b5c07fb}{Arroyo}{A\bibinitperiod}{Alan}{A\bibinitperiod}{}{}{}{}}%
        {{hash=ad5d9b03edeb04aeefa3737c87fae389}{Klute}{K\bibinitperiod}{Fabian}{F\bibinitperiod}{}{}{}{}}%
        {{hash=1fbdb2b64c79ea245aec6061b3fe0a30}{Parada}{P\bibinitperiod}{Irene}{I\bibinitperiod}{}{}{}{}}%
        {{hash=a4a5b6c2d262f13d8643e8717dbaa686}{Seidel}{S\bibinitperiod}{Raimund}{R\bibinitperiod}{}{}{}{}}%
        {{hash=74b26b9799625f7bbad994391b38d433}{Vogtenhuber}{V\bibinitperiod}{Birgit}{B\bibinitperiod}{}{}{}{}}%
        {{hash=785942b72b3a52582f36b671f820d879}{Wiedera}{W\bibinitperiod}{Tilo}{T\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=9bae01793b8c4b97b52d0f201985d56c}{Adler}{A\bibinitperiod}{Isolde}{I\bibinitperiod}{}{}{}{}}%
        {{hash=133396be31f93a72d34e147d8ce579b2}{M\"{u}ller}{M\bibinitperiod}{Haiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{5f28bb2efd86e81f5d7db85ff29e98c8}
      \strng{fullhash}{4270aa83d69b4d6b9e6ce9c3b2c92491}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph-Theoretic Concepts in Computer Science}
      \field{isbn}{978-3-030-60440-0}
      \field{title}{Inserting One Edge into a Simple Drawing Is Hard}
      \field{year}{2020}
      \field{pages}{325\bibrangedash 338}
      \range{pages}{14}
    \endentry
    \entry{AMcQRSS20}{article}{}
      \name{author}{5}{}{%
        {{hash=9cf3d2482ddde2ed01ed21e49b5c07fb}{Arroyo}{A\bibinitperiod}{Alan}{A\bibinitperiod}{}{}{}{}}%
        {{hash=073efaf80a8e361fa3066607b3af0da9}{McQuillan}{M\bibinitperiod}{Dan}{D\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
        {{hash=cbd4ba1f56ac972fdd7afe80cfaa48a7}{Sullivan}{S\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5f28bb2efd86e81f5d7db85ff29e98c8}
      \strng{fullhash}{499c9aedcc4dca97465724d65464c27a}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2002.02287} (last accessed 5/11/2020)}
      \field{title}{Drawings of complete graphs in the projective plane}
      \field{year}{2020}
      \verb{eprint}
      \verb 2002.02287
      \endverb
    \endentry
    \entry{ARS20}{article}{}
      \name{author}{3}{}{%
        {{hash=9cf3d2482ddde2ed01ed21e49b5c07fb}{Arroyo}{A\bibinitperiod}{Alan}{A\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=24710ab4968f884065a1a3f392e4c6f8}{Sunohara}{S\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4de6ce207543d97b67b682313fefbad6}
      \strng{fullhash}{4de6ce207543d97b67b682313fefbad6}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2001.06053} (last accessed 5/13/2020)}
      \field{title}{Extending drawings of complete graphs into arrangements of pseudocircles}
      \field{year}{2020}
      \verb{eprint}
      \verb 2001.06053
      \endverb
    \endentry
    \entry{A86}{article}{}
      \name{author}{1}{}{%
        {{hash=1df5399b96ff36847c7e7a23d9f09b74}{Asano}{A\bibinitperiod}{Kouhei}{K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1df5399b96ff36847c7e7a23d9f09b74}
      \strng{fullhash}{1df5399b96ff36847c7e7a23d9f09b74}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{1}
      \field{title}{The crossing number of {$K_{1,3,n}$} and {$K_{2,3,n}$}}
      \field{volume}{10}
      \field{year}{1986}
      \field{pages}{1\bibrangedash 8}
      \range{pages}{8}
    \endentry
    \entry{A06}{book}{}
      \name{author}{1}{}{%
        {{hash=2f3f341ec747337ddc7a4d6d7fd54e94}{Ashlock}{A\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{2f3f341ec747337ddc7a4d6d7fd54e94}
      \strng{fullhash}{2f3f341ec747337ddc7a4d6d7fd54e94}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{978-0387-22196-0; 0-387-22196-4}
      \field{title}{Evolutionary computation for modeling and optimization}
      \field{year}{2006}
      \field{pages}{xx+571}
      \range{pages}{-1}
    \endentry
    \entry{ACCCHSSTW19}{article}{}
      \name{author}{9}{}{%
        {{hash=c8d845fe1fb81b5e3e1016bcb734fbf5}{Asplund}{A\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=74bf7219d5b473601c56a4feb5fbcc33}{Clark}{C\bibinitperiod}{Gregory}{G\bibinitperiod}{}{}{}{}}%
        {{hash=485e6db75f44b139bf9de42bc97aec2e}{Cochran}{C\bibinitperiod}{Garner}{G\bibinitperiod}{}{}{}{}}%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=d8af7d757a4aceb04fd3c87aeafcf91b}{Hamm}{H\bibinitperiod}{Arran}{A\bibinitperiod}{}{}{}{}}%
        {{hash=ae3b79ec3dd1927c37617c53502bb155}{Spencer}{S\bibinitperiod}{Gwen}{G\bibinitperiod}{}{}{}{}}%
        {{hash=ed5de9cf9fdcce9422e3fdb9a6bb63e4}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}}{L\bibinitperiod}{}{}{}{}}%
        {{hash=2a4c0621661be1a4f3a87cc22b88dc37}{Taylor}{T\bibinitperiod}{Libby}{L\bibinitperiod}{}{}{}{}}%
        {{hash=553a56dd8a2fea57403873c192fc465d}{Wang}{W\bibinitperiod}{Zhiyu}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{11294b4490e5fe4a517de3433235b50e}
      \strng{fullhash}{2e223e0b056f4dd042de2870d09396a9}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1063-8539}
      \field{journaltitle}{J. Combin. Des.}
      \field{number}{10}
      \field{title}{Using block designs in crossing number bounds}
      \field{volume}{27}
      \field{year}{2019}
      \field{pages}{586\bibrangedash 597}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1002/jcd.21665
      \endverb
      \verb{url}
      \verb https://doi.org/10.1002/jcd.21665
      \endverb
    \endentry
    \entry{ADHJ19}{article}{}
      \name{author}{4}{}{%
        {{hash=c8d845fe1fb81b5e3e1016bcb734fbf5}{Asplund}{A\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=461dc04aa172fd410cf8476268d9b569}{Do}{D\bibinitperiod}{Thao}{T\bibinitperiod}{}{}{}{}}%
        {{hash=d8af7d757a4aceb04fd3c87aeafcf91b}{Hamm}{H\bibinitperiod}{Arran}{A\bibinitperiod}{}{}{}{}}%
        {{hash=785a42f9ff7ceba148108cffcf218fb8}{Jain}{J\bibinitperiod}{Vishesh}{V\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{11294b4490e5fe4a517de3433235b50e}
      \strng{fullhash}{a62c6b5c113aee8b6f73069a25897fc3}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{4}
      \field{title}{On the {$k$}-planar local crossing number}
      \field{volume}{342}
      \field{year}{2019}
      \field{pages}{927\bibrangedash 933}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1016/j.disc.2018.11.020
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.disc.2018.11.020
      \endverb
    \endentry
    \entry{ADHSTW18}{article}{}
      \name{author}{6}{}{%
        {{hash=c8d845fe1fb81b5e3e1016bcb734fbf5}{Asplund}{A\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=461dc04aa172fd410cf8476268d9b569}{Do}{D\bibinitperiod}{Thao}{T\bibinitperiod}{}{}{}{}}%
        {{hash=d8af7d757a4aceb04fd3c87aeafcf91b}{Hamm}{H\bibinitperiod}{Arran}{A\bibinitperiod}{}{}{}{}}%
        {{hash=ed5de9cf9fdcce9422e3fdb9a6bb63e4}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}}{L\bibinitperiod}{}{}{}{}}%
        {{hash=2a4c0621661be1a4f3a87cc22b88dc37}{Taylor}{T\bibinitperiod}{Libby}{L\bibinitperiod}{}{}{}{}}%
        {{hash=553a56dd8a2fea57403873c192fc465d}{Wang}{W\bibinitperiod}{Zhiyu}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{11294b4490e5fe4a517de3433235b50e}
      \strng{fullhash}{2e81249c18b61acc20531408318e5426}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{title}{{$k$}-planar crossing number of random graphs and random regular graphs}
      \field{volume}{247}
      \field{year}{2018}
      \field{pages}{419\bibrangedash 422}
      \range{pages}{4}
      \verb{doi}
      \verb 10.1016/j.dam.2018.04.007
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.dam.2018.04.007
      \endverb
    \endentry
    \entry{AB10}{book}{}
      \name{editor}{2}{}{%
        {{hash=f71a2fe19d89b8b34d14f35bcb2e71d3}{Atallah}{A\bibinitperiod}{Mikhail\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=47752ad1b58c191e30b0f3500ff4eca9}{Blanton}{B\bibinitperiod}{Marina}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Boca Raton, FL}%
      }
      \list{publisher}{1}{%
        {CRC Press}%
      }
      \strng{namehash}{a45e9053f0569d399640e7fc85b110b0}
      \strng{fullhash}{a45e9053f0569d399640e7fc85b110b0}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{edition}{Second}
      \field{isbn}{978-1-58488-820-8}
      \field{series}{Chapman \& Hall/CRC Applied Algorithms and Data Structures Series}
      \field{title}{Algorithms and theory of computation handbook}
      \field{year}{2010}
      \field{pages}{xvi+934}
      \range{pages}{-1}
    \endentry
    \entry{A68}{book}{}
      \name{author}{1}{}{%
        {{hash=0ca3a19e2133e2732337ff8fde8ab339}{Atneosen}{A\bibinitperiod}{Gail\bibnamedelima Adele}{G\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {ProQuest LLC, Ann Arbor, MI}%
      }
      \strng{namehash}{0ca3a19e2133e2732337ff8fde8ab339}
      \strng{fullhash}{0ca3a19e2133e2732337ff8fde8ab339}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Thesis (Ph.D.)--Michigan State University}
      \field{title}{On the Embeddability of Compacta in {N}-Books: Intrinsic and Extrinsic Properties}
      \field{year}{1968}
      \field{pages}{79}
      \range{pages}{1}
    \endentry
    \entry{ABBGHNR16}{article}{}
      \name{author}{7}{}{%
        {{hash=4cee998f6b53ebb597c767c36b329217}{Auer}{A\bibinitperiod}{Christopher}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cc1506f1ee882ad673b760dc3e53b51a}{Bachmaier}{B\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=52d9abfff1d534150126ad35519afea7}{Glei{\ss{}}ner}{G\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=f1a79fe995dede0f6518c8276f8d2719}{Hanauer}{H\bibinitperiod}{Kathrin}{K\bibinitperiod}{}{}{}{}}%
        {{hash=d22b8874dc650afee4999362d8e09290}{Neuwirth}{N\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=822b7733b07a885fb98bf7cfd5ec0d40}{Reislhuber}{R\bibinitperiod}{Josef}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2f65b184d2d9d43faed4299fafbf04a7}
      \strng{fullhash}{8cdcaa132eb22e634ca96c110b40699e}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{4}
      \field{title}{Outer 1-planar graphs}
      \field{volume}{74}
      \field{year}{2016}
      \field{pages}{1293\bibrangedash 1320}
      \range{pages}{28}
      \verb{doi}
      \verb 10.1007/s00453-015-0002-1
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00453-015-0002-1
      \endverb
    \endentry
    \entry{ABGR15}{article}{}
      \name{author}{4}{}{%
        {{hash=4cee998f6b53ebb597c767c36b329217}{Auer}{A\bibinitperiod}{Christopher}{C\bibinitperiod}{}{}{}{}}%
        {{hash=a3da4a1acc0ade686963415100415d1d}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=52d9abfff1d534150126ad35519afea7}{Glei{\ss{}}ner}{G\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=822b7733b07a885fb98bf7cfd5ec0d40}{Reislhuber}{R\bibinitperiod}{Josef}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2f65b184d2d9d43faed4299fafbf04a7}
      \strng{fullhash}{841b1389d7b243b0086c6deace37a880}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Graph Algorithms and Applications}
      \field{number}{1}
      \field{title}{1-Planarity of Graphs with a Rotation System}
      \field{volume}{19}
      \field{year}{2015}
      \field{pages}{67\bibrangedash 86}
      \range{pages}{20}
      \verb{doi}
      \verb 10.7155/JGAA.00347
      \endverb
    \endentry
    \entry{ACGKMP99}{book}{}
      \name{author}{6}{}{%
        {{hash=65a66ca1bb98f223b99479ca23ff5966}{Ausiello}{A\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
        {{hash=fea7d57073416d5c797d34e87326e4a8}{Crescenzi}{C\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=9ea85a9915f07ecaaa6afee516c56485}{Gambosi}{G\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
        {{hash=2482fd598cbd6615732f7d91e6f8ef74}{Kann}{K\bibinitperiod}{V.}{V\bibinitperiod}{}{}{}{}}%
        {{hash=ad1725dbdf0f34e6c4de07036dfb84c6}{Marchetti-Spaccamela}{M\bibinithyphendelim S\bibinitperiod}{A.}{A\bibinitperiod}{}{}{}{}}%
        {{hash=89134b0920cf4841295566ee1313d561}{Protasi}{P\bibinitperiod}{M.}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer-Verlag}%
      }
      \strng{namehash}{14508fea79d5d063e0baf186918af73d}
      \strng{fullhash}{2b29e652ac7ca5d86d6a906140f7f28a}
      \field{sortinit}{A}
      \field{sortinithash}{b685c7856330eaee22789815b49de9bb}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{3-540-65431-3}
      \field{subtitle}{Combinatorial optimization problems and their approximability properties}
      \field{title}{Complexity and approximation}
      \field{year}{1999}
      \field{pages}{xx+524}
      \range{pages}{-1}
    \endentry
    \entry{B07}{article}{}
      \name{author}{1}{}{%
        {{hash=cc1506f1ee882ad673b760dc3e53b51a}{Bachmaier}{B\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cc1506f1ee882ad673b760dc3e53b51a}
      \strng{fullhash}{cc1506f1ee882ad673b760dc3e53b51a}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{IEEE Trans. Vis. Comput. Graph}
      \field{number}{3}
      \field{title}{A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information}
      \field{volume}{13}
      \field{year}{2007}
      \field{pages}{583\bibrangedash 594}
      \range{pages}{12}
    \endentry
    \entry{BBBF09}{incollection}{}
      \name{author}{4}{}{%
        {{hash=cc1506f1ee882ad673b760dc3e53b51a}{Bachmaier}{B\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=be2ea7f37e5ba5ac3454a96a5bf09347}{Brunner}{B\bibinitperiod}{Wolfgang}{W\bibinitperiod}{}{}{}{}}%
        {{hash=2d3e529d75cf778e651b7a0660d3b13c}{F\"{u}l\"{o}p}{F\bibinitperiod}{Raymund}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{0e42aa2a6b1e93ba2cd21e02cb13bbf5}
      \strng{fullhash}{4b299ca1ba65840456822b36c686d8d6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and combinatorics}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Coordinate assignment for cyclic level graphs}
      \field{volume}{5609}
      \field{year}{2009}
      \field{pages}{66\bibrangedash 75}
      \range{pages}{10}
    \endentry
    \entry{BBBH11}{article}{}
      \name{author}{4}{}{%
        {{hash=cc1506f1ee882ad673b760dc3e53b51a}{Bachmaier}{B\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=be2ea7f37e5ba5ac3454a96a5bf09347}{Brunner}{B\bibinitperiod}{Wolfgang}{W\bibinitperiod}{}{}{}{}}%
        {{hash=cae8d5eba148569d5608706c74701164}{H\"{u}bner}{H\bibinitperiod}{Ferdinand}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0e42aa2a6b1e93ba2cd21e02cb13bbf5}
      \strng{fullhash}{f2c6d8b770bac3803a53dd7292f0443a}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{5}
      \field{title}{Global {$k$}-level crossing reduction}
      \field{volume}{15}
      \field{year}{2011}
      \field{pages}{631\bibrangedash 659}
      \range{pages}{29}
    \endentry
    \entry{BBF05}{article}{}
      \name{author}{3}{}{%
        {{hash=cc1506f1ee882ad673b760dc3e53b51a}{Bachmaier}{B\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=3f5ab88a0baba4e47aa97af890677469}{Forster}{F\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ffe68a5747f96acc722f980adb215a26}
      \strng{fullhash}{ffe68a5747f96acc722f980adb215a26}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{Radial level planarity testing and embedding in linear time}
      \field{volume}{9}
      \field{year}{2005}
      \field{pages}{53\bibrangedash 97}
      \range{pages}{45}
    \endentry
    \entry{BJL16}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=1a40b879612971fe1a939c0e79d8f852}{Bald}{B\bibinitperiod}{Samuel}{S\bibinitperiod}{}{}{}{}}%
        {{hash=222f79aaa082eacd3889e7dafbd56125}{Johnson}{J\bibinitperiod}{Matthew\bibnamedelima P.}{M\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=17be0941964ebbc4bf9609c4a8541eca}{Liu}{L\bibinitperiod}{Ou}{O\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=cd8b8048c49ff2d36d9f071202ae67c1}{Dinh}{D\bibinitperiod}{Thang\bibnamedelima N.}{T\bibinitperiod\bibinitdelim N\bibinitperiod}{}{}{}{}}%
        {{hash=9003acd2d1c95789d2cba95d3866f4ab}{Thai}{T\bibinitperiod}{My\bibnamedelima T.}{M\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{002d3eea829fb343fc79f9601c61f160}
      \strng{fullhash}{002d3eea829fb343fc79f9601c61f160}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings}
      \field{isbn}{978-3-319-42633-4}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Approximating the Maximum Rectilinear Crossing Number}
      \field{volume}{9797}
      \field{year}{2016}
      \field{pages}{455\bibrangedash 467}
      \range{pages}{13}
      \verb{doi}
      \verb 10.1007/978-3-319-42634-1_37
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-319-42634-1_37
      \endverb
    \endentry
    \entry{BJL14}{misc}{}
      \name{author}{3}{}{%
        {{hash=1a40b879612971fe1a939c0e79d8f852}{Bald}{B\bibinitperiod}{Samuel}{S\bibinitperiod}{}{}{}{}}%
        {{hash=222f79aaa082eacd3889e7dafbd56125}{Johnson}{J\bibinitperiod}{Matthew\bibnamedelima P.}{M\bibinitperiod}{}{}{}{}}%
        {{hash=17be0941964ebbc4bf9609c4a8541eca}{Liu}{L\bibinitperiod}{Ou}{O\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {University of Connecticut, US}%
      }
      \strng{namehash}{002d3eea829fb343fc79f9601c61f160}
      \strng{fullhash}{002d3eea829fb343fc79f9601c61f160}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{Talk at 2014 Fall Workshop on Computational Geometry, University of Connecticut, US}
      \field{title}{Maximum Rectilinear Crossing Number}
      \field{year}{2014}
      \verb{url}
      \verb http://fwcg14.cse.uconn.edu/program/wp-content/uploads/sites/863/2014/10/fwcg2014_submission_29.pdf
      \endverb
    \endentry
    \entry{BFK15}{article}{}
      \name{author}{3}{}{%
        {{hash=3beacb04346b0a931eb1531fd02b7772}{Balko}{B\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{{Kyn\v{c}l}}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2a585bb02bf22961105629248bbf6f3d}
      \strng{fullhash}{2a585bb02bf22961105629248bbf6f3d}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{1}
      \field{title}{Crossing numbers and combinatorial characterization of monotone drawings of {$K_n$}}
      \field{volume}{53}
      \field{year}{2015}
      \field{pages}{107\bibrangedash 143}
      \range{pages}{37}
      \verb{doi}
      \verb 10.1007/s00454-014-9644-z
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00454-014-9644-z
      \endverb
    \endentry
    \entry{BK15}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=3beacb04346b0a931eb1531fd02b7772}{{Balko}}{B\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{{Kyn\v{c}l}}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
        {{hash=3b2ff6170d865a273b29bd43a8bc3004}{Silveira}{S\bibinitperiod}{Rodrigo\bibnamedelima I.}{R\bibinitperiod\bibinitdelim I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f914da1002e6e60feb9fd4761e1b1137}
      \strng{fullhash}{f914da1002e6e60feb9fd4761e1b1137}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Abstracts XVI Spanish Meeting on Computational Geometry}
      \field{title}{Bounding the pseudolinear crossing number of {$K_n$} via simulated annealing}
      \field{year}{2015}
      \field{pages}{37\bibrangedash 40}
      \range{pages}{4}
      \verb{url}
      \verb http://www-ma2.upc.es/egc15/wp-content/uploads/2013/10/AbstractsXVIEGC.pdf
      \endverb
    \endentry
    \entry{BLPRS07}{article}{}
      \name{author}{5}{}{%
        {{hash=10da304589e01297eb8668682c77e33e}{Balogh}{B\bibinitperiod}{J\'{o}zsef}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c9854b1616286c9e915a939fa632750e}{Lea\~{n}os}{L\bibinitperiod}{Bernardo\bibnamedelima M.}{B\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=06ef0727eeebf6c7a55f4994fc8bc032}{Pan}{P\bibinitperiod}{Shengjun}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{862019380c55e045c968bf6241911091}
      \strng{fullhash}{f8ac937f4f63a2973c548c2badf81fc3}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1034-4942}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{The convex hull of every optimal pseudolinear drawing of {$K_n$} is a triangle}
      \field{volume}{38}
      \field{year}{2007}
      \field{pages}{155\bibrangedash 162}
      \range{pages}{8}
    \endentry
    \entry{BLS19}{article}{}
      \name{author}{3}{}{%
        {{hash=10da304589e01297eb8668682c77e33e}{{Balogh}}{B\bibinitperiod}{J\'{o}zsef}{J\bibinitperiod}{}{}{}{}}%
        {{hash=8d96d13eb7fa9f65194d3642f3c9ea59}{{Lidick\'{y}}}{L\bibinitperiod}{Bernard}{B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{{Salazar}}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6a3a00e0d182e5b9407758fb8325f973}
      \strng{fullhash}{6a3a00e0d182e5b9407758fb8325f973}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{3}
      \field{title}{Closing in on {H}ill's conjecture}
      \field{volume}{33}
      \field{year}{2019}
      \field{pages}{1261\bibrangedash 1276}
      \range{pages}{16}
      \verb{doi}
      \verb 10.1137/17M1158859
      \endverb
      \verb{url}
      \verb https://doi.org/10.1137/17M1158859
      \endverb
    \endentry
    \entry{B1885}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=0009765dbb8621a4169db1e5b9005dab}{Baltzer}{B\bibinitperiod}{R}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Leipzig}%
      }
      \list{publisher}{1}{%
        {S. Hirzel}%
      }
      \strng{namehash}{0009765dbb8621a4169db1e5b9005dab}
      \strng{fullhash}{0009765dbb8621a4169db1e5b9005dab}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Berichte \"{u}ber die Verhandlungen der K\"{o}niglich S\"{a}chsischen Gesellschaft der Wissenschaften zu Leipzig. Mathematisch-Physische Classe.}
      \field{title}{Eine {E}rinnerung an {M\"{o}bius} und seinen {F}reund {W}eiske}
      \field{volume}{37}
      \field{year}{1885}
      \field{pages}{1\bibrangedash 6}
      \range{pages}{6}
    \endentry
    \entry{BCE13b}{incollection}{}
      \name{author}{3}{}{%
        {{hash=b2e58462fc138dbe8c887717b27cb031}{Bannister}{B\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=396ad148a3423d444d4566ce0e31410c}{Cabello}{C\bibinitperiod}{Sergio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Heidelberg}%
      }
      \strng{namehash}{8c586a5797db95e147eaee916c8f5bd2}
      \strng{fullhash}{8c586a5797db95e147eaee916c8f5bd2}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithms and data structures}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Parameterized complexity of 1-planarity}
      \field{volume}{8037}
      \field{year}{2013}
      \field{pages}{97\bibrangedash 108}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-642-40104-6_9
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-642-40104-6_9
      \endverb
    \endentry
    \entry{BE14b}{incollection}{}
      \name{author}{2}{}{%
        {{hash=b2e58462fc138dbe8c887717b27cb031}{Bannister}{B\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Heidelberg}%
      }
      \strng{namehash}{d116f5ce17d0608f2aa0b432dc0c4883}
      \strng{fullhash}{d116f5ce17d0608f2aa0b432dc0c4883}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth}
      \field{volume}{8871}
      \field{year}{2014}
      \field{pages}{210\bibrangedash 221}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-662-45803-7_18
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-662-45803-7_18
      \endverb
    \endentry
    \entry{BES13b}{incollection}{}
      \name{author}{3}{}{%
        {{hash=b2e58462fc138dbe8c887717b27cb031}{Bannister}{B\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=d455c6eec706b3ec8d610cb49b90b4e6}{Simons}{S\bibinitperiod}{Joseph\bibnamedelima A.}{J\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{b49488280817627422f2b8ef76cc7d97}
      \strng{fullhash}{b49488280817627422f2b8ef76cc7d97}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Fixed parameter tractability of crossing minimization of almost-trees}
      \field{volume}{8242}
      \field{year}{2013}
      \field{pages}{340\bibrangedash 351}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-319-03841-4_30
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-319-03841-4_30
      \endverb
    \endentry
    \entry{B70}{thesis}{}
      \name{author}{1}{}{%
        {{hash=51a85f41c9f68d941d98f8aef64e71b5}{Barton}{B\bibinitperiod}{Calvin\bibnamedelima Pascal}{C\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {The University of Texas at Austin}%
      }
      \list{location}{1}{%
        {Austin, Texas}%
      }
      \list{publisher}{1}{%
        {ProQuest LLC, Ann Arbor, MI}%
      }
      \strng{namehash}{51a85f41c9f68d941d98f8aef64e71b5}
      \strng{fullhash}{51a85f41c9f68d941d98f8aef64e71b5}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{The Rectilinear Crossing Number for Complete Simple Graphs in $E_2$}
      \field{type}{phdthesis}
      \field{year}{1970}
      \field{pages}{45}
      \range{pages}{1}
    \endentry
    \entry{BVRK12}{misc}{}
      \name{author}{4}{}{%
        {{hash=7cffa0000b9a3a8681a56b2bf1c9de36}{Bauer}{B\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=76fdf99e4429034577dc2adf2e64d472}{Vordermeier}{V\bibinitperiod}{Julian}{J\bibinitperiod}{}{}{}{}}%
        {{hash=33140dd44f57dc4a8e11a32a9a9a9f1d}{Rutter}{R\bibinitperiod}{Ignaz}{I\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4a51bff7233684fda68be18621dba223}
      \strng{fullhash}{f828bce6d9d0c909a8620b4c38be7caf}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{http://i11www.iti.uni-karlsruhe.de/projects/cyclexings/index} (last accessed 1/9/2013)}
      \field{note}{Game presented at {\em Graph Drawing '12}}
      \field{title}{Cycle{X}ings}
      \field{year}{2012}
    \endentry
    \entry{BB05}{incollection}{}
      \name{author}{2}{}{%
        {{hash=272aa7e9d1aad814abea1bc0d2ed8b4e}{Baur}{B\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=392b457d9bac1ed69366176e7857d7e9}{Brandes}{B\bibinitperiod}{Ulrik}{U\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=a3b563fb40f27627f52813573a32b304}{Hromkovic}{H\bibinitperiod}{Juraj}{J\bibinitperiod}{}{}{}{}}%
        {{hash=604abb5c27c37000a7031a544058b832}{Nagl}{N\bibinitperiod}{Manfred}{M\bibinitperiod}{}{}{}{}}%
        {{hash=0fd84bc3b92cb45d88855b24cb4e4367}{Westfechtel}{W\bibinitperiod}{Bernhard}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{50a069af1ab32062f5775d0ea00c7890}
      \strng{fullhash}{50a069af1ab32062f5775d0ea00c7890}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph-Theoretic Concepts in Computer Science}
      \field{isbn}{978-3-540-24132-4}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Crossing Reduction in Circular Layouts}
      \field{volume}{3353}
      \field{year}{2005}
      \field{pages}{332\bibrangedash 343}
      \range{pages}{12}
    \endentry
    \entry{BGGP10}{article}{}
      \name{author}{4}{}{%
        {{hash=edb4df7df143a206ec80e1e7cfa0c325}{Beaudou}{B\bibinitperiod}{Laurent}{L\bibinitperiod}{}{}{}{}}%
        {{hash=775fb7fcf33ba0fde9de8f553553f70e}{Gerbaud}{G\bibinitperiod}{Antoine}{A\bibinitperiod}{}{}{}{}}%
        {{hash=abebb2b2e031941f9c9e0bc655c52527}{Grappe}{G\bibinitperiod}{Roland}{R\bibinitperiod}{}{}{}{}}%
        {{hash=d968d42fff9c7ae1abc91f7d4e7f5b64}{Palesi}{P\bibinitperiod}{Fr\'{e}d\'{e}ric}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7c410224295011f1ea093fecfb7d23dc}
      \strng{fullhash}{b657613e9e7a8fbb7f616dc6ac60edce}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{4}
      \field{title}{Drawing disconnected graphs on the {K}lein bottle}
      \field{volume}{26}
      \field{year}{2010}
      \field{pages}{471\bibrangedash 481}
      \range{pages}{11}
      \verb{doi}
      \verb 10.1007/s00373-010-0928-7
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00373-010-0928-7
      \endverb
    \endentry
    \entry{BEW95}{article}{}
      \name{author}{3}{}{%
        {{hash=2e7a4c4628304704ad8618b7a8211fed}{Becker}{B\bibinitperiod}{Richard\bibnamedelima A.}{R\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=902467b9120f76b00707706c150563af}{Eick}{E\bibinitperiod}{Stephen\bibnamedelima G.}{S\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
        {{hash=ca9e1f98a15153e6fe628952961fbc6e}{Wilks}{W\bibinitperiod}{Allan\bibnamedelima R.}{A\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f8e578e86e556dd2349554e0040a87e6}
      \strng{fullhash}{f8e578e86e556dd2349554e0040a87e6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-2626 (print), 1941-0506 (electronic), 2160-9306}
      \field{journaltitle}{IEEE Transactions on Visualization and Computer Graphics}
      \field{month}{03}
      \field{number}{1}
      \field{title}{Visualizing Network Data}
      \field{volume}{1}
      \field{year}{1995}
      \field{pages}{16\bibrangedash 28}
      \range{pages}{13}
    \endentry
    \entry{B97}{incollection}{}
      \name{author}{1}{}{%
        {{hash=49ab73ee28ccce5f6876a1cdf8b22cdc}{Beineke}{B\bibinitperiod}{Lowell\bibnamedelima W.}{L\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Oxford Univ. Press}%
      }
      \strng{namehash}{49ab73ee28ccce5f6876a1cdf8b22cdc}
      \strng{fullhash}{49ab73ee28ccce5f6876a1cdf8b22cdc}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph connections}
      \field{series}{Oxford Lecture Ser. Math. Appl.}
      \field{title}{Topology}
      \field{volume}{5}
      \field{year}{1997}
      \field{pages}{155\bibrangedash 175}
      \range{pages}{21}
    \endentry
    \entry{BR80}{article}{}
      \name{author}{2}{}{%
        {{hash=49ab73ee28ccce5f6876a1cdf8b22cdc}{Beineke}{B\bibinitperiod}{Lowell\bibnamedelima W.}{L\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
        {{hash=cc25925dfe51b2dd428cdaca283cfe50}{Ringeisen}{R\bibinitperiod}{Richard\bibnamedelima D.}{R\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{32d7c32f661ade5192946941d109b746}
      \strng{fullhash}{32d7c32f661ade5192946941d109b746}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{2}
      \field{title}{On the crossing numbers of products of cycles and graphs of order four}
      \field{volume}{4}
      \field{year}{1980}
      \field{pages}{145\bibrangedash 155}
      \range{pages}{11}
    \endentry
    \entry{BW10}{article}{}
      \name{author}{2}{}{%
        {{hash=7b1f14c6605990c8ea32c52b0d7ad05c}{Beineke}{B\bibinitperiod}{Lowell}{L\bibinitperiod}{}{}{}{}}%
        {{hash=78d85d2deceb03dc9f4ce0a35b9a8ab3}{Wilson}{W\bibinitperiod}{Robin}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3264e016d5c17b2feb8dddaf87f048dd}
      \strng{fullhash}{3264e016d5c17b2feb8dddaf87f048dd}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0343-6993}
      \field{journaltitle}{Math. Intelligencer}
      \field{number}{2}
      \field{title}{The early history of the brick factory problem}
      \field{volume}{32}
      \field{year}{2010}
      \field{pages}{41\bibrangedash 48}
      \range{pages}{8}
    \endentry
    \entry{BBKR15a}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=a72aa002a82c1ac2f7e33776b9f69912}{{Bekos}}{B\bibinitperiod}{Michael\bibnamedelima A.}{M\bibinitperiod}{}{}{}{}}%
        {{hash=8f5b41eb8d60ae4135e7acfd66b6e282}{{Bruckdorfer}}{B\bibinitperiod}{Till}{T\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{{Kaufmann}}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=bab274850a7d51822fc3f0e4df627a58}{{Raftopoulou}}{R\bibinitperiod}{Chrysanthi\bibnamedelima N.}{C\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=e5933a3896c092918084907295ad0307}{Bansal}{B\bibinitperiod}{Nikhil}{N\bibinitperiod}{}{}{}{}}%
        {{hash=988d2602b6318807e4481ff5c673bbd5}{Finocchi}{F\bibinitperiod}{Irene}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{4d2c71a578aff68359fa7314f3958a12}
      \strng{fullhash}{6208e88539b7d9f227d5a0c50afca3e8}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}
      \field{isbn}{978-3-662-48349-7}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{1-Planar Graphs have Constant Book Thickness}
      \field{volume}{9294}
      \field{year}{2015}
      \field{pages}{130\bibrangedash 141}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-662-48350-3_12
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-662-48350-3_12
      \endverb
    \endentry
    \entry{BBKR17}{article}{}
      \name{author}{4}{}{%
        {{hash=a72aa002a82c1ac2f7e33776b9f69912}{Bekos}{B\bibinitperiod}{Michael\bibnamedelima A.}{M\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=8f5b41eb8d60ae4135e7acfd66b6e282}{Bruckdorfer}{B\bibinitperiod}{Till}{T\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=bab274850a7d51822fc3f0e4df627a58}{Raftopoulou}{R\bibinitperiod}{Chrysanthi\bibnamedelima N.}{C\bibinitperiod\bibinitdelim N\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4d2c71a578aff68359fa7314f3958a12}
      \strng{fullhash}{6208e88539b7d9f227d5a0c50afca3e8}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{2}
      \field{title}{The book thickness of 1-planar graphs is constant}
      \field{volume}{79}
      \field{year}{2017}
      \field{pages}{444\bibrangedash 465}
      \range{pages}{22}
      \verb{doi}
      \verb 10.1007/s00453-016-0203-2
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00453-016-0203-2
      \endverb
    \endentry
    \entry{BKKPRU20b}{article}{}
      \name{author}{6}{}{%
        {{hash=a72aa002a82c1ac2f7e33776b9f69912}{Bekos}{B\bibinitperiod}{Michael\bibnamedelima A.}{M\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=ad5d9b03edeb04aeefa3737c87fae389}{Klute}{K\bibinitperiod}{Fabian}{F\bibinitperiod}{}{}{}{}}%
        {{hash=5ab199a65487e55d374000d386c01a78}{Pupyrev}{P\bibinitperiod}{Sergey}{S\bibinitperiod}{}{}{}{}}%
        {{hash=66d07030405eacfdf71a35c3da1d7c1b}{Raftopoulou}{R\bibinitperiod}{Chrysanthi}{C\bibinitperiod}{}{}{}{}}%
        {{hash=489c61d4e2b7d5975951963b06d031bd}{Ueckerdt}{U\bibinitperiod}{Torsten}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4d2c71a578aff68359fa7314f3958a12}
      \strng{fullhash}{19220bee24706fc476b5a0ec22dc1efd}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Comput. Geom.}
      \field{number}{1}
      \field{title}{Four pages are indeed necessary for planar graphs}
      \field{volume}{11}
      \field{year}{2020}
      \field{pages}{332\bibrangedash 353}
      \range{pages}{22}
    \endentry
    \entry{BNUW07}{incollection}{}
      \name{author}{4}{}{%
        {{hash=198c1141d7514f6c0c3e359ff149cd06}{Benkert}{B\bibinitperiod}{Marc}{M\bibinitperiod}{}{}{}{}}%
        {{hash=5b74bae0077b65f428e92cfda7ee88bd}{N\"{o}llenburg}{N\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a5f2f68581b1d10333ac66efeec94265}{Uno}{U\bibinitperiod}{Takeaki}{T\bibinitperiod}{}{}{}{}}%
        {{hash=7e010c9835c528b6dea6ec84022a5735}{Wolff}{W\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{057c7d63c8071b5869fd9269a3c37b51}
      \strng{fullhash}{42f5a1f204ddd2573ce266939d489148}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Minimizing intra-edge crossings in wiring diagrams and public transportation maps}
      \field{volume}{4372}
      \field{year}{2007}
      \field{pages}{270\bibrangedash 281}
      \range{pages}{12}
    \endentry
    \entry{BETF19}{article}{}
      \name{author}{3}{}{%
        {{hash=bf899774e98d4effe503771b4f228348}{Bennett}{B\bibinitperiod}{Patrick}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f5aceea5df016721d45f691e43f813b4}{English}{E\bibinitperiod}{Sean}{S\bibinitperiod}{}{}{}{}}%
        {{hash=15de24cf1735da23bb330e5d9ccf0f07}{Talanda-Fisher}{T\bibinithyphendelim F\bibinitperiod}{Maria}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{697e2f404f8b3f4e12d659d82d9209da}
      \strng{fullhash}{697e2f404f8b3f4e12d659d82d9209da}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{8}
      \field{title}{Weighted {T}ur\'{a}n problems with applications}
      \field{volume}{342}
      \field{year}{2019}
      \field{pages}{2165\bibrangedash 2172}
      \range{pages}{8}
      \verb{doi}
      \verb 10.1016/j.disc.2019.04.007
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.disc.2019.04.007
      \endverb
    \endentry
    \entry{BJYZ11}{article}{}
      \name{author}{4}{}{%
        {{hash=68abba00acf02594f61a6b0c13ea94ec}{Bereg}{B\bibinitperiod}{Sergey}{S\bibinitperiod}{}{}{}{}}%
        {{hash=c2f31a04ee88f085b1ac276a5179f61b}{Jiang}{J\bibinitperiod}{Minghui}{M\bibinitperiod}{}{}{}{}}%
        {{hash=e0abc9f03d2c49ba36d1a9b6055a156c}{Yang}{Y\bibinitperiod}{Boting}{B\bibinitperiod}{}{}{}{}}%
        {{hash=77aed896de8d7f47e5248d1df57df9c5}{Zhu}{Z\bibinitperiod}{Binhai}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Essex, UK}%
      }
      \list{publisher}{1}{%
        {Elsevier Science Publishers Ltd.}%
      }
      \strng{namehash}{909414f5444a94c24de599dbb9479e27}
      \strng{fullhash}{e185062ad996ec67075ea312e4b2086e}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0304-3975}
      \field{issue}{23}
      \field{journaltitle}{Theor. Comput. Sci.}
      \field{month}{05}
      \field{title}{On the red/blue spanning tree problem}
      \field{volume}{412}
      \field{year}{2011}
      \field{pages}{2459\bibrangedash 2467}
      \range{pages}{9}
    \endentry
    \entry{BK79}{article}{}
      \name{author}{2}{}{%
        {{hash=5617bb7cf33784fab9242c4f0ee78a07}{Bernhart}{B\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bacc06ee1b854c362b247c18f51a31e6}
      \strng{fullhash}{bacc06ee1b854c362b247c18f51a31e6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{3}
      \field{title}{The book thickness of a graph}
      \field{volume}{27}
      \field{year}{1979}
      \field{pages}{320\bibrangedash 331}
      \range{pages}{12}
    \endentry
    \entry{B10}{book}{}
      \name{author}{1}{}{%
        {{hash=3cab6300d4027cea48cd80fabce75139}{Bertin}{B\bibinitperiod}{Jacques}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {ESRI}%
      }
      \strng{namehash}{3cab6300d4027cea48cd80fabce75139}
      \strng{fullhash}{3cab6300d4027cea48cd80fabce75139}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{978-1-58948-261-6}
      \field{note}{This book was originally published in French in 1967; this translation is based on the second edition from 1974.}
      \field{title}{Semiology of Graphics - Diagrams, Networks, Maps}
      \field{year}{2010}
      \field{pages}{xv+438}
      \range{pages}{-1}
    \endentry
    \entry{BBD09}{article}{}
      \name{author}{3}{}{%
        {{hash=beb47af236126aeb8411d8b0ae6f7446}{Biedl}{B\bibinitperiod}{Therese}{T\bibinitperiod}{}{}{}{}}%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=0bb8278480540893b039fa333b72d83c}{Deng}{D\bibinitperiod}{Xiaotie}{X\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f284cefb0012a8a4a1b840831dc48b43}
      \strng{fullhash}{f284cefb0012a8a4a1b840831dc48b43}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{7}
      \field{title}{On the complexity of crossings in permutations}
      \field{volume}{309}
      \field{year}{2009}
      \field{pages}{1813\bibrangedash 1823}
      \range{pages}{11}
    \endentry
    \entry{BCDM20}{article}{}
      \name{author}{4}{}{%
        {{hash=beb47af236126aeb8411d8b0ae6f7446}{Biedl}{B\bibinitperiod}{Therese}{T\bibinitperiod}{}{}{}{}}%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=95eda6e51fd4336edbd2689b9e5d08f5}{Derka}{D\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c16a3fbcaa2abbce0db956eaa49efdf4}
      \strng{fullhash}{76eaf695de98c420f01ac1ef51db84b6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{2}
      \field{title}{Crossing number for graphs with bounded pathwidth}
      \field{volume}{82}
      \field{year}{2020}
      \field{pages}{355\bibrangedash 384}
      \range{pages}{30}
    \endentry
    \entry{B91}{article}{}
      \name{author}{1}{}{%
        {{hash=ef9ca700c806f2b9ba320b842d4788f6}{Bienstock}{B\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ef9ca700c806f2b9ba320b842d4788f6}
      \strng{fullhash}{ef9ca700c806f2b9ba320b842d4788f6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{5}
      \field{title}{Some provably hard crossing number problems}
      \field{volume}{6}
      \field{year}{1991}
      \field{pages}{443\bibrangedash 459}
      \range{pages}{17}
    \endentry
    \entry{BD93}{article}{}
      \name{author}{2}{}{%
        {{hash=ef9ca700c806f2b9ba320b842d4788f6}{Bienstock}{B\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=ba16b17ef0c74e6583ee35f9c60d66c3}{Dean}{D\bibinitperiod}{Nathaniel}{N\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f398eb5612028e48811d34e1ba1cea43}
      \strng{fullhash}{f398eb5612028e48811d34e1ba1cea43}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Bounds for rectilinear crossing numbers}
      \field{volume}{17}
      \field{year}{1993}
      \field{pages}{333\bibrangedash 348}
      \range{pages}{16}
    \endentry
    \entry{BD92}{article}{}
      \name{author}{2}{}{%
        {{hash=ef9ca700c806f2b9ba320b842d4788f6}{Bienstock}{B\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=ba16b17ef0c74e6583ee35f9c60d66c3}{Dean}{D\bibinitperiod}{Nathaniel}{N\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f398eb5612028e48811d34e1ba1cea43}
      \strng{fullhash}{f398eb5612028e48811d34e1ba1cea43}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{5}
      \field{title}{New results on rectilinear crossing numbers and plane embeddings}
      \field{volume}{16}
      \field{year}{1992}
      \field{pages}{389\bibrangedash 398}
      \range{pages}{10}
    \endentry
    \entry{BDGHL18}{article}{}
      \name{author}{4}{}{%
        {{hash=2366544688f4fda4b16ee9153a5cf89b}{Binucci}{B\bibinitperiod}{Carla}{C\bibinitperiod}{}{}{}{}}%
        {{hash=7a1c4654d565cf7d6a6c42a16cdd1282}{Di\bibnamedelima Giacomo}{D\bibinitperiod\bibinitdelim G\bibinitperiod}{Emilio}{E\bibinitperiod}{}{}{}{}}%
        {{hash=8ae615f1099c53770b4c06449b05a886}{Hossain}{H\bibinitperiod}{Md.\bibnamedelimi Iqbal}{M\bibinitperiod\bibinitdelim I\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1105a08c85ee7f8b674edfb520ea4e11}
      \strng{fullhash}{a37db2625a792efaf91b51e4353c3e51}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0195-6698}
      \field{journaltitle}{European J. Combin.}
      \field{title}{1-page and 2-page drawings with bounded number of crossings per edge}
      \field{volume}{68}
      \field{year}{2018}
      \field{pages}{24\bibrangedash 37}
      \range{pages}{14}
      \verb{doi}
      \verb 10.1016/j.ejc.2017.07.009
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.ejc.2017.07.009
      \endverb
    \endentry
    \entry{BK64}{incollection}{}
      \name{author}{2}{}{%
        {{hash=d62a10d148a7fab18061b6b9f296c26a}{Bla\v{z}ek}{B\bibinitperiod}{Jaroslav}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Publ. House Czechoslovak Acad. Sci., Prague}%
      }
      \strng{namehash}{bec82c7be45441b9f8ed58024ed62ef1}
      \strng{fullhash}{bec82c7be45441b9f8ed58024ed62ef1}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Theory of {G}raphs and its {A}pplications ({P}roc. {S}ympos. {S}molenice, 1963)}
      \field{title}{A minimal problem concerning complete plane graphs}
      \field{year}{1964}
      \field{pages}{113\bibrangedash 117}
      \range{pages}{5}
    \endentry
    \entry{BK67}{article}{}
      \name{author}{2}{}{%
        {{hash=d62a10d148a7fab18061b6b9f296c26a}{Bla\v{z}ek}{B\bibinitperiod}{Jaroslav}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bec82c7be45441b9f8ed58024ed62ef1}
      \strng{fullhash}{bec82c7be45441b9f8ed58024ed62ef1}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0010-2628}
      \field{journaltitle}{Comment. Math. Univ. Carolinae}
      \field{title}{On an extremal problem concerning graphs}
      \field{volume}{8}
      \field{year}{1967}
      \field{pages}{49\bibrangedash 52}
      \range{pages}{4}
    \endentry
    \entry{BK70}{incollection}{}
      \name{author}{2}{}{%
        {{hash=d62a10d148a7fab18061b6b9f296c26a}{Bla\v{z}ek}{B\bibinitperiod}{Jaroslav}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Univ. Karlova, Prague}%
      }
      \strng{namehash}{bec82c7be45441b9f8ed58024ed62ef1}
      \strng{fullhash}{bec82c7be45441b9f8ed58024ed62ef1}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Mathematika (geometrie a teorie graf\r{u})}
      \field{title}{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)}
      \field{year}{1970}
      \field{pages}{69\bibrangedash 84}
      \range{pages}{16}
    \endentry
    \entry{BKQ83}{incollection}{}
      \name{author}{3}{}{%
        {{hash=262a88cf8ec40feacb1c28770585295d}{Bloom}{B\bibinitperiod}{Gary\bibnamedelima S.}{G\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=89ccea72980997511916c24e09d5b6c0}{Kennedy}{K\bibinitperiod}{John\bibnamedelima W.}{J\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
        {{hash=9188f20fb2526a61c375eb4011bf2040}{Quintas}{Q\bibinitperiod}{Louis\bibnamedelima V.}{L\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{31c008db017c69815a89694ec927cdd9}
      \strng{fullhash}{31c008db017c69815a89694ec927cdd9}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph theory (\L{}ag\'{o}w, 1981)}
      \field{series}{Lecture Notes in Math.}
      \field{title}{On crossing numbers and linguistic structures}
      \field{volume}{1018}
      \field{year}{1983}
      \field{pages}{14\bibrangedash 22}
      \range{pages}{9}
      \verb{doi}
      \verb 10.1007/BFb0071606
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/BFb0071606
      \endverb
    \endentry
    \entry{BFH13}{article}{}
      \name{author}{3}{}{%
        {{hash=19fc6fe46524c35d27f4fcc492b37bc4}{Bode}{B\bibinitperiod}{Jens-P.}{J\bibinithyphendelim P\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{83a78de8d7697d4898c5044e62b11546}
      \strng{fullhash}{83a78de8d7697d4898c5044e62b11546}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{Extremal values of the maximum rectilinear crossing numbers of $2$-regular graphs}
      \field{volume}{69}
      \field{year}{2013}
      \field{pages}{95\bibrangedash 100}
      \range{pages}{6}
    \endentry
    \entry{BFHHL14}{article}{}
      \name{author}{5}{}{%
        {{hash=19fc6fe46524c35d27f4fcc492b37bc4}{Bode}{B\bibinitperiod}{Jens-P.}{J\bibinithyphendelim P\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=544d8c1dd12eaa666d20a5136afbf779}{Horowitz}{H\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=5a1dc825440da491b4ab3d1b76f0c48c}{Lichter}{L\bibinitperiod}{Tamar}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{217aa69e66e4e8768ee2fe3a1100fd0c}
      \strng{fullhash}{b099d127fa3b5f1afcef48c423efbe88}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Extremal values of the maximum rectilinear crossing number of cycles with diagonals}
      \field{volume}{220}
      \field{year}{2014}
      \field{pages}{33\bibrangedash 48}
      \range{pages}{16}
    \endentry
    \entry{BFHHL15}{article}{}
      \name{author}{5}{}{%
        {{hash=19fc6fe46524c35d27f4fcc492b37bc4}{Bode}{B\bibinitperiod}{Jens-P.}{J\bibinithyphendelim P\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=544d8c1dd12eaa666d20a5136afbf779}{Horowitz}{H\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=5a1dc825440da491b4ab3d1b76f0c48c}{Lichter}{L\bibinitperiod}{Tamar}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{217aa69e66e4e8768ee2fe3a1100fd0c}
      \strng{fullhash}{b099d127fa3b5f1afcef48c423efbe88}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Extremal values of the maximum rectilinear crossing number of {$(p,q)$}-graphs}
      \field{volume}{223}
      \field{year}{2015}
      \field{pages}{139\bibrangedash 149}
      \range{pages}{11}
    \endentry
    \entry{BSW83}{article}{}
      \name{author}{3}{}{%
        {{hash=83bad068662246f2672b39a5a8d45e32}{Bodendiek}{B\bibinitperiod}{R.}{R\bibinitperiod}{}{}{}{}}%
        {{hash=783ee2abdbbcf6faf73e7991aeccd9b0}{Schumacher}{S\bibinitperiod}{H.}{H\bibinitperiod}{}{}{}{}}%
        {{hash=89e2277112b8317a4f31edc56e8d94dc}{Wagner}{W\bibinitperiod}{K.}{K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{618f44d6d2a80b04664b3dbd75716118}
      \strng{fullhash}{618f44d6d2a80b04664b3dbd75716118}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5858}
      \field{journaltitle}{Abh. Math. Sem. Univ. Hamburg}
      \field{title}{Bemerkungen zu einem {S}echsfarbenproblem von {G}. {R}ingel}
      \field{volume}{53}
      \field{year}{1983}
      \field{pages}{41\bibrangedash 52}
      \range{pages}{12}
    \endentry
    \entry{BCSV10}{article}{}
      \name{author}{4}{}{%
        {{hash=a5b2a6007b4187f2dac97e017fb5db3b}{Bokal}{B\bibinitperiod}{Drago}{D\bibinitperiod}{}{}{}{}}%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0c6ec04ca65e68c5e65e9ce40d0f70e6}
      \strng{fullhash}{5b8d8f8099c657185e344b95f36fa16e}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{2}
      \field{title}{General lower bounds for the minor crossing number of graphs}
      \field{volume}{44}
      \field{year}{2010}
      \field{pages}{463\bibrangedash 483}
      \range{pages}{21}
    \endentry
    \entry{BFM06}{article}{}
      \name{author}{3}{}{%
        {{hash=a5b2a6007b4187f2dac97e017fb5db3b}{Bokal}{B\bibinitperiod}{Drago}{D\bibinitperiod}{}{}{}{}}%
        {{hash=05e88606c00b3d93302ed488a9366123}{Fijav\v{z}}{F\bibinitperiod}{Ga\v{s}per}{G\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f633d962c00625b2341393915ee19886}
      \strng{fullhash}{f633d962c00625b2341393915ee19886}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{2}
      \field{title}{The minor crossing number}
      \field{volume}{20}
      \field{year}{2006}
      \field{pages}{344\bibrangedash 356}
      \range{pages}{13}
    \endentry
    \entry{BFW08}{article}{}
      \name{author}{3}{}{%
        {{hash=a5b2a6007b4187f2dac97e017fb5db3b}{Bokal}{B\bibinitperiod}{Drago}{D\bibinitperiod}{}{}{}{}}%
        {{hash=05e88606c00b3d93302ed488a9366123}{Fijav\v{z}}{F\bibinitperiod}{Ga\v{s}per}{G\bibinitperiod}{}{}{}{}}%
        {{hash=9ed4bb4376b5d05ff54dbde96df0f28c}{Wood}{W\bibinitperiod}{David\bibnamedelima R.}{D\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d447324a45dc2d6f662812a3c4e87e99}
      \strng{fullhash}{d447324a45dc2d6f662812a3c4e87e99}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-8926}
      \field{journaltitle}{Electron. J. Combin.}
      \field{number}{1}
      \field{title}{The minor crossing number of graphs with an excluded minor}
      \field{volume}{15}
      \field{year}{2008}
      \field{pages}{Research Paper 4}
      \range{pages}{-1}
    \endentry
    \entry{B51}{article}{}
      \name{author}{1}{}{%
        {{hash=c0273c84be9d297bfcecf8c87e9dfc10}{Borgatta}{B\bibinitperiod}{Edgar\bibnamedelima F.}{E\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c0273c84be9d297bfcecf8c87e9dfc10}
      \strng{fullhash}{c0273c84be9d297bfcecf8c87e9dfc10}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Group Psychotherapy}
      \field{title}{A diagnostic note on the construction of sociograms and action diagrams}
      \field{volume}{3}
      \field{year}{1951}
      \field{pages}{300\bibrangedash 308}
      \range{pages}{9}
    \endentry
    \entry{BPT06}{article}{}
      \name{author}{3}{}{%
        {{hash=53142415cea8ab5f8812bd7fe136b3f8}{B\"{o}r\"{o}czky}{B\bibinitperiod}{K\'{a}roly\bibnamedelima J.}{K\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b77e671d3935a6fe5f6dd45fb69317d2}
      \strng{fullhash}{b77e671d3935a6fe5f6dd45fb69317d2}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0129-0541}
      \field{journaltitle}{Internat. J. Found. Comput. Sci.}
      \field{number}{5}
      \field{title}{Planar crossing numbers of graphs embeddable in another surface}
      \field{volume}{17}
      \field{year}{2006}
      \field{pages}{1005\bibrangedash 1015}
      \range{pages}{11}
    \endentry
    \entry{B95}{article}{}
      \name{author}{1}{}{%
        {{hash=729f20e7843a528c868a91c4d4e7b804}{Borodin}{B\bibinitperiod}{Oleg\bibnamedelima V.}{O\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{729f20e7843a528c868a91c4d4e7b804}
      \strng{fullhash}{729f20e7843a528c868a91c4d4e7b804}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{4}
      \field{title}{A new proof of the {$6$} color theorem}
      \field{volume}{19}
      \field{year}{1995}
      \field{pages}{507\bibrangedash 521}
      \range{pages}{15}
    \endentry
    \entry{B18}{article}{}
      \name{author}{1}{}{%
        {{hash=cc7dc17fcaa5e9f6cc3d1ff6b287b77a}{Brandenburg}{B\bibinitperiod}{Franz\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cc7dc17fcaa5e9f6cc3d1ff6b287b77a}
      \strng{fullhash}{cc7dc17fcaa5e9f6cc3d1ff6b287b77a}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{1}
      \field{title}{Recognizing optimal 1-planar graphs in linear time}
      \field{volume}{80}
      \field{year}{2018}
      \field{pages}{1\bibrangedash 28}
      \range{pages}{28}
      \verb{doi}
      \verb 10.1007/s00453-016-0226-8
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00453-016-0226-8
      \endverb
    \endentry
    \entry{BEGKLM04}{incollection}{}
      \name{author}{6}{}{%
        {{hash=007bb71e4a062cd48962843f21c5a933}{Brandenburg}{B\bibinitperiod}{Franz}{F\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=5a0b95fef2629a33091ac55a4ff5f1ed}{Goodrich}{G\bibinitperiod}{Michael\bibnamedelima T.}{M\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
        {{hash=123e113ab51eb0c183fe920eb804b36b}{Kobourov}{K\bibinitperiod}{Stephen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{ec20747fcd91f70d4a00c1df9d2c5b60}
      \strng{fullhash}{cba564f4dc8f3674e31cbb8c571cfa67}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Selected open problems in graph drawing}
      \field{volume}{2912}
      \field{year}{2004}
      \field{pages}{515\bibrangedash 539}
      \range{pages}{25}
    \endentry
    \entry{BK85}{incollection}{}
      \name{author}{2}{}{%
        {{hash=69071610f5c1f249d20d77b4b96a5b09}{Brandst\"{a}dt}{B\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=5b3562b0f32fd18e197e049545720176}{Kratsch}{K\bibinitperiod}{Dieter}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{e79211bfdc8ec983f7be58bc9b9f6708}
      \strng{fullhash}{e79211bfdc8ec983f7be58bc9b9f6708}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Fundamentals of computation theory ({C}ottbus, 1985)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{On the restriction of some {NP}-complete graph problems to permutation graphs}
      \field{volume}{199}
      \field{year}{1985}
      \field{pages}{53\bibrangedash 62}
      \range{pages}{10}
      \verb{doi}
      \verb 10.1007/BFb0028791
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/BFb0028791
      \endverb
    \endentry
    \entry{BMP05}{book}{}
      \name{author}{3}{}{%
        {{hash=e97c77d50b87f3f6d931690fdd64f7a1}{Brass}{B\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=1806b0fdb8f49358d1e013202b1fdeec}{Moser}{M\bibinitperiod}{William}{W\bibinitperiod}{}{}{}{}}%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{83ec7854c79bbeb17d75435a25acca76}
      \strng{fullhash}{83ec7854c79bbeb17d75435a25acca76}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Research Problems in Discrete Geometry}
      \field{year}{2005}
    \endentry
    \entry{B45}{book}{}
      \name{author}{1}{}{%
        {{hash=8be9ed6316c6f644d32aa3bd81eabe35}{Bronfenbrenner}{B\bibinitperiod}{Urie}{U\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {New York: Beacon House}%
      }
      \strng{namehash}{8be9ed6316c6f644d32aa3bd81eabe35}
      \strng{fullhash}{8be9ed6316c6f644d32aa3bd81eabe35}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{number}{6}
      \field{series}{Sociometry monographs}
      \field{title}{The measurement of sociometric status, structure and development}
      \field{year}{1945}
      \field{pages}{80}
      \range{pages}{1}
    \endentry
    \entry{BK12}{incollection}{}
      \name{author}{2}{}{%
        {{hash=8f5b41eb8d60ae4135e7acfd66b6e282}{Bruckdorfer}{B\bibinitperiod}{Till}{T\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=33abfb46d14359e9e00e34f66644ecf3}{Kranakis}{K\bibinitperiod}{Evangelos}{E\bibinitperiod}{}{}{}{}}%
        {{hash=054cee70215556a681cc3206c9b0f2ed}{Krizanc}{K\bibinitperiod}{Danny}{D\bibinitperiod}{}{}{}{}}%
        {{hash=2066bdef933a57399b98026a26220b7a}{Luccio}{L\bibinitperiod}{Flaminia}{F\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{4d48977e6b53191f5a89b4e216bd5b98}
      \strng{fullhash}{4d48977e6b53191f5a89b4e216bd5b98}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Fun with Algorithms}
      \field{isbn}{978-3-642-30346-3}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Mad at Edge Crossings? {B}reak the Edges!}
      \field{volume}{7288}
      \field{year}{2012}
      \field{pages}{40\bibrangedash 50}
      \range{pages}{11}
    \endentry
    \entry{BCGJM?}{inbook}{}
      \name{author}{5}{}{%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7e88fd09f71f9b273a9b56d1a8f130f1}{Gutwenger}{G\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
        {{hash=4a117b5ce5db2cf138d6f22b42271ac6}{Juenger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=73002fbcaa8fe0ee76011401f23f2ab3}{Tamassia}{T\bibinitperiod}{Roberto}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{2}{%
        {Chapman}%
        {Hall/CRC}%
      }
      \strng{namehash}{c4070170c6e6c5f41f80f217d6ee9515}
      \strng{fullhash}{82846836a3e85ca87262538796c65f0e}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Handbook of Graph Drawing and Visualization}
      \field{chapter}{2}
      \strng{crossref}{T13?}
      \field{isbn}{1584884126}
      \field{series}{Discrete Mathematics and Its Applications}
      \field{title}{Crossings and Planarization}
      \field{year}{2013}
      \field{pages}{43\bibrangedash 86}
      \range{pages}{44}
    \endentry
    \entry{BEJKMW06}{incollection}{}
      \name{author}{6}{}{%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cd9a1c028ba3c4be93eaec6cbaa97ff5}{Ebner}{E\bibinitperiod}{Dietmar}{D\bibinitperiod}{}{}{}{}}%
        {{hash=01169310249847156f664ba0d45a28d2}{J\"{u}nger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=e88db6ebc2f179e930c7edbfd8d50aea}{Klau}{K\bibinitperiod}{Gunnar\bibnamedelima W.}{G\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f8bbc07a28cf646481ea6ae771d9d359}{Weiskircher}{W\bibinitperiod}{Ren\'{e}}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{c4070170c6e6c5f41f80f217d6ee9515}
      \strng{fullhash}{9daf1579b129b2d8f0a948ba88473299}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Exact crossing minimization}
      \field{volume}{3843}
      \field{year}{2006}
      \field{pages}{37\bibrangedash 48}
      \range{pages}{12}
    \endentry
    \entry{BH05}{article}{}
      \name{author}{2}{}{%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f3353ef3ca45cc167fd6dff09bd900d4}
      \strng{fullhash}{f3353ef3ca45cc167fd6dff09bd900d4}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1432-4350}
      \field{journaltitle}{Theory Comput. Syst.}
      \field{number}{3}
      \field{title}{Crossing minimization for symmetries}
      \field{volume}{38}
      \field{year}{2005}
      \field{pages}{293\bibrangedash 311}
      \range{pages}{19}
      \verb{doi}
      \verb 10.1007/s00224-005-1142-5
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00224-005-1142-5
      \endverb
    \endentry
    \entry{BJMP06}{incollection}{}
      \name{author}{4}{}{%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
        {{hash=01169310249847156f664ba0d45a28d2}{J\"{u}nger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=41ebffd08746e0ba67a959e5cc2c4925}{Menze}{M\bibinitperiod}{Annette}{A\bibinitperiod}{}{}{}{}}%
        {{hash=4a06e1c8e83ec569ba8e5ac98efd340b}{Percan}{P\bibinitperiod}{Merijam}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{c4070170c6e6c5f41f80f217d6ee9515}
      \strng{fullhash}{ddd874b8eead0684364bfbf7e9e0d39a}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and combinatorics}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Bimodal crossing minimization}
      \field{volume}{4112}
      \field{year}{2006}
      \field{pages}{497\bibrangedash 506}
      \range{pages}{10}
    \endentry
    \entry{BZ06}{incollection}{}
      \name{author}{2}{}{%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
        {{hash=cb515ebefb75fc6876905d48795d0dbf}{Zheng}{Z\bibinitperiod}{Lanbo}{L\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{a82c6bf7fabe068d930da95756ed83ab}
      \strng{fullhash}{a82c6bf7fabe068d930da95756ed83ab}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and combinatorics}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Fixed linear crossing minimization by reduction to the maximum cut problem}
      \field{volume}{4112}
      \field{year}{2006}
      \field{pages}{507\bibrangedash 516}
      \range{pages}{10}
    \endentry
    \entry{BH11}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=ba83e6dbee1b517f69c3335042c5c972}{Bukh}{B\bibinitperiod}{Boris}{B\bibinitperiod}{}{}{}{}}%
        {{hash=4eddcd087a3c310242ffbcd434e26ba2}{Hubard}{H\bibinitperiod}{Alfredo}{A\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=c10cbe85241ad372f5b2184f81f256d5}{Hurtado}{H\bibinitperiod}{Ferran}{F\bibinitperiod}{}{}{}{}}%
        {{hash=2159ffdedacdd002e1146ca441b012f3}{Kreveld}{K\bibinitperiod}{Marc\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{van}{v\bibinitperiod}{}{}}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{2124200252bd13b4fd21d6d74c20cd9d}
      \strng{fullhash}{2124200252bd13b4fd21d6d74c20cd9d}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 27th {ACM} Symposium on Computational Geometry, Paris, France, June 13-15, 2011}
      \field{isbn}{978-1-4503-0682-9}
      \field{title}{Space crossing numbers}
      \field{year}{2011}
      \field{pages}{163\bibrangedash 170}
      \range{pages}{8}
    \endentry
    \entry{B09}{book}{}
      \name{author}{1}{}{%
        {{hash=95a375c4eb30d98375e18e889943eec6}{Burdick}{B\bibinitperiod}{B.S.}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {John Hopkins University Press}%
      }
      \strng{namehash}{95a375c4eb30d98375e18e889943eec6}
      \strng{fullhash}{95a375c4eb30d98375e18e889943eec6}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{0-8018-8823-9}
      \field{title}{Mathematical works printed in the Americas, 1554-1700}
      \field{year}{2009}
    \endentry
    \entry{BFH19}{article}{}
      \name{author}{3}{}{%
        {{hash=50fa5993d8293396ccfa738b888e5f48}{Burger}{B\bibinitperiod}{Alewyn\bibnamedelima P.}{A\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5002c1d100f09ec779a015289b1cbb40}
      \strng{fullhash}{5002c1d100f09ec779a015289b1cbb40}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{3}
      \field{title}{Numbers of crossings for cycle graphs}
      \field{volume}{28}
      \field{year}{2019}
      \field{pages}{158\bibrangedash 169}
      \range{pages}{12}
    \endentry
    \entry{BH18}{article}{}
      \name{author}{2}{}{%
        {{hash=50fa5993d8293396ccfa738b888e5f48}{Burger}{B\bibinitperiod}{Alewyn\bibnamedelima P.}{A\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ff5459b3d2376c68dee08adc04fe9aae}
      \strng{fullhash}{ff5459b3d2376c68dee08adc04fe9aae}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{3}
      \field{title}{Numbers of crossings in drawings of the {P}etersen graph}
      \field{volume}{27}
      \field{year}{2018}
      \field{pages}{97\bibrangedash 102}
      \range{pages}{6}
    \endentry
    \entry{BS84}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=c7548fe4925780c4177651510acc74a1}{Buss}{B\bibinitperiod}{Jonathan\bibnamedelima F.}{J\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
        {{hash=3b264c30e125fd20f2e58f7bdbcfdc1d}{Shor}{S\bibinitperiod}{Peter\bibnamedelima W.}{P\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York, NY, USA}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{43fd177fe11be2af81971bfb5a47bad8}
      \strng{fullhash}{43fd177fe11be2af81971bfb5a47bad8}
      \field{sortinit}{B}
      \field{sortinithash}{4ecbea03efd0532989d3836d1a048c32}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the sixteenth annual ACM symposium on Theory of computing}
      \field{isbn}{0-89791-133-4}
      \field{series}{STOC '84}
      \field{title}{On the pagenumber of planar graphs}
      \field{year}{1984}
      \field{pages}{98\bibrangedash 100}
      \range{pages}{3}
    \endentry
    \entry{C13}{article}{}
      \name{author}{1}{}{%
        {{hash=396ad148a3423d444d4566ce0e31410c}{Cabello}{C\bibinitperiod}{Sergio}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{396ad148a3423d444d4566ce0e31410c}
      \strng{fullhash}{396ad148a3423d444d4566ce0e31410c}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{2}
      \field{title}{Hardness of {A}pproximation for {C}rossing {N}umber}
      \field{volume}{49}
      \field{year}{2013}
      \field{pages}{348\bibrangedash 358}
      \range{pages}{11}
    \endentry
    \entry{CM13}{article}{}
      \name{author}{2}{}{%
        {{hash=396ad148a3423d444d4566ce0e31410c}{{Cabello}}{C\bibinitperiod}{Sergio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{{Mohar}}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{db329aec2706e97e8cc4e831666a2a93}
      \strng{fullhash}{db329aec2706e97e8cc4e831666a2a93}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM Journal on Computing}
      \field{number}{5}
      \field{title}{Adding One Edge to Planar Graphs Makes Crossing Number and $1$-Planarity Hard}
      \field{volume}{42}
      \field{year}{2013}
      \field{pages}{1803\bibrangedash 1829}
      \range{pages}{27}
      \verb{doi}
      \verb 10.1137/120872310
      \endverb
      \verb{eprint}
      \verb http://epubs.siam.org/doi/pdf/10.1137/120872310
      \endverb
      \verb{url}
      \verb http://epubs.siam.org/doi/abs/10.1137/120872310
      \endverb
    \endentry
    \entry{CM10}{incollection}{}
      \name{author}{2}{}{%
        {{hash=396ad148a3423d444d4566ce0e31410c}{Cabello}{C\bibinitperiod}{Sergio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{db329aec2706e97e8cc4e831666a2a93}
      \strng{fullhash}{db329aec2706e97e8cc4e831666a2a93}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computational geometry ({SCG}'10)}
      \field{title}{Adding one edge to planar graphs makes crossing number hard}
      \field{year}{2010}
      \field{pages}{68\bibrangedash 76}
      \range{pages}{9}
    \endentry
    \entry{CMS15}{article}{}
      \name{author}{3}{}{%
        {{hash=396ad148a3423d444d4566ce0e31410c}{Cabello}{C\bibinitperiod}{Sergio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
        {{hash=85a8068fa3610dbadbc4305d265148d9}{\v{S}\'{a}mal}{\v{S}\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{608b53bde63342ef76129fc6bef3c469}
      \strng{fullhash}{608b53bde63342ef76129fc6bef3c469}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1571-0653}
      \field{journaltitle}{Electronic Notes in Discrete Mathematics}
      \field{note}{The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015}
      \field{title}{Drawing a disconnected graph on the torus (Extended abstract)}
      \field{volume}{49}
      \field{year}{2015}
      \field{pages}{779\bibrangedash 786}
      \range{pages}{8}
      \verb{doi}
      \verb http://dx.doi.org/10.1016/j.endm.2015.06.105
      \endverb
      \verb{url}
      \verb http://www.sciencedirect.com/science/article/pii/S1571065315001511
      \endverb
    \endentry
    \entry{CGN19}{article}{}
      \name{author}{3}{}{%
        {{hash=b78597cb56c51b7bf264ad7f3b757cf6}{Cairns}{C\bibinitperiod}{Grant}{G\bibinitperiod}{}{}{}{}}%
        {{hash=457bdb681c6653d92991c79333edf92a}{Groves}{G\bibinitperiod}{Emily}{E\bibinitperiod}{}{}{}{}}%
        {{hash=8baf4e083762d1d511a232a4ed5baa14}{Nikolayevsky}{N\bibinitperiod}{Yuri}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{932a1327c2a5f8f7dfcb6f9412a33b07}
      \strng{fullhash}{932a1327c2a5f8f7dfcb6f9412a33b07}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{2202-3518}
      \field{issue}{3}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{Bad drawings of small complete graphs}
      \field{volume}{75}
      \field{year}{2019}
      \field{pages}{322\bibrangedash 342}
      \range{pages}{21}
    \endentry
    \entry{CFMMKKMW19}{article}{}
      \name{author}{7}{}{%
        {{hash=11132c00caf6822b99f0ce040f761be5}{Camacho}{C\bibinitperiod}{Charles}{C\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=00f37393e0e9834c506ebe823ea7642b}{Milutinovi\'{c}}{M\bibinitperiod}{Marija\bibnamedelima Jeli\'{c}}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=f71322018742815cb3bdb9a48e13eb6a}{Kirsch}{K\bibinitperiod}{Rachel}{R\bibinitperiod}{}{}{}{}}%
        {{hash=4e1e392a69c41a1488eaf46d683e48ed}{Kleist}{K\bibinitperiod}{Linda}{L\bibinitperiod}{}{}{}{}}%
        {{hash=a25160a07a14a70099afb9c625ea8f3d}{Matson}{M\bibinitperiod}{Elizabeth\bibnamedelima Bailey}{E\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=06e53af95c25693f700b8c78f952e33a}{White}{W\bibinitperiod}{Jennifer}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{23aafe226f1a97e45b51148e8e509c59}
      \strng{fullhash}{d9045fe3c5293d3b40b59e9412ca3fba}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1910.06963} (last accessed 8/20/2020)}
      \field{title}{Bounding the tripartite-circle crossing number of complete tripartite graphs}
      \field{year}{2019}
      \verb{eprint}
      \verb 1910.06963
      \endverb
    \endentry
    \entry{CFMMKKMW19b}{article}{}
      \name{author}{7}{}{%
        {{hash=11132c00caf6822b99f0ce040f761be5}{Camacho}{C\bibinitperiod}{Charles}{C\bibinitperiod}{}{}{}{}}%
        {{hash=ee4b2505aa74f61517619a02ecbf70c6}{Fern\'{a}ndez-Merchant}{F\bibinithyphendelim M\bibinitperiod}{Silvia}{S\bibinitperiod}{}{}{}{}}%
        {{hash=00f37393e0e9834c506ebe823ea7642b}{Milutinovi\'{c}}{M\bibinitperiod}{Marija\bibnamedelima Jeli\'{c}}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=f71322018742815cb3bdb9a48e13eb6a}{Kirsch}{K\bibinitperiod}{Rachel}{R\bibinitperiod}{}{}{}{}}%
        {{hash=4e1e392a69c41a1488eaf46d683e48ed}{Kleist}{K\bibinitperiod}{Linda}{L\bibinitperiod}{}{}{}{}}%
        {{hash=a25160a07a14a70099afb9c625ea8f3d}{Matson}{M\bibinitperiod}{Elizabeth\bibnamedelima Bailey}{E\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=06e53af95c25693f700b8c78f952e33a}{White}{W\bibinitperiod}{Jennifer}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{23aafe226f1a97e45b51148e8e509c59}
      \strng{fullhash}{d9045fe3c5293d3b40b59e9412ca3fba}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0862-9544}
      \field{journaltitle}{Acta Math. Univ. Comenian. (N.S.)}
      \field{number}{3}
      \field{title}{Bounding the tripartite-circle crossing number of complete tripartite graphs}
      \field{volume}{88}
      \field{year}{2019}
      \field{pages}{515\bibrangedash 520}
      \range{pages}{6}
    \endentry
    \entry{CdC16}{article}{}
      \name{author}{2}{}{%
        {{hash=f85bc051603a722171ad7a691b4dfeee}{{Carpentier}}{C\bibinitperiod}{Sylvain}{S\bibinitperiod}{}{}{}{}}%
        {{hash=f38f52a6a7b9512b96cbd3b8c53e2e12}{{del\bibnamedelimb Campo}}{d\bibinitperiod}{Adan\bibnamedelimb Medrano\bibnamedelima Martin}{A\bibinitperiod\bibinitdelim M\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7b20d8aa25cf4154c77fc42dc1d976c5}
      \strng{fullhash}{7b20d8aa25cf4154c77fc42dc1d976c5}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{04}
      \field{note}{\arxiv{1604.06176} (last accessed 9/21/2017)}
      \field{title}{{Tropical Embeddings of Metric Graphs}}
      \field{year}{2016}
      \verb{eprint}
      \verb 1604.06176
      \endverb
    \endentry
    \entry{CDMY16}{article}{}
      \name{author}{4}{}{%
        {{hash=a2f9051cd1e54859cb1412f295a55171}{Cartwright}{C\bibinitperiod}{Dustin}{D\bibinitperiod}{}{}{}{}}%
        {{hash=76a7579d94d000dca5e0071fb3b69382}{Dudzik}{D\bibinitperiod}{Andrew}{A\bibinitperiod}{}{}{}{}}%
        {{hash=e4d2b00e0a668cdb0b41d67072724c5b}{Manjunath}{M\bibinitperiod}{Madhusudan}{M\bibinitperiod}{}{}{}{}}%
        {{hash=6eeb7f2c1fa2eff006ff7b13c8d06b0d}{Yao}{Y\bibinitperiod}{Yuan}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{024ecbe43b7c41f33cade4a617ae8d9e}
      \strng{fullhash}{de0da19102438800d6e78e51938be373}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0010-0757}
      \field{journaltitle}{Collect. Math.}
      \field{number}{1}
      \field{title}{Embeddings and immersions of tropical curves}
      \field{volume}{67}
      \field{year}{2016}
      \field{pages}{1\bibrangedash 19}
      \range{pages}{19}
      \verb{doi}
      \verb 10.1007/s13348-015-0149-8
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s13348-015-0149-8
      \endverb
    \endentry
    \entry{CKKPSS03}{article}{}
      \name{author}{6}{}{%
        {{hash=2d99a0bab34385f4500cb6922d70b918}{\v{C}ern\'{y}}{\v{C}\bibinitperiod}{Jakub}{J\bibinitperiod}{}{}{}{}}%
        {{hash=3800dd80861f3fb7ca8e8ea5810fe539}{K\'{a}ra}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
        {{hash=b8e2c356eb7c73b1e4634ed91a45d45a}{Kr\'{a}\v{l}}{K\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=da46e2ce0fdd2a6da1aa2b25b819f1b4}{Podbrdsk\'{y}}{P\bibinitperiod}{Pavel}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f354d194c335693d41240ebb554dcbef}{Sot\'{a}kov\'{a}}{S\bibinitperiod}{Miroslava}{M\bibinitperiod}{}{}{}{}}%
        {{hash=85a8068fa3610dbadbc4305d265148d9}{\v{S}\'{a}mal}{\v{S}\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7ce112e023e2c493b3ad6b2f1ccafc59}
      \strng{fullhash}{ba07ba80693960fa29e53492e0addebf}
      \field{sortinit}{\v{C}}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0010-2628}
      \field{journaltitle}{Comment. Math. Univ. Carolin.}
      \field{number}{2}
      \field{title}{On the number of intersections of two polygons}
      \field{volume}{44}
      \field{year}{2003}
      \field{pages}{217\bibrangedash 228}
      \range{pages}{12}
    \endentry
    \entry{CMG13}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=08ffa98c17e736e935ce0802d1455164}{Chae}{C\bibinitperiod}{Sangwon}{S\bibinitperiod}{}{}{}{}}%
        {{hash=ceb40d39c04aadd42b5a9fe0c8bd1489}{Majumder}{M\bibinitperiod}{Aditi}{A\bibinitperiod}{}{}{}{}}%
        {{hash=bee2d9355a0889769b8bbb9aa39a20c8}{Gopi}{G\bibinitperiod}{M.}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Mumbai, India}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{576e5b8c882febd00fe1bb495157abaf}
      \strng{fullhash}{576e5b8c882febd00fe1bb495157abaf}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing}
      \field{isbn}{978-1-4503-1660-6}
      \field{series}{ICVGIP '12}
      \field{title}{{HD-GraphViz}: highly distributed graph visualization on tiled displays}
      \field{year}{2012}
      \field{pages}{43:1\bibrangedash 43:8}
      \range{pages}{-1}
      \verb{url}
      \verb http://doi.acm.org/10.1145/2425333.2425376
      \endverb
    \endentry
    \entry{CG09}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=f0a435e95e8dad1267870edcca0382b8}{Chalopin}{C\bibinitperiod}{J\'{e}r\'{e}mie}{J\bibinitperiod}{}{}{}{}}%
        {{hash=5877caa7d9927d50dc43f09389e0e548}{Gon\c{c}alves}{G\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=4dbcb1c7060726deee27d97b4bf31321}{Mitzenmacher}{M\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{365a1fc5310ec720463ea3cb8e5abe15}
      \strng{fullhash}{365a1fc5310ec720463ea3cb8e5abe15}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{{STOC}}
      \field{isbn}{978-1-60558-506-2}
      \field{title}{Every planar graph is the intersection graph of segments in the plane: extended abstract}
      \field{year}{2009}
      \field{pages}{631\bibrangedash 638}
      \range{pages}{8}
    \endentry
    \entry{CGO11}{article}{}
      \name{author}{3}{}{%
        {{hash=f0a435e95e8dad1267870edcca0382b8}{Chalopin}{C\bibinitperiod}{J\'{e}r\'{e}mie}{J\bibinitperiod}{}{}{}{}}%
        {{hash=5877caa7d9927d50dc43f09389e0e548}{Gon\c{c}alves}{G\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=b3eaaac6dfe3e1b8996667e7324f51aa}{Ochem}{O\bibinitperiod}{Pascal}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ae4519ce5f161b0dc54c2958529e326f}
      \strng{fullhash}{ae4519ce5f161b0dc54c2958529e326f}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{3}
      \field{title}{Planar graphs have 1-string representations}
      \field{volume}{43}
      \field{year}{2010}
      \field{pages}{626\bibrangedash 647}
      \range{pages}{22}
    \endentry
    \entry{CFGLMS15}{article}{}
      \name{author}{6}{}{%
        {{hash=34c12f57c449c29b3ae46ebfbe5af6bc}{Chan}{C\bibinitperiod}{{Timothy}\bibnamedelima {M}.}{T\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=ecc048123c454e371e2a99677d54ec4d}{Frati}{F\bibinitperiod}{{Fabrizio}}{F\bibinitperiod}{}{}{}{}}%
        {{hash=7e88fd09f71f9b273a9b56d1a8f130f1}{Gutwenger}{G\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
        {{hash=73aee614481d4bc018f38ffa4d43a239}{Lubiw}{L\bibinitperiod}{Anna}{A\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{baf5a7588a2fd7f93fb16cf99a230b94}
      \strng{fullhash}{3ab0e7c12860aa4b7b33a924cca1711d}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Graph Algorithms and Applications}
      \field{number}{2}
      \field{title}{Drawing Partially Embedded and Simultaneously Planar Graphs}
      \field{volume}{19}
      \field{year}{2015}
      \field{pages}{681\bibrangedash 706}
      \range{pages}{26}
      \verb{doi}
      \verb 10.7155/jgaa.00375
      \endverb
    \endentry
    \entry{CDKPRW19}{inproceedings}{}
      \name{author}{6}{}{%
        {{hash=fda71ff69e804bf7085bb836c9c2b8a6}{Chaplick}{C\bibinitperiod}{Steven}{S\bibinitperiod}{}{}{}{}}%
        {{hash=2ae3923c967571da87e3dd1e867495f5}{Dijk}{D\bibinitperiod}{Thomas\bibnamedelima C.}{T\bibinitperiod\bibinitdelim C\bibinitperiod}{van}{v\bibinitperiod}{}{}}%
        {{hash=3c370fd0ab1db62bb1f7e3f158c41f72}{Kryven}{K\bibinitperiod}{Myroslav}{M\bibinitperiod}{}{}{}{}}%
        {{hash=695045a7fa613bde9a01e1ce1e442bb9}{Park}{P\bibinitperiod}{Ji{-}won}{J\bibinitperiod}{}{}{}{}}%
        {{hash=6cfd3ef20a39fe6450f0ff1caa0576dc}{Ravsky}{R\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
        {{hash=7e010c9835c528b6dea6ec84022a5735}{Wolff}{W\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=58dc474a1a65276a2a818af139e0964f}{Archambault}{A\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=aae880d79266219814a56d27fd81777c}{T\'{o}th}{T\bibinitperiod}{Csaba\bibnamedelima D.}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{22e499da4d6ffcebe4b5c23437cdb21c}
      \strng{fullhash}{02a483742bfd4eab4ec191b6f7a48f89}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing and Network Visualization}
      \field{isbn}{978-3-030-35802-0}
      \field{title}{Bundled Crossings Revisited}
      \field{year}{2019}
      \field{pages}{63\bibrangedash 77}
      \range{pages}{15}
    \endentry
    \entry{CS18}{article}{}
      \name{author}{2}{}{%
        {{hash=e64e05b60e285d389253f4c0e695df74}{Chekuri}{C\bibinitperiod}{Chandra}{C\bibinitperiod}{}{}{}{}}%
        {{hash=d1c90ebf509da5da2f408206aab64eb0}{Sidiropoulos}{S\bibinitperiod}{Anastasios}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b03217e2671fc5bb3b0ea7d0aed7155c}
      \strng{fullhash}{b03217e2671fc5bb3b0ea7d0aed7155c}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0097-5397}
      \field{journaltitle}{SIAM J. Comput.}
      \field{number}{4}
      \field{title}{Approximation algorithms for {E}uler genus and related problems}
      \field{volume}{47}
      \field{year}{2018}
      \field{pages}{1610\bibrangedash 1643}
      \range{pages}{34}
      \verb{doi}
      \verb 10.1137/14099228X
      \endverb
      \verb{url}
      \verb https://doi.org/10.1137/14099228X
      \endverb
    \endentry
    \entry{CL98}{article}{}
      \name{author}{2}{}{%
        {{hash=647372d2513391a9b25693205f2d4479}{Chen}{C\bibinitperiod}{Hsiao-Feng\bibnamedelima Steven}{H\bibinithyphendelim F\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=98068584728530b419130639cedb4712}{Lee}{L\bibinitperiod}{D.\bibnamedelimi T.}{D\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{07a181486c5d5c4d12bb8c6898b2746d}
      \strng{fullhash}{07a181486c5d5c4d12bb8c6898b2746d}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{IEEE Trans. on CAD of Integrated Circuits and Systems}
      \field{number}{5}
      \field{title}{On crossing minimization problem}
      \field{volume}{17}
      \field{year}{1998}
      \field{pages}{406\bibrangedash 418}
      \range{pages}{13}
    \endentry
    \entry{CK03}{incollection}{}
      \name{author}{2}{}{%
        {{hash=045b787f307f8d8ac9cc879547573e2d}{Chen}{C\bibinitperiod}{Zhi-Zhong}{Z\bibinithyphendelim Z\bibinitperiod}{}{}{}{}}%
        {{hash=b79b2341505e947402cb36318073fc79}{Kouno}{K\bibinitperiod}{Mitsuharu}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{ab83ea8ac3215724a829d3034fa218c7}
      \strng{fullhash}{ab83ea8ac3215724a829d3034fa218c7}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Mathematical foundations of computer science 2003}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{A linear-time algorithm for $7$-coloring $1$-planar graphs (extended abstract)}
      \field{volume}{2747}
      \field{year}{2003}
      \field{pages}{348\bibrangedash 357}
      \range{pages}{10}
    \endentry
    \entry{C20}{article}{}
      \name{author}{1}{}{%
        {{hash=1c325c1cd9c3087171f8fa10b7974b97}{Cheon}{C\bibinitperiod}{Hyungkyu}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1c325c1cd9c3087171f8fa10b7974b97}
      \strng{fullhash}{1c325c1cd9c3087171f8fa10b7974b97}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2011.08371} (last accessed 11/22/2020)}
      \field{title}{The Crossing Number of Circulant Graph ${C}(3k+ 1;\{1, k\})$ on the Projective Plane}
      \field{year}{2020}
      \verb{eprint}
      \verb 2011.08371
      \endverb
    \endentry
    \entry{C08b}{thesis}{}
      \name{author}{1}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Technische Universit\"{a}t Dortmund}%
      }
      \list{location}{1}{%
        {Dortmund}%
      }
      \strng{namehash}{00be49d6c82de83cdc772bfa01086512}
      \strng{fullhash}{00be49d6c82de83cdc772bfa01086512}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Computing crossing numbers}
      \field{type}{phdthesis}
      \field{year}{2008}
    \endentry
    \entry{CDHK11}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=95eda6e51fd4336edbd2689b9e5d08f5}{Derka}{D\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=db7bea607ab4c9982dfe35ced798a6c3}{Hlin\v{e}ny}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=775b35ae349386802a314aa33e3dbae9}{Klus\'{a}\v{c}ek}{K\bibinitperiod}{Mat\v{e}j}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=828b19266d759d64645a9b33c4d0f223}{Iliopoulos}{I\bibinitperiod}{Costas\bibnamedelima S.}{C\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=dc6f970aff4f9647d76148f4825d8e73}{Smyth}{S\bibinitperiod}{William\bibnamedelima F.}{W\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{a1d5e50141fba34aa72f485f29c2842c}
      \strng{fullhash}{335daf1b2036a266a21e15fc0846390f}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial Algorithms}
      \field{isbn}{978-3-642-25010-1}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{How Not to Characterize Planar-Emulable Graphs}
      \field{volume}{7056}
      \field{year}{2011}
      \field{pages}{106\bibrangedash 120}
      \range{pages}{15}
    \endentry
    \entry{CFKUVW18}{article}{}
      \name{author}{6}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=1ec78ded1656441459b1960fbc1e7d68}{Felsner}{F\bibinitperiod}{Stefan}{S\bibinitperiod}{}{}{}{}}%
        {{hash=123e113ab51eb0c183fe920eb804b36b}{Kobourov}{K\bibinitperiod}{Stephen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=489c61d4e2b7d5975951963b06d031bd}{Ueckerdt}{U\bibinitperiod}{Torsten}{T\bibinitperiod}{}{}{}{}}%
        {{hash=2e1a273e0c1af98d23258eba7882f230}{Valtr}{V\bibinitperiod}{Pavel}{P\bibinitperiod}{}{}{}{}}%
        {{hash=7e010c9835c528b6dea6ec84022a5735}{Wolff}{W\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a1d5e50141fba34aa72f485f29c2842c}
      \strng{fullhash}{d6f390a93b0b585723afcec8413247fe}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{On the maximum crossing number}
      \field{volume}{22}
      \field{year}{2018}
      \field{pages}{67\bibrangedash 87}
      \range{pages}{21}
      \verb{doi}
      \verb 10.7155/jgaa.00458
      \endverb
      \verb{url}
      \verb https://doi.org/10.7155/jgaa.00458
      \endverb
    \endentry
    \entry{CG15}{article}{}
      \name{author}{2}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{{Chimani}}{C\bibinitperiod}{{Markus}}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7e88fd09f71f9b273a9b56d1a8f130f1}{{Gutwenger}}{G\bibinitperiod}{{Carsten}}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{fac267659e218ce94b0750e6e7463b5c}
      \strng{fullhash}{fac267659e218ce94b0750e6e7463b5c}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Graph Algorithms and Applications}
      \field{number}{1}
      \field{title}{Hypergraph and Minor Crossing Number Problems}
      \field{volume}{19}
      \field{year}{2015}
      \field{pages}{191\bibrangedash 222}
      \range{pages}{32}
      \verb{doi}
      \verb 10.7155/jgaa.00353
      \endverb
    \endentry
    \entry{CGMW10}{article}{}
      \name{author}{4}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7e88fd09f71f9b273a9b56d1a8f130f1}{Gutwenger}{G\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=bd5f98571975ce3206c8d8e8fb42e8f1}{Wong}{W\bibinitperiod}{Hoi-Ming}{H\bibinithyphendelim M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a1d5e50141fba34aa72f485f29c2842c}
      \strng{fullhash}{260324ba033af47584a5d3838330d512}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1084-6654}
      \field{journaltitle}{ACM J. Exp. Algorithmics}
      \field{title}{Layer-free upward crossing minimization}
      \field{volume}{15}
      \field{year}{2010}
      \field{pages}{Paper 2.2\bibrangessep 27}
      \range{pages}{-1}
    \endentry
    \entry{CHS20}{article}{}
      \name{author}{3}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=c4ffb32948da81571dcb1d9f582c32fa}{Hlin\v{e}n\'{y}}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c9e0901d22b55904386d21bc10f1e9be}
      \strng{fullhash}{c9e0901d22b55904386d21bc10f1e9be}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{title}{Toroidal grid minors and stretch in embedded graphs}
      \field{volume}{140}
      \field{year}{2020}
      \field{pages}{323\bibrangedash 371}
      \range{pages}{49}
      \verb{doi}
      \verb 10.1016/j.jctb.2019.05.009
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.jctb.2019.05.009
      \endverb
    \endentry
    \entry{CJS08}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=01169310249847156f664ba0d45a28d2}{J\"{u}nger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=c51914f1cbb699e35ec6df3a0c76b741}{Schulz}{S\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE}%
      }
      \strng{namehash}{a06d32e381ef2bee4f2050aecedc8641}
      \strng{fullhash}{a06d32e381ef2bee4f2050aecedc8641}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Visualization Symposium, 2008. PacificVIS '08.}
      \field{title}{Crossing Minimization meets Simultaneous Drawing}
      \field{year}{2008}
      \field{pages}{33\bibrangedash 40}
      \range{pages}{8}
    \endentry
    \entry{CKMV19}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=524db8355edb4ced5744e3212ace7f1f}{Kindermann}{K\bibinitperiod}{Philipp}{P\bibinitperiod}{}{}{}{}}%
        {{hash=7d280fb38c0e2fc3e75172ed46494417}{Montecchiani}{M\bibinitperiod}{Fabrizio}{F\bibinitperiod}{}{}{}{}}%
        {{hash=2e1a273e0c1af98d23258eba7882f230}{Valtr}{V\bibinitperiod}{Pavel}{P\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=58dc474a1a65276a2a818af139e0964f}{Archambault}{A\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
        {{hash=aae880d79266219814a56d27fd81777c}{T\'{o}th}{T\bibinitperiod}{Csaba\bibnamedelima D.}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{a1d5e50141fba34aa72f485f29c2842c}
      \strng{fullhash}{7693a181bd44ac853396843f4b12c5ce}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing and Network Visualization}
      \field{isbn}{978-3-030-35802-0}
      \field{title}{Crossing Numbers of Beyond-Planar Graphs}
      \field{year}{2019}
      \field{pages}{78\bibrangedash 86}
      \range{pages}{9}
    \endentry
    \entry{CZ14}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=f77735558142bc677e5974c96672a067}{Zeranski}{Z\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{fe492f9faee444cf25ebc95b776bc88d}
      \strng{fullhash}{fe492f9faee444cf25ebc95b776bc88d}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{SIAM Meeting on Algorithm Engineering \& Experiments (ALENEX'14)}
      \field{title}{An Exact Approach To Upward Crossing Minimization}
      \field{year}{2014}
    \endentry
    \entry{CZ13}{incollection}{}
      \name{author}{2}{}{%
        {{hash=00be49d6c82de83cdc772bfa01086512}{Chimani}{C\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=f77735558142bc677e5974c96672a067}{Zeranski}{Z\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=7fa752e8dfeed5c502b98c76d52795ed}{Didimo}{D\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
        {{hash=c443f4519e06a4a6cd62fca1a19d92ec}{Patrignani}{P\bibinitperiod}{Maurizio}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{fe492f9faee444cf25ebc95b776bc88d}
      \strng{fullhash}{fe492f9faee444cf25ebc95b776bc88d}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{978-3-642-36762-5}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Upward Planarity Testing via {SAT}}
      \field{volume}{7704}
      \field{year}{2013}
      \field{pages}{248\bibrangedash 259}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-642-36763-2_22
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-642-36763-2_22
      \endverb
    \endentry
    \entry{C34}{article}{}
      \name{author}{1}{}{%
        {{hash=b21d165685b5e9762ce6d35177a24caa}{Chojnacki\bibnamedelimb (Haim\bibnamedelima Hanani)}{C\bibinitperiod\bibinitdelim (\bibinitperiod\bibinitdelim H\bibinitperiod}{Chaim}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b21d165685b5e9762ce6d35177a24caa}
      \strng{fullhash}{b21d165685b5e9762ce6d35177a24caa}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Fundamenta Mathematicae}
      \field{title}{\"{U}ber wesentlich unpl\"{a}ttbare {K}urven im drei-dimensionalen {R}aume}
      \field{volume}{23}
      \field{year}{1934}
      \field{pages}{135\bibrangedash 142}
      \range{pages}{8}
    \endentry
    \entry{CRS13}{article}{}
      \name{author}{3}{}{%
        {{hash=86a6aa36f153eb18e77016d556af9fa0}{Christian}{C\bibinitperiod}{Robin}{R\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5b0e9b94911c59735e92e0bd4a047efd}
      \strng{fullhash}{5b0e9b94911c59735e92e0bd4a047efd}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{2}
      \field{title}{Zarankiewicz's conjecture is finite for each fixed {$m$}}
      \field{volume}{103}
      \field{year}{2013}
      \field{pages}{237\bibrangedash 247}
      \range{pages}{11}
    \endentry
    \entry{CK97}{article}{}
      \name{author}{2}{}{%
        {{hash=c2bf0769f0e18517541f5b632f9517f4}{Chrobak}{C\bibinitperiod}{Marek}{M\bibinitperiod}{}{}{}{}}%
        {{hash=1466d039eea2fd291d219ef1d04b22c4}{Kant}{K\bibinitperiod}{Goos}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{15efc0b2479e56b06be6a07f78ec23c9}
      \strng{fullhash}{15efc0b2479e56b06be6a07f78ec23c9}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0218-1959}
      \field{journaltitle}{Internat. J. Comput. Geom. Appl.}
      \field{number}{3}
      \field{title}{Convex grid drawings of {$3$}-connected planar graphs}
      \field{volume}{7}
      \field{year}{1997}
      \field{pages}{211\bibrangedash 223}
      \range{pages}{13}
    \endentry
    \entry{C1889}{book}{}
      \name{author}{1}{}{%
        {{hash=76cc8a1221324508f50518284d87d88e}{Chrystal}{C\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Edinburgh}%
      }
      \list{publisher}{2}{%
        {Adam}%
        {Charles Black}%
      }
      \strng{namehash}{76cc8a1221324508f50518284d87d88e}
      \strng{fullhash}{76cc8a1221324508f50518284d87d88e}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{part}{2}
      \field{title}{Algebra: {A}n elementary text-book for the higher classes of secondary schools and for colleges}
      \field{year}{1889}
      \field{pages}{xxiv+616}
      \range{pages}{-1}
    \endentry
    \entry{CLTR85}{incollection}{}
      \name{author}{3}{}{%
        {{hash=85340a21e39a9ffe7f852a8fdd0251f6}{Chung}{C\bibinitperiod}{Fan\bibnamedelimb R.\bibnamedelimi K.}{F\bibinitperiod\bibinitdelim R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=1bc69b6e568fb20539c7c24b6ec4230d}{Leighton}{L\bibinitperiod}{Frank\bibnamedelima Thomson}{F\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
        {{hash=7d7b3a506d1a93f9e678bc71ea1587a3}{Rosenberg}{R\bibinitperiod}{Arnold\bibnamedelima L.}{A\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Wiley}%
      }
      \strng{namehash}{84011b20c0f62ddef20ba7ea1789b788}
      \strng{fullhash}{84011b20c0f62ddef20ba7ea1789b788}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph theory with applications to algorithms and computer science ({K}alamazoo, {M}ich., 1984)}
      \field{series}{Wiley-Intersci. Publ.}
      \field{title}{Embedding graphs in books: a layout problem with applications to {VLSI} design}
      \field{year}{1985}
      \field{pages}{175\bibrangedash 188}
      \range{pages}{14}
    \endentry
    \entry{C11}{incollection}{}
      \name{author}{1}{}{%
        {{hash=ca9a15097647ba3b5fe151394f0efd33}{Chuzhoy}{C\bibinitperiod}{Julia}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{ca9a15097647ba3b5fe151394f0efd33}
      \strng{fullhash}{ca9a15097647ba3b5fe151394f0efd33}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{S{TOC}'11---{P}roceedings of the 43rd {ACM} {S}ymposium on {T}heory of {C}omputing}
      \field{title}{An algorithm for the graph crossing number problem [extended abstract]}
      \field{year}{2011}
      \field{pages}{303\bibrangedash 312}
      \range{pages}{10}
    \endentry
    \entry{CMT20}{article}{}
      \name{author}{3}{}{%
        {{hash=ca9a15097647ba3b5fe151394f0efd33}{Chuzhoy}{C\bibinitperiod}{Julia}{J\bibinitperiod}{}{}{}{}}%
        {{hash=26d89458f626cf6caa226ed4f20e6ae4}{Mahabadi}{M\bibinitperiod}{Sepideh}{S\bibinitperiod}{}{}{}{}}%
        {{hash=a891f809886c7453559d90dacce75b92}{Tan}{T\bibinitperiod}{Zihan}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cfb8486edd6a0aaa62fafbe0ae4d5d95}
      \strng{fullhash}{cfb8486edd6a0aaa62fafbe0ae4d5d95}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.DS}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2011.06545} (last accessed 1/7/2021)}
      \field{title}{Towards Better Approximation of Graph Crossing Number}
      \field{year}{2020}
      \verb{eprint}
      \verb 2011.06545
      \endverb
    \endentry
    \entry{C06}{article}{}
      \name{author}{1}{}{%
        {{hash=a871798ae1b8a42ecb6f4e1c7999ad23}{Cimikowski}{C\bibinitperiod}{Robert\bibnamedelima J.}{R\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Kluwer Academic Publishers}%
      }
      \strng{namehash}{a871798ae1b8a42ecb6f4e1c7999ad23}
      \strng{fullhash}{a871798ae1b8a42ecb6f4e1c7999ad23}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1381-1231}
      \field{issue}{3}
      \field{journaltitle}{Journal of Heuristics}
      \field{title}{An analysis of some linear graph layout heuristics}
      \field{volume}{12}
      \field{year}{2006}
      \field{pages}{143\bibrangedash 153}
      \range{pages}{11}
    \endentry
    \entry{C92}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=a871798ae1b8a42ecb6f4e1c7999ad23}{Cimikowski}{C\bibinitperiod}{Robert\bibnamedelima J.}{R\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a871798ae1b8a42ecb6f4e1c7999ad23}
      \strng{fullhash}{a871798ae1b8a42ecb6f4e1c7999ad23}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Graph planarization and skewness}
      \field{volume}{88}
      \field{year}{1992}
      \field{pages}{21\bibrangedash 32}
      \range{pages}{12}
    \endentry
    \entry{CM07}{article}{}
      \name{author}{2}{}{%
        {{hash=a871798ae1b8a42ecb6f4e1c7999ad23}{Cimikowski}{C\bibinitperiod}{Robert\bibnamedelima J.}{R\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=40b82a3a1683fe4c3c737f3d213ec1f0}{Mumey}{M\bibinitperiod}{Brendan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8a0f651d8894ff59c6e909d7ec851f8e}
      \strng{fullhash}{8a0f651d8894ff59c6e909d7ec851f8e}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{number}{17}
      \field{title}{Approximating the fixed linear crossing number}
      \field{volume}{155}
      \field{year}{2007}
      \field{pages}{2202\bibrangedash 2210}
      \range{pages}{9}
    \endentry
    \entry{CHN19}{article}{}
      \name{author}{3}{}{%
        {{hash=b368963987f09e0771a116aa17660500}{Clancy}{C\bibinitperiod}{Kieran}{K\bibinitperiod}{}{}{}{}}%
        {{hash=ae9eeebf572fbc2c155224ae205d148d}{Haythorpe}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d13e92a7aabf201237dbe3f05922ad76}{Newcombe}{N\bibinitperiod}{Alex}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2461a1f35834f687158fe1ff6d83f2d1}
      \strng{fullhash}{2461a1f35834f687158fe1ff6d83f2d1}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1901.05155} (last accessed 2/3/2020)}
      \field{title}{A survey of graphs with known or bounded crossing numbers}
      \field{year}{2019}
      \verb{eprint}
      \verb 1901.05155
      \endverb
    \endentry
    \entry{CHN20}{article}{}
      \name{author}{3}{}{%
        {{hash=b368963987f09e0771a116aa17660500}{Clancy}{C\bibinitperiod}{Kieran}{K\bibinitperiod}{}{}{}{}}%
        {{hash=ae9eeebf572fbc2c155224ae205d148d}{Haythorpe}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d13e92a7aabf201237dbe3f05922ad76}{Newcombe}{N\bibinitperiod}{Alex}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2461a1f35834f687158fe1ff6d83f2d1}
      \strng{fullhash}{2461a1f35834f687158fe1ff6d83f2d1}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1034-4942}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{A survey of graphs with known or bounded crossing numbers}
      \field{volume}{78}
      \field{year}{2020}
      \field{pages}{209\bibrangedash 296}
      \range{pages}{88}
      \verb{doi}
      \verb 10.1016/j.apm.2019.09.054
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.apm.2019.09.054
      \endverb
    \endentry
    \entry{CHNP20}{article}{}
      \name{author}{4}{}{%
        {{hash=b368963987f09e0771a116aa17660500}{Clancy}{C\bibinitperiod}{Kieran}{K\bibinitperiod}{}{}{}{}}%
        {{hash=ae9eeebf572fbc2c155224ae205d148d}{Haythorpe}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d13e92a7aabf201237dbe3f05922ad76}{Newcombe}{N\bibinitperiod}{Alex}{A\bibinitperiod}{}{}{}{}}%
        {{hash=251c109bc354879379919251aec3ad29}{Pegg}{P\bibinitperiod}{Ed}{E\bibinitperiod}{}{}{Jr.}{J\bibinitperiod}}%
      }
      \strng{namehash}{287c03bb1641f53140bc68bddc91ba05}
      \strng{fullhash}{ccd59b8392023aad143948014f0b8bda}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{6}
      \field{title}{There are no cubic graphs on 26 vertices with crossing number 10 or 11}
      \field{volume}{36}
      \field{year}{2020}
      \field{pages}{1713\bibrangedash 1721}
      \range{pages}{9}
    \endentry
    \entry{CG18}{article}{}
      \name{author}{2}{}{%
        {{hash=f7c4b42c39018151314f7062afe6c12d}{Clark}{C\bibinitperiod}{Gregory\bibnamedelima J.}{G\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=ae3b79ec3dd1927c37617c53502bb155}{Spencer}{S\bibinitperiod}{Gwen}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{87fd5fd90c6b278a895a51be47dc84ac}
      \strng{fullhash}{87fd5fd90c6b278a895a51be47dc84ac}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{New bounds on the biplanar crossing number of low-dimensional hypercubes: how low can you go?}
      \field{volume}{83}
      \field{year}{2018}
      \field{pages}{52\bibrangedash 60}
      \range{pages}{9}
    \endentry
    \entry{C85}{book}{}
      \name{author}{1}{}{%
        {{hash=934ae6dd9310dd6d6867c4d47eb492b2}{Clifford}{C\bibinitperiod}{William\bibnamedelima Kingdon}{W\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Appleton}%
      }
      \strng{namehash}{934ae6dd9310dd6d6867c4d47eb492b2}
      \strng{fullhash}{934ae6dd9310dd6d6867c4d47eb492b2}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{The common sense of the exact sciences}
      \field{year}{1885}
      \field{pages}{271}
      \range{pages}{1}
    \endentry
    \entry{CELR97}{article}{}
      \name{author}{4}{}{%
        {{hash=5886819b57d251f6b389a21511a394d0}{Cohen}{C\bibinitperiod}{Robert\bibnamedelima F.}{R\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=0acdeee7f1966934420a4c220d188ee9}{Lin}{L\bibinitperiod}{Tao}{T\bibinitperiod}{}{}{}{}}%
        {{hash=d451a3d41bdcb4e05dea10530db80d68}{Ruskey}{R\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{53bb4e6743cca7a1257a575d3e2e5019}
      \strng{fullhash}{b4a06b3b198fe316b108fc9de3476fd5}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{2}
      \field{title}{Three-dimensional graph drawing}
      \field{volume}{17}
      \field{year}{1997}
      \field{pages}{199\bibrangedash 208}
      \range{pages}{10}
    \endentry
    \entry{dV91}{article}{}
      \name{author}{1}{}{%
        {{hash=c575f36fb704a8f97b4783774716c5b8}{Colin\bibnamedelimb de\bibnamedelima Verdi\`{e}re}{C\bibinitperiod\bibinitdelim d\bibinitperiod\bibinitdelim V\bibinitperiod}{Yves}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c575f36fb704a8f97b4783774716c5b8}
      \strng{fullhash}{c575f36fb704a8f97b4783774716c5b8}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0013-8584}
      \field{journaltitle}{Enseign. Math. (2)}
      \field{number}{3-4}
      \field{title}{Comment rendre g\'{e}od\'{e}sique une triangulation d'une surface?}
      \field{volume}{37}
      \field{year}{1991}
      \field{pages}{201\bibrangedash 212}
      \range{pages}{12}
    \endentry
    \entry{CRSW18}{article}{}
      \name{author}{4}{}{%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=9fb91ffc6f1942bf8ff1ef0af09d16e6}{Reiswig}{R\bibinitperiod}{Josiah}{J\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=553a56dd8a2fea57403873c192fc465d}{Wang}{W\bibinitperiod}{Zhiyu}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d24483d3d52e8a4061b2698a1e450065}
      \strng{fullhash}{f441971c200034aa188a6aa02cc2b534}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1811.08071} (last accessed 8/20/2020)}
      \field{title}{Midrange crossing constants for graphs classes}
      \field{year}{2018}
      \verb{eprint}
      \verb 1811.08071
      \endverb
    \endentry
    \entry{CSSW19}{article}{}
      \name{author}{4}{}{%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=fe31d0052b732bf39eee9832e86a949a}{Singgih}{S\bibinitperiod}{Inne}{I\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=553a56dd8a2fea57403873c192fc465d}{Wang}{W\bibinitperiod}{Zhiyu}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d24483d3d52e8a4061b2698a1e450065}
      \strng{fullhash}{85694d580eb2da1f64fa479a6e951e04}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1907.00368} (last accessed 8/20/2020)}
      \field{title}{Some remarks on the midrange crossing constant}
      \field{year}{2019}
      \verb{eprint}
      \verb 1907.00368
      \endverb
    \endentry
    \entry{CSSV06}{incollection}{}
      \name{author}{4}{}{%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{d24483d3d52e8a4061b2698a1e450065}
      \strng{fullhash}{04f37c4dde6a385a6c170c2e68461cfd}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{More sets, graphs and numbers}
      \field{series}{Bolyai Soc. Math. Stud.}
      \field{title}{Biplanar crossing numbers. {I}. {A} survey of results and problems}
      \field{volume}{15}
      \field{year}{2006}
      \field{pages}{57\bibrangedash 77}
      \range{pages}{21}
    \endentry
    \entry{CSSV08}{article}{}
      \name{author}{4}{}{%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d24483d3d52e8a4061b2698a1e450065}
      \strng{fullhash}{04f37c4dde6a385a6c170c2e68461cfd}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1042-9832}
      \field{journaltitle}{Random Structures Algorithms}
      \field{number}{4}
      \field{title}{Biplanar crossing numbers. {II}. {C}omparing crossing numbers and biplanar crossing numbers using the probabilistic method}
      \field{volume}{33}
      \field{year}{2008}
      \field{pages}{480\bibrangedash 496}
      \range{pages}{17}
    \endentry
    \entry{CSW17}{article}{}
      \name{author}{3}{}{%
        {{hash=6f54d835d377ac8ad419413ca48446a8}{Czabarka}{C\bibinitperiod}{\'{E}va}{\'{E}\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=aefda5d80f00842e1e290d88b3d27ef1}{Wagner}{W\bibinitperiod}{Stephan}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5b4ffc6f2391a7a4df446cd579c7fe33}
      \strng{fullhash}{5b4ffc6f2391a7a4df446cd579c7fe33}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{3}
      \field{title}{Inducibility in binary trees and crossings in random tanglegrams}
      \field{volume}{31}
      \field{year}{2017}
      \field{pages}{1732\bibrangedash 1750}
      \range{pages}{19}
      \verb{doi}
      \verb 10.1137/16M1060741
      \endverb
      \verb{url}
      \verb https://doi.org/10.1137/16M1060741
      \endverb
    \endentry
    \entry{CH13}{article}{}
      \name{author}{2}{}{%
        {{hash=66683d50e7ce8f668d6bf838d973f6b0}{Czap}{C\bibinitperiod}{J\'{u}lius}{J\bibinitperiod}{}{}{}{}}%
        {{hash=7087245d53c57d7b76960051e06d3d55}{Hud\'{a}k}{H\bibinitperiod}{D\'{a}vid}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{fdc3a59475daf5062cadd92c95bc86c6}
      \strng{fullhash}{fdc3a59475daf5062cadd92c95bc86c6}
      \field{sortinit}{C}
      \field{sortinithash}{59f25d509f3381b07695554a9f35ecb2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{The Electronic Journal of Combinatorics}
      \field{number}{2}
      \field{title}{On drawings and decompositions of 1-planar graphs}
      \field{volume}{20}
      \field{year}{2013}
      \field{pages}{P54}
      \range{pages}{-1}
    \endentry
    \entry{D19}{thesis}{}
      \name{author}{1}{}{%
        {{hash=11146f235c31ea6d29d49581fe8f9f2c}{Dandurand}{D\bibinitperiod}{Julia\bibnamedelima Joyanne}{J\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {California State University}%
      }
      \list{location}{1}{%
        {Northridge}%
      }
      \strng{namehash}{11146f235c31ea6d29d49581fe8f9f2c}
      \strng{fullhash}{11146f235c31ea6d29d49581fe8f9f2c}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{12}
      \field{note}{Available at \url{http://hdl.handle.net/10211.3/215230} (last accessed 3/10/2020)}
      \field{title}{Using Allowable Sequences to Solve Problems in Combinatorial Graph Theory}
      \field{type}{mathesis}
      \field{year}{2019}
    \endentry
    \entry{dKMPRS06}{article}{}
      \name{author}{5}{}{%
        {{hash=3a62e3e4a403bd754ded104d6c16231a}{{de\bibnamedelimb Klerk}}{d\bibinitperiod}{Etienne}{E\bibinitperiod}{}{}{}{}}%
        {{hash=d8388f3d2438df99bbda3b49cb41f021}{Maharry}{M\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=419b4355eea46fc5bf1331034c651cfb}{Pasechnik}{P\bibinitperiod}{Dmitrii\bibnamedelima V.}{D\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f2f9eefd0141b33a05b811e3d122dc90}
      \strng{fullhash}{4c52f7ff8383ff1c499134e79e828b55}
      \field{sortinit}{d}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{1}
      \field{title}{Improved bounds for the crossing numbers of {$K_{m,n}$} and {$K_n$}}
      \field{volume}{20}
      \field{year}{2006}
      \field{pages}{189\bibrangedash 202}
      \range{pages}{14}
    \endentry
    \entry{dKP12}{article}{}
      \name{author}{2}{}{%
        {{hash=3a62e3e4a403bd754ded104d6c16231a}{{de\bibnamedelimb Klerk}}{d\bibinitperiod}{Etienne}{E\bibinitperiod}{}{}{}{}}%
        {{hash=419b4355eea46fc5bf1331034c651cfb}{Pasechnik}{P\bibinitperiod}{Dmitrii\bibnamedelima V.}{D\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a5564be4350d91fedbd537da1f4467e1}
      \strng{fullhash}{a5564be4350d91fedbd537da1f4467e1}
      \field{sortinit}{d}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM Journal on Optimization}
      \field{number}{2}
      \field{title}{Improved Lower Bounds for the $2$-Page Crossing Numbers of {$K_{m,n}$} and {$K_n$} via Semidefinite Programming}
      \field{volume}{22}
      \field{year}{2012}
      \field{pages}{581\bibrangedash 595}
      \range{pages}{15}
      \verb{doi}
      \verb 10.1137/110852206
      \endverb
      \verb{eprint}
      \verb http://epubs.siam.org/doi/pdf/10.1137/110852206
      \endverb
      \verb{url}
      \verb http://epubs.siam.org/doi/abs/10.1137/110852206
      \endverb
    \endentry
    \entry{dKPS13}{article}{}
      \name{author}{3}{}{%
        {{hash=3a62e3e4a403bd754ded104d6c16231a}{{de\bibnamedelimb Klerk}}{d\bibinitperiod}{Etienne}{E\bibinitperiod}{}{}{}{}}%
        {{hash=419b4355eea46fc5bf1331034c651cfb}{Pasechnik}{P\bibinitperiod}{Dmitrii\bibnamedelima V.}{D\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{{Salazar}}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e1481b385d25ca3f57acfa3822ef3570}
      \strng{fullhash}{e1481b385d25ca3f57acfa3822ef3570}
      \field{sortinit}{d}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{2}
      \field{title}{Improved lower bounds on book crossing numbers of complete graphs}
      \field{volume}{27}
      \field{year}{2013}
      \field{pages}{619\bibrangedash 633}
      \range{pages}{15}
    \endentry
    \entry{D36}{article}{}
      \name{author}{1}{}{%
        {{hash=861a71d27ccea1f7587640de0e7be8ef}{Dehn}{D\bibinitperiod}{M.}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{861a71d27ccea1f7587640de0e7be8ef}
      \strng{fullhash}{861a71d27ccea1f7587640de0e7be8ef}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0001-5962}
      \field{journaltitle}{Acta Math.}
      \field{number}{1}
      \field{title}{\"{U}ber kombinatorische {T}opologie}
      \field{volume}{67}
      \field{year}{1936}
      \field{pages}{123\bibrangedash 168}
      \range{pages}{46}
    \endentry
    \entry{DDR08}{book}{}
      \name{editor}{3}{}{%
        {{hash=420260c4b192db8e34f3d285c3d9a8f3}{Demaine}{D\bibinitperiod}{Erik\bibnamedelima D.}{E\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=0aeadcbcbab3cce8b5ef8b8b962af819}{Demaine}{D\bibinitperiod}{Martin\bibnamedelima L.}{M\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
        {{hash=3d7aa15f5e0ec18cceafefdc2caa821f}{Rodgers}{R\bibinitperiod}{Tom}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Wellesley, MA}%
      }
      \list{publisher}{1}{%
        {A K Peters Ltd.}%
      }
      \strng{namehash}{e78fc92044c99b42dacf2f08fe766ff3}
      \strng{fullhash}{e78fc92044c99b42dacf2f08fe766ff3}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{isbn}{978-1-56881-245-8}
      \field{subtitle}{A collection of puzzles in honor of Martin Gardner's 90th birthday}
      \field{title}{A lifetime of puzzles}
      \field{year}{2008}
      \field{pages}{x+349}
      \range{pages}{-1}
    \endentry
    \entry{DMS08}{incollection}{}
      \name{author}{3}{}{%
        {{hash=4cd6e9acd0a66fe07cfd7e64e81bbecf}{DeVos}{D\bibinitperiod}{Matt}{M\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
        {{hash=85a8068fa3610dbadbc4305d265148d9}{\v{S}\'{a}mal}{\v{S}\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Elsevier Sci. B. V., Amsterdam}%
      }
      \strng{namehash}{7d4de393af3a88c3bdf60323ab602a26}
      \strng{fullhash}{7d4de393af3a88c3bdf60323ab602a26}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{The {I}nternational {C}onference on {T}opological and {G}eometric {G}raph {T}heory}
      \field{series}{Electron. Notes Discrete Math.}
      \field{title}{Unexpected behaviour of crossing sequences}
      \field{volume}{31}
      \field{year}{2008}
      \field{pages}{259\bibrangedash 264}
      \range{pages}{6}
    \endentry
    \entry{DP98}{article}{}
      \name{author}{2}{}{%
        {{hash=744f9eaf304262058eee92f6c1904fae}{Dey}{D\bibinitperiod}{T.\bibnamedelimi K.}{T\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=4faa0ac81478bfdc839509563422304b}{Pach}{P\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{428162c36f4885bba9cbe0663328da66}
      \strng{fullhash}{428162c36f4885bba9cbe0663328da66}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{Extremal problems for geometric hypergraphs}
      \field{volume}{19}
      \field{year}{1998}
      \field{pages}{473\bibrangedash 484}
      \range{pages}{12}
    \endentry
    \entry{DGDLM11}{article}{}
      \name{author}{4}{}{%
        {{hash=7a1c4654d565cf7d6a6c42a16cdd1282}{Di\bibnamedelima Giacomo}{D\bibinitperiod\bibinitdelim G\bibinitperiod}{Emilio}{E\bibinitperiod}{}{}{}{}}%
        {{hash=7fa752e8dfeed5c502b98c76d52795ed}{Didimo}{D\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=5d166b488fdade7aeef372bdda9dd38e}{Meijer}{M\bibinitperiod}{Henk}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{9455e8a59167952c30fa5ae9d131ebb9}
      \strng{fullhash}{388a8458e597f6058bb1691047ec43ef}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1432-4350}
      \field{journaltitle}{Theory Comput. Syst.}
      \field{number}{3}
      \field{title}{Area, curve complexity, and crossing resolution of non-planar graph drawings}
      \field{volume}{49}
      \field{year}{2011}
      \field{pages}{565\bibrangedash 575}
      \range{pages}{11}
    \endentry
    \entry{DEGM05}{article}{}
      \name{author}{4}{}{%
        {{hash=4cd4084268c30cea64387c2b8a3cf3d6}{Dickerson}{D\bibinitperiod}{Matthew}{M\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=5a0b95fef2629a33091ac55a4ff5f1ed}{Goodrich}{G\bibinitperiod}{Michael\bibnamedelima T.}{M\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
        {{hash=77d12adb1a84291dd496dcec69e780e9}{Meng}{M\bibinitperiod}{Jeremy\bibnamedelima Y.}{J\bibinitperiod\bibinitdelim Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2b99544aeff8b7c33338a9c5208a93ef}
      \strng{fullhash}{bf49d2580f448395da59b9b8067739bc}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{Confluent drawings: visualizing non-planar diagrams in a planar way}
      \field{volume}{9}
      \field{year}{2005}
      \field{pages}{31\bibrangedash 52}
      \range{pages}{22}
    \endentry
    \entry{D13}{article}{}
      \name{author}{1}{}{%
        {{hash=7fa752e8dfeed5c502b98c76d52795ed}{Didimo}{D\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Amsterdam, The Netherlands, The Netherlands}%
      }
      \list{publisher}{1}{%
        {Elsevier North-Holland, Inc.}%
      }
      \strng{namehash}{7fa752e8dfeed5c502b98c76d52795ed}
      \strng{fullhash}{7fa752e8dfeed5c502b98c76d52795ed}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0020-0190}
      \field{journaltitle}{Inf. Process. Lett.}
      \field{month}{04}
      \field{number}{7}
      \field{title}{Density of Straight-line 1-planar Graph Drawings}
      \field{volume}{113}
      \field{year}{2013}
      \field{pages}{236\bibrangedash 240}
      \range{pages}{5}
      \verb{doi}
      \verb 10.1016/j.ipl.2013.01.013
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/j.ipl.2013.01.013
      \endverb
    \endentry
    \entry{DEL11}{article}{}
      \name{author}{3}{}{%
        {{hash=7fa752e8dfeed5c502b98c76d52795ed}{Didimo}{D\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0c2ca081388aea160637a74b66a5ebe9}
      \strng{fullhash}{0c2ca081388aea160637a74b66a5ebe9}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Theor. Comput. Sci}
      \field{number}{39}
      \field{title}{Drawing graphs with right angle crossings}
      \field{volume}{412}
      \field{year}{2011}
      \field{pages}{5156\bibrangedash 5166}
      \range{pages}{11}
    \endentry
    \entry{DLM19}{article}{}
      \name{author}{3}{}{%
        {{hash=7fa752e8dfeed5c502b98c76d52795ed}{Didimo}{D\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=7d280fb38c0e2fc3e75172ed46494417}{Montecchiani}{M\bibinitperiod}{Fabrizio}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{fc8eacd1f1a9fa2f9d99e2fcb42a2310}
      \strng{fullhash}{fc8eacd1f1a9fa2f9d99e2fcb42a2310}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{{ACM} Comput. Surv.}
      \field{number}{1}
      \field{title}{A Survey on Graph Drawing Beyond Planarity}
      \field{volume}{52}
      \field{year}{2019}
      \field{pages}{4:1\bibrangedash 37}
      \range{pages}{-1}
      \verb{doi}
      \verb 10.1145/3301281
      \endverb
      \verb{url}
      \verb https://doi.org/10.1145/3301281
      \endverb
    \endentry
    \entry{D1829}{book}{}
      \name{author}{1}{}{%
        {{hash=df0023fd62a32f5bee04c2e79de655e3}{Diesterweg}{D\bibinitperiod}{Friedrich\bibnamedelimb Adolph\bibnamedelima Wilhelm}{F\bibinitperiod\bibinitdelim A\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {B\"{u}schler, Elberfeld}%
      }
      \strng{namehash}{df0023fd62a32f5bee04c2e79de655e3}
      \strng{fullhash}{df0023fd62a32f5bee04c2e79de655e3}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{Second}
      \field{title}{Anweisung zum Gebrauche des Leitfaden f\"{u}r den ersten {U}nterricht in der {F}ormen- {G}r\"{o}{\ss{}}en- und r\"{a}umlichen {V}erbindungslehre}
      \field{year}{1829}
      \field{pages}{200}
      \range{pages}{1}
    \endentry
    \entry{D1822}{book}{}
      \name{author}{1}{}{%
        {{hash=df0023fd62a32f5bee04c2e79de655e3}{Diesterweg}{D\bibinitperiod}{Friedrich\bibnamedelimb Adolph\bibnamedelima Wilhelm}{F\bibinitperiod\bibinitdelim A\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {B\"{u}schler, Elberfeld}%
      }
      \strng{namehash}{df0023fd62a32f5bee04c2e79de655e3}
      \strng{fullhash}{df0023fd62a32f5bee04c2e79de655e3}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Leitfaden f\"{u}r den ersten {U}nterricht in der {F}ormen- {G}r\"{o}{\ss{}}en- und r\"{a}umlichen {V}erbindungslehre}
      \field{year}{1822}
      \field{pages}{112}
      \range{pages}{1}
    \endentry
    \entry{DV12}{article}{}
      \name{author}{2}{}{%
        {{hash=8949a08f10c02ff6be5caec2ad1b5d03}{Djidjev}{D\bibinitperiod}{Hristo}{H\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer New York}%
      }
      \strng{namehash}{bf5d1c40d25b790d574842726b616b9f}
      \strng{fullhash}{bf5d1c40d25b790d574842726b616b9f}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete \& Computational Geometry}
      \field{title}{Planar Crossing Numbers of Graphs of Bounded Genus}
      \field{year}{2012}
      \field{pages}{1\bibrangedash 23}
      \range{pages}{23}
    \endentry
    \entry{DV13}{article}{}
      \name{author}{2}{}{%
        {{hash=483ff2999395a476ce67798f2d1810d2}{Dobre}{D\bibinitperiod}{Cristian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=fdb0da6a928a1127270f2fafcc18909b}{Vera}{V\bibinitperiod}{Juan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{629ec0593456901ad6b18094d12757fc}
      \strng{fullhash}{629ec0593456901ad6b18094d12757fc}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url(http://www.optimization-online.org/DB_HTML/2013/12/4181.html)}
      \field{journaltitle}{Optimization Online}
      \field{title}{Exploiting Symmetry in Copositive Programs via Semidefinite Hierarchies}
      \field{year}{2013}
    \endentry
    \entry{D59}{book}{}
      \name{author}{1}{}{%
        {{hash=065db6c8587a609bedc635c6edd608bd}{Dudeney}{D\bibinitperiod}{Henry\bibnamedelima Ernest}{H\bibinitperiod\bibinitdelim E\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Dover Publications Inc.}%
      }
      \strng{namehash}{065db6c8587a609bedc635c6edd608bd}
      \strng{fullhash}{065db6c8587a609bedc635c6edd608bd}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Amusements in mathematics}
      \field{year}{1959}
      \field{pages}{xii+258}
      \range{pages}{-1}
    \endentry
    \entry{DEW17}{article}{}
      \name{author}{3}{}{%
        {{hash=ad646320f259e6b9cc0b35868c6b9cf3}{Dujmovi\'{c}}{D\bibinitperiod}{Vida}{V\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=9ed4bb4376b5d05ff54dbde96df0f28c}{Wood}{W\bibinitperiod}{David\bibnamedelima R.}{D\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ceee73331b0bdc01e24586c2cef715ff}
      \strng{fullhash}{ceee73331b0bdc01e24586c2cef715ff}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{2}
      \field{title}{Structure of Graphs with Locally Restricted Crossings}
      \field{volume}{31}
      \field{year}{2017}
      \field{pages}{805\bibrangedash 824}
      \range{pages}{20}
      \verb{doi}
      \verb 10.1137/16M1062879
      \endverb
      \verb{eprint}
      \verb http://dx.doi.org/10.1137/16M1062879
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1137/16M1062879
      \endverb
    \endentry
    \entry{DGMW11}{article}{}
      \name{author}{4}{}{%
        {{hash=ad646320f259e6b9cc0b35868c6b9cf3}{Dujmovi\'{c}}{D\bibinitperiod}{Vida}{V\bibinitperiod}{}{}{}{}}%
        {{hash=1b62594ac20a1dc7b061e15af1caa07d}{Gudmundsson}{G\bibinitperiod}{Joachim}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a64ece1a32650664e9e1a40e167b03c0}{Morin}{M\bibinitperiod}{Pat}{P\bibinitperiod}{}{}{}{}}%
        {{hash=cb0222a62b88b16bacb57e627dea4a4d}{Wolle}{W\bibinitperiod}{Thomas}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {University of Chicago}%
      }
      \strng{namehash}{427b0fdd4f6176566a47c271f42c745d}
      \strng{fullhash}{5f0bbab91b231df114cef93febe65a1a}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Chicago Journal of Theoretical Computer Science}
      \field{month}{06}
      \field{number}{4}
      \field{title}{Notes on large angle crossing graphs}
      \field{volume}{2011}
      \field{year}{2011}
    \endentry
    \entry{DMS14}{article}{}
      \name{author}{3}{}{%
        {{hash=2a5d25cacc3feef964fcdd73008bc667}{{Dujmovi\,{c}}}{D\bibinitperiod}{Vida}{V\bibinitperiod}{}{}{}{}}%
        {{hash=a64ece1a32650664e9e1a40e167b03c0}{{Morin}}{M\bibinitperiod}{Pat}{P\bibinitperiod}{}{}{}{}}%
        {{hash=8531a71dbdebb08b684d7e7c731f2317}{{Sheffer}}{S\bibinitperiod}{Adam}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{135c49d2435deffdc016c8d794a02755}
      \strng{fullhash}{135c49d2435deffdc016c8d794a02755}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-8926}
      \field{journaltitle}{Electron. J. Combin.}
      \field{number}{1}
      \field{title}{Crossings in Grid Drawings}
      \field{volume}{21}
      \field{year}{2014}
      \field{pages}{P1.41}
      \range{pages}{-1}
    \endentry
    \entry{DW04}{article}{}
      \name{author}{2}{}{%
        {{hash=ad646320f259e6b9cc0b35868c6b9cf3}{Dujmovi\'{c}}{D\bibinitperiod}{Vida}{V\bibinitperiod}{}{}{}{}}%
        {{hash=18f1c6b18c80919263bd2c5a41a16ceb}{Whitesides}{W\bibinitperiod}{Sue}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{38a8c7959bde2988bb7a5aba39ea649d}
      \strng{fullhash}{38a8c7959bde2988bb7a5aba39ea649d}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Algorithmica}
      \field{number}{1}
      \field{title}{An efficient fixed parameter tractable algorithm for 1-sided crossing minimization}
      \field{volume}{40}
      \field{year}{2004}
      \field{pages}{15\bibrangedash 31}
      \range{pages}{17}
    \endentry
    \entry{DW04b}{article}{}
      \name{author}{2}{}{%
        {{hash=ad646320f259e6b9cc0b35868c6b9cf3}{Dujmovi\'{c}}{D\bibinitperiod}{Vida}{V\bibinitperiod}{}{}{}{}}%
        {{hash=9ed4bb4376b5d05ff54dbde96df0f28c}{Wood}{W\bibinitperiod}{David\bibnamedelima R.}{D\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4ab9f69f44c8e45ea267425c279757e3}
      \strng{fullhash}{4ab9f69f44c8e45ea267425c279757e3}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Discrete Math. Theor. Comput. Sci.}
      \field{number}{2}
      \field{title}{On linear layouts of graphs}
      \field{volume}{6}
      \field{year}{2004}
      \field{pages}{339\bibrangedash 357}
      \range{pages}{19}
    \endentry
    \entry{DEKW06}{article}{}
      \name{author}{4}{}{%
        {{hash=50e9fd240b2dbccaae6e831f619ffe2a}{Duncan}{D\bibinitperiod}{Christian\bibnamedelima A.}{C\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=5d8a615b98a5cc2e4f705225fc155a6e}{Efrat}{E\bibinitperiod}{Alon}{A\bibinitperiod}{}{}{}{}}%
        {{hash=123e113ab51eb0c183fe920eb804b36b}{Kobourov}{K\bibinitperiod}{Stephen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=e59f09695a94d692577b7f2ff575d34e}{Wenk}{W\bibinitperiod}{Carola}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{24b3ba9aae3273296e4575bec121d351}
      \strng{fullhash}{3914ab4d117e5c9c40dc9fdedf561c64}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0129-0541}
      \field{journaltitle}{Internat. J. Found. Comput. Sci.}
      \field{number}{5}
      \field{title}{Drawing with fat edges}
      \field{volume}{17}
      \field{year}{2006}
      \field{pages}{1143\bibrangedash 1163}
      \range{pages}{21}
    \endentry
    \entry{DEGKN11}{incollection}{}
      \name{author}{5}{}{%
        {{hash=3023d2e116016c87f3dd1211296f75ab}{Duncan}{D\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=7adbdc1127985a656bba48556651cda6}{Goodrich}{G\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=123e113ab51eb0c183fe920eb804b36b}{Kobourov}{K\bibinitperiod}{Stephen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=5b74bae0077b65f428e92cfda7ee88bd}{N\"{o}llenburg}{N\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=392b457d9bac1ed69366176e7857d7e9}{Brandes}{B\bibinitperiod}{Ulrik}{U\bibinitperiod}{}{}{}{}}%
        {{hash=9ca500e7dc2f8541b248c8be35657130}{Cornelsen}{C\bibinitperiod}{Sabine}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{79bb3b0275fcc70b12d993b319398322}
      \strng{fullhash}{de4ca314d66f82c12c301c594a037870}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{978-3-642-18468-0}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Lombardi Drawings of Graphs}
      \field{volume}{6502}
      \field{year}{2011}
      \field{pages}{195\bibrangedash 207}
      \range{pages}{13}
    \endentry
    \entry{DFMHVHT20}{article}{}
      \name{author}{4}{}{%
        {{hash=33489a30bb8428b2d858e62e41f57b05}{Duque}{D\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=efca33c63198cd7a50a4a3c3455479de}{Fabila-Monroy}{F\bibinithyphendelim M\bibinitperiod}{Ruy}{R\bibinitperiod}{}{}{}{}}%
        {{hash=dd2181357ceebbbd253d52ae022f57ab}{Hern\'{a}ndez-V\'{e}lez}{H\bibinithyphendelim V\bibinitperiod}{C\'{e}sar}{C\bibinitperiod}{}{}{}{}}%
        {{hash=42b5e1b5451732b7ee89db8e68557f71}{Hidalgo-Toscano}{H\bibinithyphendelim T\bibinitperiod}{Carlos}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{91ab49d68887c4ac5edb9f557a9a3da3}
      \strng{fullhash}{5ce3babe27146241e5a7083c926f3649}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1904.11037} (last accessed 1/7/2021)}
      \field{title}{Counting the Number of Crossings in Geometric Graphs}
      \field{year}{2020}
      \verb{eprint}
      \verb 1904.11037
      \endverb
    \endentry
    \entry{DGAHVLM18}{article}{}
      \name{author}{5}{}{%
        {{hash=33489a30bb8428b2d858e62e41f57b05}{{Duque}}{D\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=4d6c5ab2fe06763e50397db8529c65b4}{{Gonz\'{a}lez-Aguilar}}{G\bibinitperiod}{Hern\'{a}n}{H\bibinitperiod}{}{}{}{}}%
        {{hash=dd2181357ceebbbd253d52ae022f57ab}{{Hern\'{a}ndez-V\'{e}lez}}{H\bibinitperiod}{C\'{e}sar}{C\bibinitperiod}{}{}{}{}}%
        {{hash=bd890a8f73b9a5c017b00099304025a1}{{Lea\~{n}os}}{L\bibinitperiod}{Jes\'{u}s}{J\bibinitperiod}{}{}{}{}}%
        {{hash=cf6818185d8d779252b4971aca594a55}{{Medina}}{M\bibinitperiod}{Carolina}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{91ab49d68887c4ac5edb9f557a9a3da3}
      \strng{fullhash}{c1fa197b0e56a7c641ce91c2674d9caf}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1077-8926}
      \field{journaltitle}{Electron. J. Combin.}
      \field{number}{2}
      \field{title}{The complexity of computing the cylindrical and the {$t$}-circle crossing number of a graph}
      \field{volume}{25}
      \field{year}{2018}
      \field{pages}{Paper 2.43\bibrangessep 11}
      \range{pages}{-1}
    \endentry
    \entry{DGM16}{misc}{}
      \name{author}{3}{}{%
        {{hash=6ec625ba196348b3b26398d5aea053e4}{Durocher}{D\bibinitperiod}{Stephane}{S\bibinitperiod}{}{}{}{}}%
        {{hash=c3d3cc282a7d38dccbbcc6b483314122}{Gethnery}{G\bibinitperiod}{Ellen}{E\bibinitperiod}{}{}{}{}}%
        {{hash=6af4a98546b2dafdab6328f6dbb36f5b}{Mondalz}{M\bibinitperiod}{Debajyoti}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{39f82d0052773b61d799f52f8305fd5a}
      \strng{fullhash}{39f82d0052773b61d799f52f8305fd5a}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{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)}
      \field{title}{On the Biplanar Crossing Number of {$K_n$}}
      \field{year}{2016}
    \endentry
    \entry{DM16}{article}{}
      \name{author}{2}{}{%
        {{hash=67971cf70262cbe218a2596692e7a59f}{Dvo\v{r}\'{a}k}{D\bibinitperiod}{Zden\v{e}k}{Z\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{58f866e27dc2609dc2ee86eb477f2f0f}
      \strng{fullhash}{58f866e27dc2609dc2ee86eb477f2f0f}
      \field{sortinit}{D}
      \field{sortinithash}{78f7c4753a2004675f316a80bdb31742}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{1}
      \field{title}{Crossing numbers of periodic graphs}
      \field{volume}{83}
      \field{year}{2016}
      \field{pages}{34\bibrangedash 43}
      \range{pages}{10}
      \verb{doi}
      \verb 10.1002/jgt.21912
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1002/jgt.21912
      \endverb
    \endentry
    \entry{EMKW86}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=bcbc38988474aa3b7f1942aee82de920}{Eades}{E\bibinitperiod}{Brendan\bibnamedelima D.}{B\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{Peter\bibnamedelima McKay}{P\bibinitperiod\bibinitdelim M\bibinitperiod}}%
        {{hash=3a1efd11285459af6bc5a60beed4e04e}{Wormald}{W\bibinitperiod}{Nicholas\bibnamedelima C.}{N\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f0e45616c8fba85fe11e7d2b9423273}
      \strng{fullhash}{8f0e45616c8fba85fe11e7d2b9423273}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the Ninth Australian Computer Science Conference}
      \field{title}{On an edge crossing problem}
      \field{year}{1986}
      \field{pages}{327\bibrangedash 334}
      \range{pages}{8}
    \endentry
    \entry{EdM96}{incollection}{}
      \name{author}{2}{}{%
        {{hash=0fec309f36631e56c8fe66d82aaa665e}{Eades}{E\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=eaf928e9c1dffe62d25912a05b00b2d4}{Mendon\c{c}a\bibnamedelima N.}{M\bibinitperiod\bibinitdelim N\bibinitperiod}{C.\bibnamedelimi F.\bibnamedelimi X.}{C\bibinitperiod\bibinitdelim F\bibinitperiod\bibinitdelim X\bibinitperiod}{de}{d\bibinitperiod}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{b98bdf55005727c71f48c1aaa5485ee8}
      \strng{fullhash}{b98bdf55005727c71f48c1aaa5485ee8}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing ({P}assau, 1995)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Vertex splitting and tension-free layout}
      \field{volume}{1027}
      \field{year}{1996}
      \field{pages}{202\bibrangedash 211}
      \range{pages}{10}
      \verb{doi}
      \verb 10.1007/BFb0021804
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/BFb0021804
      \endverb
    \endentry
    \entry{EFL96}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=961c0b47c569f22469e99de1c311763c}{Feng}{F\bibinitperiod}{Qing-Wen}{Q\bibinithyphendelim W\bibinitperiod}{}{}{}{}}%
        {{hash=1e1a342aa4d9a000cc638434ec3948f6}{Lin}{L\bibinitperiod}{Xuemin}{X\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {London, UK}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{a691d4c61604af8aa0d75b1edb4f08c9}
      \strng{fullhash}{a691d4c61604af8aa0d75b1edb4f08c9}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs}
      \field{volume}{1190}
      \field{year}{1997}
      \field{pages}{113\bibrangedash 128}
      \range{pages}{16}
    \endentry
    \entry{EL92}{book}{}
      \name{author}{2}{}{%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f3c3f09b14622b3a98bcc5318fc5aba3}{Lai}{L\bibinitperiod}{Wei}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Hobart, Australia}%
      }
      \list{publisher}{1}{%
        {Key Centre for Software Technology, Department of Computer Science, University of Queensland}%
      }
      \strng{namehash}{bee806dd0332458b9cc71503fcdd05af}
      \strng{fullhash}{bee806dd0332458b9cc71503fcdd05af}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Proc. 15th Australian Computer Science Conf.}
      \field{month}{01}
      \field{title}{Algorithms for Disjoint Node Images}
      \field{volume}{14}
      \field{year}{1992}
      \field{pages}{253\bibrangedash 265}
      \range{pages}{13}
    \endentry
    \entry{ELMS91}{report}{}
      \name{author}{4}{}{%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=f3c3f09b14622b3a98bcc5318fc5aba3}{Lai}{L\bibinitperiod}{Wei}{W\bibinitperiod}{}{}{}{}}%
        {{hash=f0a3c4b13c6f16deb7cd5471245e19ee}{Misue}{M\bibinitperiod}{Kazuo}{K\bibinitperiod}{}{}{}{}}%
        {{hash=72e05a038b3a246a311dd546e836ca9d}{Sugiyama}{S\bibinitperiod}{Kozo}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Fujitsu Limited}%
      }
      \list{location}{1}{%
        {Japan}%
      }
      \list{publisher}{1}{%
        {International Institute for Advanced Study of Social Information Science}%
      }
      \strng{namehash}{9f0bdbb2613ac18470f1c8118393e2c6}
      \strng{fullhash}{8a59e988ff372a6d0dd7bc955e0cd807}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{08}
      \field{number}{IIAS-RR-91-16E}
      \field{title}{Preserving the mental map of a diagram}
      \field{type}{techreport}
      \field{year}{1991}
    \endentry
    \entry{EW94}{article}{}
      \name{author}{2}{}{%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=3a1efd11285459af6bc5a60beed4e04e}{Wormald}{W\bibinitperiod}{Nicholas\bibnamedelima C.}{N\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7f27a3c623ec5b6150ab2e30bf80e786}
      \strng{fullhash}{7f27a3c623ec5b6150ab2e30bf80e786}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{4}
      \field{title}{Edge crossings in drawings of bipartite graphs}
      \field{volume}{11}
      \field{year}{1994}
      \field{pages}{379\bibrangedash 403}
      \range{pages}{25}
    \endentry
    \entry{E73}{thesis}{}
      \name{author}{1}{}{%
        {{hash=f236b3b0826df8e59e41262743f75b18}{Eggleton}{E\bibinitperiod}{Roger\bibnamedelima B.}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {University of Calgary}%
      }
      \list{location}{1}{%
        {Calgary}%
      }
      \strng{namehash}{f236b3b0826df8e59e41262743f75b18}
      \strng{fullhash}{f236b3b0826df8e59e41262743f75b18}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Crossing Numbers of graphs}
      \field{type}{phdthesis}
      \field{year}{1973}
    \endentry
    \entry{E86}{article}{}
      \name{author}{1}{}{%
        {{hash=f236b3b0826df8e59e41262743f75b18}{Eggleton}{E\bibinitperiod}{Roger\bibnamedelima B.}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f236b3b0826df8e59e41262743f75b18}
      \strng{fullhash}{f236b3b0826df8e59e41262743f75b18}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0315-3681}
      \field{journaltitle}{Utilitas Math.}
      \field{title}{Rectilinear drawings of graphs}
      \field{volume}{29}
      \field{year}{1986}
      \field{pages}{149\bibrangedash 172}
      \range{pages}{24}
    \endentry
    \entry{EK01}{incollection}{}
      \name{author}{2}{}{%
        {{hash=e59f3e8cbee6f26cd7c1e6dd4cff11b6}{Eiglsperger}{E\bibinitperiod}{Markus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=79492b3b4704b729b7c5bb0a9b87345c}{Dehne}{D\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=60e6ebfd58ae1b67c030be2e0ecb6f57}{Sack}{S\bibinitperiod}{J\"{o}rg-R\"{u}diger}{J\bibinithyphendelim R\bibinitperiod}{}{}{}{}}%
        {{hash=73002fbcaa8fe0ee76011401f23f2ab3}{Tamassia}{T\bibinitperiod}{Roberto}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{94f321476e7da56924c2aaf165f0ad6d}
      \strng{fullhash}{94f321476e7da56924c2aaf165f0ad6d}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithms and Data Structures}
      \field{isbn}{978-3-540-42423-9}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{An Approach for Mixed Upward Planarization}
      \field{volume}{2125}
      \field{year}{2001}
      \field{pages}{352\bibrangedash 364}
      \range{pages}{13}
    \endentry
    \entry{E17}{incollection}{}
      \name{author}{1}{}{%
        {{hash=6caad749f6e080c5c6be2cda25952fb9}{Elkies}{E\bibinitperiod}{Noam\bibnamedelima D.}{N\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Princeton Univ. Press, Princeton, NJ}%
      }
      \strng{namehash}{6caad749f6e080c5c6be2cda25952fb9}
      \strng{fullhash}{6caad749f6e080c5c6be2cda25952fb9}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{The mathematics of various entertaining subjects. {V}ol. 2}
      \field{title}{Crossing numbers of complete graphs}
      \field{year}{2017}
      \field{pages}{218\bibrangedash 249}
      \range{pages}{32}
    \endentry
    \entry{ESZ06}{article}{}
      \name{author}{3}{}{%
        {{hash=41dee715fe9193fb9e1c24047bc5cb8a}{Ellingham}{E\bibinitperiod}{M.\bibnamedelimi N.}{M\bibinitperiod\bibinitdelim N\bibinitperiod}{}{}{}{}}%
        {{hash=f1b9bdf4a8235b3f555291d5502ed438}{Stephens}{S\bibinitperiod}{Chris}{C\bibinitperiod}{}{}{}{}}%
        {{hash=d5424a6dd49149fc51c04e061023418b}{Zha}{Z\bibinitperiod}{Xiaoya}{X\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{780e65a595363c77863dd7ae0a8d91f8}
      \strng{fullhash}{780e65a595363c77863dd7ae0a8d91f8}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{4}
      \field{title}{The nonorientable genus of complete tripartite graphs}
      \field{volume}{96}
      \field{year}{2006}
      \field{pages}{529\bibrangedash 559}
      \range{pages}{31}
    \endentry
    \entry{E1880}{article}{}
      \name{author}{1}{}{%
        {{hash=0bd884de6b6e71bb04ba233691dd384e}{{Englert}}{E\bibinitperiod}{F.}{F\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {German}%
      }
      \list{publisher}{1}{%
        {Teubner, Berlin}%
      }
      \strng{namehash}{0bd884de6b6e71bb04ba233691dd384e}
      \strng{fullhash}{0bd884de6b6e71bb04ba233691dd384e}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{{Grunert Arch.}}
      \field{title}{{Die Anzahl $S_n$ der innerhalb eines $n$-Ecks fallenden Schnittpunkte seiner Diagonalen.}}
      \field{volume}{65}
      \field{year}{1880}
      \field{pages}{446\bibrangedash 447}
      \range{pages}{2}
    \endentry
    \entry{EM99}{article}{}
      \name{author}{2}{}{%
        {{hash=798e29b1c31a9ea7313df52b020d8f4f}{Enomoto}{E\bibinitperiod}{Hikoe}{H\bibinitperiod}{}{}{}{}}%
        {{hash=fa5c41d8ddadfb3c391f985a447621dc}{Miyauchi}{M\bibinitperiod}{Miki\bibnamedelima Shimabara}{M\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=0b9a00f2e3e836cc6616ab18c627b76e}{Shmoys}{S\bibinitperiod}{David\bibnamedelima B.}{D\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Philadelphia, PA}%
      }
      \list{publisher}{2}{%
        {Society for Industrial}%
        {Applied Mathematics}%
      }
      \strng{namehash}{2e6efe2d83a073f42ba83bff35419e1a}
      \strng{fullhash}{2e6efe2d83a073f42ba83bff35419e1a}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM J. Disc.~Math.}
      \field{number}{3}
      \field{title}{Embedding graphs into a three page book with ${O}(m \log n)$ crossings of edges over the spine}
      \field{volume}{12}
      \field{year}{1999}
      \field{pages}{337\bibrangedash 341}
      \range{pages}{5}
    \endentry
    \entry{EMK99}{article}{}
      \name{author}{3}{}{%
        {{hash=798e29b1c31a9ea7313df52b020d8f4f}{Enomoto}{E\bibinitperiod}{Hikoe}{H\bibinitperiod}{}{}{}{}}%
        {{hash=fa5c41d8ddadfb3c391f985a447621dc}{Miyauchi}{M\bibinitperiod}{Miki\bibnamedelima Shimabara}{M\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=dde9577a0cd765c3b0b16a2e82933d32}{Ota}{O\bibinitperiod}{Katsuhiro}{K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{78df5541e231c5c737427bc6e2537612}
      \strng{fullhash}{78df5541e231c5c737427bc6e2537612}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{number}{2-3}
      \field{title}{Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph}
      \field{volume}{92}
      \field{year}{1999}
      \field{pages}{149\bibrangedash 155}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1016/S0166-218X(99)00044-X
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/S0166-218X(99)00044-X
      \endverb
    \endentry
    \entry{E13a}{misc}{}
      \name{author}{1}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \strng{fullhash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{https://11011110.github.io/blog/2013/04/08/brief-history-of.html} (last accessed 9/21/2017)}
      \field{title}{A Brief History of Curves in Graph Drawing}
    \endentry
    \entry{E13}{misc}{}
      \name{author}{1}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \strng{fullhash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{https://11011110.github.io/blog/2013/03/27/early-reference-on.html} (last accessed 9/21/2017)}
      \field{title}{An early reference on crossing minimization}
    \endentry
    \entry{E14}{misc}{}
      \name{author}{1}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \strng{fullhash}{4f12b592ce9b6b46eaf40b65ed198f41}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{https://11011110.github.io/blog/2014/08/09/three-colorable-circle-graphs.html} (last accessed 5/27/2020)}
      \field{title}{Three-colorable circle graphs and three-page book embeddings}
    \endentry
    \entry{EGM07}{article}{}
      \name{author}{3}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=5a0b95fef2629a33091ac55a4ff5f1ed}{Goodrich}{G\bibinitperiod}{Michael\bibnamedelima T.}{M\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
        {{hash=70be05dc774fc82d8c5ed0cdf81102e7}{Meng}{M\bibinitperiod}{Jeremy\bibnamedelima Yu}{J\bibinitperiod\bibinitdelim Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{145edbcfac46c69a0a4296f7d9948e92}
      \strng{fullhash}{145edbcfac46c69a0a4296f7d9948e92}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{4}
      \field{title}{Confluent layered drawings}
      \field{volume}{47}
      \field{year}{2007}
      \field{pages}{439\bibrangedash 452}
      \range{pages}{14}
    \endentry
    \entry{EH14}{misc}{}
      \name{author}{2}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=f21b2e6f52e186171514cc594b434cde}{Huynh}{H\bibinitperiod}{Tony}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{10eebba635c2e7052b31b601ba83c84c}
      \strng{fullhash}{10eebba635c2e7052b31b601ba83c84c}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{\url{http://mathoverflow.net/questions/168440/bounds-on-chromatic-number-of-k-planar-graphs} (Online; accessed 28-May-2014)}
      \field{title}{Bounds on chromatic number of $k$-planar graphs}
      \field{year}{2014}
    \endentry
    \entry{EvKMS09}{article}{}
      \name{author}{4}{}{%
        {{hash=4f12b592ce9b6b46eaf40b65ed198f41}{Eppstein}{E\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=3d59fa21cf3004cfd6cc43712546d3cf}{Kreveld}{K\bibinitperiod}{Marc}{M\bibinitperiod}{van}{v\bibinitperiod}{}{}}%
        {{hash=0751a3ad8e975ee205ef97c0772fdc04}{Mumford}{M\bibinitperiod}{Elena}{E\bibinitperiod}{}{}{}{}}%
        {{hash=d1b091611207641ad30b432737e7581a}{Speckmann}{S\bibinitperiod}{Bettina}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{de5f7a410e4aa7884e7b70c90c6ba783}
      \strng{fullhash}{0d3322bb29971a1187baa2c1eae2e3a0}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{number}{8}
      \field{title}{Edges and switches, tunnels and bridges}
      \field{volume}{42}
      \field{year}{2009}
      \field{pages}{790\bibrangedash 802}
      \range{pages}{13}
    \endentry
    \entry{EG73}{article}{}
      \name{author}{2}{}{%
        {{hash=731f652a1aa2e8b4d8dd88796de84778}{Erd\H{o}s}{E\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=702ed250e2ef74ab9b3a7a0914c2b555}{Guy}{G\bibinitperiod}{R.\bibnamedelimi K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b758b48fbeecd1ba265f116d13914386}
      \strng{fullhash}{b758b48fbeecd1ba265f116d13914386}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0002-9890}
      \field{journaltitle}{Amer. Math. Monthly}
      \field{title}{Crossing number problems}
      \field{volume}{80}
      \field{year}{1973}
      \field{pages}{52\bibrangedash 58}
      \range{pages}{7}
    \endentry
    \entry{EK68}{book}{}
      \name{editor}{2}{}{%
        {{hash=6bdf16ead0815d7b7b3548f89f0f1355}{Erd\H{o}s}{E\bibinitperiod}{Paul}{P\bibinitperiod}{}{}{}{}}%
        {{hash=7cd0e1acd7fe4c626503b940913adb8e}{Katona}{K\bibinitperiod}{Gyula}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Academic Press, New York-London; Akad\'{e}miai Kiad\'{o}, Budapest}%
      }
      \strng{namehash}{eb4998c323052594e97acdf58f6c9e96}
      \strng{fullhash}{eb4998c323052594e97acdf58f6c9e96}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{series}{Proceedings of the Colloquium held at Tihany, Hungary, September}
      \field{title}{Theory of graphs}
      \field{volume}{1966}
      \field{year}{1968}
      \field{pages}{370}
      \range{pages}{1}
    \endentry
    \entry{EKMSTWYY12}{misc}{}
      \name{author}{8}{}{%
        {{hash=67f2707f718ac7ec553bb9fc473b5fb3}{Erickson}{E\bibinitperiod}{Lars}{L\bibinitperiod}{}{}{}{}}%
        {{hash=13f5b9e17c13317d94d1ea5da03f7d38}{Kim}{K\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a753d5e43f753ea21f1fb18f0ea84f3a}{McConvey}{M\bibinitperiod}{Andrew}{A\bibinitperiod}{}{}{}{}}%
        {{hash=73b34a6bf0c41187e2eb231ed9e63abd}{Shar}{S\bibinitperiod}{Nathaniel}{N\bibinitperiod}{}{}{}{}}%
        {{hash=2baa5d607d91aa55475cd6e19b25547b}{Tomlinson}{T\bibinitperiod}{Charles}{C\bibinitperiod}{}{}{}{}}%
        {{hash=4911bd9bb240c6d5f12db3d850ad1099}{Wang}{W\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=32d35d0ff22936db624bab686eb1b22d}{Yager}{Y\bibinitperiod}{Derrek}{D\bibinitperiod}{}{}{}{}}%
        {{hash=b7cfa1e0bcd2cfdd4aeba55e22e8f92e}{Yeage}{Y\bibinitperiod}{Elyse}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2215d8d5db1c94139d30a444c5f1b144}
      \strng{fullhash}{bebbce20f70f56989b6e8b6c1e2f5556}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Results of a Combinatorics REGS program (\url{http://www.math.uiuc.edu/~west/regs/crossnum.html}, last accessed 9/21/2017))}
      \field{title}{Linear Crossing Numbers of Graphs}
      \field{year}{2012}
    \endentry
    \entry{ES75}{report}{}
      \name{author}{2}{}{%
        {{hash=d2c2f3e48629668bc1cda897c1e6503d}{Even}{E\bibinitperiod}{S.}{S\bibinitperiod}{}{}{}{}}%
        {{hash=3e6fa6d27b0aacd24fdc823194ce2390}{Shiloah}{S\bibinitperiod}{Y.}{Y\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Technion, Israel Institute of Technology}%
      }
      \list{location}{1}{%
        {Haifa, Israel}%
      }
      \strng{namehash}{ce72b2a5f4339e59240e2826c92d5fb1}
      \strng{fullhash}{ce72b2a5f4339e59240e2826c92d5fb1}
      \field{sortinit}{E}
      \field{sortinithash}{fefc5210ef4721525b2a478df41efcd4}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{01}
      \field{number}{43}
      \field{title}{{NP}-completeness of several arrangement problems}
      \field{type}{techreport}
      \field{year}{1975}
    \endentry
    \entry{FM07}{article}{}
      \name{author}{2}{}{%
        {{hash=3e2e9caad1901ab4153adaea2d4318b2}{Fabrici}{F\bibinitperiod}{Igor}{I\bibinitperiod}{}{}{}{}}%
        {{hash=b01daa9ac1c4be9b45246c3d345cfc7d}{Madaras}{M\bibinitperiod}{Tom\'{a}\v{s}}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f95d8d22c49441b342c43137d5d90b1f}
      \strng{fullhash}{f95d8d22c49441b342c43137d5d90b1f}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{7-8}
      \field{title}{The structure of 1-planar graphs}
      \field{volume}{307}
      \field{year}{2007}
      \field{pages}{854\bibrangedash 865}
      \range{pages}{12}
    \endentry
    \entry{FHKLSS20}{article}{}
      \name{author}{6}{}{%
        {{hash=885161b2fcb4baac10e39f34b58cadc2}{{Fallon}}{F\bibinitperiod}{Joshua}{J\bibinitperiod}{}{}{}{}}%
        {{hash=dda035d96baea0c07f2f3f4136a35ffa}{{Hogenson}}{H\bibinitperiod}{Kirsten}{K\bibinitperiod}{}{}{}{}}%
        {{hash=f0c0d52fcd89909236600ede34fa59f1}{{Keough}}{K\bibinitperiod}{Lauren}{L\bibinitperiod}{}{}{}{}}%
        {{hash=c877cf7f5c7b28d3730adc13958581e3}{{Lomel\'{\i{}}}}{L\bibinitperiod}{Mario}{M\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{{Schaefer}}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=038c24d6e508fa1fd6f47dd43e49d6b5}{{Sober\'{o}n}}{S\bibinitperiod}{Pablo}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Charles Babbage Research Centre, Winnipeg}%
      }
      \strng{namehash}{eaa647b9c8105d993adaf5d636f4db1b}
      \strng{fullhash}{ddb7b50e2df63c60389cb686b0df8ba1}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0835-3026}
      \field{journaltitle}{{J. Comb. Math. Comb. Comput.}}
      \field{title}{{A note on the maximum rectilinear crossing number of spiders}}
      \field{volume}{113}
      \field{year}{2020}
      \field{pages}{127\bibrangedash 139}
      \range{pages}{13}
    \endentry
    \entry{FdFM01}{article}{}
      \name{author}{3}{}{%
        {{hash=f934655bce97e4fe9e5f0ec07f97babf}{Faria}{F\bibinitperiod}{L.}{L\bibinitperiod}{}{}{}{}}%
        {{hash=d98f84b4bafd1281e469cd874bdf3b2f}{Figueiredo}{F\bibinitperiod}{C.\bibnamedelimi M.\bibnamedelimi H.}{C\bibinitperiod\bibinitdelim M\bibinitperiod\bibinitdelim H\bibinitperiod}{de}{d\bibinitperiod}{}{}}%
        {{hash=d44992794e0e955b44e52e9ca4702d33}{Mendon\c{c}a}{M\bibinitperiod}{C.\bibnamedelimi F.\bibnamedelimi X.}{C\bibinitperiod\bibinitdelim F\bibinitperiod\bibinitdelim X\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bdd79ca7ade030e293b1c99c635b4212}
      \strng{fullhash}{bdd79ca7ade030e293b1c99c635b4212}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{note}{International Workshop on Graph-Theoretic Concepts in Computer Science (Smolenice Castle, 1998)}
      \field{number}{1-2}
      \field{title}{S{PLITTING} {NUMBER} is {NP}-complete}
      \field{volume}{108}
      \field{year}{2001}
      \field{pages}{65\bibrangedash 83}
      \range{pages}{19}
      \verb{doi}
      \verb 10.1016/S0166-218X(00)00220-1
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/S0166-218X(00)00220-1
      \endverb
    \endentry
    \entry{FdFRV13}{incollection}{}
      \name{author}{4}{}{%
        {{hash=6b8e5786c1da7a20f76ec2d0d5476354}{Faria}{F\bibinitperiod}{Luerbio}{L\bibinitperiod}{}{}{}{}}%
        {{hash=2fba7723f2711b81312ba2ecd2021c4a}{Figueiredo}{F\bibinitperiod}{Celina\bibnamedelimb M.\bibnamedelimi H.}{C\bibinitperiod\bibinitdelim M\bibinitperiod\bibinitdelim H\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=69071610f5c1f249d20d77b4b96a5b09}{Brandst\"{a}dt}{B\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=b1f3ccb7c28e47308a3a22420635dc84}{Jansen}{J\bibinitperiod}{Klaus}{K\bibinitperiod}{}{}{}{}}%
        {{hash=800135f3e086e96b7484485725605771}{Reischuk}{R\bibinitperiod}{R\"{u}diger}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{01154d1b695851e863d8672a2461d7d4}
      \strng{fullhash}{650af548e20c9f08a3dae6c1d54c40fa}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph-Theoretic Concepts in Computer Science}
      \field{isbn}{978-3-642-45042-6}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube}
      \field{volume}{8165}
      \field{year}{2013}
      \field{pages}{249\bibrangedash 260}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-642-45043-3_22
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-642-45043-3_22
      \endverb
      \keyw{two-page crossing number; rectilinear crossing number; n-cube; topological graph theory}
    \endentry
    \entry{FSM16}{article}{}
      \name{author}{3}{}{%
        {{hash=d54a3201524db742c9fffa463d40988c}{{Fatemi}}{F\bibinitperiod}{Zahra}{Z\bibinitperiod}{}{}{}{}}%
        {{hash=1e2f125d26651333743b94448c84f86c}{{Salehi}}{S\bibinitperiod}{Mostafa}{M\bibinitperiod}{}{}{}{}}%
        {{hash=515e2eb0c45d461898a35546269464c1}{{Magnani}}{M\bibinitperiod}{Matteo}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1c21bbaff329fa3ac86a5c0b4f699cfb}
      \strng{fullhash}{1c21bbaff329fa3ac86a5c0b4f699cfb}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{07}
      \field{note}{\arxiv{1607.03914} (last accessed 9/21/2017)}
      \field{title}{{A simple multiforce layout for multiplex networks}}
      \field{year}{2016}
      \verb{eprint}
      \verb 1607.03914
      \endverb
      \keyw{Computer Science - Social and Information Networks,Physics - Physics and Society}
    \endentry
    \entry{F11}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{204dd39a9478bca2cddfe8e03b072912}
      \strng{fullhash}{204dd39a9478bca2cddfe8e03b072912}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}orty-{S}econd {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The maximum rectilinear crossing number of the wheel graph}
      \field{volume}{210}
      \field{year}{2011}
      \field{pages}{21\bibrangedash 32}
      \range{pages}{12}
    \endentry
    \entry{FG14}{article}{}
      \name{author}{2}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=6a264be1090dcd44b1277f42b593e928}{Garber}{G\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a7502cb8eae2f80ce36bbe410837b960}
      \strng{fullhash}{a7502cb8eae2f80ce36bbe410837b960}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0835-3026}
      \field{journaltitle}{J. Combin. Math. Combin. Comput.}
      \field{title}{On the orchard crossing number of prisms, ladders and other related graphs}
      \field{volume}{91}
      \field{year}{2014}
      \field{pages}{215\bibrangedash 232}
      \range{pages}{18}
    \endentry
    \entry{FG11}{article}{}
      \name{author}{2}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=6a264be1090dcd44b1277f42b593e928}{Garber}{G\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a7502cb8eae2f80ce36bbe410837b960}
      \strng{fullhash}{a7502cb8eae2f80ce36bbe410837b960}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issue}{1}
      \field{journaltitle}{The Electronic Journal of Combinatorics}
      \field{month}{10}
      \field{title}{On the Orchard crossing number of the complete bipartite graphs {$K_{n,n}$}}
      \field{volume}{18}
      \field{year}{2011}
    \endentry
    \entry{FG09}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=6a264be1090dcd44b1277f42b593e928}{Garber}{G\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a7502cb8eae2f80ce36bbe410837b960}
      \strng{fullhash}{a7502cb8eae2f80ce36bbe410837b960}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}ortieth {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The orchard crossing number of an abstract graph}
      \field{volume}{197}
      \field{year}{2009}
      \field{pages}{3\bibrangedash 19}
      \range{pages}{17}
    \endentry
    \entry{FHHK10}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=793a89e874e5e978481ab6daf4ad6d70}{Herzberg}{H\bibinitperiod}{Steven}{S\bibinitperiod}{}{}{}{}}%
        {{hash=aa8ee4772ad592a64c95bcfd71ec6096}{Klein}{K\bibinitperiod}{Sheldon}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a5243e874ecce3c3a437e3ed9426b9ac}
      \strng{fullhash}{46a835559170f9801959d5575897776f}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {F}orty-{F}irst {S}outheastern {I}nternational {C}onference on {C}ombinatorics, {G}raph {T}heory and {C}omputing}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The maximum rectilinear crossing number of the {P}etersen graph}
      \field{volume}{206}
      \field{year}{2010}
      \field{pages}{31\bibrangedash 40}
      \range{pages}{10}
    \endentry
    \entry{FHL16}{article}{}
      \name{author}{3}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=5a1dc825440da491b4ab3d1b76f0c48c}{Lichter}{L\bibinitperiod}{Tamar}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3b9450a76f0c9d11ac2a9c461d91416d}
      \strng{fullhash}{3b9450a76f0c9d11ac2a9c461d91416d}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Maximum rectilinear crossing numbers for game board graphs}
      \field{volume}{226}
      \field{year}{2016}
      \field{pages}{87\bibrangedash 102}
      \range{pages}{16}
    \endentry
    \entry{FHL17}{article}{}
      \name{author}{3}{}{%
        {{hash=204dd39a9478bca2cddfe8e03b072912}{Feder}{F\bibinitperiod}{Elie}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=5a1dc825440da491b4ab3d1b76f0c48c}{Lichter}{L\bibinitperiod}{Tamar}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3b9450a76f0c9d11ac2a9c461d91416d}
      \strng{fullhash}{3b9450a76f0c9d11ac2a9c461d91416d}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Maximum rectilinear crossing numbers of polyomino graphs}
      \field{volume}{229}
      \field{year}{2017}
      \field{pages}{29\bibrangedash 53}
      \range{pages}{25}
    \endentry
    \entry{FHKP20}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=1ec78ded1656441459b1960fbc1e7d68}{Felsner}{F\bibinitperiod}{Stefan}{S\bibinitperiod}{}{}{}{}}%
        {{hash=4539d354ecc875071164ba52f1c44812}{Hoffmann}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7a92ea557c1e784eaf1eb4a54f6fe9b2}{Knorr}{K\bibinitperiod}{Kristin}{K\bibinitperiod}{}{}{}{}}%
        {{hash=1fbdb2b64c79ea245aec6061b3fe0a30}{Parada}{P\bibinitperiod}{Irene}{I\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=da79bf20d4e84639df78d0bd034822ed}{Auber}{A\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
        {{hash=2e1a273e0c1af98d23258eba7882f230}{Valtr}{V\bibinitperiod}{Pavel}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{ab2a7c38867666251aed32fc0e218784}
      \strng{fullhash}{c1769af9c877ccdb7578d0adbc8a958b}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing and Network Visualization}
      \field{isbn}{978-3-030-68766-3}
      \field{title}{On the Maximum Number of Crossings in Star-Simple Drawings of ${K}_n$ with No Empty Lens}
      \field{year}{2020}
      \field{pages}{382\bibrangedash 389}
      \range{pages}{8}
    \endentry
    \entry{FYX12}{article}{}
      \name{author}{3}{}{%
        {{hash=13197b8de63754c06b492170a3d47aa0}{Feng}{F\bibinitperiod}{Kai}{K\bibinitperiod}{}{}{}{}}%
        {{hash=016cfddfe977d9815bf6e93dfb4b9401}{Ye}{Y\bibinitperiod}{Yaoyao}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=496ce3150ebf4dd5ff853ae5d56fc702}{Xu}{X\bibinitperiod}{Jiang}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Elsevier}%
      }
      \strng{namehash}{18e722b83f9ef4088a721d0e69211315}
      \strng{fullhash}{18e722b83f9ef4088a721d0e69211315}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0141-9331}
      \field{journaltitle}{Microprocessors and Microsystems}
      \field{title}{A Formal Study on Topology and Floorplan Characteristics of Mesh and Torus-based Optical Networks-on-Chip}
      \field{year}{2012}
      \verb{doi}
      \verb 10.1016/j.micpro.2012.06.010
      \endverb
    \endentry
    \entry{FKP10}{article}{}
      \name{author}{3}{}{%
        {{hash=9c8d174d779060dfbfe96831ad8bda09}{Fernau}{F\bibinitperiod}{Henning}{H\bibinitperiod}{}{}{}{}}%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=880f5a2f9fb6c57eda9412257eae3445}{Poths}{P\bibinitperiod}{Mathias}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{678da49a82941a30401575611924a1cb}
      \strng{fullhash}{678da49a82941a30401575611924a1cb}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0022-0000}
      \field{journaltitle}{J. Comput. System Sci.}
      \field{number}{7}
      \field{title}{Comparing trees via crossing minimization}
      \field{volume}{76}
      \field{year}{2010}
      \field{pages}{593\bibrangedash 608}
      \range{pages}{16}
    \endentry
    \entry{FDPK13?}{unpublished}{}
      \name{author}{4}{}{%
        {{hash=50e73a9710a1a14df95aabc47d4a6867}{Filippova}{F\bibinitperiod}{Darya}{D\bibinitperiod}{}{}{}{}}%
        {{hash=a499d704ac416b56681f708f223ab1f0}{Duggal}{D\bibinitperiod}{Geet}{G\bibinitperiod}{}{}{}{}}%
        {{hash=eccda3e34049a4d8774491fdaa7fe7b0}{Patro}{P\bibinitperiod}{Rob}{R\bibinitperiod}{}{}{}{}}%
        {{hash=597269818def1983b92e61a15057ccbe}{Kingsford}{K\bibinitperiod}{Carl}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{31ced10eb7f36e0d0022fb8cb4ba77a3}
      \strng{fullhash}{e10193a9bdf9cd7d3a6819d4176435e2}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Unpublished manuscript at \url{http://www.cs.cmu.edu/~dfilippo/projects/chromovis/chromovisGD2013.pdf} (last accessed 9/21/2017)}
      \field{title}{ChromoVis: Feature-Rich Layouts of Chromosome Conformation Graphs}
      \field{year}{2013}
    \endentry
    \entry{F03}{book}{}
      \name{author}{1}{}{%
        {{hash=aef3c3957bfc7d0c36a93aa3de298028}{Finch}{F\bibinitperiod}{Steven\bibnamedelima R.}{S\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Cambridge University Press, Cambridge}%
      }
      \strng{namehash}{aef3c3957bfc7d0c36a93aa3de298028}
      \strng{fullhash}{aef3c3957bfc7d0c36a93aa3de298028}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{0-521-81805-2}
      \field{series}{Encyclopedia of Mathematics and its Applications}
      \field{title}{Mathematical constants}
      \field{volume}{94}
      \field{year}{2003}
      \field{pages}{xx+602}
      \range{pages}{-1}
    \endentry
    \entry{FHSV16}{incollection}{}
      \name{author}{4}{}{%
        {{hash=85f84740d637f4a8a002e1edf639165e}{Fink}{F\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7ad4fa6268daceae6e27f2b3acbfee51}{Hershberger}{H\bibinitperiod}{John}{J\bibinitperiod}{}{}{}{}}%
        {{hash=bfc7c4a61967484cf7b20777bf74e5c1}{Suri}{S\bibinitperiod}{Subhash}{S\bibinitperiod}{}{}{}{}}%
        {{hash=01c36a087703732a177159c722c3044c}{Verbeek}{V\bibinitperiod}{Kevin}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{33699a69c972051f1c9735fc4bb0b7c3}
      \strng{fullhash}{aff532c7571f921d3e333e35ca6a9686}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{L{ATIN} 2016: theoretical informatics}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Bundled crossings in embedded graphs}
      \field{volume}{9644}
      \field{year}{2016}
      \field{pages}{454\bibrangedash 468}
      \range{pages}{15}
      \verb{doi}
      \verb 10.1007/978-3-662-49529-2_34
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-662-49529-2_34
      \endverb
    \endentry
    \entry{FP13b}{incollection}{}
      \name{author}{2}{}{%
        {{hash=85f84740d637f4a8a002e1edf639165e}{Fink}{F\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=5ab199a65487e55d374000d386c01a78}{Pupyrev}{P\bibinitperiod}{Sergey}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{05e6c99e9d09bd6184c11f80de42638d}
      \strng{fullhash}{05e6c99e9d09bd6184c11f80de42638d}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Metro-line crossing minimization: hardness, approximations, and tractable cases}
      \field{volume}{8242}
      \field{year}{2013}
      \field{pages}{328\bibrangedash 339}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-319-03841-4_29
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-319-03841-4_29
      \endverb
    \endentry
    \entry{FPW15}{article}{}
      \name{author}{3}{}{%
        {{hash=85f84740d637f4a8a002e1edf639165e}{Fink}{F\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=5ab199a65487e55d374000d386c01a78}{Pupyrev}{P\bibinitperiod}{Sergey}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7e010c9835c528b6dea6ec84022a5735}{Wolff}{W\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{74adbde83879d2f93d5ab05a08059b6e}
      \strng{fullhash}{74adbde83879d2f93d5ab05a08059b6e}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{1}
      \field{title}{Ordering metro lines by block crossings}
      \field{volume}{19}
      \field{year}{2015}
      \field{pages}{111\bibrangedash 153}
      \range{pages}{43}
      \verb{doi}
      \verb 10.7155/jgaa.00351
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.7155/jgaa.00351
      \endverb
    \endentry
    \entry{FG01}{article}{}
      \name{author}{2}{}{%
        {{hash=871d5ee00e8f000b165f3d5bcd04df53}{Fiorini}{F\bibinitperiod}{Stanley}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7397140cbf49fe731f0c14272ce82f8f}{Gauci}{G\bibinitperiod}{John\bibnamedelima Baptist}{J\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b9cd655ec9bbff02dbf1cc8bd2993c32}
      \strng{fullhash}{b9cd655ec9bbff02dbf1cc8bd2993c32}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1040-8118}
      \field{journaltitle}{Graph Theory Notes N. Y.}
      \field{title}{Necessary and sufficient conditions for the {Z}arankiewicz conjecture on crossing numbers}
      \field{volume}{41}
      \field{year}{2001}
      \field{pages}{17\bibrangedash 21}
      \range{pages}{5}
    \endentry
    \entry{SG03}{article}{}
      \name{author}{2}{}{%
        {{hash=871d5ee00e8f000b165f3d5bcd04df53}{Fiorini}{F\bibinitperiod}{Stanley}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7397140cbf49fe731f0c14272ce82f8f}{Gauci}{G\bibinitperiod}{John\bibnamedelima Baptist}{J\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Academy of Sciences of the Czech Republic, Mathematical Institute, Prague}%
      }
      \strng{namehash}{b9cd655ec9bbff02dbf1cc8bd2993c32}
      \strng{fullhash}{b9cd655ec9bbff02dbf1cc8bd2993c32}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0862-7959}
      \field{journaltitle}{{Math. Bohem.}}
      \field{number}{4}
      \field{title}{{The crossing number of the generalized Petersen graph \(P[3k,k]\)}}
      \field{volume}{128}
      \field{year}{2003}
      \field{pages}{337\bibrangedash 347}
      \range{pages}{11}
    \endentry
    \entry{FPS16b}{incollection}{}
      \name{author}{3}{}{%
        {{hash=3f0a67a902c8bcd7eb3fbad276c47365}{{Fox}}{F\bibinitperiod}{Jacob}{J\bibinitperiod}{}{}{}{}}%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{{Pach}}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=5a22d5f98599c0ad2ceba239e042eacf}{{Suk}}{S\bibinitperiod}{Andrew}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{d9729e1efb63e8506b89f433bd62f94e}
      \strng{fullhash}{d9729e1efb63e8506b89f433bd62f94e}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing and network visualization}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Approximating the rectilinear crossing number}
      \field{volume}{9801}
      \field{year}{2016}
      \field{pages}{413\bibrangedash 426}
      \range{pages}{14}
    \endentry
    \entry{FPS13}{article}{}
      \name{author}{3}{}{%
        {{hash=3f0a67a902c8bcd7eb3fbad276c47365}{Fox}{F\bibinitperiod}{Jacob}{J\bibinitperiod}{}{}{}{}}%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=5a22d5f98599c0ad2ceba239e042eacf}{Suk}{S\bibinitperiod}{Andrew}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d9729e1efb63e8506b89f433bd62f94e}
      \strng{fullhash}{d9729e1efb63e8506b89f433bd62f94e}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{1}
      \field{title}{The number of edges in {$k$}-quasi-planar graphs}
      \field{volume}{27}
      \field{year}{2013}
      \field{pages}{550\bibrangedash 561}
      \range{pages}{12}
    \endentry
    \entry{FHSV05}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=c60a1de3ffee312e2e8da092c6c2d294}{He}{H\bibinitperiod}{Hongmei}{H\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{4}{}{%
        {{hash=2c499f72f0af368057aef95edf047cb4}{Vojt\'{a}s}{V\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=7567c396e91b1adb862bedaa392b8890}{Bielikov\'{a}}{B\bibinitperiod}{M\'{a}ria}{M\bibinitperiod}{}{}{}{}}%
        {{hash=291c274ef095dfc3349c7af3af690bdf}{Charron-Bost}{C\bibinithyphendelim B\bibinitperiod}{Bernadette}{B\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{c18f34fb9bf9e9dbbb8626e461bb5085}
      \strng{fullhash}{6bc46e1d16a69026d9966f9dcc181b34}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{{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}
      \field{isbn}{3-540-24302-X}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Outerplanar Crossing Numbers of 3-Row Meshes, {H}alin Graphs and Complete p-Partite Graphs}
      \field{volume}{3381}
      \field{year}{2005}
      \field{pages}{376\bibrangedash 379}
      \range{pages}{4}
    \endentry
    \entry{FK19}{article}{}
      \name{author}{2}{}{%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{Kyn\v{c}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{17d12ff7d4a3b8846bc93c9987033b59}
      \strng{fullhash}{17d12ff7d4a3b8846bc93c9987033b59}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0209-9683}
      \field{journaltitle}{Combinatorica}
      \field{number}{6}
      \field{title}{Counterexample to an {E}xtension of the {H}anani-{T}utte {T}heorem on the {S}urface of {G}enus 4}
      \field{volume}{39}
      \field{year}{2019}
      \field{pages}{1267\bibrangedash 1279}
      \range{pages}{13}
      \verb{doi}
      \verb 10.1007/s00493-019-3905-7
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00493-019-3905-7
      \endverb
    \endentry
    \entry{FK18}{incollection}{}
      \name{author}{2}{}{%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{Kyn\v{c}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern}%
      }
      \strng{namehash}{17d12ff7d4a3b8846bc93c9987033b59}
      \strng{fullhash}{17d12ff7d4a3b8846bc93c9987033b59}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{34th {I}nternational {S}ymposium on {C}omputational {G}eometry}
      \field{series}{LIPIcs. Leibniz Int. Proc. Inform.}
      \field{title}{The {$\mathbb{Z}_2$}-genus of {K}uratowski minors}
      \field{volume}{99}
      \field{year}{2018}
      \field{pages}{Art. No. 40\bibrangessep 14}
      \range{pages}{-1}
    \endentry
    \entry{FK19b}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{{Kyn\v{c}l}}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=4b5a37ab4570a0d872c2fe460d3f9607}{Barequet}{B\bibinitperiod}{Gill}{G\bibinitperiod}{}{}{}{}}%
        {{hash=fed5f88670059b51be0c9cbe3b404b5e}{Wang}{W\bibinitperiod}{Yusu}{Y\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Dagstuhl, Germany}%
      }
      \list{publisher}{1}{%
        {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}%
      }
      \strng{namehash}{17d12ff7d4a3b8846bc93c9987033b59}
      \strng{fullhash}{17d12ff7d4a3b8846bc93c9987033b59}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{annotation}{Keywords: graph genus, minimum rank of a partial matrix, Hanani-Tutte theorem, graph amalgamation}
      \field{booktitle}{35th International Symposium on Computational Geometry (SoCG 2019)}
      \field{isbn}{978-3-95977-104-7}
      \field{issn}{1868-8969}
      \field{series}{Leibniz International Proceedings in Informatics (LIPIcs)}
      \field{title}{{$\mathbb{Z}_2$}-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices}
      \field{volume}{129}
      \field{year}{2019}
      \field{pages}{39:1\bibrangedash 39:16}
      \range{pages}{-1}
      \verb{doi}
      \verb 10.4230/LIPIcs.SoCG.2019.39
      \endverb
      \verb{url}
      \verb http://drops.dagstuhl.de/opus/volltexte/2019/10443
      \endverb
    \endentry
    \entry{FPSS12b}{article}{}
      \name{author}{4}{}{%
        {{hash=feb20046d099b7f22fd409ebcb6126d3}{Fulek}{F\bibinitperiod}{Radoslav}{R\bibinitperiod}{}{}{}{}}%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c18f34fb9bf9e9dbbb8626e461bb5085}
      \strng{fullhash}{fda501a45dc6bbea6eec8a2faaf2c514}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{3}
      \field{title}{Adjacent crossings do matter}
      \field{volume}{16}
      \field{year}{2012}
      \field{pages}{759\bibrangedash 782}
      \range{pages}{24}
    \endentry
    \entry{FK76}{article}{}
      \name{author}{2}{}{%
        {{hash=2be6cfee308883e058a582b27b9a5fa1}{Furry}{F\bibinitperiod}{W.\bibnamedelimi H.}{W\bibinitperiod\bibinitdelim H\bibinitperiod}{}{}{}{}}%
        {{hash=7d6e0a9cf416d09a8fad777a93ac44fd}{Kleitman}{K\bibinitperiod}{D.\bibnamedelimi J.}{D\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0390f8b609ead35126eb974feafcb9be}
      \strng{fullhash}{0390f8b609ead35126eb974feafcb9be}
      \field{sortinit}{F}
      \field{sortinithash}{c6a7d9913bbd7b20ea954441c0460b78}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Studies in Appl. Math.}
      \field{number}{2}
      \field{title}{Maximal rectilinear crossing of cycles}
      \field{volume}{56}
      \field{year}{1977}
      \field{pages}{159\bibrangedash 167}
      \range{pages}{9}
    \endentry
    \entry{GSM10}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=fe1bf31e1f240b19b70273aea3a22763}{Gange}{G\bibinitperiod}{Graeme}{G\bibinitperiod}{}{}{}{}}%
        {{hash=5a53320e66b3a8c8548b55c70af19830}{Stuckey}{S\bibinitperiod}{Peter\bibnamedelima J.}{P\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=b7b9c8a15ea42930441d87944068bfe8}{Marriott}{M\bibinitperiod}{Kim}{K\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=392b457d9bac1ed69366176e7857d7e9}{Brandes}{B\bibinitperiod}{Ulrik}{U\bibinitperiod}{}{}{}{}}%
        {{hash=9ca500e7dc2f8541b248c8be35657130}{Cornelsen}{C\bibinitperiod}{Sabine}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{7302544d2f44e906f577c9c0005e127a}
      \strng{fullhash}{7302544d2f44e906f577c9c0005e127a}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{978-3-642-18468-0}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Optimal $k$-Level Planarization and Crossing Minimization}
      \field{volume}{6502}
      \field{year}{2010}
      \field{pages}{238\bibrangedash 249}
      \range{pages}{12}
    \endentry
    \entry{GHKRV20}{article}{}
      \name{author}{5}{}{%
        {{hash=6ecfff9759e226a5e49d674f7c5332a9}{Ganian}{G\bibinitperiod}{Robert}{R\bibinitperiod}{}{}{}{}}%
        {{hash=759f1cbf66dc1fa9579a34f66296abe6}{Hamm}{H\bibinitperiod}{Thekla}{T\bibinitperiod}{}{}{}{}}%
        {{hash=ad5d9b03edeb04aeefa3737c87fae389}{Klute}{K\bibinitperiod}{Fabian}{F\bibinitperiod}{}{}{}{}}%
        {{hash=1fbdb2b64c79ea245aec6061b3fe0a30}{Parada}{P\bibinitperiod}{Irene}{I\bibinitperiod}{}{}{}{}}%
        {{hash=74b26b9799625f7bbad994391b38d433}{Vogtenhuber}{V\bibinitperiod}{Birgit}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3ed61ee28992ade242d1fc32c110b9b8}
      \strng{fullhash}{5fe604d688b03990c7e99a2a52705cd8}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.CG}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2012.07457} (last accessed 1/9/2021)}
      \field{title}{Crossing-Optimal Extension of Simple Drawings}
      \field{year}{2020}
      \verb{eprint}
      \verb 2012.07457
      \endverb
    \endentry
    \entry{GMS01}{article}{}
      \name{author}{2}{}{%
        {{hash=9ca53a2745faa8882adcb5114af30d51}{Garcia-Moreno}{G\bibinithyphendelim M\bibinitperiod}{Enrique}{E\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{860d6a7dbd6b5a0c3e6da87d654febea}
      \strng{fullhash}{860d6a7dbd6b5a0c3e6da87d654febea}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree}
      \field{volume}{36}
      \field{year}{2001}
      \field{pages}{168\bibrangedash 173}
      \range{pages}{6}
    \endentry
    \entry{GJMP80}{article}{}
      \name{author}{4}{}{%
        {{hash=4b59afd552bf787d8ca7794b6863cb9c}{Garey}{G\bibinitperiod}{M.\bibnamedelimi R.}{M\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=8c7f2a207a19e41869867861822a3f38}{Johnson}{J\bibinitperiod}{D.\bibnamedelimi S.}{D\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=eeb8afefda2ad01112e85319e584d7ba}{Miller}{M\bibinitperiod}{G.\bibnamedelimi L.}{G\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
        {{hash=9c9ccd05f38966b7cd42f8eef06ff34f}{Papadimitriou}{P\bibinitperiod}{C.\bibnamedelimi H.}{C\bibinitperiod\bibinitdelim H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1bf6c98dc9a7f2062c2fbacffb39e9dd}
      \strng{fullhash}{57bf7767375f9a5e7ea88e1309357f51}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0196-5212}
      \field{journaltitle}{SIAM J. Algebraic Discrete Methods}
      \field{number}{2}
      \field{title}{The complexity of coloring circular arcs and chords}
      \field{volume}{1}
      \field{year}{1980}
      \field{pages}{216\bibrangedash 227}
      \range{pages}{12}
    \endentry
    \entry{GJS76}{article}{}
      \name{author}{3}{}{%
        {{hash=4b59afd552bf787d8ca7794b6863cb9c}{Garey}{G\bibinitperiod}{M.\bibnamedelimi R.}{M\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=8c7f2a207a19e41869867861822a3f38}{Johnson}{J\bibinitperiod}{D.\bibnamedelimi S.}{D\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
        {{hash=027bc9de44ef7793bb667e9a5bfb0368}{Stockmeyer}{S\bibinitperiod}{L.}{L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{97e809b7b70d3514e97bec21a7f7a23c}
      \strng{fullhash}{97e809b7b70d3514e97bec21a7f7a23c}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0304-3975}
      \field{journaltitle}{Theoret. Comput. Sci.}
      \field{number}{3}
      \field{title}{Some simplified {NP}-complete graph problems}
      \field{volume}{1}
      \field{year}{1976}
      \field{pages}{237\bibrangedash 267}
      \range{pages}{31}
    \endentry
    \entry{GJ79}{book}{}
      \name{author}{2}{}{%
        {{hash=92f062c3e801b344723c260f2c4d227e}{Garey}{G\bibinitperiod}{Michael\bibnamedelima R.}{M\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=9fc325bb47414d27ede010e33fac2349}{Johnson}{J\bibinitperiod}{David\bibnamedelima S.}{D\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {San Francisco, Calif.}%
      }
      \list{publisher}{2}{%
        {W. H. Freeman}%
        {Co.}%
      }
      \strng{namehash}{3d113486f31acfe9eaca53d0ec8adbb9}
      \strng{fullhash}{3d113486f31acfe9eaca53d0ec8adbb9}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{0-7167-1045-5}
      \field{note}{A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences}
      \field{title}{Computers and intractability}
      \field{year}{1979}
      \field{pages}{x+338}
      \range{pages}{-1}
    \endentry
    \entry{GJ83}{article}{}
      \name{author}{2}{}{%
        {{hash=92f062c3e801b344723c260f2c4d227e}{Garey}{G\bibinitperiod}{Michael\bibnamedelima R.}{M\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=9fc325bb47414d27ede010e33fac2349}{Johnson}{J\bibinitperiod}{David\bibnamedelima S.}{D\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3d113486f31acfe9eaca53d0ec8adbb9}
      \strng{fullhash}{3d113486f31acfe9eaca53d0ec8adbb9}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0196-5212}
      \field{journaltitle}{SIAM Journal on Algebraic and Discrete Methods}
      \field{number}{3}
      \field{title}{Crossing number is {NP}-complete}
      \field{volume}{4}
      \field{year}{1983}
      \field{pages}{312\bibrangedash 316}
      \range{pages}{5}
    \endentry
    \entry{GT01b}{article}{}
      \name{author}{2}{}{%
        {{hash=15b2ddac9e1a4f84c5425d0729a0b60b}{Garg}{G\bibinitperiod}{Ashim}{A\bibinitperiod}{}{}{}{}}%
        {{hash=73002fbcaa8fe0ee76011401f23f2ab3}{Tamassia}{T\bibinitperiod}{Roberto}{R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1719f566ff87f3effdb806377c013a49}
      \strng{fullhash}{1719f566ff87f3effdb806377c013a49}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0097-5397}
      \field{journaltitle}{SIAM J. Comput.}
      \field{number}{2}
      \field{title}{On the computational complexity of upward and rectilinear planarity testing}
      \field{volume}{31}
      \field{year}{2001}
      \field{pages}{601\bibrangedash 625}
      \range{pages}{25}
    \endentry
    \entry{G20}{misc}{}
      \name{author}{1}{}{%
        {{hash=98fa0c463e6d83642d1118fa4ef9c270}{Gasarch}{G\bibinitperiod}{William}{W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{98fa0c463e6d83642d1118fa4ef9c270}
      \strng{fullhash}{98fa0c463e6d83642d1118fa4ef9c270}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{Available at \url{https://www.cs.umd.edu/~gasarch/open/cross.pdf} (last accessed 12/29/2020)}
      \field{title}{The Complexity of Chromatic Number When Restricted to: (1) Bounded Genus (2) Bounded Crossing Number}
      \field{year}{2020}
    \endentry
    \entry{GJPSS06}{incollection}{}
      \name{author}{5}{}{%
        {{hash=3e03d9fa08aaaece1bf4be1bad59f189}{Gassner}{G\bibinitperiod}{Elisabeth}{E\bibinitperiod}{}{}{}{}}%
        {{hash=01169310249847156f664ba0d45a28d2}{J\"{u}nger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=4a06e1c8e83ec569ba8e5ac98efd340b}{Percan}{P\bibinitperiod}{Merijam}{M\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=c51914f1cbb699e35ec6df3a0c76b741}{Schulz}{S\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{152bef46e353a2be66b267e84e3a7cec}
      \strng{fullhash}{09574907e1303bc7514ab097d82a5386}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph-theoretic concepts in computer science}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Simultaneous graph embeddings with fixed edges}
      \field{volume}{4271}
      \field{year}{2006}
      \field{pages}{325\bibrangedash 335}
      \range{pages}{11}
    \endentry
    \entry{G00}{book}{}
      \name{author}{1}{}{%
        {{hash=f108db144994c08d92fd396d6427921a}{Gau{\ss{}}}{G\bibinitperiod}{Carl\bibnamedelima Friedrich}{C\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Leipzig}%
      }
      \list{publisher}{1}{%
        {B.G. Teubner}%
      }
      \strng{namehash}{f108db144994c08d92fd396d6427921a}
      \strng{fullhash}{f108db144994c08d92fd396d6427921a}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Werke. {B}and {VIII}}
      \field{year}{1900}
      \field{pages}{viii+458}
      \range{pages}{-1}
    \endentry
    \entry{GH99}{incollection}{}
      \name{author}{2}{}{%
        {{hash=6e38cb4019b05cd114848ff41314ea2c}{Gavoille}{G\bibinitperiod}{Cyril}{C\bibinitperiod}{}{}{}{}}%
        {{hash=b6f25d478d4131964fff6dfc204273f3}{Hanusse}{H\bibinitperiod}{Nicolas}{N\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{72e715cc07bf4a9736bc83ef10a89f53}
      \strng{fullhash}{72e715cc07bf4a9736bc83ef10a89f53}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Automata, languages and programming ({P}rague, 1999)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Compact routing tables for graphs of bounded genus (extended abstract)}
      \field{volume}{1644}
      \field{year}{1999}
      \field{pages}{351\bibrangedash 360}
      \range{pages}{10}
    \endentry
    \entry{G15}{thesis}{}
      \name{author}{1}{}{%
        {{hash=046026c2e585dc97bf2a75469a7314cd}{Gei{\ss{}}er}{G\bibinitperiod}{Maximilian}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Karlsruhe Institute of Technology}%
      }
      \list{location}{1}{%
        {Karlsruhe, Germany}%
      }
      \strng{namehash}{046026c2e585dc97bf2a75469a7314cd}
      \strng{fullhash}{046026c2e585dc97bf2a75469a7314cd}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Kreuzungsminimierung bei simulatner Einbettung planarer Graphen}
      \field{type}{Bachelor thesis}
      \field{year}{2015}
    \endentry
    \entry{GHLPRY17}{article}{}
      \name{author}{6}{}{%
        {{hash=52e076403755ef186520416ecbce7ca4}{Gethner}{G\bibinitperiod}{Ellen}{E\bibinitperiod}{}{}{}{}}%
        {{hash=1d9741f662bbd3f310fa9701d533bff9}{Hogben}{H\bibinitperiod}{Leslie}{L\bibinitperiod}{}{}{}{}}%
        {{hash=8d96d13eb7fa9f65194d3642f3c9ea59}{Lidick\'{y}}{L\bibinitperiod}{Bernard}{B\bibinitperiod}{}{}{}{}}%
        {{hash=fcd836e77ca7ebb614d5ff194a5ea0b8}{Pfender}{P\bibinitperiod}{Florian}{F\bibinitperiod}{}{}{}{}}%
        {{hash=83576f83f7a394c25f949ee2e5681b10}{Ruiz}{R\bibinitperiod}{Amanda}{A\bibinitperiod}{}{}{}{}}%
        {{hash=dd67473938345c135f49444d372c2123}{Young}{Y\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cc0988a95a7aef71920ffe2c8f57850e}
      \strng{fullhash}{7d811333cf2a7c18a539854cea272a43}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{4}
      \field{title}{On crossing numbers of complete tripartite and balanced complete multipartite graphs}
      \field{volume}{84}
      \field{year}{2017}
      \field{pages}{552\bibrangedash 565}
      \range{pages}{14}
      \verb{doi}
      \verb 10.1002/jgt.22041
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1002/jgt.22041
      \endverb
    \endentry
    \entry{GM14}{article}{}
      \name{author}{2}{}{%
        {{hash=8ebce67f8ed074402b69561cd17c38c0}{Ginn}{G\bibinitperiod}{Mark}{M\bibinitperiod}{}{}{}{}}%
        {{hash=372c2c53b02451a7960a28338b588929}{Miller}{M\bibinitperiod}{Faith}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8955423bd72f083d035926fba0a6e57d}
      \strng{fullhash}{8955423bd72f083d035926fba0a6e57d}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The crossing number of {$K_{3,3,n}$}}
      \field{volume}{221}
      \field{year}{2014}
      \field{pages}{49\bibrangedash 54}
      \range{pages}{6}
    \endentry
    \entry{GS04}{article}{}
      \name{author}{2}{}{%
        {{hash=94b6c82f1c386f30ca2f699952f405c8}{Glebsky}{G\bibinitperiod}{Lev\bibnamedelima Yu.}{L\bibinitperiod\bibinitdelim Y\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Wiley Subscription Services, Inc., A Wiley Company}%
      }
      \strng{namehash}{bba6c4edc386a5d160b8337e6c2ffd66}
      \strng{fullhash}{bba6c4edc386a5d160b8337e6c2ffd66}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1097-0118}
      \field{journaltitle}{Journal of Graph Theory}
      \field{number}{1}
      \field{title}{The crossing number of {$C_m \times C_n$} is as conjectured for $n \geq m(m+1)$}
      \field{volume}{47}
      \field{year}{2004}
      \field{pages}{53\bibrangedash 72}
      \range{pages}{20}
    \endentry
    \entry{GSL21}{book}{}
      \name{author}{2}{}{%
        {{hash=3e562ab60ccb567756845411eca94b5c}{Golumbic}{G\bibinitperiod}{Martin\bibnamedelima Charles}{M\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
        {{hash=62f77d23ee0ab585df5797ccf0988975}{Sainte-Lagu\"{e}}{S\bibinithyphendelim L\bibinitperiod}{Andr\'{e}}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{b5aa892a91019cab4d2bdbe34e9d635f}
      \strng{fullhash}{b5aa892a91019cab4d2bdbe34e9d635f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{978-3-030-61420-1; 978-3-030-61419-5}
      \field{note}{An annotated translation of Les R\'{e}seaux (ou Graphes)---Andr\'{e} Sainte-Lagu\"{e} (1926), History of Mathematics Subseries}
      \field{series}{Lecture Notes in Mathematics}
      \field{title}{The zeroth book of graph theory}
      \field{volume}{2261}
      \field{year}{2021}
      \field{pages}{120}
      \range{pages}{1}
      \verb{doi}
      \verb 10.1007/978-3-030-61420-1
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/978-3-030-61420-1
      \endverb
    \endentry
    \entry{G61}{article}{}
      \name{author}{1}{}{%
        {{hash=256c8913d47e7684351afb9f61da903b}{Goodman}{G\bibinitperiod}{H.\bibnamedelimi P.}{H\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{256c8913d47e7684351afb9f61da903b}
      \strng{fullhash}{256c8913d47e7684351afb9f61da903b}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Nature}
      \field{month}{05}
      \field{number}{4778}
      \field{title}{The Complete $n$-Point Graph}
      \field{volume}{190}
      \field{year}{1961}
      \field{pages}{840}
      \range{pages}{1}
      \verb{doi}
      \verb 10.1038/190840a0
      \endverb
    \endentry
    \entry{G1850}{book}{}
      \name{author}{1}{}{%
        {{hash=dd09118b5d36ac814265db3fc3bbd24f}{Gr\"{a}fe}{G\bibinitperiod}{Heinrich}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {C.F. Amelang, Leipzig}%
      }
      \strng{namehash}{dd09118b5d36ac814265db3fc3bbd24f}
      \strng{fullhash}{dd09118b5d36ac814265db3fc3bbd24f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{Second}
      \field{title}{Geometrische Anschauungslehre}
      \field{year}{1850}
      \field{pages}{vi+306}
      \range{pages}{-1}
    \endentry
    \entry{BG07}{article}{}
      \name{author}{2}{}{%
        {{hash=218982e2f23160cb9bc5cf0420a2283a}{Grigoriev}{G\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
        {{hash=0f66b7e8e78b2034cd434ee7809b4d8e}{Bodlaender}{B\bibinitperiod}{Hans\bibnamedelima L.}{H\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6b52088436a710bcf483ef89ce879363}
      \strng{fullhash}{6b52088436a710bcf483ef89ce879363}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Algorithmica}
      \field{number}{1}
      \field{title}{Algorithms for Graphs Embeddable with Few Crossings per Edge}
      \field{volume}{49}
      \field{year}{2007}
      \field{pages}{1\bibrangedash 11}
      \range{pages}{11}
    \endentry
    \entry{GKT13}{article}{}
      \name{author}{3}{}{%
        {{hash=218982e2f23160cb9bc5cf0420a2283a}{{Grigoriev}}{G\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
        {{hash=926273f70a77af849a602cf4fc122e99}{{Koutsonas}}{K\bibinitperiod}{Athanassios}{A\bibinitperiod}{}{}{}{}}%
        {{hash=e8b481e34c41d26b87a8fa7fcbec0ba9}{{Thilikos}}{T\bibinitperiod}{Dimitrios\bibnamedelima M.}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{35511f518aa0df1250ce4b3046bfe3c3}
      \strng{fullhash}{35511f518aa0df1250ce4b3046bfe3c3}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{11}
      \field{note}{\arxiv{1311.0137} (last accessed 9/21/2017)}
      \field{title}{{Nearly Planar Graphs and $\lambda$-flat Graphs}}
      \field{year}{2013}
      \verb{eprint}
      \verb 1311.0137
      \endverb
    \endentry
    \entry{G89}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=da03c50b3d514546835d4d2e1242489b}{Groenveld}{G\bibinitperiod}{Patrick}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE}%
      }
      \strng{namehash}{da03c50b3d514546835d4d2e1242489b}
      \strng{fullhash}{da03c50b3d514546835d4d2e1242489b}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{26th Conference on Design Automation Conference}
      \field{issn}{0738-100X}
      \field{title}{On Global Wire Ordering for Macro-Cell Routing}
      \field{year}{1989}
      \field{pages}{155\bibrangedash 160}
      \range{pages}{6}
    \endentry
    \entry{G01}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=09c9a63ce22980640e97ed9ed81ea815}{Grohe}{G\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{09c9a63ce22980640e97ed9ed81ea815}
      \strng{fullhash}{09c9a63ce22980640e97ed9ed81ea815}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 32nd ACM Symposium on Theory of Computing}
      \field{month}{07}
      \field{title}{Computing Crossing Numbers in Quadratic Time}
      \field{year}{2001}
      \field{pages}{231\bibrangedash 236}
      \range{pages}{6}
    \endentry
    \entry{G78}{article}{}
      \name{author}{1}{}{%
        {{hash=63ff8949725744b36218d5aeeb751c46}{Gross}{G\bibinitperiod}{Jonathan\bibnamedelima L.}{J\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{63ff8949725744b36218d5aeeb751c46}
      \strng{fullhash}{63ff8949725744b36218d5aeeb751c46}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{2}
      \field{title}{An infinite family of octahedral crossing numbers}
      \field{volume}{2}
      \field{year}{1978}
      \field{pages}{171\bibrangedash 178}
      \range{pages}{8}
    \endentry
    \entry{G72b}{book}{}
      \name{author}{1}{}{%
        {{hash=5c1ab51440cf893c3bee71828dbafaef}{Gr\"{u}nbaum}{G\bibinitperiod}{Branko}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {American Mathematical Society Providence, R.I.}%
      }
      \strng{namehash}{5c1ab51440cf893c3bee71828dbafaef}
      \strng{fullhash}{5c1ab51440cf893c3bee71828dbafaef}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{series}{Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, No. 10}
      \field{title}{Arrangements and spreads}
      \field{year}{1972}
      \field{pages}{iv+114}
      \range{pages}{-1}
    \endentry
    \entry{G99}{article}{}
      \name{author}{1}{}{%
        {{hash=5c1ab51440cf893c3bee71828dbafaef}{Gr\"{u}nbaum}{G\bibinitperiod}{Branko}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5c1ab51440cf893c3bee71828dbafaef}
      \strng{fullhash}{5c1ab51440cf893c3bee71828dbafaef}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{3}
      \field{title}{Selfintersections of polyarcs}
      \field{volume}{8}
      \field{year}{1999}
      \field{pages}{78\bibrangedash 85}
      \range{pages}{8}
    \endentry
    \entry{G98}{article}{}
      \name{author}{1}{}{%
        {{hash=5c1ab51440cf893c3bee71828dbafaef}{Gr\"{u}nbaum}{G\bibinitperiod}{Branko}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5c1ab51440cf893c3bee71828dbafaef}
      \strng{fullhash}{5c1ab51440cf893c3bee71828dbafaef}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{2}
      \field{title}{Selfintersections of polygons}
      \field{volume}{8}
      \field{year}{1998}
      \field{pages}{37\bibrangedash 45}
      \range{pages}{9}
    \endentry
    \entry{G15b}{article}{}
      \name{author}{1}{}{%
        {{hash=7fc8f59c7b2b48e5bb8a7d735fc55189}{G\"{u}nther}{G\bibinitperiod}{Felix}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7fc8f59c7b2b48e5bb8a7d735fc55189}
      \strng{fullhash}{7fc8f59c7b2b48e5bb8a7d735fc55189}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1207.0996} (last accessed 1/7/2021)}
      \field{title}{The maximum number of intersections of two polygons}
      \field{year}{2015}
      \verb{eprint}
      \verb 1207.0996
      \endverb
      \keyw{Mathematics - Combinatorics}
    \endentry
    \entry{G60}{article}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Nabla (Bull. Malayan Math. Soc)}
      \field{title}{A combinatorial problem}
      \field{volume}{7}
      \field{year}{1960}
      \field{pages}{68\bibrangedash 72}
      \range{pages}{5}
    \endentry
    \entry{G72}{incollection}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Lecture Notes in Math., Vol. 303, Springer, Berlin}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{title}{Crossing numbers of graphs}
      \field{year}{1972}
      \field{pages}{111\bibrangedash 124}
      \range{pages}{14}
    \endentry
    \entry{G71b}{incollection}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Lecture Notes in Mathematics, Vol. 186. Springer, Berlin}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Recent {T}rends in {G}raph {T}heory ({P}roc. {C}onf., {N}ew {Y}ork, 1970)}
      \field{title}{Latest results on crossing numbers}
      \field{year}{1971}
      \field{pages}{143\bibrangedash 156}
      \range{pages}{14}
    \endentry
    \entry{G69}{incollection}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Academic Press, New York}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{title}{The decline and fall of {Z}arankiewicz's theorem}
      \field{year}{1969}
      \field{pages}{63\bibrangedash 69}
      \range{pages}{7}
    \endentry
    \entry{G68}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=6e9de8ebb096b157f4babbfc7abe0d6e}{Sachs}{S\bibinitperiod}{Hans}{H\bibinitperiod}{}{}{}{}}%
        {{hash=ab91e05074c30ae869d353e7bccf6d4b}{Vo\ss{}}{V\bibinitperiod}{Heinz-J\"{u}rgen}{H\bibinithyphendelim J\bibinitperiod}{}{}{}{}}%
        {{hash=7be60893115c7c7e8216e8fe6392fd35}{Walther}{W\bibinitperiod}{Hansjoachim}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Leipzig}%
      }
      \list{publisher}{1}{%
        {B.G. Teubner}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Beitr\"{a}ge zur {G}raphentheorie}
      \field{title}{The planar and toroidal crossing numbers of {$K_{n}$}}
      \field{year}{1968}
      \field{pages}{37\bibrangedash 39}
      \range{pages}{3}
    \endentry
    \entry{G71}{incollection}{}
      \name{author}{1}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {London}%
      }
      \list{publisher}{1}{%
        {Academic Press}%
      }
      \strng{namehash}{31cbb50ba8b74599553977719ee3ab3f}
      \strng{fullhash}{31cbb50ba8b74599553977719ee3ab3f}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial {M}athematics and its {A}pplications ({P}roc. {C}onf., {O}xford, 1969)}
      \field{title}{Unsolved combinatorial problems}
      \field{year}{1971}
      \field{pages}{121\bibrangedash 127}
      \range{pages}{7}
    \endentry
    \entry{GH73}{article}{}
      \name{author}{2}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=b55995572341a730da2bd653ae131666}{Hill}{H\bibinitperiod}{Anthony}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{03402442f133a606b66082ae1bb211ee}
      \strng{fullhash}{03402442f133a606b66082ae1bb211ee}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{title}{The crossing number of the complement of a circuit}
      \field{volume}{5}
      \field{year}{1973}
      \field{pages}{335\bibrangedash 344}
      \range{pages}{10}
    \endentry
    \entry{GJ69}{article}{}
      \name{author}{2}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=e326229bbda6b762108e5b0bb24ff2c7}{Jenkyns}{J\bibinitperiod}{T.\bibnamedelimi A.}{T\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{81cd54f00b562384a93388a60f3ba89c}
      \strng{fullhash}{81cd54f00b562384a93388a60f3ba89c}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory}
      \field{title}{The toroidal crossing number of {$K_{m,n}$}}
      \field{volume}{6}
      \field{year}{1969}
      \field{pages}{235\bibrangedash 250}
      \range{pages}{16}
    \endentry
    \entry{GJS68}{article}{}
      \name{author}{3}{}{%
        {{hash=31cbb50ba8b74599553977719ee3ab3f}{Guy}{G\bibinitperiod}{Richard\bibnamedelima K.}{R\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=b8bbdfa10b3a0c4cd2c5aca3b8e766e0}{Jenkyns}{J\bibinitperiod}{Tom}{T\bibinitperiod}{}{}{}{}}%
        {{hash=1c7d6fe743d690754784512c8b4dd0b1}{Schaer}{S\bibinitperiod}{Jonathan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ce94a003775d6f110275004f6e963bcb}
      \strng{fullhash}{ce94a003775d6f110275004f6e963bcb}
      \field{sortinit}{G}
      \field{sortinithash}{1c854ef9177a91bf894e66485bdbd3ed}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory}
      \field{title}{The toroidal crossing number of the complete graph}
      \field{volume}{4}
      \field{year}{1968}
      \field{pages}{376\bibrangedash 390}
      \range{pages}{15}
    \endentry
    \entry{H69}{article}{}
      \name{author}{1}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e3160b3da4830dc2704b52726168a61f}
      \strng{fullhash}{e3160b3da4830dc2704b52726168a61f}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0011-801x}
      \field{journaltitle}{Math. Mag.}
      \field{title}{Determinants, permanents and bipartite graphs}
      \field{volume}{42}
      \field{year}{1969}
      \field{pages}{146\bibrangedash 148}
      \range{pages}{3}
    \endentry
    \entry{H83}{article}{}
      \name{author}{1}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e3160b3da4830dc2704b52726168a61f}
      \strng{fullhash}{e3160b3da4830dc2704b52726168a61f}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Maximum versus minimum invariants for graphs}
      \field{volume}{7}
      \field{year}{1983}
      \field{pages}{275\bibrangedash 284}
      \range{pages}{10}
    \endentry
    \entry{H65}{article}{}
      \name{author}{1}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e3160b3da4830dc2704b52726168a61f}
      \strng{fullhash}{e3160b3da4830dc2704b52726168a61f}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0524-9007}
      \field{journaltitle}{Ann. Univ. Sci. Budapest. E\"{o}tv\"{o}s Sect. Math.}
      \field{title}{On minimally nonplanar graphs}
      \field{volume}{8}
      \field{year}{1965}
      \field{pages}{13\bibrangedash 15}
      \range{pages}{3}
    \endentry
    \entry{H64}{article}{}
      \name{author}{1}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e3160b3da4830dc2704b52726168a61f}
      \strng{fullhash}{e3160b3da4830dc2704b52726168a61f}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0001-5954}
      \field{journaltitle}{Acta Math. Acad. Sci. Hungar}
      \field{title}{Recent results in topological graph theory}
      \field{volume}{15}
      \field{year}{1964}
      \field{pages}{405\bibrangedash 411}
      \range{pages}{7}
    \endentry
    \entry{HH63}{article}{}
      \name{author}{2}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=b55995572341a730da2bd653ae131666}{Hill}{H\bibinitperiod}{Anthony}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bbd104145a90ad9cd0bcffe71aff7c8a}
      \strng{fullhash}{bbd104145a90ad9cd0bcffe71aff7c8a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0013-0915}
      \field{journaltitle}{Proc. Edinburgh Math. Soc. (2)}
      \field{title}{On the number of crossings in a complete graph}
      \field{volume}{13}
      \field{year}{1963}
      \field{pages}{333\bibrangedash 338}
      \range{pages}{6}
    \endentry
    \entry{HKR99}{article}{}
      \name{author}{3}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{40199628beb276a26abad1264c6463ba}
      \strng{fullhash}{40199628beb276a26abad1264c6463ba}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{Every graph of cyclic bandwidth 3 is toroidal}
      \field{volume}{27}
      \field{year}{1999}
      \field{pages}{81\bibrangedash 84}
      \range{pages}{4}
    \endentry
    \entry{HKS73}{article}{}
      \name{author}{3}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
        {{hash=34667f608c0ee1a5c79b150f39f158ec}{Schwenk}{S\bibinitperiod}{Allen\bibnamedelima J.}{A\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{18f7e8b8976142596edb3350c1a907fe}
      \strng{fullhash}{18f7e8b8976142596edb3350c1a907fe}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0077-2739}
      \field{journaltitle}{Nanta Math.}
      \field{number}{1}
      \field{title}{Toroidal graphs with arbitrarily high crossing numbers}
      \field{volume}{6}
      \field{year}{1973}
      \field{pages}{58\bibrangedash 67}
      \range{pages}{10}
    \endentry
    \entry{HS72}{article}{}
      \name{author}{2}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=e979515aadf62c69bd2fa8fb4a4692c0}{Schwenk}{S\bibinitperiod}{Allen}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3d6cdd6760b8c0ba948d60b9f8e62bd6}
      \strng{fullhash}{3d6cdd6760b8c0ba948d60b9f8e62bd6}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0315-3681}
      \field{journaltitle}{Utilitas Math.}
      \field{title}{A new crossing number for bipartite graphs}
      \field{volume}{1}
      \field{year}{1972}
      \field{pages}{203\bibrangedash 209}
      \range{pages}{7}
    \endentry
    \entry{HS71}{article}{}
      \name{author}{2}{}{%
        {{hash=e3160b3da4830dc2704b52726168a61f}{Harary}{H\bibinitperiod}{Frank}{F\bibinitperiod}{}{}{}{}}%
        {{hash=e979515aadf62c69bd2fa8fb4a4692c0}{Schwenk}{S\bibinitperiod}{Allen}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3d6cdd6760b8c0ba948d60b9f8e62bd6}
      \strng{fullhash}{3d6cdd6760b8c0ba948d60b9f8e62bd6}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5793}
      \field{journaltitle}{Mathematika}
      \field{title}{Trees with {H}amiltonian square}
      \field{volume}{18}
      \field{year}{1971}
      \field{pages}{138\bibrangedash 140}
      \range{pages}{3}
    \endentry
    \entry{H76a}{misc}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Elem. Math.}
      \field{number}{5}
      \field{title}{Aufgabe 750}
      \field{volume}{31}
      \field{year}{1976}
      \field{pages}{121}
      \range{pages}{1}
    \endentry
    \entry{H78}{incollection}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {North-Holland, Amsterdam-New York}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorics ({P}roc. {F}ifth {H}ungarian {C}olloq., {K}eszthely, 1976), {V}ol. {I}}
      \field{series}{Colloq. Math. Soc. J\'{a}nos Bolyai}
      \field{title}{Crossings on edges in drawings of complete multipartite graphs}
      \field{volume}{18}
      \field{year}{1978}
      \field{pages}{539\bibrangedash 551}
      \range{pages}{13}
    \endentry
    \entry{H88b}{incollection}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {TH Ilmenau}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graphen und Netzwerke-Theorie und Anwendungen}
      \field{journaltitle}{33. Intern. Wiss. Koll. TH Ilmenau 1988, Heft 4, C2}
      \field{title}{{D}arstellungen des vollst\"{a}ndigen {G}raphen ohne {K}anten mit wenigen {K}reuzungen}
      \field{year}{1988}
      \field{pages}{179\bibrangedash 181}
      \range{pages}{3}
    \endentry
    \entry{H85}{incollection}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Wiley, New York}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph theory with applications to algorithms and computer science ({K}alamazoo, {M}ich., 1984)}
      \field{series}{Wiley-Intersci. Publ.}
      \field{title}{Drawings of graphs and multiple crossings}
      \field{year}{1985}
      \field{pages}{413\bibrangedash 421}
      \range{pages}{9}
    \endentry
    \entry{H88}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Drawings of the cycle graph}
      \field{volume}{66}
      \field{year}{1988}
      \field{pages}{15\bibrangedash 22}
      \range{pages}{8}
    \endentry
    \entry{H91}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Maximum number of crossings for the cube graph}
      \field{volume}{82}
      \field{year}{1991}
      \field{pages}{117\bibrangedash 122}
      \range{pages}{6}
    \endentry
    \entry{H76}{article}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Math. Slovaca}
      \field{number}{2}
      \field{title}{Parity of numbers of crossings for complete {$n$}-partite graphs}
      \field{volume}{26}
      \field{year}{1976}
      \field{pages}{77\bibrangedash 95}
      \range{pages}{19}
    \endentry
    \entry{H02}{article}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algebraic and topological methods in graph theory (Lake Bled, 1999)}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{1-3}
      \field{title}{Special numbers of crossings for complete graphs}
      \field{volume}{244}
      \field{year}{2002}
      \field{pages}{95\bibrangedash 102}
      \range{pages}{8}
    \endentry
    \entry{H16b}{article}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{1}
      \field{title}{The maximum crossing number of the {P}etersen graph}
      \field{volume}{26}
      \field{year}{2016}
      \field{pages}{16\bibrangedash 22}
      \range{pages}{7}
    \endentry
    \entry{H71}{article}{}
      \name{author}{1}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \strng{fullhash}{e4c63fe4ce35cd2aa2c3d16e3b1b98e3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-584X}
      \field{journaltitle}{Math. Nachr.}
      \field{title}{\"{U}ber die {K}reuzungszahl vollst\"{a}ndiger, {$n$}-geteilter {G}raphen}
      \field{volume}{48}
      \field{year}{1971}
      \field{pages}{179\bibrangedash 188}
      \range{pages}{10}
    \endentry
    \entry{HM92}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=fed0a28a06a32395ed191b0814b41043}{Mengersen}{M\bibinitperiod}{Ingrid}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \strng{fullhash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Drawings of the complete graph with maximum number of crossings}
      \field{volume}{88}
      \field{year}{1992}
      \field{pages}{225\bibrangedash 228}
      \range{pages}{4}
    \endentry
    \entry{HM90}{incollection}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=fed0a28a06a32395ed191b0814b41043}{Mengersen}{M\bibinitperiod}{Ingrid}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Physica, Heidelberg}%
      }
      \strng{namehash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \strng{fullhash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Topics in combinatorics and graph theory ({O}berwolfach, 1990)}
      \field{title}{Edges with at most one crossing in drawings of the complete graph}
      \field{year}{1990}
      \field{pages}{757\bibrangedash 763}
      \range{pages}{7}
    \endentry
    \entry{HM74}{article}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=fed0a28a06a32395ed191b0814b41043}{Mengersen}{M\bibinitperiod}{Ingrid}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \strng{fullhash}{59d161c89a9d32d30f607cbc9b6f58cd}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory Ser. B}
      \field{title}{Edges without crossings in drawings of complete graphs}
      \field{volume}{17}
      \field{year}{1974}
      \field{pages}{299\bibrangedash 311}
      \range{pages}{13}
    \endentry
    \entry{HT14}{article}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=c39d5a41a3065c85279ce8110c9127f6}{Th\"{u}rmann}{T\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e70e57c7fbd6fe133eeff2628476e065}
      \strng{fullhash}{e70e57c7fbd6fe133eeff2628476e065}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Maximum rectilinear crossing number in drawings of the complete graph with a given convex hull}
      \field{volume}{221}
      \field{year}{2014}
      \field{pages}{121\bibrangedash 127}
      \range{pages}{7}
    \endentry
    \entry{HT96}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=c39d5a41a3065c85279ce8110c9127f6}{Th\"{u}rmann}{T\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e70e57c7fbd6fe133eeff2628476e065}
      \strng{fullhash}{e70e57c7fbd6fe133eeff2628476e065}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{Numbers of edges without crossings in rectilinear drawings of the complete graph}
      \field{volume}{119}
      \field{year}{1996}
      \field{pages}{79\bibrangedash 83}
      \range{pages}{5}
    \endentry
    \entry{HZ95}{incollection}{}
      \name{author}{2}{}{%
        {{hash=e4c63fe4ce35cd2aa2c3d16e3b1b98e3}{Harborth}{H\bibinitperiod}{Heiko}{H\bibinitperiod}{}{}{}{}}%
        {{hash=d588acdb1337fb16ff4b71dbc68e2d83}{Zahn}{Z\bibinitperiod}{Sophie}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Wiley}%
      }
      \strng{namehash}{ebeb133055c9ffc511c7b4dabfd96269}
      \strng{fullhash}{ebeb133055c9ffc511c7b4dabfd96269}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph theory, combinatorics, and algorithms, {V}ol.\ 1, 2 ({K}alamazoo, {MI}, 1992)}
      \field{series}{Wiley-Intersci. Publ.}
      \field{title}{Maximum number of crossings in drawings of small graphs}
      \field{year}{1995}
      \field{pages}{485\bibrangedash 495}
      \range{pages}{11}
    \endentry
    \entry{HN20}{article}{}
      \name{author}{2}{}{%
        {{hash=ae9eeebf572fbc2c155224ae205d148d}{Haythorpe}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d13e92a7aabf201237dbe3f05922ad76}{Newcombe}{N\bibinitperiod}{Alex}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{19409b2dd0e13e499dc78469ac8ee647}
      \strng{fullhash}{19409b2dd0e13e499dc78469ac8ee647}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2005.06699} (last accessed 5/19/2020)}
      \field{title}{The maximum crossing number of {$C_3 \times C_3$}}
      \field{year}{2020}
      \verb{eprint}
      \verb 2005.06699
      \endverb
    \endentry
    \entry{HSM10}{article}{}
      \name{author}{3}{}{%
        {{hash=c60a1de3ffee312e2e8da092c6c2d294}{He}{H\bibinitperiod}{Hongmei}{H\bibinitperiod}{}{}{}{}}%
        {{hash=903dfae7658c63d7fab759b6931538a2}{S\u{a}l\u{a}gean}{S\bibinitperiod}{Ana}{A\bibinitperiod}{}{}{}{}}%
        {{hash=cc478e79cf8dc400b7c1ee7a64ecb3d3}{M\"{a}kinen}{M\bibinitperiod}{Erkki}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b2931cd5b14982de9625ed12cd523cb4}
      \strng{fullhash}{b2931cd5b14982de9625ed12cd523cb4}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0020-7160}
      \field{journaltitle}{Int. J. Comput. Math.}
      \field{number}{8}
      \field{title}{One- and two-page crossing numbers for some types of graphs}
      \field{volume}{87}
      \field{year}{2010}
      \field{pages}{1667\bibrangedash 1679}
      \range{pages}{13}
    \endentry
    \entry{HSMV15}{article}{}
      \name{author}{4}{}{%
        {{hash=c60a1de3ffee312e2e8da092c6c2d294}{He}{H\bibinitperiod}{Hongmei}{H\bibinitperiod}{}{}{}{}}%
        {{hash=903dfae7658c63d7fab759b6931538a2}{S\u{a}l\u{a}gean}{S\bibinitperiod}{Ana}{A\bibinitperiod}{}{}{}{}}%
        {{hash=cc478e79cf8dc400b7c1ee7a64ecb3d3}{M\"{a}kinen}{M\bibinitperiod}{Erkki}{E\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b37098eeefbbb356f3d81b1b41703e1e}
      \strng{fullhash}{addf32f6cde926dd6c846ad25e915829}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{2299-1093}
      \field{journaltitle}{Open Comput. Sci.}
      \field{number}{1}
      \field{title}{Various heuristic algorithms to minimise the two-page crossing numbers of graphs}
      \field{volume}{5}
      \field{year}{2015}
      \field{pages}{22\bibrangedash 40}
      \range{pages}{19}
    \endentry
    \entry{H98w}{misc}{}
      \name{author}{1}{}{%
        {{hash=2cc4079c7459bc9f38adfe60fb7f430b}{Hedetniemi}{H\bibinitperiod}{Steve}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2cc4079c7459bc9f38adfe60fb7f430b}
      \strng{fullhash}{2cc4079c7459bc9f38adfe60fb7f430b}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{http://www.cs.clemson.edu/~hedet/algorithms.html} (last accessed 1/9/2013)}
      \field{title}{OPEN PROBLEMS IN COMBINATORIAL OPTIMIZATION}
    \endentry
    \entry{HVLS17}{article}{}
      \name{author}{3}{}{%
        {{hash=dd2181357ceebbbd253d52ae022f57ab}{Hern\'{a}ndez-V\'{e}lez}{H\bibinithyphendelim V\bibinitperiod}{C\'{e}sar}{C\bibinitperiod}{}{}{}{}}%
        {{hash=bd890a8f73b9a5c017b00099304025a1}{Lea\~{n}os}{L\bibinitperiod}{Jes\'{u}s}{J\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e9c55f7ef9eaa96bf8b83b47234f7f08}
      \strng{fullhash}{e9c55f7ef9eaa96bf8b83b47234f7f08}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{On the pseudolinear crossing number}
      \field{volume}{84}
      \field{year}{2017}
      \field{pages}{297\bibrangedash 310}
      \range{pages}{14}
      \verb{doi}
      \verb 10.1002/jgt.22027
      \endverb
      \verb{url}
      \verb https://doi.org/10.1002/jgt.22027
      \endverb
    \endentry
    \entry{H16}{article}{}
      \name{author}{1}{}{%
        {{hash=44c6e2b2b7bf5d7dab2a5bc5214faf5c}{Hjelmslev}{H\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{44c6e2b2b7bf5d7dab2a5bc5214faf5c}
      \strng{fullhash}{44c6e2b2b7bf5d7dab2a5bc5214faf5c}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0001-5962}
      \field{journaltitle}{Acta Math.}
      \field{number}{1}
      \field{title}{Die {G}eometrie der {W}irklichkeit}
      \field{volume}{40}
      \field{year}{1916}
      \field{pages}{35\bibrangedash 66}
      \range{pages}{32}
    \endentry
    \entry{H23}{article}{}
      \name{author}{1}{}{%
        {{hash=44c6e2b2b7bf5d7dab2a5bc5214faf5c}{Hjelmslev}{H\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{44c6e2b2b7bf5d7dab2a5bc5214faf5c}
      \strng{fullhash}{44c6e2b2b7bf5d7dab2a5bc5214faf5c}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5858}
      \field{issue}{1}
      \field{journaltitle}{Abhandlungen aus dem Mathematischen Seminar der Universit\"{a}t Hamburg}
      \field{title}{Die nat\"{u}rliche {G}eometrie}
      \field{volume}{2}
      \field{year}{1923}
      \field{pages}{1\bibrangedash 36}
      \range{pages}{36}
    \endentry
    \entry{H03}{article}{}
      \name{author}{1}{}{%
        {{hash=db7bea607ab4c9982dfe35ced798a6c3}{Hlin\v{e}ny}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{db7bea607ab4c9982dfe35ced798a6c3}
      \strng{fullhash}{db7bea607ab4c9982dfe35ced798a6c3}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{2}
      \field{title}{Crossing-number critical graphs have bounded path-width}
      \field{volume}{88}
      \field{year}{2003}
      \field{pages}{347\bibrangedash 367}
      \range{pages}{21}
    \endentry
    \entry{H06}{article}{}
      \name{author}{1}{}{%
        {{hash=c4ffb32948da81571dcb1d9f582c32fa}{Hlin\v{e}n\'{y}}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4ffb32948da81571dcb1d9f582c32fa}
      \strng{fullhash}{c4ffb32948da81571dcb1d9f582c32fa}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{4}
      \field{title}{Crossing number is hard for cubic graphs}
      \field{volume}{96}
      \field{year}{2006}
      \field{pages}{455\bibrangedash 471}
      \range{pages}{17}
    \endentry
    \entry{HD16}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=9b8b13bf52c8d20be107d0e3eab4f38f}{Hlinen\'{y}}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=cd752da3680b40412278c076e0fcea57}{Dern\'{a}r}{D\bibinitperiod}{Marek}{M\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=042e1f31080fa0c31250f6a3302a1888}{Fekete}{F\bibinitperiod}{S\'{a}ndor\bibnamedelima P.}{S\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=73aee614481d4bc018f38ffa4d43a239}{Lubiw}{L\bibinitperiod}{Anna}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}%
      }
      \strng{namehash}{584b3505ef6eaa2e16112bf33f42701a}
      \strng{fullhash}{584b3505ef6eaa2e16112bf33f42701a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, {USA}}
      \field{isbn}{978-3-95977-009-5}
      \field{series}{LIPIcs}
      \field{title}{Crossing Number is Hard for Kernelization}
      \field{volume}{51}
      \field{year}{2016}
      \field{pages}{42:1\bibrangedash 42:10}
      \range{pages}{-1}
      \verb{doi}
      \verb 10.4230/LIPIcs.SoCG.2016.42
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.42
      \endverb
    \endentry
    \entry{HS15}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=c4ffb32948da81571dcb1d9f582c32fa}{Hlin\v{e}n\'{y}}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=e09f38e6e18951b0e05c36eb02c150c3}{Elbassioni}{E\bibinitperiod}{Khaled}{K\bibinitperiod}{}{}{}{}}%
        {{hash=8bffad04c63899a452b374cfd83dc279}{Makino}{M\bibinitperiod}{Kazuhisa}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin, Heidelberg}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{ee66c69a0593da1c767f6dcce0e9eeb6}
      \strng{fullhash}{ee66c69a0593da1c767f6dcce0e9eeb6}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}
      \field{isbn}{978-3-662-48971-0}
      \field{title}{On Hardness of the Joint Crossing Number}
      \field{year}{2015}
      \field{pages}{603\bibrangedash 613}
      \range{pages}{11}
      \verb{doi}
      \verb 10.1007/978-3-662-48971-0_51
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-662-48971-0_51
      \endverb
    \endentry
    \entry{HT18}{article}{}
      \name{author}{2}{}{%
        {{hash=c4ffb32948da81571dcb1d9f582c32fa}{Hlin\v{e}n\'{y}}{H\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ba2c7caca783741a8fc47032a63b8c75}
      \strng{fullhash}{ba2c7caca783741a8fc47032a63b8c75}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{3}
      \field{title}{Deciding parity of graph crossing number}
      \field{volume}{32}
      \field{year}{2018}
      \field{pages}{1962\bibrangedash 1965}
      \range{pages}{4}
      \verb{doi}
      \verb 10.1137/17M1137231
      \endverb
      \verb{url}
      \verb https://doi.org/10.1137/17M1137231
      \endverb
    \endentry
    \entry{H07}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1234-3099}
      \field{journaltitle}{Discuss. Math. Graph Theory}
      \field{number}{3}
      \field{title}{A proof of the crossing number of {$K_{3,n}$} in a surface}
      \field{volume}{27}
      \field{year}{2007}
      \field{pages}{549\bibrangedash 551}
      \range{pages}{3}
      \verb{doi}
      \verb 10.7151/dmgt.1379
      \endverb
      \verb{url}
      \verb https://doi.org/10.7151/dmgt.1379
      \endverb
    \endentry
    \entry{H09b}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0315-3681}
      \field{journaltitle}{Util. Math.}
      \field{title}{On the crossing number of some complete multipartite graphs}
      \field{volume}{79}
      \field{year}{2009}
      \field{pages}{125\bibrangedash 143}
      \range{pages}{19}
    \endentry
    \entry{H08c}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{0708.3654} (last accessed 4/27/2021)}
      \field{title}{Proof of Lemma 6.3 in ``The crossing number of ${K}_{4,n}$ on the torus and the {K}lein bottle"}
      \field{year}{2008}
      \verb{eprint}
      \verb 0708.3654
      \endverb
    \endentry
    \entry{H04}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1311-8080}
      \field{journaltitle}{Int. J. Pure Appl. Math.}
      \field{number}{4}
      \field{title}{The crossing number of {$K_{1,5,n},\ K_{2,4,n}$} and {$K_{3,3,n}$}}
      \field{volume}{17}
      \field{year}{2004}
      \field{pages}{491\bibrangedash 515}
      \range{pages}{25}
    \endentry
    \entry{H08}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{24}
      \field{title}{The crossing number of {$K_{1,m,n}$}}
      \field{volume}{308}
      \field{year}{2008}
      \field{pages}{5996\bibrangedash 6002}
      \range{pages}{7}
    \endentry
    \entry{H08b}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0972-0960}
      \field{journaltitle}{Far East J. Appl. Math.}
      \field{number}{1}
      \field{title}{The crossing number of {$K_{2,2,2,n}$}}
      \field{volume}{30}
      \field{year}{2008}
      \field{pages}{43\bibrangedash 69}
      \range{pages}{27}
    \endentry
    \entry{H13}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0381-7032}
      \field{journaltitle}{Ars Combin.}
      \field{title}{The crossing number of {$K_{2,4,n}$}}
      \field{volume}{109}
      \field{year}{2013}
      \field{pages}{527\bibrangedash 537}
      \range{pages}{11}
    \endentry
    \entry{H05}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{1-3}
      \field{title}{The crossing number of {$K_{4,n}$} on the real projective plane}
      \field{volume}{304}
      \field{year}{2005}
      \field{pages}{23\bibrangedash 33}
      \range{pages}{11}
    \endentry
    \entry{H12b}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1234-3099}
      \field{journaltitle}{Discuss. Math. Graph Theory}
      \field{number}{1}
      \field{title}{The projective plane crossing number of the circulant graph {$C(3k;\{1,k\})$}}
      \field{volume}{32}
      \field{year}{2012}
      \field{pages}{91\bibrangedash 108}
      \range{pages}{18}
      \verb{doi}
      \verb 10.7151/dmgt.1588
      \endverb
      \verb{url}
      \verb https://doi.org/10.7151/dmgt.1588
      \endverb
    \endentry
    \entry{H09}{article}{}
      \name{author}{1}{}{%
        {{hash=c4dac918fe4089736841da27f20d6b5a}{Ho}{H\bibinitperiod}{Pak\bibnamedelima Tung}{P\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4dac918fe4089736841da27f20d6b5a}
      \strng{fullhash}{c4dac918fe4089736841da27f20d6b5a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{10}
      \field{title}{The toroidal crossing number of {$K_{4,n}$}}
      \field{volume}{309}
      \field{year}{2009}
      \field{pages}{3238\bibrangedash 3248}
      \range{pages}{11}
    \endentry
    \entry{H96}{book}{}
      \name{editor}{1}{}{%
        {{hash=b21b09620217ca2c2994ab1d8ef9976b}{Hochbaum}{H\bibinitperiod}{Dorit\bibnamedelima S.}{D\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {PWS Publishing Company, Boston, MA}%
      }
      \strng{namehash}{b21b09620217ca2c2994ab1d8ef9976b}
      \strng{fullhash}{b21b09620217ca2c2994ab1d8ef9976b}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{title}{Approximation Algorithms for {NP}-Hard Problems}
      \field{year}{1996}
    \endentry
    \entry{HLRT20}{article}{}
      \name{author}{4}{}{%
        {{hash=4539d354ecc875071164ba52f1c44812}{Hoffmann}{H\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=5b3919e3be82c4b215fecbced84d1c59}{Liu}{L\bibinitperiod}{Chih-Hung}{C\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=73386e0fd34cdbb197a0facc2844a680}{Reddy}{R\bibinitperiod}{Meghana\bibnamedelima M.}{M\bibinitperiod}{}{}{}{}}%
        {{hash=aae880d79266219814a56d27fd81777c}{T\'{o}th}{T\bibinitperiod}{Csaba\bibnamedelima D.}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{608c307fffa564a8f85afb5b2aeb3c1e}
      \strng{fullhash}{6fc047fac43b0f643eeb7ca84a91179d}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.CG}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2008.10794} (last accessed 1/7/2021)}
      \field{title}{Simple Topological Drawings of $k$-Planar Graphs}
      \field{year}{2020}
      \verb{eprint}
      \verb 2008.10794
      \endverb
    \endentry
    \entry{H06b}{article}{}
      \name{author}{1}{}{%
        {{hash=09571564160e4fcc56424f2c9174ee8a}{Holten}{H\bibinitperiod}{Danny}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{09571564160e4fcc56424f2c9174ee8a}
      \strng{fullhash}{09571564160e4fcc56424f2c9174ee8a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{{IEEE} Trans. Vis. Comput. Graph.}
      \field{number}{5}
      \field{title}{Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data}
      \field{volume}{12}
      \field{year}{2006}
      \field{pages}{741\bibrangedash 748}
      \range{pages}{8}
      \verb{doi}
      \verb 10.1109/TVCG.2006.147
      \endverb
      \verb{url}
      \verb https://doi.org/10.1109/TVCG.2006.147
      \endverb
    \endentry
    \entry{HELP12}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=676ef5421be688ce4ad0d882ca494f19}{Liotta}{L\bibinitperiod}{Giuseppe}{G\bibinitperiod}{}{}{}{}}%
        {{hash=7ba387557b1fb319cd41fd0041aed07c}{Poon}{P\bibinitperiod}{Sheung-Hung}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=1b62594ac20a1dc7b061e15af1caa07d}{Gudmundsson}{G\bibinitperiod}{Joachim}{J\bibinitperiod}{}{}{}{}}%
        {{hash=4d60a0385e86188066e4cc1f0e759ae7}{Mestre}{M\bibinitperiod}{Juli\'{a}n}{J\bibinitperiod}{}{}{}{}}%
        {{hash=ec6556a995dc17fa8ff2c7e65ed29648}{Viglas}{V\bibinitperiod}{Taso}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{7e0d830c3869b414615942228cee40ff}
      \strng{fullhash}{317cb7aba089700f5bfacd2038c7de9a}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and Combinatorics - 18th Annual International Conference, {COCOON} 2012}
      \field{isbn}{978-3-642-32240-2}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{{F}\'{a}ry's Theorem for 1-Planar Graphs}
      \field{volume}{7434}
      \field{year}{2012}
      \field{pages}{335\bibrangedash 346}
      \range{pages}{12}
    \endentry
    \entry{HT20}{book}{}
      \name{editor}{2}{}{%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=8aed1cc6b0b0ce2b066b96026ba31a39}{Tokuyama}{T\bibinitperiod}{Takeshi}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{25d91cdfd12be3afad0a7416238dfb7c}
      \strng{fullhash}{25d91cdfd12be3afad0a7416238dfb7c}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{isbn}{978-981-15-6532-8}
      \field{title}{Beyond Planar Graphs, Communications of {NII} Shonan Meetings}
      \field{year}{2020}
      \field{pages}{vii+270}
      \range{pages}{-1}
      \verb{doi}
      \verb 10.1007/978-981-15-6533-5
      \endverb
    \endentry
    \entry{H12}{thesis}{}
      \name{author}{1}{}{%
        {{hash=578e7f46d610eff20455ea3e8194ae11}{Hoske}{H\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Karlsruhe Institute of Technology}%
      }
      \list{location}{1}{%
        {Karlsruhe, Germany}%
      }
      \strng{namehash}{578e7f46d610eff20455ea3e8194ae11}
      \strng{fullhash}{578e7f46d610eff20455ea3e8194ae11}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Book Embedding with Fixed Page Assignments}
      \field{type}{Bachelor thesis}
      \field{year}{2012}
    \endentry
    \entry{H74}{book}{}
      \name{author}{1}{}{%
        {{hash=bbc86d8ae54f3f8127ad849c88249dd2}{Hotz}{H\bibinitperiod}{G\"{u}nter}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Walter de Gruyter, Berlin-New York}%
      }
      \strng{namehash}{bbc86d8ae54f3f8127ad849c88249dd2}
      \strng{fullhash}{bbc86d8ae54f3f8127ad849c88249dd2}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Schaltkreistheorie}
      \field{year}{1974}
      \field{pages}{336}
      \range{pages}{1}
    \endentry
    \entry{HHL12}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=a33b761aeae34c1741d6a93f3d53fc95}{Huang}{H\bibinitperiod}{Maolin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=44fb374c447d3b13b4f4b4f78187a583}{Huang}{H\bibinitperiod}{Weidong}{W\bibinitperiod}{}{}{}{}}%
        {{hash=68321b5daf926440c1173281b017d2c2}{Lin}{L\bibinitperiod}{Chun-Cheng}{C\bibinithyphendelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{991bddbb2e099b31bc80c3580dcdc4d9}
      \strng{fullhash}{991bddbb2e099b31bc80c3580dcdc4d9}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{27th ACM Symposium on Applied Computing}
      \field{title}{Evaluating Force-Directed Algorithms with a New Framework}
      \field{year}{2012}
    \endentry
    \entry{H08a}{article}{}
      \name{author}{1}{}{%
        {{hash=44fb374c447d3b13b4f4b4f78187a583}{Huang}{H\bibinitperiod}{Weidong}{W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{44fb374c447d3b13b4f4b4f78187a583}
      \strng{fullhash}{44fb374c447d3b13b4f4b4f78187a583}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{CoRR}
      \field{note}{\arxiv{0810.4431} (last accessed 9/21/2017)}
      \field{title}{An Eye Tracking Study into the Effects of Graph Layout}
      \field{volume}{abs/0810.4431}
      \field{year}{2008}
    \endentry
    \entry{HEHL12}{article}{}
      \name{author}{4}{}{%
        {{hash=44fb374c447d3b13b4f4b4f78187a583}{Huang}{H\bibinitperiod}{Weidong}{W\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=68321b5daf926440c1173281b017d2c2}{Lin}{L\bibinitperiod}{Chun-Cheng}{C\bibinithyphendelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cddcb33df010907efac717b8b62fb3e2}
      \strng{fullhash}{1df8e6dc9fe30eea6191561be61722ee}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1045-926X}
      \field{journaltitle}{Journal of Visual Languages \&\ Computing}
      \field{title}{Improving multiple aesthetics produces better graph drawings}
      \field{year}{2012}
    \endentry
    \entry{HZ08}{article}{}
      \name{author}{2}{}{%
        {{hash=6953501caf2d023feb90effb0c81385d}{Huang}{H\bibinitperiod}{Yuanqiu}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=471973d1eb4279d59b1f33a9f6ed4417}{Zhao}{Z\bibinitperiod}{Tinglei}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{813c6cb29abfee06c88572100c302675}
      \strng{fullhash}{813c6cb29abfee06c88572100c302675}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{9}
      \field{title}{The crossing number of {$K_{1,4,n}$}}
      \field{volume}{308}
      \field{year}{2008}
      \field{pages}{1634\bibrangedash 1638}
      \range{pages}{5}
    \endentry
    \entry{HHE08}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=3650ba2cf8e6a1da50568e4565ddbc96}{Huanh}{H\bibinitperiod}{Weidong}{W\bibinitperiod}{}{}{}{}}%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=6f9fc7d6b43160fc2f897e46a0e2efab}{Eaders}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE}%
      }
      \strng{namehash}{011cae0f13c22584809e8317f2ec4b57}
      \strng{fullhash}{011cae0f13c22584809e8317f2ec4b57}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{PacificVis}
      \field{title}{Effects of Crossing Angles}
      \field{year}{2008}
      \field{pages}{41\bibrangedash 46}
      \range{pages}{6}
    \endentry
    \entry{HKdMT17}{article}{}
      \name{author}{4}{}{%
        {{hash=4eddcd087a3c310242ffbcd434e26ba2}{Hubard}{H\bibinitperiod}{Alfredo}{A\bibinitperiod}{}{}{}{}}%
        {{hash=d6410714d90ef9aa87c8214a5379095b}{Kalu\v{z}a}{K\bibinitperiod}{Vojt\v{e}ch}{V\bibinitperiod}{}{}{}{}}%
        {{hash=aabcc647fecf0f26ec45479fd33d6d16}{Mesmay}{M\bibinitperiod}{Arnaud}{A\bibinitperiod}{de}{d\bibinitperiod}{}{}}%
        {{hash=79b57f4a75d12e69eecc3774ba8698ae}{Tancer}{T\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f3b6275733f88010acfa4c7dded0b612}
      \strng{fullhash}{41306c45f57d73d578b8d8ccf22c8a67}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{Shortest path embeddings of graphs on surfaces}
      \field{volume}{58}
      \field{year}{2017}
      \field{pages}{921\bibrangedash 945}
      \range{pages}{25}
      \verb{doi}
      \verb 10.1007/s00454-017-9898-3
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00454-017-9898-3
      \endverb
    \endentry
    \entry{HPSS07}{article}{}
      \name{author}{4}{}{%
        {{hash=c27a3fe84dc0f2bddedff578a8f3cee5}{Hui}{H\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d205feea4e8766053d95ef9b96b5e1d9}
      \strng{fullhash}{c88a5febc8bb6628eb19491f0cf73dcd}
      \field{sortinit}{H}
      \field{sortinithash}{82012198d5dfa657b8c4a168793268a6}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Algorithmica}
      \field{number}{4}
      \field{title}{Train Tracks and Confluent Drawings}
      \field{volume}{47}
      \field{year}{2007}
      \field{pages}{465\bibrangedash 479}
      \range{pages}{15}
    \endentry
    \entry{A110507}{misc}{}
      \name{author}{1}{}{%
        {{hash=49a1b075b3808e49b1e2400cfe42ada9}{Inc.}{I\bibinitperiod}{The\bibnamedelimb OEIS\bibnamedelima Foundation}{T\bibinitperiod\bibinitdelim O\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{49a1b075b3808e49b1e2400cfe42ada9}
      \strng{fullhash}{49a1b075b3808e49b1e2400cfe42ada9}
      \field{sortinit}{I}
      \field{sortinithash}{25e99d37ba90f7c4fb20baf4e310faf3}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{\url{https://oeis.org/A110507} (last accessed 5/3/2021)}
      \field{title}{The on-line encyclopedia of integer sequences}
      \field{year}{2021}
    \endentry
    \entry{A307182}{misc}{}
      \name{author}{1}{}{%
        {{hash=49a1b075b3808e49b1e2400cfe42ada9}{Inc.}{I\bibinitperiod}{The\bibnamedelimb OEIS\bibnamedelima Foundation}{T\bibinitperiod\bibinitdelim O\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{49a1b075b3808e49b1e2400cfe42ada9}
      \strng{fullhash}{49a1b075b3808e49b1e2400cfe42ada9}
      \field{sortinit}{I}
      \field{sortinithash}{25e99d37ba90f7c4fb20baf4e310faf3}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{\url{https://oeis.org/A307182} (last accessed 5/3/2021)}
      \field{title}{The on-line encyclopedia of integer sequences}
      \field{year}{2021}
    \endentry
    \entry{I08}{misc}{}
      \name{author}{1}{}{%
        {{hash=7f7db8e980630cad33546d742e321c83}{Ishiguro}{I\bibinitperiod}{Kazumasa}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Yokohama National University, Japan}%
      }
      \strng{namehash}{7f7db8e980630cad33546d742e321c83}
      \strng{fullhash}{7f7db8e980630cad33546d742e321c83}
      \field{sortinit}{I}
      \field{sortinithash}{25e99d37ba90f7c4fb20baf4e310faf3}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{Talk at $20$th Workshop on Topological Graph Theory, Yokohama National University, Japan}
      \field{title}{The minimum non-crossing edge number of graphs}
      \field{year}{2008}
      \verb{url}
      \verb http://www.ngm.ed.ynu.ac.jp/negami/tgt/tgt20/abstract/ishiguro_tgt20.pdf
      \endverb
    \endentry
    \entry{PSS05a}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=f4a2f5500ebdc652aa60d37ac8e53653}{J.\bibnamedelimi Pelsmajer}{P\bibinitperiod}{Michael}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=1ec78ded1656441459b1960fbc1e7d68}{Felsner}{F\bibinitperiod}{Stefan}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{2}{%
        {Discrete Mathematics}%
        {Theoretical Computer Science}%
      }
      \strng{namehash}{b9580ba2187d3e96745c44df09299e21}
      \strng{fullhash}{b9580ba2187d3e96745c44df09299e21}
      \field{sortinit}{J}
      \field{sortinithash}{ec3950a647c092421b9fcca6d819504a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)}
      \field{month}{04}
      \field{series}{DMTCS Proceedings}
      \field{title}{Removing Even Crossings}
      \field{volume}{AE}
      \field{year}{2005}
      \field{pages}{105\bibrangedash 109}
      \range{pages}{5}
    \endentry
    \entry{JR84}{incollection}{}
      \name{author}{2}{}{%
        {{hash=acf11edb9377a8ab0158b9dbbd081d58}{Jackson}{J\bibinitperiod}{Brad}{B\bibinitperiod}{}{}{}{}}%
        {{hash=473e5de0e84ed4336dfbc8b5ece88190}{Ringel}{R\bibinitperiod}{Gerhard}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{947ed8f780fb2144bed474ae7a4d3663}
      \strng{fullhash}{947ed8f780fb2144bed474ae7a4d3663}
      \field{sortinit}{J}
      \field{sortinithash}{ec3950a647c092421b9fcca6d819504a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Selected topics in operations research and mathematical economics ({K}arlsruhe, 1983)}
      \field{series}{Lecture Notes in Econom. and Math. Systems}
      \field{title}{Plane constructions for graphs, networks, and maps: measurements of planarity}
      \field{volume}{226}
      \field{year}{1984}
      \field{pages}{315\bibrangedash 324}
      \range{pages}{10}
      \verb{doi}
      \verb 10.1007/978-3-642-45567-4_24
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/978-3-642-45567-4_24
      \endverb
    \endentry
    \entry{JKR13}{article}{}
      \name{author}{3}{}{%
        {{hash=3129a0271b78d8633893f78a1e98122b}{Jel\'{\i{}}nek}{J\bibinitperiod}{V\'{\i{}}t}{V\bibinitperiod}{}{}{}{}}%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
        {{hash=33140dd44f57dc4a8e11a32a9a9a9f1d}{Rutter}{R\bibinitperiod}{Ignaz}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{9ff6f6a5444f66a5dc71c8c3c47ff050}
      \strng{fullhash}{9ff6f6a5444f66a5dc71c8c3c47ff050}
      \field{sortinit}{J}
      \field{sortinithash}{ec3950a647c092421b9fcca6d819504a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{number}{4}
      \field{title}{A {K}uratowski-type theorem for planarity of partially embedded graphs}
      \field{volume}{46}
      \field{year}{2013}
      \field{pages}{466\bibrangedash 492}
      \range{pages}{27}
    \endentry
    \entry{J71}{article}{}
      \name{author}{1}{}{%
        {{hash=05f0bb5066929922ea5a4ac2955e56a2}{Jensen}{J\bibinitperiod}{H.\bibnamedelimi F.}{H\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{05f0bb5066929922ea5a4ac2955e56a2}
      \strng{fullhash}{05f0bb5066929922ea5a4ac2955e56a2}
      \field{sortinit}{J}
      \field{sortinithash}{ec3950a647c092421b9fcca6d819504a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory Ser. B}
      \field{title}{An upper bound for the rectilinear crossing number of the complete graph}
      \field{volume}{10}
      \field{year}{1971}
      \field{pages}{212\bibrangedash 216}
      \range{pages}{5}
    \endentry
    \entry{JS03}{article}{}
      \name{author}{2}{}{%
        {{hash=c48024038f39c36ca798e145bff67cbc}{Juarez}{J\bibinitperiod}{Hector\bibnamedelima A.}{H\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4798377d5bd80eae0e865de33bdcecb8}
      \strng{fullhash}{4798377d5bd80eae0e865de33bdcecb8}
      \field{sortinit}{J}
      \field{sortinithash}{ec3950a647c092421b9fcca6d819504a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{1}
      \field{title}{Optimal meshes of curves in the {K}lein bottle}
      \field{volume}{88}
      \field{year}{2003}
      \field{pages}{185\bibrangedash 188}
      \range{pages}{4}
    \endentry
    \entry{K14}{misc}{}
      \name{author}{1}{}{%
        {{hash=7c34bc0969aa5e196e30144ed086f312}{Kainen}{K\bibinitperiod}{Paul}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7c34bc0969aa5e196e30144ed086f312}
      \strng{fullhash}{7c34bc0969aa5e196e30144ed086f312}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{howpublished}{Personal communication}
      \field{month}{08}
      \field{year}{2014}
    \endentry
    \entry{K72}{article}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory Ser. B}
      \field{title}{A lower bound for crossing numbers of graphs with applications to {$K_{n}$}, {$K_{p,\,q}$}, and {$Q(d)$}}
      \field{volume}{12}
      \field{year}{1972}
      \field{pages}{287\bibrangedash 298}
      \range{pages}{12}
    \endentry
    \entry{K68}{article}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory}
      \field{title}{On a problem of {P}. {E}rd\H{o}s}
      \field{volume}{5}
      \field{year}{1968}
      \field{pages}{374\bibrangedash 377}
      \range{pages}{4}
    \endentry
    \entry{K72b}{article}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0002-9939}
      \field{journaltitle}{Proc. Amer. Math. Soc.}
      \field{title}{On the stable crossing number of cubes}
      \field{volume}{36}
      \field{year}{1972}
      \field{pages}{55\bibrangedash 62}
      \range{pages}{8}
    \endentry
    \entry{K11}{article}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{Outerplanar crossing numbers of planar graphs}
      \field{volume}{61}
      \field{year}{2011}
      \field{pages}{69\bibrangedash 76}
      \range{pages}{8}
    \endentry
    \entry{K74}{incollection}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graphs and combinatorics ({P}roc. {C}apital {C}onf., {G}eorge {W}ashington {U}niv., {W}ashington, {D}.{C}., 1973)}
      \field{title}{Some recent results in topological graph theory}
      \field{year}{1974}
      \field{pages}{76\bibrangedash 108. Lecture Notes in Math.\bibrangessep Vol. 406}
      \range{pages}{-1}
    \endentry
    \entry{K90}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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)}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{title}{The book thickness of a graph. {II}}
      \field{volume}{71}
      \field{year}{1990}
      \field{pages}{127\bibrangedash 132}
      \range{pages}{6}
    \endentry
    \entry{K73}{article}{}
      \name{author}{1}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{eb146c02ab278b0202ed9df0ca7e336e}
      \strng{fullhash}{eb146c02ab278b0202ed9df0ca7e336e}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5858}
      \field{journaltitle}{Abh. Math. Sem. Univ. Hamburg}
      \field{title}{Thickness and coarseness of graphs}
      \field{volume}{39}
      \field{year}{1973}
      \field{pages}{88\bibrangedash 95}
      \range{pages}{8}
    \endentry
    \entry{KW78}{article}{}
      \name{author}{2}{}{%
        {{hash=eb146c02ab278b0202ed9df0ca7e336e}{Kainen}{K\bibinitperiod}{Paul\bibnamedelima C.}{P\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
        {{hash=c4e8c844afc44df0000626e282fecb97}{White}{W\bibinitperiod}{Arthur\bibnamedelima T.}{A\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7a924b1542dfc8acfebeb279999bc2db}
      \strng{fullhash}{7a924b1542dfc8acfebeb279999bc2db}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{On stable crossing numbers}
      \field{volume}{2}
      \field{year}{1978}
      \field{pages}{181\bibrangedash 187}
      \range{pages}{7}
    \endentry
    \entry{KT?}{inbook}{}
      \name{author}{2}{}{%
        {{hash=c80bfa7dc7962dcd36f3f29aad72d9d1}{Kakoulis}{K\bibinitperiod}{Konstantinos\bibnamedelima G.}{K\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
        {{hash=47522b07e88f2e0da39c67bb0caecd7a}{Tollis}{T\bibinitperiod}{Ioannis\bibnamedelima G.}{I\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=73002fbcaa8fe0ee76011401f23f2ab3}{Tamassia}{T\bibinitperiod}{Roberto}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{2}{%
        {Chapman}%
        {Hall/CRC}%
      }
      \strng{namehash}{33a0ead63a2e300263cea3fa1aaef82f}
      \strng{fullhash}{33a0ead63a2e300263cea3fa1aaef82f}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Handbook of Graph Drawing and Visualization}
      \field{chapter}{15}
      \strng{crossref}{T13?}
      \field{isbn}{1584884126}
      \field{series}{Discrete Mathematics and Its Applications}
      \field{title}{Labeling algorithms}
      \field{year}{2013}
      \field{pages}{489\bibrangedash 516}
      \range{pages}{28}
    \endentry
    \entry{KPRSV08}{article}{}
      \name{author}{5}{}{%
        {{hash=7a905d2a19d3cb086eec7561d831b855}{Kang}{K\bibinitperiod}{Mihyun}{M\bibinitperiod}{}{}{}{}}%
        {{hash=0e970127faa8fed17ea3f3e29422cca5}{Pikhurko}{P\bibinitperiod}{Oleg}{O\bibinitperiod}{}{}{}{}}%
        {{hash=6cfd3ef20a39fe6450f0ff1caa0576dc}{Ravsky}{R\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
        {{hash=553148db10e19977578ada027e8bc309}{Schacht}{S\bibinitperiod}{Mathias}{M\bibinitperiod}{}{}{}{}}%
        {{hash=59409d116263bbaedf1a269da9202c62}{Verbitsky}{V\bibinitperiod}{Oleg}{O\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{53c08be683c0de0ede411f8931dd5a49}
      \strng{fullhash}{042f8da827a9ab65c9404c33c1941868}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{CoRR}
      \field{note}{\arxiv{0803.0858}, see version 3 (last accessed 9/21/2017)}
      \field{title}{Obfuscated Drawings of Planar Graphs}
      \field{volume}{abs/0803.0858}
      \field{year}{2008}
    \endentry
    \entry{KGB97}{report}{}
      \name{author}{3}{}{%
        {{hash=a947247064a4083535403b64558e35d7}{Kapur}{K\bibinitperiod}{N.}{N\bibinitperiod}{}{}{}{}}%
        {{hash=633fd469b294c3326f68e4035c3156bd}{Ghosh}{G\bibinitperiod}{D.}{D\bibinitperiod}{}{}{}{}}%
        {{hash=9d014b5d7ae8e1bca28a0c83d03b8275}{Brglez}{B\bibinitperiod}{F.}{F\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {CBL, North Carolina State University}%
      }
      \strng{namehash}{ae50abedc4d6258fa6f5894a231345cd}
      \strng{fullhash}{ae50abedc4d6258fa6f5894a231345cd}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{10}
      \field{number}{1997-TR@CBL-08-Kapur}
      \field{title}{Optimization of Placement Driven by the Cost of Wire Crossing.}
      \field{type}{techreport}
      \field{year}{1997}
    \endentry
    \entry{KPTU18b}{incollection}{}
      \name{author}{4}{}{%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
        {{hash=489c61d4e2b7d5975951963b06d031bd}{Ueckerdt}{U\bibinitperiod}{Torsten}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{9dfe3b90dd5265f82bf5961839eb408c}
      \strng{fullhash}{cac4f7a0267a7a80cc46a0004d239edd}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing and network visualization}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{The number of crossings in multigraphs with no empty lens}
      \field{volume}{11282}
      \field{year}{2018}
      \field{pages}{242\bibrangedash 254}
      \range{pages}{13}
    \endentry
    \entry{KU14}{article}{}
      \name{author}{2}{}{%
        {{hash=9d193ef606aaaf76bdda5c5a747a9f59}{Kaufmann}{K\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=489c61d4e2b7d5975951963b06d031bd}{Ueckerdt}{U\bibinitperiod}{Torsten}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6448dffbedf9cf51cd38b46f43e0634f}
      \strng{fullhash}{6448dffbedf9cf51cd38b46f43e0634f}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{CoRR}
      \field{note}{\arxiv{1403.6184} (last accessed 9/21/2017)}
      \field{title}{The Density of Fan-Planar Graphs}
      \field{volume}{abs/1403.6184}
      \field{year}{2014}
      \verb{url}
      \verb http://arxiv.org/abs/1403.6184
      \endverb
    \endentry
    \entry{KR07}{incollection}{}
      \name{author}{2}{}{%
        {{hash=813f36eed9ff25f176b20508573d6743}{Kawarabayashi}{K\bibinitperiod}{Ken-ichi}{K\bibinithyphendelim i\bibinitperiod}{}{}{}{}}%
        {{hash=d2343b863d6c25d337269b8a576f5cee}{Reed}{R\bibinitperiod}{Bruce}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{d31249a827400dcffea40f12ce624a73}
      \strng{fullhash}{d31249a827400dcffea40f12ce624a73}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{S{TOC}'07---{P}roceedings of the 39th {A}nnual {ACM} {S}ymposium on {T}heory of {C}omputing}
      \field{title}{Computing crossing number in linear time}
      \field{year}{2007}
      \field{pages}{382\bibrangedash 390}
      \range{pages}{9}
    \endentry
    \entry{K1669}{book}{}
      \name{author}{1}{}{%
        {{hash=b2f7c77d68efb3624206eab00d5e1510}{Kircher}{K\bibinitperiod}{Athanasius}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Amsterdam}%
      }
      \list{publisher}{1}{%
        {Janssonium \`{a} Waesberge}%
      }
      \strng{namehash}{b2f7c77d68efb3624206eab00d5e1510}
      \strng{fullhash}{b2f7c77d68efb3624206eab00d5e1510}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Online at \url{https://books.google.com/books?id=Gwynp56UqnEC} (last accessed 5/17/2019)}
      \field{title}{Ars magna sciendi, in {XII} libros digesta}
      \field{year}{1669}
    \endentry
    \entry{KSSH12}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=c5e92375923935c811a3a4261f36a0ee}{Klauske}{K\bibinitperiod}{Lars\bibnamedelima Kristian}{L\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=b80b40dd48760f3386fdca3797452b18}{Schulze}{S\bibinitperiod}{Christoph\bibnamedelima Daniel}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=f2c4b63d0845b24cc8965045b5de8c39}{Sp\"{o}nemann}{S\bibinitperiod}{Miro}{M\bibinitperiod}{}{}{}{}}%
        {{hash=279338b41bd103d790f5a202e2b8b520}{Hanxleden}{H\bibinitperiod}{Reinhard}{R\bibinitperiod}{von}{v\bibinitperiod}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{4a427eeb93425bb152ad45073c78b4dd}
      \strng{fullhash}{f894ed1f704dc1a7f7af45dc7d4d3b01}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 7th International Conference on the Theory and Application of Diagrams (DIAGRAMS'12)}
      \field{series}{LNCS}
      \field{title}{Improved Layout for Data Flow Diagrams with Port Constraints}
      \field{year}{2012}
    \endentry
    \entry{K76}{article}{}
      \name{author}{1}{}{%
        {{hash=c913880393eee7ae5b36b21983268508}{Kleitman}{K\bibinitperiod}{Daniel\bibnamedelima J.}{D\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c913880393eee7ae5b36b21983268508}
      \strng{fullhash}{c913880393eee7ae5b36b21983268508}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory Ser. B}
      \field{number}{1}
      \field{title}{A note on the parity of the number of crossings of a graph}
      \field{volume}{21}
      \field{year}{1976}
      \field{pages}{88\bibrangedash 89}
      \range{pages}{2}
    \endentry
    \entry{K70}{article}{}
      \name{author}{1}{}{%
        {{hash=c913880393eee7ae5b36b21983268508}{Kleitman}{K\bibinitperiod}{Daniel\bibnamedelima J.}{D\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c913880393eee7ae5b36b21983268508}
      \strng{fullhash}{c913880393eee7ae5b36b21983268508}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory}
      \field{title}{The crossing number of {$K_{5,n}$}}
      \field{volume}{9}
      \field{year}{1970}
      \field{pages}{315\bibrangedash 323}
      \range{pages}{9}
    \endentry
    \entry{dKPS14}{article}{}
      \name{author}{3}{}{%
        {{hash=9f1777bcb02d9be13c885dca152c78ed}{Klerk}{K\bibinitperiod}{Etienne}{E\bibinitperiod}{de}{d\bibinitperiod}{}{}}%
        {{hash=419b4355eea46fc5bf1331034c651cfb}{Pasechnik}{P\bibinitperiod}{Dmitrii\bibnamedelima V.}{D\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6809951113d8db69e29c0c8055f3d863}
      \strng{fullhash}{6809951113d8db69e29c0c8055f3d863}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{title}{Book drawings of complete bipartite graphs}
      \field{volume}{167}
      \field{year}{2014}
      \field{pages}{80\bibrangedash 93}
      \range{pages}{14}
      \verb{doi}
      \verb 10.1016/j.dam.2013.11.001
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1016/j.dam.2013.11.001
      \endverb
    \endentry
    \entry{dKPS07}{article}{}
      \name{author}{3}{}{%
        {{hash=9f1777bcb02d9be13c885dca152c78ed}{Klerk}{K\bibinitperiod}{Etienne}{E\bibinitperiod}{de}{d\bibinitperiod}{}{}}%
        {{hash=419b4355eea46fc5bf1331034c651cfb}{Pasechnik}{P\bibinitperiod}{Dmitrii\bibnamedelima V.}{D\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
        {{hash=25d5b8c6eeb2588f4cd646cfe8d0827b}{Schrijver}{S\bibinitperiod}{Alexander}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d760eefc74844078a076a9d8fee2356d}
      \strng{fullhash}{d760eefc74844078a076a9d8fee2356d}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Math. Program}
      \field{number}{2-3}
      \field{title}{Reduction of symmetric semidefinite programs using the regular *-representation}
      \field{volume}{109}
      \field{year}{2007}
    \endentry
    \entry{KRS96}{article}{}
      \name{author}{3}{}{%
        {{hash=74092b40fd13b074f5761cdf9efd0c43}{Kle\v{s}\v{c}}{K\bibinitperiod}{Mari\'{a}n}{M\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=1a1f6843a9a405087972502371864a37}{Stobert}{S\bibinitperiod}{Ian}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{42050187bb7ad463d4ef261eb7d4f6a4}
      \strng{fullhash}{42050187bb7ad463d4ef261eb7d4f6a4}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{The crossing number of {$C_5\times C_n$}}
      \field{volume}{22}
      \field{year}{1996}
      \field{pages}{239\bibrangedash 243}
      \range{pages}{5}
    \endentry
    \entry{K1889}{book}{}
      \name{author}{2}{}{%
        {{hash=fc7d0f844d206b4a0c891ade055062a9}{Kleyer}{K\bibinitperiod}{A.}{A\bibinitperiod}{}{}{}{}}%
        {{hash=59a36e7d6ebd2c66e0c995279b8ed92d}{Sachs}{S\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {J. Maier}%
      }
      \strng{namehash}{4c8dbfc7619fcca224d85512cf6d3473}
      \strng{fullhash}{4c8dbfc7619fcca224d85512cf6d3473}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Lehrbuch der ebenen {E}lementar-{G}eometrie ({P}lanimetrie)}
      \field{year}{1889}
    \endentry
    \entry{KMNT13}{incollection}{}
      \name{author}{4}{}{%
        {{hash=c6044f3e47db64d46ac123e9bc633652}{Kobayashi}{K\bibinitperiod}{Yasuaki}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=5c2deb29465e5fe019abe2468bcbcbc8}{Maruta}{M\bibinitperiod}{Hirokazu}{H\bibinitperiod}{}{}{}{}}%
        {{hash=2ac445d78bb14ea9fa0199475b583bae}{Nakae}{N\bibinitperiod}{Yusuke}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=223e656edb900c5eb7b877597ae6d3cf}{Tamaki}{T\bibinitperiod}{Hisao}{H\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=fcb129e27cb1af98a46a2eea34dbc582}{Du}{D\bibinitperiod}{Ding-Zhu}{D\bibinithyphendelim Z\bibinitperiod}{}{}{}{}}%
        {{hash=f828289c062fefa98f59f55bda3b499a}{Zhang}{Z\bibinitperiod}{Guochuan}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{c76894d1165efa5b45174bae4013c0da}
      \strng{fullhash}{d9ecd98e9ebbbacb8d4a710b8380c318}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and Combinatorics}
      \field{isbn}{978-3-642-38767-8}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{A Linear Edge Kernel for Two-Layer Crossing Minimization}
      \field{volume}{7936}
      \field{year}{2013}
      \field{pages}{458\bibrangedash 468}
      \range{pages}{11}
    \endentry
    \entry{KT12}{incollection}{}
      \name{author}{2}{}{%
        {{hash=c6044f3e47db64d46ac123e9bc633652}{Kobayashi}{K\bibinitperiod}{Yasuaki}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=223e656edb900c5eb7b877597ae6d3cf}{Tamaki}{T\bibinitperiod}{Hisao}{H\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=f35330bbd53b6cba9055d8fa6a11dd32}{Epstein}{E\bibinitperiod}{Leah}{L\bibinitperiod}{}{}{}{}}%
        {{hash=a56d83e896383417c553388f0e01ad7a}{Ferragina}{F\bibinitperiod}{Paolo}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{c15ec078d39545bee4c64d90d1ff6ef3}
      \strng{fullhash}{c15ec078d39545bee4c64d90d1ff6ef3}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithms - ESA 2012}
      \field{isbn}{978-3-642-33089-6}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization}
      \field{volume}{7501}
      \field{year}{2012}
      \field{pages}{683\bibrangedash 694}
      \range{pages}{12}
    \endentry
    \entry{KM04}{article}{}
      \name{author}{2}{}{%
        {{hash=7be3ce69d394a0a9ab3be2452a5d0409}{Kolman}{K\bibinitperiod}{Petr}{P\bibinitperiod}{}{}{}{}}%
        {{hash=c4b882254f034f1310f48a09f5b283c3}{Matou\v{s}ek}{M\bibinitperiod}{Ji\v{r}\'{\i{}}}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5e35e1a09d301963592d1ff3768474e5}
      \strng{fullhash}{5e35e1a09d301963592d1ff3768474e5}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{1}
      \field{title}{Crossing number, pair-crossing number, and expansion}
      \field{volume}{92}
      \field{year}{2004}
      \field{pages}{99\bibrangedash 113}
      \range{pages}{15}
    \endentry
    \entry{K65}{incollection}{}
      \name{author}{1}{}{%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Plze\v{n}}%
      }
      \list{publisher}{1}{%
        {Samostatn\'{a} pedagogick\'{a} fakulta}%
      }
      \strng{namehash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \strng{fullhash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{V\v{e}deck\'{a} pr\'{a}ce kateder matematiky na Pedagogick\'{y}ch institutech v {\v{C}SSR}}
      \field{title}{0 pr\'{a}ci pra\v{z}sk\'{e}ho semin\'{a}\v{r}e teorie graf\r{u}}
      \field{year}{1965}
      \field{pages}{89\bibrangedash 95}
      \range{pages}{7}
    \endentry
    \entry{K75}{incollection}{}
      \name{author}{1}{}{%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Prague}%
      }
      \list{publisher}{1}{%
        {Academia}%
      }
      \strng{namehash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \strng{fullhash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Recent advances in graph theory ({P}roc. {S}econd {C}zechoslovak {S}ympos., {P}rague, 1974)}
      \field{title}{A note on the crossing number of {$K_{m,n}$} on the {K}lein bottle}
      \field{year}{1975}
      \field{pages}{327\bibrangedash 334}
      \range{pages}{8}
    \endentry
    \entry{K78}{article}{}
      \name{author}{1}{}{%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \strng{fullhash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0008-7394}
      \field{journaltitle}{\v{C}asopis P\v{e}st. Mat.}
      \field{number}{3}
      \field{title}{New upper bounds for the crossing number of {$K_{n}$} on the {K}lein bottle}
      \field{volume}{103}
      \field{year}{1978}
      \field{pages}{282\bibrangedash 288}
      \range{pages}{7}
    \endentry
    \entry{K69}{article}{}
      \name{author}{1}{}{%
        {{hash=c63d90c196deb6a526c14d5cac6d0ee0}{Koman}{K\bibinitperiod}{Milan}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \strng{fullhash}{c63d90c196deb6a526c14d5cac6d0ee0}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Acta Univ. Carolinae--Math. et Phys.}
      \field{number}{nos. 1--2}
      \field{title}{On the crossing numbers of graphs}
      \field{volume}{10}
      \field{year}{1969}
      \field{pages}{9\bibrangedash 46}
      \range{pages}{38}
    \endentry
    \entry{KM13}{article}{}
      \name{author}{2}{}{%
        {{hash=2e2f0682ae8b9719df15eac40b13b76c}{Korzhik}{K\bibinitperiod}{Vladimir\bibnamedelima P.}{V\bibinitperiod\bibinitdelim P\bibinitperiod}{}{}{}{}}%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{40df0803c8a7988e010c664cbbf692b2}
      \strng{fullhash}{40df0803c8a7988e010c664cbbf692b2}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{1}
      \field{title}{Minimal obstructions for 1-immersions and hardness of 1-planarity testing}
      \field{volume}{72}
      \field{year}{2013}
      \field{pages}{30\bibrangedash 71}
      \range{pages}{42}
    \endentry
    \entry{KNPSS15b}{inproceedings}{}
      \name{author}{5}{}{%
        {{hash=c257f046f2088d8ca814283264f0352c}{{Kostitsyna}}{K\bibinitperiod}{Irina}{I\bibinitperiod}{}{}{}{}}%
        {{hash=5b74bae0077b65f428e92cfda7ee88bd}{{N\"{o}llenburg}}{N\bibinitperiod}{Martin}{M\bibinitperiod}{}{}{}{}}%
        {{hash=d37e05e8dc938315ab9fd27c33a3e4e1}{{Polishchuk}}{P\bibinitperiod}{Valentin}{V\bibinitperiod}{}{}{}{}}%
        {{hash=19c782df0237611791eeb184e041e898}{{Schulz}}{S\bibinitperiod}{Andr\'{e}}{A\bibinitperiod}{}{}{}{}}%
        {{hash=855a06bea0b075b7622b995c5dd605c8}{{Strash}}{S\bibinitperiod}{Darren}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{5e41636eabca9171f9e9ab2fb12e1fdc}
      \strng{fullhash}{fa5c0f443ccf709892e904f39176e6ac}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing and network visualization}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{On minimizing crossings in storyline visualizations}
      \field{volume}{9411}
      \field{year}{2015}
      \field{pages}{192\bibrangedash 198}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1007/978-3-319-27261-0_16
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-319-27261-0_16
      \endverb
    \endentry
    \entry{K98}{article}{}
      \name{author}{1}{}{%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ce5e2934322f20135deffba1624816c8}
      \strng{fullhash}{ce5e2934322f20135deffba1624816c8}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0302-9743}
      \field{journaltitle}{Lecture Notes in Computer Science}
      \field{title}{Crossing Number of Abstract Topological Graphs}
      \field{volume}{1547}
      \field{year}{1998}
      \field{pages}{238\bibrangedash 245}
      \range{pages}{8}
    \endentry
    \entry{K91}{article}{}
      \name{author}{1}{}{%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ce5e2934322f20135deffba1624816c8}
      \strng{fullhash}{ce5e2934322f20135deffba1624816c8}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{1}
      \field{title}{String graphs. {I}. {T}he number of critical nonstring graphs is infinite}
      \field{volume}{52}
      \field{year}{1991}
      \field{pages}{53\bibrangedash 66}
      \range{pages}{14}
    \endentry
    \entry{KM91}{article}{}
      \name{author}{2}{}{%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
        {{hash=c4b882254f034f1310f48a09f5b283c3}{Matou\v{s}ek}{M\bibinitperiod}{Ji\v{r}\'{\i{}}}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{26f5db07facbd2a5914a3eb1e2af863b}
      \strng{fullhash}{26f5db07facbd2a5914a3eb1e2af863b}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of Combinatorial Theory, Series B}
      \field{title}{String Graphs Requiring Exponential Representations}
      \field{volume}{53}
      \field{year}{1991}
      \field{pages}{1\bibrangedash 4}
      \range{pages}{4}
    \endentry
    \entry{vK11}{article}{}
      \name{author}{1}{}{%
        {{hash=8c4baed5be5ad26e4041b675c09f241d}{Kreveld}{K\bibinitperiod}{Marc\bibnamedelima van}{M\bibinitperiod\bibinitdelim v\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8c4baed5be5ad26e4041b675c09f241d}
      \strng{fullhash}{8c4baed5be5ad26e4041b675c09f241d}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Computational Geometry}
      \field{number}{9}
      \field{title}{Bold graph drawings}
      \field{volume}{44}
      \field{year}{2011}
      \field{pages}{499\bibrangedash 506}
      \range{pages}{8}
    \endentry
    \entry{KMBW01}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=f7b08804600c7b59a5f2f8fae8d59a25}{Kruja}{K\bibinitperiod}{Eriola}{E\bibinitperiod}{}{}{}{}}%
        {{hash=fb2ffc4da288516b7fe44fca4e2ed087}{Marks}{M\bibinitperiod}{Joe}{J\bibinitperiod}{}{}{}{}}%
        {{hash=9f1687991bc5daa33277f9f64326b015}{Blair}{B\bibinitperiod}{Ann}{A\bibinitperiod}{}{}{}{}}%
        {{hash=28e16808c5cab8dc495a68ce3f894bea}{Waters}{W\bibinitperiod}{Richard\bibnamedelima C.}{R\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=01169310249847156f664ba0d45a28d2}{J\"{u}nger}{J\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=307f75ebf0268c21554f4c6cf838f86c}{Leipert}{L\bibinitperiod}{Sebastian}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{4792440b6c3c21cb00209e1a2143a9a6}
      \strng{fullhash}{cf0e6ef192053ce365e8db198d101379}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{3-540-43309-0}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{A Short Note on the History of Graph Drawing}
      \field{volume}{2265}
      \field{year}{2001}
      \field{pages}{272\bibrangedash 286}
      \range{pages}{15}
    \endentry
    \entry{K20}{misc}{}
      \name{author}{1}{}{%
        {{hash=a75a390f3f6c6031d160b3305f47e37a}{{Kyn\v{c}l}}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a75a390f3f6c6031d160b3305f47e37a}
      \strng{fullhash}{a75a390f3f6c6031d160b3305f47e37a}
      \field{sortinit}{K}
      \field{sortinithash}{a7d5b3aec5a0890aae7baf85a209abfc}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{https://mathoverflow.net/questions/366765/issue-update-in-graph-theory-different-definitions-of-edge-crossing-numbers} (last accessed 8/6/2020)}
      \field{title}{Reply to ``Issue UPDATE: in graph theory, different definitions of edge crossing numbers - impact on applications?''}
      \field{year}{2020}
    \endentry
    \entry{LE02}{article}{}
      \name{author}{2}{}{%
        {{hash=f3c3f09b14622b3a98bcc5318fc5aba3}{Lai}{L\bibinitperiod}{Wei}{W\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d6e66f870e768573c1c30717151217d2}
      \strng{fullhash}{d6e66f870e768573c1c30717151217d2}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0020-0190}
      \field{journaltitle}{Inform. Process. Lett.}
      \field{number}{2}
      \field{title}{Removing edge-node intersections in drawings of graphs}
      \field{volume}{81}
      \field{year}{2002}
      \field{pages}{105\bibrangedash 110}
      \range{pages}{6}
    \endentry
    \entry{L09}{thesis}{}
      \name{author}{1}{}{%
        {{hash=e1e1dfd5594a8e2ed274b7e3fc41afdc}{Lambert}{L\bibinitperiod}{Joshua\bibnamedelima K.}{J\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {North Dakota State University}%
      }
      \list{publisher}{1}{%
        {ProQuest LLC, Ann Arbor, MI}%
      }
      \strng{namehash}{e1e1dfd5594a8e2ed274b7e3fc41afdc}
      \strng{fullhash}{e1e1dfd5594a8e2ed274b7e3fc41afdc}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{978-1109-16712-2}
      \field{title}{Determining the biplanar crossing number of {$C_{K} \times C_{L} \times C_{M} \times C_{N}$}}
      \field{type}{phdthesis}
      \field{year}{2009}
      \field{pages}{71}
      \range{pages}{1}
    \endentry
    \entry{LRMZ15}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=75a7d5c90f665490ddaec7484fe40032}{Lara}{L\bibinitperiod}{D.}{D\bibinitperiod}{}{}{}{}}%
        {{hash=0722a99631a0219fb6f353cd808f7b46}{Rubio-Montiel}{R\bibinithyphendelim M\bibinitperiod}{C.}{C\bibinitperiod}{}{}{}{}}%
        {{hash=b99d8c08cb4726823354a9cfafb4223d}{Zaragoza}{Z\bibinitperiod}{F.}{F\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=98d1680e3afd9eea7fe3425afb199135}{Ramos}{R\bibinitperiod}{Pedro}{P\bibinitperiod}{}{}{}{}}%
        {{hash=3b2ff6170d865a273b29bd43a8bc3004}{Silveira}{S\bibinitperiod}{Rodrigo\bibnamedelima I.}{R\bibinitperiod\bibinitdelim I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{84977ff300d5f2cd1d8659415509c6d0}
      \strng{fullhash}{84977ff300d5f2cd1d8659415509c6d0}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Abstracts XVI Spanish Meeting on Computational Geometry}
      \field{title}{Grundy and pseudo-Grundy indices for complete geometric graphs}
      \field{year}{2015}
      \field{pages}{73\bibrangedash 76}
      \range{pages}{4}
      \verb{url}
      \verb http://www-ma2.upc.es/egc15/wp-content/uploads/2013/10/AbstractsXVIEGC.pdf
      \endverb
    \endentry
    \entry{L00}{article}{}
      \name{author}{1}{}{%
        {{hash=7d004eb48a1083fb61e8763eb5fa3ba7}{Lawrence}{L\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7d004eb48a1083fb61e8763eb5fa3ba7}
      \strng{fullhash}{7d004eb48a1083fb61e8763eb5fa3ba7}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{2-3}
      \field{subtitle}{The Branko Gr\"{u}nbaum birthday issue}
      \field{title}{Mutation polynomials and oriented matroids}
      \field{volume}{24}
      \field{year}{2000}
      \field{pages}{365\bibrangedash 389}
      \range{pages}{25}
    \endentry
    \entry{LLRIRM14}{article}{}
      \name{author}{4}{}{%
        {{hash=bd890a8f73b9a5c017b00099304025a1}{Lea\~{n}os}{L\bibinitperiod}{Jes\'{u}s}{J\bibinitperiod}{}{}{}{}}%
        {{hash=9649702f7e9a4341b0b5429412a38ce6}{Lomeli}{L\bibinitperiod}{Mario}{M\bibinitperiod}{}{}{}{}}%
        {{hash=9323e026156dd9585f3d66085d004b6a}{Ram\'{\i{}}rez-Ib\'{a}\~{n}ez}{R\bibinithyphendelim I\bibinitperiod}{Marcelino}{M\bibinitperiod}{}{}{}{}}%
        {{hash=60ebab3b1e371ba4b3a21b83f4ca33c6}{Rivera-Mart\'{\i{}}nez}{R\bibinithyphendelim M\bibinitperiod}{Luis\bibnamedelima Manuel}{L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5bed3f7a2953e6eab9a5f44390c9a189}
      \strng{fullhash}{27b8efa5afad0c3357472801261dc56f}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.MG}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{11}
      \field{note}{\arxiv{1411.1699} (last accessed 9/21/2017)}
      \field{title}{{The second convex hull of every optimal rectilinear drawing of $K_n$ is a triangle}}
      \field{year}{2014}
      \verb{eprint}
      \verb 1411.1699
      \endverb
      \keyw{Mathematics - Metric Geometry,Mathematics - Combinatorics,05C10,68R10}
    \endentry
    \entry{LM69}{article}{}
      \name{author}{2}{}{%
        {{hash=51dc75d865c309644912e45481d4d081}{Leclerc}{L\bibinitperiod}{B.}{B\bibinitperiod}{}{}{}{}}%
        {{hash=f9258960b885f86ae21c4d7926ceafc2}{Monjardet}{M\bibinitperiod}{B.}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {French}%
      }
      \strng{namehash}{bd4b461aa9c556d79c6622b496ef4779}
      \strng{fullhash}{bd4b461aa9c556d79c6622b496ef4779}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Math. et Sci. humaines}
      \field{title}{{Probl\`{e}mes ouverts. Repr\'{e}sentation graphique d'un graphe.}}
      \field{volume}{26}
      \field{year}{1969}
      \field{pages}{51\bibrangedash 57}
      \range{pages}{7}
    \endentry
    \entry{L19}{article}{}
      \name{author}{1}{}{%
        {{hash=89eee76362af95ee143c3ed217f828b1}{Lee}{L\bibinitperiod}{Yoonah}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{89eee76362af95ee143c3ed217f828b1}
      \strng{fullhash}{89eee76362af95ee143c3ed217f828b1}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1902.02759} (last accessed 4/2/2019)}
      \field{title}{On Genus $g$ Orientable Crossing Numbers of Small Complete Graphs}
      \field{year}{2019}
      \verb{eprint}
      \verb 1902.02759
      \endverb
    \endentry
    \entry{L83}{book}{}
      \name{author}{1}{}{%
        {{hash=1bc69b6e568fb20539c7c24b6ec4230d}{Leighton}{L\bibinitperiod}{Frank\bibnamedelima Thomson}{F\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cambridge, MA}%
      }
      \list{publisher}{1}{%
        {MIT Press}%
      }
      \strng{namehash}{1bc69b6e568fb20539c7c24b6ec4230d}
      \strng{fullhash}{1bc69b6e568fb20539c7c24b6ec4230d}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Complexity Issues in {VLSI}: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks}
      \field{year}{1983}
    \endentry
    \entry{L84}{article}{}
      \name{author}{1}{}{%
        {{hash=1bc69b6e568fb20539c7c24b6ec4230d}{Leighton}{L\bibinitperiod}{Frank\bibnamedelima Thomson}{F\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1bc69b6e568fb20539c7c24b6ec4230d}
      \strng{fullhash}{1bc69b6e568fb20539c7c24b6ec4230d}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Math. Systems Theory}
      \field{number}{1}
      \field{title}{New lower bound techniques for {VLSI}}
      \field{volume}{17}
      \field{year}{1984}
      \field{pages}{47\bibrangedash 70}
      \range{pages}{24}
    \endentry
    \entry{L72}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=e4a73c2a5aff1d1666bc4e8cefe22600}{Levow}{L\bibinitperiod}{Roy\bibnamedelima B.}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Boca Raton, Fla.}%
      }
      \list{publisher}{1}{%
        {Florida Atlantic Univ.}%
      }
      \strng{namehash}{e4a73c2a5aff1d1666bc4e8cefe22600}
      \strng{fullhash}{e4a73c2a5aff1d1666bc4e8cefe22600}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the {T}hird {S}outheastern {C}onference on {C}ombinatorics, {G}raph {T}heory, and {C}omputing}
      \field{title}{On {T}utte's algebraic approach to the theory of crossing numbers}
      \field{year}{1972}
      \field{pages}{315\bibrangedash 314}
      \range{pages}{0}
    \endentry
    \entry{LE03}{article}{}
      \name{author}{2}{}{%
        {{hash=1e1a342aa4d9a000cc638434ec3948f6}{Lin}{L\bibinitperiod}{Xuemin}{X\bibinitperiod}{}{}{}{}}%
        {{hash=fae722db5adb8b8f106abce55dd6b794}{Eades}{E\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Essex, UK}%
      }
      \list{publisher}{1}{%
        {Elsevier Science Publishers Ltd.}%
      }
      \strng{namehash}{1d0ceb4c1d2f541e992716108c680cda}
      \strng{fullhash}{1d0ceb4c1d2f541e992716108c680cda}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0304-3975}
      \field{journaltitle}{Theor. Comput. Sci.}
      \field{number}{3}
      \field{title}{Towards area requirements for drawing hierarchically planar graphs}
      \field{volume}{292}
      \field{year}{2003}
      \field{pages}{679\bibrangedash 695}
      \range{pages}{17}
    \endentry
    \entry{LCH20}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=f20629adfe4679dcd47dad0b2a99ff21}{Liu}{L\bibinitperiod}{Yunlong}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=f12458352bf48d8ebe2ba46b11310c19}{Chen}{C\bibinitperiod}{Jie}{J\bibinitperiod}{}{}{}{}}%
        {{hash=38ee5a47693e880ad8a25d0d7c224212}{Huang}{H\bibinitperiod}{Jingui}{J\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=04f4af9bb91e05c24eb4852c71fe93b6}{Wu}{W\bibinitperiod}{Weili}{W\bibinitperiod}{}{}{}{}}%
        {{hash=da46bafb04962d4825a408c55235bf02}{Zhang}{Z\bibinitperiod}{Zhongnan}{Z\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cham}%
      }
      \list{publisher}{1}{%
        {Springer International Publishing}%
      }
      \strng{namehash}{ea03d61d3d214928df1e22f13a940d78}
      \strng{fullhash}{ea03d61d3d214928df1e22f13a940d78}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial Optimization and Applications}
      \field{isbn}{978-3-030-64843-5}
      \field{title}{Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge}
      \field{year}{2020}
      \field{pages}{562\bibrangedash 576}
      \range{pages}{15}
    \endentry
    \entry{L1517}{book}{}
      \name{author}{1}{}{%
        {{hash=b7b84bfbcee5e1f26a4af47a33ecd70e}{Llull}{L\bibinitperiod}{Ramon}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {London}%
      }
      \list{publisher}{1}{%
        {Jacques Mareschal, Simon Vincent}%
      }
      \strng{namehash}{b7b84bfbcee5e1f26a4af47a33ecd70e}
      \strng{fullhash}{b7b84bfbcee5e1f26a4af47a33ecd70e}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Online at \url{https://archive.org/details/bub_gb_rG_yINh8V1gC} (last accessed 5/17/2019)}
      \field{title}{Illuminati sacre pagine pfessoris amplissimi magistri Raymundi Lull Ars magna}
      \field{year}{1517}
    \endentry
    \entry{L13}{thesis}{}
      \name{author}{1}{}{%
        {{hash=a90090970606790bd35e1935df2fc9f3}{L\'{o}pez}{L\bibinitperiod}{Lorena\bibnamedelima Mercedes}{L\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {California State University}%
      }
      \list{location}{1}{%
        {Northridge}%
      }
      \strng{namehash}{a90090970606790bd35e1935df2fc9f3}
      \strng{fullhash}{a90090970606790bd35e1935df2fc9f3}
      \field{sortinit}{L}
      \field{sortinithash}{872351f18d0f736066eda0bf18bfa4f7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Rectilinear crossing numbers of complete graphs with specific nested sequence of convex hulls}
      \field{type}{mathesis}
      \field{year}{2013}
    \endentry
    \entry{MR08}{article}{}
      \name{author}{2}{}{%
        {{hash=09dbe95195bc23f0abcee1c1b81b4eb9}{Ma}{M\bibinitperiod}{Dengju}{D\bibinitperiod}{}{}{}{}}%
        {{hash=fef0f457dc12347c521edd6002c141a3}{Ren}{R\bibinitperiod}{Han}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{9700646b98ab78f8bb938324a9a76bbd}
      \strng{fullhash}{9700646b98ab78f8bb938324a9a76bbd}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1009-6124}
      \field{journaltitle}{J. Syst. Sci. Complex.}
      \field{number}{2}
      \field{title}{The projective plane crossing numbers of circular graphs}
      \field{volume}{21}
      \field{year}{2008}
      \field{pages}{316\bibrangedash 322}
      \range{pages}{7}
    \endentry
    \entry{M91}{article}{}
      \name{author}{1}{}{%
        {{hash=a07f0c5eefda66d8e6024cc5736b0ad0}{Madej}{M\bibinitperiod}{Tom}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Wiley}%
      }
      \strng{namehash}{a07f0c5eefda66d8e6024cc5736b0ad0}
      \strng{fullhash}{a07f0c5eefda66d8e6024cc5736b0ad0}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1097-0118}
      \field{journaltitle}{Journal of Graph Theory}
      \field{number}{1}
      \field{title}{Bounds for the crossing number of the ${N}$-cube}
      \field{volume}{15}
      \field{year}{1991}
      \field{pages}{81\bibrangedash 97}
      \range{pages}{17}
      \verb{doi}
      \verb 10.1002/jgt.3190150109
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1002/jgt.3190150109
      \endverb
    \endentry
    \entry{M88}{article}{}
      \name{author}{1}{}{%
        {{hash=a0cd0fddcee2da868b78e7ae90739753}{M\"{a}kinen}{M\bibinitperiod}{E.}{E\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Taylor \& Francis}%
      }
      \strng{namehash}{a0cd0fddcee2da868b78e7ae90739753}
      \strng{fullhash}{a0cd0fddcee2da868b78e7ae90739753}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{International Journal of Computer Mathematics}
      \field{number}{1}
      \field{title}{On circular layouts}
      \field{volume}{24}
      \field{year}{1988}
      \field{pages}{29\bibrangedash 37}
      \range{pages}{9}
    \endentry
    \entry{M83}{article}{}
      \name{author}{1}{}{%
        {{hash=38dda98c2e7a6b01eb4f01efccd12696}{Mansfield}{M\bibinitperiod}{Anthony}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{38dda98c2e7a6b01eb4f01efccd12696}
      \strng{fullhash}{38dda98c2e7a6b01eb4f01efccd12696}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0305-0041}
      \field{journaltitle}{Math. Proc. Cambridge Philos. Soc.}
      \field{number}{1}
      \field{title}{Determining the thickness of graphs is {NP}-hard}
      \field{volume}{93}
      \field{year}{1983}
      \field{pages}{9\bibrangedash 23}
      \range{pages}{15}
    \endentry
    \entry{MS95}{article}{}
      \name{author}{2}{}{%
        {{hash=fc14af57275346c99e086635bbe0c81c}{Marek-Sadowska}{M\bibinithyphendelim S\bibinitperiod}{Malgorzata}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a0b1d3e35bc4d05fb1a34711a4ebcad8}{Sarrafzadeh}{S\bibinitperiod}{Majid}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{06b915359e0860caba82d383109772f1}
      \strng{fullhash}{06b915359e0860caba82d383109772f1}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{IEEE Trans. on CAD of Integrated Circuits and Systems}
      \field{number}{4}
      \field{title}{The crossing distribution problem}
      \field{volume}{14}
      \field{year}{1995}
      \field{pages}{423\bibrangedash 433}
      \range{pages}{11}
    \endentry
    \entry{MKNF87}{inproceedings}{}
      \name{author}{4}{}{%
        {{hash=760c5f534400b65bb29253e726ea078a}{Masuda}{M\bibinitperiod}{Sumio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=9fc7197499c35845653eac264a9ab660}{Kashiwabara}{K\bibinitperiod}{Toshinobu}{T\bibinitperiod}{}{}{}{}}%
        {{hash=b21930dc56d5ac73ee0011887f64d6af}{Nakajima}{N\bibinitperiod}{Kazuo}{K\bibinitperiod}{}{}{}{}}%
        {{hash=bafad380fb3a4f0beb2bb3bb4e3698be}{Fujisawa}{F\bibinitperiod}{Toshio}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE}%
      }
      \strng{namehash}{a50ddf5746e24172c578da5a38f2dfbe}
      \strng{fullhash}{577ed3d488b9733abb77500791e88c44}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{International Symposium on Circuits and Systems}
      \field{title}{On the {NP}-Completeness of a Computer Network Layout Problem}
      \field{year}{1987}
      \field{pages}{292\bibrangedash 295}
      \range{pages}{4}
    \endentry
    \entry{MNKF90}{article}{}
      \name{author}{4}{}{%
        {{hash=760c5f534400b65bb29253e726ea078a}{Masuda}{M\bibinitperiod}{Sumio}{S\bibinitperiod}{}{}{}{}}%
        {{hash=b21930dc56d5ac73ee0011887f64d6af}{Nakajima}{N\bibinitperiod}{Kazuo}{K\bibinitperiod}{}{}{}{}}%
        {{hash=9fc7197499c35845653eac264a9ab660}{Kashiwabara}{K\bibinitperiod}{Toshinobu}{T\bibinitperiod}{}{}{}{}}%
        {{hash=bafad380fb3a4f0beb2bb3bb4e3698be}{Fujisawa}{F\bibinitperiod}{Toshio}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a50ddf5746e24172c578da5a38f2dfbe}
      \strng{fullhash}{6268fbbabb4e282b7ec860bbca6c4811}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0018-9340}
      \field{journaltitle}{IEEE Trans. Comput.}
      \field{number}{1}
      \field{title}{Crossing minimization in linear embeddings of graphs}
      \field{volume}{39}
      \field{year}{1990}
      \field{pages}{124\bibrangedash 127}
      \range{pages}{4}
    \endentry
    \entry{M14}{article}{}
      \name{author}{1}{}{%
        {{hash=c4b882254f034f1310f48a09f5b283c3}{Matou\v{s}ek}{M\bibinitperiod}{Ji\v{r}\'{\i{}}}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c4b882254f034f1310f48a09f5b283c3}
      \strng{fullhash}{c4b882254f034f1310f48a09f5b283c3}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0963-5483}
      \field{journaltitle}{Combin. Probab. Comput.}
      \field{number}{1}
      \field{title}{Near-optimal separators in string graphs}
      \field{volume}{23}
      \field{year}{2014}
      \field{pages}{135\bibrangedash 139}
      \range{pages}{5}
      \verb{doi}
      \verb 10.1017/S0963548313000400
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1017/S0963548313000400
      \endverb
    \endentry
    \entry{M85}{article}{}
      \name{author}{1}{}{%
        {{hash=b574d71635f3ac87e5d5ff0b5e9fe1c7}{May}{M\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Newton, MA, USA}%
      }
      \list{publisher}{1}{%
        {Butterworth-Heinemann}%
      }
      \strng{namehash}{b574d71635f3ac87e5d5ff0b5e9fe1c7}
      \strng{fullhash}{b574d71635f3ac87e5d5ff0b5e9fe1c7}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0010-4485}
      \field{issue}{1}
      \field{journaltitle}{Comput. Aided Des.}
      \field{month}{01}
      \field{title}{Computer-generated multi-row schematics}
      \field{volume}{17}
      \field{year}{1985}
      \field{pages}{25\bibrangedash 29}
      \range{pages}{5}
    \endentry
    \entry{MM84}{article}{}
      \name{author}{2}{}{%
        {{hash=399467400613a439d149a21f3f5655ad}{May}{M\bibinitperiod}{Michael\bibnamedelima J}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=637188d478a0389e9efb93c97a211835}{Mennecke}{M\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Taylor \& Francis, Abingdon, Oxon}%
      }
      \strng{namehash}{bb20cb0d9f30e83e6c52e918af693904}
      \strng{fullhash}{bb20cb0d9f30e83e6c52e918af693904}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0232-9298}
      \field{journaltitle}{{Syst. Anal. Modell. Simul.}}
      \field{title}{{Layout of schematic drawings}}
      \field{volume}{1}
      \field{year}{1984}
      \field{pages}{307\bibrangedash 338}
      \range{pages}{32}
    \endentry
    \entry{MS88}{article}{}
      \name{author}{2}{}{%
        {{hash=b574d71635f3ac87e5d5ff0b5e9fe1c7}{May}{M\bibinitperiod}{Michael}{M\bibinitperiod}{}{}{}{}}%
        {{hash=3176b04006b9fc7f15af57081e48a022}{{Szkatu{\l{}}a}}{S\bibinitperiod}{Krzysztof}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Polish Academy of Sciences (Polska Akademia Nauk - PAN), Systems Research Institute, Warsaw}%
      }
      \strng{namehash}{f272525177a56188eb3ca119ad838a49}
      \strng{fullhash}{f272525177a56188eb3ca119ad838a49}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0324-8569}
      \field{journaltitle}{{Control Cybern.}}
      \field{number}{1}
      \field{title}{On the bipartite crossing number}
      \field{volume}{17}
      \field{year}{1988}
      \field{pages}{85\bibrangedash 98}
      \range{pages}{14}
    \endentry
    \entry{MC12}{thesis}{}
      \name{author}{1}{}{%
        {{hash=a753d5e43f753ea21f1fb18f0ea84f3a}{McConvey}{M\bibinitperiod}{Andrew}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {University of Waterloo}%
      }
      \list{location}{1}{%
        {Waterloo}%
      }
      \strng{namehash}{a753d5e43f753ea21f1fb18f0ea84f3a}
      \strng{fullhash}{a753d5e43f753ea21f1fb18f0ea84f3a}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Highly Non-Convex Crossing Sequences}
      \field{type}{mathesis}
      \field{year}{2012}
    \endentry
    \entry{MS08}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=5c2bf28dfc3bf7b844b9e2676e37be58}{Mchedlidze}{M\bibinitperiod}{Tamara}{T\bibinitperiod}{}{}{}{}}%
        {{hash=3839c51471c23b88caf43bd6728b939f}{Symvonis}{S\bibinitperiod}{Antonios}{A\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=47522b07e88f2e0da39c67bb0caecd7a}{Tollis}{T\bibinitperiod}{Ioannis\bibnamedelima G.}{I\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
        {{hash=c443f4519e06a4a6cd62fca1a19d92ec}{Patrignani}{P\bibinitperiod}{Maurizio}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{10ae672279dcc9c25eeac1c2bb729036}
      \strng{fullhash}{10ae672279dcc9c25eeac1c2bb729036}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{978-3-642-00218-2}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Spine Crossing Minimization in Upward Topological Book Embeddings}
      \field{volume}{5417}
      \field{year}{2008}
      \field{pages}{445\bibrangedash 446}
      \range{pages}{2}
    \endentry
    \entry{MPR15}{article}{}
      \name{author}{3}{}{%
        {{hash=073efaf80a8e361fa3066607b3af0da9}{McQuillan}{M\bibinitperiod}{Dan}{D\bibinitperiod}{}{}{}{}}%
        {{hash=06ef0727eeebf6c7a55f4994fc8bc032}{Pan}{P\bibinitperiod}{Shengjun}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6bf3904ac1670ec899cff9c4da80eb97}
      \strng{fullhash}{6bf3904ac1670ec899cff9c4da80eb97}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{title}{On the crossing number of {$K_{13}$}}
      \field{volume}{115}
      \field{year}{2015}
      \field{pages}{224\bibrangedash 235}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1016/j.jctb.2015.06.002
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.jctb.2015.06.002
      \endverb
    \endentry
    \entry{MR16}{article}{}
      \name{author}{2}{}{%
        {{hash=073efaf80a8e361fa3066607b3af0da9}{McQuillan}{M\bibinitperiod}{Dan}{D\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a96e80cf6643f146c594cb15108507ae}
      \strng{fullhash}{a96e80cf6643f146c594cb15108507ae}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{4}
      \field{title}{On the crossing number of {$K_n$} without computer assistance}
      \field{volume}{82}
      \field{year}{2016}
      \field{pages}{387\bibrangedash 432}
      \range{pages}{46}
      \verb{doi}
      \verb 10.1002/jgt.21908
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1002/jgt.21908
      \endverb
    \endentry
    \entry{MKST71}{article}{}
      \name{author}{4}{}{%
        {{hash=4c1d9c03a6da2dedc88f57bdc344874e}{Melihov}{M\bibinitperiod}{A.\bibnamedelimi N.}{A\bibinitperiod\bibinitdelim N\bibinitperiod}{}{}{}{}}%
        {{hash=4ce0327b8c622f88cc5944177b08f5a7}{Kure\u{\i{}}\v{c}ik}{K\bibinitperiod}{V.\bibnamedelimi M.}{V\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=5f8c743c6d529d7c9d454a969f663412}{Seljankin}{S\bibinitperiod}{V.\bibnamedelimi V.}{V\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
        {{hash=02a840d792ff1a03c798867e23fcd0fc}{Ti\v{s}\v{c}enko}{T\bibinitperiod}{V.\bibnamedelimi A.}{V\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e247dbe678f654c48bf62a76a09cc653}
      \strng{fullhash}{e6052028f5fadc95afe74e8f80124a38}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0568-661X}
      \field{journaltitle}{Vy\v{c}isl. Sistemy}
      \field{title}{The number of intersections of edges of an arbitrary graph}
      \field{volume}{41}
      \field{year}{1971}
      \field{pages}{13\bibrangedash 24}
      \range{pages}{12}
    \endentry
    \entry{M78}{article}{}
      \name{author}{1}{}{%
        {{hash=fed0a28a06a32395ed191b0814b41043}{Mengersen}{M\bibinitperiod}{Ingrid}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{fed0a28a06a32395ed191b0814b41043}
      \strng{fullhash}{fed0a28a06a32395ed191b0814b41043}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-584X}
      \field{journaltitle}{Math. Nachr.}
      \field{title}{Die {M}aximalzahl von kreuzungsfreien {K}anten in {D}arstellungen von vollst\"{a}ndigen {$n$}-geteilten {G}raphen}
      \field{volume}{85}
      \field{year}{1978}
      \field{pages}{131\bibrangedash 139}
      \range{pages}{9}
    \endentry
    \entry{MELS95}{article}{}
      \name{author}{4}{}{%
        {{hash=d1356a2015e3d0c11c8aee765e380ebb}{Misue}{M\bibinitperiod}{K.}{K\bibinitperiod}{}{}{}{}}%
        {{hash=0fec309f36631e56c8fe66d82aaa665e}{Eades}{E\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=3eada8ed9f958eb67f900895dc6f074d}{Lai}{L\bibinitperiod}{W.}{W\bibinitperiod}{}{}{}{}}%
        {{hash=471c542c4372a8af830a0dafbaf0922f}{Sugiyama}{S\bibinitperiod}{K.}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Elsevier}%
      }
      \strng{namehash}{b331160b10aeb0065c8e4f08e879aed2}
      \strng{fullhash}{546302e9004c078074f89b8dff52ed0d}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Journal of visual languages and computing}
      \field{number}{2}
      \field{title}{Layout adjustment and the mental map}
      \field{volume}{6}
      \field{year}{1995}
      \field{pages}{183\bibrangedash 210}
      \range{pages}{28}
    \endentry
    \entry{M05}{article}{}
      \name{author}{1}{}{%
        {{hash=bb227f518f324fd3fb4a3d64a71ebac4}{Miyauchi}{M\bibinitperiod}{Miki}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{bb227f518f324fd3fb4a3d64a71ebac4}
      \strng{fullhash}{bb227f518f324fd3fb4a3d64a71ebac4}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{IEICE Transactions}
      \field{number}{5}
      \field{title}{Embedding a Graph into a $d + 1$-page Book with $\lceil m \log_d n\rceil$ Edge-crossings over the Spine}
      \field{volume}{88-A}
      \field{year}{2005}
      \field{pages}{1136\bibrangedash 1139}
      \range{pages}{4}
    \endentry
    \entry{M93}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=fa5c41d8ddadfb3c391f985a447621dc}{Miyauchi}{M\bibinitperiod}{Miki\bibnamedelima Shimabara}{M\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{5}{}{%
        {{hash=2c477b84272173132232715c0fe83eac}{{Di\bibnamedelimb Battista}}{D\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
        {{hash=0fec309f36631e56c8fe66d82aaa665e}{Eades}{E\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=cdeb59831ca2354b08cd2e4a7655ece6}{Fraysseix}{F\bibinitperiod}{H.\bibnamedelimi {de}}{H\bibinitperiod\bibinitdelim d\bibinitperiod}{}{}{}{}}%
        {{hash=f379528b1b7dff48e522ba660aa80cc2}{Rosenstiehl}{R\bibinitperiod}{P.}{P\bibinitperiod}{}{}{}{}}%
        {{hash=33d52f0510f05b8b5d20de58df3cf411}{Tamassia}{T\bibinitperiod}{R.}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {S\`{e}vres, France}%
      }
      \list{publisher}{1}{%
        {Centre D'Analyse et de Math\'{e}matique Sociales, Paris Sorbonne}%
      }
      \strng{namehash}{fa5c41d8ddadfb3c391f985a447621dc}
      \strng{fullhash}{fa5c41d8ddadfb3c391f985a447621dc}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proc. {ALCOM} Int. Work. Graph Drawing, GD}
      \field{month}{26--29~09}
      \field{title}{Algorithms for Embedding Graphs Into a $3$-Page Book}
      \field{year}{1993}
      \field{pages}{79\bibrangedash 80}
      \range{pages}{2}
    \endentry
    \entry{M99}{article}{}
      \name{author}{1}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{984a9c4e45e3489881e4a5220c9d1254}
      \strng{fullhash}{984a9c4e45e3489881e4a5220c9d1254}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{1}
      \field{title}{A linear time algorithm for embedding graphs in an arbitrary surface}
      \field{volume}{12}
      \field{year}{1999}
      \field{pages}{6\bibrangedash 26}
      \range{pages}{21}
    \endentry
    \entry{M08}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Yokohama, Japan}%
      }
      \strng{namehash}{984a9c4e45e3489881e4a5220c9d1254}
      \strng{fullhash}{984a9c4e45e3489881e4a5220c9d1254}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Abstracts of the 20th Workshop on Topological Graph Theory in Yokohama}
      \field{title}{Crossing numbers of graphs on the plane and on other surfaces}
      \field{year}{2008}
    \endentry
    \entry{M99a}{incollection}{}
      \name{author}{1}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=ce5e2934322f20135deffba1624816c8}{Kratochv\'{\i{}}l}{K\bibinitperiod}{Jan}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer-Verlag}%
      }
      \strng{namehash}{984a9c4e45e3489881e4a5220c9d1254}
      \strng{fullhash}{984a9c4e45e3489881e4a5220c9d1254}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{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}
      \field{isbn}{3-540-66904-3}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Drawing graphs in the hyperbolic plane}
      \field{volume}{1731}
      \field{year}{1999}
      \field{pages}{127\bibrangedash 136}
      \range{pages}{10}
    \endentry
    \entry{M20}{article}{}
      \name{author}{1}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{984a9c4e45e3489881e4a5220c9d1254}
      \strng{fullhash}{984a9c4e45e3489881e4a5220c9d1254}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2009.03418} (last accessed 1/7/2021)}
      \field{title}{On a conjecture by {A}nthony {H}ill}
      \field{year}{2020}
      \verb{eprint}
      \verb 2009.03418
      \endverb
      \keyw{Mathematics - Combinatorics}
    \endentry
    \entry{M09}{article}{}
      \name{author}{1}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{984a9c4e45e3489881e4a5220c9d1254}
      \strng{fullhash}{984a9c4e45e3489881e4a5220c9d1254}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1855-3966}
      \field{journaltitle}{Ars Math. Contemp.}
      \field{number}{2}
      \field{title}{The genus crossing number}
      \field{volume}{2}
      \field{year}{2009}
      \field{pages}{157\bibrangedash 162}
      \range{pages}{6}
    \endentry
    \entry{MS11}{article}{}
      \name{author}{2}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
        {{hash=1a90972b4c1b0ed516b92335ed95817e}{Stephen}{S\bibinitperiod}{Tamon}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cdeed7ce370db34e8eee6489b31876d7}
      \strng{fullhash}{cdeed7ce370db34e8eee6489b31876d7}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1571-0653}
      \field{journaltitle}{Electronic Notes in Discrete Mathematics}
      \field{title}{Expected Crossing Numbers}
      \field{volume}{38}
      \field{year}{2011}
      \field{pages}{651\bibrangedash 656}
      \range{pages}{6}
    \endentry
    \entry{MT01}{book}{}
      \name{author}{2}{}{%
        {{hash=984a9c4e45e3489881e4a5220c9d1254}{Mohar}{M\bibinitperiod}{Bojan}{B\bibinitperiod}{}{}{}{}}%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Baltimore, MD}%
      }
      \list{publisher}{1}{%
        {Johns Hopkins University Press}%
      }
      \strng{namehash}{99d50e736492930e25aacdc4d46deabe}
      \strng{fullhash}{99d50e736492930e25aacdc4d46deabe}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{series}{Johns Hopkins Studies in the Mathematical Sciences}
      \field{title}{Graphs on surfaces}
      \field{year}{2001}
    \endentry
    \entry{FML14}{article}{}
      \name{author}{2}{}{%
        {{hash=79a186254e01a78e1649f017753e1be7}{Monroy}{M\bibinitperiod}{Ruy\bibnamedelima Fabila}{R\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
        {{hash=addf493ffdba6d790598183f94c64458}{L\'{o}pez}{L\bibinitperiod}{Jorge}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{31a27feaeaf3471c495cb1aa9bcc562b}
      \strng{fullhash}{31a27feaeaf3471c495cb1aa9bcc562b}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Graph Algorithms Appl.}
      \field{number}{3}
      \field{title}{Computational search of small point sets with small rectilinear crossing number}
      \field{volume}{18}
      \field{year}{2014}
      \field{pages}{393\bibrangedash 399}
      \range{pages}{7}
      \verb{doi}
      \verb 10.7155/jgaa.00328
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.7155/jgaa.00328
      \endverb
    \endentry
    \entry{M77}{article}{}
      \name{author}{1}{}{%
        {{hash=a0af184fc672157f57b45225489e716e}{Moon}{M\bibinitperiod}{J.\bibnamedelimi W.}{J\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a0af184fc672157f57b45225489e716e}
      \strng{fullhash}{a0af184fc672157f57b45225489e716e}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0036-1399}
      \field{journaltitle}{SIAM J. Appl. Math.}
      \field{number}{3}
      \field{title}{Erratum: ``{O}n the distribution of crossings in random complete graphs'' ({SIAM} {J}. {A}ppl. {M}ath. {\bf 13} (1965), 506--510)}
      \field{volume}{32}
      \field{year}{1977}
      \field{pages}{706}
      \range{pages}{1}
    \endentry
    \entry{M65}{article}{}
      \name{author}{1}{}{%
        {{hash=a0af184fc672157f57b45225489e716e}{Moon}{M\bibinitperiod}{J.\bibnamedelimi W.}{J\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a0af184fc672157f57b45225489e716e}
      \strng{fullhash}{a0af184fc672157f57b45225489e716e}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Soc. Indust. Appl. Math.}
      \field{title}{On the distribution of crossings in random complete graphs}
      \field{volume}{13}
      \field{year}{1965}
      \field{pages}{506\bibrangedash 510}
      \range{pages}{5}
    \endentry
    \entry{M34}{book}{}
      \name{author}{1}{}{%
        {{hash=7b8b340e6187dde8562b90810d713646}{Moreno}{M\bibinitperiod}{Jacob\bibnamedelima Levy}{J\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Washington, D.C.}%
      }
      \list{publisher}{2}{%
        {Nervous}%
        {Mental Disease Publishing Co}%
      }
      \strng{namehash}{7b8b340e6187dde8562b90810d713646}
      \strng{fullhash}{7b8b340e6187dde8562b90810d713646}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Who shall survive?: A new approach to the problem of human interrelations.}
      \field{year}{1934}
      \field{pages}{xvi+437}
      \range{pages}{-1}
    \endentry
    \entry{M53}{book}{}
      \name{author}{1}{}{%
        {{hash=7b8b340e6187dde8562b90810d713646}{Moreno}{M\bibinitperiod}{Jacob\bibnamedelima Levy}{J\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Beacon, N.Y.}%
      }
      \list{publisher}{1}{%
        {Beacon House Inc}%
      }
      \strng{namehash}{7b8b340e6187dde8562b90810d713646}
      \strng{fullhash}{7b8b340e6187dde8562b90810d713646}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Who shall survive?: A new approach to the problem of human interrelations.}
      \field{year}{1953}
      \field{pages}{cxiv+718}
      \range{pages}{-1}
    \endentry
    \entry{MS01}{book}{}
      \name{author}{2}{}{%
        {{hash=8d9239a1390df5b682431996ea6ddfd0}{Moscovich}{M\bibinitperiod}{I.}{I\bibinitperiod}{}{}{}{}}%
        {{hash=ada4ff7b59a222793336c7595e97c632}{Stewart}{S\bibinitperiod}{I.}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Workman Pub.}%
      }
      \strng{namehash}{717feb730e613cf2ba9e75c016d072e3}
      \strng{fullhash}{717feb730e613cf2ba9e75c016d072e3}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{9780761118268}
      \field{title}{1000 {P}lay {T}hinks: {P}uzzles, {P}aradoxes, {I}llusions \& {G}ames}
      \field{year}{2001}
      \field{pages}{420}
      \range{pages}{1}
    \endentry
    \entry{MUV02}{incollection}{}
      \name{author}{3}{}{%
        {{hash=75ea96b890d0d37e55b1eb7130ed09a6}{Mu\~{n}oz}{M\bibinitperiod}{Xavier}{X\bibinitperiod}{}{}{}{}}%
        {{hash=dc955c5de33569474be624b1762cb7eb}{Unger}{U\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{93e5eb8c817f1a2f48ff88f014ce1374}
      \strng{fullhash}{93e5eb8c817f1a2f48ff88f014ce1374}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing ({V}ienna, 2001)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{One sided crossing minimization is {NP}-hard for sparse graphs}
      \field{volume}{2265}
      \field{year}{2002}
      \field{pages}{115\bibrangedash 123}
      \range{pages}{9}
      \verb{doi}
      \verb 10.1007/3-540-45848-4_10
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/3-540-45848-4_10
      \endverb
    \endentry
    \entry{M19}{thesis}{}
      \name{author}{1}{}{%
        {{hash=209d317be91e5d9988fb375c1483bf48}{Musulyan}{M\bibinitperiod}{Marine}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {California State University, Northridge}%
      }
      \list{location}{1}{%
        {Northridge}%
      }
      \strng{namehash}{209d317be91e5d9988fb375c1483bf48}
      \strng{fullhash}{209d317be91e5d9988fb375c1483bf48}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{05}
      \field{title}{Local Crossing Numbers of the Product of Planar Graphs and Cycles}
      \field{type}{mathesis}
      \field{year}{2019}
    \endentry
    \entry{M01}{article}{}
      \name{author}{1}{}{%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a2fd7e6fca32deb028c924ba80cfa4df}
      \strng{fullhash}{a2fd7e6fca32deb028c924ba80cfa4df}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1052-6234}
      \field{journaltitle}{SIAM J. Optim.}
      \field{number}{4}
      \field{title}{An alternative method to crossing minimization on hierarchical graphs}
      \field{volume}{11}
      \field{year}{2001}
      \field{pages}{1065\bibrangedash 1080}
      \range{pages}{16}
    \endentry
    \entry{M09b}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=0b66b903ea68fa7756de7807b3cd265d}{Albers}{A\bibinitperiod}{Susanne}{S\bibinitperiod}{}{}{}{}}%
        {{hash=dfa170a08197e06d8e21a960c8a18a0e}{Alt}{A\bibinitperiod}{Helmut}{H\bibinitperiod}{}{}{}{}}%
        {{hash=ab8969f0136c4c47220b7c8aaf02faae}{N\"{a}her}{N\bibinitperiod}{Stefan}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{a2fd7e6fca32deb028c924ba80cfa4df}
      \strng{fullhash}{a2fd7e6fca32deb028c924ba80cfa4df}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Efficient Algorithms}
      \field{isbn}{978-3-642-03455-8}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{The Crossing Number of Graphs: Theory and Computation}
      \field{volume}{5760}
      \field{year}{2009}
      \field{pages}{305\bibrangedash 317}
      \range{pages}{13}
    \endentry
    \entry{MZ99b}{incollection}{}
      \name{author}{2}{}{%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=72bac0081e5d5b79d75ca5b509194675}{Ziegler}{Z\bibinitperiod}{Thomas}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{4e1971a4b55bb2a3864be1783d51665c}
      \strng{fullhash}{4e1971a4b55bb2a3864be1783d51665c}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing (\v{S}ti\v{r}\'{\i{}}n {C}astle, 1999)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{The constrained crossing minimization problem}
      \field{volume}{1731}
      \field{year}{1999}
      \field{pages}{175\bibrangedash 185}
      \range{pages}{11}
    \endentry
    \entry{MZ99}{incollection}{}
      \name{author}{2}{}{%
        {{hash=a2fd7e6fca32deb028c924ba80cfa4df}{Mutzel}{M\bibinitperiod}{Petra}{P\bibinitperiod}{}{}{}{}}%
        {{hash=72bac0081e5d5b79d75ca5b509194675}{Ziegler}{Z\bibinitperiod}{Thomas}{T\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{4e1971a4b55bb2a3864be1783d51665c}
      \strng{fullhash}{4e1971a4b55bb2a3864be1783d51665c}
      \field{sortinit}{M}
      \field{sortinithash}{2684bec41e9697b92699b46491061da2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Operations {R}esearch {P}roceedings 1998 ({Z}urich)}
      \field{title}{The constrained crossing minimization problem---a first approach}
      \field{year}{1999}
      \field{pages}{125\bibrangedash 134}
      \range{pages}{10}
    \endentry
    \entry{N03}{article}{}
      \name{author}{1}{}{%
        {{hash=3393a55851eaee26806d7dc0f474c6fc}{Nahas}{N\bibinitperiod}{Nagi\bibnamedelima H.}{N\bibinitperiod\bibinitdelim H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3393a55851eaee26806d7dc0f474c6fc}
      \strng{fullhash}{3393a55851eaee26806d7dc0f474c6fc}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Electron. J. Combin.}
      \field{title}{On the crossing number of {$K_{m,n}$}}
      \field{volume}{10}
      \field{year}{2003}
      \field{pages}{Note 8}
      \range{pages}{-1}
    \endentry
    \entry{N01}{article}{}
      \name{author}{1}{}{%
        {{hash=0d643ca2338768062c192b7134e917ce}{Negami}{N\bibinitperiod}{Seiya}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {John Wiley & Sons, Inc.}%
      }
      \strng{namehash}{0d643ca2338768062c192b7134e917ce}
      \strng{fullhash}{0d643ca2338768062c192b7134e917ce}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1097-0118}
      \field{journaltitle}{Journal of Graph Theory}
      \field{number}{1}
      \field{title}{Crossing numbers of graph embedding pairs on closed surfaces}
      \field{volume}{36}
      \field{year}{2001}
      \field{pages}{8\bibrangedash 23}
      \range{pages}{16}
      \keyw{crossing numbers,embeddings of graphs}
    \endentry
    \entry{N98}{article}{}
      \name{author}{1}{}{%
        {{hash=0d643ca2338768062c192b7134e917ce}{Negami}{N\bibinitperiod}{Seiya}{S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0d643ca2338768062c192b7134e917ce}
      \strng{fullhash}{0d643ca2338768062c192b7134e917ce}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0044-0523}
      \field{journaltitle}{Yokohama Math. J.}
      \field{number}{2}
      \field{title}{Diagonal flips in triangulations on closed surfaces, estimating upper bounds}
      \field{volume}{45}
      \field{year}{1998}
      \field{pages}{113\bibrangedash 124}
      \range{pages}{12}
    \endentry
    \entry{N89}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=81858262c0cbb82d28bc41d79b9f0ce0}{Newbery}{N\bibinitperiod}{Frances\bibnamedelima J.}{F\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Princeton, New Jersey, United States}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{81858262c0cbb82d28bc41d79b9f0ce0}
      \strng{fullhash}{81858262c0cbb82d28bc41d79b9f0ce0}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 2nd International Workshop on Software configuration management}
      \field{isbn}{0-89791-334-5}
      \field{series}{SCM '89}
      \field{title}{Edge concentration: a method for clustering directed graphs}
      \field{year}{1989}
      \field{pages}{76\bibrangedash 85}
      \range{pages}{10}
    \endentry
    \entry{N68}{article}{}
      \name{author}{1}{}{%
        {{hash=464ffa04811e05ac5f08046ff3d635d3}{Nicholson}{N\bibinitperiod}{T.\bibnamedelimi A.\bibnamedelimi J.}{T\bibinitperiod\bibinitdelim A\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{464ffa04811e05ac5f08046ff3d635d3}
      \strng{fullhash}{464ffa04811e05ac5f08046ff3d635d3}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0020-3270}
      \field{journaltitle}{Proc. Inst. Elec. Engrs.}
      \field{title}{Permutation procedure for minimising the number of crossings in a network}
      \field{volume}{115}
      \field{year}{1968}
      \field{pages}{21\bibrangedash 26}
      \range{pages}{6}
    \endentry
    \entry{N40}{article}{}
      \name{author}{1}{}{%
        {{hash=ab58ee71e69449572e677a7edc073248}{Northway}{N\bibinitperiod}{Mary\bibnamedelima L.}{M\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {American Sociological Association}%
      }
      \strng{namehash}{ab58ee71e69449572e677a7edc073248}
      \strng{fullhash}{ab58ee71e69449572e677a7edc073248}
      \field{sortinit}{N}
      \field{sortinithash}{925374ca63e7594de7fafdb83e64d41d}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{00380431}
      \field{journaltitle}{Sociometry}
      \field{month}{04}
      \field{number}{2}
      \field{title}{A Method for Depicting Social Relationships Obtained by Sociometric Testing}
      \field{volume}{3}
      \field{year}{1940}
      \field{pages}{}
      \range{pages}{-1}
      \verb{url}
      \verb http://www.jstor.org/stable/2785439
      \endverb
      \warn{\item Range field 'pages' in entry 'N40' is malformed, skipping}
    \endentry
    \entry{OTU13}{article}{}
      \name{author}{3}{}{%
        {{hash=7e30af07bc17163d67c6cfe1ca80dbd2}{{Okamoto}}{O\bibinitperiod}{Yoshio}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=4a7d13d01fc43fb6a95b8bcde76f4e1b}{{Tatsu}}{T\bibinitperiod}{Yuichi}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=2c437251de694f24fc4bab987ea52ba4}{{Uno}}{U\bibinitperiod}{Yushi}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6c2a163de0b306158ceba01bf24232c1}
      \strng{fullhash}{6c2a163de0b306158ceba01bf24232c1}
      \field{sortinit}{O}
      \field{sortinithash}{7803d2715d5e795e70382b084ab8d00e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.DS}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{06}
      \field{note}{\arxiv{1306.3538} (last accessed 9/21/2017)}
      \field{title}{{Exact and fixed-parameter algorithms for metro-line crossing minimization problems}}
      \field{year}{2013}
      \verb{eprint}
      \verb 1306.3538
      \endverb
    \endentry
    \entry{O13}{misc}{}
      \name{author}{1}{}{%
        {{hash=0f2ed547e7b80ed4a6a511523a2dd84f}{Oporowski}{O\bibinitperiod}{Bogdan}{B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0f2ed547e7b80ed4a6a511523a2dd84f}
      \strng{fullhash}{0f2ed547e7b80ed4a6a511523a2dd84f}
      \field{sortinit}{O}
      \field{sortinithash}{7803d2715d5e795e70382b084ab8d00e}
      \field{labelnamesource}{author}
      \field{howpublished}{Personal communication}
      \field{month}{03}
      \field{year}{2013}
    \endentry
    \entry{OZ09}{article}{}
      \name{author}{2}{}{%
        {{hash=0f2ed547e7b80ed4a6a511523a2dd84f}{Oporowski}{O\bibinitperiod}{Bogdan}{B\bibinitperiod}{}{}{}{}}%
        {{hash=b4a80848b8c0f9dc8aa9b6524ab13f74}{Zhao}{Z\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{edb2fb57de74896873d3b7c7a5d1213c}
      \strng{fullhash}{edb2fb57de74896873d3b7c7a5d1213c}
      \field{sortinit}{O}
      \field{sortinithash}{7803d2715d5e795e70382b084ab8d00e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Discrete Math.}
      \field{number}{9}
      \field{title}{Coloring graphs with crossings}
      \field{volume}{309}
      \field{year}{2009}
      \field{pages}{2948\bibrangedash 2951}
      \range{pages}{4}
    \endentry
    \entry{O71}{article}{}
      \name{author}{1}{}{%
        {{hash=cb65e956719be5cc78f06b5f6d840613}{Owens}{O\bibinitperiod}{Alvin}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE}%
      }
      \strng{namehash}{cb65e956719be5cc78f06b5f6d840613}
      \strng{fullhash}{cb65e956719be5cc78f06b5f6d840613}
      \field{sortinit}{O}
      \field{sortinithash}{7803d2715d5e795e70382b084ab8d00e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0018-9324}
      \field{journaltitle}{Transactions on Circuit Theory}
      \field{month}{03}
      \field{number}{2}
      \field{title}{On the biplanar crossing number}
      \field{volume}{18}
      \field{year}{1971}
      \field{pages}{277\bibrangedash 280}
      \range{pages}{4}
    \endentry
    \entry{PPST05}{article}{}
      \name{author}{4}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=e57f9cc019f1abcfca1c3d29f71bd78a}{Pinchasi}{P\bibinitperiod}{Rom}{R\bibinitperiod}{}{}{}{}}%
        {{hash=9586c4968b275c9bde911f0f96aba3d8}{Sharir}{S\bibinitperiod}{Micha}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{76960e4d71165cc11bc36a9b320ca9fd}
      \strng{fullhash}{342a83635edc603256109a45698df953}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0911-0119}
      \field{journaltitle}{Graphs Combin.}
      \field{number}{3}
      \field{title}{Topological graphs with no large grids}
      \field{volume}{21}
      \field{year}{2005}
      \field{pages}{355\bibrangedash 364}
      \range{pages}{10}
    \endentry
    \entry{PRTT06}{article}{}
      \name{author}{4}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=90404c3c1e96a3bcd63a28f8f85f2fe1}{Radoi\v{c}i\'{c}}{R\bibinitperiod}{Rado\v{s}}{R\bibinitperiod}{}{}{}{}}%
        {{hash=a20f49fbb356059ee203950b7aebbfe4}{Tardos}{T\bibinitperiod}{G\'{a}bor}{G\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{76960e4d71165cc11bc36a9b320ca9fd}
      \strng{fullhash}{e690f4aadd4bb174a6450f59d39b77fb}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{Improving the crossing lemma by finding more crossings in sparse graphs}
      \field{volume}{36}
      \field{year}{2006}
      \field{pages}{527\bibrangedash 552}
      \range{pages}{26}
    \endentry
    \entry{PST00}{article}{}
      \name{author}{3}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=e619cad5fdae4ea4b7283dddb36fb04a}{Spencer}{S\bibinitperiod}{Joel}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6bab149f04edec3552c3d9bae008328b}
      \strng{fullhash}{6bab149f04edec3552c3d9bae008328b}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{note}{ACM Symposium on Computational Geometry (Miami, FL, 1999)}
      \field{number}{4}
      \field{title}{New bounds on crossing numbers}
      \field{volume}{24}
      \field{year}{2000}
      \field{pages}{623\bibrangedash 644}
      \range{pages}{22}
    \endentry
    \entry{PS11}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=5dd0ae89bcbd7739f3711124fa4979f0}{Sterling}{S\bibinitperiod}{Ethan}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{83e87c43fd27e1060ed959ecd4222b48}
      \strng{fullhash}{83e87c43fd27e1060ed959ecd4222b48}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0002-9890}
      \field{journaltitle}{Amer. Math. Monthly}
      \field{number}{6}
      \field{title}{Conway's conjecture for monotone thrackles}
      \field{volume}{118}
      \field{year}{2011}
      \field{pages}{544\bibrangedash 548}
      \range{pages}{5}
      \verb{doi}
      \verb 10.4169/amer.math.monthly.118.06.544
      \endverb
      \verb{url}
      \verb https://doi.org/10.4169/amer.math.monthly.118.06.544
      \endverb
    \endentry
    \entry{PSTT18}{article}{}
      \name{author}{4}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=aae880d79266219814a56d27fd81777c}{T\'{o}th}{T\bibinitperiod}{Csaba\bibnamedelima D.}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{76960e4d71165cc11bc36a9b320ca9fd}
      \strng{fullhash}{3edcfa11a8854bc6c588fd57e9449345}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0925-7721}
      \field{journaltitle}{Comput. Geom.}
      \field{title}{Note on {$k$}-planar crossing numbers}
      \field{volume}{68}
      \field{year}{2018}
      \field{pages}{2\bibrangedash 6}
      \range{pages}{5}
      \verb{doi}
      \verb 10.1016/j.comgeo.2017.06.015
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.comgeo.2017.06.015
      \endverb
    \endentry
    \entry{PTT20}{article}{}
      \name{author}{3}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a20f49fbb356059ee203950b7aebbfe4}{Tardos}{T\bibinitperiod}{G\'{a}bor}{G\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{44e0a0f2dad49601fc45be153b180b9a}
      \strng{fullhash}{44e0a0f2dad49601fc45be153b180b9a}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2006.14908} (last accessed 7/6/2020)}
      \field{title}{Crossings between non-homotopic edges}
      \field{year}{2020}
      \verb{eprint}
      \verb 2006.14908
      \endverb
    \endentry
    \entry{PT20}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{A crossing lemma for multigraphs}
      \field{volume}{63}
      \field{year}{2020}
      \field{pages}{918\bibrangedash 933}
      \range{pages}{16}
    \endentry
    \entry{PT06a}{incollection}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Topics in discrete mathematics}
      \field{series}{Algorithms Combin.}
      \field{title}{Crossing number of toroidal graphs}
      \field{volume}{26}
      \field{year}{2006}
      \field{pages}{581\bibrangedash 590}
      \range{pages}{10}
    \endentry
    \entry{PT09}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{3}
      \field{title}{Degenerate crossing numbers}
      \field{volume}{41}
      \field{year}{2009}
      \field{pages}{376\bibrangedash 384}
      \range{pages}{9}
    \endentry
    \entry{PT97}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0209-9683}
      \field{journaltitle}{Combinatorica}
      \field{number}{3}
      \field{title}{Graphs drawn with few crossings per edge}
      \field{volume}{17}
      \field{year}{1997}
      \field{pages}{427\bibrangedash 439}
      \range{pages}{13}
    \endentry
    \entry{PT12}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{2220-5438}
      \field{journaltitle}{Mosc. J. Comb. Number Theory}
      \field{number}{3}
      \field{title}{Monotone crossing number}
      \field{volume}{2}
      \field{year}{2012}
      \field{pages}{18\bibrangedash 33}
      \range{pages}{16}
    \endentry
    \entry{PT04}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{1}
      \field{title}{Monotone drawings of planar graphs}
      \field{volume}{46}
      \field{year}{2004}
      \field{pages}{39\bibrangedash 47}
      \range{pages}{9}
    \endentry
    \entry{PT00b}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1065-7371}
      \field{journaltitle}{Geombinatorics}
      \field{number}{4}
      \field{title}{Thirteen problems on crossing numbers}
      \field{volume}{9}
      \field{year}{2000}
      \field{pages}{194\bibrangedash 207}
      \range{pages}{14}
    \endentry
    \entry{PT00}{article}{}
      \name{author}{2}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{205cc5c54e57653f340fc9b8987c95f1}
      \strng{fullhash}{205cc5c54e57653f340fc9b8987c95f1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{2}
      \field{title}{Which crossing number is it anyway?}
      \field{volume}{80}
      \field{year}{2000}
      \field{pages}{225\bibrangedash 246}
      \range{pages}{22}
    \endentry
    \entry{P06}{thesis}{}
      \name{author}{1}{}{%
        {{hash=06ef0727eeebf6c7a55f4994fc8bc032}{Pan}{P\bibinitperiod}{Shengjun}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {University of Waterloo}%
      }
      \strng{namehash}{06ef0727eeebf6c7a55f4994fc8bc032}
      \strng{fullhash}{06ef0727eeebf6c7a55f4994fc8bc032}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{On the Crossing Numbers of Complete Graphs}
      \field{type}{mathesis}
      \field{year}{2006}
    \endentry
    \entry{PR07}{article}{}
      \name{author}{2}{}{%
        {{hash=06ef0727eeebf6c7a55f4994fc8bc032}{Pan}{P\bibinitperiod}{Shengjun}{S\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{cad57f19502f66945dbd348fe9ce8408}
      \strng{fullhash}{cad57f19502f66945dbd348fe9ce8408}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{2}
      \field{title}{The crossing number of {$K_{11}$} is 100}
      \field{volume}{56}
      \field{year}{2007}
      \field{pages}{128\bibrangedash 134}
      \range{pages}{7}
    \endentry
    \entry{PSS09c}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=1e0751564947cc57b624dcd269d5c750}{Stasi}{S\bibinitperiod}{Despina}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {SIAM}%
      }
      \strng{namehash}{43742817695e0d070678dffb79c10c56}
      \strng{fullhash}{43742817695e0d070678dffb79c10c56}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM Journal on Discrete Mathematics}
      \field{number}{3}
      \field{title}{Strong {H}anani--{T}utte on the Projective Plane}
      \field{volume}{23}
      \field{year}{2009}
      \field{pages}{1317\bibrangedash 1323}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1137/08072485X
      \endverb
      \verb{url}
      \verb http://link.aip.org/link/?SJD/23/1317/1
      \endverb
      \keyw{HananiTutte theorem; projective plane; crossing number; independent odd crossing number}
    \endentry
    \entry{PSS07c}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=e7c2d546aaec1efec7088ae4c4723ce0}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{}{}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=484e9478b7c89285835c71d08a73b52a}{Hong}{H\bibinitperiod}{Seok-Hee}{S\bibinithyphendelim H\bibinitperiod}{}{}{}{}}%
        {{hash=1b8c76426a48d49b128239e3f7bbc056}{Nishizeki}{N\bibinitperiod}{Takao}{T\bibinitperiod}{}{}{}{}}%
        {{hash=edc4d84278fcd326979127ee358cdccd}{Quan}{Q\bibinitperiod}{Wu}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{e1795dd32d99fe0229384b34482439a1}
      \strng{fullhash}{e1795dd32d99fe0229384b34482439a1}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Crossing Numbers and Parameterized Complexity}
      \field{volume}{4875}
      \field{year}{2007}
      \field{pages}{31\bibrangedash 36}
      \range{pages}{6}
    \endentry
    \entry{PSS08d}{incollection}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Berlin}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Crossing numbers and parameterized complexity}
      \field{volume}{4875}
      \field{year}{2008}
      \field{pages}{31\bibrangedash 36}
      \range{pages}{6}
      \verb{doi}
      \verb 10.1007/978-3-540-77537-9_6
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/978-3-540-77537-9_6
      \endverb
    \endentry
    \entry{PSS09d}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer New York}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{issue}{3}
      \field{journaltitle}{Algorithmica}
      \field{note}{10.1007/s00453-009-9343-y}
      \field{title}{Crossing Numbers of Graphs with Rotation Systems}
      \field{volume}{60}
      \field{year}{2011}
      \field{pages}{679\bibrangedash 702}
      \range{pages}{24}
      \verb{url}
      \verb http://dx.doi.org/10.1007/s00453-009-9343-y
      \endverb
    \endentry
    \entry{PSS08}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Secaucus, NJ, USA}%
      }
      \list{publisher}{1}{%
        {Springer-Verlag New York, Inc.}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{1}
      \field{title}{Odd Crossing Number and Crossing Number Are Not the Same}
      \field{volume}{39}
      \field{year}{2008}
      \field{pages}{442\bibrangedash 454}
      \range{pages}{13}
      \verb{doi}
      \verb http://dx.doi.org/10.1007/s00454-008-9058-x
      \endverb
    \endentry
    \entry{PSS07d}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{4}
      \field{title}{Removing Even Crossings}
      \field{volume}{97}
      \field{year}{2007}
      \field{pages}{489\bibrangedash 500}
      \range{pages}{12}
    \endentry
    \entry{PSS09}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0195-6698}
      \field{journaltitle}{European J. Combin.}
      \field{number}{7}
      \field{title}{Removing even crossings on surfaces}
      \field{volume}{30}
      \field{year}{2009}
      \field{pages}{1704\bibrangedash 1717}
      \range{pages}{14}
    \endentry
    \entry{PSS10}{article}{}
      \name{author}{3}{}{%
        {{hash=b3ba527b9ba22d6d2ddba870c4c7e33b}{Pelsmajer}{P\bibinitperiod}{Michael\bibnamedelima J.}{M\bibinitperiod\bibinitdelim J\bibinitperiod}{}{}{}{}}%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {SIAM}%
      }
      \strng{namehash}{a44352b16c8af25e49b89eb3b3768837}
      \strng{fullhash}{a44352b16c8af25e49b89eb3b3768837}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{SIAM Journal on Discrete Mathematics}
      \field{number}{2}
      \field{title}{Removing Independently Even Crossings}
      \field{volume}{24}
      \field{year}{2010}
      \field{pages}{379\bibrangedash 393}
      \range{pages}{15}
      \verb{doi}
      \verb 10.1137/090765729
      \endverb
      \verb{url}
      \verb http://link.aip.org/link/?SJD/24/379/1
      \endverb
      \keyw{crossing number; independent odd crossing number; HananiTutte theorem}
    \endentry
    \entry{PRS91}{incollection}{}
      \name{author}{3}{}{%
        {{hash=1d307ba13d32516ad38c0d81105cd904}{Piazza}{P\bibinitperiod}{B.\bibnamedelimi L.}{B\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
        {{hash=b69368285083606b095e0be80c6ba1f0}{Ringeisen}{R\bibinitperiod}{R.\bibnamedelimi D.}{R\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=039476229954bcdb39932ebb3aea6c25}{Stueckle}{S\bibinitperiod}{S.\bibnamedelimi K.}{S\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Wiley}%
      }
      \strng{namehash}{80681400a3714412d1677cd7d7de9bee}
      \strng{fullhash}{80681400a3714412d1677cd7d7de9bee}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph theory, combinatorics, and applications. {V}ol.\ 2 ({K}alamazoo, {MI}, 1988)}
      \field{series}{Wiley-Intersci. Publ.}
      \field{title}{Properties of nonminimum crossings for some classes of graphs}
      \field{year}{1991}
      \field{pages}{975\bibrangedash 989}
      \range{pages}{15}
    \endentry
    \entry{P12}{thesis}{}
      \name{author}{1}{}{%
        {{hash=f4786712b3280f6c38c01348e62719e3}{Pierobon}{P\bibinitperiod}{Marco}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Universit\'{a} deglie Studi di Padova}%
      }
      \list{location}{1}{%
        {Padua, Italy}%
      }
      \strng{namehash}{f4786712b3280f6c38c01348e62719e3}
      \strng{fullhash}{f4786712b3280f6c38c01348e62719e3}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Minimization of the Crossing Number in a Reconciled Tree}
      \field{type}{mathesis}
      \field{year}{2012}
    \endentry
    \entry{P75}{thesis}{}
      \name{author}{1}{}{%
        {{hash=df0a61ffa43f1710f0bb5c4cbf1de81b}{Pinheiro}{P\bibinitperiod}{Robert\bibnamedelima A.}{R\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Polytechnic Institute of New York}%
      }
      \list{location}{1}{%
        {New York, NY}%
      }
      \strng{namehash}{df0a61ffa43f1710f0bb5c4cbf1de81b}
      \strng{fullhash}{df0a61ffa43f1710f0bb5c4cbf1de81b}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{06}
      \field{note}{Available at \url{https://www.proquest.com/docview/2327377637} (last accessed 4/23/2021)}
      \field{title}{Crossing Number Problems in Graph Theory With Some Results for Complete Graphs}
      \field{type}{mathesis}
      \field{year}{1975}
      \field{pages}{iv+28}
      \range{pages}{-1}
    \endentry
    \entry{PR04b}{article}{}
      \name{author}{2}{}{%
        {{hash=1cd82a2c9b6df25fa99c7efd71e5f968}{Pinontoan}{P\bibinitperiod}{Benny}{B\bibinitperiod}{}{}{}{}}%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{c1f6cfb2ca9217aa6dfdc2917881c0f9}
      \strng{fullhash}{c1f6cfb2ca9217aa6dfdc2917881c0f9}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1034-4942}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{Crossing numbers of sequences of graphs. {I}. {G}eneral tiles}
      \field{volume}{30}
      \field{year}{2004}
      \field{pages}{197\bibrangedash 206}
      \range{pages}{10}
    \endentry
    \entry{P17}{incollection}{}
      \name{author}{1}{}{%
        {{hash=10e69f35b1e4f6b384f82c217cd33fe2}{Pocai}{P\bibinitperiod}{Rafael\bibnamedelima Veiga}{R\bibinitperiod\bibinitdelim V\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Elsevier Sci. B. V., Amsterdam}%
      }
      \strng{namehash}{10e69f35b1e4f6b384f82c217cd33fe2}
      \strng{fullhash}{10e69f35b1e4f6b384f82c217cd33fe2}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{L{AGOS}'17---{IX} {L}atin and {A}merican {A}lgorithms, {G}raphs and {O}ptimization}
      \field{series}{Electron. Notes Discrete Math.}
      \field{title}{Inapproximability ratios for crossing number}
      \field{volume}{62}
      \field{year}{2017}
      \field{pages}{117\bibrangedash 122}
      \range{pages}{6}
    \endentry
    \entry{P04a}{inbook}{}
      \name{author}{1}{}{%
        {{hash=7ec78200ced89ef371b622a44c90deb2}{Purchase}{P\bibinitperiod}{Helen\bibnamedelima C.}{H\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Idea Group Publishing}%
      }
      \strng{namehash}{7ec78200ced89ef371b622a44c90deb2}
      \strng{fullhash}{7ec78200ced89ef371b622a44c90deb2}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{chapter}{Evaluating Graph Drawing Aesthetics: defining and exploring a new empirical research area}
      \field{title}{Computer Graphics and Multimedia: Applications, Problems and Solutions}
      \field{year}{2004}
      \field{pages}{145\bibrangedash 178}
      \range{pages}{34}
    \endentry
    \entry{P02}{article}{}
      \name{author}{1}{}{%
        {{hash=7ec78200ced89ef371b622a44c90deb2}{Purchase}{P\bibinitperiod}{Helen\bibnamedelima C.}{H\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7ec78200ced89ef371b622a44c90deb2}
      \strng{fullhash}{7ec78200ced89ef371b622a44c90deb2}
      \field{sortinit}{P}
      \field{sortinithash}{c0a4896d0e424f9ca4d7f14f2b3428e7}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Vis. Lang. Comput}
      \field{number}{5}
      \field{title}{Metrics for Graph Drawing Aesthetics}
      \field{volume}{13}
      \field{year}{2002}
      \field{pages}{501\bibrangedash 516}
      \range{pages}{16}
    \endentry
    \entry{RR19b}{incollection}{}
      \name{author}{2}{}{%
        {{hash=11f6b5d5018f5569a7742526f41e4c02}{Radermacher}{R\bibinitperiod}{Marcel}{M\bibinitperiod}{}{}{}{}}%
        {{hash=33140dd44f57dc4a8e11a32a9a9a9f1d}{Rutter}{R\bibinitperiod}{Ignaz}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern}%
      }
      \strng{namehash}{084c1412619a76d91a4cb88a581f9423}
      \strng{fullhash}{084c1412619a76d91a4cb88a581f9423}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{27th {A}nnual {E}uropean {S}ymposium on {A}lgorithms}
      \field{series}{LIPIcs. Leibniz Int. Proc. Inform.}
      \field{title}{Geometric crossing-minimization---a scalable randomized approach}
      \field{volume}{144}
      \field{year}{2019}
      \field{pages}{Art. No. 76\bibrangessep 16}
      \range{pages}{-1}
    \endentry
    \entry{R88}{article}{}
      \name{author}{1}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7cdf542467cb4536619492aa415fd90f}
      \strng{fullhash}{7cdf542467cb4536619492aa415fd90f}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Cubic graphs with crossing number two}
      \field{volume}{12}
      \field{year}{1988}
      \field{pages}{363\bibrangedash 374}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1002/jgt.3190120308
      \endverb
      \verb{url}
      \verb https://doi.org/10.1002/jgt.3190120308
      \endverb
    \endentry
    \entry{R87}{article}{}
      \name{author}{1}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7cdf542467cb4536619492aa415fd90f}
      \strng{fullhash}{7cdf542467cb4536619492aa415fd90f}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{note}{Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Fla., 1987)}
      \field{title}{Subgraphs with crossing number two}
      \field{volume}{60}
      \field{year}{1987}
      \field{pages}{169\bibrangedash 180}
      \range{pages}{12}
    \endentry
    \entry{RS09}{incollection}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=284983a93153cd1b56855a26a33c40f5}{Salazar}{S\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Cambridge Univ. Press, Cambridge}%
      }
      \strng{namehash}{e90fd4b46fc300aff233e84dc372b146}
      \strng{fullhash}{e90fd4b46fc300aff233e84dc372b146}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Topics in topological graph theory}
      \field{series}{Encyclopedia Math. Appl.}
      \field{title}{Crossing numbers}
      \field{volume}{128}
      \field{year}{2009}
      \field{pages}{133\bibrangedash 150}
      \range{pages}{18}
    \endentry
    \entry{RS01}{article}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{abd6b2bdee1772a88fa0cb529e9e1204}
      \strng{fullhash}{abd6b2bdee1772a88fa0cb529e9e1204}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1034-4942}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{The crossing number of {$C_6\times C_n$}}
      \field{volume}{23}
      \field{year}{2001}
      \field{pages}{135\bibrangedash 143}
      \range{pages}{9}
    \endentry
    \entry{RS05}{article}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=db049beb6c9d530215f9ed6ebf511e54}{Salazar}{S\bibinitperiod}{Gelasio}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{abd6b2bdee1772a88fa0cb529e9e1204}
      \strng{fullhash}{abd6b2bdee1772a88fa0cb529e9e1204}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Two maps with large representativity on one surface}
      \field{volume}{50}
      \field{year}{2005}
      \field{pages}{234\bibrangedash 245}
      \range{pages}{12}
    \endentry
    \entry{RS96}{article}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=40768e13c3b30ed467c5806300dafe79}{\v{S}ir\'{a}\v{n}}{\v{S}\bibinitperiod}{J.}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{49b0e26c95991b0deb23eebf50363858}
      \strng{fullhash}{49b0e26c95991b0deb23eebf50363858}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{1}
      \field{title}{The crossing number of {$K_{3,n}$} in a surface}
      \field{volume}{21}
      \field{year}{1996}
      \field{pages}{51\bibrangedash 54}
      \range{pages}{4}
    \endentry
    \entry{RT95}{article}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{97d8d3ecbaf9beb8fa49c9daf0d8c204}
      \strng{fullhash}{97d8d3ecbaf9beb8fa49c9daf0d8c204}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0179-5376}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{2}
      \field{title}{Intersections of curve systems and the crossing number of {$C_5\times C_5$}}
      \field{volume}{13}
      \field{year}{1995}
      \field{pages}{149\bibrangedash 159}
      \range{pages}{11}
    \endentry
    \entry{RT97}{article}{}
      \name{author}{2}{}{%
        {{hash=7cdf542467cb4536619492aa415fd90f}{Richter}{R\bibinitperiod}{R.\bibnamedelimi Bruce}{R\bibinitperiod\bibinitdelim B\bibinitperiod}{}{}{}{}}%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{97d8d3ecbaf9beb8fa49c9daf0d8c204}
      \strng{fullhash}{97d8d3ecbaf9beb8fa49c9daf0d8c204}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0002-9890}
      \field{journaltitle}{Amer. Math. Monthly}
      \field{number}{2}
      \field{title}{Relations between crossing numbers of complete and complete bipartite graphs}
      \field{volume}{104}
      \field{year}{1997}
      \field{pages}{131\bibrangedash 137}
      \range{pages}{7}
    \endentry
    \entry{R96}{article}{}
      \name{author}{1}{}{%
        {{hash=b69368285083606b095e0be80c6ba1f0}{Ringeisen}{R\bibinitperiod}{R.\bibnamedelimi D.}{R\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b69368285083606b095e0be80c6ba1f0}
      \strng{fullhash}{b69368285083606b095e0be80c6ba1f0}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0384-9864}
      \field{journaltitle}{Congr. Numer.}
      \field{note}{Surveys in graph theory (San Francisco, CA, 1995)}
      \field{title}{Two old extremal graph drawing conjectures: progress and perspectives}
      \field{volume}{115}
      \field{year}{1996}
      \field{pages}{91\bibrangedash 103}
      \range{pages}{13}
    \endentry
    \entry{RSP91}{article}{}
      \name{author}{3}{}{%
        {{hash=b69368285083606b095e0be80c6ba1f0}{Ringeisen}{R\bibinitperiod}{R.\bibnamedelimi D.}{R\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=039476229954bcdb39932ebb3aea6c25}{Stueckle}{S\bibinitperiod}{S.\bibnamedelimi K.}{S\bibinitperiod\bibinitdelim K\bibinitperiod}{}{}{}{}}%
        {{hash=1d307ba13d32516ad38c0d81105cd904}{Piazza}{P\bibinitperiod}{B.\bibnamedelimi L.}{B\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{489af05c793b00ceae977790288a3aff}
      \strng{fullhash}{489af05c793b00ceae977790288a3aff}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{Subgraphs and bounds on maximum crossings}
      \field{volume}{2}
      \field{year}{1991}
      \field{pages}{33\bibrangedash 46}
      \range{pages}{14}
    \endentry
    \entry{RB78}{article}{}
      \name{author}{2}{}{%
        {{hash=cc25925dfe51b2dd428cdaca283cfe50}{Ringeisen}{R\bibinitperiod}{Richard\bibnamedelima D.}{R\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=49ab73ee28ccce5f6876a1cdf8b22cdc}{Beineke}{B\bibinitperiod}{Lowell\bibnamedelima W.}{L\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{9d0f34135f2b743681c1da6792767b71}
      \strng{fullhash}{9d0f34135f2b743681c1da6792767b71}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0095-8956}
      \field{journaltitle}{J. Combin. Theory Ser. B}
      \field{number}{2}
      \field{title}{The crossing number of {$C_{3}\times C_{n}$}}
      \field{volume}{24}
      \field{year}{1978}
      \field{pages}{134\bibrangedash 136}
      \range{pages}{3}
    \endentry
    \entry{R81}{incollection}{}
      \name{author}{1}{}{%
        {{hash=4c5e94c512b5e999e49672c5f22784d4}{Ringel}{R\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {Wiley}%
      }
      \strng{namehash}{4c5e94c512b5e999e49672c5f22784d4}
      \strng{fullhash}{4c5e94c512b5e999e49672c5f22784d4}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{The theory and applications of graphs ({K}alamazoo, {M}ich., 1980)}
      \field{isbn}{0-471-08473-5}
      \field{title}{A nine color theorem for the torus and the {K}lein bottle}
      \field{year}{1981}
      \field{pages}{507\bibrangedash 515}
      \range{pages}{9}
    \endentry
    \entry{R64}{incollection}{}
      \name{author}{1}{}{%
        {{hash=4c5e94c512b5e999e49672c5f22784d4}{Ringel}{R\bibinitperiod}{G.}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Publ. House Czechoslovak Acad. Sci., Prague}%
      }
      \strng{namehash}{4c5e94c512b5e999e49672c5f22784d4}
      \strng{fullhash}{4c5e94c512b5e999e49672c5f22784d4}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Theory of {G}raphs and its {A}pplications ({P}roc. {S}ympos. {S}molenice, 1963)}
      \field{title}{Extremal problems in the theory of graphs}
      \field{year}{1964}
      \field{pages}{85\bibrangedash 90}
      \range{pages}{6}
    \endentry
    \entry{R65}{article}{}
      \name{author}{1}{}{%
        {{hash=473e5de0e84ed4336dfbc8b5ece88190}{Ringel}{R\bibinitperiod}{Gerhard}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{473e5de0e84ed4336dfbc8b5ece88190}
      \strng{fullhash}{473e5de0e84ed4336dfbc8b5ece88190}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5858}
      \field{journaltitle}{Abh. Math. Sem. Univ. Hamburg}
      \field{title}{Ein {S}echsfarbenproblem auf der {K}ugel}
      \field{volume}{29}
      \field{year}{1965}
      \field{pages}{107\bibrangedash 117}
      \range{pages}{11}
    \endentry
    \entry{R01}{article}{}
      \name{author}{1}{}{%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f509bfe1a48c68880d92147e47ba478}
      \strng{fullhash}{8f509bfe1a48c68880d92147e47ba478}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0012-365X}
      \field{journaltitle}{Discrete Math.}
      \field{number}{1-3}
      \field{title}{On the nonembeddability and crossing numbers of some toroidal graphs on the {K}lein bottle}
      \field{volume}{234}
      \field{year}{2001}
      \field{pages}{77\bibrangedash 88}
      \range{pages}{12}
    \endentry
    \entry{R03}{article}{}
      \name{author}{1}{}{%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f509bfe1a48c68880d92147e47ba478}
      \strng{fullhash}{8f509bfe1a48c68880d92147e47ba478}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{On the outerplanar crossing numbers of {$K_{m,n}$}}
      \field{volume}{39}
      \field{year}{2003}
      \field{pages}{16\bibrangedash 20}
      \range{pages}{5}
    \endentry
    \entry{R07b}{article}{}
      \name{author}{1}{}{%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f509bfe1a48c68880d92147e47ba478}
      \strng{fullhash}{8f509bfe1a48c68880d92147e47ba478}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1183-1278}
      \field{journaltitle}{Bull. Inst. Combin. Appl.}
      \field{title}{The biplanar crossing number of {$C^4_n$}}
      \field{volume}{49}
      \field{year}{2007}
      \field{pages}{79\bibrangedash 85}
      \range{pages}{7}
    \endentry
    \entry{R07}{article}{}
      \name{author}{1}{}{%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f509bfe1a48c68880d92147e47ba478}
      \strng{fullhash}{8f509bfe1a48c68880d92147e47ba478}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1034-4942}
      \field{journaltitle}{Australas. J. Combin.}
      \field{title}{The circular {$k$}-partite crossing number of {$K_{m,n}$}}
      \field{volume}{38}
      \field{year}{2007}
      \field{pages}{207\bibrangedash 210}
      \range{pages}{4}
    \endentry
    \entry{R93}{article}{}
      \name{author}{1}{}{%
        {{hash=8f509bfe1a48c68880d92147e47ba478}{Riskin}{R\bibinitperiod}{Adrian}{A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{8f509bfe1a48c68880d92147e47ba478}
      \strng{fullhash}{8f509bfe1a48c68880d92147e47ba478}
      \field{sortinit}{R}
      \field{sortinithash}{c7387613477035a752d935acfc3e3ea2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{6}
      \field{title}{The projective plane crossing number of {$C_3\times C_n$}}
      \field{volume}{17}
      \field{year}{1993}
      \field{pages}{683\bibrangedash 693}
      \range{pages}{11}
    \endentry
    \entry{S1881}{article}{}
      \name{author}{1}{}{%
        {{hash=02f2dd77193b1f1a31a2af95a22f4e79}{{Saalsch\"{u}tz}}{S\bibinitperiod}{Louis}{L\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {German}%
      }
      \list{publisher}{1}{%
        {Teubner, Berlin}%
      }
      \strng{namehash}{02f2dd77193b1f1a31a2af95a22f4e79}
      \strng{fullhash}{02f2dd77193b1f1a31a2af95a22f4e79}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{{Grunert Arch.}}
      \field{title}{{Anzahl der innern Diagonalschnitte eines Vierecks.}}
      \field{volume}{66}
      \field{year}{1881}
      \field{pages}{331\bibrangedash 332}
      \range{pages}{2}
    \endentry
    \entry{S69}{article}{}
      \name{author}{1}{}{%
        {{hash=d660d900972811058d5c46c761dd4afc}{Saaty}{S\bibinitperiod}{Thomas\bibnamedelima L.}{T\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d660d900972811058d5c46c761dd4afc}
      \strng{fullhash}{d660d900972811058d5c46c761dd4afc}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0160-1741}
      \field{journaltitle}{J. Res. Nat. Bur. Standards Sect. B}
      \field{title}{Symmetry and the crossing number for complete graphs}
      \field{volume}{73B}
      \field{year}{1969}
      \field{pages}{177\bibrangedash 186}
      \range{pages}{10}
    \endentry
    \entry{S64}{article}{}
      \name{author}{1}{}{%
        {{hash=d660d900972811058d5c46c761dd4afc}{Saaty}{S\bibinitperiod}{Thomas\bibnamedelima L.}{T\bibinitperiod\bibinitdelim L\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{d660d900972811058d5c46c761dd4afc}
      \strng{fullhash}{d660d900972811058d5c46c761dd4afc}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0027-8424}
      \field{journaltitle}{Proc. Nat. Acad. Sci. U.S.A.}
      \field{title}{The minimum number of intersections in complete graphs}
      \field{volume}{52}
      \field{year}{1964}
      \field{pages}{688\bibrangedash 690}
      \range{pages}{3}
    \endentry
    \entry{SL1926}{book}{}
      \name{author}{1}{}{%
        {{hash=62f77d23ee0ab585df5797ccf0988975}{Sainte-Lagu\"{e}}{S\bibinithyphendelim L\bibinitperiod}{Andr\'{e}}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {French}%
      }
      \list{publisher}{1}{%
        {Gauthier-Villars}%
      }
      \strng{namehash}{62f77d23ee0ab585df5797ccf0988975}
      \strng{fullhash}{62f77d23ee0ab585df5797ccf0988975}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{series}{M\'{e}morial des sciences math\'{e}matiques}
      \field{title}{{Les reseaux (ou graphes)}}
      \field{volume}{18}
      \field{year}{1926}
      \field{pages}{64}
      \range{pages}{1}
    \endentry
    \entry{SSS13}{article}{}
      \name{author}{3}{}{%
        {{hash=5ea403c39451e440474c3db6cb7d0051}{Satsangi}{S\bibinitperiod}{Dharna}{D\bibinitperiod}{}{}{}{}}%
        {{hash=a35025af88ee1511918232b34906489f}{Srivastava}{S\bibinitperiod}{Kamal}{K\bibinitperiod}{}{}{}{}}%
        {{hash=ba91dcc837a40bfba2398fd511d31d72}{Srivastava}{S\bibinitperiod}{Gursaran}{G\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Springer Berlin Heidelberg}%
      }
      \strng{namehash}{7d0b44599727a9a7dc7ef9ecf45c0495}
      \strng{fullhash}{7d0b44599727a9a7dc7ef9ecf45c0495}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1865-9284}
      \field{journaltitle}{Memetic Computing}
      \field{number}{4}
      \field{title}{${K}$-page crossing number minimization problem: An evaluation of heuristics and its solution using {GESAKP}}
      \field{volume}{5}
      \field{year}{2013}
      \field{pages}{255\bibrangedash 274}
      \range{pages}{20}
      \verb{doi}
      \verb 10.1007/s12293-013-0115-5
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/s12293-013-0115-5
      \endverb
    \endentry
    \entry{S21}{article}{}
      \name{author}{1}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{language}{1}{%
        {English}%
      }
      \list{publisher}{1}{%
        {Brown University, Providence, RI; University of Texas, Dallas, TX}%
      }
      \strng{namehash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \strng{fullhash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1526-1719}
      \field{journaltitle}{{J. Graph Algorithms Appl.}}
      \field{number}{1}
      \field{title}{Complexity of geometric $k$-planarity for fixed $k$}
      \field{volume}{25}
      \field{year}{2021}
      \field{pages}{29\bibrangedash 41}
      \range{pages}{13}
      \verb{doi}
      \verb 10.7155/jgaa.00548
      \endverb
      \verb{url}
      \verb https://doi.org/10.7155/jgaa.00548
      \endverb
    \endentry
    \entry{S10b}{incollection}{}
      \name{author}{1}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \strng{fullhash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Complexity of Some Geometric and Topological Problems}
      \field{volume}{5849}
      \field{year}{2010}
      \field{pages}{334\bibrangedash 344}
      \range{pages}{11}
    \endentry
    \entry{S18}{book}{}
      \name{author}{1}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {CRC Press, Boca Raton, FL}%
      }
      \strng{namehash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \strng{fullhash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{978-1-4987-5049-3}
      \field{series}{Discrete Mathematics and its Applications (Boca Raton)}
      \field{title}{Crossing numbers of graphs}
      \field{year}{2018}
      \field{pages}{xxvi+350}
      \range{pages}{-1}
    \endentry
    \entry{S14d}{incollection}{}
      \name{author}{1}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Heidelberg}%
      }
      \strng{namehash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \strng{fullhash}{20068bdc7ecbefd4ec6a948a2fa6ec5a}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Picking planar edges; or, drawing a graph with a planar subgraph}
      \field{volume}{8871}
      \field{year}{2014}
      \field{pages}{13\bibrangedash 24}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-662-45803-7_2
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-662-45803-7_2
      \endverb
    \endentry
    \entry{SSS08}{inproceedings}{}
      \name{author}{3}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=f36529fcfbbb2e0bc5087ee3adea66f0}{Sedgwick}{S\bibinitperiod}{Eric}{E\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{68693336e5c9f8032df59df55b23cc33}
      \strng{fullhash}{68693336e5c9f8032df59df55b23cc33}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 20th Canadian Conference on Computational Geometry}
      \field{title}{Computing {D}ehn Twists and Geometric Intersection Numbers in Polynomial Time}
      \field{year}{2008}
      \field{pages}{111\bibrangedash 114}
      \range{pages}{4}
    \endentry
    \entry{SSS03}{article}{}
      \name{author}{3}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=f36529fcfbbb2e0bc5087ee3adea66f0}{Sedgwick}{S\bibinitperiod}{Eric}{E\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{68693336e5c9f8032df59df55b23cc33}
      \strng{fullhash}{68693336e5c9f8032df59df55b23cc33}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Comput. System Sci.}
      \field{note}{Special issue on STOC2002 (Montreal, QC)}
      \field{number}{2}
      \field{title}{Recognizing string graphs in {NP}}
      \field{volume}{67}
      \field{year}{2003}
      \field{pages}{365\bibrangedash 380}
      \range{pages}{16}
    \endentry
    \entry{SS15}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=17972e6eea1a5476451a03fe25609fa0}{Stefankovic}{S\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=eafe8077197779b4592eec2e5d647511}{Giacomo}{G\bibinitperiod}{Emilio\bibnamedelima Di}{E\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=73aee614481d4bc018f38ffa4d43a239}{Lubiw}{L\bibinitperiod}{Anna}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{b8be5779425332a5bae1d5af45b46934}
      \strng{fullhash}{b8be5779425332a5bae1d5af45b46934}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing and Network Visualization - 23rd International Symposium, {GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers}
      \field{isbn}{978-3-319-27260-3}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{The Degenerate Crossing Number and Higher-Genus Embeddings}
      \field{volume}{9411}
      \field{year}{2015}
      \field{pages}{63\bibrangedash 74}
      \range{pages}{12}
      \verb{doi}
      \verb 10.1007/978-3-319-27261-0_6
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1007/978-3-319-27261-0_6
      \endverb
    \endentry
    \entry{SS13}{incollection}{}
      \name{author}{2}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer, Cham}%
      }
      \strng{namehash}{73f115457e11b7f59a6244c5055cffed}
      \strng{fullhash}{73f115457e11b7f59a6244c5055cffed}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Block Additivity of ${\ZN_2}$-Embeddings}
      \field{volume}{8242}
      \field{year}{2013}
      \field{pages}{185\bibrangedash 195}
      \range{pages}{11}
      \verb{doi}
      \verb 10.1007/978-3-319-03841-4_17
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/978-3-319-03841-4_17
      \endverb
    \endentry
    \entry{SS05}{article}{}
      \name{author}{2}{}{%
        {{hash=20068bdc7ecbefd4ec6a948a2fa6ec5a}{Schaefer}{S\bibinitperiod}{Marcus}{M\bibinitperiod}{}{}{}{}}%
        {{hash=a87c38d6eafdcdbdf6928b1f1b59e3ac}{\v{S}tefankovi\v{c}}{\v{S}\bibinitperiod}{Daniel}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{73f115457e11b7f59a6244c5055cffed}
      \strng{fullhash}{73f115457e11b7f59a6244c5055cffed}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Comput. System Sci.}
      \field{number}{2}
      \field{title}{Decidability of string graphs}
      \field{volume}{68}
      \field{year}{2004}
      \field{pages}{319\bibrangedash 334}
      \range{pages}{16}
    \endentry
    \entry{SU97}{book}{}
      \name{author}{2}{}{%
        {{hash=660fd8b3934e42033d782fd5610d8198}{Scheinerman}{S\bibinitperiod}{Edward\bibnamedelima R.}{E\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=3a172328ecb1e75dcb3a37736c88eaa6}{Ullman}{U\bibinitperiod}{Daniel\bibnamedelima H.}{D\bibinitperiod\bibinitdelim H\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {John Wiley \& Sons Inc.}%
      }
      \strng{namehash}{60a6934bfe3a7a57549e621bae8cc065}
      \strng{fullhash}{60a6934bfe3a7a57549e621bae8cc065}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{isbn}{0-471-17864-0}
      \field{series}{Wiley-Interscience Series in Discrete Mathematics and Optimization}
      \field{title}{Fractional graph theory}
      \field{year}{1997}
      \field{pages}{xviii+211}
      \range{pages}{-1}
    \endentry
    \entry{SW94}{article}{}
      \name{author}{2}{}{%
        {{hash=660fd8b3934e42033d782fd5610d8198}{Scheinerman}{S\bibinitperiod}{Edward\bibnamedelima R.}{E\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
        {{hash=b5af2d6711ac0f9093eed4f0ab2c3db3}{Wilf}{W\bibinitperiod}{Herbert\bibnamedelima S.}{H\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3ac1b030c04bc36ee43db4202c686b00}
      \strng{fullhash}{3ac1b030c04bc36ee43db4202c686b00}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0002-9890}
      \field{journaltitle}{Amer. Math. Monthly}
      \field{number}{10}
      \field{title}{The rectilinear crossing number of a complete graph and {S}ylvester's ``four point problem'' of geometric probability}
      \field{volume}{101}
      \field{year}{1994}
      \field{pages}{939\bibrangedash 943}
      \range{pages}{5}
    \endentry
    \entry{S90a}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=a601e338fe59f0bcb9d3d61a397708df}{Schnyder}{S\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {San Francisco, California, USA}%
      }
      \list{publisher}{2}{%
        {Society for Industrial}%
        {Applied Mathematics}%
      }
      \strng{namehash}{a601e338fe59f0bcb9d3d61a397708df}
      \strng{fullhash}{a601e338fe59f0bcb9d3d61a397708df}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms}
      \field{isbn}{0-89871-251-3}
      \field{series}{SODA '90}
      \field{title}{Embedding planar graphs on the grid}
      \field{year}{1990}
      \field{pages}{138\bibrangedash 148}
      \range{pages}{11}
    \endentry
    \entry{SSvH13}{article}{}
      \name{author}{3}{}{%
        {{hash=b80b40dd48760f3386fdca3797452b18}{Schulze}{S\bibinitperiod}{Christoph\bibnamedelima Daniel}{C\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
        {{hash=f2c4b63d0845b24cc8965045b5de8c39}{Sp\"{o}nemann}{S\bibinitperiod}{Miro}{M\bibinitperiod}{}{}{}{}}%
        {{hash=279338b41bd103d790f5a202e2b8b520}{Hanxleden}{H\bibinitperiod}{Reinhard}{R\bibinitperiod}{von}{v\bibinitperiod}{}{}}%
      }
      \strng{namehash}{ab66a1c1523460f10841872c3f6bf584}
      \strng{fullhash}{ab66a1c1523460f10841872c3f6bf584}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1045-926X}
      \field{journaltitle}{Journal of Visual Languages \& Computing}
      \field{title}{Drawing layered graphs with port constraints}
      \field{year}{2013}
      \verb{doi}
      \verb http://dx.doi.org/10.1016/j.jvlc.2013.11.005
      \endverb
      \verb{url}
      \verb http://www.sciencedirect.com/science/article/pii/S1045926X13000943
      \endverb
    \endentry
    \entry{S84}{article}{}
      \name{author}{1}{}{%
        {{hash=783ee2abdbbcf6faf73e7991aeccd9b0}{Schumacher}{S\bibinitperiod}{H.}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \strng{fullhash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5858}
      \field{journaltitle}{Abh. Math. Sem. Univ. Hamburg}
      \field{title}{Ein {$7$}-{F}arbensatz {$1$}-einbettbarer {G}raphen auf der projektiven {E}bene}
      \field{volume}{54}
      \field{year}{1984}
      \field{pages}{5\bibrangedash 14}
      \range{pages}{10}
    \endentry
    \entry{S90}{incollection}{}
      \name{author}{1}{}{%
        {{hash=783ee2abdbbcf6faf73e7991aeccd9b0}{Schumacher}{S\bibinitperiod}{H.}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Heidelberg}%
      }
      \list{publisher}{1}{%
        {Physica}%
      }
      \strng{namehash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \strng{fullhash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Topics in combinatorics and graph theory ({O}berwolfach, 1990)}
      \field{title}{On {$2$}-embeddable graphs}
      \field{year}{1990}
      \field{pages}{651\bibrangedash 661}
      \range{pages}{11}
    \endentry
    \entry{S86}{article}{}
      \name{author}{1}{}{%
        {{hash=783ee2abdbbcf6faf73e7991aeccd9b0}{Schumacher}{S\bibinitperiod}{H.}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \strng{fullhash}{783ee2abdbbcf6faf73e7991aeccd9b0}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-584X}
      \field{journaltitle}{Math. Nachr.}
      \field{title}{Zur {S}truktur {$1$}-planarer {G}raphen}
      \field{volume}{125}
      \field{year}{1986}
      \field{pages}{291\bibrangedash 300}
      \range{pages}{10}
    \endentry
    \entry{SSSV96a}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=29a05a3c2d15bc91aa6dc81a504040ac}{S\'{y}kora}{S\bibinitperiod}{O.}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=be23e4f1218adaaaa43f341c6c6e4996}{Vr\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{2dfad680274546e2526c4502c7d6c604}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0001-8708}
      \field{journaltitle}{Adv. Math.}
      \field{number}{2}
      \field{title}{The crossing number of a graph on a compact {$2$}-manifold}
      \field{volume}{123}
      \field{year}{1996}
      \field{pages}{105\bibrangedash 119}
      \range{pages}{15}
    \endentry
    \entry{SSSV03}{incollection}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=50c196769a38908678dccbb87b4077be}{Sz\'{e}kely}{S\bibinitperiod}{Laszlo\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{d7b5ae0b468cbce4320354e75de298b7}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Computing and combinatorics}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Bounds for convex crossing numbers}
      \field{volume}{2697}
      \field{year}{2003}
      \field{pages}{487\bibrangedash 495}
      \range{pages}{9}
    \endentry
    \entry{SSSV04}{incollection}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=50c196769a38908678dccbb87b4077be}{Sz\'{e}kely}{S\bibinitperiod}{Laszlo\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Providence, RI}%
      }
      \list{publisher}{1}{%
        {Amer. Math. Soc.}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{d7b5ae0b468cbce4320354e75de298b7}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Towards a theory of geometric graphs}
      \field{series}{Contemp. Math.}
      \field{title}{The gap between crossing numbers and convex crossing numbers}
      \field{volume}{342}
      \field{year}{2004}
      \field{pages}{249\bibrangedash 258}
      \range{pages}{10}
    \endentry
    \entry{SSSV97}{incollection}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=be23e4f1218adaaaa43f341c6c6e4996}{Vr\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Budapest}%
      }
      \list{publisher}{1}{%
        {J\'{a}nos Bolyai Math. Soc.}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{8f6adf2cdb807c0ea10c41361fd183e9}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Intuitive geometry ({B}udapest, 1995)}
      \field{series}{Bolyai Soc. Math. Stud.}
      \field{title}{Crossing numbers: bounds and applications}
      \field{volume}{6}
      \field{year}{1997}
      \field{pages}{179\bibrangedash 206}
      \range{pages}{28}
    \endentry
    \entry{SSSV00}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{2881febb4c755b9ecab09808b5849e47}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0304-3975}
      \field{journaltitle}{Theoret. Comput. Sci.}
      \field{note}{Algorithms for future technologies (Saarbr\"{u}cken, 1997)}
      \field{number}{2}
      \field{title}{A new lower bound for the bipartite crossing number with applications}
      \field{volume}{245}
      \field{year}{2000}
      \field{pages}{281\bibrangedash 294}
      \range{pages}{14}
    \endentry
    \entry{SSSV95}{incollection}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{2881febb4c755b9ecab09808b5849e47}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph-theoretic concepts in computer science ({H}errsching, 1994)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{Book embeddings and crossing numbers}
      \field{volume}{903}
      \field{year}{1995}
      \field{pages}{256\bibrangedash 268}
      \range{pages}{13}
    \endentry
    \entry{SSSV01}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{2881febb4c755b9ecab09808b5849e47}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0097-5397}
      \field{journaltitle}{SIAM J. Comput.}
      \field{number}{6}
      \field{title}{On bipartite drawings and the linear arrangement problem}
      \field{volume}{30}
      \field{year}{2001}
      \field{pages}{1773\bibrangedash 1789}
      \range{pages}{17}
      \verb{doi}
      \verb 10.1137/S0097539797331671
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1137/S0097539797331671
      \endverb
    \endentry
    \entry{SSSV07}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{2881febb4c755b9ecab09808b5849e47}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{number}{9}
      \field{title}{On {$k$}-planar crossing numbers}
      \field{volume}{155}
      \field{year}{2007}
      \field{pages}{1106\bibrangedash 1115}
      \range{pages}{10}
    \endentry
    \entry{SSSV96b}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=29a05a3c2d15bc91aa6dc81a504040ac}{S\'{y}kora}{S\bibinitperiod}{O.}{O\bibinitperiod}{}{}{}{}}%
        {{hash=be23e4f1218adaaaa43f341c6c6e4996}{Vr\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{5002830279845bb1bb9c04ba7b2a221e}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0178-4617}
      \field{journaltitle}{Algorithmica}
      \field{number}{1}
      \field{title}{Drawings of graphs on surfaces with few crossings}
      \field{volume}{16}
      \field{year}{1996}
      \field{pages}{118\bibrangedash 131}
      \range{pages}{14}
    \endentry
    \entry{SSSV96}{article}{}
      \name{author}{4}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{999b5bee62298db81736791c69f8da19}
      \strng{fullhash}{7a2b3e1afd74f2f389a2b0ec8f02e098}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{4}
      \field{title}{The book crossing number of a graph}
      \field{volume}{21}
      \field{year}{1996}
      \field{pages}{413\bibrangedash 424}
      \range{pages}{12}
    \endentry
    \entry{SV99}{incollection}{}
      \name{author}{2}{}{%
        {{hash=d2d7c575cbdc3d5894109b0b3ff41036}{Shahrokhi}{S\bibinitperiod}{Farhad}{F\bibinitperiod}{}{}{}{}}%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{cfff0b0570f154bcf6382889ffbe5c20}
      \strng{fullhash}{cfff0b0570f154bcf6382889ffbe5c20}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph drawing (\v{S}ti\v{r}\'{\i{}}n {C}astle, 1999)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{On $3$-layer crossings and pseudo arrangements}
      \field{volume}{1731}
      \field{year}{1999}
      \field{pages}{225\bibrangedash 231}
      \range{pages}{7}
    \endentry
    \entry{SZ19}{article}{}
      \name{author}{2}{}{%
        {{hash=146e73dcad720f2e84a6eb240be4c8fe}{Shavali}{S\bibinitperiod}{Alireza}{A\bibinitperiod}{}{}{}{}}%
        {{hash=5e534068d4174a3f5886dbd15831a306}{Zarrabi-Zadeh}{Z\bibinithyphendelim Z\bibinitperiod}{Hamid}{H\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b7755fc7a897eb02b96d98c0430390a9}
      \strng{fullhash}{b7755fc7a897eb02b96d98c0430390a9}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.CG}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{11}
      \field{note}{\arxiv{1911.06403} (last accessed 11/21/2019)}
      \field{title}{New Bounds on $k$-Planar Crossing Numbers}
      \field{year}{2019}
      \verb{eprint}
      \verb 1911.06403
      \endverb
    \endentry
    \entry{S71}{misc}{}
      \name{author}{1}{}{%
        {{hash=0d8129ea7aaac9a2a3f86eb1a2636b55}{Singer}{S\bibinitperiod}{David\bibnamedelima A.}{D\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0d8129ea7aaac9a2a3f86eb1a2636b55}
      \strng{fullhash}{0d8129ea7aaac9a2a3f86eb1a2636b55}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Manuscript at \url{http://www.cwru.edu/artsci/math/singer/publish/Rectilinear_crossings.pdf} (last accessed 1/9/2013)}
      \field{title}{The Rectilinear Crossing Number of Certain Graphs}
      \field{year}{1971}
    \endentry
    \entry{S04x}{misc}{}
      \name{author}{1}{}{%
        {{hash=2e7ee72274be82b6e2cc177ae6dc42f4}{Singmaster}{S\bibinitperiod}{David}{D\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{2e7ee72274be82b6e2cc177ae6dc42f4}
      \strng{fullhash}{2e7ee72274be82b6e2cc177ae6dc42f4}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{8}
      \field{title}{Sources in Recreational Mathematics. {A}n Annotated Bibliography}
      \field{year}{2004}
      \verb{url}
      \verb http://www.g4g4.com/MyCD5/SOURCES
      \endverb
    \endentry
    \entry{ST99}{inproceedings}{}
      \name{author}{2}{}{%
        {{hash=a406d9c8cfc028e82804e64058f5b153}{Six}{S\bibinitperiod}{Janet\bibnamedelima M.}{J\bibinitperiod\bibinitdelim M\bibinitperiod}{}{}{}{}}%
        {{hash=47522b07e88f2e0da39c67bb0caecd7a}{Tollis}{T\bibinitperiod}{Ioannis\bibnamedelima G.}{I\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{2}{}{%
        {{hash=5a0b95fef2629a33091ac55a4ff5f1ed}{Goodrich}{G\bibinitperiod}{Michael\bibnamedelima T.}{M\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
        {{hash=ac1785ca40bcf2d428c72bb726294005}{McGeoch}{M\bibinitperiod}{Catherine\bibnamedelima C.}{C\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{0cba1f7ad875fe3b0dac23ee06aabb2d}
      \strng{fullhash}{0cba1f7ad875fe3b0dac23ee06aabb2d}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, {MD}, {USA}, January 15-16, 1999, Selected Papers}
      \field{isbn}{3-540-66227-8}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Circular Drawings of Biconnected Graphs}
      \field{volume}{1619}
      \field{year}{1999}
      \field{pages}{57\bibrangedash 73}
      \range{pages}{17}
    \endentry
    \entry{S14b}{thesis}{}
      \name{author}{1}{}{%
        {{hash=67f372f99732ef063fdace1193ca3106}{Sparks}{S\bibinitperiod}{Athena\bibnamedelima C.}{A\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {California State University}%
      }
      \list{location}{1}{%
        {Northridge}%
      }
      \strng{namehash}{67f372f99732ef063fdace1193ca3106}
      \strng{fullhash}{67f372f99732ef063fdace1193ca3106}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{05}
      \field{title}{The Cylindrical Crossing Number of the Complete Bipartite Graph}
      \field{type}{mathesis}
      \field{year}{2014}
    \endentry
    \entry{S04b}{incollection}{}
      \name{author}{1}{}{%
        {{hash=e619cad5fdae4ea4b7283dddb36fb04a}{Spencer}{S\bibinitperiod}{Joel}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Amer. Math. Soc., Providence, RI}%
      }
      \strng{namehash}{e619cad5fdae4ea4b7283dddb36fb04a}
      \strng{fullhash}{e619cad5fdae4ea4b7283dddb36fb04a}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Towards a theory of geometric graphs}
      \field{series}{Contemp. Math.}
      \field{title}{The biplanar crossing number of the random graph}
      \field{volume}{342}
      \field{year}{2004}
      \field{pages}{269\bibrangedash 271}
      \range{pages}{3}
      \verb{doi}
      \verb 10.1090/conm/342/06147
      \endverb
      \verb{url}
      \verb https://doi.org/10.1090/conm/342/06147
      \endverb
    \endentry
    \entry{ST02}{article}{}
      \name{author}{2}{}{%
        {{hash=e619cad5fdae4ea4b7283dddb36fb04a}{Spencer}{S\bibinitperiod}{Joel}{J\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6f84b5beacf47fe87ada28939b58b6c7}
      \strng{fullhash}{6f84b5beacf47fe87ada28939b58b6c7}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1042-9832}
      \field{journaltitle}{Random Structures Algorithms}
      \field{note}{Random structures and algorithms (Poznan, 2001)}
      \field{number}{3-4}
      \field{title}{Crossing numbers of random graphs}
      \field{volume}{21}
      \field{year}{2002}
      \field{pages}{347\bibrangedash 358}
      \range{pages}{12}
    \endentry
    \entry{S12}{article}{}
      \name{author}{1}{}{%
        {{hash=40b609e545a261ca789328fe860ef6e0}{Stallmann}{S\bibinitperiod}{Matthias\bibnamedelima F.}{M\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York, NY, USA}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{40b609e545a261ca789328fe860ef6e0}
      \strng{fullhash}{40b609e545a261ca789328fe860ef6e0}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1084-6654}
      \field{journaltitle}{J. Exp. Algorithmics}
      \field{month}{07}
      \field{number}{1}
      \field{title}{A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study}
      \field{volume}{17}
      \field{year}{2012}
      \field{pages}{1.3:1.1\bibrangedash 1.3:1.30}
      \range{pages}{-1}
    \endentry
    \entry{SG10}{report}{}
      \name{author}{2}{}{%
        {{hash=40b609e545a261ca789328fe860ef6e0}{Stallmann}{S\bibinitperiod}{Matthias\bibnamedelima F.}{M\bibinitperiod\bibinitdelim F\bibinitperiod}{}{}{}{}}%
        {{hash=d911dc0980eee427099fd8a37bc58968}{Gupta}{G\bibinitperiod}{Saurabh}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {North Carolina State University}%
      }
      \strng{namehash}{9236e5ae0e40c27a52480a42c688e013}
      \strng{fullhash}{9236e5ae0e40c27a52480a42c688e013}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{month}{06}
      \field{number}{TR-2010-13}
      \field{title}{Bottleneck Crossing Minimization in Layered Graphs}
      \field{type}{techreport}
      \field{year}{2010}
    \endentry
    \entry{S1893}{book}{}
      \name{author}{1}{}{%
        {{hash=ef8b9e14340b95ce5c85c5db243c2d1c}{Staudacher}{S\bibinitperiod}{H.}{H\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {J. Maier}%
      }
      \strng{namehash}{ef8b9e14340b95ce5c85c5db243c2d1c}
      \strng{fullhash}{ef8b9e14340b95ce5c85c5db243c2d1c}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Lehrbuch der Kombinatorik}
      \field{year}{1893}
    \endentry
    \entry{S23}{article}{}
      \name{author}{1}{}{%
        {{hash=e5bde43fcb74005b3dfe55b9633388b6}{Steinitz}{S\bibinitperiod}{Ernst}{E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e5bde43fcb74005b3dfe55b9633388b6}
      \strng{fullhash}{e5bde43fcb74005b3dfe55b9633388b6}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0025-5874}
      \field{journaltitle}{Math. Z.}
      \field{number}{1}
      \field{title}{\"{U}ber die {M}aximalzahl der {D}oppelpunkte bei ebenen {P}olygonen von gerader {S}eitenzahl}
      \field{volume}{17}
      \field{year}{1923}
      \field{pages}{116\bibrangedash 129}
      \range{pages}{14}
    \endentry
    \entry{SRT21}{article}{}
      \name{author}{3}{}{%
        {{hash=63c12b2310d4bdfb566c91d2995220c7}{Sudermann-Merx}{S\bibinithyphendelim M\bibinitperiod}{Nathan}{N\bibinitperiod}{}{}{}{}}%
        {{hash=dfa4f8a824d0dcd9cdf8d71c4f5757c1}{Rebennack}{R\bibinitperiod}{Steffen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=e48e52df0b526b0757e8cd6cee38e64d}{Timpe}{T\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3a200fa7b0b50e7773838b254af6d8de}
      \strng{fullhash}{3a200fa7b0b50e7773838b254af6d8de}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Production and Operations Management}
      \field{note}{Available at \url{https://onlinelibrary.wiley.com/doi/pdf/10.1111/poms.13441} (last accessed 4/21/2021)}
      \field{number}{n/a}
      \field{title}{Crossing Minimal Edge-Constrained Layout Planning using Benders Decomposition}
      \field{volume}{n/a}
      \field{year}{2021}
      \verb{doi}
      \verb https://doi.org/10.1111/poms.13441
      \endverb
      \verb{eprint}
      \verb https://onlinelibrary.wiley.com/doi/pdf/10.1111/poms.13441
      \endverb
      \verb{url}
      \verb https://onlinelibrary.wiley.com/doi/abs/10.1111/poms.13441
      \endverb
    \endentry
    \entry{STT81}{article}{}
      \name{author}{3}{}{%
        {{hash=72e05a038b3a246a311dd546e836ca9d}{Sugiyama}{S\bibinitperiod}{Kozo}{K\bibinitperiod}{}{}{}{}}%
        {{hash=13869ab621da9122924767b3bd329afc}{Tagawa}{T\bibinitperiod}{Sh\^{o}jir\^{o}}{S\bibinitperiod}{}{}{}{}}%
        {{hash=85f80734a0bff83c7d33cd294646060f}{Toda}{T\bibinitperiod}{Mitsuhiko}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{ac05f067bfaf34fae95ee02710a22c78}
      \strng{fullhash}{ac05f067bfaf34fae95ee02710a22c78}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0018-9472}
      \field{journaltitle}{IEEE Trans. Systems Man Cybernet.}
      \field{number}{2}
      \field{title}{Methods for visual understanding of hierarchical system structures}
      \field{volume}{11}
      \field{year}{1981}
      \field{pages}{109\bibrangedash 125}
      \range{pages}{17}
    \endentry
    \entry{S09}{misc}{}
      \name{author}{1}{}{%
        {{hash=30d52466e3a1992147b3efa2df226338}{Swamy}{S\bibinitperiod}{Chaitanya}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{30d52466e3a1992147b3efa2df226338}
      \strng{fullhash}{30d52466e3a1992147b3efa2df226338}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{Homework Assignment at \url{http://www.math.uwaterloo.ca/~cswamy/courses/co652/as3.pdf} (last accessed 1/9/2013)}
      \field{title}{{CO}452/652: Integer Programming}
      \field{year}{2009}
    \endentry
    \entry{S04}{article}{}
      \name{author}{1}{}{%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \strng{fullhash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Discrete Math.}
      \field{number}{1-3}
      \field{title}{A successful concept for measuring non-planarity of graphs: the crossing number}
      \field{volume}{276}
      \field{year}{2004}
      \field{pages}{331\bibrangedash 352}
      \range{pages}{22}
    \endentry
    \entry{S08}{article}{}
      \name{author}{1}{}{%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \strng{fullhash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1855-3966}
      \field{journaltitle}{Ars Math. Contemp.}
      \field{number}{1}
      \field{title}{An optimality criterion for the crossing number}
      \field{volume}{1}
      \field{year}{2008}
      \field{pages}{32\bibrangedash 37}
      \range{pages}{6}
    \endentry
    \entry{S97}{article}{}
      \name{author}{1}{}{%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \strng{fullhash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0963-5483}
      \field{journaltitle}{Combin. Probab. Comput.}
      \field{number}{3}
      \field{title}{Crossing numbers and hard {Erd\H{o}s} problems in discrete geometry}
      \field{volume}{6}
      \field{year}{1997}
      \field{pages}{353\bibrangedash 358}
      \range{pages}{6}
      \verb{doi}
      \verb 10.1017/S0963548397002976
      \endverb
      \verb{url}
      \verb https://doi.org/10.1017/S0963548397002976
      \endverb
    \endentry
    \entry{S05}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{4}{}{%
        {{hash=2c499f72f0af368057aef95edf047cb4}{Vojt\'{a}s}{V\bibinitperiod}{Peter}{P\bibinitperiod}{}{}{}{}}%
        {{hash=7567c396e91b1adb862bedaa392b8890}{Bielikov\'{a}}{B\bibinitperiod}{M\'{a}ria}{M\bibinitperiod}{}{}{}{}}%
        {{hash=291c274ef095dfc3349c7af3af690bdf}{Charron-Bost}{C\bibinithyphendelim B\bibinitperiod}{Bernadette}{B\bibinitperiod}{}{}{}{}}%
        {{hash=d7c0e351351b402042a8e619b6248775}{S\'{y}kora}{S\bibinitperiod}{Ondrej}{O\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \strng{fullhash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{{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}
      \field{isbn}{3-540-24302-X}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Progress on Crossing Number Problems}
      \field{volume}{3381}
      \field{year}{2005}
      \field{pages}{53\bibrangedash 61}
      \range{pages}{9}
    \endentry
    \entry{S16}{incollection}{}
      \name{author}{1}{}{%
        {{hash=85b3bc2cb73cccbfb516c422968f0ec2}{Sz\'{e}kely}{S\bibinitperiod}{L\'{a}szl\'{o}\bibnamedelima A.}{L\bibinitperiod\bibinitdelim A\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=720430399401329dae544db6fd582303}{Gera}{G\bibinitperiod}{Ralucca}{R\bibinitperiod}{}{}{}{}}%
        {{hash=f42f880b46ef17583553a3db8adb8442}{Hedetniemi}{H\bibinitperiod}{Stephen}{S\bibinitperiod}{}{}{}{}}%
        {{hash=75ac25e5c8c0b9a77864e68f44120a10}{Larson}{L\bibinitperiod}{Craig}{C\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \strng{fullhash}{85b3bc2cb73cccbfb516c422968f0ec2}
      \field{sortinit}{S}
      \field{sortinithash}{fd1e7c5ab79596b13dbbb67f8d70fb5a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{abstract}{In this chapter, we explore the history and the status of the Zarankiewicz crossing number conjecture and the Hill crossing number conjecture, on drawing complete bipartite and complete graphs in the plane with a minimum number of edge crossings. We discuss analogous problems on other surfaces and in different models of drawing.}
      \field{booktitle}{Graph Theory: Favorite Conjectures and Open Problems - 1}
      \field{isbn}{978-3-319-31940-7}
      \field{title}{Tur\'{a}n's {B}rick {F}actory Problem: The Status of the Conjectures of {Z}arankiewicz and {H}ill}
      \field{year}{2016}
      \field{pages}{211\bibrangedash 230}
      \range{pages}{20}
      \verb{doi}
      \verb 10.1007/978-3-319-31940-7_13
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/978-3-319-31940-7_13
      \endverb
    \endentry
    \entry{T1877}{article}{}
      \name{author}{1}{}{%
        {{hash=4e57a0727b7baf48ed5ad08e8b75082a}{Tait}{T\bibinitperiod}{Peter\bibnamedelima Guthrie}{P\bibinitperiod\bibinitdelim G\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {MacMillan}%
      }
      \strng{namehash}{4e57a0727b7baf48ed5ad08e8b75082a}
      \strng{fullhash}{4e57a0727b7baf48ed5ad08e8b75082a}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Messenger of Mathematics}
      \field{title}{Some elementary properties of closed plane curves}
      \field{year}{1877}
      \field{pages}{132\bibrangedash 133}
      \range{pages}{2}
    \endentry
    \entry{T13?}{book}{}
      \name{editor}{1}{}{%
        {{hash=73002fbcaa8fe0ee76011401f23f2ab3}{Tamassia}{T\bibinitperiod}{Roberto}{R\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{2}{%
        {Chapman}%
        {Hall/CRC}%
      }
      \strng{namehash}{73002fbcaa8fe0ee76011401f23f2ab3}
      \strng{fullhash}{73002fbcaa8fe0ee76011401f23f2ab3}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{editor}
      \field{labeltitlesource}{title}
      \field{isbn}{1584884126}
      \field{series}{Discrete Mathematics and Its Applications}
      \field{title}{Handbook of Graph Drawing and Visualization}
      \field{year}{2013}
    \endentry
    \entry{TT16}{article}{}
      \name{author}{2}{}{%
        {{hash=38b1983eac7b0aae3a0501deee1f1bb6}{Tanaka}{T\bibinitperiod}{Hiroyuki}{H\bibinitperiod}{}{}{}{}}%
        {{hash=d3a9a88fe815afd553bccee1f2173664}{Teragaito}{T\bibinitperiod}{Masakazu}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{77a54280f23580545293d76173515ae5}
      \strng{fullhash}{77a54280f23580545293d76173515ae5}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1674-5647}
      \field{journaltitle}{Commun. Math. Res.}
      \field{number}{1}
      \field{title}{Triple crossing numbers of graphs}
      \field{volume}{32}
      \field{year}{2016}
      \field{pages}{1\bibrangedash 38}
      \range{pages}{38}
    \endentry
    \entry{T07a}{misc}{}
      \name{author}{1}{}{%
        {{hash=4cea0d7ce90ed017dfa21b4cee6c72e9}{Tao}{T\bibinitperiod}{Terence}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4cea0d7ce90ed017dfa21b4cee6c72e9}
      \strng{fullhash}{4cea0d7ce90ed017dfa21b4cee6c72e9}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{\url{http://terrytao.wordpress.com/2007/09/18/the-crossing-number-inequality/} (last accessed 2014/4/18)}
      \field{title}{The crossing number inequality}
    \endentry
    \entry{TV06}{book}{}
      \name{author}{2}{}{%
        {{hash=4cea0d7ce90ed017dfa21b4cee6c72e9}{Tao}{T\bibinitperiod}{Terence}{T\bibinitperiod}{}{}{}{}}%
        {{hash=8ad506863f61cad43fe4db578d9cdf42}{Vu}{V\bibinitperiod}{Van}{V\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cambridge}%
      }
      \list{publisher}{1}{%
        {Cambridge University Press}%
      }
      \strng{namehash}{ab4b669a69417d05d359c12ef40d16ef}
      \strng{fullhash}{ab4b669a69417d05d359c12ef40d16ef}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{series}{Cambridge Studies in Advanced Mathematics}
      \field{title}{Additive combinatorics}
      \field{volume}{105}
      \field{year}{2006}
    \endentry
    \entry{TT07}{article}{}
      \name{author}{2}{}{%
        {{hash=a20f49fbb356059ee203950b7aebbfe4}{Tardos}{T\bibinitperiod}{G\'{a}bor}{G\bibinitperiod}{}{}{}{}}%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{6eee827ac7069a0b3dee496bb45ac764}
      \strng{fullhash}{6eee827ac7069a0b3dee496bb45ac764}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0895-4801}
      \field{journaltitle}{SIAM J. Discrete Math.}
      \field{number}{3}
      \field{title}{Crossing stars in topological graphs}
      \field{volume}{21}
      \field{year}{2007}
      \field{pages}{737\bibrangedash 749}
      \range{pages}{13}
    \endentry
    \entry{T11}{misc}{}
      \name{author}{1}{}{%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{946998be3560a761b884674205be3f56}
      \strng{fullhash}{946998be3560a761b884674205be3f56}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{howpublished}{Personal communication}
      \field{month}{11}
      \field{year}{2011}
    \endentry
    \entry{T88}{article}{}
      \name{author}{1}{}{%
        {{hash=946998be3560a761b884674205be3f56}{Thomassen}{T\bibinitperiod}{Carsten}{C\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{946998be3560a761b884674205be3f56}
      \strng{fullhash}{946998be3560a761b884674205be3f56}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{3}
      \field{title}{Rectilinear drawings of graphs}
      \field{volume}{12}
      \field{year}{1988}
      \field{pages}{335\bibrangedash 341}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1002/jgt.3190120306
      \endverb
      \verb{url}
      \verb http://dx.doi.org/10.1002/jgt.3190120306
      \endverb
    \endentry
    \entry{T00}{thesis}{}
      \name{author}{1}{}{%
        {{hash=c39d5a41a3065c85279ce8110c9127f6}{Th\"{u}rmann}{T\bibinitperiod}{Christian}{C\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {Technischen Universit\"{a}t Braunschweig}%
      }
      \list{location}{1}{%
        {Germany}%
      }
      \strng{namehash}{c39d5a41a3065c85279ce8110c9127f6}
      \strng{fullhash}{c39d5a41a3065c85279ce8110c9127f6}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{{Minimale Anzahl von Kanten mit wenigen Kreuzungen in geradlinigen Darstellungen des vollst\"{a}ndigen Graphen}}
      \field{type}{phdthesis}
      \field{year}{2000}
    \endentry
    \entry{T12}{incollection}{}
      \name{author}{1}{}{%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=731ceb2118937ceadfefb82b48b5b1f2}{Pach}{P\bibinitperiod}{J\'{a}nos}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{a1488958fb0e40a1c1f690a320553ce7}
      \strng{fullhash}{a1488958fb0e40a1c1f690a320553ce7}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Thirty Essays on Geometric Graph Theory}
      \field{isbn}{978-1-4614-0109-4}
      \field{title}{A better bound for the pair-crossing number}
      \field{year}{2012}
      \field{pages}{563\bibrangedash 567}
      \range{pages}{5}
    \endentry
    \entry{T07}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=0b84ce73ece0dc3e485cc33c86241da4}{Bose}{B\bibinitperiod}{Prosenjit}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Carleton University, Ottawa, Canada}%
      }
      \strng{namehash}{a1488958fb0e40a1c1f690a320553ce7}
      \strng{fullhash}{a1488958fb0e40a1c1f690a320553ce7}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada}
      \field{isbn}{978-0-7709-0520-0}
      \field{title}{Note on the Pair-Crossing Number and the Odd-Crossing Number}
      \field{year}{2007}
      \field{pages}{3\bibrangedash 6}
      \range{pages}{4}
    \endentry
    \entry{T08}{article}{}
      \name{author}{1}{}{%
        {{hash=a1488958fb0e40a1c1f690a320553ce7}{T\'{o}th}{T\bibinitperiod}{G\'{e}za}{G\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a1488958fb0e40a1c1f690a320553ce7}
      \strng{fullhash}{a1488958fb0e40a1c1f690a320553ce7}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Discrete Comput. Geom.}
      \field{number}{4}
      \field{title}{Note on the Pair-crossing Number and the Odd-crossing Number}
      \field{volume}{39}
      \field{year}{2008}
      \field{pages}{791\bibrangedash 799}
      \range{pages}{9}
    \endentry
    \entry{T06}{book}{}
      \name{author}{1}{}{%
        {{hash=c0987a7215e80c218ce9b0079aa3eb03}{Tucker}{T\bibinitperiod}{Alan}{A\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {New York}%
      }
      \list{publisher}{1}{%
        {John Wiley \& Sons Inc.}%
      }
      \strng{namehash}{c0987a7215e80c218ce9b0079aa3eb03}
      \strng{fullhash}{c0987a7215e80c218ce9b0079aa3eb03}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{Fifth}
      \field{title}{Applied combinatorics}
      \field{year}{2006}
      \field{pages}{496}
      \range{pages}{1}
    \endentry
    \entry{T77}{article}{}
      \name{author}{1}{}{%
        {{hash=f4ee93efcace35c40df58fa6a8eb26ba}{Tur\'{a}n}{T\bibinitperiod}{Paul}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Wiley Subscription Services, Inc., A Wiley Company}%
      }
      \strng{namehash}{f4ee93efcace35c40df58fa6a8eb26ba}
      \strng{fullhash}{f4ee93efcace35c40df58fa6a8eb26ba}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1097-0118}
      \field{journaltitle}{Journal of Graph Theory}
      \field{number}{1}
      \field{title}{A note of welcome}
      \field{volume}{1}
      \field{year}{1977}
      \field{pages}{7\bibrangedash 9}
      \range{pages}{3}
    \endentry
    \entry{T70}{article}{}
      \name{author}{1}{}{%
        {{hash=7278942ec0c9d6a0fdb0035dc9f3aaf4}{Tutte}{T\bibinitperiod}{William\bibnamedelima T.}{W\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{7278942ec0c9d6a0fdb0035dc9f3aaf4}
      \strng{fullhash}{7278942ec0c9d6a0fdb0035dc9f3aaf4}
      \field{sortinit}{T}
      \field{sortinithash}{423d138a005a533b47e6475e39378bf2}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{J. Combinatorial Theory}
      \field{title}{Toward a theory of crossing numbers}
      \field{volume}{8}
      \field{year}{1970}
      \field{pages}{45\bibrangedash 53}
      \range{pages}{9}
    \endentry
    \entry{U88}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=dc955c5de33569474be624b1762cb7eb}{Unger}{U\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{dc955c5de33569474be624b1762cb7eb}
      \strng{fullhash}{dc955c5de33569474be624b1762cb7eb}
      \field{sortinit}{U}
      \field{sortinithash}{8145509bd2718876fc77d31fd2cde117}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{S{TACS} 88 ({B}ordeaux, 1988)}
      \field{series}{Lecture Notes in Comput. Sci.}
      \field{title}{On the {$k$}-colouring of circle-graphs}
      \field{volume}{294}
      \field{year}{1988}
      \field{pages}{61\bibrangedash 72}
      \range{pages}{12}
    \endentry
    \entry{U92}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=dc955c5de33569474be624b1762cb7eb}{Unger}{U\bibinitperiod}{Walter}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cachan, France}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{dc955c5de33569474be624b1762cb7eb}
      \strng{fullhash}{dc955c5de33569474be624b1762cb7eb}
      \field{sortinit}{U}
      \field{sortinithash}{8145509bd2718876fc77d31fd2cde117}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{9th Annual Symposium on Theoretical Aspects of Computer Science}
      \field{month}{13--15~02}
      \field{series}{lncs}
      \field{title}{The Complexity of Colouring Circle Graphs (Extended Abstract)}
      \field{volume}{577}
      \field{year}{1992}
      \field{pages}{389\bibrangedash 400}
      \range{pages}{12}
    \endentry
    \entry{U55}{article}{}
      \name{author}{1}{}{%
        {{hash=cdf2531a14ffbebc7c3bcae58c88dd7e}{Urbanik}{U\bibinitperiod}{K.}{K\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Soci\'{e}t\'{e} Polonaise de Math\'{e}mathique}%
      }
      \strng{namehash}{cdf2531a14ffbebc7c3bcae58c88dd7e}
      \strng{fullhash}{cdf2531a14ffbebc7c3bcae58c88dd7e}
      \field{sortinit}{U}
      \field{sortinithash}{8145509bd2718876fc77d31fd2cde117}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Comptes Rendus}
      \field{title}{Solution du probl\`{e}me pos\'{e} par {P}. {T}ur\'{a}n}
      \field{year}{1955}
      \field{pages}{200\bibrangedash 201}
      \range{pages}{2}
    \endentry
    \entry{UW20}{article}{}
      \name{author}{2}{}{%
        {{hash=a536627545dd615343057ded9076fdbb}{Urschel}{U\bibinitperiod}{John\bibnamedelima C.}{J\bibinitperiod\bibinitdelim C\bibinitperiod}{}{}{}{}}%
        {{hash=b87ac50ad1b8642d82157d1f7aeb6ff6}{Wellens}{W\bibinitperiod}{Jake}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1054e83cd9f989f4a355dc029e180704}
      \strng{fullhash}{1054e83cd9f989f4a355dc029e180704}
      \field{sortinit}{U}
      \field{sortinithash}{8145509bd2718876fc77d31fd2cde117}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{1907.02104} (last accessed 11/25/2020)}
      \field{title}{Testing Gap $k$-planarity is {NP}-complete}
      \field{year}{2020}
      \verb{eprint}
      \verb 1907.02104
      \endverb
    \endentry
    \entry{V04}{incollection}{}
      \name{author}{1}{}{%
        {{hash=2e1a273e0c1af98d23258eba7882f230}{Valtr}{V\bibinitperiod}{Pavel}{P\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Cambridge}%
      }
      \list{publisher}{1}{%
        {Cambridge University Press}%
      }
      \strng{namehash}{2e1a273e0c1af98d23258eba7882f230}
      \strng{fullhash}{2e1a273e0c1af98d23258eba7882f230}
      \field{sortinit}{V}
      \field{sortinithash}{d18f5ce25ce0b5ca7f924e3f6c04870e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial and Computational Geometry}
      \field{series}{Math. Sci. Res. Inst. Publ.}
      \field{title}{On the Pair-Crossing Number}
      \field{volume}{52}
      \field{year}{2005}
      \field{pages}{569\bibrangedash 575}
      \range{pages}{7}
    \endentry
    \entry{V08}{article}{}
      \name{author}{1}{}{%
        {{hash=59409d116263bbaedf1a269da9202c62}{Verbitsky}{V\bibinitperiod}{Oleg}{O\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{59409d116263bbaedf1a269da9202c62}
      \strng{fullhash}{59409d116263bbaedf1a269da9202c62}
      \field{sortinit}{V}
      \field{sortinithash}{d18f5ce25ce0b5ca7f924e3f6c04870e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0304-3975}
      \field{journaltitle}{Theoret. Comput. Sci.}
      \field{number}{1-3}
      \field{title}{On the obfuscation complexity of planar graphs}
      \field{volume}{396}
      \field{year}{2008}
      \field{pages}{294\bibrangedash 300}
      \range{pages}{7}
    \endentry
    \entry{Vx}{misc}{}
      \name{author}{1}{}{%
        {{hash=e2b447c0c57da76cc97071085476d5f0}{V\v{r}\v{t}o}{V\bibinitperiod}{Imrich}{I\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{e2b447c0c57da76cc97071085476d5f0}
      \strng{fullhash}{e2b447c0c57da76cc97071085476d5f0}
      \field{sortinit}{V}
      \field{sortinithash}{d18f5ce25ce0b5ca7f924e3f6c04870e}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{howpublished}{Available at \url{ftp://ftp.ifi.savba.sk/pub/imrich/crobib.pdf} (last accessed 2/3/2020)}
      \field{note}{Last updated: January 15th, 2014}
      \field{title}{Crossing Numbers of Graphs: a Bibliography}
      \field{year}{2011}
    \endentry
    \entry{W01}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=ae6a15d8a873264c824719790b92c931}{Waddle}{W\bibinitperiod}{Vance}{V\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{1}{}{%
        {{hash=fb2ffc4da288516b7fe44fca4e2ed087}{Marks}{M\bibinitperiod}{Joe}{J\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer}%
      }
      \strng{namehash}{ae6a15d8a873264c824719790b92c931}
      \strng{fullhash}{ae6a15d8a873264c824719790b92c931}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Graph Drawing}
      \field{isbn}{3-540-41554-8}
      \field{month}{01~01}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{Graph Layout for Displaying Data Structures}
      \field{volume}{1984}
      \field{year}{2000}
      \field{pages}{241\bibrangedash 252}
      \range{pages}{12}
    \endentry
    \entry{W06}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=b00892f8127fb3c8ad117808c1d1d4a8}{Wagner}{W\bibinitperiod}{Uli}{U\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {IEEE Computer Society}%
      }
      \strng{namehash}{b00892f8127fb3c8ad117808c1d1d4a8}
      \strng{fullhash}{b00892f8127fb3c8ad117808c1d1d4a8}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{FOCS: IEEE Symposium on Foundations of Computer Science (FOCS)}
      \field{isbn}{0-7695-2720-5}
      \field{title}{On a Geometric Generalization of the Upper Bound Theorem}
      \field{year}{2006}
      \field{pages}{635\bibrangedash 645}
      \range{pages}{11}
    \endentry
    \entry{W07}{book}{}
      \name{author}{1}{}{%
        {{hash=a78a2d8a16241842120e7b4b50fa1792}{Wallis}{W\bibinitperiod}{W.\bibnamedelimi D.}{W\bibinitperiod\bibinitdelim D\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Boston, MA}%
      }
      \list{publisher}{1}{%
        {Birkh\"{a}user Boston Inc.}%
      }
      \strng{namehash}{a78a2d8a16241842120e7b4b50fa1792}
      \strng{fullhash}{a78a2d8a16241842120e7b4b50fa1792}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{Second}
      \field{isbn}{978-0-8176-4484-0}
      \field{title}{A beginner's guide to graph theory}
      \field{year}{2007}
      \field{pages}{xx+260}
      \range{pages}{-1}
    \endentry
    \entry{WCLH19}{article}{}
      \name{author}{4}{}{%
        {{hash=49a19e08791a3dc09c932ff975949361}{Wang}{W\bibinitperiod}{Jing}{J\bibinitperiod}{}{}{}{}}%
        {{hash=8744957e7a792d46a6a463bf606b6520}{Cai}{C\bibinitperiod}{Junliang}{J\bibinitperiod}{}{}{}{}}%
        {{hash=4b000959225bf8fa79dbbf7f05d41ac0}{Lv}{L\bibinitperiod}{Shengxiang}{S\bibinitperiod}{}{}{}{}}%
        {{hash=6953501caf2d023feb90effb0c81385d}{Huang}{H\bibinitperiod}{Yuanqiu}{Y\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berlin}%
      }
      \list{publisher}{1}{%
        {Sciendo}%
      }
      \strng{namehash}{bb255b96d1bb6f677f7841b684efd08c}
      \strng{fullhash}{b8bb0f4b503352a7a7b6bbe3c22823b2}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1234-3099}
      \field{journaltitle}{Discuss. Math. Graph Theory}
      \field{title}{The Crossing Number of Hexagonal Graph $H_{3,N}$ in the Projective Plane}
      \field{year}{2019}
      \verb{doi}
      \verb https://doi.org/10.7151/dmgt.2251
      \endverb
      \verb{url}
      \verb https://content.sciendo.com/view/journals/dmgt/ahead-of-print/article-10.7151-dmgt.2251/article-10.7151-dmgt.2251.xml
      \endverb
    \endentry
    \entry{WZ21}{article}{}
      \name{author}{2}{}{%
        {{hash=49a19e08791a3dc09c932ff975949361}{Wang}{W\bibinitperiod}{Jing}{J\bibinitperiod}{}{}{}{}}%
        {{hash=28dd719daae6ed8f71f417d560c3696a}{Zhang}{Z\bibinitperiod}{Zuozheng}{Z\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{3bf3cef9f3821ba6261856b44cf14500}
      \strng{fullhash}{3bf3cef9f3821ba6261856b44cf14500}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{note}{\arxiv{2104.11640} (last accessed 4/30/2021)}
      \field{title}{The crossing number of the generalized Petersen graph ${P}(3k,k)$ in the projective plane}
      \field{year}{2021}
      \verb{eprint}
      \verb 2104.11640
      \endverb
    \endentry
    \entry{W17}{article}{}
      \name{author}{1}{}{%
        {{hash=1f3630a2b03988eac23594a35a32f0d8}{Wang}{W\bibinitperiod}{Jiun{-}Jie}{J\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{1f3630a2b03988eac23594a35a32f0d8}
      \strng{fullhash}{1f3630a2b03988eac23594a35a32f0d8}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{CoRR}
      \field{note}{\arxiv{1708.02114} (last accessed 9/21/2017)}
      \field{title}{Layouts for Plane Graphs on Constant Number of Tracks}
      \field{volume}{abs/1708.02114}
      \field{year}{2017}
      \verb{url}
      \verb http://arxiv.org/abs/1708.02114
      \endverb
    \endentry
    \entry{W14}{article}{}
      \name{author}{1}{}{%
        {{hash=a22d033bb4b2a21d80de57b8d1d18959}{{Wang}}{W\bibinitperiod}{Yi-Kai}{Y\bibinithyphendelim K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{a22d033bb4b2a21d80de57b8d1d18959}
      \strng{fullhash}{a22d033bb4b2a21d80de57b8d1d18959}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{cs.DS}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{11}
      \field{note}{\arxiv{1412.0340} (last accessed 12/7/2020)}
      \field{title}{Approximate {MAP} Estimation for Pairwise Potentials via {B}aker's Technique}
      \field{year}{2014}
      \verb{eprint}
      \verb 1412.0340
      \endverb
      \keyw{Computer Science - Data Structures and Algorithms}
    \endentry
    \entry{W77}{article}{}
      \name{author}{1}{}{%
        {{hash=819ceaae9a7b47efa6204b8e218a0399}{Warfield}{W\bibinitperiod}{John\bibnamedelima N.}{J\bibinitperiod\bibinitdelim N\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{819ceaae9a7b47efa6204b8e218a0399}
      \strng{fullhash}{819ceaae9a7b47efa6204b8e218a0399}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0018-9472}
      \field{journaltitle}{IEEE Trans. Systems Man Cybernet.}
      \field{number}{7}
      \field{title}{Crossing theory and hierarchy mapping}
      \field{volume}{SMC-7}
      \field{year}{1977}
      \field{pages}{505\bibrangedash 523}
      \range{pages}{19}
    \endentry
    \entry{W70}{article}{}
      \name{author}{1}{}{%
        {{hash=929c76c56947c79b45aebbd8eeef0df6}{Watkins}{W\bibinitperiod}{Mark\bibnamedelima E.}{M\bibinitperiod\bibinitdelim E\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{929c76c56947c79b45aebbd8eeef0df6}
      \strng{fullhash}{929c76c56947c79b45aebbd8eeef0df6}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Ann. New York Acad. Sci.}
      \field{title}{A special crossing number for bipartite graphs: {A} research problem.}
      \field{volume}{175}
      \field{year}{1970}
      \field{pages}{405\bibrangedash 410}
      \range{pages}{6}
    \endentry
    \entry{W?SCCNG}{misc}{}
      \name{author}{1}{}{%
        {{hash=5d54d442adc2a0d430f0728fd6530577}{Weisstein}{W\bibinitperiod}{Eric\bibnamedelima W.}{E\bibinitperiod\bibinitdelim W\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{5d54d442adc2a0d430f0728fd6530577}
      \strng{fullhash}{5d54d442adc2a0d430f0728fd6530577}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{note}{\url{https://mathworld.wolfram.com/SmallestCubicCrossingNumberGraph.html} (last accessed 5/3/2021)}
      \field{title}{Smallest Cubic Crossing Number Graph. {From MathWorld---A Wolfram Web Resource}}
    \endentry
    \entry{W84}{book}{}
      \name{author}{1}{}{%
        {{hash=c4e8c844afc44df0000626e282fecb97}{White}{W\bibinitperiod}{Arthur\bibnamedelima T.}{A\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Amsterdam}%
      }
      \list{publisher}{1}{%
        {North-Holland Publishing Co.}%
      }
      \strng{namehash}{c4e8c844afc44df0000626e282fecb97}
      \strng{fullhash}{c4e8c844afc44df0000626e282fecb97}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{edition}{Second}
      \field{series}{North-Holland Mathematics Studies}
      \field{title}{Graphs, groups and surfaces}
      \field{volume}{8}
      \field{year}{1984}
      \field{pages}{xiii+314}
      \range{pages}{-1}
    \endentry
    \entry{W97}{incollection}{}
      \name{author}{1}{}{%
        {{hash=b5af2d6711ac0f9093eed4f0ab2c3db3}{Wilf}{W\bibinitperiod}{Herbert\bibnamedelima S.}{H\bibinitperiod\bibinitdelim S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Cambridge Univ. Press, Cambridge}%
      }
      \strng{namehash}{b5af2d6711ac0f9093eed4f0ab2c3db3}
      \strng{fullhash}{b5af2d6711ac0f9093eed4f0ab2c3db3}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorics, geometry and probability ({C}ambridge, 1993)}
      \field{title}{On crossing numbers, and some unsolved problems}
      \field{year}{1997}
      \field{pages}{557\bibrangedash 562}
      \range{pages}{6}
    \endentry
    \entry{W05}{thesis}{}
      \name{author}{1}{}{%
        {{hash=a9311bf3af07424b45f359744502910e}{Winterbach}{W\bibinitperiod}{Wynand}{W\bibinitperiod}{}{}{}{}}%
      }
      \list{institution}{1}{%
        {University of Stellenbosch}%
      }
      \list{location}{1}{%
        {South Africa}%
      }
      \strng{namehash}{a9311bf3af07424b45f359744502910e}
      \strng{fullhash}{a9311bf3af07424b45f359744502910e}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{{The crossing number of a graph in the plane}}
      \field{type}{mathesis}
      \field{year}{2005}
    \endentry
    \entry{W67}{book}{}
      \name{author}{1}{}{%
        {{hash=3234c99a3eebf68ef7d42684cdb8ed8f}{Wittgenstein}{W\bibinitperiod}{Ludwig}{L\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Suhrkamp}%
      }
      \strng{namehash}{3234c99a3eebf68ef7d42684cdb8ed8f}
      \strng{fullhash}{3234c99a3eebf68ef7d42684cdb8ed8f}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{title}{Wittgenstein und der Wiener Kreis: Gespr\"{a}che aufgezeichnet von Friedrich Waismann}
      \field{volume}{3}
      \field{year}{1967}
    \endentry
    \entry{W93}{article}{}
      \name{author}{1}{}{%
        {{hash=0a30f5f5e92e105ee577708a7e1a4fa6}{Woodall}{W\bibinitperiod}{D.\bibnamedelimi R.}{D\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{0a30f5f5e92e105ee577708a7e1a4fa6}
      \strng{fullhash}{0a30f5f5e92e105ee577708a7e1a4fa6}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0364-9024}
      \field{journaltitle}{J. Graph Theory}
      \field{number}{6}
      \field{title}{Cyclic-order graphs and {Z}arankiewicz's crossing-number conjecture}
      \field{volume}{17}
      \field{year}{1993}
      \field{pages}{657\bibrangedash 671}
      \range{pages}{15}
    \endentry
    \entry{W71}{incollection}{}
      \name{author}{1}{}{%
        {{hash=0a30f5f5e92e105ee577708a7e1a4fa6}{Woodall}{W\bibinitperiod}{D.\bibnamedelimi R.}{D\bibinitperiod\bibinitdelim R\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {London}%
      }
      \list{publisher}{1}{%
        {Academic Press}%
      }
      \strng{namehash}{0a30f5f5e92e105ee577708a7e1a4fa6}
      \strng{fullhash}{0a30f5f5e92e105ee577708a7e1a4fa6}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial {M}athematics and its {A}pplications ({P}roc. {C}onf., {O}xford, 1969)}
      \field{title}{Thrackles and deadlock}
      \field{year}{1971}
      \field{pages}{335\bibrangedash 347}
      \range{pages}{13}
    \endentry
    \entry{WSP12}{article}{}
      \name{author}{3}{}{%
        {{hash=664add40fa08941270021019b218cf98}{Wotzlaw}{W\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=efa1447ef1b58ae945010cc2aa41db4f}{Speckenmeyer}{S\bibinitperiod}{Ewald}{E\bibinitperiod}{}{}{}{}}%
        {{hash=a87a401a2cd427e48e41ac0b399f4818}{Porschen}{P\bibinitperiod}{Stefan}{S\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Elsevier Science Publishers B. V.}%
      }
      \strng{namehash}{20d77a7c2d226503328c91026c0fe5b0}
      \strng{fullhash}{20d77a7c2d226503328c91026c0fe5b0}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Appl. Math.}
      \field{month}{11}
      \field{number}{16-17}
      \field{title}{Generalized {$k$}-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation}
      \field{volume}{160}
      \field{year}{2012}
      \field{pages}{2349\bibrangedash 2363}
      \range{pages}{15}
    \endentry
    \entry{WRX11}{article}{}
      \name{author}{3}{}{%
        {{hash=23d70ba77c510211f453aa6bbd1338c0}{Wu}{W\bibinitperiod}{Yong\bibnamedelima Xiang}{Y\bibinitperiod\bibinitdelim X\bibinitperiod}{}{}{}{}}%
        {{hash=fef0f457dc12347c521edd6002c141a3}{Ren}{R\bibinitperiod}{Han}{H\bibinitperiod}{}{}{}{}}%
        {{hash=68854340a94ac2a8020d897801ce7a23}{Xu}{X\bibinitperiod}{Tu}{T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{f6c4b49c444dabc531d81cdc98a609b8}
      \strng{fullhash}{f6c4b49c444dabc531d81cdc98a609b8}
      \field{sortinit}{W}
      \field{sortinithash}{99e3ba1b3f78bb6f073e7fa7ac11636b}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1000-341X}
      \field{journaltitle}{J. Math. Res. Exposition}
      \field{number}{4}
      \field{title}{The crossing number of two-maps on orientable surfaces}
      \field{volume}{31}
      \field{year}{2011}
      \field{pages}{643\bibrangedash 648}
      \range{pages}{6}
    \endentry
    \entry{YW21}{article}{}
      \name{author}{2}{}{%
        {{hash=15ec5acbb860c484e9a8a0186740546a}{Yang}{Y\bibinitperiod}{Xiwu}{X\bibinitperiod}{}{}{}{}}%
        {{hash=bc18587e97877433990bbaa6da2606c6}{Wang}{W\bibinitperiod}{Yizhen}{Y\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{b35be98dc05236d62288e22e49c1cc56}
      \strng{fullhash}{b35be98dc05236d62288e22e49c1cc56}
      \field{sortinit}{Y}
      \field{sortinithash}{3cbc1e3d286284cedb5e5218a3248f94}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{1435-5914}
      \field{journaltitle}{Graphs Combin.}
      \field{title}{The Conjecture on the Crossing Number of ${K}_{1,m,n}$ is true if {Z}arankiewicz's Conjecture Holds}
      \field{year}{2021}
      \verb{doi}
      \verb 10.1007/s00373-021-02303-y
      \endverb
      \verb{url}
      \verb https://doi.org/10.1007/s00373-021-02303-y
      \endverb
    \endentry
    \entry{Y89}{article}{}
      \name{author}{1}{}{%
        {{hash=4c46d2f3f797a5dedce8a376cb13fe3a}{Yannakakis}{Y\bibinitperiod}{Mihalis}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \strng{fullhash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \field{sortinit}{Y}
      \field{sortinithash}{3cbc1e3d286284cedb5e5218a3248f94}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0022-0000}
      \field{journaltitle}{J. Comput. System Sci.}
      \field{note}{18th Annual ACM Symposium on Theory of Computing (Berkeley, CA, 1986)}
      \field{number}{1}
      \field{title}{Embedding planar graphs in four pages}
      \field{volume}{38}
      \field{year}{1989}
      \field{pages}{36\bibrangedash 67}
      \range{pages}{32}
    \endentry
    \entry{Y86}{inproceedings}{}
      \name{author}{1}{}{%
        {{hash=4c46d2f3f797a5dedce8a376cb13fe3a}{Yannakakis}{Y\bibinitperiod}{Mihalis}{M\bibinitperiod}{}{}{}{}}%
      }
      \list{location}{1}{%
        {Berkeley, California, United States}%
      }
      \list{publisher}{1}{%
        {ACM}%
      }
      \strng{namehash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \strng{fullhash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \field{sortinit}{Y}
      \field{sortinithash}{3cbc1e3d286284cedb5e5218a3248f94}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Proceedings of the eighteenth annual ACM symposium on Theory of computing}
      \field{isbn}{0-89791-193-8}
      \field{series}{STOC '86}
      \field{title}{Four pages are necessary and sufficient for planar graphs}
      \field{year}{1986}
      \field{pages}{104\bibrangedash 108}
      \range{pages}{5}
    \endentry
    \entry{Y20}{article}{}
      \name{author}{1}{}{%
        {{hash=4c46d2f3f797a5dedce8a376cb13fe3a}{Yannakakis}{Y\bibinitperiod}{Mihalis}{M\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \strng{fullhash}{4c46d2f3f797a5dedce8a376cb13fe3a}
      \field{sortinit}{Y}
      \field{sortinithash}{3cbc1e3d286284cedb5e5218a3248f94}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{eprintclass}{math.CO}
      \field{eprinttype}{arXiv}
      \field{journaltitle}{ArXiv e-prints}
      \field{month}{05}
      \field{note}{\arxiv{2005.14111} (last accessed 2/12/2021)}
      \field{title}{{Planar Graphs that Need Four Pages}}
      \field{year}{2020}
      \verb{eprint}
      \verb 2005.14111
      \endverb
    \endentry
    \entry{Z12}{article}{}
      \name{author}{1}{}{%
        {{hash=28821a80eea179326934c9e35a022245}{Zamfirescu}{Z\bibinitperiod}{Carol\bibnamedelima T.}{C\bibinitperiod\bibinitdelim T\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{28821a80eea179326934c9e35a022245}
      \strng{fullhash}{28821a80eea179326934c9e35a022245}
      \field{sortinit}{Z}
      \field{sortinithash}{fdda4caaa6b5fa63e0c081dcb159543a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0166-218X}
      \field{journaltitle}{Discrete Applied Mathematics}
      \field{number}{7-8}
      \field{title}{(2)-pancyclic graphs}
      \field{volume}{161}
      \field{year}{2013}
      \field{pages}{1128\bibrangedash 1136}
      \range{pages}{9}
      \verb{doi}
      \verb 10.1016/j.dam.2012.11.002
      \endverb
    \endentry
    \entry{Z53}{article}{}
      \name{author}{1}{}{%
        {{hash=990cc609992d0220fe02ba816e3fddad}{Zarankiewicz}{Z\bibinitperiod}{K.}{K\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{990cc609992d0220fe02ba816e3fddad}
      \strng{fullhash}{990cc609992d0220fe02ba816e3fddad}
      \field{sortinit}{Z}
      \field{sortinithash}{fdda4caaa6b5fa63e0c081dcb159543a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{journaltitle}{Bull. Acad. Polon. Sci. Cl. III.}
      \field{title}{The solution of a certain problem on graphs of {P}. {T}uran}
      \field{volume}{1}
      \field{year}{1953}
      \field{pages}{167\bibrangedash 168}
      \range{pages}{2}
    \endentry
    \entry{Z19}{article}{}
      \name{author}{1}{}{%
        {{hash=4f3bb1d3c7fa2a05241e353723deaf63}{Zhang}{Z\bibinitperiod}{Xin}{X\bibinitperiod}{}{}{}{}}%
      }
      \strng{namehash}{4f3bb1d3c7fa2a05241e353723deaf63}
      \strng{fullhash}{4f3bb1d3c7fa2a05241e353723deaf63}
      \field{sortinit}{Z}
      \field{sortinithash}{fdda4caaa6b5fa63e0c081dcb159543a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{issn}{0096-3003}
      \field{journaltitle}{Appl. Math. Comput.}
      \field{title}{Upper bound on the sum of powers of the degrees of graphs with few crossings per edge}
      \field{volume}{350}
      \field{year}{2019}
      \field{pages}{163\bibrangedash 169}
      \range{pages}{7}
      \verb{doi}
      \verb 10.1016/j.amc.2019.01.002
      \endverb
      \verb{url}
      \verb https://doi.org/10.1016/j.amc.2019.01.002
      \endverb
    \endentry
    \entry{ZB07}{incollection}{}
      \name{author}{2}{}{%
        {{hash=cb515ebefb75fc6876905d48795d0dbf}{Zheng}{Z\bibinitperiod}{Lanbo}{L\bibinitperiod}{}{}{}{}}%
        {{hash=34c586758e534bad066e6aa3fc210926}{Buchheim}{B\bibinitperiod}{Christoph}{C\bibinitperiod}{}{}{}{}}%
      }
      \name{editor}{3}{}{%
        {{hash=632929d5716f21c266601f7ad4ac9ba2}{Dress}{D\bibinitperiod}{Andreas}{A\bibinitperiod}{}{}{}{}}%
        {{hash=2a291de466db35a0f9c86f7efe899d9e}{Xu}{X\bibinitperiod}{Yinfeng}{Y\bibinitperiod}{}{}{}{}}%
        {{hash=77aed896de8d7f47e5248d1df57df9c5}{Zhu}{Z\bibinitperiod}{Binhai}{B\bibinitperiod}{}{}{}{}}%
      }
      \list{publisher}{1}{%
        {Springer Berlin / Heidelberg}%
      }
      \strng{namehash}{b614fa0cf161269f8102aaa988c6caef}
      \strng{fullhash}{b614fa0cf161269f8102aaa988c6caef}
      \field{sortinit}{Z}
      \field{sortinithash}{fdda4caaa6b5fa63e0c081dcb159543a}
      \field{labelnamesource}{author}
      \field{labeltitlesource}{title}
      \field{booktitle}{Combinatorial Optimization and Applications}
      \field{series}{Lecture Notes in Computer Science}
      \field{title}{A New Exact Algorithm for the Two-Sided Crossing Minimization Problem}
      \field{volume}{4616}
      \field{year}{2007}
      \field{pages}{301\bibrangedash 310}
      \range{pages}{10}
    \endentry
  \endsortlist
\endrefsection
\endinput

