Daniel Lokshtanov | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/daniel-lokshtanov/Daniel LokshtanovHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngDaniel Lokshtanovhttps://ac.tuwien.ac.at/team/daniel-lokshtanov/A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphshttps://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-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/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 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/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/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/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/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/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/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/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/