Geevarghese Philip

From MaRDI portal
Person:340564

Available identifiers

zbMath Open philip.geevargheseMaRDI QIDQ340564

List of research outcomes

PublicationDate of PublicationType
Diverse collections in matroids and graphs2024-02-21Paper
https://portal.mardi4nfdi.de/entity/Q60654252023-11-14Paper
On computing the Hamiltonian index of graphs2023-04-20Paper
On Computing the Hamiltonian Index of Graphs2022-10-19Paper
https://portal.mardi4nfdi.de/entity/Q50892172022-07-18Paper
Disjoint stable matchings in linear time2022-06-08Paper
Structural parameterizations of clique coloring2022-03-25Paper
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory2022-03-02Paper
2-Approximating Feedback Vertex Set in Tournaments2022-02-16Paper
2-Approximating Feedback Vertex Set in Tournaments2021-02-02Paper
Structural Parameterizations of Clique Coloring2020-05-10Paper
Subset feedback vertex set in chordal and split graphs2020-02-06Paper
Subset feedback vertex set in chordal and split graphs2019-08-20Paper
Point Line Cover: The Easy Kernel is Essentially Tight2019-06-20Paper
Point Line Cover2018-11-05Paper
Finding even subgraphs even faster2018-09-07Paper
Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee2018-07-16Paper
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel2018-04-18Paper
https://portal.mardi4nfdi.de/entity/Q53637912017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q52753852017-07-13Paper
https://portal.mardi4nfdi.de/entity/Q29785022017-04-25Paper
https://portal.mardi4nfdi.de/entity/Q29575172017-01-26Paper
On the parameterized complexity of b-\textsc{chromatic number}2016-11-14Paper
Hitting Forbidden Minors: Approximation and Kernelization2016-03-04Paper
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel2015-09-16Paper
Using patterns to form homogeneous teams2015-05-26Paper
Minimum fill-in of sparse graphs: kernelization and approximation2015-03-02Paper
On the parameterized complexity of vertex cover and edge cover with connectivity constraints2014-12-22Paper
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond2014-12-05Paper
The kernelization complexity of connected domination in graphs with (no) small cycles2014-12-02Paper
A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem2014-09-22Paper
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound2014-06-10Paper
The effect of homogeneity on the computational complexity of combinatorial data anonymization2014-02-19Paper
Hardness of r-dominating set on Graphs of Diameter (r + 1)2013-12-10Paper
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles2013-11-15Paper
FPT algorithms for connected feedback vertex set2012-12-21Paper
On parameterized independent feedback vertex set2012-11-27Paper
https://portal.mardi4nfdi.de/entity/Q29116212012-08-31Paper
https://portal.mardi4nfdi.de/entity/Q29088402012-08-29Paper
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem2012-08-14Paper
https://portal.mardi4nfdi.de/entity/Q31136832012-01-23Paper
Algorithmic Aspects of Dominator Colorings in Graphs2012-01-13Paper
Dominating set is fixed parameter tractable in claw-free graphs2011-12-07Paper
The Effect of Homogeneity on the Complexity of k-Anonymity2011-08-19Paper
On Parameterized Independent Feedback Vertex Set2011-08-17Paper
Pattern-Guided Data Anonymization and Clustering2011-08-17Paper
Ranking and Drawing in Subexponential Time2011-05-19Paper
On the Kernelization Complexity of Colorful Motifs2010-12-07Paper
A Quartic Kernel for Pathwidth-One Vertex Deletion2010-11-16Paper
The Curse of Connectivity: t-Total Vertex (Edge) Cover2010-07-20Paper
FPT Algorithms for Connected Feedback Vertex Set2010-02-09Paper
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels2009-10-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Geevarghese Philip