Digital Repository

Welcome to Digital Repository at Indian Institute of Science Education and Research Pune!

This Digital Repository is an institutional respository of IISER Pune which is responsible for collecting, organizing, preserving and providing access to, and promoting dissamination of the scholarly output of IISER Pune faculty, students, staff and others associated with the institute. This Digital Repository serves as a platform to IISER Pune community to share their research work with wider community.

Digital Repository accepts documents viz., journal articles, conference papers, dissertations, theses, presentations, reports, lecture notes and any other documents submitted as part of academic requirements at the institute and other forms of scholarly documents. Wherever possible and available, efforts will be made to provide an access to the full-text of the documents covered in the Digital Repository, without violating copyrights or rights of the author or publisher, as relevant to each work.

Please feel free to write to us, if you want to know more about this service or have any questions with regard to depositing your documents or accessing deposited documents.

Email: libraryservices@iiserpune.ac.in

Communities in Digital Repository

Select a community to browse its collections.

Recently Added

  • Foucaud, Florent; Gahlawat, Harmender; Mc Inerney, Fionn; TALE, PRAFULLKUMAR (Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2025-12)
    The VC-dimension is a well-studied and fundamental complexity measure of a set system (or hypergraph) that is central to many areas of machine learning. We establish several new results on the complexity of computing the ...
  • SANCHETI, POOJA (Routledge, 2026-07)
    NA
  • Chakraborty, Dibyayan; Defrain, Oscar; Foucaud, Florent; Mari, Mathieu; TALE, PRAFULLKUMAR (Dagstuhl Publishing, 2026-07)
    In the Isometric Path Partition problem, the input is a graph G with n vertices and an integer k, and the objective is to determine whether the vertices of G can be partitioned into k vertex-disjoint shortest paths. We ...
  • Adak, Rajat; Nanoti, Saraswati Girish; TALE, PRAFULLKUMAR (Dagstuhl Publishing, 2026-07)
    In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the Token Sliding Connectivity problem, the input is a graph G and an integer k, and ...
  • Srinivasa Ramanujan Library (2026-07)

View more