{"id":"https://openalex.org/W1825079874","doi":"https://doi.org/10.1007/978-3-319-18263-6_16","title":"Online Dual Edge Coloring of Paths and Trees","display_name":"Online Dual Edge Coloring of Paths and Trees","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1825079874","doi":"https://doi.org/10.1007/978-3-319-18263-6_16","mag":"1825079874"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-18263-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18263-6_16","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/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":true,"raw_author_name":"Lene M. Favrholdt","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027425067","display_name":"Jesper W. Mikkelsen","orcid":"https://orcid.org/0000-0002-6905-5953"},"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":"Jesper W. Mikkelsen","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023065140"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7227,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67882472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"181","last_page":"192"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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/T11182","display_name":"Auction Theory and Applications","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6840298771858215},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5890377759933472},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5642518401145935},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5501368045806885},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5379166603088379},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5196622610092163},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5021164417266846},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.48125526309013367},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47920188307762146},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.47120732069015503},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4309615194797516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42367738485336304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3897075951099396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3016998767852783},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2996787130832672},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20252883434295654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13307806849479675},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.07476791739463806}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840298771858215},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5890377759933472},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5642518401145935},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5501368045806885},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5379166603088379},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5196622610092163},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5021164417266846},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.48125526309013367},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47920188307762146},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.47120732069015503},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4309615194797516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42367738485336304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3897075951099396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3016998767852783},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2996787130832672},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20252883434295654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13307806849479675},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.07476791739463806},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-18263-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18263-6_16","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:sdu.dk:openaire_cris_publications/d1d497ef-61cf-4eac-95fc-5cd55b1f3555","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/d1d497ef-61cf-4eac-95fc-5cd55b1f3555","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":"Favrholdt, L M & Mikkelsen, J W 2015, Online Dual Edge Coloring of Paths and Trees. in E Bampis & O Svensson (eds), Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wroclaw, Poland, September 11-12, 2014, Revised Selected Papers. Springer, Lecture Notes in Computer Science, vol. 8952, pp. 181-192, Workshop on Approximation and Online Algorithms, Wroc\u0142aw, Poland, 11/09/2014. https://doi.org/10.1007/978-3-319-18263-6_16","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":17,"referenced_works":["https://openalex.org/W82127983","https://openalex.org/W1484228278","https://openalex.org/W1552828154","https://openalex.org/W1553377418","https://openalex.org/W1825079874","https://openalex.org/W1973759622","https://openalex.org/W1979880971","https://openalex.org/W1986826668","https://openalex.org/W2011670396","https://openalex.org/W2023146810","https://openalex.org/W2033199347","https://openalex.org/W2033855099","https://openalex.org/W2041645394","https://openalex.org/W2070091108","https://openalex.org/W2093548869","https://openalex.org/W2178802647","https://openalex.org/W2765379080"],"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":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}