default search action
Anita Das 0001
Person information
- affiliation: Manipal Institute of Technology Bengaluru, Manipal, India
- affiliation (former): Indian Institute of Science, Bangalore, India
- affiliation (former): Infosys Ltd., Bangalore, India
- affiliation (former): Indian Institute of Technology Delhi, Department of Mathematics, New Delhi, India
Other persons with the same name
- Anita Das 0002 — SINTEF Technology and Society, Trondheim, Norway (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Dhanyamol Antony
, Anita Das
Spanning caterpillar in biconvex bipartite graphs. Discret. Appl. Math. 356: 32-36 (2024) - [i6]Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva
Graph Burning: Bounds and Hardness. CoRR abs/2402.18984 (2024) - 2023
- [i5]Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva
Spanning caterpillar in biconvex bipartite graphs. CoRR abs/2312.10956 (2023)
2010 – 2019
- 2018
- [c5]L. Sunil Chandran, Anita Das
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN 2018: 625-639 - [c4]B. S. Panda, Anita Das
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. WG 2018: 369-381 - 2017
- [i4]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR abs/1703.00236 (2017) - 2014
- [j11]Anita Das
Rainbow Path and Color Degree in Edge Colored Graphs. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [i3]Anita Das, P. Suresh, S. V. Subrahmanya:
Rainbow path and color degree in edge colored graphs. CoRR abs/1312.5067 (2013) - 2012
- [j10]L. Sunil Chandran, Anita Das
Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206-218 (2012) - 2011
- [j9]Anita Das:
A Combinatorial Approach to Tanny Sequence. Discret. Math. Theor. Comput. Sci. 13(2): 97-108 (2011) - [j8]L. Sunil Chandran, Anita Das
Rainbow Connection Number and Connected Dominating Sets. Electron. Notes Discret. Math. 38: 239-244 (2011) - 2010
- [j7]B. S. Panda, Anita Das
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. Discret. Appl. Math. 158(17): 1913-1935 (2010) - [j6]Anita Das
Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. 110(23): 1044-1048 (2010) - [i2]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. CoRR abs/1010.2296 (2010)
2000 – 2009
- 2009
- [j5]B. S. Panda, Anita Das
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. Discret. Appl. Math. 157(9): 2153-2169 (2009) - [j4]L. Sunil Chandran, Anita Das
Cubicity, boxicity, and vertex cover. Discret. Math. 309(8): 2488-2496 (2009) - [j3]L. Sunil Chandran, Anita Das
On the cubicity of bipartite graphs. Inf. Process. Lett. 109(9): 432-435 (2009) - 2008
- [c3]B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das
Isoperimetric Problem and Meta-Fibonacci Sequences. COCOON 2008: 22-30 - [i1]L. Sunil Chandran, Anita Das, Naveen Sivadasan:
On the cubicity of bipartite graphs. CoRR abs/0810.2697 (2008) - 2007
- [j2]B. S. Panda, Anita Das
On tree 3-spanners in directed path graphs. Networks 50(3): 203-210 (2007) - 2006
- [j1]Bhawani Sankar Panda, Anita Das
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. Electron. Notes Discret. Math. 27: 79-80 (2006) - [c2]Anita Das
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. ICIT 2006: 301-304 - 2004
- [c1]B. S. Panda, Anita Das
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. CIT 2004: 21-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: