We stand with Ukraine  

Weihang Wang

Orcid: 0000-0002-0628-5532

Affiliations:
  • University of Illinois at Urbana-Champaign, IL, USA


According to our database1, Weihang Wang authored at least 7 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.
[BibTeX]
[DOI]
Calvin Beideman
,
Karthekeyan Chandrasekaran
,
Weihang Wang
Math. Program., September, 2024

2023
Fixed parameter approximation scheme for min-max k-cut.
[BibTeX]
[DOI]
Karthekeyan Chandrasekaran
,
Weihang Wang
Math. Program., February, 2023

Approximate minimum cuts and their enumeration.
[BibTeX]
[DOI]
Calvin Beideman
,
Karthekeyan Chandrasekaran
,
Weihang Wang
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Approximating Submodular k-Partition via Principal Partition Sequence.
[BibTeX]
[DOI]
Karthekeyan Chandrasekaran
,
Weihang Wang
Proceedings of the Approximation, 2023

2022
ℓ <sub>p</sub>-Norm Multiway Cut.
[BibTeX]
[DOI]
Karthekeyan Chandrasekaran
,
Weihang Wang
Algorithmica, 2022

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k.
[BibTeX]
[DOI]
Calvin Beideman
,
Karthekeyan Chandrasekaran
,
Weihang Wang
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k.
[BibTeX]
[DOI]
Calvin Beideman
,
Karthekeyan Chandrasekaran
,
Weihang Wang
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022


  Loading...