Eduard Eiben

According to our database1, Eduard Eiben authored at least 54 papers between 2016 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Valued Authorization Policy Existence Problem: Theory and Experiments.
ACM Trans. Priv. Secur., 2022

On Covering Segments with Unit Intervals.
SIAM J. Discret. Math., 2022

The Parameterized Complexity of Welfare Guarantees in Schelling Segregation.
CoRR, 2022

Generalized Noise Role Mining.
Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

A Unifying Framework for Characterizing and Computing Width Measures.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

The Complexity of Envy-Free Graph Cutting.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Parameterized Complexity of Hotelling-Downs with Party Nominees.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Bisection of bounded treewidth graphs by convolutions.
J. Comput. Syst. Sci., 2021

Measuring what matters: A hybrid approach to dynamic programming with treewidth.
J. Comput. Syst. Sci., 2021

Preference Swaps for the Stable Matching Problem.
CoRR, 2021

Minimizing Reachability Times on Temporal Graphs via Shifting Labels.
CoRR, 2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set.
Algorithmica, 2021

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.
Artif. Intell., 2021

EPTAS for <i>k</i>-means Clustering of Affine Subspaces.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Valued Authorization Policy Existence Problem.
Proceedings of the SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies, 2021

The Parameterized Complexity of Connected Fair Division.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

The Parameterized Complexity of Clustering Incomplete Data.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
A Colored Path Problem and Its Applications.
ACM Trans. Algorithms, 2020

Toward Cereceda's conjecture for planar graphs.
J. Graph Theory, 2020

Using decomposition-parameters for QBF: Mind the prefix!
J. Comput. Syst. Sci., 2020

EPTAS for k-means Clustering of Affine Subspaces.
CoRR, 2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

A Polynomial Kernel for 3-Leaf Power Deletion.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

A Polynomial Kernel for Paw-Free Editing.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Component Order Connectivity in Directed Graphs.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Extending Partial 1-Planar Drawings.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

A Polynomial Kernel for Line Graph Deletion.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Removing Connected Obstacles in the Plane Is FPT.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

On the Problem of Covering a 3-D Terrain.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Parameterized Complexity of Envy-Free Resource Allocation in Social Networks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Lossy Kernels for Connected Dominating Set on Sparse Graphs.
SIAM J. Discret. Math., 2019

Symmetry properties of generalized graph truncations.
J. Comb. Theory, Ser. B, 2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.
J. Comput. Syst. Sci., 2019

On Clustering Incomplete Data.
CoRR, 2019

Counting Linear Extensions: Parameterizations by Treewidth.
Algorithmica, 2019

Complexity of the Steiner Network Problem with Respect to the Number of Terminals.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Parameterized Complexity of Cascading Portfolio Scheduling.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Integer Programming and Incidence Treedepth.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.
J. Comput. Syst. Sci., 2018

Meta-kernelization using well-structured modulators.
Discret. Appl. Math., 2018

On the complexity of rainbow coloring problems.
Discret. Appl. Math., 2018

Towards Cereceda's conjecture for planar graphs.
CoRR, 2018

Solving Problems on Graphs of High Rank-Width.
Algorithmica, 2018

Small Resolution Proofs for QBF using Dependency Treewidth.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Structural Approach to Activity Selection.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Unary Integer Linear Programming with Structural Restrictions.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

How to Navigate Through Obstacles?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Results for Minimum Constraint Removal.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Lossy Kernels for Connected Dominating Set on Sparse Graphs.
CoRR, 2017

Lossy Kernels for Hitting Subgraphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Equimatchable Graphs on Surfaces.
J. Graph Theory, 2016


  Loading...