{"id":"https://openalex.org/W2165908618","doi":"https://doi.org/10.1109/pacificvis.2008.4475456","title":"Crossing Minimization meets Simultaneous Drawing","display_name":"Crossing Minimization meets Simultaneous Drawing","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2165908618","doi":"https://doi.org/10.1109/pacificvis.2008.4475456","mag":"2165908618"},"language":"en","primary_location":{"id":"doi:10.1109/pacificvis.2008.4475456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pacificvis.2008.4475456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Pacific Visualization Symposium","raw_type":"proceedings-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/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["Technical University Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016595075","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-7574-6646"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Junger","raw_affiliation_strings":["University of Cologne, Germany"],"affiliations":[{"raw_affiliation_string":"University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024966196","display_name":"Michael Schulz","orcid":"https://orcid.org/0000-0001-6868-788X"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Schulz","raw_affiliation_strings":["University of Cologne, Germany"],"affiliations":[{"raw_affiliation_string":"University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044475263"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":3.418,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92851557,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"33","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962999820709229,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962999820709229,"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.9898999929428101,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6851285696029663},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6560236811637878},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6174961924552917},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.5788769125938416},{"id":"https://openalex.org/keywords/level-crossing","display_name":"Level crossing","score":0.5021250247955322},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4975900948047638},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4861564338207245},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.47037333250045776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.408467561006546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36164629459381104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3317190408706665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3136250376701355},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18738436698913574}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6851285696029663},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6560236811637878},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6174961924552917},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.5788769125938416},{"id":"https://openalex.org/C1975866","wikidata":"https://www.wikidata.org/wiki/Q171448","display_name":"Level crossing","level":2,"score":0.5021250247955322},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4975900948047638},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4861564338207245},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.47037333250045776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.408467561006546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36164629459381104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3317190408706665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3136250376701355},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18738436698913574},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/pacificvis.2008.4475456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pacificvis.2008.4475456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Pacific Visualization Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:543","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.403.2466","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.2466","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-lehre.inf.uos.de/theoinf/lib/exe/fetch.php/pubs/pacvis08_preprint_simultdrawcrno_pdf.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":33,"referenced_works":["https://openalex.org/W174566906","https://openalex.org/W178804361","https://openalex.org/W1483285511","https://openalex.org/W1486249760","https://openalex.org/W1518473637","https://openalex.org/W1523103567","https://openalex.org/W1524396467","https://openalex.org/W1550871457","https://openalex.org/W1573284625","https://openalex.org/W1576282581","https://openalex.org/W1603713238","https://openalex.org/W1968281628","https://openalex.org/W1976060438","https://openalex.org/W1997676797","https://openalex.org/W1999600491","https://openalex.org/W2003783600","https://openalex.org/W2034188706","https://openalex.org/W2037121654","https://openalex.org/W2060538865","https://openalex.org/W2061287541","https://openalex.org/W2101447138","https://openalex.org/W2108115761","https://openalex.org/W2111526090","https://openalex.org/W2132818870","https://openalex.org/W2136316164","https://openalex.org/W2140635350","https://openalex.org/W2146243727","https://openalex.org/W2151875636","https://openalex.org/W2168846334","https://openalex.org/W2175345393","https://openalex.org/W2205923270","https://openalex.org/W3136685299","https://openalex.org/W4213071722"],"related_works":["https://openalex.org/W2963402006","https://openalex.org/W2275307537","https://openalex.org/W4235502529","https://openalex.org/W4212974456","https://openalex.org/W2094356522","https://openalex.org/W2000052110","https://openalex.org/W2024829441","https://openalex.org/W2951800124","https://openalex.org/W4300053261","https://openalex.org/W4387983552"],"abstract_inverted_index":{"We":[0,19],"define":[1],"the":[2,12,23,39,52,59],"concept":[3],"of":[4,16,62,73],"crossing":[5,13,25,64],"numbers":[6],"for":[7,38,51],"simultaneous":[8,63],"graphs":[9],"by":[10],"extending":[11],"number":[14,26],"problem":[15,54],"traditional":[17,24,53],"graphs.":[18],"discuss":[20],"differences":[21],"to":[22,58],"problem,":[27],"and":[28,33,35,48,66],"give":[29],"an":[30],"NP-completeness":[31],"proof":[32],"lower":[34],"upper":[36],"bounds":[37],"new":[40,60],"problem.":[41],"Furthermore,":[42],"we":[43],"show":[44],"how":[45],"existing":[46],"heuristic":[47],"exact":[49],"algorithms":[50],"can":[55],"be":[56],"adapted":[57],"task":[61],"minimization,":[65],"report":[67],"on":[68],"a":[69],"brief":[70],"experimental":[71],"study":[72],"their":[74],"implementations.":[75]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}