Weihang Wang

According to our database, Weihang Wang authored at least 8 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Math. Program., September, 2024

Approximating Submodular \({k}\)-Partition via Principal Partition Sequence.

Karthekeyan Chandrasekaran, Weihang Wang

SIAM J. Discret. Math., 2024

Counting and Enumerating Optimum Cut Sets for Hypergraph <i>k</i>-Partitioning Problems for Fixed <i>k</i>.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Math. Oper. Res., 2024

2023

Fixed parameter approximation scheme for min-max k-cut.

Karthekeyan Chandrasekaran, Weihang Wang

Math. Program., February, 2023

Approximate minimum cuts and their enumeration.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

ℓ _p-Norm Multiway Cut.

Karthekeyan Chandrasekaran, Weihang Wang

Algorithmica, 2022

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k.

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.

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022