121 citations · 373 across the 96 of their papers we have counts for
5 papers · 1 filter
On the complexity of Multipacking
Sandip Das, Sk Samim Islam, Daniel Lokshtanov
A multipacking in an undirected graph is a set such that for every vertex and for every integer , the ball of radius around conta…
Wordle is NP-hard
Daniel Lokshtanov, Bernardo Subercaseaux
Wordle is a single-player word-guessing game where the goal is to discover a secret word that has been chosen from a dictionary . In order to discover , the player can ma…
Slightly Superexponential Parameterized Problems
Daniel Lokshtanov, Daniel Marx, Saket Saurabh
A central problem in parameterized algorithms is to obtain algorithms with running time such that is as slow growing function of the parameter as possi…
The complexity of independent set reconfiguration on bipartite graphs
Daniel Lokshtanov, Amer E. Mouawad
We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token ju…
Reconfiguration on sparse graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…