{"id":"https://openalex.org/W2058094600","doi":"https://doi.org/10.1007/s00454-008-9050-5","title":"Generating All Vertices of a Polyhedron Is Hard","display_name":"Generating All Vertices of a Polyhedron Is Hard","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2058094600","doi":"https://doi.org/10.1007/s00454-008-9050-5","mag":"2058094600"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-008-9050-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9050-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9050-5.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9050-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110428486","display_name":"Leonid Khachiyan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonid Khachiyan","raw_affiliation_strings":["640 Bartholomew Road, 66123, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"640 Bartholomew Road, 66123, NJ#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057621825","display_name":"Endre Boros","orcid":"https://orcid.org/0000-0001-8206-3168"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Endre Boros","raw_affiliation_strings":["RUTCOR, Rutgers University, Piscataway, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049075685","display_name":"Konrad Borys","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Konrad Borys","raw_affiliation_strings":["RUTCOR, Rutgers University, Piscataway, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"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/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":true,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Department 1, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik, Department 1, 66123, Saarbr\u00fccken, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department 1, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Department 1, 66123, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102877110","display_name":"Vladimir Gurvich","orcid":"https://orcid.org/0000-0003-0304-8686"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vladimir Gurvich","raw_affiliation_strings":["RUTCOR, Rutgers University, Piscataway, USA","Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RUTCOR, Rutgers University, Piscataway, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University, RUTCOR, 640 Bartholomew Road, 08854-8003, Piscataway, NJ, USA#TAB#","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000070192","https://openalex.org/A5049075685","https://openalex.org/A5057621825","https://openalex.org/A5102877110"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":10.6177,"has_fulltext":true,"cited_by_count":133,"citation_normalized_percentile":{"value":0.98642006,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"39","issue":"1-3","first_page":"174","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8417391777038574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7621468305587769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7578481435775757},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.7395908832550049},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5970064401626587},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.581047534942627},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4741505980491638},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45781010389328003},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4405428469181061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4350671172142029},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.42476871609687805},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4117526412010193},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38895004987716675},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.0923396646976471}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8417391777038574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7621468305587769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7578481435775757},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.7395908832550049},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5970064401626587},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.581047534942627},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4741505980491638},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45781010389328003},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4405428469181061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4350671172142029},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.42476871609687805},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4117526412010193},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38895004987716675},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.0923396646976471},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00454-008-9050-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9050-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9050-5.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11665138640004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Generating-All-Vertices-of-a-Polyhedron/991031665972204646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:428124","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428124","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete & Computational Geometry, v.39, 174-190 (2008)","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00454-008-9050-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9050-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9050-5.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1041962182","display_name":null,"funder_award_id":"IIS-0118635","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6240764752","display_name":"Identification of Threshold, Regular and Submodular Monotone Systems:  Theory and Algorithms","funder_award_id":"0118635","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310882","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2058094600.pdf","grobid_xml":"https://content.openalex.org/works/W2058094600.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W87140126","https://openalex.org/W130282726","https://openalex.org/W1495119384","https://openalex.org/W1580906792","https://openalex.org/W1590194567","https://openalex.org/W1963547452","https://openalex.org/W1972004026","https://openalex.org/W1973033359","https://openalex.org/W1973868432","https://openalex.org/W1974450603","https://openalex.org/W1983281982","https://openalex.org/W1991287453","https://openalex.org/W1993943649","https://openalex.org/W2007572995","https://openalex.org/W2007940874","https://openalex.org/W2009162210","https://openalex.org/W2011562113","https://openalex.org/W2030996579","https://openalex.org/W2033040247","https://openalex.org/W2034443872","https://openalex.org/W2036265926","https://openalex.org/W2044153429","https://openalex.org/W2051283034","https://openalex.org/W2053113791","https://openalex.org/W2063434077","https://openalex.org/W2071094669","https://openalex.org/W2071676345","https://openalex.org/W2079789648","https://openalex.org/W2080947358","https://openalex.org/W2093776691","https://openalex.org/W2104734478","https://openalex.org/W2115826669","https://openalex.org/W2119636970","https://openalex.org/W2150961023","https://openalex.org/W2218652040","https://openalex.org/W2317303422","https://openalex.org/W2492353954","https://openalex.org/W2767970464","https://openalex.org/W2800137643","https://openalex.org/W2911564537","https://openalex.org/W2988480584","https://openalex.org/W3015719403","https://openalex.org/W3111890340","https://openalex.org/W4234356172","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4283012379","https://openalex.org/W1989581254","https://openalex.org/W2023059211","https://openalex.org/W2952847132","https://openalex.org/W2295482381","https://openalex.org/W4297793580","https://openalex.org/W2949517590","https://openalex.org/W1538859003","https://openalex.org/W4299470616","https://openalex.org/W2058094600"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,57],"generating":[3,80,93,102,118,143],"all":[4,94,119],"negative":[5,29,50,59,77],"cycles":[6,52,60],"of":[7,28,90,115,121,131,142,148],"a":[8,12,26,71,112],"weighted":[9],"graph":[10],"is":[11,33,98,125],"hard":[13],"enumeration":[14],"problem,":[15],"in":[16,53,64,75,128],"both":[17],"the":[18,54,76,106,122,129,134,140],"directed":[19],"and":[20,145],"undirected":[21],"cases.":[22],"More":[23],"precisely,":[24],"given":[25],"family":[27,41],"(directed)":[30,51,58],"cycles,":[31],"it":[32],"an":[34,87],"NP-complete":[35],"problem":[36],"to":[37],"decide":[38],"whether":[39],"this":[40],"can":[42],"be":[43,62],"extended":[44],"or":[45],"there":[46],"are":[47],"no":[48],"other":[49],"graph,":[55],"implying":[56],"cannot":[61],"generated":[63],"polynomial":[65],"output":[66],"time,":[67],"unless":[68],"P=NP.":[69],"As":[70],"corollary,":[72],"we":[73],"solve":[74],"two":[78],"well-known":[79],"problems":[81],"from":[82],"linear":[83,91,116],"programming:":[84],"(i)":[85],"Given":[86,111],"infeasible":[88,96],"system":[89,114],"inequalities,":[92,117],"minimal":[95],"subsystems":[97,105],"hard.":[99,126],"Yet,":[100,127],"for":[101],"maximal":[103],"feasible":[104,113],"complexity":[107,135,141],"remains":[108,136,150],"open.":[109,137,151],"(ii)":[110],"vertices":[120,144],"corresponding":[123],"polyhedron":[124],"case":[130],"bounded":[132],"polyhedra":[133,149],"Equiva":[138],"lently,":[139],"extreme":[146],"rays":[147]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}