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 9 papers between 2021 and 2025.

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

2025
Hedgegraph Polymatroids.
CoRR, October, 2025

2024
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.
Math. Program., September, 2024

Counting and Enumerating Optimum Cut Sets for Hypergraph <i>k</i>-Partitioning Problems for Fixed <i>k</i>.
Math. Oper. Res., 2024

2023
Approximate minimum cuts and their enumeration.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Approximating Submodular k-Partition via Principal Partition Sequence.
Proceedings of the Approximation, 2023

2022
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k.
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.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Fixed Parameter Approximation Scheme for Min-Max k-Cut.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

ℓ<sub>p</sub>-Norm Multiway Cut.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021


  Loading...