activity
20082025
most citedThe impossibility of low rank representations for triangle-rich complex networks

49 citations · 287 across the 45 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DM2024

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing

Deeparnab Chakrabarty, C. Seshadhri

Motivated by applications to monotonicity testing, Lehman and Ron (JCTA, 2001) proved the existence of a collection of vertex disjoint paths between comparable sub-level sets in th…