{"id":"https://openalex.org/W4399522865","doi":"https://doi.org/10.1145/3618260.3649741","title":"Online Edge Coloring Is (Nearly) as Easy as Offline","display_name":"Online Edge Coloring Is (Nearly) as Easy as Offline","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522865","doi":"https://doi.org/10.1145/3618260.3649741"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649741","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649741","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649741","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649741","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081781976","display_name":"Joakim Blikstad","orcid":"https://orcid.org/0009-0004-0874-2356"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["DE","SE"],"is_corresponding":false,"raw_author_name":"Joakim Blikstad","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden / Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0009-0004-0874-2356","affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden / Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-2997-1372","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093234942","display_name":"Radu Vintan","orcid":"https://orcid.org/0009-0000-6713-7253"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Radu Vintan","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0009-0000-6713-7253","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033052575","display_name":"David Wajc","orcid":"https://orcid.org/0000-0003-1896-2948"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Wajc","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0003-1896-2948","affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1855,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88062082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"46"},"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.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980000257492065,"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/combinatorics","display_name":"Combinatorics","score":0.7661640048027039},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.7466018795967102},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7442092895507812},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6524425745010376},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.6417482495307922},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6082139015197754},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.5720339417457581},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5563659071922302},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5485402941703796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5474191904067993},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5192254185676575},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5154310464859009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4452371895313263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4242689609527588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30551984906196594},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10961976647377014},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.09485360980033875},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.08961394429206848},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07743042707443237}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7661640048027039},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.7466018795967102},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7442092895507812},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6524425745010376},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.6417482495307922},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6082139015197754},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5720339417457581},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5563659071922302},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5485402941703796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5474191904067993},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5192254185676575},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5154310464859009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4452371895313263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4242689609527588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30551984906196594},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10961976647377014},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.09485360980033875},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08961394429206848},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07743042707443237},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649741","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649741","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649741","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649741","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649741","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649741","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522865.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1486613786","https://openalex.org/W1986826668","https://openalex.org/W2024769658","https://openalex.org/W2056760235","https://openalex.org/W2083459869","https://openalex.org/W2131951207","https://openalex.org/W2162656786","https://openalex.org/W2165076510","https://openalex.org/W2296003088","https://openalex.org/W2777690836","https://openalex.org/W2949565166","https://openalex.org/W2971658570","https://openalex.org/W2972193181","https://openalex.org/W3029111739","https://openalex.org/W3114381360","https://openalex.org/W3126370525","https://openalex.org/W3127045178","https://openalex.org/W3128814395","https://openalex.org/W3214604542","https://openalex.org/W4376639542","https://openalex.org/W4390579303","https://openalex.org/W4399522865"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W398688634","https://openalex.org/W3169197204","https://openalex.org/W2585997002","https://openalex.org/W4320918672","https://openalex.org/W2380525562","https://openalex.org/W4252904121","https://openalex.org/W4229747356","https://openalex.org/W2042876012","https://openalex.org/W1542397451"],"abstract_inverted_index":{"The":[0],"classic":[1],"theorem":[2],"of":[3,11,53,68,110,123,129,136,143],"Vizing":[4],"(Diskret.":[5],"Analiz.\u201964)":[6],"asserts":[7],"that":[8,43],"any":[9],"graph":[10],"maximum":[12,54],"degree":[13,55],"\u0394":[14,27],"can":[15,46],"be":[16,47],"edge":[17,78,112,126,140],"colored":[18],"(offline)":[19],"using":[20,64],"no":[21],"more":[22],"than":[23],"\u0394+1":[24],"colors":[25,69],"(with":[26],"being":[28],"a":[29,44,65],"trivial":[30],"lower":[31],"bound).":[32],"In":[33,94],"the":[34,103,106,124,137],"online":[35,49,121],"setting,":[36],"Bar-Noy,":[37],"Motwani":[38],"and":[39,135],"Naor":[40],"(IPL\u201992)":[41],"conjectured":[42],"(1+o(1))\u0394-edge-coloring":[45],"computed":[48],"in":[50,102,105],"n-vertex":[51],"graphs":[52],"\u0394=\u03c9(logn).":[56],"Numerous":[57],"algorithms":[58],"made":[59],"progress":[60],"on":[61],"this":[62,95,99,117],"question,":[63],"higher":[66],"number":[67],"or":[70,80],"assuming":[71],"restricted":[72],"arrival":[73],"models,":[74],"such":[75],"as":[76],"random-order":[77],"arrivals":[79,82],"vertex":[81],"(e.g.,":[83],"AGKM":[84],"FOCS\u201903,":[85],"BMM":[86],"SODA\u201910,":[87],"CPW":[88],"FOCS\u201919,":[89],"BGW":[90],"SODA\u201921,":[91],"KLSST":[92],"STOC\u201922).":[93],"work,":[96],"we":[97],"resolve":[98],"longstanding":[100],"conjecture":[101],"affirmative":[104],"most":[107],"general":[108],"setting":[109],"adversarial":[111],"arrivals.":[113],"We":[114],"further":[115],"generalize":[116],"result":[118,128,142],"to":[119],"obtain":[120],"counterparts":[122],"list":[125],"coloring":[127,141],"Kahn":[130],"(J.":[131],"Comb.":[132],"Theory.":[133],"A\u201996)":[134],"recent":[138],"\u201clocal\u201d":[139],"Christiansen":[144],"(STOC\u201923).":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}