Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra +1
A typical goal of research in combinatorial optimization is to come up with fast algorithms that find optimal solutions to a computational problem. The process that takes a real-wo…
cs.DS2024
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…
cs.DS2024
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…