Neeldhara Misra | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/neeldhara-misra/Neeldhara MisraHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngNeeldhara Misrahttps://ac.tuwien.ac.at/team/neeldhara-misra/Backdoors into heterogeneous classes of SAT and CSPhttps://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/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/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/Backdoors into Heterogeneous Classes of SAT and CSPhttps://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/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/Upper and Lower Bounds for Weak Backdoor Set Detectionhttps://ac.tuwien.ac.at/publication/upper-and-lower-bounds-for-weak-backdoor-set-detection/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/upper-and-lower-bounds-for-weak-backdoor-set-detection/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/