{"id":"https://openalex.org/W1991699769","doi":"https://doi.org/10.1142/s0129054113500020","title":"A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS","display_name":"A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1991699769","doi":"https://doi.org/10.1142/s0129054113500020","mag":"1991699769"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500020","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500020","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5070565994","display_name":"Martin R. Ehmsen","orcid":null},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"MARTIN R. EHMSEN","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000210653","display_name":"Kim S. Larsen","orcid":"https://orcid.org/0000-0003-0560-3794"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"KIM S. LARSEN","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07275102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"01","first_page":"109","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9951000213623047,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.992900013923645,"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/extension","display_name":"Extension (predicate logic)","score":0.8098850846290588},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6822547912597656},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.6674643754959106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.601331353187561},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5953884720802307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5576055645942688},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.45972320437431335},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45004379749298096},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4408086836338043},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.43761250376701355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3784254491329193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3610984981060028},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33232352137565613},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2569654583930969},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10148262977600098}],"concepts":[{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.8098850846290588},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6822547912597656},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.6674643754959106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.601331353187561},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5953884720802307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5576055645942688},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.45972320437431335},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45004379749298096},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4408086836338043},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.43761250376701355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3784254491329193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3610984981060028},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33232352137565613},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2569654583930969},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10148262977600098},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054113500020","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500020","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/291e4eae-ab51-47ae-b8e8-564edcf5883a","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/291e4eae-ab51-47ae-b8e8-564edcf5883a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ehmsen, M R & Larsen, K S 2013, 'A Technique for Exact Computation of Precoloring Extension on Interval Graphs', International Journal of Foundations of Computer Science, vol. 24, no. 1, pp. 109-122. https://doi.org/10.1142/S0129054113500020","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W345637930","https://openalex.org/W1517036688","https://openalex.org/W1524265383","https://openalex.org/W1552828154","https://openalex.org/W1570425181","https://openalex.org/W2019992365","https://openalex.org/W2078396000","https://openalex.org/W2106097003","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W2982321410","https://openalex.org/W2392004567","https://openalex.org/W2940029036","https://openalex.org/W4388292429","https://openalex.org/W2756595502","https://openalex.org/W2046296964","https://openalex.org/W2010789764","https://openalex.org/W2219281195","https://openalex.org/W2187233292","https://openalex.org/W2071707387"],"abstract_inverted_index":{"Inspired":[0],"by":[1],"a":[2,13,20,56,71],"real-life":[3],"application,":[4],"we":[5],"investigate":[6],"the":[7,27,76,80,85],"computationally":[8],"hard":[9],"problem":[10],"of":[11,15,29],"extending":[12],"precoloring":[14],"an":[16,42],"interval":[17],"graph":[18],"to":[19,89],"proper":[21],"coloring":[22],"under":[23],"some":[24],"bound":[25],"on":[26,45,55,83],"number":[28],"available":[30,88],"colors.":[31],"We":[32,68],"are":[33],"interested":[34],"in":[35,48,50,65],"quickly":[36],"determining":[37],"whether":[38],"or":[39],"not":[40,63],"such":[41],"extension":[43],"exists":[44],"instances":[46],"occurring":[47],"practice":[49],"connection":[51],"with":[52],"campsite":[53],"bookings":[54],"campground.":[57],"A":[58],"naive":[59],"exhaustive":[60],"search":[61],"does":[62],"terminate":[64],"reasonable":[66],"time.":[67],"have":[69],"formulated":[70],"new":[72],"approach":[73],"which":[74],"moves":[75],"computation":[77],"time":[78],"within":[79],"usable":[81],"range":[82],"all":[84],"data":[86],"samples":[87],"us.":[90]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}