Prafullkumar Tale

Assistant Professor January 2024 – Present
@ Electrical Engineering and Computer Science
Indian Institute of Science Education and Research, Bhopal, India
INSPIRE Faculty Fellow September 2022 – December 2023
@ Department of Mathematics
Indian Institute of Science Education and Research, Pune, India
Post-Doctoral Fellow July 2020 – August 2022
@ CISPA Helmholtz Center for Information Security, Saarbrucken, Germany
Post-Doctoral Fellow March 2020 – June 2020
@ Max-Planck Institute for Informatics, Saarbrucken, Germany
Researcher Jan 2019 – June 2019
@ University Of Bergen, Bergen, Norway
Software Engineer June 2012 – July 2013
@ Ebay/PayPal Pvt Ltd.

Ph.D. in Theoretical Computer Sciences Aug 2015 -- Feb 2020
@ The Institute of Mathematical Sciences ( IMSc ), HBNI, Chennai
Master of Science in Theoretical Computer Sciences Aug 2013 -- Aug 2015
@ The Institute of Mathematical Sciences ( IMSc ), HBNI, Chennai
Master of Science in Applied Mathematics (Five-year Integrated Degree Program) July 2007 -- May 2012
@ Indian Institute of Technology ( IIT ), Roorkee

SIAM Journal on Discrete Mathematics (SIDMA) (2022)
Algorithmica (2024)×2, (2023)x2, (2022), (2018)
Journal of Computer and System Sciences (JCSS) (2021), (2021), (2020), (2020)
Theoretical Computer Science (TCS) (2023)x2, (2022), (2021), (2019), (2019)
Discrete Mathematics & Theoretical Computer Science (DMTCS) (2024), (2021)
Information and Computation (2024)
Discrete Applied Mathematics (DAM) (2021)

ACM-SIAM Symposium on Discrete Algorithms (SODA) (2023)
International Colloquium on Automata, Languages, and Programming (ICALP) (2023), (2020)
European Symposium on Algorithms (ESA) (2023), (2022)x2, (2020) (2019)
Symposium on Theoretical Aspects of Computer Science (STACS) (2024), (2023), (2020)
Algorithms and Data Structures Symposium (WADS) (2023)
Scandinavian Symposium on Algorithm Theory (SWAT) (2024)
Mathematical Foundations of Computer Science (MFCS) (2024), (2023)
International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
(2024), (2023), (2022)x2, (2021), (2017)
Foundation of Software Technology and Theoretical Computer Science (FSTTCS) (2024), (2023)
International Symposium on Algorithms and Computation (ISAAC) (2024), (2022), (2021), (2020)
International Symposium on Parameterized and Exact Computation (IPEC) (2023), (2018), (2017), (2016)
International Computing and Combinatorics Conference (COCOON) (2020), (2018)
International Symposium on Fundamentals of Computation Theory ( FCT ) (2023)x2

Universite Paris Dauphine, Paris, France July 2024
Universite Orleans, Orleans, France July 2024
Universite Clermont Auvergne, Clermont-Ferrand, France June-July 2024
Universite Clermont Auvergne, Clermont-Ferrand, France Sept 2023
Indian Institute of Science (IISc), Bangalore, India July 2023
National Institute of Science Education and Research (NISER), Bhuvaneshwar, India July 2023
Indraprastha Institute of Information Technology Delhi (IIIT-Delhi), India June 2023
University of Bergen, Bergen, Norway May 2017 – July 2017
University of Bergen, Bergen, Norway Sep 2016 – Nov 2016
Max Planck Institute for Informatics, Saarbrücken, Germany June 2015 – July 2015

Parameterized Approximation Algorithms Workshop (PAAW) 4th July 2022
Title: Parameterized Approximability of Contraction to Classes of Chordal Graphs
Parameterized Complexity 301 31st December 2020
Title: Graph Contraction: Old and New Developments
Parameterized Complexity Seminar 24th November 2020
Title: Parameterized Approximability of Contraction to Classes of Chordal Graphs

Lossy Kernelization in Practice Jan 2019 – June 2019
We posit that carefully crafted lossy reduction rule can yield improved approximation solution in practice. I have implemented (in C++ and CPLEX) different algorithms to solve Dominating Set on sparse graphs for various benchmark instances to support our hypothesis.
The Parameterized Algorithms and Computational Experiments Challenge ( PACE )
Implemented various algorithms to solve the following problems on large graphs: Vertex Cover using C++ (in 2019), Steiner Tree using C++ (in 2018), and Minimum Fill-In using Python (in 2017).
SymPy – Open Source Project March 2011 – May 2012
One of the authors of SymPy, an open source Python library for symbolic mathematics. I have contributed to its development by submitting functions, reviewing pull request, fixing patches.