Sebastian Ordyniak | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/sebastian-ordyniak/Sebastian OrdyniakHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngSebastian Ordyniakhttps://ac.tuwien.ac.at/team/sebastian-ordyniak/A General Theoretical Framework for Learning Smallest Interpretable Modelshttps://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/OBDDs, SDDs, and Circuits of Bounded Width: Completeness Mattershttps://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/A General Theoretical Framework for Learning Smallest Interpretable Modelshttps://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/A Tight Subexponential-Time Algorithm for Two-Page Book Embeddinghttps://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Exact Algorithms for Clustered Planarity with Linear Saturatorshttps://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Explaining Decisions in ML Models: A Parameterized Complexity Analysishttps://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/Learning Small Decision Trees for Data of Low Rank-Widthhttps://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/SAT backdoors: Depth beats sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/CSP beyond tractable constraint languageshttps://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Group Activity Selection with Few Agent Typeshttps://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/Learning Small Decision Trees with Large Domainhttps://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/On the parameterized complexity of clustering problems for incomplete datahttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Parameterized complexity of envy-free resource allocation in social networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFhttps://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/The Computational Complexity of Concise Hypersphere Classificationhttps://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/The Parameterized Complexity of Finding Concise Local Explanationshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/CSP Beyond Tractable Constraint Languageshttps://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Finding a Cluster in Incomplete Datahttps://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/SAT Backdoors: Depth Beats Sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs/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-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/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/Parameterized Complexity of Small Decision Tree Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/Parameterized Complexity of Small Decision Tree Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraintshttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/The Complexity of Object Association in Multiple Object Trackinghttps://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/The Parameterized Complexity of Connected Fair Divisionhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/The Power of Cut-Based Parameters for Computing Edge-Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/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 Parameterized Complexity of Clusteringhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rankhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Parameterized Complexity of Envy-Free Resource Allocation in Social Networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Using decomposition-parameters for QBF: Mind the prefix!https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/A Join-Based Hybrid Parameter for Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/A Join-Based Hybrid Parameter for Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-3/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-4/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-4/Counting linear extensions: Parameterizations by treewidthhttps://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/Group Activity Selection with Few Agent Typeshttps://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/Integer Programming and Incidence Treedepthhttps://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/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/SAT-Encodings for Treecut Width and Treedepthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/SAT-Encodings for Treecut Width and Treedepthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Surveyhttps://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/Solving integer quadratic programming via explicit and structural restrictionshttps://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/The Power of Cut-Based Parameters for Computing Edge Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/A Structural Approach to Activity Selectionhttps://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/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/Parameterized Algorithms for the Matrix Completion Problemhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/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/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/Unary Integer Linear Programming with Structural Restrictionshttps://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-2/Backdoor Sets for CSPhttps://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/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/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/Kernelization using structural parameters on sparse graph classeshttps://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/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/SAT-Encodings for Special Treewidth and Pathwidthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth-2/SAT-Encodings for Special Treewidth and Pathwidthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth/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 Parameterized Study of Maximum Generalized Pattern Matching Problemshttps://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth/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/Clique-Width and Directed Width Measures for Answer-Set Programminghttps://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Complexity and monotonicity results for domination gameshttps://ac.tuwien.ac.at/publication/complexity-and-monotonicity-results-for-domination-games/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-and-monotonicity-results-for-domination-games/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/Directed elimination gameshttps://ac.tuwien.ac.at/publication/directed-elimination-games/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/directed-elimination-games/Edge-Editing to a Dense and a Sparse Graph Classhttps://ac.tuwien.ac.at/publication/edge-editing-to-a-dense-and-a-sparse-graph-class/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-editing-to-a-dense-and-a-sparse-graph-class/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/SOBRA - Shielding Optimization for BRAchytherapyhttps://ac.tuwien.ac.at/publication/sobra-shielding-optimization-for-brachytherapy/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/sobra-shielding-optimization-for-brachytherapy/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/Tree-depth and vertex-minorshttps://ac.tuwien.ac.at/publication/tree-depth-and-vertex-minors/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/tree-depth-and-vertex-minors/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/A complete parameterized complexity analysis of bounded planninghttps://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/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/On finding optimal polytreeshttps://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/Parameterized Algorithms for Parity Gameshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-parity-games/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-parity-games/Variable-Deletion Backdoors to Planninghttps://ac.tuwien.ac.at/publication/variable-deletion-backdoors-to-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-deletion-backdoors-to-planning/A Parameterized Study of Maximum Generalized Pattern Matching Problemshttps://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems-2/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/Backdoors to Planninghttps://ac.tuwien.ac.at/publication/backdoors-to-planning/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-planning/Faster Existential FO Model Checking on Posetshttps://ac.tuwien.ac.at/publication/faster-existential-fo-model-checking-on-posets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-existential-fo-model-checking-on-posets/Finite Integer Index of Pathwidth and Treewidthhttps://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/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/Kernelization Using Structural Parameters on Sparse Graph Classeshttps://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Parameterized Complexity and Kernel Bounds for Hard Planning Problemshttps://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/Parameterized Complexity Results for Exact Bayesian Network Structure Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-exact-bayesian-network-structure-learning/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-exact-bayesian-network-structure-learning/Satisfiability of acyclic and almost acyclic CNF formulashttps://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-2/The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentationhttps://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/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/Augmenting tractable fragments of abstract argumentationhttps://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation/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/On Finding Optimal Polytreeshttps://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/The Complexity of Planning Revisited - A Parameterized Analysishttps://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/Valued-Based Argumentation for Tree-like Value Graphshttps://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/Algorithms and Complexity Results for Persuasive Argumentationhttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-2/Augmenting Tractable Fragments of Abstract Argumentationhttps://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation-2/Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/Algorithms and Complexity Results for Exact Bayesian Structure Learninghttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-exact-bayesian-structure-learning/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-exact-bayesian-structure-learning/Algorithms and Complexity Results for Persuasive Argumentationhttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/Satisfiability of Acyclic and Almost Acyclic CNF Formulashttps://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas/