Search Results - Antony, Dhanyamol

  • Showing 1 - 11 results of 11
Refine Results
  1. 1
    Cutting a tree with subgraph complementation is hard, except for some small trees

    Cutting a tree with subgraph complementation is hard, except for some small trees by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B., Subashini, R.

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  2. 2
    On Subgraph Complementation to H-free Graphs

    On Subgraph Complementation to H-free Graphs by Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B., Sen, Sagnik, Subashini, R.

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Algorithms for subgraph complementation to some classes of graphs

    Algorithms for subgraph complementation to some classes of graphs by Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R.B.

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  4. 4
    Spanning caterpillar in biconvex bipartite graphs

    Spanning caterpillar in biconvex bipartite graphs by Antony, Dhanyamol, Das, Anita, Gosavi, Shirish, Jacob, Dalu, Kulamarva, Shashanka

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  5. 5
    Spanning caterpillar in biconvex bipartite graphs

    Spanning caterpillar in biconvex bipartite graphs by Dhanyamol Antony, Das, Anita, Gosavi, Shirish, Dalu Jacob, Kulamarva, Shashanka

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Algorithms for subgraph complementation to some classes of graphs

    Algorithms for subgraph complementation to some classes of graphs by Dhanyamol Antony, Pal, Sagartanu, Sandeep, R B

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Switching Classes: Characterization and Computation

    Switching Classes: Characterization and Computation by Dhanyamol Antony, Cao, Yixin, Pal, Sagartanu, Sandeep, R B

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Graph Burning: Bounds and Hardness

    Graph Burning: Bounds and Hardness by Dhanyamol Antony, Das, Anita, Gosavi, Shirish, Dalu Jacob, Kulamarva, Shashanka

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness

    Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness by Dhanyamol Antony, L Sunil Chandran, Gayen, Ankit, Gosavi, Shirish, Dalu Jacob

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Cutting a tree with Subgraph Complementation is hard, except for some small trees

    Cutting a tree with Subgraph Complementation is hard, except for some small trees by Dhanyamol Antony, Pal, Sagartanu, Sandeep, R B, Subashini, R

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    On subgraph complementation to H-free graphs

    On subgraph complementation to H-free graphs by Dhanyamol Antony, Garchar, Jay, Pal, Sagartanu, Sandeep, R B, Sen, Sagnik, Subashini, R

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: