{"id":"https://openalex.org/W141594951","doi":"https://doi.org/10.1007/3-540-58078-6_5","title":"NC2 Algorithms regarding Hamiltonian paths and circuits in interval graphs","display_name":"NC2 Algorithms regarding Hamiltonian paths and circuits in interval graphs","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W141594951","doi":"https://doi.org/10.1007/3-540-58078-6_5","mag":"141594951"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-58078-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58078-6_5","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/A5103229709","display_name":"Y. Daniel Liang","orcid":"https://orcid.org/0009-0007-0331-9622"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]},{"id":"https://openalex.org/I162817326","display_name":"Indiana University \u2013 Purdue University Fort Wayne","ror":"https://ror.org/01jxzq227","country_code":"US","type":"education","lineage":["https://openalex.org/I162817326"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y. Daniel Liang","raw_affiliation_strings":["Department of Computer Science, Indiana Purdue University at Fort Wayne, 46805, Fort Wayne, IN","INDIANA\u2010PURDUE UNIVERSITY AT FORT WAYNE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indiana Purdue University at Fort Wayne, 46805, Fort Wayne, IN","institution_ids":["https://openalex.org/I162817326"]},{"raw_affiliation_string":"INDIANA\u2010PURDUE UNIVERSITY AT FORT WAYNE","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043885349","display_name":"Raymond Greenlaw","orcid":"https://orcid.org/0000-0003-0690-2112"},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]},{"id":"https://openalex.org/I179093154","display_name":"University of New Hampshire at Manchester","ror":"https://ror.org/04pvpk743","country_code":"US","type":"education","lineage":["https://openalex.org/I179093154"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raymond Greenlaw","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, 03824, Durham, NH","University of New Hampshire"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, 03824, Durham, NH","institution_ids":["https://openalex.org/I161057412"]},{"raw_affiliation_string":"University of New Hampshire","institution_ids":["https://openalex.org/I179093154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031865197","display_name":"Glenn K. Manacher","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glenn Manacher","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 60680, Chicago, IL","University of Illinois at Chicago"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 60680, Chicago, IL","institution_ids":["https://openalex.org/I39422238"]},{"raw_affiliation_string":"University of Illinois at Chicago","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103229709"],"corresponding_institution_ids":["https://openalex.org/I162817326","https://openalex.org/I219193219"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6496,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63749353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/ackermann-function","display_name":"Ackermann function","score":0.7839653491973877},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6309125423431396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6201012134552002},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5985438823699951},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5269480347633362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4960053861141205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4844481945037842},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44136494398117065},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4330247640609741},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.43151915073394775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4264214336872101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4250227212905884},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4170008897781372},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16795477271080017},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14734011888504028},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11367931962013245}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.7839653491973877},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6309125423431396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6201012134552002},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5985438823699951},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5269480347633362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4960053861141205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4844481945037842},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44136494398117065},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4330247640609741},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.43151915073394775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4264214336872101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4250227212905884},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4170008897781372},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16795477271080017},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14734011888504028},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11367931962013245},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-58078-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58078-6_5","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W73845553","https://openalex.org/W141594951","https://openalex.org/W1513982482","https://openalex.org/W1584086289","https://openalex.org/W1717014977","https://openalex.org/W1968285535","https://openalex.org/W1976140482","https://openalex.org/W1978583881","https://openalex.org/W2008908074","https://openalex.org/W2011039300","https://openalex.org/W2013507147","https://openalex.org/W2039166024","https://openalex.org/W2053623386","https://openalex.org/W2063410295","https://openalex.org/W2066356146","https://openalex.org/W2078003433","https://openalex.org/W2134008688","https://openalex.org/W2157110847","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W2756792282","https://openalex.org/W2006803815","https://openalex.org/W1945279274","https://openalex.org/W2093369082","https://openalex.org/W1987647154","https://openalex.org/W4251304736","https://openalex.org/W2094289449","https://openalex.org/W2890221297"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}