LOPRE publikasjoner og formidlingsaktiviteter

Publikasjoner

• Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad, Panolan, Saket Saurabh: Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. To appear in ACM Transactions on Algorithms (TALG).
• Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh: A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. To appear in the Proceedings of 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020.
• Daniel Lokshtanov, M.S. Ramanujan, Saket Saurabh, Meirav Zehavi: Paramterized Complexity and Approximability of Directed Odd Cycle Transversal. To appear in the Proceedings of 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020.
• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi: Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. To appear in the Proceedings of 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020.
• Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma: Exact and Approximate Digraph Bandwidth. To appear in the Proceedings of 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019.

Formidling

• lectures on parameterized complexity
• course on algorithms for Big-Data

Workshops

• summer school on Algorithmic Tractability via Sparsifiers (August 09-12, 2019; Leh, Ladakh, India)