Eduard Eiben
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
58
Venues
13
Active years
2015–2026
Best venue rank
A*
Where they publish
Papers
58 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Network Restoration Games with Quotas (Student Abstract). | Philip Bogaars, Argyrios Deligkas, Eduard Eiben, Michail Fasoulakis |
| 2026 | AAAI | Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich |
| 2026 | ESA | Maximizing Reachability via Shifting of Temporal Paths. | Argyrios Deligkas, Michelle Dring, Eduard Eiben, George Skretas, Georg Tennigkeit |
| 2026 | ESA | FPT Algorithms over Linear Delta-Matroids with Applications. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2026 | ICALP | Coordinated Motion Planning Is FPT on Discretized Simple Polygons. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2025 | AAAI | How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. | Argyrios Deligkas, Michelle Dring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit |
| 2025 | AAAI | The Complexity of Extending Fair Allocations of Indivisible Goods. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis |
| 2025 | AAAI | Balanced and Fair Partitioning of Friends. | Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich |
| 2025 | IJCAI | EF1 and EFX Orientations. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna |
| 2025 | STACS | Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. | Shane Bel Houari-Durand, Eduard Eiben, Magnus Wahlstrm |
| 2025 | WADS | Routing Few Robots in a Crowded Network. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan |
| 2024 | AAAI | Learning Small Decision Trees for Data of Low Rank-Width. | Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2024 | AAAI | The Complexity of Fair Division of Indivisible Items with Externalities. | Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich |
| 2024 | ICALP | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | IJCAI | Individual Rationality in Topological Distance Games Is Surprisingly Hard. | Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich |
| 2024 | SODA | Determinantal Sieving. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2023 | AAAI | A Structural Complexity Analysis of Synchronous Dynamical Systems. | Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna |
| 2023 | ICML | The Computational Complexity of Concise Hypersphere Classification. | Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2023 | IJCAI | 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 |
| 2023 | IJCAI | Minimizing Reachability Times on Temporal Graphs via Shifting Labels. | Argyrios Deligkas, Eduard Eiben, George Skretas |
| 2023 | IJCAI | Learning Small Decision Trees with Large Domain. | Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | MFCS | Finding a Highly Connected Steiner Subgraph and its Applications. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2022 | ESA | Finding a Cluster in Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | IJCAI | Parameterized Complexity of Hotelling-Downs with Party Nominees. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith |
| 2022 | IJCAI | The Complexity of Envy-Free Graph Cutting. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2022 | SACMAT | Generalized Noise Role Mining. | Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar |
| 2022 | WG | On the Lossy Kernelization for Connected Treedepth Deletion Set. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2021 | AAAI | The Parameterized Complexity of Clustering Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2021 | IJCAI | The Parameterized Complexity of Connected Fair Division. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | SODA | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | SACMAT | Valued Authorization Policy Existence Problem. | Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar |
| 2020 | AAAI | Manipulating Districts to Win Elections: Fine-Grained Complexity. | Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2020 | AAAI | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. | Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | On the Problem of Covering a 3-D Terrain. | Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia |
| 2020 | ESA | A Polynomial Kernel for Line Graph Deletion. | Eduard Eiben, William Lochet |
| 2020 | ICALP | Extending Partial 1-Planar Drawings. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | MFCS | A Polynomial Kernel for 3-Leaf Power Deletion. | Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum |
| 2020 | MFCS | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | STACS | On Covering Segments with Unit Intervals. | Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2019 | AAAI | Solving Integer Quadratic Programming via Explicit and Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2019 | ESA | Bisection of Bounded Treewidth Graphs by Convolutions. | Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad |
| 2019 | IPCO | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |
| 2019 | MFCS | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
| 2019 | STACS | Complexity of the Steiner Network Problem with Respect to the Number of Terminals. | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Such |
| 2018 | AAAI | Improved Results for Minimum Constraint Removal. | Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl |
| 2018 | ICALP | How to Navigate Through Obstacles?. | Eduard Eiben, Iyad A. Kanj |
| 2018 | IJCAI | Unary Integer Linear Programming with Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2018 | IJCAI | A Structural Approach to Activity Selection. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | STACS | Small Resolution Proofs for QBF using Dependency Treewidth. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | STACS | Lossy Kernels for Connected Dominating Set on Sparse Graphs. | Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
| 2017 | IJCAI | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. | Pavel Dvork, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2017 | MFCS | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | MFCS | Lossy Kernels for Hitting Subgraphs. | Eduard Eiben, Danny Hermelin, M. S. Ramanujan |
| 2016 | AAAI | Using Decomposition-Parameters for QBF: Mind the Prefix! | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2016 | ESA | Counting Linear Extensions: Parameterizations by Treewidth. | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
| 2016 | MFCS | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. | Eduard Eiben, Robert Ganian, O-joung Kwon |
| 2015 | IWOCA | On the Complexity of Rainbow Coloring Problems. | Eduard Eiben, Robert Ganian, Juho Lauri |
| 2015 | WADS | Solving Problems on Graphs of High Rank-Width. | Eduard Eiben, Robert Ganian, Stefan Szeider |