Eduard Eiben

Available identifiers

zbMath Open eiben.eduardMaRDI QIDQ1647833

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147415	2024-01-15	Paper
Component order connectivity in directed graphs	2023-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q6089654	2023-11-13	Paper
Removing Connected Obstacles in the Plane is FPT	2023-11-02	Paper
A polynomial kernel for 3-leaf power deletion	2023-10-06	Paper
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem	2023-07-03	Paper
On the lossy kernelization for connected treedepth deletion set	2023-05-05	Paper
A Colored Path Problem and Its Applications	2023-04-26	Paper
Preference swaps for the stable matching problem	2023-04-20	Paper
On the parameterized complexity of clustering problems for incomplete data	2023-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q5874284	2023-02-07	Paper
A Polynomial Kernel for Line Graph Deletion	2023-02-07	Paper
Parameterized complexity of envy-free resource allocation in social networks	2023-01-04	Paper
Component order connectivity in directed graphs	2022-08-18	Paper
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089163	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089197	2022-07-18	Paper
Complexity of the Steiner Network Problem with Respect to the Number of Terminals	2022-07-18	Paper
On Covering Segments with Unit Intervals	2022-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q5075784	2022-05-11	Paper
Preference Swaps for the Stable Matching Problem	2021-12-31	Paper
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints	2021-11-02	Paper
How to Navigate Through Obstacles	2021-07-28	Paper
Measuring what matters: a hybrid approach to dynamic programming with treewidth	2021-07-06	Paper
Towards a polynomial kernel for directed feedback vertex set	2021-04-19	Paper
Bisection of bounded treewidth graphs by convolutions	2021-04-14	Paper
Small Resolution Proofs for QBF using Dependency Treewidth	2020-08-05	Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs	2020-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5111250	2020-05-26	Paper
Lossy Kernels for Hitting Subgraphs	2020-05-26	Paper
Toward Cereceda's conjecture for planar graphs	2020-05-21	Paper
Using decomposition-parameters for QBF: mind the prefix!	2020-03-13	Paper
Integer programming and incidence treedepth	2020-02-06	Paper
A polynomial kernel for $3$-leaf power deletion	2019-11-11	Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs	2019-09-30	Paper
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets	2019-08-07	Paper
Symmetry properties of generalized graph truncations	2019-07-17	Paper
Meta-kernelization using well-structured modulators	2018-09-17	Paper
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion	2018-09-07	Paper
On the complexity of rainbow coloring problems	2018-06-27	Paper
Solving problems on graphs of high rank-width	2018-04-06	Paper
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion.	2018-03-21	Paper
Counting Linear Extensions: Parameterizations by Treewidth	2018-03-02	Paper
Meta-kernelization using Well-structured Modulators	2017-09-29	Paper
On the complexity of rainbow coloring problems	2016-04-04	Paper
Equimatchable Graphs on Surfaces	2016-02-01	Paper
Solving Problems on Graphs of High Rank-Width	2015-10-30	Paper
Equimatchable factor-critical graphs and independence number 2	2015-01-29	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Eduard Eiben