Journal Articles

Journal Articles

 

Recent Submissions

  • 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 ...
  • Baswana, Surender; Gupta, Manoj; Sen, Sandeep (Society for Industrial and Applied Mathematics, 2018-01)
    We present an algorithm for maintaining a maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized O(log n) time for each edge update, where n is the ...
  • Deya, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2018-03)
    The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of ...
  • Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Elsevier, 2018-03)
    In this paper, we study the Shortest Color Spanning - Intervals problem, and related generalizations, namely Smallest Color Spanning - Squares and Smallest Color Spanning - Circles. The generic setting is the following: ...
  • Bhimani, Janki; Yang, Zhengyu; Mi, Ningfang; Yang, Jingpei; Xu, Qiumin; Awasthi, Manu; Pandurangan, Rajinikanth; Balakrishnan, Vijay (IEEE xplore digital library, 2018-02)
    By using fast back-end storage, performance benefits of a lightweight container platform can be leveraged with quick I/O response. Nevertheless, the performance of simultaneously executing multiple instances of same or ...
  • Cormode, Graham; Dasgupta, Anirban; Goyal, Amit; Lee, Chi Hoon (American Physical Society, 2018-01)
    Many modern applications of AI such as web search, mobile browsing, image processing, and natural language processing rely on finding similar items from a large database of complex objects. Due to the very large scale of ...
  • 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 ...
  • Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2017-05)
    Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $Bribery problem, namely, Frugal-bribery and Frugal-$bribery where the ...
  • Garg, Dinesh; Jain, Alankar; Borkar, Vivek (Springer Vienna, 2016-12)
    We consider the problem of inferring the source of a rumor in a given large network. We assume that the rumor propagates in the network through a discrete time susceptible-infected model. Input to our problem includes ...
  • Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo (Elsevier, 2017-04)
    It is well-known that succinct encodings of computational problems – using circuits or formulas to encode large instances – generally result in an exponential complexity blow-up compared to their original complexity. We ...
  • 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 ...
  • Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (Springer, 2016-05)
    Indifferentiability security of a hash mode of operation guarantees the mode's resistance against all generic attacks. It is also useful to establish the security of protocols that use hash functions as random functions. ...
  • 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 ...
  • 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 ...
  • Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2015-01)
    We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given ...
  • 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 ...
  • 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 ...
  • 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, ...
  • Patel, Dhiren R.; Limkar, Suresh (Foundation of Computer Science, 2010-09)
    We are moving towards an era where location information will be necessary for access control. The use of location information can be used for enhancing the security of an application, for critical applications, such as the ...
  • Saxena, Anupam; Pal, Om; Saquib, Zia; Patel, Dhiren R. (Eswar Publications, 2010-03)
    Security of SCADA (supervisory Control and Data Acquisition) has become a challenging issue today because of its connectivity with the outside world and remote access to the system. One major challenge in the SCADA systems ...

View more