{"id":"https://openalex.org/W1170606744","doi":"https://doi.org/10.1007/978-3-319-19315-1_12","title":"Solving Matching Problems Efficiently in Bipartite Graphs","display_name":"Solving Matching Problems Efficiently in Bipartite Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1170606744","doi":"https://doi.org/10.1007/978-3-319-19315-1_12","mag":"1170606744"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-19315-1_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-19315-1_12","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087617569","display_name":"Selma Djelloul","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Selma Djelloul","raw_affiliation_strings":["LRI, UMR 8623, B\u00e2t 650 Universit\u00e9 de Paris-Sud, 91405, Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"LRI, UMR 8623, B\u00e2t 650 Universit\u00e9 de Paris-Sud, 91405, Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087617569"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05785857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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.991599977016449,"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.9783999919891357,"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.8657190799713135},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.846884548664093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6717566251754761},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5089864730834961},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5077158212661743},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.504941999912262},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4966800808906555},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.45529913902282715},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4475404620170593},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.42976823449134827},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4235718846321106},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.41542401909828186},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4119448661804199},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.37975481152534485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32202693819999695}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8657190799713135},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.846884548664093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6717566251754761},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5089864730834961},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5077158212661743},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.504941999912262},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4966800808906555},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.45529913902282715},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4475404620170593},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42976823449134827},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4235718846321106},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.41542401909828186},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4119448661804199},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.37975481152534485},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32202693819999695},{"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/978-3-319-19315-1_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-19315-1_12","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:HAL:hal-01287317v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01287317","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":"25th International Workshop on Combinatorial Algorithms, University of Minnesota - University of Winsconsin, Oct 2014, Duluth, United States. pp.128-139, ⟨10.1007/978-3-319-19315-1_12⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W126314669","https://openalex.org/W354871945","https://openalex.org/W1541277988","https://openalex.org/W1562009200","https://openalex.org/W1579538307","https://openalex.org/W1586239617","https://openalex.org/W1971663478","https://openalex.org/W1982423514","https://openalex.org/W1989102235","https://openalex.org/W2043207029","https://openalex.org/W2057972598","https://openalex.org/W2064461360","https://openalex.org/W2065295938","https://openalex.org/W2068633285","https://openalex.org/W2079887842","https://openalex.org/W2082659364","https://openalex.org/W2089339578","https://openalex.org/W2102669784","https://openalex.org/W2115589427","https://openalex.org/W2141925838","https://openalex.org/W2335389215","https://openalex.org/W2340149117","https://openalex.org/W2913398500","https://openalex.org/W4245236715","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W2625505879","https://openalex.org/W2288749733","https://openalex.org/W1977862280","https://openalex.org/W3029390739","https://openalex.org/W4287773996","https://openalex.org/W4206100603","https://openalex.org/W2066322364","https://openalex.org/W2617676513","https://openalex.org/W2083238533","https://openalex.org/W1603174186"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}