On the optimality of pseudo-polynomial algorithms for integer programming von Fomin, Fedor V., Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket

Volltext

Faster Parameterized Algorithms Using Linear Programming von Lokshtanov, Daniel, Narayanaswamy, N. S., Raman, Venkatesh, Ramanujan, M. S., Saurabh, Saket

Volltext

On Structural Parameterizations of the Edge Disjoint Paths Problem von Ganian, Robert, Ordyniak, Sebastian, Ramanujan, M. S.

Volltext

On the Approximate Compressibility of Connected Vertex Cover von Majumdar, Diptapriyo, Ramanujan, M. S., Saurabh, Saket

Volltext

Towards a Polynomial Kernel for Directed Feedback Vertex Set von Bergougnoux, Benjamin, Eiben, Eduard, Ganian, Robert, Ordyniak, Sebastian, Ramanujan, M. S.

Volltext

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts von Ramanujan, M. S., Saurabh, Saket

Volltext

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments von Misra, Pranabendu, Raman, Venkatesh, Ramanujan, M. S., Saurabh, Saket

Volltext

Backdoors for Linear Temporal Logic von Meier, Arne, Ordyniak, Sebastian, Ramanujan, M. S., Schindler, Irena

Volltext

Metric Dimension of Bounded Tree-length Graphs von Belmonte, Rémy, Fomin, Fedor V., Golovach, Petr A., Ramanujan, M. S.

Volltext

On the Complexity Landscape of Connected f-Factor Problems von Ganian, R., Narayanaswamy, N. S., Ordyniak, S., Rahul, C. S., Ramanujan, M. S.

Volltext

Reconfiguration on sparse graphs von Lokshtanov, Daniel, Mouawad, Amer E., Panolan, Fahad, Ramanujan, M.S., Saurabh, Saket

Volltext

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets von Eiben, Eduard, Hermelin, Danny, Ramanujan, M.S.

Volltext

Alternative parameterizations of Metric Dimension von Gutin, Gregory, Ramanujan, M.S., Reidl, Felix, Wahlström, Magnus

Volltext

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting von Ganian, Robert, Ramanujan, M. S., Szeider, Stefan

Volltext

A characterization of König-Egerváry graphs with extendable vertex covers von Raman, Venkatesh, Ramanujan, M.S., Saurabh, Saket

Volltext

Linear representation of transversal matroids and gammoids parameterized by rank von Misra, Pranabendu, Panolan, Fahad, Ramanujan, M.S., Saurabh, Saket

Volltext

Faster Graph bipartization von Kolay, Sudeshna, Misra, Pranabendu, Ramanujan, M.S., Saurabh, Saket

Volltext

On the kernelization complexity of string problems von Basavaraju, Manu, Panolan, Fahad, Rai, Ashutosh, Ramanujan, M.S., Saurabh, Saket

Volltext

Path-contractions, edge deletions and connectivity preservation von Gutin, Gregory, Ramanujan, M.S., Reidl, Felix, Wahlström, Magnus

Volltext

Faster exact algorithms for some terminal set problems von Chitnis, Rajesh, Fomin, Fedor V., Lokshtanov, Daniel, Misra, Pranabendu, Ramanujan, M.S., Saurabh, Saket

Volltext