The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Neeldhara Misra" ( http://dblp.L3S.de/Authors/Neeldhara_Misra )

  Author page on DBLP  Author page in RDF  Community of Neeldhara Misra in ASPL-2

Publication years (Num. hits)
2008-2012 (20) 2013 (15) 2014-2015 (21) 2016 (17) 2017-2018 (15) 2019 (11)
Publication types (Num. hits)
article(41) incollection(2) inproceedings(56)
Venues (Conferences, Journals, ...)
CoRR(22) Theor. Comput. Sci.(7) COCOON(6) AAMAS(5) Algorithmica(4) IJCAI(4) MFCS(4) AAAI(3) CALDAM(3) CSR(3) FUN(3) IPEC(3) IWOCA(3) ADT(2) Encyclopedia of Algorithms(2) FSTTCS(2) More (+10 of total 36)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 100 publication records. Showing 99 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura On structural parameterizations of firefighting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya A Parameterized Perspective on Protecting Elections. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 On the Parameterized Complexity of Edge-Linked Paths. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Piyush Rathi The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Chinmay Sonar Robustness Radius for Chamberlin-Courant on Restricted Domains. Search on Bibsonomy SOFSEM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Manoj Gupta, Hitesh Kumar, Neeldhara Misra On the Complexity of Optimal Matching Reconfiguration. Search on Bibsonomy SOFSEM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pratyush Dayal, Neeldhara Misra Deleting to Structured Trees. Search on Bibsonomy COCOON The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra On the Parameterized Complexity of Party Nominations. Search on Bibsonomy ADT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya A Parameterized Perspective on Protecting Elections. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Complexity of manipulation with partial information in voting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy On Structural Parameterizations of Firefighting. Search on Bibsonomy CALDAM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra On the Parameterized Complexity of Colorful Components and Related Problems. Search on Bibsonomy IWOCA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Neeldhara Misra On the Complexity of Two Dots for Narrow Boards and Few Colors. Search on Bibsonomy FUN The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Frugal bribery in voting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into heterogeneous classes of SAT and CSP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jayesh Choudhari, Anirban Dasgupta 0001, Neeldhara Misra, M. S. Ramanujan Saving Critical Nodes with Firefighters is FPT. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Neeldhara Misra, I. Vinod Reddy The Parameterized Complexity of Happy Colorings. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy On Structural Parameterizations of Firefighting. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy On Structural Parameterizations of Graph Motif and Chromatic Number. Search on Bibsonomy CALDAM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jayesh Choudhari, Anirban Dasgupta 0001, Neeldhara Misra, M. S. Ramanujan Saving Critical Nodes with Firefighters is FPT. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, I. Vinod Reddy The Parameterized Complexity of Happy Colorings. Search on Bibsonomy IWOCA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan On the Complexity of Chamberlin-Courant on Almost Structured Profiles. Search on Bibsonomy ADT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. Search on Bibsonomy AAMAS The full citation details ... 2017 DBLP  BibTeX  RDF
1Neeldhara Misra Alternate Parameterizations. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra Kernelization, Planar F-Deletion. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Hitting Forbidden Minors: Approximation and Kernelization. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Kernelization complexity of possible winner and coalitional manipulation problems in voting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra Elicitation for Preferences Single Peaked on Trees. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Complexity of Manipulation with Partial Information in Voting. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty The Runaway Rectangle Escape Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra Preference Elicitation For Single Crossing Domain. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy Color Spanning Objects: Algorithms and Hardness Results. Search on Bibsonomy CALDAM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan Randomised Procedures for Initialising and Switching Actions in Policy Iteration. Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Frugal Bribery in Voting. Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Neeldhara Misra Two Dots is NP-complete. Search on Bibsonomy FUN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra Elicitation for Preferences Single Peaked on Trees. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Complexity of Manipulation with Partial Information in Voting. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra Preference Elicitation for Single Crossing Domain. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Rohit Vaish, Neeldhara Misra, Shivani Agarwal 0001, Avrim Blum On the Computational Hardness of Manipulating Pairwise Voting Rules. Search on Bibsonomy AAMAS The full citation details ... 2016 DBLP  BibTeX  RDF
1Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Manipulation is Harder with Incomplete Votes. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari On Choosing Committees Based on Approval Votes in the Presence of Outliers. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Frugal Bribery in Voting. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh 0001 Solving d-SAT via Backdoors to Small Treewidth. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Saket Saurabh 0001, Neeldhara Misra Graph Modification Problems: A Modern Perspective. Search on Bibsonomy FAW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Vikram Kamat, Neeldhara Misra Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. Search on Bibsonomy CIAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh 0001 Unique Covering Problems with Geometric Sets. Search on Bibsonomy COCOON The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Detecting Possible Manipulators in Elections. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Neeldhara Misra, Arshed Nabeel, Harman Singh On the Parameterized Complexity of Minimax Approval Voting. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001 The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Complexity of Kernelization in the Possible Winner Problem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra Vertex Cover Gets Faster and Harder on Low Degree Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Palash Dey, Neeldhara Misra, Y. Narahari Detecting Possible Manipulators in Elections. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty On the d-Runaway Rectangle Escape Problem. Search on Bibsonomy CCCG The full citation details ... 2014 DBLP  BibTeX  RDF
1Palash Dey, Prachi Goyal, Neeldhara Misra UNO Gets Easier for a Single Player. Search on Bibsonomy FUN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra Vertex Cover Gets Faster and Harder on Low Degree Graphs. Search on Bibsonomy COCOON The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 Imbalance is fixed parameter tractable. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Hannes Moser, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar The Parameterized Complexity of Unique Coverage and Its Variants. Search on Bibsonomy Algorithmica The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman 0001, Bal Sri Shankar Solving min ones 2-sat as fast as vertex cover. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Prachi Goyal, Vikram Kamat, Neeldhara Misra On the Parameterized Complexity of the Maximum Edge Coloring Problem. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Vikram Kamat, Neeldhara Misra An Erdős--Ko--Rado theorem for matchings in the complete graph Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman 0001, Stefan Szeider Upper and Lower Bounds for Weak Backdoor Set Detection Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Prachi Goyal, Vikram Kamat, Neeldhara Misra On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Search on Bibsonomy WG The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman 0001, Stefan Szeider Upper and Lower Bounds for Weak Backdoor Set Detection. Search on Bibsonomy SAT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra Hitting and Piercing Rectangles Induced by a Point Set. Search on Bibsonomy COCOON The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Prachi Goyal, Neeldhara Misra, Fahad Panolan Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. Search on Bibsonomy FSTTCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh 0001 Hardness of r-dominating set on Graphs of Diameter (r + 1). Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001 On Parameterized Independent Feedback Vertex Set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 Planar F-Deletion: Approximation and Optimal FPT Algorithms Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar FPT algorithms for Connected Feedback Vertex Set. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. Search on Bibsonomy FOCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 Kernelization - Preprocessing with a Guarantee. Search on Bibsonomy The Multivariate Algorithmic Revolution and Beyond The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Search on Bibsonomy WG The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Venkatesh Raman 0001, Saket Saurabh 0001 Lower bounds on kernelization. Search on Bibsonomy Discrete Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Hitting forbidden minors: Approximation and Kernelization. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1S. Arumugam 0001, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Algorithmic Aspects of Dominator Colorings in Graphs. Search on Bibsonomy IWOCA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001 On Parameterized Independent Feedback Vertex Set. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Hitting forbidden minors: Approximation and Kernelization Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar FPT Algorithms for Connected Feedback Vertex Set. Search on Bibsonomy WALCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman 0001, Bal Sri Shankar Solving minones-2-sat as Fast as vertex cover. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh 0001 Imbalance Is Fixed Parameter Tractable. Search on Bibsonomy COCOON The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001 The effect of girth on the kernelization complexity of Connected Dominating Set. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan On the Kernelization Complexity of Colorful Motifs. Search on Bibsonomy IPEC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh 0001 The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar FPT Algorithms for Connected Feedback Vertex Set Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Neeldhara Misra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar The Budgeted Unique Coverage Problem and Color-Coding. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh 0001 Graph Layout Problems Parameterized by Vertex Cover. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #99 of 99 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license