default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeihang Wang 0002
Person information
- affiliation: University of Illinois at Urbana-Champaign, IL, USA
Other persons with the same name
- Weihang Wang 0001
![[0000-0003-1175-4409]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-1175-4409")
— University at Buffalo, SUNY, NY, USA (and 1 more) - Weihang Wang 0003 — Shanghai Jiao Tong University, Shanghai, China
- Weihang Wang 0004 — Xiamen University, Xiamen, China
- Weihang Wang 0005 — Harbin Institute of Technology, Department of Computer Science and Technology, Shenzhen, China
- Weihang Wang 0006 — University of Southern California, Department of Computer Science, Los Angeles, CA, USA
- Weihang Wang 0007 — Sichuan University, College of Computer Science, Chengdu, China
- Weihang Wang 0008 — Guangdong University of Technology, China
- Weihang Wang 0009 — Beijing Microelectronics Technology Institute, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. Math. Program. 207(1): 329-367 (2024)- 2023
- [j2]Karthekeyan Chandrasekaran, Weihang Wang:
Fixed parameter approximation scheme for min-max k-cut. Math. Program. 197(2): 1093-1144 (2023) - 2022
- [j1]Karthekeyan Chandrasekaran, Weihang Wang:
ℓ p-Norm Multiway Cut. Algorithmica 84(9): 2667-2701 (2022)
Conference and Workshop Papers
- 2023
- [c6]Karthekeyan Chandrasekaran, Weihang Wang:
Approximating Submodular k-Partition via Principal Partition Sequence. APPROX/RANDOM 2023: 3:1-3:16 - [c5]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. SOSA 2023: 36-41 - 2022
- [c4]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP 2022: 16:1-16:18 - [c3]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k. SODA 2022: 2208-2228 - 2021
- [c2]Karthekeyan Chandrasekaran, Weihang Wang:
ℓp-Norm Multiway Cut. ESA 2021: 29:1-29:15 - [c1]Karthekeyan Chandrasekaran, Weihang Wang:
Fixed Parameter Approximation Scheme for Min-Max k-Cut. IPCO 2021: 354-367
Informal and Other Publications
- 2023
- [i6]Karthekeyan Chandrasekaran, Weihang Wang:
Approximating submodular k-partition via principal partition sequence. CoRR abs/2305.01069 (2023) - 2022
- [i5]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k. CoRR abs/2204.09178 (2022) - [i4]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Approximate minimum cuts and their enumeration. CoRR abs/2211.16747 (2022) - 2021
- [i3]Karthekeyan Chandrasekaran, Weihang Wang:
𝓁p-norm Multiway Cut. CoRR abs/2106.14840 (2021) - [i2]Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. CoRR abs/2110.14815 (2021) - 2020
- [i1]Karthekeyan Chandrasekaran, Weihang Wang:
Fixed Parameter Approximation Scheme for Min-max k-cut. CoRR abs/2011.03454 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-11 18:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
