Saket Saurabh | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/saket-saurabh/Saket SaurabhHugo Blox Builder (https://hugoblox.com)en-usSat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngSaket Saurabhhttps://ac.tuwien.ac.at/team/saket-saurabh/Detours in Directed Graphshttps://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/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/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/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/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/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/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/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/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/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/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/Don't Be Strict in Local Search!https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/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/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/On the complexity of some colorful problems parameterized by treewidthhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/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 Complexity of Some Colorful Problems Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/