Eduard Eiben | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/eduard-eiben/Eduard EibenHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngEduard Eibenhttps://ac.tuwien.ac.at/team/eduard-eiben/A structural complexity analysis of synchronous dynamical systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Coordinated Motion Planning Is FPT on Discretized Simple Polygonshttps://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/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/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Routing few robots in a crowded networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/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/The Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/The Parameterized Complexity of Coordinated Motion Planninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robotshttps://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Parameterized Algorithms for Multiagent Pathfinding on Treeshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Routing Few Robots in a Crowded Networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/The Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/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/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/The Complexity of Fair Division of Indivisible Items with Externalitieshttps://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/A Structural Complexity Analysis of Synchronous Dynamical Systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/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/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/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 Coordinated Motion Planninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/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/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/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/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/EPTAS for \emphk-means Clustering of Affine Subspaceshttps://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/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/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 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/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/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 Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/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/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Manipulating Districts to Win Elections: Fine-Grained Complexityhttps://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/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/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/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/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/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-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/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/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/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/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 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/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/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 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/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/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/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/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/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/