{"id":"https://openalex.org/W3160792420","doi":"https://doi.org/10.1007/978-3-030-79987-8_29","title":"Disjoint Paths and Connected Subgraphs for H-Free Graphs","display_name":"Disjoint Paths and Connected Subgraphs for H-Free Graphs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3160792420","doi":"https://doi.org/10.1007/978-3-030-79987-8_29","mag":"3160792420"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-79987-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-79987-8_29","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2105.06349","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056030509","display_name":"Walter Kern","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Walter Kern","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Twente, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Twente, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"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":"Barnaby Martin","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","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":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003084202","display_name":"Siani Smith","orcid":"https://orcid.org/0000-0003-0797-0512"},"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":"Siani Smith","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erik Jan van Leeuwen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5056030509"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.545,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65368421,"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":"414","last_page":"427"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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.9950000047683716,"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/disjoint-sets","display_name":"Disjoint sets","score":0.9135140776634216},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8064595460891724},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6677556037902832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5269689559936523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5208021402359009},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4916849732398987},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4702393412590027},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39115995168685913},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.31396591663360596},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12844324111938477}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.9135140776634216},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8064595460891724},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6677556037902832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5269689559936523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5208021402359009},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4916849732398987},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4702393412590027},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39115995168685913},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.31396591663360596},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12844324111938477},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/978-3-030-79987-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-79987-8_29","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/55baa543-b73c-48b2-a4f9-7067cddc0659","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/55baa543-b73c-48b2-a4f9-7067cddc0659","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":"Kern, W, Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2021, Disjoint Paths and Connected Subgraphs for H-Free Graphs. in P Flocchini & L Moura (eds), Combinatorial Algorithms : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12757, Springer, Cham, pp. 414-427, 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, Virtual, Online, 5/07/21. https://doi.org/10.1007/978-3-030-79987-8_29","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:33119","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/33119/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Flocchini,  Paola & Moura,  Lucia (Eds.).  Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5\u20137, 2021, Proceedings. : Springer, pp. 414-427, Lecture Notes in Computer Science, Vol.12757","raw_type":"Book chapter"},{"id":"pmh:oai:arXiv.org:2105.06349","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06349","pdf_url":"https://arxiv.org/pdf/2105.06349","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":"pmh:oai:dspace.library.uu.nl:1874/416033","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/416033","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"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":null,"raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1625144","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1625144","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":"acceptedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/4012f31d-fd3e-4edb-a82f-8c5ae67a2f2d","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/4012f31d-fd3e-4edb-a82f-8c5ae67a2f2d","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kern, W, Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2021, Disjoint Paths and Connected Subgraphs for H-Free Graphs. in P Flocchini & L Moura (eds), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12757 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 414-427. https://doi.org/10.1007/978-3-030-79987-8_29","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/4012f31d-fd3e-4edb-a82f-8c5ae67a2f2d","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/4012f31d-fd3e-4edb-a82f-8c5ae67a2f2d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"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":"Kern, W, Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2021, Disjoint Paths and Connected Subgraphs for H-Free Graphs. in P Flocchini & L Moura (eds), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12757 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 414-427. https://doi.org/10.1007/978-3-030-79987-8_29","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/4012f31d-fd3e-4edb-a82f-8c5ae67a2f2d","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85111953680&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"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":"Kern, W, Martin, B, Paulusma, D, Smith, S & van Leeuwen, E J 2021, Disjoint Paths and Connected Subgraphs for H-Free Graphs. in P Flocchini & L Moura (eds), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12757 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 414-427. https://doi.org/10.1007/978-3-030-79987-8_29","raw_type":"contributionToPeriodical"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/416475","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/416475","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, 12757 LNCS, 414. Springer","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2105.06349","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.06349","pdf_url":"https://arxiv.org/pdf/2105.06349","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W19363943","https://openalex.org/W94262720","https://openalex.org/W100926944","https://openalex.org/W1532861364","https://openalex.org/W1548261389","https://openalex.org/W1832071916","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1976285925","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2019800388","https://openalex.org/W2028775537","https://openalex.org/W2084983168","https://openalex.org/W2109121075","https://openalex.org/W2115589427","https://openalex.org/W2126913088","https://openalex.org/W2157529519","https://openalex.org/W2159973663","https://openalex.org/W3034539478","https://openalex.org/W3113647070","https://openalex.org/W4213168420"],"related_works":["https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W2083238533","https://openalex.org/W3139101777","https://openalex.org/W4385327816","https://openalex.org/W4287181997","https://openalex.org/W2584187496","https://openalex.org/W2061237693","https://openalex.org/W3160792420","https://openalex.org/W4220852510"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}