{"id":"https://openalex.org/W1971966262","doi":"https://doi.org/10.1016/s0166-218x(02)00570-x","title":"Pushdown\u2013reduce: an algorithm for connectivity augmentation and poset covering problems","display_name":"Pushdown\u2013reduce: an algorithm for connectivity augmentation and poset covering problems","publication_year":2003,"publication_date":"2003-05-12","ids":{"openalex":"https://openalex.org/W1971966262","doi":"https://doi.org/10.1016/s0166-218x(02)00570-x","mag":"1971966262"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(02)00570-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(02)00570-x","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5021452458","display_name":"Andr\u00e1s A. Bencz\u00far","orcid":"https://orcid.org/0000-0002-9392-0986"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s A. Bencz\u00far","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, E\u00f6tv\u00f6s University, Budapest, Hungary","Department of Operations Research, E\u00f6tv\u00f6s University, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, E\u00f6tv\u00f6s University, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Operations Research, E\u00f6tv\u00f6s University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021452458"],"corresponding_institution_ids":["https://openalex.org/I106118109","https://openalex.org/I7597260"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":1.0903,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76077448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"129","issue":"2-3","first_page":"233","last_page":"262"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6931561827659607},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6034866571426392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5325497388839722},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4810505211353302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4691775143146515},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4645272195339203},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46166354417800903},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4361036717891693},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43461713194847107},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3660776615142822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2318427562713623},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.21353057026863098},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1350649893283844}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6931561827659607},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6034866571426392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5325497388839722},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4810505211353302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4691775143146515},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4645272195339203},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46166354417800903},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4361036717891693},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43461713194847107},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3660776615142822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2318427562713623},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.21353057026863098},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1350649893283844},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0166-218x(02)00570-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(02)00570-x","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.1975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sztaki.hu/~benczur/Mypapers/DAM-2003.ps.gz","raw_type":"text"},{"id":"pmh:oai:eprints.sztaki.hu:3262","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/3262/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1544515183","https://openalex.org/W1579270704","https://openalex.org/W1964119857","https://openalex.org/W1988132050","https://openalex.org/W1990313671","https://openalex.org/W1996169001","https://openalex.org/W2012329067","https://openalex.org/W2016385191","https://openalex.org/W2019577977","https://openalex.org/W2039977337","https://openalex.org/W2043087543","https://openalex.org/W2048815229","https://openalex.org/W2049057921","https://openalex.org/W2049754879","https://openalex.org/W2067818080","https://openalex.org/W2069664592","https://openalex.org/W2102671623","https://openalex.org/W2129352792","https://openalex.org/W2135211390","https://openalex.org/W2148922672","https://openalex.org/W2157529519","https://openalex.org/W2295384077","https://openalex.org/W2571694026","https://openalex.org/W2608846391","https://openalex.org/W3152018206","https://openalex.org/W6632396972"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2070875930","https://openalex.org/W2383239740"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
