Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • Reddy, I. Vinod (Elsevier, 2018-05)
    In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
  • Agrawal, Akanksha; Aravind, N.R.; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami; Lauri, Juho; Misra, Neeldhara; Reddy, I. Vinod (Elsevier, 2020-10)
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2019-04)
    Approval voting provides an opportunity for the agents to make a comment about every candidate, without incurring the overhead of determining a full ranking on the entire set of candidates. This makes approval voting a ...
  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Elsevier, 2021-06)
    We study the parameterized complexity of the Optimal Defense and Optimal Attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a district consisting of a set of votes) ...
  • Bichhawat, Abhishek; Rajani, Vineet; Garg, Deepak; Hammer, Christian (IOS Press, 2021-06)
  • Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Elsevier, 2020-06)
    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism ...
  • Bhatia, Udit; Ganguly, Auroop Ratan (Springer Nature Publishing, 2019-06)
    Natural climate variability, captured through multiple initial condition ensembles, may be comparable to the variability caused by knowledge gaps in future emissions trajectories and in the physical science basis, especially ...
  • Pandey, Pradumn Kumar; Singh, Mayank (Institute of Electrical and Electronics Engineers, 2020-10)
    Complex systems have been successfully modeled as networks exhibiting the varying extent of randomness and nonrandomness. Network scientists contemplate randomness as one of the most desirable characteristics for real ...
  • Sharma, Purva; Agrawal, Anuj; Bhatia, Vimal; Prakash, Shashi; Mishra, Amit Kumar (Institute of Electrical and Electronics Engineers, 2021-08)
    Increasing incidents of cyber attacks and evolution of quantum computing poses challenges to secure existing information and communication technologies infrastructure. In recent years, quantum key distribution (QKD) is ...
  • Banerjee, Narayan; Majumder, Barun (Elsevier, 2016-03)
    With an explicit example, we show that Jordan frame and the conformally transformed Einstein frames clearly lead to different physics for a non-minimally coupled theory of gravity, namely Brans–Dicke theory, at least at ...
  • Echempati, Raghu; LeBlanc, Nathan Marshall; Sahu, Ankita; Dani, Theodore Paul (American Society for Engineering Education, 2014-04)
    In this paper, the teaching and learning experiences of the author with two summer interns at one of the educational institutions in India is presented. These are the senior mechanical engineering students from two ...
  • Patel, Dhiren R.; Khuba, Sidheshwar A. (Journal of Computing, 2009-12)
    Web blog is used as a collaborative platform to publish and share information. The information accumulated in the blog intrinsically contains the knowledge. The knowledge shared by the community of people has intangible ...
  • Patel, Diptiben; Nagar, Rajendra; Raman, Shanmuganathan (Elsevier, 2019-04)
    Reflection symmetry is one of the most commonly occurring and prominent visual attributes present in the real world. With an increase in the display devices of different sizes and aspect ratios, the images captured from ...
  • Das, Bireswar; Toran, Jacobo; Wagner, Fabian (Elsevier, 2012-08)
    The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following ...
  • 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, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket (Elsevier, 2020-11)
  • 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 ...

Search Digital Repository


Browse

My Account