Eduard Eiben

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 121

Top Venues

Publications

Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP (2024)
Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR (2024)
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI (2024)
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. SODA (2024)
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299 (2024)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS (2024)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Bi-objective Optimization in Role Mining. CoRR (2024)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj
The Parameterized Complexity of Coordinated Motion Planning. SoCG (2023)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS (2023)
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Some coordination problems are harder than others. CoRR (2023)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR (2023)
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134 (2023)
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. ICML (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315 (2023)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. CoRR (2023)
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR (2023)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940 (Part) (2023)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj
The Parameterized Complexity of Coordinated Motion Planning. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR (2023)
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees with Large Domain. IJCAI (2023)
Argyrios Deligkas, Eduard Eiben, George Skretas
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI (2023)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85 (10) (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. CoRR (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. CoRR (2023)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25 (4) (2022)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR (2022)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. ESA (2022)
Eduard Eiben, Clément Rambaud, Magnus Wahlström
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC (2022)
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
On Covering Segments with Unit Intervals. SIAM J. Discret. Math. 36 (2) (2022)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Generalized Noise Role Mining. SACMAT (2022)
Eduard Eiben, Clément Rambaud, Magnus Wahlström
On the parameterized complexity of symmetric directed multicut. CoRR (2022)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. Algorithmica 84 (9) (2022)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. ITCS (2022)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. IJCAI (2022)
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI (2022)
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG (2022)
Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. 119 (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121 (2021)
Argyrios Deligkas, Eduard Eiben, George Skretas
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR (2021)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference Swaps for the Stable Matching Problem. CoRR (2021)
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300 (2021)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Parameterized Complexity of Connected Fair Division. IJCAI (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. CoRR (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
A Unifying Framework for Characterizing and Computing Width Measures. CoRR (2021)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Parameterized Complexity of Clustering Incomplete Data. AAAI (2021)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83 (5) (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. SACMAT (2021)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
-means Clustering of Affine Subspaces. SODA (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. CoRR (2020)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI (2020)
Eduard Eiben, Iyad Kanj
A Colored Path Problem and Its Applications. ACM Trans. Algorithms 16 (4) (2020)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. CoRR (2020)
Eduard Eiben, Carl Feghali
Toward Cereceda's conjecture for planar graphs. J. Graph Theory 94 (2) (2020)
Eduard Eiben, William Lochet
A Polynomial Kernel for Line Graph Deletion. CoRR (2020)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR (2020)
Eduard Eiben, Daniel Lokshtanov
Removing Connected Obstacles in the Plane is FPT. CoRR (2020)
Eduard Eiben, William Lochet
A Polynomial Kernel for Line Graph Deletion. ESA (2020)
Eduard Eiben, William Lochet, Saket Saurabh
A Polynomial Kernel for Paw-Free Editing. IPEC (2020)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110 (2020)
Eduard Eiben, Daniel Lokshtanov
Removing Connected Obstacles in the Plane Is FPT. SoCG (2020)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. CoRR (2020)
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
On Covering Segments with Unit Intervals. STACS (2020)
Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
On the Problem of Covering a 3-D Terrain. AAAI (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. IPEC (2020)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
EPTAS for k-means Clustering of Affine Subspaces. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. ICALP (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR (2019)
Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
Bisection of Bounded Treewidth Graphs by Convolutions. ESA (2019)
Eduard Eiben, Robert Jajcay, Primoz Sparl
Symmetry properties of generalized graph truncations. J. Comb. Theory, Ser. B 137 (2019)
Eduard Eiben, Danny Hermelin, M. S. Ramanujan
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105 (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. IPCO (2019)
Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
A polynomial kernel for $3$-leaf power deletion. CoRR (2019)
Eduard Eiben, William Lochet, Saket Saurabh
A Polynomial Kernel for Paw-Free Editing. CoRR (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS (2019)
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS (2019)
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81 (4) (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On Clustering Incomplete Data. CoRR (2019)
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS (2019)
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33 (3) (2019)
Eduard Eiben, Carl Feghali
Towards Cereceda's conjecture for planar graphs. CoRR (2018)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
A Structural Approach to Activity Selection. IJCAI (2018)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Small Resolution Proofs for QBF using Dependency Treewidth. STACS (2018)

Eduard Eiben.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eduard Eiben