Eduard Eiben

26 papers · 2017–2026 · 4 conferences · across top CS/AI conferences

Achievements

🏃 Academic Marathon (8) 🗺️ Taxonomy Completionist (18) 🌈 Renaissance Researcher (5) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐝 Cross-Pollinator (5) 🌍 Conference Polyglot (4) 🤝 Dynamic Duo (12) 🔬 Deep Specialist (18) 🏆 Keyword Champion (3) 🚀 Conference Pioneer 🗃️ Keyword Collector (95) ⚡ Prolific Year (5) 🔥 Unstoppable (9) 💎 Century Club (24)

Conferences

AAAI (13) IJCAI (11) ICML (1) NIPS (1)

Top co-authors

Argyrios Deligkas (13) Robert Ganian (12) Sebastian Ordyniak (11) Dusan Knop (6) Stefan Szeider (5) Tiger-Lily Goldsmith (5) Thekla Hamm (4) Šimon Schierreich (4) Iyad Kanj (3) Viktoriia Korchemna (3)

Keywords

parameterized complexity (13) combinatorial optimization (5) fair division (5) fixed-parameter tractability (4) computational complexity (4) graph theory (3) fixed-parameter algorithm (3) envy-free allocation (2) indivisible good (2) indivisible item (2) game theory (2) nash equilibrium (2) temporal graph (2) decision tree (2) polynomial-time algorithm (2) approximation algorithm (2) social network (2) complexity analysis (2) integer linear programming (2) fair allocation (2)

Papers

Network Restoration Games with Quotas (Student Abstract) AAAI 2026

Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness AAAI 2026

EF1 and EFX Orientations IJCAI 2025

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs AAAI 2025

The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025

Balanced and Fair Partitioning of Friends AAAI 2025

Individual Rationality in Topological Distance Games Is Surprisingly Hard IJCAI 2024

The Complexity of Fair Division of Indivisible Items with Externalities AAAI 2024

Learning Small Decision Trees for Data of Low Rank-Width AAAI 2024

Learning Small Decision Trees with Large Domain IJCAI 2023

A Structural Complexity Analysis of Synchronous Dynamical Systems AAAI 2023

The Computational Complexity of Concise Hypersphere Classification ICML 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems IJCAI 2023

Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023

The Complexity of Envy-Free Graph Cutting IJCAI 2022

Parameterized Complexity of Hotelling-Downs with Party Nominees IJCAI 2022

The Parameterized Complexity of Connected Fair Division IJCAI 2021

The Parameterized Complexity of Clustering Incomplete Data AAAI 2021

Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020

On the Problem of Covering a 3-D Terrain AAAI 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity AAAI 2020

The Parameterized Complexity of Cascading Portfolio Scheduling NIPS 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019

Unary Integer Linear Programming with Structural Restrictions IJCAI 2018

A Structural Approach to Activity Selection IJCAI 2018

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints IJCAI 2017