Publications

Conference Publications

DBLP ⸱ Conferences ⸱ Journals ⸱ ArXiV ⸱ Other

 

Agrawal, Akanksha, Sathish Govindarajan, and Neeldhara Misra. 2014. “Vertex Cover Gets Faster and Harder on Low Degree Graphs.” In Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, edited by Zhipeng Cai, Alex Zelikovsky, and Anu G. Bourgeois, 8591:179–90. Lecture Notes in Computer Science. Springer.

Ambalath, Abhimanyu M., Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, and M. S. Ramanujan. 2010. “On the Kernelization Complexity of Colorful Motifs.” In Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, edited by Venkatesh Raman and Saket Saurabh, 6478:14–25. Lecture Notes in Computer Science. Springer.

Aravind, N. R., Neeldhara Misra, and Harshil Mittal. 2022. “Chess Is Hard Even for a Single Player.” In 11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy, edited by Pierre Fraigniaud and Yushi Uno, 226:5:1–20. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Arumugam, S., K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh. 2011. “Algorithmic Aspects of Dominator Colorings in Graphs.” In Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, edited by Costas S. Iliopoulos and William F. Smyth, 7056:19–30. Lecture Notes in Computer Science. Springer.

Ashok, Pradeesha, Sudeshna Kolay, Neeldhara Misra, and Saket Saurabh. 2015. “Unique Covering Problems with Geometric Sets.” In Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings, edited by Dachuan Xu, Donglei Du, and Ding-Zhu Du, 9198:548–58. Lecture Notes in Computer Science. Springer.

Banerjee, Sandip, Neeldhara Misra, and Subhas C. Nandy. 2016. “Color Spanning Objects: Algorithms and Hardness Results.” In Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings, edited by Sathish Govindarajan and Anil Maheshwari, 9602:37–48. Lecture Notes in Computer Science. Springer.

Bilò, Davide, Luciano Gualà, Stefano Leucci, and Neeldhara Misra. 2018. “On the Complexity of Two Dots for Narrow Boards and Few Colors.” In 9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy, edited by Hiro Ito, Stefano Leonardi, Linda Pagli, and Giuseppe Prencipe, 100:7:1–15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Choudhari, Jayesh, Anirban Dasgupta, Neeldhara Misra, and M. S. Ramanujan. 2017. “Saving Critical Nodes with Firefighters Is FPT.” In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, edited by Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, 80:135:1–13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Das, Bireswar, Murali Krishna Enduri, Neeldhara Misra, and I. Vinod Reddy. 2017. “On Structural Parameterizations of Graph Motif and Chromatic Number.” In Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings, edited by Daya Ram Gaur and N. S. Narayanaswamy, 10156:118–29. Lecture Notes in Computer Science. Springer.

———. 2018. “On Structural Parameterizations of Firefighting.” In Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings, edited by B. S. Panda and Partha P. Goswami, 10743:221–34. Lecture Notes in Computer Science. Springer.

Dayal, Pratyush, and Neeldhara Misra. 2019. “Deleting to Structured Trees.” In Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi’an, China, July 29-31, 2019, Proceedings, edited by Ding-Zhu Du, Zhenhua Duan, and Cong Tian, 11653:128–39. Lecture Notes in Computer Science. Springer.

Dey, Palash, Prachi Goyal, and Neeldhara Misra. 2014. “UNO Gets Easier for a Single Player.” In Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, edited by Alfredo Ferro, Fabrizio Luccio, and Peter Widmayer, 8496:147–57. Lecture Notes in Computer Science. Springer.

Dey, Palash, and Neeldhara Misra. 2016a. “Elicitation for Preferences Single Peaked on Trees.” In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, edited by Subbarao Kambhampati, 215–21. IJCAI/AAAI Press.

———. 2016b. “Preference Elicitation for Single Crossing Domain.” In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, edited by Subbarao Kambhampati, 222–28. IJCAI/AAAI Press.

———. 2017. “On the Exact Amount of Missing Information That Makes Finding Possible Winners Hard.” In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, edited by Kim G. Larsen, Hans L. Bodlaender, and Jean-François Raskin, 83:57:1–14. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Dey, Palash, Neeldhara Misra, and Y. Narahari. 2015a. “Detecting Possible Manipulators in Elections.” In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, edited by Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, and Edith Elkind, 1441–50. ACM.

———. 2015b. “Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.” In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, edited by Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, and Edith Elkind, 87–96. ACM.

———. 2016a. “Complexity of Manipulation with Partial Information in Voting.” In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, edited by Subbarao Kambhampati, 229–35. IJCAI/AAAI Press.

———. 2016b. “Frugal Bribery in Voting.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, edited by Dale Schuurmans and Michael P. Wellman, 2466–72. AAAI Press.

———. 2017. “Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.” In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, são Paulo, Brazil, May 8-12, 2017, edited by Kate Larson, Michael Winikoff, Sanmay Das, and Edmund H. Durfee, 42–50. ACM.

