Equimatchable Graphs on Surfaces. - Eduard Eiben; Michal Kotrbcík (J. Graph Theory, 2016)

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

Lossy Kernels for Hitting Subgraphs. - Eduard Eiben; Danny Hermelin; M. S. Ramanujan 001 (MFCS, 2017)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan (CoRR, 2017)

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

How to Navigate Through Obstacles?. - Eduard Eiben; Iyad A. Kanj (ICALP, 2018)

Unary Integer Linear Programming with Structural Restrictions. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (IJCAI, 2018)

A Structural Approach to Activity Selection. - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (IJCAI, 2018)

Small Resolution Proofs for QBF using Dependency Treewidth. - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (STACS, 2018)

Solving Problems on Graphs of High Rank-Width. - Eduard Eiben; Robert Ganian; Stefan Szeider (Algorithmica, 2018)

Towards Cereceda's conjecture for planar graphs. - Eduard Eiben; Carl Feghali (CoRR, 2018)

On the complexity of rainbow coloring problems. - Eduard Eiben; Robert Ganian; Juho Lauri (Discret. Appl. Math., 2018)

Meta-kernelization using well-structured modulators. - Eduard Eiben; Robert Ganian; Stefan Szeider (Discret. Appl. Math., 2018)

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. - Eduard Eiben; Robert Ganian; O-joung Kwon (J. Comput. Syst. Sci., 2018)

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

Integer Programming and Incidence Treedepth. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak; Michal Pilipczuk; Marcin Wrochna (IPCO, 2019)

The Parameterized Complexity of Cascading Portfolio Scheduling. - Eduard Eiben; Robert Ganian; Iyad Kanj; Stefan Szeider (NeurIPS, 2019)

Complexity of the Steiner Network Problem with Respect to the Number of Terminals. - Eduard Eiben; Dusan Knop; Fahad Panolan; Ondrej Suchý 001 (STACS, 2019)

Counting Linear Extensions: Parameterizations by Treewidth. - Eduard Eiben; Robert Ganian; Kustaa Kangas; Sebastian Ordyniak (Algorithmica, 2019)

On Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (CoRR, 2019)

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. - Eduard Eiben; Danny Hermelin; M. S. Ramanujan 001 (J. Comput. Syst. Sci., 2019)

Symmetry properties of generalized graph truncations. - Eduard Eiben; Robert Jajcay; Primoz Sparl (J. Comb. Theory B, 2019)

Lossy Kernels for Connected Dominating Set on Sparse Graphs. - Eduard Eiben; Mithilesh Kumar 001; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz (SIAM J. Discret. Math., 2019)

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)

Removing Connected Obstacles in the Plane Is FPT. - Eduard Eiben; Daniel Lokshtanov (SoCG, 2020)

A Polynomial Kernel for Line Graph Deletion. - Eduard Eiben; William Lochet (ESA, 2020)

Extending Partial 1-Planar Drawings. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (ICALP, 2020)

A Polynomial Kernel for Paw-Free Editing. - Eduard Eiben; William Lochet; Saket Saurabh 001 (IPEC, 2020)

Extending Nearly Complete 1-Planar Drawings in Polynomial Time. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (MFCS, 2020)

EPTAS for k-means Clustering of Affine Subspaces. - Eduard Eiben; Fedor V. Fomin; Petr A. Golovach; William Lochet; Fahad Panolan; Kirill Simonov (CoRR, 2020)

Using decomposition-parameters for QBF: Mind the prefix! - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (J. Comput. Syst. Sci., 2020)

Toward Cereceda's conjecture for planar graphs. - Eduard Eiben; Carl Feghali (J. Graph Theory, 2020)

A Colored Path Problem and Its Applications. - Eduard Eiben; Iyad Kanj (ACM Trans. Algorithms, 2020)

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

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

Valued Authorization Policy Existence Problem. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (SACMAT, 2021)

EPTAS for k-means Clustering of Affine Subspaces. - Eduard Eiben; Fedor V. Fomin; Petr A. Golovach; William Lochet; Fahad Panolan; Kirill Simonov (SODA, 2021)

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (Artif. Intell., 2021)

