×

zbMATH — the first resource for mathematics

Misra, Neeldhara

Compute Distance To:
Author ID: misra.neeldhara Recent zbMATH articles by "Misra, Neeldhara"
Published as: Misra, N.; Misra, Neeldhara
Documents Indexed: 75 Publications since 1939

Publications by Year

Citations contained in zbMATH

46 Publications have been cited 294 times in 252 Documents Cited by Year
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
36
2008
Kernelization – preprocessing with a guarantee. Zbl 1358.68141
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
27
2012
The complexity ecology of parameters: An illustration using bounded max leaf number. Zbl 1184.05123
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket
20
2009
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
19
2011
On the kernelization complexity of colorful motifs. Zbl 1309.68143
Ambalath, Abhimanyu M.; Balasundaram, Radheshyam; Rao H., Chintan; Koppula, Venkata; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.
19
2010
A necessary and sufficient condition for the solutions of a functional differential equation to be oscillatory or tend to zero. Zbl 0874.34058
Das, Pitambar; Misra, N.
16
1997
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
13
2012
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
12
2012
Lower bounds on kernelization. Zbl 1248.90078
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket
12
2011
Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215
Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
10
2011
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
9
2016
On the hardness of eliminating small induced subgraphs by contracting edges. Zbl 1406.68034
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
8
2013
The parameterized complexity of unique coverage and its variants. Zbl 1290.68059
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
8
2013
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Zbl 1334.91035
Dey, Palash; Misra, Neeldhara; Narahari, Y.
7
2016
Frugal bribery in voting. Zbl 1371.91050
Dey, Palash; Misra, Neeldhara; Narahari, Y.
6
2017
Deterministic algorithms for matching and packing problems based on representative sets. Zbl 1330.68111
Goyal, Prachi; Misra, Neeldhara; Panolan, Fahad; Zehavi, Meirav
6
2015
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
6
2010
Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097
Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav
5
2017
Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\). Zbl 1406.68042
Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.; Saurabh, Saket
4
2013
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. Zbl 1417.05082
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket
4
2013
Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. Zbl 1276.05091
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
4
2013
The parameterized complexity of happy colorings. Zbl 1454.68113
Misra, Neeldhara; Reddy, I. Vinod
3
2018
Solving \(d\)-SAT via backdoors to small treewidth. Zbl 1372.68122
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Ramanujan, M. S.; Saurabh, Saket
3
2015
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2014
Faster deterministic algorithms for \(r\)-dimensional matching using representative sets. Zbl 1359.68342
Goyal, Prachi; Misra, Neeldhara; Panolan, Fahad
3
2013
The effect of girth on the kernelization complexity of connected dominating set. Zbl 1245.68094
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2010
The budgeted unique coverage problem and color-coding (extended abstract). Zbl 1248.68257
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
3
2009
On structural parameterizations of graph motif and chromatic number. Zbl 06702481
Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod
2
2017
Two Dots is NP-complete. Zbl 1369.68218
Misra, Neeldhara
2
2016
Unique covering problems with geometric sets. Zbl 1391.68103
Ashok, Pradeesha; Kolay, Sudeshna; Misra, Neeldhara; Saurabh, Saket
2
2015
Solving min ones 2-SAT as fast as vertex cover. Zbl 1301.68163
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri
2
2013
Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? Zbl 1400.68160
Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket
2
2013
Imbalance is fixed parameter tractable. Zbl 1286.68241
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
2
2010
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Zbl 1427.91119
Dey, Palash; Misra, Neeldhara; Narahari, Y.
1
2019
On the complexity of two dots for narrow boards and few colors. Zbl 07229751
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Misra, Neeldhara
1
2018
Complexity of manipulation with partial information in voting. Zbl 1394.91117
Dey, Palash; Misra, Neeldhara; Narahari, Y.
1
2018
On the complexity of Chamberlin-Courant on almost structured profiles. Zbl 1398.91235
Misra, Neeldhara; Sonar, Chinmay; Vaidyanathan, P. R.
1
2017
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
An Erdős-Ko-Rado theorem for matchings in the complete graph. Zbl 1291.05159
Kamat, Vikram; Misra, Neeldhara
1
2013
Imbalance is fixed parameter tractable. Zbl 1284.68471
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
1
2013
On the parameterized complexity of the maximum edge 2-coloring problem. Zbl 1398.68239
Goyal, Prachi; Kamat, Vikram; Misra, Neeldhara
1
2013
Hitting and piercing rectangles induced by a point set. Zbl 1381.68303
Rajgopal, Ninad; Ashok, Pradeesha; Govindarajan, Sathish; Khopkar, Abhijit; Misra, Neeldhara
1
2013
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
On the rapidity of convergence of Hermite-Fejer interpolation based on the roots of Legendre polynomial. Zbl 0522.41002
Misra, N.
1
1982
On the rate of convergence of Hermite-Fejer interpolation polynomials. Zbl 0508.41001
Misra, N.
1
1982
On the convergence of Hermite-Fejer and Hermite-Fejer type processes. Zbl 0488.41002
Misra, N.
1
1981
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Zbl 1427.91119
Dey, Palash; Misra, Neeldhara; Narahari, Y.
1
2019
The parameterized complexity of happy colorings. Zbl 1454.68113
Misra, Neeldhara; Reddy, I. Vinod
3
2018
On the complexity of two dots for narrow boards and few colors. Zbl 07229751
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Misra, Neeldhara
1
2018
Complexity of manipulation with partial information in voting. Zbl 1394.91117
Dey, Palash; Misra, Neeldhara; Narahari, Y.
1
2018
Frugal bribery in voting. Zbl 1371.91050
Dey, Palash; Misra, Neeldhara; Narahari, Y.
6
2017
Backdoors into heterogeneous classes of SAT and CSP. Zbl 1356.68097
Gaspers, Serge; Misra, Neeldhara; Ordyniak, Sebastian; Szeider, Stefan; Živný, Stanislav
5
2017
On structural parameterizations of graph motif and chromatic number. Zbl 06702481
Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod
2
2017
On the complexity of Chamberlin-Courant on almost structured profiles. Zbl 1398.91235
Misra, Neeldhara; Sonar, Chinmay; Vaidyanathan, P. R.
1
2017
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
9
2016
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Zbl 1334.91035
Dey, Palash; Misra, Neeldhara; Narahari, Y.
7
2016
Two Dots is NP-complete. Zbl 1369.68218
Misra, Neeldhara
2
2016
Deterministic algorithms for matching and packing problems based on representative sets. Zbl 1330.68111
Goyal, Prachi; Misra, Neeldhara; Panolan, Fahad; Zehavi, Meirav
6
2015
Solving \(d\)-SAT via backdoors to small treewidth. Zbl 1372.68122
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Ramanujan, M. S.; Saurabh, Saket
3
2015
Unique covering problems with geometric sets. Zbl 1391.68103
Ashok, Pradeesha; Kolay, Sudeshna; Misra, Neeldhara; Saurabh, Saket
2
2015
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2014
On the hardness of eliminating small induced subgraphs by contracting edges. Zbl 1406.68034
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
8
2013
The parameterized complexity of unique coverage and its variants. Zbl 1290.68059
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
8
2013
Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\). Zbl 1406.68042
Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.; Saurabh, Saket
4
2013
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. Zbl 1417.05082
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket
4
2013
Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. Zbl 1276.05091
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
4
2013
Faster deterministic algorithms for \(r\)-dimensional matching using representative sets. Zbl 1359.68342
Goyal, Prachi; Misra, Neeldhara; Panolan, Fahad
3
2013
Solving min ones 2-SAT as fast as vertex cover. Zbl 1301.68163
Misra, Neeldhara; Narayanaswamy, N. S.; Raman, Venkatesh; Shankar, Bal Sri
2
2013
Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? Zbl 1400.68160
Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket
2
2013
An Erdős-Ko-Rado theorem for matchings in the complete graph. Zbl 1291.05159
Kamat, Vikram; Misra, Neeldhara
1
2013
Imbalance is fixed parameter tractable. Zbl 1284.68471
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
1
2013
On the parameterized complexity of the maximum edge 2-coloring problem. Zbl 1398.68239
Goyal, Prachi; Kamat, Vikram; Misra, Neeldhara
1
2013
Hitting and piercing rectangles induced by a point set. Zbl 1381.68303
Rajgopal, Ninad; Ashok, Pradeesha; Govindarajan, Sathish; Khopkar, Abhijit; Misra, Neeldhara
1
2013
Kernelization – preprocessing with a guarantee. Zbl 1358.68141
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
27
2012
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
13
2012
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
12
2012
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
19
2011
Lower bounds on kernelization. Zbl 1248.90078
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket
12
2011
Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215
Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
10
2011
On the kernelization complexity of colorful motifs. Zbl 1309.68143
Ambalath, Abhimanyu M.; Balasundaram, Radheshyam; Rao H., Chintan; Koppula, Venkata; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.
19
2010
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
6
2010
The effect of girth on the kernelization complexity of connected dominating set. Zbl 1245.68094
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
3
2010
Imbalance is fixed parameter tractable. Zbl 1286.68241
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
2
2010
The complexity ecology of parameters: An illustration using bounded max leaf number. Zbl 1184.05123
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket
20
2009
The budgeted unique coverage problem and color-coding (extended abstract). Zbl 1248.68257
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
3
2009
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
36
2008
A necessary and sufficient condition for the solutions of a functional differential equation to be oscillatory or tend to zero. Zbl 0874.34058
Das, Pitambar; Misra, N.
16
1997
On the rapidity of convergence of Hermite-Fejer interpolation based on the roots of Legendre polynomial. Zbl 0522.41002
Misra, N.
1
1982
On the rate of convergence of Hermite-Fejer interpolation polynomials. Zbl 0508.41001
Misra, N.
1
1982
On the convergence of Hermite-Fejer and Hermite-Fejer type processes. Zbl 0488.41002
Misra, N.
1
1981
all top 5