Dey, Palash, Neeldhara Misra, Swaprava Nath, and Garima Shakya. 2019. “A Parameterized Perspective on Protecting Elections.” In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, edited by Sarit Kraus, 238–44. ijcai.org.

Fellows, Michael R., Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. 2008. “Graph Layout Problems Parameterized by Vertex Cover.” In Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, edited by Seok-Hee Hong, Hiroshi Nagamochi, and Takuro Fukunaga, 5369:294–305. Lecture Notes in Computer Science. Springer.

Fomin, Fedor V., Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh. 2011. “Hitting Forbidden Minors: Approximation and Kernelization.” In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, edited by Thomas Schwentick and Christoph Dürr, 9:189–200. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Fomin, Fedor V., Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, and Saket Saurabh. 2015. “Solving d-SAT via Backdoors to Small Treewidth.” In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, edited by Piotr Indyk, 630–41. SIAM.

Fomin, Fedor V., Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. 2012. “Planar f-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.” In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, 470–79. IEEE Computer Society.

Fomin, Fedor V., Saket Saurabh, and Neeldhara Misra. 2015. “Graph Modification Problems: A Modern Perspective.” In Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings, edited by Jianxin Wang and Chee-Keng Yap, 9130:3–6. Lecture Notes in Computer Science. Springer.

Gaspers, Serge, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, and Stanislav Zivný. 2014. “Backdoors into Heterogeneous Classes of SAT and CSP.” In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada, edited by Carla E. Brodley and Peter Stone, 2652–58. AAAI Press.

Gowda, Kishen N., Neeldhara Misra, and Vraj Patel. 2020. “A Parameterized Perspective on Attacking and Defending Elections.” In Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12126:277–88. Lecture Notes in Computer Science. Springer.

Goyal, Prachi, Vikram Kamat, and Neeldhara Misra. 2013. “On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.” In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, edited by Krishnendu Chatterjee and Jirı́ Sgall, 8087:492–503. Lecture Notes in Computer Science. Springer.

Goyal, Prachi, Neeldhara Misra, and Fahad Panolan. 2013. “Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.” In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, edited by Anil Seth and Nisheeth K. Vishnoi, 24:237–48. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Gupta, Manoj, Hitesh Kumar, and Neeldhara Misra. 2019. “On the Complexity of Optimal Matching Reconfiguration.” In SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, edited by Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, and Giovanni Pighizzini, 11376:221–33. Lecture Notes in Computer Science. Springer.

Heggernes, Pinar, Pim van ’t Hof, Dániel Marx, Neeldhara Misra, and Yngve Villanger. 2012. “On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.” In Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, edited by Martin Charles Golumbic, Michal Stern, Avivit Levy, and Gila Morgenstern, 7551:332–43. Lecture Notes in Computer Science. Springer.

Kalyanakrishnan, Shivaram, Neeldhara Misra, and Aditya Gopalan. 2016. “Randomised Procedures for Initialising and Switching Actions in Policy Iteration.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, edited by Dale Schuurmans and Michael P. Wellman, 3145–51. AAAI Press.

Kamat, Vikram, and Neeldhara Misra. 2015. “Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.” In Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings, edited by Vangelis Th. Paschos and Peter Widmayer, 9079:249–60. Lecture Notes in Computer Science. Springer.

Kaur, Chamanvir, and Neeldhara Misra. 2020. “On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.” In Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings, edited by Manoj Changat and Sandip Das, 12016:427–38. Lecture Notes in Computer Science. Springer.

Lokshtanov, Daniel, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, and Saket Saurabh. 2013. “Hardness of r-Dominating Set on Graphs of Diameter (r + 1).” In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, edited by Gregory Z. Gutin and Stefan Szeider, 8246:255–67. Lecture Notes in Computer Science. Springer.

Lokshtanov, Daniel, Neeldhara Misra, and Saket Saurabh. 2010. “Imbalance Is Fixed Parameter Tractable.” In Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, edited by My T. Thai and Sartaj Sahni, 6196:199–208. Lecture Notes in Computer Science. Springer.

———. 2012. “Kernelization - Preprocessing with a Guarantee.” In The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael r. Fellows on the Occasion of His 60th Birthday, edited by Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, and Dániel Marx, 7370:129–61. Lecture Notes in Computer Science. Springer.

———. 2013. “On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.” In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, edited by Gregory Z. Gutin and Stefan Szeider, 8246:243–54. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara. 2016. “Two Dots Is NP-Complete.” In 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy, edited by Erik D. Demaine and Fabrizio Grandoni, 49:24:1–12. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

———. 2018. “On the Parameterized Complexity of Colorful Components and Related Problems.” In Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, edited by Costas S. Iliopoulos, Hon Wai Leong, and Wing-Kin Sung, 10979:237–49. Lecture Notes in Computer Science. Springer.

