| Publication | Date of Publication | Type |
|---|
Romeo and Juliet meeting in forest like regions
Algorithmica | 2024-10-24 | Paper |
| Romeo and Juliet meeting in forest like regions | 2024-09-12 | Paper |
| Metric dimension parameterized by feedback vertex set and other structural parameters | 2024-08-06 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
| A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs | 2024-07-19 | Paper |
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Algorithmica | 2024-04-24 | Paper |
| On the Parameterized Complexity of Maximum Degree Contraction Problem. | 2023-11-13 | Paper |
| On the Parameterized Complexity Of Grid Contraction | 2023-11-02 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2023-10-31 | Paper |
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
SIAM Journal on Discrete Mathematics | 2023-10-13 | Paper |
Parameterized complexity of multicut in weighted trees
Theoretical Computer Science | 2023-10-12 | Paper |
Reducing the vertex cover number via edge contractions
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Parameterized complexity of weighted multicut in trees
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
The complexity of contracting bipartite graphs into small cycles
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
A single exponential-time FPT algorithm for cactus contraction
Theoretical Computer Science | 2023-04-12 | Paper |
Parameterized complexity of maximum edge colorable subgraph
Algorithmica | 2022-10-06 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
On the parameterized complexity of grid contraction
Journal of Computer and System Sciences | 2022-06-13 | Paper |
On the parameterized approximability of contraction to classes of chordal graphs
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
On the parameterized complexity of maximum degree contraction problem
Algorithmica | 2022-03-25 | Paper |
Sparsification lower bound for linear spanners in directed graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Parameterized complexity of \textsc{maximum edge colorable subgraph}
(available as arXiv preprint) | 2021-04-21 | Paper |
Parameterized and exact algorithms for class domination coloring
Discrete Applied Mathematics | 2021-03-25 | Paper |
Paths to trees and cacti
Theoretical Computer Science | 2021-03-09 | Paper |
Path contraction faster than \(2^n\)
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
On the parameterized complexity of contraction to generalization of trees
(available as arXiv preprint) | 2020-05-27 | Paper |
Subset feedback vertex set in chordal and split graphs
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Subset feedback vertex set in chordal and split graphs
Algorithmica | 2019-08-20 | Paper |
On the parameterized complexity of contraction to generalization of trees
Theory of Computing Systems | 2019-06-27 | Paper |
Harmonious coloring: parameterized algorithms and upper bounds
Theoretical Computer Science | 2019-05-17 | Paper |
| An FPT algorithm for contraction to cactus | 2018-10-04 | Paper |
Dynamic parameterized problems
Algorithmica | 2018-07-26 | Paper |
| Lossy kernels for graph contraction problems | 2018-04-19 | Paper |
| Dynamic Parameterized Problems | 2018-04-10 | Paper |
Paths to trees and cacti
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Exact and parameterized algorithms for \((k,i)\)-coloring
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Parameterized and exact algorithms for class domination coloring
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Harmonious coloring: parameterized algorithms and upper bounds
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
