{"id":"https://openalex.org/W2594634482","doi":"https://doi.org/10.1007/s00453-020-00759-7","title":"Tight Bounds for Online Coloring of Basic Graph Classes","display_name":"Tight Bounds for Online Coloring of Basic Graph Classes","publication_year":2020,"publication_date":"2020-08-25","ids":{"openalex":"https://openalex.org/W2594634482","doi":"https://doi.org/10.1007/s00453-020-00759-7","mag":"2594634482"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-020-00759-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00759-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00759-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00759-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074909595","display_name":"Susanne Albers","orcid":"https://orcid.org/0000-0001-5848-5360"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033117542","display_name":"Sebastian Schraink","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Schraink","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074909595"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3223,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59815562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"83","issue":"1","first_page":"337","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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":0.9998999834060669,"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.9984999895095825,"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.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6841987371444702},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6057313680648804},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5730436444282532},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5549797415733337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5440536737442017},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5102808475494385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5070545673370361},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4980654716491699},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4951707422733307},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.47039708495140076},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4504122734069824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44848737120628357},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.42810124158859253},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.36263829469680786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3462064266204834},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.328945517539978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26847779750823975}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6841987371444702},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6057313680648804},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5730436444282532},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5549797415733337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5440536737442017},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5102808475494385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5070545673370361},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4980654716491699},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4951707422733307},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.47039708495140076},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4504122734069824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44848737120628357},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.42810124158859253},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.36263829469680786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3462064266204834},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.328945517539978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26847779750823975},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s00453-020-00759-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00759-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00759-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:7826","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1702.07172","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.07172","pdf_url":"https://arxiv.org/pdf/1702.07172","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2594634482","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1702.07172v2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:mediatum.ub.tum.de:node/1616855","is_oa":true,"landing_page_url":"https://mediatum.ub.tum.de/1616855","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"doi:10.48550/arxiv.1702.07172","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1702.07172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.esa.2017.7","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2017.7","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2964175068","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2017/7826/pdf/LIPIcs-ESA-2017-7.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418381","display_name":"European Symposium on Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Symposium on Algorithms","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s00453-020-00759-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-020-00759-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-020-00759-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2594634482.pdf","grobid_xml":"https://content.openalex.org/works/W2594634482.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W132569744","https://openalex.org/W1590036224","https://openalex.org/W1988407539","https://openalex.org/W2004070233","https://openalex.org/W2020138610","https://openalex.org/W2022525153","https://openalex.org/W2023146810","https://openalex.org/W2033961412","https://openalex.org/W2038445565","https://openalex.org/W2041645394","https://openalex.org/W2053369727","https://openalex.org/W2056760235","https://openalex.org/W2057674319","https://openalex.org/W2084263468","https://openalex.org/W2084535093","https://openalex.org/W2094578294","https://openalex.org/W2095152966","https://openalex.org/W2136536722","https://openalex.org/W2148158683","https://openalex.org/W2156300919","https://openalex.org/W2166858292","https://openalex.org/W2170823181","https://openalex.org/W2178802647","https://openalex.org/W2316420903","https://openalex.org/W2606892140","https://openalex.org/W2624545553","https://openalex.org/W2766932952","https://openalex.org/W2809805937","https://openalex.org/W2986773320","https://openalex.org/W4236932429","https://openalex.org/W4246661544"],"related_works":["https://openalex.org/W2964175068","https://openalex.org/W2028751262","https://openalex.org/W3040471007","https://openalex.org/W2296003088","https://openalex.org/W2005942657","https://openalex.org/W2026881717","https://openalex.org/W2964299325","https://openalex.org/W2104483759","https://openalex.org/W2964030863","https://openalex.org/W2104685510","https://openalex.org/W2022155283","https://openalex.org/W2295455748","https://openalex.org/W2792328557","https://openalex.org/W2962968573","https://openalex.org/W3104625252","https://openalex.org/W2963996796","https://openalex.org/W2762099945","https://openalex.org/W2789411239","https://openalex.org/W2768566391","https://openalex.org/W7671684"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"resolve":[2],"a":[3,124,140,161],"number":[4,120],"of":[5,23,69,94,121,123,142,164,198,205],"long-standing":[6],"open":[7],"problems":[8],"in":[9],"online":[10,24,41,71,99,137,232],"graph":[11,28,77,209],"coloring.":[12],"More":[13],"specifically,":[14],"we":[15,51,127],"develop":[16],"tight":[17],"lower":[18,53],"bounds":[19,36,54],"on":[20,66],"the":[21,67,74,90,119,206,214],"performance":[22,68],"algorithms":[25,72,100],"for":[26,39,43,55,73,180,203],"fundamental":[27],"classes.":[29],"An":[30],"important":[31],"contribution":[32],"is":[33,101,118,201],"that":[34,89,129],"our":[35,199],"also":[37],"hold":[38],"randomized":[40,70,98,231],"algorithms,":[42],"which":[44],"hardly":[45],"any":[46,181],"results":[47,65,200],"were":[48],"known.":[49],"Technically,":[50],"construct":[52],"chordal":[56],"graphs.":[57,86],"The":[58],"constructions":[59],"then":[60],"allow":[61],"us":[62],"to":[63,160,225],"derive":[64],"following":[75],"further":[76],"classes:":[78],"trees,":[79],"planar,":[80],"bipartite,":[81],"inductive,":[82],"bounded-treewidth":[83],"and":[84,97,230],"disk":[85],"It":[87],"shows":[88],"best":[91],"competitive":[92],"ratio":[93],"both":[95],"deterministic":[96,229],"$$\\Theta":[102],"(\\log":[103],"n)$$":[104,145],"<mml:math":[105,146,168,185],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[106,147,169,186],"<mml:mrow>":[107,148,172,187],"<mml:mi>\u0398</mml:mi>":[108],"<mml:mo>(</mml:mo>":[109,150],"<mml:mo>log</mml:mo>":[110,153],"<mml:mi>n</mml:mi>":[111,151,154,171],"<mml:mo>)</mml:mo>":[112,155],"</mml:mrow>":[113,156,176,193],"</mml:math>":[114,157,178,194],",":[115,179],"where":[116],"n":[117],"vertices":[122],"graph.":[125],"Furthermore,":[126],"prove":[128],"this":[130],"guarantee":[131],"cannot":[132],"be":[133],"improved":[134],"if":[135],"an":[136,221],"algorithm":[138,219],"has":[139],"lookahead":[141],"size":[143,165],"$$O(n/\\log":[144],"<mml:mi>O</mml:mi>":[149],"<mml:mo>/</mml:mo>":[152],"or":[158],"access":[159],"reordering":[162],"buffer":[163],"$$n^{1-\\epsilon":[166],"}$$":[167],"<mml:msup>":[170],"<mml:mn>1</mml:mn>":[173,192],"<mml:mo>-</mml:mo>":[174],"<mml:mi>\u03f5</mml:mi>":[175,190],"</mml:msup>":[177],"$$0&lt;\\epsilon":[182],"\\le":[183],"1$$":[184],"<mml:mn>0</mml:mn>":[188],"<mml:mo>&lt;</mml:mo>":[189],"<mml:mo>\u2264</mml:mo>":[191],".":[195],"A":[196],"consequence":[197],"that,":[202],"all":[204],"above":[207],"mentioned":[208],"classes":[210],"except":[211],"bipartite":[212],"graphs,":[213],"natural":[215],"First":[216],"Fit":[217],"coloring":[218],"achieves":[220],"optimal":[222],"performance,":[223],"up":[224],"constant":[226],"factors,":[227],"among":[228],"algorithms.":[233]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}