Cited by 358 Authors

32 Saurabh, Saket
19 Jansen, Bart M. P.
18 Misra, Neeldhara
13 Kratsch, Stefan
13 Lokshtanov, Daniel
13 Zehavi, Meirav
9 Ganian, Robert
9 Paulusma, Daniël
9 Pilipczuk, Marcin
8 Fellows, Michael Ralph
8 Philip, Geevarghese
8 Thilikos, Dimitrios M.
7 Cygan, Marek
7 Dey, Palash
7 Johnson, Matthew
7 Niedermeier, Rolf
7 Ordyniak, Sebastian
7 Otachi, Yota
7 Pilipczuk, Michał
7 Ramanujan, M. S.
7 Rath, Radhanath N.
6 Bang-Jensen, Jørgen
6 Eiben, Eduard
6 Hermelin, Danny
6 Raman, Venkatesh
6 Rosamond, Frances A.
6 Shachnai, Hadas
6 Tale, Prafullkumar
5 Dabrowski, Konrad Kazimierz
5 Feghali, Carl
5 Gutin, Gregory Z.
5 Heggernes, Pinar
5 Mnich, Matthias
5 Panolan, Fahad
5 Raymond, Jean-Florent
5 Szeider, Stefan
5 van ’t Hof, Pim
5 Villanger, Yngve
5 Wahlström, Magnus
4 Agrawal, Akanksha
4 Bodlaender, Hans L.
4 Bonamy, Marthe
4 Bredereck, Robert
4 Gaspers, Serge
4 Golovach, Petr A.
4 Guo, Jiong
4 Ito, Takehiro
4 Lampis, Michael
4 Li, Wenjun
4 Narahari, Yadati
4 Pinter, Ron Yair
4 Sau, Ignasi
4 Sikora, Florian
4 Suchý, Ondřej
4 Uhlmann, Johannes
3 Ashok, Pradeesha
3 Betzler, Nadja
3 Cohen, Nathann
3 Feng, Qilong
3 Fertin, Guillaume
3 Fomin, Fedor V.
3 Kanesh, Lawqueen
3 Katsikarelis, Ioannis
3 Knop, Dušan
3 Liedloff, Mathieu
3 Marx, Dániel
3 Merouane, Houcine Boumediene
3 Misra, Niyati
3 Paschos, Vangelis Th.
3 Prałat, Paweł
3 Praveen, M.
3 Sandhya, T. P.
3 Shalu, M. A.
3 Sheng, Bin
3 Sikdar, Somnath
3 Uehara, Ryuhei
3 Uno, Yushi
3 van Bevern, René
3 Yang, Yongjie
3 Yeo, Anders
2 Abu-Khzam, Faisal N.
2 Águeda, Raquel
2 Almanza, Matteo
2 Arumugam, Subramanian
2 Barbero, Florian
2 Belmonte, Rémy
2 Bonnet, Edouard
2 Chandrasekar, K. Raja
2 Chapelle, Mathieu
2 Chatzidimitriou, Dimitris
2 Chellali, Mustapha
2 Chen, Jian-er
2 Dondi, Riccardo
2 Downey, Rodney Graham
2 Fu, Bin
2 Fujita, Shinya
2 Giannopoulou, Archontia C.
2 Govindarajan, Sathish
2 Haddad, Mohammed Al
2 Hartinger, Tatiana Romina
...and 258 more Authors
all top 5

