{"id":"https://openalex.org/W1751869754","doi":"https://doi.org/10.1007/3-540-44957-4_55","title":"Wire Routing and Satisfiability Planning","display_name":"Wire Routing and Satisfiability Planning","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1751869754","doi":"https://doi.org/10.1007/3-540-44957-4_55","mag":"1751869754"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44957-4_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44957-4_55","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5016455314","display_name":"Esra Erdem","orcid":"https://orcid.org/0000-0001-8384-7810"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Esra Erdem","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, Austin, USA","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076917986","display_name":"Vladimir Lifschitz","orcid":"https://orcid.org/0000-0001-6051-7907"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vladimir Lifschitz","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, Austin, USA","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin D. F. Wong","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, Austin, USA","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016455314"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1356,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90980137,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"822","last_page":"836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/routing","display_name":"Routing (electronic design automation)","score":0.7412952184677124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7210679650306702},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5047708749771118},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5021250247955322},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44894009828567505},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43997126817703247},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4213806986808777},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.41970717906951904},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4188109040260315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39444831013679504},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38941091299057007},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3474080562591553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33473002910614014},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22861364483833313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18129420280456543},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17573857307434082},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12447446584701538},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10540628433227539}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7412952184677124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7210679650306702},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5047708749771118},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5021250247955322},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44894009828567505},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43997126817703247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4213806986808777},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.41970717906951904},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4188109040260315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39444831013679504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38941091299057007},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3474080562591553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33473002910614014},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22861364483833313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18129420280456543},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17573857307434082},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12447446584701538},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10540628433227539}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-44957-4_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44957-4_55","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.9651","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.9651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.sabanciuniv.edu/~esraerdem/papers/cl00.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.6721","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.6721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/~vl/papers/routing.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.7048","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.7048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/esra/papers/cl00.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.3837","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.3837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/vl/mypapers/routing.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W81871881","https://openalex.org/W189303310","https://openalex.org/W201914929","https://openalex.org/W1511155470","https://openalex.org/W1667362966","https://openalex.org/W2003302587","https://openalex.org/W2031618792","https://openalex.org/W2038967932","https://openalex.org/W2108637261","https://openalex.org/W2118823189","https://openalex.org/W2153580689","https://openalex.org/W2155322595","https://openalex.org/W2158598102","https://openalex.org/W3045969830","https://openalex.org/W4241080567"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W1558557169","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}