×

Philip, Geevarghese

Author ID: philip.geevarghese Recent zbMATH articles by "Philip, Geevarghese"
Published as: Philip, Geevarghese
External Links: MGP
Documents Indexed: 52 Publications since 2009
Co-Authors: 53 Co-Authors with 52 Joint Publications
1,361 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

46 Publications have been cited 360 times in 304 Documents Cited by Year
Polynomial kernels for Dominating Set in graphs of bounded degeneracy and beyond. Zbl 1301.68164
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
23
2012
Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215
Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
23
2011
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
23
2011
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
23
2012
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.
22
2010
Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. Zbl 1256.68084
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
20
2009
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
20
2012
Raising the bar for Vertex Cover: fixed-parameter tractability above a higher guarantee. Zbl 1398.68234
Garg, Shivam; Philip, Geevarghese
18
2016
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
17
2016
Dominating set is fixed parameter tractable in claw-free graphs. Zbl 1228.68030
Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry
14
2011
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
13
2010
Point line cover: the easy kernel is essentially tight. Zbl 1423.68547
Kratsch, Stefan; Philip, Geevarghese; Ray, Saurabh
11
2016
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
11
2013
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
8
2010
Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1359.68125
Crowston, Robert; Jones, Mark; Muciaccia, Gabriele; Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
8
2013
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1384.05148
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
7
2018
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1400.05242
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
7
2015
Finding even subgraphs even faster. Zbl 1404.68050
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
6
2018
Subset feedback vertex set in chordal and split graphs. Zbl 1429.68197
Philip, Geevarghese; Rajan, Varun; Saurabh, Saket; Tale, Prafullkumar
6
2019
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1312.68105
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
5
2014
B-chromatic number: beyond NP-hardness. Zbl 1378.68090
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
5
2015
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
5
2014
Point line cover: the easy kernel is essentially tight. Zbl 1423.68548
Kratsch, Stefan; Philip, Geevarghese; Ray, Saurabh
5
2014
The curse of connectivity: \(t\)-total vertex (edge) cover. Zbl 1286.68228
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket
5
2010
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Zbl 1281.68120
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
5
2014
Pattern-guided data anonymization and clustering. Zbl 1343.68105
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2011
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. Zbl 07482897
Baste, Julien; Fellows, Michael R.; Jaffke, Lars; Masařík, Tomáš; de Oliveira Oliveira, Mateus; Philip, Geevarghese; Rosamond, Frances A.
4
2022
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
Ranking and drawing in subexponential time. Zbl 1326.68157
Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket
4
2011
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Zbl 1315.68150
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket
3
2015
2-approximating feedback vertex set in tournaments. Zbl 07304084
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2020
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
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1310.68106
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
3
2015
On the parameterized complexity of b-chromatic number. Zbl 1353.68136
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2017
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1354.68130
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
3
2012
Finding even subgraphs even faster. Zbl 1366.68093
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2015
A single-exponential FPT algorithm for the \(K_4\)-minor cover problem. Zbl 1357.68289
Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese
2
2015
Using patterns to form homogeneous teams. Zbl 1322.90074
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
2
2015
Diverse pairs of matchings. Zbl 07765384
Fomin, Fedor V.; Golovach, Petr A.; Jaffke, Lars; Philip, Geevarghese; Sagunov, Danil
2
2020
The effect of homogeneity on the complexity of \(k\)-anonymity. Zbl 1342.68154
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
1
2011
Structural parameterizations of clique coloring. Zbl 1518.68269
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese
1
2020
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1246.68130
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
1
2011
Disjoint stable matchings in linear time. Zbl 07538569
Ganesh, Aadityan; Vishwa Prakash, H. V.; Nimbhorkar, Prajakta; Philip, Geevarghese
1
2021
On computing the Hamiltonian index of graphs. Zbl 07603933
Philip, Geevarghese; Rani, M. R.; Subashini, R.
1
2020
2-approximating feedback vertex set in tournaments. Zbl 07475090
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
1
2021
Vertex exponential algorithms for connected \(f\)-factors. Zbl 1360.68517
Philip, Geevarghese; Ramanujan, M. S.
1
2014
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. Zbl 07482897
Baste, Julien; Fellows, Michael R.; Jaffke, Lars; Masařík, Tomáš; de Oliveira Oliveira, Mateus; Philip, Geevarghese; Rosamond, Frances A.
4
2022
Disjoint stable matchings in linear time. Zbl 07538569
Ganesh, Aadityan; Vishwa Prakash, H. V.; Nimbhorkar, Prajakta; Philip, Geevarghese
1
2021
2-approximating feedback vertex set in tournaments. Zbl 07475090
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
1
2021
2-approximating feedback vertex set in tournaments. Zbl 07304084
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2020
Diverse pairs of matchings. Zbl 07765384
Fomin, Fedor V.; Golovach, Petr A.; Jaffke, Lars; Philip, Geevarghese; Sagunov, Danil
2
2020
Structural parameterizations of clique coloring. Zbl 1518.68269
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese
1
2020
On computing the Hamiltonian index of graphs. Zbl 07603933
Philip, Geevarghese; Rani, M. R.; Subashini, R.
1
2020
Subset feedback vertex set in chordal and split graphs. Zbl 1429.68197
Philip, Geevarghese; Rajan, Varun; Saurabh, Saket; Tale, Prafullkumar
6
2019
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1384.05148
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
7
2018
Finding even subgraphs even faster. Zbl 1404.68050
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
6
2018
On the parameterized complexity of b-chromatic number. Zbl 1353.68136
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2017
Raising the bar for Vertex Cover: fixed-parameter tractability above a higher guarantee. Zbl 1398.68234
Garg, Shivam; Philip, Geevarghese
18
2016
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
17
2016
Point line cover: the easy kernel is essentially tight. Zbl 1423.68547
Kratsch, Stefan; Philip, Geevarghese; Ray, Saurabh
11
2016
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1400.05242
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
7
2015
B-chromatic number: beyond NP-hardness. Zbl 1378.68090
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
5
2015
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Zbl 1315.68150
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket
3
2015
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1310.68106
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
3
2015
Finding even subgraphs even faster. Zbl 1366.68093
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
3
2015
A single-exponential FPT algorithm for the \(K_4\)-minor cover problem. Zbl 1357.68289
Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese
2
2015
Using patterns to form homogeneous teams. Zbl 1322.90074
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
2
2015
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1312.68105
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
5
2014
The kernelization complexity of connected domination in graphs with (no) small cycles. Zbl 1318.68096
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
5
2014
Point line cover: the easy kernel is essentially tight. Zbl 1423.68548
Kratsch, Stefan; Philip, Geevarghese; Ray, Saurabh
5
2014
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Zbl 1281.68120
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
5
2014
Vertex exponential algorithms for connected \(f\)-factors. Zbl 1360.68517
Philip, Geevarghese; Ramanujan, M. S.
1
2014
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
11
2013
Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1359.68125
Crowston, Robert; Jones, Mark; Muciaccia, Gabriele; Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
8
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
Polynomial kernels for Dominating Set in graphs of bounded degeneracy and beyond. Zbl 1301.68164
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
23
2012
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
23
2012
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
20
2012
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1354.68130
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
3
2012
Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215
Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
23
2011
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
23
2011
Dominating set is fixed parameter tractable in claw-free graphs. Zbl 1228.68030
Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry
14
2011
Pattern-guided data anonymization and clustering. Zbl 1343.68105
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
4
2011
Ranking and drawing in subexponential time. Zbl 1326.68157
Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket
4
2011
The effect of homogeneity on the complexity of \(k\)-anonymity. Zbl 1342.68154
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese
1
2011
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1246.68130
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
1
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.
22
2010
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
13
2010
FPT algorithms for connected feedback vertex set. Zbl 1274.68674
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
8
2010
The curse of connectivity: \(t\)-total vertex (edge) cover. Zbl 1286.68228
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket
5
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
Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. Zbl 1256.68084
Philip, Geevarghese; Raman, Venkatesh; Sikdar, Somnath
20
2009
all top 5

