1,725,669 research outputs found
Annual report 2017-18
Full text link"The Akanksha Foundation is a non-profit organisation with a mission to provide children from low-income communities with a high-quality education, enabling them to maximize their potential and transform their lives. For over 25 years, Akanksha has educated children from low-income communities across Mumbai and Pune — first, through our after-school centers, and since 2007, through the Akanksha Schools. Today, we are one of the largest urban networks of public-private partnership schools of its kind in India.
Looking ahead, we seek to expand our network of schools, share our effective practices and advocate for quality school reform for children across India.
The F Less Travelled... Dr Akanksha Mehta & Chloe Turner
No full textMaking space for our stories, we invite guests to share
3 books
2 songs
1 object; things that have been their feminist friends along the road. We want to unfurl, uncover and discover the feminisms we find & make everyday. Creating inter-generational feminist circles that push beyond the boundaries of academia, we’re elevating our voices & the paths we’ve chosen; creating a new collective, one that’s re-written and reclaimed by us.
***
The F Less Travelled… with Dr Akanksha Mehta and Chloe Turner.
Chloe Turner is a writer, curator and PhD researcher. As of September 2021, Chloe is an Associate Lecturer in both the Design Department at LCC, University of the Arts London and the Media, Communications and Cultural Studies Department at Goldsmiths, University of London.
Dr Akanksha Mehta is a feminist educator, researcher, writer, photographer, and organiser. She is a Lecturer in Gender, Race and Cultural Studies and the co-director of the Centre for Feminist Research at Goldsmiths, University of London
Organizational background 2017-18
No full text"The Akanksha Foundation is a non-profit organization that works primarily in the field of education, addressing non-formal education through Akanksha centers and formal education through Akanksha schools
Impact report 2015-16
No full text"Akanksha is a 25 year old organization working towards the vision that one day all children will be equipped with knowledge skills and character they need to lead empowered lives. Akanksha started with after school centers that focused on imparting quality education to children from low income communities.
Akanksha Bapat's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Akanksha Bapat's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Akanksha Dasari's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Akanksha Dasari's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Akanksha Dasari's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Fine-Grained Complexity of Rainbow Coloring and its Variants
Full text linkConsider a graph G and an edge-coloring c_R:E(G) \rightarrow [k]. A rainbow path between u,v \in V(G) is a path P from u to v such that for all e,e' \in E(P), where e \neq e' we have c_R(e) \neq c_R(e'). In the Rainbow k-Coloring problem we are given a graph G, and the objective is to decide if there exists c_R: E(G) \rightarrow [k] such that for all u,v \in V(G) there is a rainbow path between u and v in G. Several variants of Rainbow k-Coloring have been studied, two of which are defined as follows. The Subset Rainbow k-Coloring takes as an input a graph G and a set S \subseteq V(G) \times V(G), and the objective is to decide if there exists c_R: E(G) \rightarrow [k] such that for all (u,v) \in S there is a rainbow path between u and v in G. The problem Steiner Rainbow k-Coloring takes as an input a graph G and a set S \subseteq V(G), and the objective is to decide if there exists c_R: E(G) \rightarrow [k] such that for all u,v \in S there is a rainbow path between u and v in G. In an attempt to resolve open problems posed by Kowalik et al. (ESA 2016), we obtain the following results.
- For every k \geq 3, Rainbow k-Coloring does not admit an algorithm running in time 2^{o(|E(G)|)}n^{O(1)}, unless ETH fails.
- For every k \geq 3, Steiner Rainbow k-Coloring does not admit an algorithm running in time 2^{o(|S|^2)}n^{O(1)}, unless ETH fails.
- Subset Rainbow k-Coloring admits an algorithm running in time 2^{\OO(|S|)}n^{O(1)}. This also implies an algorithm running in time 2^{o(|S|^2)}n^{O(1)} for Steiner Rainbow k-Coloring, which matches the lower bound we obtain
- …
