{"id":"https://openalex.org/W2054594286","doi":"https://doi.org/10.1007/s00453-015-9993-x","title":"Stackelberg Bipartite Vertex Cover and the Preflow Algorithm","display_name":"Stackelberg Bipartite Vertex Cover and the Preflow Algorithm","publication_year":2015,"publication_date":"2015-03-28","ids":{"openalex":"https://openalex.org/W2054594286","doi":"https://doi.org/10.1007/s00453-015-9993-x","mag":"2054594286"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-015-9993-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-9993-x","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/A5020748279","display_name":"Mourad Ba\u0131\u0308ou","orcid":"https://orcid.org/0000-0003-0735-7689"},"institutions":[{"id":"https://openalex.org/I4210143836","display_name":"Clermont Universit\u00e9","ror":"https://ror.org/03yf5zr20","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210143836"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mourad Ba\u00efou","raw_affiliation_strings":["CNRS, Universit\u00e9 Clermont II, Campus des c\u00e9zeaux, BP 125, 63173, Aubi\u00e8re Cedex, France","CNRS, Universit\u00e9 Clermont II, Aubi\u00e8re Cedex, France 63173#TAB#"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 Clermont II, Campus des c\u00e9zeaux, BP 125, 63173, Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I4210143836","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS, Universit\u00e9 Clermont II, Aubi\u00e8re Cedex, France 63173#TAB#","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY, 10589, USA","IBM T. J. Watson Research Center, Yorktown Heights, USA 10589#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY, 10589, USA","institution_ids":[]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, USA 10589#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020748279"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210143836"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.07265133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"74","issue":"3","first_page":"1174","last_page":"1183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9943000078201294,"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.838829755783081},{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.8201843500137329},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6995094418525696},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6201364994049072},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5651208758354187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5516574382781982},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5432599186897278},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5374380350112915},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5173556208610535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43262630701065063},{"id":"https://openalex.org/keywords/clos-network","display_name":"Clos network","score":0.41484886407852173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41378363966941833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35483598709106445},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.059863895177841187}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.838829755783081},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8201843500137329},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6995094418525696},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6201364994049072},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5651208758354187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5516574382781982},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5432599186897278},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5374380350112915},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5173556208610535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43262630701065063},{"id":"https://openalex.org/C119700423","wikidata":"https://www.wikidata.org/wiki/Q4418086","display_name":"Clos network","level":2,"score":0.41484886407852173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41378363966941833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35483598709106445},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.059863895177841187},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-015-9993-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-9993-x","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1679640162","https://openalex.org/W1700342427","https://openalex.org/W1764576420","https://openalex.org/W1964483006","https://openalex.org/W2011039300","https://openalex.org/W2013469283","https://openalex.org/W2090359754","https://openalex.org/W2098696428","https://openalex.org/W2111240209","https://openalex.org/W2124652308","https://openalex.org/W2126019099","https://openalex.org/W2149342630","https://openalex.org/W2573596393","https://openalex.org/W2762058341","https://openalex.org/W2951951756","https://openalex.org/W3101753513","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2026407613","https://openalex.org/W4309591652","https://openalex.org/W2089088747","https://openalex.org/W4297882665","https://openalex.org/W2952349276","https://openalex.org/W2587433615","https://openalex.org/W1779359754","https://openalex.org/W2018678447","https://openalex.org/W1988771411","https://openalex.org/W2054594286"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}