Prafullkumar Tale

Available identifiers

zbMath Open tale.prafullkumarMaRDI QIDQ722545

List of research outcomes

Publication	Date of Publication	Type
Romeo and Juliet meeting in forest like regions	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	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	2023-10-13	Paper
Parameterized complexity of multicut in weighted trees	2023-10-12	Paper
Reducing the vertex cover number via edge contractions	2023-06-12	Paper
Parameterized complexity of weighted multicut in trees	2023-05-05	Paper
The complexity of contracting bipartite graphs into small cycles	2023-05-05	Paper
A single exponential-time FPT algorithm for cactus contraction	2023-04-12	Paper
Parameterized complexity of maximum edge colorable subgraph	2022-10-06	Paper
Path Contraction Faster Than 2^n	2022-07-21	Paper
On the parameterized complexity of grid contraction	2022-06-13	Paper
On the parameterized approximability of contraction to classes of chordal graphs	2022-03-29	Paper
On the parameterized complexity of maximum degree contraction problem	2022-03-25	Paper
Sparsification lower bound for linear spanners in directed graphs	2021-12-01	Paper
Parameterized complexity of \textsc{maximum edge colorable subgraph}	2021-04-21	Paper
Parameterized and exact algorithms for class domination coloring	2021-03-25	Paper
Paths to trees and cacti	2021-03-09	Paper
Path contraction faster than \(2^n\)	2020-07-30	Paper
On the parameterized complexity of contraction to generalization of trees	2020-05-27	Paper
Subset feedback vertex set in chordal and split graphs	2020-02-06	Paper
Subset feedback vertex set in chordal and split graphs	2019-08-20	Paper
On the parameterized complexity of contraction to generalization of trees	2019-06-27	Paper
Harmonious coloring: parameterized algorithms and upper bounds	2019-05-17	Paper
An FPT algorithm for contraction to cactus	2018-10-04	Paper
Dynamic parameterized problems	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	2017-07-21	Paper
Exact and parameterized algorithms for \((k,i)\)-coloring	2017-04-07	Paper
Parameterized and exact algorithms for class domination coloring	2017-04-04	Paper
Harmonious coloring: parameterized algorithms and upper bounds	2016-12-22	Paper

Research outcomes over time

This page was built for person: Prafullkumar Tale