{"id":"https://openalex.org/W2035359116","doi":"https://doi.org/10.1137/s0097539797331671","title":"On Bipartite Drawings and the Linear Arrangement Problem","display_name":"On Bipartite Drawings and the Linear Arrangement Problem","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2035359116","doi":"https://doi.org/10.1137/s0097539797331671","mag":"2035359116"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797331671","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797331671","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113484676","display_name":"Farhad Shahrokhi","orcid":null},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Farhad Shahrokhi","raw_affiliation_strings":["Univ of North texas"],"affiliations":[{"raw_affiliation_string":"Univ of North texas","institution_ids":["https://openalex.org/I123534392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073592264","display_name":"Ond\u0159ej S\u00fdkora","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ondrej S\u00fdkora","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103035080","display_name":"\u0141\u00e1szl\u00f3 A. Sz\u00e9kely","orcid":"https://orcid.org/0000-0002-9470-9111"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 A. Sz\u00e9kely","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063290861","display_name":"Imrich Vrt\u2019o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Imrich Vrto","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5113484676"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":4.0044,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.94156271,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"30","issue":"6","first_page":"1773","last_page":"1789"},"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.9994000196456909,"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.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8862419128417969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7766351699829102},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7761059999465942},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7064923048019409},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5365121364593506},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5253181457519531},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4962831139564514},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.48112669587135315},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4358028173446655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31964755058288574}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8862419128417969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7766351699829102},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7761059999465942},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7064923048019409},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5365121364593506},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5253181457519531},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4962831139564514},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.48112669587135315},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4358028173446655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31964755058288574},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539797331671","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797331671","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.7270","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.7270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.sc.edu/~imip/98papers/9819.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.8821","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.8821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ifi.savba.sk/pub/imrich/siam2.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.2777","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.2777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.sc.edu/~szekely/siamjcomp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W86126052","https://openalex.org/W1486951072","https://openalex.org/W1490218556","https://openalex.org/W1495826360","https://openalex.org/W1521554751","https://openalex.org/W1558273801","https://openalex.org/W1568614804","https://openalex.org/W1972151695","https://openalex.org/W1988098280","https://openalex.org/W1992709202","https://openalex.org/W1998294201","https://openalex.org/W2004265962","https://openalex.org/W2012951995","https://openalex.org/W2021813567","https://openalex.org/W2035922087","https://openalex.org/W2040888766","https://openalex.org/W2042706982","https://openalex.org/W2060538865","https://openalex.org/W2071353749","https://openalex.org/W2080431890","https://openalex.org/W2087879219","https://openalex.org/W2090453221","https://openalex.org/W2090666691","https://openalex.org/W2094450647","https://openalex.org/W2099281231","https://openalex.org/W2158598102","https://openalex.org/W2912202394"],"related_works":["https://openalex.org/W2405987656","https://openalex.org/W2054383364","https://openalex.org/W2340841397","https://openalex.org/W2979276937","https://openalex.org/W2049398763","https://openalex.org/W2016416733","https://openalex.org/W4243953177","https://openalex.org/W1989366892","https://openalex.org/W4221160330","https://openalex.org/W2035359116"],"abstract_inverted_index":{"The":[0,56,134],"bipartite":[1,51,74,131,185],"crossing":[2,52,132],"number":[3,30,53,105],"problem":[4,12,17,135,166,175],"is":[5,18,99,147,158],"studied":[6,149],"and":[7,13,23,62,118,150,169],"a":[8,70,87,95,97,138,151],"connection":[9],"between":[10],"this":[11,165],"the":[14,28,36,40,50,66,103,111,115,119,130,170,174],"linear":[15,116,152],"arrangement":[16,42,117],"established.":[19],"A":[20],"lower":[21],"bound":[22,26],"an":[24,123,144],"upper":[25],"for":[27,49,69,128,155,164,183],"optimal":[29,41,104,112],"of":[31,73,106,110,114,136,143,173,187],"crossings":[32,107],"are":[33,39,54,59],"derived,":[34],"where":[35],"main":[37],"terms":[38,109],"values.":[43],"Two":[44],"polynomial":[45,80,161],"time":[46,81,126,153,162],"approximation":[47,82],"algorithms":[48],"obtained.":[55],"performance":[57],"guarantees":[58],"O(log":[60],"n)":[61],"O(log2n":[63],")":[64,125],"times":[65],"optimal,":[67],"respectively,":[68],"large":[71],"class":[72],"graphs":[75,186],"on":[76],"n":[77],"vertices.":[78],"No":[79,160],"algorithm":[83,127,154,163],"which":[84],"could":[85],"generate":[86],"provably":[88],"good":[89],"solution":[90],"had":[91,176],"been":[92,177],"known.":[93],"For":[94],"tree,":[96],"formula":[98],"derived":[100],"that":[101],"expresses":[102],"in":[108,122],"value":[113],"degrees,":[120],"resulting":[121],"O(n1.6":[124],"computing":[129,137],"number.":[133],"maximum":[139],"weight":[140],"biplanar":[141],"subgraph":[142],"acyclic":[145],"graph":[146],"also":[148],"solving":[156],"it":[157],"derived.":[159],"was":[167],"known,":[168],"unweighted":[171],"version":[172],"known":[178],"to":[179],"be":[180],"NP-hard,":[181],"even":[182],"planar":[184],"degree":[188],"at":[189],"most":[190],"3.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}