Neeldhara Misra
Orcid: 0000-0003-1727-5388Affiliations:
- Indian Institute of Technology, Gandhinagar, India
- Institute of Mathematical Sciences, Chennai, India (PhD 2012)
According to our database1,
Neeldhara Misra
authored at least 100 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on youtube.com
-
on linkedin.com
-
on twitter.com
-
on orcid.org
-
on iitgn.ac.in
-
on github.com
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
2023
J. Comput. Syst. Sci., August, 2023
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports, November, 2022
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022
Proceedings of the Computer Science - Theory and Applications, 2022
Diverse Non Crossing Matchings.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022
2021
2020
J. Comput. Syst. Sci., 2020
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.
Algorithms, 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020
Red-Blue Point Separation for Points on a Circle.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.
Theor. Comput. Sci., 2019
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Algorithmica, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
Proceedings of the Computer Science - Theory and Applications, 2019
Proceedings of the Computer Science - Theory and Applications, 2019
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019
2018
Theor. Comput. Sci., 2018
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018
2017
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017
2016
Kernelization complexity of possible winner and coalitional manipulation problems in voting.
Theor. Comput. Sci., 2016
SIAM J. Discret. Math., 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the 8th International Conference on Fun with Algorithms, 2016
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
2015
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
SIAM J. Discret. Math., 2015
CoRR, 2015
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Algorithmica, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
2014
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Algorithmica, 2014
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
J. Graph Theory, 2013
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012
2011
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
2009
Theory Comput. Syst., 2009
Proceedings of the Computer Science, 2009
2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008