Towards a Polynomial Kernel for Directed Feedback Vertex Set. - Benjamin Bergougnoux; Eduard Eiben; Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

Measuring what matters: A hybrid approach to dynamic programming with treewidth. - Eduard Eiben; Robert Ganian; Thekla Hamm; O-joung Kwon (J. Comput. Syst. Sci., 2021)

Bisection of bounded treewidth graphs by convolutions. - Eduard Eiben; Daniel Lokshtanov; Amer E. Mouawad (J. Comput. Syst. Sci., 2021)

Finding a Cluster in Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (ESA, 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 (IJCAI, 2022)

A Unifying Framework for Characterizing and Computing Width Measures. - Eduard Eiben; Robert Ganian; Thekla Hamm; Lars Jaffke; O-joung Kwon (ITCS, 2022)

On the Parameterized Complexity of Symmetric Directed Multicut. - Eduard Eiben; Clément Rambaud; Magnus Wahlström (IPEC, 2022)

Generalized Noise Role Mining. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (SACMAT, 2022)

On the Lossy Kernelization for Connected Treedepth Deletion Set. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (WG, 2022)

Component Order Connectivity in Directed Graphs. - Jørgen Bang-Jensen; Eduard Eiben; Gregory Z. Gutin; Magnus Wahlström; Anders Yeo (Algorithmica, 2022)

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (CoRR, 2022)

On Covering Segments with Unit Intervals. - Dan Bergren; Eduard Eiben; Robert Ganian; Iyad Kanj (SIAM J. Discret. Math., 2022)

Valued Authorization Policy Existence Problem: Theory and Experiments. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (ACM Trans. Priv. Secur., 2022)

A Structural Complexity Analysis of Synchronous Dynamical Systems. - Eduard Eiben; Robert Ganian; Thekla Hamm; Viktoriia Korchemna (AAAI, 2023)

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (AAMAS, 2023)

The Parameterized Complexity of Coordinated Motion Planning. - Eduard Eiben; Robert Ganian; Iyad Kanj (SoCG, 2023)

The Computational Complexity of Concise Hypersphere Classification. - Eduard Eiben; Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 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)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels. - Argyrios Deligkas; Eduard Eiben; George Skretas (IJCAI, 2023)

Learning Small Decision Trees with Large Domain. - Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (IPEC, 2023)

Finding a Highly Connected Steiner Subgraph and its Applications. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (MFCS, 2023)

Parameterized complexity of envy-free resource allocation in social networks. - Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (Artif. Intell., 2023)

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

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (CoRR, 2023)

Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (CoRR, 2023)

Some coordination problems are harder than others. - Argyrios Deligkas; Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Anders Yeo (CoRR, 2023)

Preference swaps for the stable matching problem. - Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Clément Rambaud; Magnus Wahlström; Anders Yeo (Theor. Comput. Sci., 2023)

On the parameterized complexity of clustering problems for incomplete data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2023)

A Polynomial Kernel for 3-Leaf Power Deletion. - Jungho Ahn; Eduard Eiben; O-joung Kwon; Sang-il Oum (Algorithmica, 2023)

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, 2024)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (ICALP, 2024)

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

Determinantal Sieving. - Eduard Eiben; Tomohiro Koana; Magnus Wahlström (SODA, 2024)

EF1 and EFX Orientations. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; Viktoriia Korchemna (CoRR, 2024)

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (Inf. Comput., 2024)

The parameterized complexity of welfare guarantees in Schelling segregation. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith (Theor. Comput. Sci., 2024)

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 (AAAI, 2025)

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

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. - Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (SoCG, 2025)

Parameterized Algorithms for Multiagent Pathfinding on Trees. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan 001 (AAMAS, 2025)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. - Séhane Bel Houari-Durand; Eduard Eiben; Magnus Wahlström (STACS, 2025)

Routing Few Robots in a Crowded Network. - Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; Dominik Leko; M. S. Ramanujan 001 (WADS, 2025)

FPT algorithms over linear delta-matroids with applications. - Eduard Eiben; Tomohiro Koana; Magnus Wahlström (CoRR, 2025)

Bi-objective Optimization in Role Mining. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (ACM Trans. Priv. Secur., 2025)