Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Browse by Warwick Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Official Date | Item Type | Funder | No Grouping
Jump to: 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2015
Number of items: 23.

2022

Eiben, Eduard, Majumdar, Diptapriyo and Ramanujan, M. S. (2022) On the lossy kernelization for connected treedepth deletion set. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 22-24 Jun 2022. Published in: Graph-Theoretic Concepts in Computer Science, 13453 pp. 201-214. ISBN 9783031159138. ISSN 1611-3349. doi:10.1007/978-3-031-15914-5_15

Ramanujan, M. S., Sahu, Abhishek, Saurabh, Saket and Verma, Shaily (2022) An exact algorithm for knot-free vertex deletion. In: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, 22—26 Aug 2022, 241 78:1-78:15. ISBN 9783959772563. ISSN 1868-8969. doi:10.4230/LIPIcs.MFCS.2022.78

Lokshtanov, Daniel, Panolan, Fahad and Ramanujan, M. S. (2022) Backdoor sets on nowhere dense SAT. In: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris, France, 4-8 Jul 2022. Published in: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), 229 91:1-91:20. ISBN 9783959772358. ISSN 1868-8969. doi:10.4230/LIPIcs.ICALP.2022.91

Lokshtanov, Daniel, Panolan, Fahad and Ramanujan, Maadapuzhi Sridharan (2022) Backdoors to nowhere dense SAT. In: 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP), Paris, France ; Virtual, 4-8 Jul 2022. Published in: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), 229 91:1-91:20. ISBN 9783959772358. ISSN 1868-8969. doi:10.4230/LIPIcs.ICALP.2022.91

Agrawal, Akanksha and Ramanujan, Maadapuzhi Sridharan (2022) Distance from triviality 2.0 : hybrid parameterizations. In: Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, 13270 . Springer International Publishing, pp. 3-20. ISBN 9783031066771

Agrawal, Akanksha, Kanesh, Lawqueen, Panolan, Fahad, Ramanujan, M. S. and Saurabh, Saket (2022) A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs. SIAM Journal on Discrete Mathematics, 36 (2). pp. 911-921. doi:10.1137/21m1396824

Fomin, Fedor V., Panolan, Fahad, Ramanujan, Maadapuzhi Sridharan and Saurabh, Saket (2022) On the optimality of pseudo-polynomial algorithms for integer programming. Mathematical Programming Series B . doi:10.1007/s10107-022-01783-x (In Press)

Agrawal, Akanksha, Kanesh, Lawqueen, Lokshtanov, Daniel, Panolan, Fahad, Ramanujan, Maadapuzhi Sridharan, Saurabh, Saket and Zehavi , Meirav (2022) Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent. In: ACM-SIAM Symposium on Discrete Algorithms (SODA22), Virginia, U.S. (virtual conference), 9-12 Jan 2022. Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 1976-2004. ISBN 9781611977073. doi:10.1137/1.9781611977073.79

Lisowski, Grzegorz, Ramanujan, M. S. and Turrini, Paolo (2022) Equilibrium computation for knockout tournaments played by groups. In: 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022), Virtual, 9–13 May 2022. Published in: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022) pp. 807-815. ISBN 9781450392136.

2021

Ganian, Robert, Ordyniak, Sebastian and Ramanujan, Maadapuzhi Sridharan (2021) On structural parameterizations of the edge disjoint paths problem. Algorithmica, 83 (6). pp. 1605-1637. doi:10.1007/s00453-020-00795-3

Bergougnoux, Benjamin, Eiben, Eduard, Ganian, Robert, Ordyniak, Sebastian and Ramanujan, Maadapuzhi Sridharan (2021) Towards a polynomial kernel for directed feedback vertex set. Algorithmica, 83 (5). pp. 1201-1221. doi:10.1007/s00453-020-00777-5

Harrenstein, Paul, Lisowski, Grzegorz, Sridaran, Ramanujan and Turrini, Paolo (2021) A hotelling-downs framework for party nominees. In: 20th International Conference on Autonomous Agents and Multiagent Systems, London (Virtual), 3-7 May 2021. Published in: Proceedings of the 20th International Conference on Multiagent Systems (AAMAS 2021) pp. 593-601. ISBN 9781450383073. ISSN 2523-5699.