Cited in 50 Serials

45 Theoretical Computer Science
37 Algorithmica
19 Journal of Computer and System Sciences
15 Discrete Applied Mathematics
9 Theory of Computing Systems
8 SIAM Journal on Discrete Mathematics
7 Information Processing Letters
7 Journal of Combinatorial Optimization
4 Mathematica Slovaca
4 Journal of Discrete Algorithms
4 Discrete Mathematics, Algorithms and Applications
3 Artificial Intelligence
3 Journal of Graph Algorithms and Applications
2 Acta Informatica
2 Journal of Mathematical Analysis and Applications
2 International Journal of Mathematics and Mathematical Sciences
2 European Journal of Combinatorics
2 Information and Computation
2 Computers & Operations Research
2 Computational Geometry
2 ACM Transactions on Computation Theory
1 Discrete Mathematics
1 Ukrainian Mathematical Journal
1 Chaos, Solitons and Fractals
1 Journal of Approximation Theory
1 Journal of Computational and Applied Mathematics
1 Journal of Differential Equations
1 Operations Research
1 Rendiconti del Circolo Matemàtico di Palermo. Serie II
1 SIAM Journal on Computing
1 Social Choice and Welfare
1 Graphs and Combinatorics
1 Annals of Operations Research
1 International Journal of Computational Geometry & Applications
1 M\(^3\)AS. Mathematical Models & Methods in Applied Sciences
1 International Journal of Computer Mathematics
1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences
1 Mathematical Programming. Series A. Series B
1 Journal of Algebraic Combinatorics
1 Constraints
1 Abstract and Applied Analysis
1 Journal of Scheduling
1 ZAMM. Zeitschrift für Angewandte Mathematik und Mechanik
1 Analysis (München)
1 Dynamics of Continuous, Discrete & Impulsive Systems. Series B. Applications & Algorithms
1 Discrete Optimization
1 Proyecciones
1 Algorithms
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Computer Science Review

Citations by Year