{"id":"https://openalex.org/W3102398283","doi":"https://doi.org/10.4230/lipics.isaac.2022.22","title":"Finding Matching Cuts in H-Free Graphs","display_name":"Finding Matching Cuts in H-Free Graphs","publication_year":2020,"publication_date":"2020-11-06","ids":{"openalex":"https://openalex.org/W3102398283","doi":"https://doi.org/10.4230/lipics.isaac.2022.22","mag":"3102398283"},"language":"en","primary_location":{"id":"pmh:oai:dro.dur.ac.uk.OAI2:37194","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/37194/","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Bae,  Sang Won & Park,  Heejin (Eds.).  33rd International Symposium on Algorithms and Computation (ISAAC 2022). : Dagstuhl, pp. 22:1-22:16, LIPIcs, Vol.248","raw_type":"Book chapter"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://dro.dur.ac.uk/37194/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lucke, Felicia","orcid":"https://orcid.org/0000-0002-9860-2928"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'Etudes et De Recherche en Informatique et Communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210145724"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Lucke, Felicia","raw_affiliation_strings":["Department of Informatics, University of Fribourg, Switzerland","CEDRIC. Optimisation Combinatoire"],"raw_orcid":"https://orcid.org/0000-0002-9860-2928","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Fribourg, Switzerland","institution_ids":[]},{"raw_affiliation_string":"CEDRIC. Optimisation Combinatoire","institution_ids":["https://openalex.org/I4210145724"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Paulusma, Dani\u00ebl","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]},{"id":"https://openalex.org/I4210145724","display_name":"Centre d'Etudes et De Recherche en Informatique et Communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210145724"]}],"countries":["CH","FR"],"is_corresponding":false,"raw_author_name":"Paulusma, Dani\u00ebl","raw_affiliation_strings":["Department of Computer Science, Durham University, UK","Centre d'\u00e9tudes et de recherche en informatique et communications"],"raw_orcid":"https://orcid.org/0000-0001-5945-9287","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, UK","institution_ids":[]},{"raw_affiliation_string":"Centre d'\u00e9tudes et de recherche en informatique et communications","institution_ids":["https://openalex.org/I4210145724"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ries, Bernard","orcid":"https://orcid.org/0000-0003-4395-5547"},"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":"Ries, Bernard","raw_affiliation_strings":["Department of Informatics, University of Fribourg, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-4395-5547","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Fribourg, Switzerland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I4210145724"],"apc_list":null,"apc_paid":null,"fwci":0.5781,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74510521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9898999929428101,"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.9848999977111816,"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/combinatorics","display_name":"Combinatorics","score":0.856522798538208},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8440954089164734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7465522289276123},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6159511208534241},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6078513860702515},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6074389219284058},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5570762157440186},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5513253211975098},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.521967351436615},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.49820995330810547},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49607953429222107},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.46159669756889343},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4515204131603241},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4104848802089691},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34214919805526733},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.28430038690567017}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.856522798538208},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8440954089164734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7465522289276123},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6159511208534241},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6078513860702515},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6074389219284058},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5570762157440186},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5513253211975098},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.521967351436615},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.49820995330810547},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49607953429222107},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.46159669756889343},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4515204131603241},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4104848802089691},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34214919805526733},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28430038690567017},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"pmh:oai:dro.dur.ac.uk.OAI2:37194","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/37194/","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Bae,  Sang Won & Park,  Heejin (Eds.).  33rd International Symposium on Algorithms and Computation (ISAAC 2022). : Dagstuhl, pp. 22:1-22:16, LIPIcs, Vol.248","raw_type":"Book chapter"},{"id":"pmh:oai:arXiv.org:2011.03318","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.03318","pdf_url":"https://arxiv.org/pdf/2011.03318","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:HAL:hal-02995237v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02995237","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2020","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:drops-oai.dagstuhl.de:17307","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.22","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:durham-repository.worktribe.com:1620330","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1620330","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":"publishedVersion"},{"id":"doi:10.48550/arxiv.2011.03318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2011.03318","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.isaac.2022.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2022.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"doi:10.4230/lipics.isaac.2023.31","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2023.31","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:dro.dur.ac.uk.OAI2:37194","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/37194/","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Bae,  Sang Won & Park,  Heejin (Eds.).  33rd International Symposium on Algorithms and Computation (ISAAC 2022). : Dagstuhl, pp. 22:1-22:16, LIPIcs, Vol.248","raw_type":"Book chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1976347563","https://openalex.org/W2012246276","https://openalex.org/W2030973065","https://openalex.org/W2034093914","https://openalex.org/W2046680668","https://openalex.org/W2082548475","https://openalex.org/W2087872235","https://openalex.org/W2095269023","https://openalex.org/W2157529519","https://openalex.org/W2611093227","https://openalex.org/W2798321768"],"related_works":["https://openalex.org/W2625505879","https://openalex.org/W4226049246","https://openalex.org/W3130332934","https://openalex.org/W2031276298","https://openalex.org/W2288749733","https://openalex.org/W2061237693","https://openalex.org/W1977862280","https://openalex.org/W2083238533","https://openalex.org/W2093170838","https://openalex.org/W2032987509"],"abstract_inverted_index":{"Perfect":[0],"Matching-Cut":[1],"is":[2,23],"the":[3,63],"problem":[4,22],"of":[5,44,51,66],"deciding":[6],"whether":[7],"a":[8,11],"graph":[9],"has":[10],"perfect":[12],"matching":[13],"that":[14,20,56],"contains":[15],"an":[16],"edge-cut.":[17],"We":[18,54],"show":[19,55],"this":[21],"NP-complete":[24],"for":[25,32,38,42,48,62],"planar":[26,33],"graphs":[27,34,43,50,77],"with":[28,35,73,78],"maximum":[29],"degree":[30],"four,":[31],"girth":[36],"five,":[37],"bipartite":[39,49,72],"five-regular":[40],"graphs,":[41],"diameter":[45,52,70,74],"three":[46,75],"and":[47,76],"four.":[53],"there":[57],"exist":[58],"polynomial":[59],"time":[60],"algorithms":[61],"following":[64],"classes":[65],"graphs:":[67],"claw-free,":[68],"$P_5$-free,":[69],"two,":[71],"bounded":[79],"tree-width.":[80]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2024-10-07T00:00:00"}