Lokshtanov, Daniel, Misra, Pranabendu, Sridharan, Ramanujan, Saurabh, Saket and Zehavi, Meirav (2021) FPT-approximation for FPT problems. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021, Virtual, 10-13 Jan 2021. Published in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN 9781611976465. doi:10.1137/1.9781611976465.14

2020

Gutin, Gregory, Ramanujan, M. S., Reidl, Felix and Wahlström, Magnus (2020) Alternative parameterizations of Metric Dimension. Theoretical Computer Science, 806 . pp. 133-143. doi:10.1016/j.tcs.2019.01.028

Lokshtanov, Daniel, Sridharan, Ramanujan, Saurabh, Saket and Zehavi, Meirav (2020) Parameterized complexity and approximability of directed odd cycle transversal. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, Utah, 5-8 Jan 2020. Published in: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms pp. 2181-2200. doi:10.5555/3381089.3381223

2019

Gutin, Gregory, Ramanujan, M.S., Reidl, Felix and Wahlström, Magnus (2019) Path-contractions, edge deletions and connectivity preservation. Journal of Computer and System Sciences, 101 . pp. 1-20. doi:10.1016/j.jcss.2018.10.001

2018

Lokshtanov, Daniel, Ramanujan, Maadapuzhi Sridharan, Saurabh, Saket and Zehavi, Meirav (2018) Reducing CMSO model checking to highly connected graphs. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, 13 Jul 2018. Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 107 135:1-135:14. ISBN 9783959770767. doi:10.4230/LIPIcs.ICALP.2018.135

Lokshtanov, Daniel, Ramanujan, Maadapuzhi Sridharan and Saket, Saurabh (2018) When recursion is better than iteration : a linear-time algorithm for acyclicity with few error vertices. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, Louisiana, USA. , New Orleans, Louisiana, USA, 7-10 Jan 2018. Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1-18. ISBN 9781611975031. doi:10.1137/1.9781611975031.125

Lokshtanov, Daniel, Ramanujan, Maadapuzhi Sridharan and Saurabh, Saket (2018) Linear time parameterized algorithms for subset feedback vertex set. ACM Transactions on Algorithms, 14 (1). 7. doi:10.1145/3155299

Bang-Jensen, Jørgen, Basavaraju, Manu, Vitting Klinkby, Kristine, Misra, Pranabendu, Ramanujan, Maadapuzhi Sridharan, Saurabh, Saket and Zehvi, Meirav (2018) Parameterized algorithms for survivable network design with uniform demands. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, Louisiana, USA, 7-10 Jan 2018. Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1-13. ISBN 9781611975031. doi:10.1137/1.9781611975031.180

2017

Lokshtanov, Daniel, Panolan, Fahad, Maadapuzhi Sridharan, Ramanujan and Saurabh, Saket (2017) Lossy kernelization. In: STOC 2017, 49th Annual ACM Symposium on the Theory of Computing, Montreal, 19-23 Jun 2017. Published in: STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing 224-237 . ISBN 9781450345286. doi:10.1145/3055399.3055456

2015

Gajarsky, Jakub, Hlineny, Petr , Lokshtanov, Daniel , Obdrálek, Jan, Ordyniak, Sebastian, Ramanujan, Maadapuzhi Sridharan and Saurabh, Saket (2015) FO model checking on posets of bounded width. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, Berkeley, CA, USA, 17-20 Oct 2015. Published in: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) pp. 963-974. ISBN 9781467381918. ISSN 0272-5428. doi:10.1109/FOCS.2015.63

Fomin, Fedor V., Lokshtanov, Daniel, Misra, Neeldhara, Ramanujan, Maadapuzhi Sridharan and Saurabh, Saket (2015) Solving d-SAT via backdoors to small Treewidth. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, San Diego, USA, 4–6 Jan 2015. Published in: Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 630-641. ISBN 9781611973747. doi:10.1137/1.9781611973730.43

This list was generated on Fri Jan 27 09:21:46 2023 GMT.
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us