M. S. Ramanujan | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/m.-s.-ramanujan/M. S. RamanujanHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngM. S. Ramanujanhttps://ac.tuwien.ac.at/team/m.-s.-ramanujan/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Routing few robots in a crowded networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robotshttps://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Parameterized Algorithms for Multiagent Pathfinding on Treeshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Routing Few Robots in a Crowded Networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/On Structural Parameterizations of the Edge Disjoint Paths Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/Towards a Polynomial Kernel for Directed Feedback Vertex Sethttps://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/On the Complexity Landscape of Connected f-Factor Problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/A Linear-Time Parameterized Algorithm for Node Unique Label Coverhttps://ac.tuwien.ac.at/publication/a-linear-time-parameterized-algorithm-for-node-unique-label-cover/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-linear-time-parameterized-algorithm-for-node-unique-label-cover/Backdoor Treewidth for SAThttps://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/Backdoor Treewidth for SAThttps://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/Combining Treewidth and Backdoors for CSPhttps://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/Discovering Archipelagos of Tractability for Constraint Satisfaction and Countinghttps://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/Faster exact algorithms for some terminal set problemshttps://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems-2/Going Beyond Primal Treewidth for (M)ILPhttps://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/Hitting (Selected) Odd Cycleshttps://ac.tuwien.ac.at/publication/hitting-selected-odd-cycles/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/hitting-selected-odd-cycles/Linear Representation of Transversal Matroids and Gammoids parameterized by rankhttps://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Linear-Time Parameterized Algorithms via Skew-Symmetric Multicutshttps://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts-2/Lossy kernelizationhttps://ac.tuwien.ac.at/publication/lossy-kernelization/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernelization/Metric Dimension of Bounded Tree-length Graphshttps://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/Parameterized Complexity of Directed Steiner Tree on Sparse Graphshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs-2/Path-Contractions, Edge Deletions and Connectivity Preservationhttps://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/rigging-nearly-acyclic-tournaments-is-fixed-parameter-tractable/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/rigging-nearly-acyclic-tournaments-is-fixed-parameter-tractable/Saving Critical Nodes with Firefighters is FPThttps://ac.tuwien.ac.at/publication/saving-critical-nodes-with-firefighters-is-fpt/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/saving-critical-nodes-with-firefighters-is-fpt/Towards a Polynomial Kernel for Directed Feedback Vertex Sethttps://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/A Faster Parameterized Algorithm for Group Feedback Edge Sethttps://ac.tuwien.ac.at/publication/a-faster-parameterized-algorithm-for-group-feedback-edge-set/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-parameterized-algorithm-for-group-feedback-edge-set/A New Perspective on FO Model Checking of Dense Graph Classeshttps://ac.tuwien.ac.at/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/A Parameterized Algorithm for Mixed-Cuthttps://ac.tuwien.ac.at/publication/a-parameterized-algorithm-for-mixed-cut/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-algorithm-for-mixed-cut/Backdoors to q-Hornhttps://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/Discovering Archipelagos of Tractability for Constraint Satisfaction and Countinghttps://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/Partially Polynomial Kernels for Set Cover and Test Coverhttps://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover-2/Strong Parameterized Deletion: Bipartite Graphshttps://ac.tuwien.ac.at/publication/strong-parameterized-deletion-bipartite-graphs/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-parameterized-deletion-bipartite-graphs/Faster Parameterized Algorithms for Deletion to Split Graphshttps://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/FO Model Checking on Posets of Bounded Widthhttps://ac.tuwien.ac.at/publication/fo-model-checking-on-posets-of-bounded-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/fo-model-checking-on-posets-of-bounded-width/Linear Time Parameterized Algorithms for Subset Feedback Vertex Sethttps://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-for-subset-feedback-vertex-set/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-for-subset-feedback-vertex-set/Metric Dimension of Bounded Width Graphshttps://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroidshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/Reconfiguration on Sparse Graphshttps://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/Solving d-SAT via Backdoors to Small Treewidthhttps://ac.tuwien.ac.at/publication/solving-d-sat-via-backdoors-to-small-treewidth/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-d-sat-via-backdoors-to-small-treewidth/Faster Parameterized Algorithms Using Linear Programminghttps://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-using-linear-programming/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-using-linear-programming/Linear Time Parameterized Algorithms via Skew-Symmetric Multicutshttps://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts/On the Kernelization Complexity of String Problemshttps://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/Parameterized Algorithms to Preserve Connectivityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/Parameterized Approximations via d-Skew-Symmetric Multicuthttps://ac.tuwien.ac.at/publication/parameterized-approximations-via-d-skew-symmetric-multicut/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-approximations-via-d-skew-symmetric-multicut/Vertex Exponential Algorithms for Connected f-Factorshttps://ac.tuwien.ac.at/publication/vertex-exponential-algorithms-for-connected-f-factors/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/vertex-exponential-algorithms-for-connected-f-factors/A Polynomial Kernel for Feedback Arc Set on Bipartite Tournamentshttps://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments-2/Backdoors to q-Hornhttps://ac.tuwien.ac.at/publication/backdoors-to-q-horn/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-q-horn/Faster Exact Algorithms for Some Terminal Set Problemshttps://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems/Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraintshttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/Hardness of r-dominating set on Graphs of Diameter (r + 1)https://ac.tuwien.ac.at/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/Parameterized Complexity of Directed Steiner Tree on Sparse Graphshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs/Partially Polynomial Kernels for Set Cover and Test Coverhttps://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover/LP can be a cure for Parameterized Problemshttps://ac.tuwien.ac.at/publication/lp-can-be-a-cure-for-parameterized-problems/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lp-can-be-a-cure-for-parameterized-problems/Parameterized Algorithms for Even Cycle Transversalhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-even-cycle-transversal/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-even-cycle-transversal/Parameterized Tractability of Multiway Cut with Parity Constraintshttps://ac.tuwien.ac.at/publication/parameterized-tractability-of-multiway-cut-with-parity-constraints/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-tractability-of-multiway-cut-with-parity-constraints/A Polynomial Kernel for Feedback Arc Set on Bipartite Tournamentshttps://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments/Paths, Flowers and Vertex Coverhttps://ac.tuwien.ac.at/publication/paths-flowers-and-vertex-cover/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/paths-flowers-and-vertex-cover/On the Kernelization Complexity of Colorful Motifshttps://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-colorful-motifs/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-colorful-motifs/Lossy Kernels for Hitting Subgraphshttps://ac.tuwien.ac.at/publication/lossy-kernels-for-hitting-subgraphs/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernels-for-hitting-subgraphs/On the Parameterized Complexity of Simultaneous Deletion Problemshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-simultaneous-deletion-problems/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-simultaneous-deletion-problems/