{"id":"https://openalex.org/W2042443761","doi":"https://doi.org/10.1137/090753863","title":"First-Fit Algorithm for the On-Line Chain Partitioning Problem","display_name":"First-Fit Algorithm for the On-Line Chain Partitioning Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2042443761","doi":"https://doi.org/10.1137/090753863","mag":"2042443761"},"language":"en","primary_location":{"id":"doi:10.1137/090753863","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090753863","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ruj.uj.edu.pl/xmlui/handle/item/169387","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038469350","display_name":"Bart\u0142omiej Bosek","orcid":"https://orcid.org/0000-0001-8756-3663"},"institutions":[{"id":"https://openalex.org/I76587968","display_name":"Bose (United States)","ror":"https://ror.org/0427k1a73","country_code":"US","type":"company","lineage":["https://openalex.org/I76587968"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bart\u0141omiej Bosek","raw_affiliation_strings":["bosek@tcs.uj.edu.pl and krawczyk@tcs.uj.edu.pl and szczypka@tcs.uj.edu.pl#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"bosek@tcs.uj.edu.pl and krawczyk@tcs.uj.edu.pl and szczypka@tcs.uj.edu.pl#TAB#","institution_ids":["https://openalex.org/I76587968"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010286238","display_name":"Tomasz Krawczyk","orcid":"https://orcid.org/0000-0002-3093-2584"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tomasz Krawczyk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058691945","display_name":"Edward Szczypka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Edward Szczypka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1225,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.93858384,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"23","issue":"4","first_page":"1992","last_page":"1999"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9969000220298767,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7695810198783875},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.7663482427597046},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7441489696502686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7335724830627441},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6625952124595642},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.5541651248931885},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5109385848045349},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5002191066741943},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4528336524963379},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44617584347724915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33755767345428467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15529263019561768}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7695810198783875},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.7663482427597046},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7441489696502686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7335724830627441},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6625952124595642},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.5541651248931885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5109385848045349},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5002191066741943},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4528336524963379},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44617584347724915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33755767345428467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15529263019561768},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090753863","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090753863","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/169387","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/169387","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ruj.uj.edu.pl:item/169387","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/xmlui/handle/item/169387","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"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":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1987042917","https://openalex.org/W2000763343","https://openalex.org/W2013393952","https://openalex.org/W2021339822","https://openalex.org/W2029134832","https://openalex.org/W2044935944","https://openalex.org/W2094108224","https://openalex.org/W4254807835"],"related_works":["https://openalex.org/W3086542228","https://openalex.org/W3189210424","https://openalex.org/W2138023150","https://openalex.org/W2046926085","https://openalex.org/W1617742873","https://openalex.org/W3041851955","https://openalex.org/W2092046762","https://openalex.org/W4224943736","https://openalex.org/W4298354580","https://openalex.org/W2595921241"],"abstract_inverted_index":{"We":[0,78],"consider":[1],"a":[2,6,24,64],"problem":[3],"of":[4,26,46,56,67,83],"partitioning":[5,76],"partially":[7],"ordered":[8],"set":[9],"into":[10],"chains":[11,22,41,55],"by":[12,89],"first-fit":[13],"algorithm.":[14],"In":[15,30,59],"general":[16],"this":[17,31,60],"algorithm":[18],"uses":[19,37],"arbitrarily":[20],"many":[21],"on":[23],"class":[25,66],"bounded":[27],"width":[28,47],"posets.":[29],"paper":[32],"we":[33,62],"prove":[34],"that":[35],"First-Fit":[36],"at":[38],"most":[39],"$3tw^2$":[40],"to":[42],"partition":[43],"any":[44],"poset":[45],"w":[48],"which":[49],"does":[50],"not":[51],"induce":[52],"two":[53],"incomparable":[54],"height":[57],"t.":[58],"way":[61],"get":[63],"wide":[65],"posets":[68],"with":[69],"polynomial":[70],"bound":[71],"for":[72,86],"the":[73],"on-line":[74],"chain":[75],"problem.":[77],"also":[79],"discuss":[80],"some":[81],"consequences":[82],"our":[84],"result":[85],"coloring":[87],"graphs":[88],"First-Fit.":[90]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}