Eiben, Eduard

26 publications

AAAI 2025 Balanced and Fair Partitioning of Friends Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich

IJCAI 2025 EF1 and EFX Orientations Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna

AAAI 2025 How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit

AAAI 2025 The Complexity of Extending Fair Allocations of Indivisible Goods Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis

IJCAI 2024 Individual Rationality in Topological Distance Games Is Surprisingly Hard Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich

AAAI 2024 Learning Small Decision Trees for Data of Low Rank-Width Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

AAAI 2024 The Complexity of Fair Division of Indivisible Items with Externalities Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich

AAAI 2023 A Structural Complexity Analysis of Synchronous Dynamical Systems Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna

IJCAI 2023 Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo

IJCAI 2023 Learning Small Decision Trees with Large Domain Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

IJCAI 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels Argyrios Deligkas, Eduard Eiben, George Skretas

ICML 2023 The Computational Complexity of Concise Hypersphere Classification Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider

IJCAI 2022 Parameterized Complexity of Hotelling-Downs with Party Nominees Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith

IJCAI 2022 The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

AAAI 2021 The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

IJCAI 2021 The Parameterized Complexity of Connected Fair Division Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

AAAI 2020 Manipulating Districts to Win Elections: Fine-Grained Complexity Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov

AAAI 2020 On the Problem of Covering a 3-D Terrain Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia

AAAI 2020 Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

AAAI 2019 Solving Integer Quadratic Programming via Explicit and Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

NeurIPS 2019 The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider

IJCAI 2018 A Structural Approach to Activity Selection Eduard Eiben, Robert Ganian, Sebastian Ordyniak

AAAI 2018 Improved Results for Minimum Constraint Removal Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl

IJCAI 2018 Unary Integer Linear Programming with Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

IJCAI 2017 Solving Integer Linear Programs with a Small Number of Global Variables and Constraints Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

AAAI 2016 Using Decomposition-Parameters for QBF: Mind the Prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak