ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Journal / Conference

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 8.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2019) Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. In: THEORETICAL COMPUTER SCIENCE, 783 . pp. 53-70.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2017) Frugal bribery in voting. In: THEORETICAL COMPUTER SCIENCE, 676 . pp. 15-32.

Dey, Palash and Misra, Neeldhara and Narahari, Y (2016) Kernelization complexity of possible winner and coalitional manipulation problems in voting. In: THEORETICAL COMPUTER SCIENCE, 616 . pp. 111-125.

Guha, Ashwin and Dukkipati, Ashwin (2015) A faster algorithm for testing polynomial representability of functions over finite integer rings. In: THEORETICAL COMPUTER SCIENCE, 579 . pp. 88-99.

Babu, Jasine and Basavaraju, Manu and Chandran, Sunil L and Rajendraprasad, Deepak (2014) 2-Connecting outerplanar graphs without blowing up the pathwidth. In: 19th Annual International Computing and Combinatorics Conference (COCOON, JUN, 2013, Hanhzhou, PEOPLES R CHINA, pp. 119-134.

Babu, Jasine and Biniaz, Ahmad and Maheshwari, Anil and Smid, Michiel (2014) Fixed-orientation equilateral triangle matching of point sets. In: THEORETICAL COMPUTER SCIENCE, 555 . pp. 55-70.

Misra, Neeldhara and Narayanaswamy, NS and Raman, Venkatesh and Shankar, Bal Sri (2013) Solving MIN ONES 2-SAT as fast as VERTEX COVER. In: THEORETICAL COMPUTER SCIENCE, 506 . pp. 115-121.

Chang, Gerard J and Panda, BS and Pradhan, D (2012) Complexity of distance paired-domination problem in graphs. In: THEORETICAL COMPUTER SCIENCE, 459 . pp. 89-99.

This list was generated on Mon Dec 5 09:16:26 2022 IST.