Cited by 391 Authors

48 Saurabh, Saket
20 Panolan, Fahad
19 Philip, Geevarghese
18 Lokshtanov, Daniel
17 Fomin, Fedor V.
17 Jansen, Bart M. P.
15 Raman, Venkatesh
13 Zehavi, Meirav
11 Niedermeier, Rolf
11 Paulusma, Daniël
11 Pilipczuk, Marcin L.
11 Sau, Ignasi
10 Golovach, Petr A.
10 Pilipczuk, Michał
10 Thilikos, Dimitrios M.
9 Cygan, Marek
9 Johnson, Matthew
9 Nichterlein, André
9 Ramanujan, M. S.
8 Dabrowski, Konrad Kazimierz
8 Komusiewicz, Christian
8 Misra, Neeldhara
8 Rai, Ashutosh
7 Kratsch, Stefan
7 Sikora, Florian
6 Feghali, Carl
6 Gutin, Gregory Z.
6 Kolay, Sudeshna
6 Misra, Pranabendu
6 Pieterse, Astrid
6 Raymond, Jean-Florent
6 Tale, Prafullkumar
6 van ’t Hof, Pim
5 Bonamy, Marthe
5 Bredereck, Robert
5 Eiben, Eduard
5 Feng, Qilong
5 Heggernes, Pinar
5 Hermelin, Danny
5 Kanesh, Lawqueen
5 Koana, Tomohiro
5 Mnich, Matthias
5 Paul, Christophe
5 Pinter, Ron Yair
5 Shalu, M. A.
5 Sommer, Frank
5 Suchý, Ondřej
5 Villanger, Yngve
5 Wang, Jianxin
5 Wojtaszczyk, Jakub Onufry
5 Xiao, Mingyu
4 Bang-Jensen, Jørgen
4 Bonnet, Edouard
4 Dell, Holger
4 Jain, Pallavi
4 Jiang, Minghui
4 Katsikarelis, Ioannis
4 Lampis, Michael
4 Li, Wenjun
4 Majumdar, Diptapriyo
4 Mouawad, Amer E.
4 Otachi, Yota
4 Pandey, Arti
4 Sagunov, Danil
4 Shachnai, Hadas
4 Simonov, Kirill
4 van Bevern, René
3 Agrawal, Akanksha
3 Aprile, Manuel
3 Ashok, Pradeesha
3 Bai, Tian
3 Banik, Aritra
3 Biswas, Arindam
3 Bougeret, Marin
3 Chen, Jian-er
3 Crowston, Robert
3 Das, Sayani
3 Dondi, Riccardo
3 Drescher, Matthew
3 Fernau, Henning
3 Fertin, Guillaume
3 Fiorini, Samuel
3 Froese, Vincent
3 Fu, Bin
3 Fujito, Toshihiro
3 Ghosh, Arijit
3 Hanaka, Tesshu
3 Hols, Eva-Maria C.
3 Huynh, Tony
3 Ito, Takehiro
3 Jaffke, Lars
3 Kheddouci, Hamamache
3 Kim, Eun Jung
3 Kim, Eunjung
3 Kobayashi, Yasuaki
3 Krithika, R.
3 Kwon, O. joung
3 Lima, Paloma T.
3 Merouane, Houcine Boumediene
3 Mishra, Sounaka
...and 291 more Authors

Citations by Year