Items where Author is "Tale, Prafullkumar"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Jump to: Conference or Workshop Item (A Paper)
Number of items: 6.

Conference or Workshop Item (A Paper)

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Parameterized Complexity of Weighted Multicut in Trees.
In: 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022).
Conference: WG International Workshop on Graph-Theoretic Concepts in Computer Science

Galby, Esther and Khazaliya, Liana and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar
(2022) Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
In: MFCS 2022.
Conference: MFCS International Symposium on Mathematical Foundations of Computer Science

Marx, Dániel and Misra, Pranabendu and Neuen, Daniel and Tale, Prafullkumar
(2022) A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
In: UNSPECIFIED.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

Saurabh, Saket and Tale, Prafullkumar
(2020) On the Parameterized Complexity of Maximum Degree Contraction Problem.
In: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)

Gunda, Spoorthy and Jain, Pallavi and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar
(2020) On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference.
Conference: APPROX International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

This list was generated on Thu Nov 21 13:07:32 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.