activity
20162026
most citedProgress on the adjacent vertex distinguishing edge colouring conjecture

21 citations · 28 across the 15 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021★ 1 cited

How to Find a Good Explanation for Clustering?

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +3

-means and -median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependences on all the features, it is challenging to interpr…

cs.DS2021

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2

We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on -minor free graphs. In particular, we obtain the following resul…