Calvin Beideman

activity

20142022

most citedSet Families with Low Pairwise Intersection

3 citations · 5 across the 5 of their papers we have counts for

collaborators

7 papers

cs.DS2022

Approximate minimum cuts and their enumeration

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We show that every $α$ -approximate minimum cut in a connected graph is the unique minimum $(S, T)$ -terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloo…

cs.DS2022

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of enumerating optimal solutions for two hypergraph $k$ -partitioning problems -- namely, Hypergraph- $k$ -Cut and Minmax-Hypergraph- $k$ -Partition. The input i…

cs.DS2021★ 1 cited

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

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of deterministically enumerating all minimum $k$ -cut-sets in a given hypergraph for any fixed $k$ . The input here is a hypergraph $G = (V, E)$ with non-nega…

cs.DS2020

Faster connectivity in low-rank hypergraphs via expander decomposition

Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay +1

We design an algorithm for computing connectivity in hypergraphs which runs in time $O^_{r} (p + min {λ^{\frac{r - 3}{r - 1}} n^{2}, n^{r} / λ^{r / (r - 1)}})$ (the $O^_{r} (\cdot)$ hides th…

cs.DS2020

Multicritera Cuts and Size-Constrained $k$ -cuts in Hypergraphs

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

We address counting and optimization variants of multicriteria global min-cut and size-constrained min- $k$ -cut in hypergraphs. 1. For an $r$ -rank $n$ -vertex hypergraph endowed with…

math.CO2018★ 1 cited

The Sprague-Grundy function for some selective compound games

Calvin Beideman, Matthew Bowen, Necati Alp Muyesser

We analyze the Sprague-Grundy functions for a class of almost disjoint selective compound games played on Nim heaps. Surprisingly, we find that these functions behave chaotically f…

cs.CC2014★ 3 cited

Set Families with Low Pairwise Intersection

Calvin Beideman, Jeremiah Blocki

A $(n, ℓ, γ)$ -sharing set family of size $m$ is a family of sets $S_{1}, \dots, S_{m} \subseteq [n]$ s.t. each set has size $ℓ$ and each pair of sets shares at most $γ$ el…

Approximate minimum cuts and their enumeration

Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k

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

Faster connectivity in low-rank hypergraphs via expander decomposition

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

The Sprague-Grundy function for some selective compound games

Set Families with Low Pairwise Intersection

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$

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

Multicritera Cuts and Size-Constrained $k$ -cuts in Hypergraphs