Ramanujan Sridharan
Tagline:
About Me
I'm an associate professor in the Department of Computer Science at University of Warwick. I'm affiliated with the Theory and Foundations Group, the Centre for Discrete Mathematics and its Applications (DIMAP) and the Warwick Machine Learning Group. I'm the organiser of DIMAP Seminar which regularly hosts talks by leading researchers in Theoretical Computer Science and Discrete Mathematics.
My primary research interests lie in the design of algorithms for NP-hard combinatorial optimization problems, often via the development of new graph theoretic tools in combination with classical optimization techniques. My current research goals include the development of new mathematical models for the analysis of preprocessing algorithms, fixed-parameter and approximation algorithms, streaming algorithms and applications of structural graph theory in the design of faster algorithms for constraint satisfaction.
My research has been supported (as PI) by EPSRC grants PARITY (EP/V007793/1) and MULTIPROCESS (EP/V044621/1) and (as co-I) by Digital twins of robust automation, planning and routing for environmental navigation optimisation and impact - Sir David Attenborough DT project - original record 72777.
I am always looking for excellent PhD students, so if you are interested in working on challenging topics in algorithms, please get in touch with me.
Publications
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
Conference PaperPublisher:41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, JapanDate:2025Authors:Eduard EibenRobert GanianIyad KanjM. S. RamanujanParameterized Algorithms for Multiagent Pathfinding on Trees
Conference PaperPublisher:Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025Date:2025Authors:Argyrios DeligkasEduard EibenRobert GanianIyad KanjM. S. RamanujanPacking Short Cycles
Conference PaperPublisher:Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025Date:2025Authors:Matthias BentertFedor V. FominPetr A. GolovachTuukka KorhonenWilliam LochetFahad PanolanM. S. RamanujanSaket SaurabhKirill SimonovWannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set
Journal ArticlePublisher:ACM Trans. Comput. TheoryDate:2025Authors:Daniel LokshtanovRamanujan Maadapuzhi SridharanSaket SaurabhRoohani SharmaMeirav ZehaviWhen Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
Conference PaperPublisher:41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, JapanDate:2025Authors:Matthias BentertFedor V. FominPetr A. GolovachM. S. RamanujanSaket SaurabhOn the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components
Journal ArticlePublisher:SIAM J. Discret. Math.Date:2024Authors:Rian NeogiM. S. RamanujanSaket SaurabhRoohani SharmaMeta-theorems for Parameterized Streaming Algorithms‡
Conference PaperPublisher:Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024Date:2024Authors:Daniel LokshtanovPranabendu MisraFahad PanolanM. S. RamanujanSaket SaurabhMeirav ZehaviDescription:In this paper, we prove foundational results in the intersection of streaming algorithms and parameterized complexity. We introduce a novel notion of fixed-parameter semi-streaming (FPSS) algorithms that are restricted to run in space O(f(k).n.polylog(n)) and show that several central graph problems in parameterized complexity have FPSS algorithms. This is achieved through a new framework for designing streaming algorithms for classic cut problems (e.g., multiway cut, graph bipartization) and two meta-theorems.
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
Conference PaperPublisher:19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United KingdomDate:2024Authors:Václav BlazejSatyabrata JanaM. S. RamanujanPeter StruloOn Controlling Knockout Tournaments Without Perfect Information
Conference PaperPublisher:19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United KingdomDate:2024Authors:Václav BlazejSushmita GuptaM. S. RamanujanPeter StruloRouting on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
Conference PaperPublisher:Thirteenth International Workshop on Agents in Traffic and Transportation co-located with the the 27th European Conference on Artificial Intelligence (ECAI 2024), Santiago de Compostela, Spain, October 19, 2024Date:2024Authors:Patrick O'HaraRamanujan SridharanTheo Damoulas
Supervisions
- VB
Václav Blažej
Postdoc
date: 2023 - 2025Description:Currently, Postdoc at University of Warsaw, Poland
- LK
Lawqueen Kanesh
Postdoc
date: 2023 - 2023Description:Currently, Assistant Professor at IIT Indore, India
- PS
Peter Strulo
(Ongoing)
date: 2022 - presentDegree: Doctoral Degree .University: University of Warwick .Department: Computer Science .
- SG
Siddharth Gupta
Postdoc
date: 2021 - 2023Description:Currently Assistant Professor at BITS Pilani, India
- PO
Patrick O'Hara
(Ongoing)
date: 2020 - presentDegree: Doctoral Degree .University: University of Warwick .Department: Computer Science .
Description:Co-supervised with Prof. Theo Damoulas.
Selected Talks
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations.
Date: Jun 2025
Event name: SoCG 2025 .Location: Kanazawa, Japan .
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
Date: Jun 2025
Event name: SoCG 2025 .Location: Kanazawa, Japan. .
Parameterized Streaming
Date: Oct 2024
Event name: Dagstuhl Seminar: New tools in Parameterized Complexity: Paths, Cuts, and Decompositions .Location: Dagstuhl .
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.
Date: Jul 2024
Event name: ICALP 2024 .Location: Talinn .
Finding a Highly Connected Steiner Subgraph and its Applications
Date: Aug 2023
Event name: MFCS 2023 .Location: Bordeaux .
Backdoor Sets on Nowhere Dense SAT
Date: Jul 2022
Event name: ICALP 2022 .
Parameterized Algorithms for Network Design
Date: Apr 2021
Event name: 3rd IMA and OR Society Conference on Mathematics of Operational Research .
Professional Service
Programme Committees: FSTTCS 2016, IPEC 2017, IJCAI 2018, ICALP (Track A) 2019, MFCS 2019, FSTTCS 2019, IJCAI 2019, AAAI 2020, ECAI 2020, IPEC 2022, SOSA 2023.
Events
DIMAP Theory Day
From: 2022
Co-organizer
Parameterized Complexity of Computational Reasoning (PCCR) Workshop
From: 2022
Co-organizer
DIMAP Workshop on Advances in Modern Graph Algorithms
From: 2019
Co-organizer
Contact
Address
Room CS2.36
Department of Computer Science,
University of Warwick, CV4 7AL