Anita Das

Orcid: 0000-0002-0126-4716

Affiliations:
  • Manipal Institute of Technology Bengaluru, Manipal, India
  • Indian Institute of Science, Bangalore, India (former)
  • Infosys Ltd., Bangalore, India (former)
  • Indian Institute of Technology Delhi, Department of Mathematics, New Delhi, India (former)


According to our database1, Anita Das authored at least 17 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Spanning caterpillar in biconvex bipartite graphs.
Discret. Appl. Math., 2024

Graph Burning: Bounds and Hardness.
CoRR, 2024

2018
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Algorithms and Bounds for Very Strong Rainbow Coloring.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2014
Rainbow Path and Color Degree in Edge Colored Graphs.
Electron. J. Comb., 2014

2012
Rainbow connection number and connected dominating sets.
J. Graph Theory, 2012

2011
A Combinatorial Approach to Tanny Sequence.
Discret. Math. Theor. Comput. Sci., 2011

2010
Non-contractible non-edges in 2-connected graphs.
Inf. Process. Lett., 2010

Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms.
Discret. Appl. Math., 2010

2009
On the cubicity of bipartite graphs.
Inf. Process. Lett., 2009

Cubicity, boxicity, and vertex cover.
Discret. Math., 2009

Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.
Discret. Appl. Math., 2009

2008
Isoperimetric Problem and Meta-Fibonacci Sequences.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
On tree 3-spanners in directed path graphs.
Networks, 2007

2006
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
Electron. Notes Discret. Math., 2006

A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.
Proceedings of the 9th International Conference in Information Technology, 2006

2004
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees.
Proceedings of the Intelligent Information Technology, 2004


  Loading...