Search

Filters

Use filters to refine the search results.

Now showing items 1-10 of 10

Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Springer, 2015-02)
Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2015-06)
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Springer, 2016-07)
Parameterized algorithms for conflict-free colorings of graphs

Reddy, I. Vinod (Cornell University Library, 2017-09)
The parameterized complexity of happy colorings

Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)
On structural parameterizations of firefighting

Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)
On the parallel parameterized complexity of the graph isomorphism problem

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2017-12)
On structural parameterizations of happy coloring, empire coloring and boxicity",

Choudhari, Jayesh; Reddy, I. Vinod (2018-03-03)
On structural parameterizations of firefighting

Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Springer, 2018-02-15)
On the parallel parameterized complexity of the graph isomorphism problem

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (2018-03-03)

Now showing items 1-10 of 10