Xtract | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/xtract/XtractHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngXtracthttps://ac.tuwien.ac.at/tag/xtract/A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletionhttps://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/Meta-kernelization using well-structured modulatorshttps://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/On the complexity of rainbow coloring problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/Small Resolution Proofs for QBF using Dependency Treewidthhttps://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/Solving Problems on Graphs of High Rank-Widthhttps://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/The complexity landscape of decompositional parameters for ILPhttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/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/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/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/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/Lossy kernelizationhttps://ac.tuwien.ac.at/publication/lossy-kernelization/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernelization/New Width Parameters for Model Countinghttps://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/On Structural Parameterizations of the Edge Disjoint Paths Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-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/SAT-Based Local Improvement for Finding Tree Decompositions of Small Widthhttps://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/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 Integer Linear Programs with a Small Number of Global Variables and Constraintshttps://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/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/A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletionhttps://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/Backdoors for Linear Temporal Logichttps://ac.tuwien.ac.at/publication/backdoors-for-linear-temporal-logic/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-for-linear-temporal-logic/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/Backdoors to Tractable Valued CSPhttps://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/Counting Linear Extensions: Parameterizations by Treewidthhttps://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-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/FO Model Checking of Interval Graphshttps://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/Meta-Kernelization with Structural Parametershttps://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/On Existential MSO and its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/On the Complexity Landscape of Connected f-factor Problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-2/Polynomial-Time Construction of Optimal MPI Derived Datatype Treeshttps://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/Quantified Conjunctive Queries on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-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/The Complexity Landscape of Decompositional Parameters for ILPhttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/Using Decomposition-Parameters for QBF: Mind the Prefix!https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/Community Structure Inspired Algorithms for SAT and \#SAThttps://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/Meta-Kernelization using Well-Structured Modulatorshttps://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/On the Complexity of Rainbow Coloring Problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/Parameterized Complexity of Asynchronous Border Minimizationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/Solving Problems on Graphs of High Rank-Widthhttps://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/Quantified Conjunctive Queries on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/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/