BOOK CHAPTERS: Recent submissions

  • Methods for Molecular Modelling of Protein Complexes 
    KANITKAR, TEJASHREE RAJARAM; SEN, NEELADRI; NAIR, SANJANA; SONI, NEELESH; AMRITKAR, KAUSTUBH; YAMTIRTHA, YOGENDRA; MADHUSUDHAN, M. S. (Springer Nature, 2021-05)
    Biological processes are often mediated by complexes formed between proteins and various biomolecules. The 3D structures of such protein–biomolecule complexes provide insights into the molecular mechanism of their action. ...
  • Teaching and Research in Colonial Bombay 
    Mathew, John; SOHONI, PUSHKAR (Oxford University Press, 2021)
    Bombay did not play the kind of administrative nodal role that first Madras and later Calcutta did in terms of overarching governance in the Indian subcontinent, occupying instead a pivotal position for the region’s commerce ...
  • Visual language of piety and power: Ta’ziahs and temples in the Western Deccan’ 
    SOHONI, PUSHKAR (Routledge, 2021)
  • From Colonial to National: Appropriating the Past in Service of the Present 
    SOHONI, PUSHKAR (DAG, 2022)
  • Golconda and Hyderabad 
    SOHONI, PUSHKAR (Rupa Publications India, 2022-07)
  • Introduction 
    SOHONI, PUSHKAR (Rupa Publications India, 2022-07)
  • On Structural Parameterizations of the Offensive Alliance Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2021-12)
    The OFFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set S⊆V of vertices is an offensive alliance in an undirected graph G=(V,E) if each v∈N(S) has at least as many neighbours in S ...
  • Parameterized Intractability of Defensive Alliance Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2022-01)
    The DEFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set R of vertices of a graph is a defensive alliance if, for each element of R, the majority of its neighbours are in R. The problem ...
  • On the Harmless Set Problem Parameterized by Treewidth 
    GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2022-03)
    Given a graph G=(V,E), a threshold function t : V→N and an integer k, we study the HARMLESS SET problem, where the goal is to find a subset of vertices S⊆V of size at least k such that every vertex v in V has less than ...
  • Climate Resilient Development Pathways 
    Lisa, E.; THOMAS, BEJOY K. et al. (Intergovernmental Panel on Climate Change (IPCC), 2022-02)
  • Cities, Settlements and Key Infrastructure 
    Dodman, David; SHARMA, SHALINI et al. (Intergovernmental Panel on Climate Change (IPCC), 2022-02)
  • Architectures of Nucleolipid Assemblies and Their Applications 
    WALUNJ, MANISHA B.; DUTTA, SWAGATA; SRIVATSAN, SEERGAZHI G. (Springer Nature, 2022)
    The ability of nucleobases, nucleosides, nucleotides and their derivatives to support supramolecular interactions has enabled the construction of a variety of architectures. In particular, nucleolipid hybrids have gained ...
  • Two-dimensional materials for photocatalytic water splitting and CO2 reduction 
    BHOSALE, RESHMA; Tonda, Surendar; Kumar, Santosh; OGALE, SATISHCHANDRA (Elsevier B.V., 2020)
    Considering the increased energy consumption with tremendously growing population and industrialization, incorporation of abundant and clean energy systems in the energy mix is an absolute and prime requisite for sustainability ...
  • Exploring Non-covalent Interactions by Jet-Cooled Electronic and Vibrational Spectroscopy 
    PANWARIA, PRAKASH; DAS, ALOKE (Springer Nature, 2021-04)
    Gas-phase laser spectroscopy in a supersonic jet is an important technique to probe the intrinsic nature and strength of weak non-covalent interactions present in molecular systems relevant to biology and materials. In ...
  • Educational strategies to achieve global awareness of climate change and its impact 
    CHOPRA, RAHUL; NAGARAJAN, ANITA; JOSHI, APARNA; Fomproix, Nathalie; SHASHIDHARA, L.S. (World Meteorological Organization, 2019)
    Climate change constitutes a global challenge with significant adverse impacts on sustainable and equitable development. A critical step to address this challenge is to increase the awareness of climate change and the ...
  • Parameterized Complexity of Satisfactory Partition Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2020-12)
    The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in ...
  • Parameterized Complexity of Defensive and Offensive Alliances in Graphs 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    In this paper we study the problem of finding small defensive and offensive alliances in a simple graph. Given a graph G=(V,E) and a subset S⊆V(G) , we denote by dS(v) the degree of a vertex v∈V in G[S], the subgraph of G ...
  • The Small Set Vertex Expansion Problem 
    MAITY, SOUMEN (Springer Nature, 2020-12)
    Given a graph G=(V,E) , the vertex expansion of a set S⊂V is defined as ΦV(S)=|N(S)
  • Parameterized Complexity of Locally Minimal Defensive Alliances 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    A defensive alliance in a graph G=(V,E) is a set of vertices S satisfying the condition that every vertex v∈S has at least as many neighbours (including itself) in S as it has in V∖S . We consider the notion of local ...
  • The Balanced Satisfactory Partition Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    The Satisfactory Partition problem asks whether it is possible to partition the vertex set of a given undirected graph into two parts such that each vertex has at least as many neighbours in its own part as in the other ...

Search Repository


Advanced Search

Browse

My Account