{"id":"https://openalex.org/W1985367371","doi":"https://doi.org/10.1007/s00236-013-0184-4","title":"Online multi-coloring on the path revisited","display_name":"Online multi-coloring on the path revisited","publication_year":2013,"publication_date":"2013-08-21","ids":{"openalex":"https://openalex.org/W1985367371","doi":"https://doi.org/10.1007/s00236-013-0184-4","mag":"1985367371"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-013-0184-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-013-0184-4","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5026815936","display_name":"Marie G. Christ","orcid":"https://orcid.org/0000-0001-7904-1398"},"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":true,"raw_author_name":"Marie G. Christ","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230\u00a0, Odense M, Denmark","Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230\u00a0, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023065140","display_name":"Lene M. Favrholdt","orcid":"https://orcid.org/0000-0003-3054-2997"},"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":"Lene M. Favrholdt","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230\u00a0, Odense M, Denmark","Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230\u00a0, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230","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, 5230\u00a0, Odense M, Denmark","Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230\u00a0, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026815936"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.5194,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83955536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","issue":"5-6","first_page":"343","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9907000064849854,"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.9902999997138977,"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/theory-of-computation","display_name":"Theory of computation","score":0.7779196500778198},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6309980154037476},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6032555103302002},{"id":"https://openalex.org/keywords/frequency-assignment","display_name":"Frequency assignment","score":0.5964021682739258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5663926005363464},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5512321591377258},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.5175277590751648},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4872418940067291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44906747341156006},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43802139163017273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4349370300769806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4299091696739197},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42666682600975037},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41056862473487854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3962118923664093},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3424508571624756},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10678732395172119},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10516637563705444}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7779196500778198},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6309980154037476},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6032555103302002},{"id":"https://openalex.org/C2776628324","wikidata":"https://www.wikidata.org/wiki/Q22222748","display_name":"Frequency assignment","level":2,"score":0.5964021682739258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5663926005363464},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5512321591377258},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.5175277590751648},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4872418940067291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44906747341156006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43802139163017273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4349370300769806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4299091696739197},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42666682600975037},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41056862473487854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3962118923664093},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3424508571624756},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10678732395172119},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10516637563705444},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00236-013-0184-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-013-0184-4","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/ded116a5-ad79-45e6-8664-f57343f61a3d","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/ded116a5-ad79-45e6-8664-f57343f61a3d","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":"Christ, M G, Favrholdt, L M & Larsen, K S 2013, 'Online Multi-Coloring on the Path Revisited', Acta Informatica, vol. 50, no. 5/6, pp. 343-357. https://doi.org/10.1007/s00236-013-0184-4","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W345637930","https://openalex.org/W1508604175","https://openalex.org/W1552828154","https://openalex.org/W1575741046","https://openalex.org/W1998757084","https://openalex.org/W2011670396","https://openalex.org/W2023146810","https://openalex.org/W2041645394","https://openalex.org/W2055960596","https://openalex.org/W2089269509","https://openalex.org/W2156086528","https://openalex.org/W2169071224","https://openalex.org/W4236375914"],"related_works":["https://openalex.org/W2154716867","https://openalex.org/W2011643166","https://openalex.org/W2951573806","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W1996806106","https://openalex.org/W1963663039","https://openalex.org/W4241266436","https://openalex.org/W2087343661","https://openalex.org/W1802738979"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
