I did my PhD from IIT Jodhpur. I was a postdoctoral fellow at IMSc Chennai, ISI Kolkata (with Dr Arijit Ghosh) and Charles University (with Prof Jaroslav Nešetřil).
Research Interests: Parameterized algorithms, Approximation algorithms, Randomised algorithms, Sublinear Algorithms, Online Algorithms, Streaming Algorithms, Combinatorics, Computational Geometry.
Mail: sahlotvibha@gmail.com, vsahlot@cs-uni.koeln.de
Previous (not valid anymore): sahlot@iuuk.mff.cuni.cz , vibhasahlot@imsc.res.in
3-Coloring C_4 or C_3-free Diameter Two Graphs Tereza Klimošová and Vibha Sahlot. Accepted in WADS 2023
Role Colouring Bipartite Graphs Sukanya Pandey, Venkatesh Raman and Vibha Sahlot. (Accepted in Discrete Applied Maths.)
Parameterizing Role Coloring on Forests Sukanya Pandey, Venkatesh Raman, and Vibha Sahlot. Accepted in SOFSEM 2021.
Structural Parameterizations with Modulator Oblivion Ashwin Jacob, Fahad Panolan, Venkatesh Raman, and Vibha Sahlot. Accepted in IPEC 2020.
Deconstructing Parameterized Hardness of Fair Deletion Problems Ashwin Jacob, Venkatesh Raman, and Vibha Sahlot. Accepted in COCOON 2019.
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set Pratibha Choudhary, Pallavi Jain, R Krithika, and Vibha Sahlot. Accepted in CIAC 2019.
Hitting and Covering Partially Akanksha Agarwal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, and Saket Saurabh. Accepted in COCOON 2018.
Geometric Covering Problems Having Conflicts Aritra Banik, Vibha Sahlot and Saket Saurabh, Status: accepted in Computational Geometry Theory and Applications.
Parameterized Complexity of Geometric Covering Problems Having Conflicts Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, and Saket Saurabh, accepted in Algorithmica. The initial version of the paper was presented in WADS 2017.
Fréchet Distance Between a Line and Avatar Point Set Aritra Banik, Fahad Panolan, Venkatesh Raman and Vibha Sahlot, accepted in Algorithmica, DOI 10.1007/s00453-017-0352-y. The initial version of the paper was presented in FSTTCS 2016.
Non-Shortest Path in CGST 2022.
Parameterizing Role Coloring on Forests in SOFSEM 2021.
Structural Parameterizations without Modulator in IPEC 2020.
Structural Parameterizations without Modulator at Recent Trends in Algorithms Workshop, IIT Gandhinagar, February 2020.
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set at CIAC 2019.
Parameterized Complexity of Geometric Covering Problems with Conflicts at WADS 2017.
Semi-discrete Fréchet Distance with Conflicts at FSTTCS 2016.
QMA-complete problems at IIT Kanpur TCS group.
Seminar at IIT Jodhpur on similarity measures and their parameterized complexity in Conflicts.
Randomized Algorithms: Master's in CS, University of Cologne, as a Teaching Assistant under Prof. Dr. Christian Sohler. Teaching Assistant with Dr. Alexander Munteanu (Vertretungsprofessur).
Parameterized Algorithms:Master's in CS and Maths, University of Cologne,
Efficient Algorithms: Bachelor's and Master's in CS and Maths, University of Cologne, as a Teaching Assistant under Prof. Dr. Christian Sohler.
Computational Complexity: 4th-year B.Tech, IIT Jodhpur, as a Teaching Assistant under Dr. Abhishek Mishra.
Beyond NP-Completeness: 4th-year B.Tech, IIT Jodhpur, as a Teaching Assistant under Prof Manindra Agarwal and Venkatesh Raman.
Parameterized Complexity: 3rd year, 4th year B.Tech and PhD, IIT Jodhpur, as a Teaching Assistant under Prof Venkatesh Raman.
Algorithms: 3rd year B.Tech, IIT Jodhpur, as a Teaching Assistant under Prof Venkatesh Raman.
Selected Topics in Algorithms: 4th year B.Tech and PhD, IIT Jodhpur, as a Teaching Assistant under Dr Aritra Banik.
Postdoctoral Fellow at the University of Cologne (November 2022 onwards)
Postdoctoral Fellow at Charles University. (December 2020 to November 2022)
Postdoctoral Fellow at ISI Kolkata. (September 2020 to December 2020)
Postdoctoral Fellow at IMSc, Chennai. (January 2018- July 2020)
Senior Research Fellow at IIT Jodhpur. (July 2014-Jan 2018)
Junior Research Fellow at IIT Jodhpur. (July 2012-2014)
Software Assistant in Tata Consultancy Services. (March-July 2012)
HALG (IGAFIT Highlights of Algorithms 2025) ETH Zurich, Switzerland. June 4-6, 2025
ADFOCS (Algorithmic Foundations of Data Analysis) Saarbrücken, German , 21 - 25 August 2023
HALG (IGAFIT Highlights of Algorithms 2023) Charles University, Prague, Czech Republic. June 2-4, 2023
KAMAK, Bílý Potok, September 11-16, 2022.
Complexity Theory with a Human Face, Third Edition, Prague and Špindlerův Mlýn, 27 June - 1 July, 2022.
Approximation algorithms and Parameterized Complexity, HIM Bonn, October -December 2021.
KAM and IUUK seminar, 12-14 September 2021.
Recent Trends in Algorithms 2020, Workshop on Algorithms at IIT Gandhinagar, February 16-19, 2020.
WOR89KER 2019, Workshop on Kernelization at University of Bergen, June 3-7, 2019.
Rangoli of Algorithms at Chennai Mathematical Institute, Chennai, Dec 11-12, 2016.
NMI Thematic Workshop on Complexity Theory at IIT Gandhinagar, Nov 4-6,2016.
Research visit to the University of Bergen, August 2017 (Hosted by Prof. Saket Saurabh).
TCS Ghandhinagar, Delhi: Awarded as TCS gem in programming.
Secured 98.8 percentile in Gate (All India test for entrance to postgraduate programs) 2012.
Secured Department Rank 1 during my B.Tech
Secured rank under 3000 in CPMT (All India Combined Pre-Medical Test) 2007.
Reading basic books on physics, psychology and neuroscience.
Beginner in painting and sketching.