• Saving critical nodes with firefighters is FPT 

  Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)
• Performance analysis of containerized applications on local and remote storage 

  Xu, Qiumin; Awasthi, Manu; Malladi, Krishna T.; Bhimani, Janki; Yang, Jingpei; Annavaram, Murali (2017-05-15)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers 

  Dey, Palash; Misra, Neeldhara; Narahari, Y. (2017-05-08)
• Multiple source dual fault tolerant BFS trees 

  Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
• Caching with dual costs 

  Dasgupta, Anirban; Kumar, Ravi; Sarlós, Tamás (2017-04-03)
• Relation of agglomerative clustering and topic mapping on neuro-imaging data 

  Sinha, Sujata; Miyapuram, Krishna Prasad (IISER Kolkata, 2016-01-09)
• A sparse nonlinear classifier design using AUC optimization 

  Kakkar, Vishal; Shevade, Shirish Krishnaj; Sundararajan, S.; Garg, Dinesh (SIAM, 2017-04-27)
• Frugal bribery in voting 

  Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2017-03)

  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 ...
• Biclustering text-mined Neuroimaging data to understand human brain functions 

  Sinha, Sujata; Miyapuram, Krishna P.; Karlapalem, Kamalakar (Indian Institute of Technology Madras, 2017-03-09)
• On structural parameterizations of graph motif and chromatic number 

  Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Vinod Reddy, I. (Springer International Publishing, 2017)

  Structural parameterizations for hard problems have proven to be a promising venture for discovering scenarios where the problem is tractable. In particular, when a problem is already known to be polynomially solvable for ...
• A sparse nonlinear classifier design using AUC optimization 

  Garg, Dinesh; Kakkar, Vishal; Shevade, Shirish K.; Sundararajan, S. (Cornell University Library, 2016-12)

  AUC (Area under the ROC curve) is an important performance measure for applications where the data is highly imbalanced. Learning to maximize AUC performance is thus an important research problem. Using a max-margin based ...
• Fast rumor source identification via random walks 

  Garg, Dinesh; Jain, Alankar; Borkar, Vivek (Springer Vienna, 2016-08)

  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 ...
• Polynomial-time algorithm for isomorphism of graphs with clique-width at most three 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Springer, 2016-07)

  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 ...
• CNF and DNF succinct graph encodings 

  Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo (Elsevier, 2016-06)

  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 ...
• Complexity of manipulation with partial information in Voting 

  Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)

  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 ...
• Preference elicitation for single crossing domain 

  Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)

  Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation ...
• Better analysis of greedy binary search tree on decomposable sequences 

  Goyal, Navin; Gupta, Manoj (Cornell University Library, 2016-01)

  In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. ...
• On sampling nodes in a network 

  Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio; Sarlos, Tamas (2016-04)
• Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier 

  Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (De Gruyter, 2016-01)

  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 ...
• Improved indifferentiability security bound for the JH mode 

  Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (Springer, 2016-02)

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

View more