activity
20082019
most citedOptimal Homologous Cycles, Total Unimodularity, and Linear Programming

17 citations · 35 across the 9 of their papers we have counts for

collaborators

14 papers

cs.LG2019

Steinhaus Filtration and Stable Paths in the Mapper

Dustin L. Arendt, Matthew Broussard, Bala Krishnamoorthy +2

We define a new filtration called the Steinhaus filtration built from a single cover based on a generalized Steinhaus distance, a generalization of Jaccard distance. The homology p…

cs.CG2018

Euler Transformation of Polyhedral Complexes

Prashant Gupta, Bala Krishnamoorthy

We propose an Euler transformation that transforms a given -dimensional cell complex for into a new -complex in which every vertex is part of a uniform…

math.DG2018

Median Shapes

Yunfeng Hu, Matthew Hudelson, Bala Krishnamoorthy +2

We introduce and begin to explore the mean and median of finite sets of shapes represented as integral currents. The median can be computed efficiently in practice, and we focus mo…

cs.CG2017★ 4 cited

Interesting Paths in the Mapper

Ananth Kalyanaraman, Methun Kamruzzaman, Bala Krishnamoorthy

The Mapper produces a compact summary of high dimensional data as a simplicial complex. We study the problem of quantifying the interestingness of subpopulations in a Mapper, which…

q-bio.QM2017

Hyppo-X: A Scalable Exploratory Framework for Analyzing Complex Phenomics Data

Methun Kamruzzaman, Ananth Kalyanaraman, Bala Krishnamoorthy +2

Phenomics is an emerging branch of modern biology that uses high throughput phenotyping tools to capture multiple environmental and phenotypic traits, often at massive spatial and…

math.OC2016★ 1 cited

Thinner is not Always Better: Cascade Knapsack Problems

Bala Krishnamoorthy

In the context of branch-and-bound (B&B) for integer programming (IP) problems, a direction along which the polyhedron of the IP has minimum width is termed a thin direction. We de…