{"id":"https://openalex.org/W2121472099","doi":"https://doi.org/10.1007/s00453-013-9785-0","title":"On Tree-Constrained Matchings and Generalizations","display_name":"On Tree-Constrained Matchings and Generalizations","publication_year":2013,"publication_date":"2013-04-24","ids":{"openalex":"https://openalex.org/W2121472099","doi":"https://doi.org/10.1007/s00453-013-9785-0","mag":"2121472099"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-013-9785-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9785-0","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01248542","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055704933","display_name":"Stefan Canzar","orcid":"https://orcid.org/0000-0003-4719-8010"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Stefan Canzar","raw_affiliation_strings":["Centrum Wiskunde & Informatica, Life Sciences Group, Science Park 123, 1098 XG, Amsterdam, The Netherlands","ALGORILLE - Algorithms for the Grid (France)"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica, Life Sciences Group, Science Park 123, 1098 XG, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"ALGORILLE - Algorithms for the Grid (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000070192","display_name":"Khaled Elbassioni","orcid":"https://orcid.org/0000-0001-7021-5400"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Masdar Institute of Science and Technology, Abu Dhabi, United Arab Emirates","MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Germany)"],"affiliations":[{"raw_affiliation_string":"Masdar Institute of Science and Technology, Abu Dhabi, United Arab Emirates","institution_ids":[]},{"raw_affiliation_string":"MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Germany)","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029642674","display_name":"Gunnar W. Klau","orcid":"https://orcid.org/0000-0002-6340-0090"},"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/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["FR","NL"],"is_corresponding":false,"raw_author_name":"Gunnar W. Klau","raw_affiliation_strings":["Centrum Wiskunde & Informatica, Life Sciences Group, Science Park 123, 1098 XG, Amsterdam, The Netherlands","ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), \r\nCampus DOUA\r\n43, Boulevard du 11 Novembre 1918\r\n69622 Villeurbanne cedex - France)","MAC4 - Life Sciences [Amsterdam] (Centrum Wiskunde & Informatica Science Park 123 1098 XG Amsterdam - Netherlands)"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica, Life Sciences Group, Science Park 123, 1098 XG, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), \r\nCampus DOUA\r\n43, Boulevard du 11 Novembre 1918\r\n69622 Villeurbanne cedex - France)","institution_ids":["https://openalex.org/I100532134"]},{"raw_affiliation_string":"MAC4 - Life Sciences [Amsterdam] (Centrum Wiskunde & Informatica Science Park 123 1098 XG Amsterdam - Netherlands)","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007528822","display_name":"Juli\u00e1n Mestre","orcid":"https://orcid.org/0000-0003-4948-2998"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Juli\u00e1n Mestre","raw_affiliation_strings":["School of Information Technologies, The University of Sydney, Sydney, Australia","LCLT - Laboratoire d'Etudes du Comportement \u00e0 Long Terme des mat\u00e9riaux de conditionnement (France)"],"affiliations":[{"raw_affiliation_string":"School of Information Technologies, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"LCLT - Laboratoire d'Etudes du Comportement \u00e0 Long Terme des mat\u00e9riaux de conditionnement (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5055704933"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7597,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77402111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"71","issue":"1","first_page":"98","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9948999881744385,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9948999881744385,"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.9940999746322632,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9897000193595886,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8506612777709961},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8181350231170654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7435387969017029},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6061144471168518},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6040276288986206},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5815163850784302},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5396859645843506},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.5242883563041687},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49114271998405457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.473683625459671},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47114458680152893},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4568936824798584},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.415585458278656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.368033230304718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15264153480529785}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8506612777709961},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8181350231170654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7435387969017029},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6061144471168518},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6040276288986206},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5815163850784302},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5396859645843506},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.5242883563041687},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49114271998405457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.473683625459671},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47114458680152893},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4568936824798584},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.415585458278656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.368033230304718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15264153480529785},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":4,"locations":[{"id":"doi:10.1007/s00453-013-9785-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9785-0","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:research.vu.nl:openaire_cris_publications/2be11c81-3c44-4aa3-88d8-1d03d42e016b","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/2be11c81-3c44-4aa3-88d8-1d03d42e016b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Canzar, S, Elbassioni, K, Klau, G W & Mestre, J 2015, 'On tree-constrained matchings and generalizations', Algorithmica, vol. 71, no. 1, pp. 98-119. https://doi.org/10.1007/s00453-013-9785-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-01248542v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01248542","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2015, 71, pp.98-119. ⟨10.1007/s00453-013-9785-0⟩","raw_type":"Journal articles"},{"id":"pmh:oai:research.vu.nl:publications/2be11c81-3c44-4aa3-88d8-1d03d42e016b","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/2be11c81-3c44-4aa3-88d8-1d03d42e016b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400546","display_name":"Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Canzar, S, Elbassioni, K, Klau, G W & Mestre, J 2015, 'On tree-constrained matchings and generalizations', Algorithmica, vol. 71, no. 1, pp. 98-119. https://doi.org/10.1007/s00453-013-9785-0","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01248542v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01248542","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2015, 71, pp.98-119. ⟨10.1007/s00453-013-9785-0⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1511716344","https://openalex.org/W1527607312","https://openalex.org/W1529291652","https://openalex.org/W1539551091","https://openalex.org/W1607066202","https://openalex.org/W1765664592","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1997369416","https://openalex.org/W2016232593","https://openalex.org/W2031347356","https://openalex.org/W2038922801","https://openalex.org/W2069532962","https://openalex.org/W2100440346","https://openalex.org/W2117624717","https://openalex.org/W2132302072","https://openalex.org/W2140017337","https://openalex.org/W2158939069","https://openalex.org/W2294341534","https://openalex.org/W2552451242","https://openalex.org/W2798566347","https://openalex.org/W3144422206","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W4400909662","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W3098480989","https://openalex.org/W4235849992","https://openalex.org/W2910933086"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}