{"id":"https://openalex.org/W1990541441","doi":"https://doi.org/10.1137/120886777","title":"Improved Lower Bounds on Book Crossing Numbers of Complete Graphs","display_name":"Improved Lower Bounds on Book Crossing Numbers of Complete Graphs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1990541441","doi":"https://doi.org/10.1137/120886777","mag":"1990541441"},"language":"en","primary_location":{"id":"doi:10.1137/120886777","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120886777","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1207.5701","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019341464","display_name":"Etienne de Klerk","orcid":"https://orcid.org/0000-0003-3377-0063"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"E. de Klerk","raw_affiliation_strings":["Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Nether-lands"],"affiliations":[{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Nether-lands","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015696190","display_name":"Dmitrii V. \u1e56asechnik","orcid":"https://orcid.org/0000-0002-7557-6886"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"D. V. Pasechnik","raw_affiliation_strings":["School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060540226","display_name":"Gelasio Salazar","orcid":"https://orcid.org/0000-0002-8458-3930"},"institutions":[{"id":"https://openalex.org/I196664497","display_name":"Autonomous University of San Luis Potos\u00ed","ror":"https://ror.org/000917t60","country_code":"MX","type":"education","lineage":["https://openalex.org/I196664497"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"G. Salazar","raw_affiliation_strings":["Instituto de Fisica, Universidad Autonoma de San Luis Potosi, San Luis Potosi, SLP 78000, Mexico"],"affiliations":[{"raw_affiliation_string":"Instituto de Fisica, Universidad Autonoma de San Luis Potosi, San Luis Potosi, SLP 78000, Mexico","institution_ids":["https://openalex.org/I196664497"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019341464"],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":null,"apc_paid":null,"fwci":2.8021,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89747585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"2","first_page":"619","last_page":"633"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7729166746139526},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.6060636639595032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5822674632072449},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5371741652488708},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4749993085861206},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.4385959208011627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4308518171310425},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41915401816368103},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.0773749053478241}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7729166746139526},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.6060636639595032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5822674632072449},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5371741652488708},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4749993085861206},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4385959208011627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4308518171310425},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41915401816368103},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0773749053478241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/120886777","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120886777","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:publications/bac0e9c5-a8d5-4b78-a39c-d6b5a2a6d87f","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/bac0e9c5-a8d5-4b78-a39c-d6b5a2a6d87f","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Klerk, E, Pasechnik, D V & Salazar, G 2013, 'Improved lower bounds on book crossing numbers of complete graphs', SIAM Journal on Discrete Mathematics, vol. 18, no. 1, pp. 87-105.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1207.5701","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1207.5701","pdf_url":"https://arxiv.org/pdf/1207.5701","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.9097","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.9097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ifisica.uaslp.mx/~gsalazar/RESEARCH/kpagecompletegraphs.pdf","raw_type":"text"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/101539","is_oa":false,"landing_page_url":"http://hdl.handle.net/10220/18655","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:7b60835d-6581-477d-8c04-4fc24e3dc132","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:7b60835d-6581-477d-8c04-4fc24e3dc132","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1207.5701","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1207.5701","pdf_url":"https://arxiv.org/pdf/1207.5701","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G713637616","display_name":null,"funder_award_id":"106432","funder_id":"https://openalex.org/F4320321739","funder_display_name":"Consejo Nacional de Ciencia y Tecnolog\u00eda"}],"funders":[{"id":"https://openalex.org/F4320321739","display_name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","ror":"https://ror.org/059ex5q34"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W43174409","https://openalex.org/W94845089","https://openalex.org/W824928995","https://openalex.org/W1566173313","https://openalex.org/W1579213680","https://openalex.org/W1964730816","https://openalex.org/W1967125711","https://openalex.org/W1967865165","https://openalex.org/W1970611748","https://openalex.org/W1985123706","https://openalex.org/W1998294201","https://openalex.org/W1999913571","https://openalex.org/W2002107883","https://openalex.org/W2023858337","https://openalex.org/W2033498477","https://openalex.org/W2044720418","https://openalex.org/W2051344921","https://openalex.org/W2055993677","https://openalex.org/W2066459185","https://openalex.org/W2075825636","https://openalex.org/W2081719977","https://openalex.org/W2086778098","https://openalex.org/W2094221830","https://openalex.org/W2109042433","https://openalex.org/W2117566233","https://openalex.org/W2119115989","https://openalex.org/W2122464384","https://openalex.org/W2122882559","https://openalex.org/W2125240990","https://openalex.org/W2132105090","https://openalex.org/W2136275995","https://openalex.org/W2146555787","https://openalex.org/W2153157180","https://openalex.org/W2335363198","https://openalex.org/W2404307587","https://openalex.org/W2536620281","https://openalex.org/W2614168309","https://openalex.org/W2914659449","https://openalex.org/W2953195873","https://openalex.org/W3083226444","https://openalex.org/W3103545947","https://openalex.org/W3119273484","https://openalex.org/W4241647584"],"related_works":["https://openalex.org/W1983756092","https://openalex.org/W2381295697","https://openalex.org/W2385886188","https://openalex.org/W2378309693","https://openalex.org/W1788812054","https://openalex.org/W579949368","https://openalex.org/W2092089517","https://openalex.org/W2012205236","https://openalex.org/W2032707516","https://openalex.org/W2890418627"],"abstract_inverted_index":{"A":[0],"book":[1,34,62],"with":[2,35],"$k$":[3,13,36,141,155],"pages":[4,37],"consists":[5],"of":[6,21,74,82,88,99,117,131,135,140,161,170],"a":[7,28,33,40,55,60,66,75,85,122,128],"straight":[8],"line":[9],"(the":[10,15],"spine)":[11],"and":[12,49,142,163],"half-planes":[14],"pages),":[16],"such":[17,39],"that":[18,42],"the":[19,25,43,47,57,79,95,132,147,158,171],"boundary":[20],"each":[22,50],"page":[23],"is":[24,30,52,59,78],"spine.":[26],"If":[27],"graph":[29,76],"drawn":[31],"on":[32,46,112],"in":[38,54,84,154,168,175],"way":[41],"vertices":[44],"lie":[45],"spine,":[48],"edge":[51],"contained":[53],"page,":[56],"result":[58],"k-page":[61],"drawing":[63,87,152],"(or":[64],"simply":[65],"$k$-page":[67,70,86,96],"drawing).":[68],"The":[69],"crossing":[71,97],"number":[72,81,160],"$\\nu_k(G)$":[73],"$G$":[77],"minimum":[80],"crossings":[83],"$G$.":[89],"In":[90],"this":[91,165,176],"paper":[92],"we":[93,145],"investigate":[94,146],"numbers":[98],"complete":[100],"graphs.":[101],"We":[102,119],"use":[103,121],"semidefinite":[104],"programming":[105],"techniques":[106],"to":[107,126],"give":[108],"improved":[109],"lower":[110],"bounds":[111],"$\\nu_k(K_n)$":[113,136],"for":[114,137,151],"various":[115],"values":[116,139],"$k$.":[118],"also":[120],"maximum":[123],"satisfiability":[124],"reformulation":[125],"obtain":[127],"computer-aided":[129],"calculation":[130],"exact":[133],"value":[134],"several":[138],"$n$.":[143],"Finally,":[144],"best":[148],"construction":[149],"known":[150],"$K_n$":[153],"pages,":[156],"calculate":[157],"resulting":[159],"crossings,":[162],"discuss":[164],"upper":[166],"bound":[167],"light":[169],"new":[172],"results":[173],"reported":[174],"paper.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