———. 2019. “On the Parameterized Complexity of Party Nominations.” In Algorithmic Decision Theory - 6th International Conference, ADT 2019, Durham, NC, USA, October 25-27, 2019, Proceedings, edited by Sasa Pekec and Kristen Brent Venable, 11834:112–25. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and Harshil Mittal. 2020. “Imbalance Parameterized by Twin Cover Revisited.” In Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings, edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, and Dong Hoon Lee, 12273:162–73. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Harshil Mittal, and Aditi Sethia. 2020. “Red-Blue Point Separation for Points on a Circle.” In Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada, edited by J. Mark Keil and Debajyoti Mondal, 266–72.

Misra, Neeldhara, Arshed Nabeel, and Harman Singh. 2015. “On the Parameterized Complexity of Minimax Approval Voting.” In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015, edited by Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, and Edith Elkind, 97–105. ACM.

Misra, Neeldhara, N. S. Narayanaswamy, Venkatesh Raman, and Bal Sri Shankar. 2010. “Solving Minones-2-Sat as Fast as Vertex Cover.” In Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, edited by Petr Hlinený and Antonı́n Kucera, 6281:549–55. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and Debanuj Nayak. 2022. “On Fair Division with Binary Valuations Respecting Social Networks.” In Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings, edited by Niranjan Balachandran and R. Inkulu, 13179:265–78. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Sebastian Ordyniak, Venkatesh Raman, and Stefan Szeider. 2013. “Upper and Lower Bounds for Weak Backdoor Set Detection.” In Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, edited by Matti Järvisalo and Allen Van Gelder, 7962:394–402. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, and Saket Saurabh. 2013. “Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.” In Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, lübeck, Germany, June 19-21, 2013, Revised Papers, edited by Andreas Brandstädt, Klaus Jansen, and Rüdiger Reischuk, 8165:370–81. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Fahad Panolan, and Saket Saurabh. 2013. “Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?” In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, edited by Krishnendu Chatterjee and Jirı́ Sgall, 8087:679–90. Lecture Notes in Computer Science. Springer.

———. 2019. “On the Parameterized Complexity of Edge-Linked Paths.” In Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings, edited by René van Bevern and Gregory Kucherov, 11532:286–98. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh. 2010. “The Effect of Girth on the Kernelization Complexity of Connected Dominating Set.” In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, edited by Kamal Lodaya and Meena Mahajan, 8:96–107. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

———. 2011. “On Parameterized Independent Feedback Vertex Set.” In Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, edited by Bin Fu and Ding-Zhu Du, 6842:98–109. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar. 2010. “FPT Algorithms for Connected Feedback Vertex Set.” In WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, edited by Md. Saidur Rahman and Satoshi Fujita, 5942:269–80. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar. 2009. “The Budgeted Unique Coverage Problem and Color-Coding.” In Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings, edited by Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, and Klaus W. Wagner, 5675:310–21. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and Piyush Rathi. 2019. “The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.” In Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings, edited by René van Bevern and Gregory Kucherov, 11532:299–310. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and I. Vinod Reddy. 2017. “The Parameterized Complexity of Happy Colorings.” In Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, edited by Ljiljana Brankovic, Joe Ryan, and William F. Smyth, 10765:142–53. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and Aditi Sethia. 2020. “Fair Division Is Hard Even for Amicable Agents.” In Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020, edited by Gennaro Cordasco, Luisa Gargano, and Adele A. Rescigno, 2756:202–7. CEUR Workshop Proceedings. CEUR-WS.org.

———. 2021. “Fair Division Is Hard Even for Amicable Agents.” In SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings, edited by Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, and Prudence W. H. Wong, 12607:421–30. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, and Chinmay Sonar. 2019. “Robustness Radius for Chamberlin-Courant on Restricted Domains.” In SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, edited by Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, and Giovanni Pighizzini, 11376:341–53. Lecture Notes in Computer Science. Springer.

Misra, Neeldhara, Chinmay Sonar, and P. R. Vaidyanathan. 2017. “On the Complexity of Chamberlin-Courant on Almost Structured Profiles.” In Algorithmic Decision Theory - 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings, edited by Jörg Rothe, 10576:124–38. Lecture Notes in Computer Science. Springer.

Rajgopal, Ninad, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, and Neeldhara Misra. 2013. “Hitting and Piercing Rectangles Induced by a Point Set.” In Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings, edited by Ding-Zhu Du and Guochuan Zhang, 7936:221–32. Lecture Notes in Computer Science. Springer.

Roy, Aniket Basu, Sathish Govindarajan, Neeldhara Misra, and Shreyas Shetty. 2014. “On the d-Runaway Rectangle Escape Problem.” In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014. Carleton University, Ottawa, Canada.

Sonar, Chinmay, Palash Dey, and Neeldhara Misra. 2020. “On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.” In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, edited by Christian Bessiere, 89–95. ijcai.org.

Vaish, Rohit, Neeldhara Misra, Shivani Agarwal, and Avrim Blum. 2016. “On the Computational Hardness of Manipulating Pairwise Voting Rules.” In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, edited by Catholijn M. Jonker, Stacy Marsella, John Thangarajah, and Karl Tuyls, 358–67. ACM.