{"id":"https://openalex.org/W2178299939","doi":"https://doi.org/10.1007/978-3-642-19222-7_18","title":"Computing Role Assignments of Proper Interval Graphs in Polynomial Time","display_name":"Computing Role Assignments of Proper Interval Graphs in Polynomial Time","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2178299939","doi":"https://doi.org/10.1007/978-3-642-19222-7_18","mag":"2178299939"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-19222-7_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_18","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":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1153773","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022828497","display_name":"Pinar Heggernes","orcid":"https://orcid.org/0000-0001-9460-4355"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Pinar Heggernes","raw_affiliation_strings":["Department of Informatics, University of Bergen, P.O.\u00a0Box 7803, N-5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, P.O.\u00a0Box 7803, N-5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017522059","display_name":"Pim van \u2019t Hof","orcid":"https://orcid.org/0000-0002-1778-7212"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pim van \u2019t Hof","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Science Laboratories, Durham University, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022828497"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3891,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66019608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"167","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T12288","display_name":"Optimization and Search Problems","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/chordal-graph","display_name":"Chordal graph","score":0.6526795029640198},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6512539386749268},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6463542580604553},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5771963000297546},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5686424970626831},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.5564231276512146},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5273716449737549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4971654713153839},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.4847559630870819},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4671442210674286},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.42815402150154114},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4243735671043396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34854769706726074},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33710020780563354},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27765828371047974},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.20783457159996033},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.16624295711517334}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6526795029640198},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6512539386749268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6463542580604553},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5771963000297546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5686424970626831},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.5564231276512146},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5273716449737549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4971654713153839},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.4847559630870819},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4671442210674286},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42815402150154114},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4243735671043396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34854769706726074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33710020780563354},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27765828371047974},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.20783457159996033},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.16624295711517334}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-19222-7_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_18","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:dro.dur.ac.uk.OAI2:18308","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/18308/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Iliopoulos,  Costas S. & Smyth,  William F. (Eds.). (2011). Combinatorial algorithms : 21st International Workshop, IWOCA 2010, London, July 26-28, 2010, revised selected papers. Berlin; Heidelberg: Springer, pp. 167-180, Lecture notes in computer science(6460)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1153773","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1153773","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1153773","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1153773","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G1111885211","display_name":null,"funder_award_id":"EP/G043434/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3476746706","display_name":null,"funder_award_id":"EP/D053633/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1480521342","https://openalex.org/W1517921658","https://openalex.org/W1579049696","https://openalex.org/W1667342107","https://openalex.org/W1964882757","https://openalex.org/W1968191405","https://openalex.org/W1976587381","https://openalex.org/W1984528974","https://openalex.org/W1985986630","https://openalex.org/W1987474300","https://openalex.org/W2001909387","https://openalex.org/W2002425555","https://openalex.org/W2011039300","https://openalex.org/W2028357390","https://openalex.org/W2039709665","https://openalex.org/W2075243601","https://openalex.org/W2077376532","https://openalex.org/W2087073372","https://openalex.org/W2089081330","https://openalex.org/W2089465933","https://openalex.org/W2116509046","https://openalex.org/W2143474538","https://openalex.org/W2184661648","https://openalex.org/W4242336842","https://openalex.org/W4247121519","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3118117404","https://openalex.org/W4210889658","https://openalex.org/W2028363955","https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W2407258439","https://openalex.org/W1422428439","https://openalex.org/W2045302173","https://openalex.org/W1483059930","https://openalex.org/W2768940598"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}