Eduard Eiben - RankMe

157 papers A* 36A 14B 16C 3Journal 87Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A structural complexity analysis of synchronous dynamical systems. Artif. Intell. Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2026	A*	`conf`	Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. AAAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2026	J	`jnl`	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. Algorithmica Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2026	J	`jnl`	Highly Connected Steiner Subgraph: Parameterized Algorithms and Applications to Hitting Set Problems. SIAM J. Discret. Math. Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2026	A*	`conf`	Network Restoration Games with Quotas (Student Abstract). AAAI Philip Bogaars, Argyrios Deligkas, Eduard Eiben, Michail Fasoulakis
2026	J	`jnl`	Routing few robots in a crowded network. J. Comput. Syst. Sci. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2026	J	`jnl`	Stability in Distance Preservation Games on Graphs. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	A*	`conf`	A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. SoCG Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025	J	`jnl`	A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj, Ramanujan Maadapuzhi Sridharan
2025	A*	`conf`	Balanced and Fair Partitioning of Friends. AAAI Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Balanced and Fair Partitioning of Friends. CoRR Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Bi-objective Optimization in Role Mining. ACM Trans. Priv. Secur. Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2025	J	`jnl`	Determinantal Sieving. TheoretiCS Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	J	`jnl`	Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	A*	`conf`	EF1 and EFX Orientations. IJCAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna
2025	J	`jnl`	FPT algorithms over linear delta-matroids with applications. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	A*	`conf`	How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. AAAI Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025	J	`jnl`	Mechanism Design with Outliers and Predictions. CoRR Argyrios Deligkas, Eduard Eiben, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
2025	—	`conf`	Motion Planning of Disk and Rectangular Robots. CCCG Eduard Eiben, Iyad Kanj, Salman Parsa
2025	A	`conf`	Parameterized Algorithms for Multiagent Pathfinding on Trees. AAMAS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025	J	`jnl`	Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025	A	`conf`	Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. STACS Séhane Bel Houari-Durand, Eduard Eiben, Magnus Wahlström
2025	J	`jnl`	Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. CoRR Séhane Bel Houari-Durand, Eduard Eiben, Magnus Wahlström
2025	B	`conf`	Routing Few Robots in a Crowded Network. WADS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2025	A*	`conf`	The Complexity of Extending Fair Allocations of Indivisible Goods. AAAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2025	J	`jnl`	The Complexity of Extending Fair Allocations of Indivisible Goods. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2024	J	`jnl`	Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2024	J	`jnl`	Bi-objective Optimization in Role Mining. CoRR Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2024	A*	`conf`	Determinantal Sieving. SODA Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2024	J	`jnl`	EF1 and EFX Orientations. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna
2024	J	`jnl`	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2024	J	`jnl`	How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2024	A*	`conf`	Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	J	`jnl`	Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	A*	`conf`	Learning Small Decision Trees for Data of Low Rank-Width. AAAI Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2024	A*	`conf`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	J	`jnl`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	A*	`conf`	The Complexity of Fair Division of Indivisible Items with Externalities. AAAI Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
2024	A	`conf`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2024	J	`jnl`	The parameterized complexity of welfare guarantees in Schelling segregation. Theor. Comput. Sci. Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2023	J	`jnl`	A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2023	A*	`conf`	A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023	J	`jnl`	A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
2023	A	`conf`	Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023	J	`jnl`	Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023	J	`jnl`	Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	A*	`conf`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Determinantal Sieving. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2023	J	`jnl`	Finding a Cluster in Incomplete Data. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023	B	`conf`	Finding a Highly Connected Steiner Subgraph and its Applications. MFCS Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023	B	`conf`	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023	J	`jnl`	Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2023	A*	`conf`	Learning Small Decision Trees with Large Domain. IJCAI Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023	A*	`conf`	Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI Argyrios Deligkas, Eduard Eiben, George Skretas
2023	J	`jnl`	On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023	J	`jnl`	Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023	J	`jnl`	Preference swaps for the stable matching problem. Theor. Comput. Sci. Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2023	J	`jnl`	Some coordination problems are harder than others. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	The Complexity of Envy-Free Graph Cutting. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023	J	`jnl`	The Complexity of Fair Division of Indivisible Items with Externalities. CoRR Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
2023	A*	`conf`	The Computational Complexity of Concise Hypersphere Classification. ICML Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2023	J	`jnl`	The Computational Complexity of Concise Hypersphere Classification. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023	A*	`conf`	The Parameterized Complexity of Coordinated Motion Planning. SoCG Eduard Eiben, Robert Ganian, Iyad Kanj
2023	J	`jnl`	The Parameterized Complexity of Coordinated Motion Planning. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj
2023	A	`conf`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2022	A	`conf`	A Unifying Framework for Characterizing and Computing Width Measures. ITCS Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2022	J	`jnl`	An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2022	J	`jnl`	Component Order Connectivity in Directed Graphs. Algorithmica Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2022	A	`conf`	Finding a Cluster in Incomplete Data. ESA Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2022	C	`conf`	Generalized Noise Role Mining. SACMAT Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2022	J	`jnl`	On Covering Segments with Unit Intervals. SIAM J. Discret. Math. Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2022	B	`conf`	On the Lossy Kernelization for Connected Treedepth Deletion Set. WG Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
2022	B	`conf`	On the Parameterized Complexity of Symmetric Directed Multicut. IPEC Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022	J	`jnl`	On the parameterized complexity of symmetric directed multicut. CoRR Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022	A*	`conf`	Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2022	A*	`conf`	The Complexity of Envy-Free Graph Cutting. IJCAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2022	J	`jnl`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2022	J	`jnl`	Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021	J	`jnl`	A Unifying Framework for Characterizing and Computing Width Measures. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
2021	J	`jnl`	Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
2021	A*	`conf`	EPTAS for SODA Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2021	J	`jnl`	Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2021	J	`jnl`	Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR Argyrios Deligkas, Eduard Eiben, George Skretas
2021	J	`jnl`	Preference Swaps for the Stable Matching Problem. CoRR Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2021	A*	`conf`	The Parameterized Complexity of Clustering Incomplete Data. AAAI Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2021	A*	`conf`	The Parameterized Complexity of Connected Fair Division. IJCAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021	J	`jnl`	The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2021	J	`jnl`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2021	C	`conf`	Valued Authorization Policy Existence Problem. SACMAT Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021	J	`jnl`	Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2020	J	`jnl`	A Colored Path Problem and Its Applications. ACM Trans. Algorithms Eduard Eiben, Iyad Kanj
2020	B	`conf`	A Polynomial Kernel for 3-Leaf Power Deletion. MFCS Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2020	A	`conf`	A Polynomial Kernel for Line Graph Deletion. ESA Eduard Eiben, William Lochet
2020	J	`jnl`	A Polynomial Kernel for Line Graph Deletion. CoRR Eduard Eiben, William Lochet
2020	B	`conf`	A Polynomial Kernel for Paw-Free Editing. IPEC Eduard Eiben, William Lochet, Saket Saurabh
2020	B	`conf`	Component Order Connectivity in Directed Graphs. IPEC Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Component Order Connectivity in Directed Graphs. CoRR Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	EPTAS for k-means Clustering of Affine Subspaces. CoRR Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2020	B	`conf`	Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020	J	`jnl`	Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020	A*	`conf`	Extending Partial 1-Planar Drawings. ICALP Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020	J	`jnl`	Extending Partial 1-Planar Drawings. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020	J	`jnl`	Integer Programming and Incidence Treedepth. CoRR Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2020	A*	`conf`	Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	J	`jnl`	Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	A	`conf`	On Covering Segments with Unit Intervals. STACS Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
2020	A*	`conf`	On the Problem of Covering a 3-D Terrain. AAAI Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
2020	A*	`conf`	Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2020	A*	`conf`	Removing Connected Obstacles in the Plane Is FPT. SoCG Eduard Eiben, Daniel Lokshtanov
2020	J	`jnl`	Removing Connected Obstacles in the Plane is FPT. CoRR Eduard Eiben, Daniel Lokshtanov
2020	J	`jnl`	Toward Cereceda's conjecture for planar graphs. J. Graph Theory Eduard Eiben, Carl Feghali
2020	J	`jnl`	Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2019	J	`jnl`	A Polynomial Kernel for Paw-Free Editing. CoRR Eduard Eiben, William Lochet, Saket Saurabh
2019	J	`jnl`	A polynomial kernel for $3$-leaf power deletion. CoRR Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum
2019	A	`conf`	Bisection of Bounded Treewidth Graphs by Convolutions. ESA Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
2019	A	`conf`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2019	J	`jnl`	Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2019	B	`conf`	Integer Programming and Incidence Treedepth. IPCO Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2019	J	`jnl`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2019	B	`conf`	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019	J	`jnl`	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2019	J	`jnl`	On Clustering Incomplete Data. CoRR Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2019	J	`jnl`	On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2019	A*	`conf`	Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2019	J	`jnl`	Symmetry properties of generalized graph truncations. J. Comb. Theory B Eduard Eiben, Robert Jajcay, Primoz Sparl
2019	A*	`conf`	The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
2018	A*	`conf`	A Structural Approach to Activity Selection. IJCAI Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018	J	`jnl`	A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. Eduard Eiben, Robert Ganian, O-joung Kwon
2018	J	`jnl`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2018	A*	`conf`	How to Navigate Through Obstacles?. ICALP Eduard Eiben, Iyad A. Kanj
2018	A*	`conf`	Improved Results for Minimum Constraint Removal. AAAI Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
2018	A	`conf`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2018	J	`jnl`	Meta-kernelization using well-structured modulators. Discret. Appl. Math. Eduard Eiben, Robert Ganian, Stefan Szeider
2018	J	`jnl`	On the complexity of rainbow coloring problems. Discret. Appl. Math. Eduard Eiben, Robert Ganian, Juho Lauri
2018	A	`conf`	Small Resolution Proofs for QBF using Dependency Treewidth. STACS Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018	J	`jnl`	Solving Problems on Graphs of High Rank-Width. Algorithmica Eduard Eiben, Robert Ganian, Stefan Szeider
2018	J	`jnl`	Towards Cereceda's conjecture for planar graphs. CoRR Eduard Eiben, Carl Feghali
2018	A*	`conf`	Unary Integer Linear Programming with Structural Restrictions. IJCAI Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017	J	`jnl`	How to navigate through obstacles? CoRR Eduard Eiben, Iyad A. Kanj
2017	J	`jnl`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan
2017	B	`conf`	Lossy Kernels for Hitting Subgraphs. MFCS Eduard Eiben, Danny Hermelin, M. S. Ramanujan
2017	J	`jnl`	Small Resolution Proofs for QBF using Dependency Treewidth. CoRR Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2017	A*	`conf`	Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017	J	`jnl`	Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017	B	`conf`	Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2016	B	`conf`	A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS Eduard Eiben, Robert Ganian, O-joung Kwon
2016	J	`jnl`	A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR Eduard Eiben, Robert Ganian, O-joung Kwon
2016	A	`conf`	Counting Linear Extensions: Parameterizations by Treewidth. ESA Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2016	J	`jnl`	Equimatchable Graphs on Surfaces. J. Graph Theory Eduard Eiben, Michal Kotrbcík
2016	A*	`conf`	Using Decomposition-Parameters for QBF: Mind the Prefix! AAAI Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2015	J	`jnl`	Meta-Kernelization using Well-Structured Modulators. CoRR Eduard Eiben, Robert Ganian, Stefan Szeider
2015	B	`conf`	Meta-kernelization using Well-structured Modulators. IPEC Eduard Eiben, Robert Ganian, Stefan Szeider
2015	C	`conf`	On the Complexity of Rainbow Coloring Problems. IWOCA Eduard Eiben, Robert Ganian, Juho Lauri
2015	J	`jnl`	On the Complexity of Rainbow Coloring Problems. CoRR Eduard Eiben, Robert Ganian, Juho Lauri
2015	B	`conf`	Solving Problems on Graphs of High Rank-Width. WADS Eduard Eiben, Robert Ganian, Stefan Szeider
2015	J	`jnl`	Solving Problems on Graphs of High Rank-Width. CoRR Eduard Eiben, Robert Ganian, Stefan Szeider