Prafullkumar Tale

From MaRDI portal
Person:722545

Available identifiers

zbMath Open tale.prafullkumarMaRDI QIDQ722545

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60896732023-11-13Paper
https://portal.mardi4nfdi.de/entity/Q60592022023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60844142023-10-31Paper
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters2023-10-13Paper
Parameterized complexity of multicut in weighted trees2023-10-12Paper
Reducing the vertex cover number via edge contractions2023-06-12Paper
Parameterized complexity of weighted multicut in trees2023-05-05Paper
The complexity of contracting bipartite graphs into small cycles2023-05-05Paper
A single exponential-time FPT algorithm for cactus contraction2023-04-12Paper
Parameterized complexity of maximum edge colorable subgraph2022-10-06Paper
https://portal.mardi4nfdi.de/entity/Q50911592022-07-21Paper
On the parameterized complexity of grid contraction2022-06-13Paper
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs2022-03-29Paper
On the parameterized complexity of maximum degree contraction problem2022-03-25Paper
Sparsification lower bound for linear spanners in directed graphs2021-12-01Paper
Parameterized complexity of \textsc{maximum edge colorable subgraph}2021-04-21Paper
Parameterized and exact algorithms for class domination coloring2021-03-25Paper
Paths to trees and cacti2021-03-09Paper
Path Contraction Faster than $2^n$2020-07-30Paper
https://portal.mardi4nfdi.de/entity/Q51118602020-05-27Paper
Subset feedback vertex set in chordal and split graphs2020-02-06Paper
Subset feedback vertex set in chordal and split graphs2019-08-20Paper
On the parameterized complexity of contraction to generalization of trees2019-06-27Paper
Harmonious coloring: parameterized algorithms and upper bounds2019-05-17Paper
An FPT algorithm for contraction to cactus2018-10-04Paper
Dynamic parameterized problems2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q46365702018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46344022018-04-10Paper
Paths to Trees and Cacti2017-07-21Paper
Exact and Parameterized Algorithms for (k, i)-Coloring2017-04-07Paper
Parameterized and Exact Algorithms for Class Domination Coloring2017-04-04Paper
Harmonious Coloring: Parameterized Algorithms and Upper Bounds2016-12-22Paper

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: Prafullkumar Tale