1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
Tom Davot, Jessica Enright, Jayakrishnan Madathil +1
A graph G is c-closed if every two vertices with at least c common neighbors are adjacent to each other. Introduced by Fox, Roughgarden, Seshadhri, Wei and Wein [ICALP 2018, SICOMP…
The Cost and Complexity of Minimizing Envy in House Allocation
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
We study almost-envy-freeness in house allocation, where houses are to be allocated among agents so that every agent receives exactly one house. An envy-free allocation nee…
Parameterized Algorithms for Balanced Cluster Edge Modification Problems
Jayakrishnan Madathil, Kitty Meeks
We study {\sc Cluster Edge Modification} problems with constraints on the size of the clusters. A graph is a cluster graph if every connected component of is a clique. In a…