Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (De Gruyter, 2016-04)
    A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them ...
  • Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian (Elsevier, 2012-08)
    We show that, for k constant, k -tree isomorphism can be decided in logarithmic space by giving an View the MathML sourceO(klogn) space canonical labeling algorithm. The algorithm computes a unique tree decomposition, ...
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2016-02)
    In the Possible winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences ...
  • Das, Bireswar; Datta, Samir; Prajakta, Nimbhorkar (Springer Link, 2013-05)
    Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of FSTTCS’07: The 27th Annual Conference on Foundations of ...
  • Pandey, Pradumn Kumar; Singh, Mayank (Public Library of Science, 2019)
  • Banerjee, Suman; Banjare, Pratik; Pal, Bithika; Jenamani, Mamata (Springer, 2020-08)
    Recommender system is a collection of information retrieval tools and techniques used for recommending items to users based on their choices. For improving recommendation accuracy, the use of extra information (e.g., social, ...
  • Das, Laya; Garg, Dinesh; Srinivasan, Babji (Elsevier, 2019-09)
  • Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)
    In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
  • Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)
    he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...

Search Digital Repository


Browse

My Account