{"id":"https://openalex.org/W1491462073","doi":"https://doi.org/10.1007/s00453-016-0130-2","title":"An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths","display_name":"An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths","publication_year":2016,"publication_date":"2016-02-09","ids":{"openalex":"https://openalex.org/W1491462073","doi":"https://doi.org/10.1007/s00453-016-0130-2","mag":"1491462073"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0130-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0130-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0130-2.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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0130-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107964690","display_name":"Piotr Micek","orcid":"https://orcid.org/0000-0001-9796-5375"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Piotr Micek","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland","Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland","institution_ids":["https://openalex.org/I126596746"]},{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058868357","display_name":"Veit Wiechert","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["DE","PL"],"is_corresponding":false,"raw_author_name":"Veit Wiechert","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland","Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland","institution_ids":["https://openalex.org/I126596746"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107964690"],"corresponding_institution_ids":["https://openalex.org/I126596746"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3037,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.61615826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"77","issue":"4","first_page":"1060","last_page":"1070"},"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.9925000071525574,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.9154281616210938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7594327926635742},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.6240986585617065},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.605538010597229},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5617297291755676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5425871014595032},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5348450541496277},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5142638087272644},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5061630606651306},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4971466362476349},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4778808653354645},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4752923250198364},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4588701128959656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3856423795223236},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3584638237953186},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3326778709888458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20543348789215088},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06269633769989014}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9154281616210938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7594327926635742},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.6240986585617065},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.605538010597229},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5617297291755676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5425871014595032},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5348450541496277},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5142638087272644},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5061630606651306},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4971466362476349},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4778808653354645},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4752923250198364},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4588701128959656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3856423795223236},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3584638237953186},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3326778709888458},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20543348789215088},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06269633769989014},{"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/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-016-0130-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0130-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0130-2.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:ruj.uj.edu.pl:item/40857","is_oa":true,"landing_page_url":"http://ruj.uj.edu.pl/xmlui/handle/item/40857","pdf_url":null,"source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","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":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"artyku\u0142 w czasopi\u015bmie"}],"best_oa_location":{"id":"doi:10.1007/s00453-016-0130-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0130-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0130-2.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":[{"id":"https://openalex.org/G6478523141","display_name":null,"funder_award_id":"GRK 1408","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1491462073.pdf","grobid_xml":"https://content.openalex.org/works/W1491462073.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1488681147","https://openalex.org/W1836901806","https://openalex.org/W1995855402","https://openalex.org/W2070091108","https://openalex.org/W2130271612","https://openalex.org/W2132095827","https://openalex.org/W2166858292","https://openalex.org/W2170823181","https://openalex.org/W2280668383","https://openalex.org/W3098594656"],"related_works":["https://openalex.org/W151506147","https://openalex.org/W2793500002","https://openalex.org/W4294957130","https://openalex.org/W4297911588","https://openalex.org/W1542397451","https://openalex.org/W4291316360","https://openalex.org/W4311345810","https://openalex.org/W1973571353","https://openalex.org/W4229960859","https://openalex.org/W1546043504"],"abstract_inverted_index":{"The":[0],"existence":[1],"of":[2],"an":[3,37],"on-line":[4,38],"competitive":[5,39],"algorithm":[6,41],"for":[7,24,42],"coloring":[8,40],"bipartite":[9,25,46],"graphs":[10,26,31],"is":[11],"a":[12],"tantalizing":[13],"open":[14],"problem.":[15],"So":[16],"far":[17],"there":[18],"are":[19],"only":[20],"partial":[21],"positive":[22],"results":[23],"with":[27],"certain":[28],"small":[29],"forbidden":[30],"as":[32],"induced":[33],"subgraphs.":[34],"We":[35],"propose":[36],"P":[43],"9":[44],"-free":[45],"graphs.":[47]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}