default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeevarghese Philip
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024)- [j24]Fedor V. Fomin
, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse collections in matroids and graphs. Math. Program. 204(1): 415-447 (2024) - 2023
- [j23]Geevarghese Philip, M. R. Rani, R. Subashini:
On computing the Hamiltonian index of graphs. Theor. Comput. Sci. 940(Part): 149-179 (2023) - 2022
- [j22]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - [j21]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. Algorithmica 84(2): 273-303 (2022) - 2021
- [j20]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [c32]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. STACS 2021: 31:1-31:14 - [c31]Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip:
Disjoint Stable Matchings in Linear Time. WG 2021: 94-105 - [i21]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. CoRR abs/2101.04633 (2021) - [i20]Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale:
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR abs/2106.14169 (2021) - 2020
- [c30]Geevarghese Philip, M. R. Rani, R. Subashini:
On Computing the Hamiltonian Index of Graphs. CSR 2020: 341-353 - [c29]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c28]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125 - [c27]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. ISAAC 2020: 26:1-26:12 - [c26]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. MFCS 2020: 49:1-49:15 - [c25]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [i19]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. CoRR abs/2005.04733 (2020) - [i18]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. CoRR abs/2009.04567 (2020) - [i17]Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV:
Disjoint Stable Matchings in Linear Time. CoRR abs/2011.13248 (2020)
2010 – 2019
- 2019
- [j19]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica 81(9): 3586-3629 (2019) - [j18]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12(12): 254 (2019) - [c24]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC 2019: 365-376 - [i16]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR abs/1901.02209 (2019) - [i15]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - [i14]Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote:
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR abs/1911.05032 (2019) - [i13]Geevarghese Philip, M. R. Rani, R. Subashini:
On Computing the Hamiltonian Index of Graphs. CoRR abs/1912.01990 (2019) - 2018
- [j17]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - [j16]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. 32(2): 882-901 (2018) - [i12]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh:
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1809.08437 (2018) - 2017
- [j15]Fahad Panolan, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. 84: 120-131 (2017) - 2016
- [j14]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - [j13]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms 12(3): 40:1-40:16 (2016) - [c23]Shivam Garg, Geevarghese Philip:
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. SODA 2016: 1152-1166 - 2015
- [j12]Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71(1): 1-20 (2015) - [j11]Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. Algorithmica 71(2): 517-538 (2015) - [j10]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the K4-minor cover problem. J. Comput. Syst. Sci. 81(1): 186-207 (2015) - [j9]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. 565: 1-15 (2015) - [c22]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. FSTTCS 2015: 434-447 - [c21]Fahad Panolan, Geevarghese Philip, Saket Saurabh:
B-Chromatic Number: Beyond NP-Hardness. IPEC 2015: 389-401 - [c20]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) 2015: 517-528 - [i11]Shivam Garg, Geevarghese Philip:
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. CoRR abs/1509.03990 (2015) - 2014
- [j8]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68(2): 504-530 (2014) - [j7]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. 28(1): 65-91 (2014) - [j6]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80(7): 1384-1403 (2014) - [c19]Geevarghese Philip, M. S. Ramanujan:
Vertex Exponential Algorithms for Connected f-Factors. FSTTCS 2014: 61-71 - [c18]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. SODA 2014: 1596-1606 - [i10]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. CoRR abs/1409.4935 (2014) - 2013
- [j5]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory 74(4): 417-424 (2013) - [c17]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2013: 43-54 - [c16]Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - [i9]Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. CoRR abs/1307.2521 (2013) - [i8]Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1310.2928 (2013) - 2012
- [j4]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24(2): 131-146 (2012) - [j3]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms 9(1): 11:1-11:23 (2012) - [j2]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. 461: 65-75 (2012) - [c15]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2012: 412-423 - [c14]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT 2012: 119-130 - [i7]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the $K_4$-minor cover problem. CoRR abs/1204.1417 (2012) - [i6]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1207.5696 (2012) - 2011
- [j1]Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. 412(50): 6982-7000 (2011) - [c13]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. COCOON 2011: 98-109 - [c12]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 - [c11]Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175 - [c10]S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011: 19-30 - [c9]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 - [c8]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200 - 2010
- [c7]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43 - [c6]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS 2010: 96-107 - [c5]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348 - [c4]Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan:
On the Kernelization Complexity of Colorful Motifs. IPEC 2010: 14-25 - [c3]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. WALCOM 2010: 269-280 - [c2]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. WG 2010: 196-207 - [i5]Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
A Quartic Kernel for Pathwidth-One Vertex Deletion. CoRR abs/1009.0806 (2010) - [i4]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. CoRR abs/1010.1365 (2010) - [i3]Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs. CoRR abs/1011.6239 (2010)
2000 – 2009
- 2009
- [c1]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA 2009: 694-705 - [i2]Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs. CoRR abs/0903.4521 (2009) - [i1]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. CoRR abs/0909.3180 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
