Search

Filters

Use filters to refine the search results.

Now showing items 1-9 of 9

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)
On structural parameterizations of graph motif and chromatic number

Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Vinod Reddy, I. (Springer International Publishing, 2017)
On the parallel parameterized complexity of the graph isomorphism problem

Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (2018-03-03)
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 firefighting

Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)
On structural parameterizations of firefighting

Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Springer, 2018-02-15)
On NC algorithms for problems on bounded rank-width graphs

Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)

Now showing items 1-9 of 9