Theo dõi
Geevarghese Philip
Geevarghese Philip
Faculty Member at Chennai Mathematical Institute
Email được xác minh tại cmi.ac.in - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
J Baste, MR Fellows, L Jaffke, T Masařík, M de Oliveira Oliveira, G Philip, ...
Artificial Intelligence 303, 103644, 2022
672022
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
G Philip, V Raman, S Sikdar
ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012
662012
Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels
G Philip, V Raman, S Sikdar
Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009
59*2009
Point line cover: The easy kernel is essentially tight
S Kratsch, G Philip, S Ray
ACM Transactions On Algorithms (TALG) 12 (3), 1-16, 2016
582016
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
Journal of Combinatorial Optimization 24, 131-146, 2012
582012
On parameterized independent feedback vertex set
N Misra, G Philip, V Raman, S Saurabh
Theoretical Computer Science 461, 65-75, 2012
512012
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
S Garg, G Philip
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
502016
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
arXiv preprint arXiv:1010.1365, 2010
462010
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
SIAM Journal on Discrete Mathematics 30 (1), 383-410, 2016
432016
Algorithmic aspects of dominator colorings in graphs
S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh
Combinatorial Algorithms: 22nd International Workshop, IWOCA 2011, Victoria …, 2011
432011
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao H, V Koppula, N Misra, G Philip, ...
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
422010
Diverse pairs of matchings
FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov
arXiv preprint arXiv:2009.04567, 2020
37*2020
FPT algorithms for diverse collections of hitting sets
J Baste, L Jaffke, T Masařík, G Philip, G Rote
Algorithms 12 (12), 254, 2019
372019
A quartic kernel for pathwidth-one vertex deletion
G Philip, V Raman, Y Villanger
International Workshop on Graph-Theoretic Concepts in Computer Science, 196-207, 2010
312010
Hardness of r-dominating set on Graphs of Diameter (r + 1)
D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
282013
Dominating set is fixed parameter tractable in claw-free graphs
M Cygan, G Philip, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
Theoretical Computer Science 412 (50), 6982-7000, 2011
272011
Ranking and drawing in subexponential time
H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh
International Workshop on Combinatorial Algorithms, 337-348, 2010
252010
Diverse collections in matroids and graphs
FV Fomin, PA Golovach, F Panolan, G Philip, S Saurabh
Mathematical Programming 204 (1), 415-447, 2024
242024
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
International Workshop on Algorithms and Computation, 269-280, 2010
212010
The effect of homogeneity on the computational complexity of combinatorial data anonymization
R Bredereck, A Nichterlein, R Niedermeier, G Philip
Data Mining and Knowledge Discovery 28, 65-91, 2014
202014
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20