Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • Scalable estimation of epidemic thresholds via node sampling 
    Dasgupta, Anirban; Sengupta, Srijan (Springer Nature, 2021-06)
    Infectious or contagious diseases can be transmitted from one person to another through social contact networks. In today’s interconnected global society, such contagion processes can cause global public health hazards, ...
  • A simple trilingual app for determining near-surface soil moisture 
    Kalra, Kanishk; Gadi, Vinay Kumar; Alybaev, Dastan; Garg, Ankit; Sreedeep, S.; Sahoo, Lingaraj (Springer Verlag, 2021-02)
    The locust has been devastating pest, which destructs the crops and pastures. Scientists discover the breeding habitats of locust based on soil surface water content (SWC) to devise preventive measures. Hence, accurate ...
  • Special issue new frontiers in parameterized complexity and algorithms: foreward by the guest editors 
    Misra, Neeldhara; Rosamond, Frances; Zehavi, Meirav (MDPI, 2020-09)
    This Special Issue contains eleven articles�surveys and research papers�that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of ...
  • Strong Edge coloring of Cayley graphs and some product graphs 
    Dara, Suresh; Mishra, Suchismita; Narayanan, Narayanan; Tuza, Zsolt (Springer, 2022-04)
    A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper we determine ...
  • A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs 
    Madathil, Jayakrishnan; Sharma, Roohani; Zehavi, Meirav (Springer, 2021-02)
    Given an n-vertex digraph D and a non-negative integer k, the Minimum Directed Bisection problem asks if the vertices of D can be partitioned into two parts, say L and R, such that |L| and |R| difer by at most 1 and the ...
  • Subexponential algorithm for d-cluster edge deletion: exception or rule? 
    Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket (Elsevier, 2020-11)
  • A survey on influence maximization in a social network 
    Banerjee, Suman; Jenamani, Mamata; Pratihar, Dilip Kumar (Springer Verlag, 2020-03)
    Given a social network with diffusion probabilities as edge weights and a positive integer k, which k nodes should be chosen for initial injection of information to maximize the influence in the network? This problem is ...
  • Vartalaap: what drives #airquality discussions: politics, pollution or pseudo-science? 
    Adhikary, Rishiraj; Patel, Zeel B.; Srivastava, Tanmay; Batra, Nipun; Singh, Mayank; Bhatia, Udit; Guttikunda, Sarath (Association for Computing Machinery, 2021-04)
    Air pollution is a global challenge for cities across the globe. Understanding the public perception of air pollution can help policymakers engage better with the public and appropriately introduce policies. Accurate public ...
  • Zero knowledge and circuit minimization 
    Allender, Eric; Das, Bireswar (Elsevier, 2017-10)
    We show that every problem in the complexity class (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (). In particular Graph Isomorphism lies in . This is the first theorem ...

Search Digital Repository


Browse

My Account