{"id":"https://openalex.org/W2020816761","doi":"https://doi.org/10.1007/s00453-009-9284-5","title":"Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights","display_name":"Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights","publication_year":2009,"publication_date":"2009-02-14","ids":{"openalex":"https://openalex.org/W2020816761","doi":"https://doi.org/10.1007/s00453-009-9284-5","mag":"2020816761"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9284-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9284-5","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/A5060870054","display_name":"Li-Pu Yeh","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Li-Pu Yeh","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001316179","display_name":"Biing-Feng Wang","orcid":"https://orcid.org/0000-0002-8109-1914"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Biing-Feng Wang","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102739300","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0000-0003-3838-8349"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, 30043, Taiwan, ROC","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"National Tsing Hua University, Department of Computer Science, 30043, Hsinchu, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001316179"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3631,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.63345138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"56","issue":"3","first_page":"297","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9943000078201294,"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.9943000078201294,"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.9941999912261963,"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.993399977684021,"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/theory-of-computation","display_name":"Theory of computation","score":0.6919461488723755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6206673979759216},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5884600877761841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5792818665504456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5540192723274231},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4721512794494629},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47096946835517883},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4477149546146393},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.44553306698799133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4352520704269409},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4346122145652771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22452682256698608}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6919461488723755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6206673979759216},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5884600877761841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5792818665504456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5540192723274231},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4721512794494629},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47096946835517883},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4477149546146393},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.44553306698799133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4352520704269409},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4346122145652771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22452682256698608},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-009-9284-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9284-5","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:CiteSeerX.psu:10.1.1.228.5887","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Ehsinhao/fulltext.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W24645475","https://openalex.org/W1529019776","https://openalex.org/W1542177083","https://openalex.org/W1571566323","https://openalex.org/W1572441411","https://openalex.org/W1885928367","https://openalex.org/W1964510837","https://openalex.org/W1974139762","https://openalex.org/W1977545325","https://openalex.org/W1978918340","https://openalex.org/W1992170089","https://openalex.org/W1994788283","https://openalex.org/W1995027289","https://openalex.org/W2002516237","https://openalex.org/W2005075461","https://openalex.org/W2014682451","https://openalex.org/W2032591091","https://openalex.org/W2035228443","https://openalex.org/W2042852020","https://openalex.org/W2061006898","https://openalex.org/W2065901967","https://openalex.org/W2066159238","https://openalex.org/W2090359754","https://openalex.org/W2104823067","https://openalex.org/W2115049345","https://openalex.org/W2121204510","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2915433949","https://openalex.org/W4234163381"],"related_works":["https://openalex.org/W4297688303","https://openalex.org/W1604162242","https://openalex.org/W2007359222","https://openalex.org/W3196638783","https://openalex.org/W3208065116","https://openalex.org/W1447961680","https://openalex.org/W1490943871","https://openalex.org/W2142561263","https://openalex.org/W4384919997","https://openalex.org/W4319452679"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}