Nfpc | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/nfpc/NfpcHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngNfpchttps://ac.tuwien.ac.at/tag/nfpc/Graphs with at most two moplexeshttps://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/A Unifying Framework for Characterizing and Computing Width Measureshttps://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/An efficient algorithm for counting Markov equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Hedonic Diversity Games: A Complexity Picture with More than Two Colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/How to Find a Good Explanation for Clustering?https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/On Covering Segments with Unit Intervalshttps://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/Parameterised Partially-Predrawn Crossing Numberhttps://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Parameterized Algorithms for Upward Planarityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/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/The Complexity of k-Means Clustering when Little is Knownhttps://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/The Complexity of Temporal Vertex Cover in Small-Degree Graphshttps://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Weighted Model Counting with Twin-Widthhttps://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Computing Kemeny Rankings from d-Euclidean Preferenceshttps://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Crossing-Optimal Extension of Simple Drawingshttps://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Graphs with two moplexeshttps://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Measuring what matters: A hybrid approach to dynamic programming with treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/New Width Parameters for SAT and Sharp-SAThttps://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/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/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 Bayesian Network Learning: Revisiting the Superstructurehttps://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/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/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/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/An Efficient Algorithm for Counting Markov Equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Fixed-Parameter Tractability of Dependency QBF with Structural Parametershttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/On Covering Segments with Unit Intervalshttps://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/On Existential MSO and Its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/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 Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/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/Stable Matchings with Diversity Constraints: Affirmative Action is beyond NPhttps://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/The Complexity Landscape of Resource-Constrained Schedulinghttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/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/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/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/Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Timehttps://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/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/Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/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/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Parameterized Complexity of Asynchronous Border Minimizationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-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/Shrub-Depth: Capturing Height of Dense Graphshttps://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/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 Parameterized Complexity of Cascading Portfolio Schedulinghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/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/