{"id":"https://openalex.org/W1488681147","doi":"https://doi.org/10.1007/11758471_28","title":"On-Line Coloring of H-Free Bipartite Graphs","display_name":"On-Line Coloring of H-Free Bipartite Graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1488681147","doi":"https://doi.org/10.1007/11758471_28","mag":"1488681147"},"language":"en","primary_location":{"id":"doi:10.1007/11758471_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11758471_28","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":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1161971","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"H. J. Broersma","raw_affiliation_strings":["Department of Computer Science, Durham University, Science Labs, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Labs, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041916584","display_name":"Agostino Capponi","orcid":"https://orcid.org/0000-0001-9735-7935"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Capponi","raw_affiliation_strings":["Computer Science, Division of Engineering and Applied Sciences, California Institute of Technology, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science, Division of Engineering and Applied Sciences, California Institute of Technology, U.S.A","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Science Labs, South Road, Durham, DH1 3LE, England"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Science Labs, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068613759"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2552,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76873489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"284","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.9193339347839355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8237566351890564},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5254608392715454},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5067272782325745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.503107488155365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4425317943096161},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43012890219688416},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.4205654263496399},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.41157156229019165},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3435245156288147},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2689177989959717},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24723535776138306}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9193339347839355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8237566351890564},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5254608392715454},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5067272782325745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.503107488155365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4425317943096161},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43012890219688416},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.4205654263496399},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.41157156229019165},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3435245156288147},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2689177989959717},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24723535776138306},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/11758471_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11758471_28","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:ris.utwente.nl:openaire_cris_publications/9565843e-402c-456e-885b-76870a70ee41","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/9565843e-402c-456e-885b-76870a70ee41","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Broersma, H J, Capponi, A & Paulusma, D 2006, On-line coloring of H-free bipartite graphs. in T Calamoneri, I Finocchi & G F Italiano (eds), Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings. Lecture Notes in Computer Science, vol. 3998, Springer, Berlin, Heidelberg, pp. 284-295, 6th Italian Conference on Algorithms and Complexity, CIAC 2006, Rome, Italy, 29/05/06. https://doi.org/10.1007/11758471_28","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:durham-repository.worktribe.com:1161971","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161971","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1161971","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161971","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1487760418","https://openalex.org/W1512794094","https://openalex.org/W1987042917","https://openalex.org/W1988407539","https://openalex.org/W2005668212","https://openalex.org/W2047840455","https://openalex.org/W2087978044","https://openalex.org/W2089191641","https://openalex.org/W2094108224","https://openalex.org/W2130271612","https://openalex.org/W2166858292","https://openalex.org/W2170823181","https://openalex.org/W2178802647"],"related_works":["https://openalex.org/W2084177987","https://openalex.org/W2358696866","https://openalex.org/W1607894075","https://openalex.org/W113425656","https://openalex.org/W2949063304","https://openalex.org/W2007053716","https://openalex.org/W3122467016","https://openalex.org/W1491462073","https://openalex.org/W2481690476","https://openalex.org/W4291638096"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}