{"id":"https://openalex.org/W2032987509","doi":"https://doi.org/10.1007/s00453-003-1035-4","title":"Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size","display_name":"Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size","publication_year":2003,"publication_date":"2003-05-28","ids":{"openalex":"https://openalex.org/W2032987509","doi":"https://doi.org/10.1007/s00453-003-1035-4","mag":"2032987509"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1035-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1035-4","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062062864","display_name":"Daniel Kobler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel Kobler","raw_affiliation_strings":["Tm Bioscience, 439 University\n Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8","Tm Bioscience, 439 University Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tm Bioscience, 439 University\n Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8","institution_ids":[]},{"raw_affiliation_string":"Tm Bioscience, 439 University Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069504394","display_name":"Udi Rotics","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Udi Rotics","raw_affiliation_strings":["Tm Bioscience, 439 University\n Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8","Tm Bioscience, 439 University Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tm Bioscience, 439 University\n Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8","institution_ids":[]},{"raw_affiliation_string":"Tm Bioscience, 439 University Ave. Ste. 1100, Toronto, Ontario, Canada M5G 1Y8#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5062062864","https://openalex.org/A5069504394"],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.817,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.84697131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"37","issue":"4","first_page":"327","last_page":"346"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9896000027656555,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9886000156402588,"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.8815013766288757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7247647047042847},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.691918134689331},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6441842317581177},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6406101584434509},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6125989556312561},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5603769421577454},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5562755465507507},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5461089611053467},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.54074627161026},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.47642192244529724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4587422311306},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.45147576928138733},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.440432608127594},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4258768558502197},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.38154539465904236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31192854046821594}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8815013766288757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7247647047042847},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.691918134689331},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6441842317581177},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6406101584434509},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6125989556312561},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5603769421577454},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5562755465507507},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5461089611053467},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.54074627161026},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.47642192244529724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4587422311306},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.45147576928138733},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.440432608127594},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4258768558502197},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.38154539465904236},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31192854046821594},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-003-1035-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1035-4","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.472.4158","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.472.4158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mars.netanya.ac.il/~seminar1/RESOURCES/kr2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W114100888","https://openalex.org/W134148315","https://openalex.org/W1499313444","https://openalex.org/W1576293797","https://openalex.org/W1581604037","https://openalex.org/W1974366154","https://openalex.org/W1977889556","https://openalex.org/W1983504800","https://openalex.org/W1985260677","https://openalex.org/W1989596721","https://openalex.org/W1999341643","https://openalex.org/W2003813631","https://openalex.org/W2010142885","https://openalex.org/W2011039300","https://openalex.org/W2014488291","https://openalex.org/W2015906942","https://openalex.org/W2032203620","https://openalex.org/W2045501273","https://openalex.org/W2050065904","https://openalex.org/W2053991811","https://openalex.org/W2058511514","https://openalex.org/W2059608229","https://openalex.org/W2059639406","https://openalex.org/W2067731498","https://openalex.org/W2076125774","https://openalex.org/W2086058377","https://openalex.org/W2089417393","https://openalex.org/W2095003929","https://openalex.org/W2117215821","https://openalex.org/W2170633983"],"related_works":["https://openalex.org/W2040555446","https://openalex.org/W2085422823","https://openalex.org/W2147513353","https://openalex.org/W1977862280","https://openalex.org/W2288749733","https://openalex.org/W2625505879","https://openalex.org/W2083238533","https://openalex.org/W1977973532","https://openalex.org/W2132199417","https://openalex.org/W1985956090"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":11}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}