Geevarghese Philip

Navedeno

	Vse	Od leta 2018
Navedbe	909	482
indeks h	19	12
indeks i10	30	18

140

105

2009201020112012201320142015201620172018201920202021202220238 13 30 48 61 43 65 53 81 61 74 85 75 124 57

Javni dostop

Prikaži vse

20 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Neeldhara MisraIndian Institute of Technology, GandhinagarPreverjeni e-poštni naslov na iitgn.ac.in
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Fahad PanolanIndian Institute of Technology HyderabadPreverjeni e-poštni naslov na iith.ac.in
Lars JaffkeUniversity of Bergen, NorwayPreverjeni e-poštni naslov na uib.no
Ramanujan M. S.University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
Robert BredereckTU ClausthalPreverjeni e-poštni naslov na tu-clausthal.de
André NichterleinTU BerlinPreverjeni e-poštni naslov na tu-berlin.de
Rolf NiedermeierTU BerlinPreverjeni e-poštni naslov na tu-berlin.de
Henning FernauProfessor für Informatik, Universität TrierPreverjeni e-poštni naslov na uni-trier.de
Matthias MnichTU HamburgPreverjeni e-poštni naslov na tuhh.de
Pranabendu MisraAssistant Professor at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Tomáš MasaříkUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Frances rosamondUniversity of Bergen, NorwayPreverjeni e-poštni naslov na uib.no
Mateus de Oliveira OliveiraStockholm UniversityPreverjeni e-poštni naslov na uib.no
Michael FellowsProfessor of Informatics, University of BergenPreverjeni e-poštni naslov na uib.no
Ashutosh RaiDepartment of Mathematics, IIT DelhiPreverjeni e-poštni naslov na maths.iitd.ac.in
Petr GolovachUniversity of BergenPreverjeni e-poštni naslov na ii.uib.no
Yngve VillangerUniversity of BergenPreverjeni e-poštni naslov na uib.no

Spremljaj

Geevarghese Philip

Faculty Member at Chennai Mathematical Institute

Preverjeni e-poštni naslov na cmi.ac.in - Domača stran

Parameterized Complexity Algorithms Data Structures


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	57	2012
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	56*	2009
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	49	2012
Hitting forbidden minors: Approximation and kernelization FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh arXiv preprint arXiv:1010.1365, 2010	46	2010
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	45	2016
On parameterized independent feedback vertex set N Misra, G Philip, V Raman, S Saurabh Theoretical Computer Science 461, 65-75, 2012	43	2012
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	42	2010
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	40	2016
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	36	2022
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	36	2011
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	31	2016
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	26	2011
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	25	2013
A quartic kernel for pathwidth-one vertex deletion G Philip, V Raman, Y Villanger Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010	25	2010
Ranking and Drawing in Subexponential Time. H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh IWOCA 10, 337-348, 2010	24	2010
Diverse pairs of matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov arXiv preprint arXiv:2009.04567, 2020	21	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	20	2019
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	19	2014
FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010 …, 2010	19	2010
Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018	18	2018

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji