• Fast and accurate intrinsic symmetry detection 

  Nagar, Rajendra; Raman, Shanmuganathan (2018-12-22)
• Unsupervised GIST based clustering for object localization 

  Shah, Saprem; Khatri, Kunal| Mhasakar, Purva; Nagar, Rajendra; Raman, Shanmuganathan (2019-02-20)
• Automated early leaderboard generation from comparative tables 

  Singh, Mayank; Sarkar, Rajdeep; Vyas, Atharva; Goyal, Pawan; Mukherjee, Animesh; Chakrabarti, Soumen (2019-04-17)
• AgriBot: agriculture-specific question answer system 

  Jain, Naman; Jain, Pranjali; Kayal, Pratik; Sahit, Jayakrishna; Pachpande, Soham; Choudhary, Jayesh; Singh, Mayank (Department of Science and Technology Government of Gujarat, 2019-01-17)
• Discovering topical interactions in text-based cascades using hidden markov hawkes processes 

  Choudhari, Jayesh; Dasgupta, Anirban; Bhattacharya, Indrajit; Bedathur, Srikanta (IEEE ICDM 2018IEEE, 2018-11-17)

  Social media conversations unfold based on complex interactions between users, topics and time. While recent models have been proposed to capture network strengths between users, users' topical preferences and temporal ...
• Graph isomorphism algorithms for graph with bounded structural parameters 

  Enduri, Murali Krishna (Indian Institute of Technology Gandhinagar, 2018)
• On structural parameterizations of intractable graph problems 

  Reddy, I Vinod Kumar (Indian Institute of Technology Gandhinagar, 2018)
• Step towards the design of a collaborative virtual reality based story telling environment 

  Sinha, Sujata (Indian Institute of Technology Gandhinagar, 2018)
• Adaptive multiple-pixel wide seam carving 

  Patel, Diptiben; Shanmuganathan, Srivathsan; Raman, Shanmuganathan (2019-02-20)
• A new approach to deanonymization of unreachable bitcoin nodes 

  Mastan, Indra Deep; Paul,Souradyuti (2018-12-02)
• Context-sensitive computational mechanisms of decision making 

  Chawla, Manisha; Miyapuram, Krishna P. (Elsevier, 2018-11)

  Real-world information is primarily sensory in nature, and understandably people attach value to the sensory information to prepare for appropriate behavioral responses. This review presents research from value-based, ...
• The parameterized complexity of happy colorings 

  Misra, Neeldhara; Reddy, I. Vinod (2018-07-16)
• META: Memory exploration tool for Android devices 

  Parikh, Nisarg; Gohil, Varun; Awasthi, Manu (2018-10-29)
• Discovering topical interactions in text-based cascades using hidden Markov Hawkes processes 

  Bedathur, Srikanta; Bhattacharya, Indrajit; Choudhari, Jayesh; Dasgupta, Anirban (Cornell University Library, 2018-09)

  Social media conversations unfold based on complex interactions between users, topics and time. While recent models have been proposed to capture network strengths between users, users' topical preferences and temporal ...
• On NC algorithms for problems on bounded rank-width graphs 

  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
• Robust multiparty computation with faster verification time 

  Paul, Souradyuti; Shrivastava, Ananya (2018-07-11)
• Generic single edge fault tolerant exact distance Oracle 

  Gupta, Manoj; Singh, Aditi (09-07-2018)
• Parameterized algorithms for conflict-free colorings of graphs 

  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 ...
• Generic Single Edge Fault Tolerant Exact Distance Oracle 

  Gupta, Manoj; Singh, Aditi (Cornell University Library, 2018-05)

  Given an undirected unweighted graph G and a source set S of |S|=? sources, we want to build a data structure which can process the following query {\sc Q}(s,t,e): find the shortest distance from s to t avoiding an edge ...
• Fully dynamic maximal matching in O(log N) update time 

  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 ...

View more