47 results on '"Philip, Geevarghese"'
Search Results
2. Disjoint Stable Matchings in Linear Time
Catalog
Books, media, physical & digital resources
3. 2-Approximating Feedback Vertex Set in Tournaments
4. On Computing the Hamiltonian Index of Graphs
5. Subset Feedback Vertex Set in Chordal and Split Graphs
6. Diverse collections in matroids and graphs
7. On computing the Hamiltonian index of graphs
8. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
9. On Computing the Hamiltonian Index of Graphs ⋆
10. Structural Parameterizations of Clique Coloring
11. Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
12. 2-Approximating Feedback Vertex Set in Tournaments
13. Hardness of r-dominating set on Graphs of Diameter (r + 1)
14. A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
15. Algorithmic Aspects of Dominator Colorings in Graphs
16. The Effect of Homogeneity on the Complexity of k-Anonymity
17. On Parameterized Independent Feedback Vertex Set
18. Pattern-Guided Data Anonymization and Clustering
19. Ranking and Drawing in Subexponential Time
20. The Curse of Connectivity: t-Total Vertex (Edge) Cover
21. A Quartic Kernel for Pathwidth-One Vertex Deletion
22. FPT Algorithms for Connected Feedback Vertex Set
23. On the Kernelization Complexity of Colorful Motifs
24. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
25. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
26. FPT Algorithms for Diverse Collections of Hitting Sets
27. Subset Feedback Vertex Set in Chordal and Split Graphs
28. Finding even subgraphs even faster
29. Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
30. On the parameterized complexity of b-chromatic number
31. Point Line Cover
32. Hitting Forbidden Minors: Approximation and Kernelization
33. Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
34. On the parameterized complexity of vertex cover and edge cover with connectivity constraints
35. A single-exponential FPT algorithm for the K4-minor cover problem
36. Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound
37. Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems
38. Point Line Cover: The Easy Kernel is Essentially Tight
39. Using Patterns to Form Homogeneous Teams
40. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
41. Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles
42. Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
43. On Parameterized Independent Feedback Vertex Set
44. The effect of homogeneity on the computational complexity of combinatorial data anonymization
45. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
46. Dominating set is fixed parameter tractable in claw-free graphs
47. FPT algorithms for Connected Feedback Vertex Set
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.