163 results on '"Philip, Geevarghese"'
Search Results
2. Diverse collections in matroids and graphs
3. $\alpha$-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
4. Diverse Collections in Matroids and Graphs
5. Disjoint Stable Matchings in Linear Time
6. Diverse Pairs of Matchings
7. Structural Parameterizations of Clique Coloring
8. On Computing the Hamiltonian Index of Graphs
9. FPT Algorithms for Diverse Collections of Hitting Sets
10. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
11. Subset Feedback Vertex Set in Chordal and Split Graphs
12. On computing the Hamiltonian index of graphs
13. A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments
14. Structural Parameterizations of Clique Coloring
15. Disjoint Stable Matchings in Linear Time
16. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
17. On Computing the Hamiltonian Index of Graphs
18. Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
19. Finding Even Subgraphs Even Faster
20. Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
21. Disjoint Stable Matchings in Linear Time
22. Point Line Cover: The Easy Kernel is Essentially Tight
23. Beyond Max-Cut: \lambda-Extendible Properties Parameterized Above the Poljak-Turz\'{i}k Bound
24. A single-exponential FPT algorithm for the $K_4$-minor cover problem
25. Dominating Set is Fixed Parameter Tractable in Claw-free Graphs
26. Hitting forbidden minors: Approximation and Kernelization
27. A Quartic Kernel for Pathwidth-One Vertex Deletion
28. FPT Algorithms for Connected Feedback Vertex Set
29. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
30. 2-Approximating Feedback Vertex Set in Tournaments
31. On Computing the Hamiltonian Index of Graphs
32. Diverse collections in matroids and graphs
33. Subset Feedback Vertex Set in Chordal and Split Graphs
34. Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
35. On the parameterized complexity of vertex cover and edge cover with connectivity constraints
36. Hardness of r-dominating set on Graphs of Diameter (r + 1)
37. A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
38. Algorithmic Aspects of Dominator Colorings in Graphs
39. Pattern-Guided Data Anonymization and Clustering
40. The Effect of Homogeneity on the Complexity of k-Anonymity
41. On Parameterized Independent Feedback Vertex Set
42. Ranking and Drawing in Subexponential Time
43. On the Kernelization Complexity of Colorful Motifs
44. The Curse of Connectivity: t-Total Vertex (Edge) Cover
45. FPT Algorithms for Connected Feedback Vertex Set
46. On Parameterized Independent Feedback Vertex Set
47. Using Patterns to Form Homogeneous Teams
48. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
49. On Computing the Hamiltonian Index of Graphs ⋆
50. Dominating set is fixed parameter tractable in claw-free graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.