Eduard Eiben

From MaRDI portal
Revision as of 17:37, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1647833

Available identifiers

zbMath Open eiben.eduardMaRDI QIDQ1647833

List of research outcomes





PublicationDate of PublicationType
Finding a highly connected Steiner subgraph and its applications2024-12-03Paper
Determinantal sieving2024-11-28Paper
The parameterized complexity of coordinated motion planning2024-10-16Paper
The parameterized complexity of welfare guarantees in Schelling segregation2024-10-07Paper
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source2024-06-21Paper
https://portal.mardi4nfdi.de/entity/Q61474152024-01-15Paper
Component order connectivity in directed graphs2023-11-13Paper
https://portal.mardi4nfdi.de/entity/Q60896542023-11-13Paper
Removing Connected Obstacles in the Plane is FPT2023-11-02Paper
A polynomial kernel for 3-leaf power deletion2023-10-06Paper
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem2023-07-03Paper
On the lossy kernelization for connected treedepth deletion set2023-05-05Paper
A Colored Path Problem and Its Applications2023-04-26Paper
Preference swaps for the stable matching problem2023-04-20Paper
On the parameterized complexity of clustering problems for incomplete data2023-03-10Paper
https://portal.mardi4nfdi.de/entity/Q58742842023-02-07Paper
A Polynomial Kernel for Line Graph Deletion2023-02-07Paper
Parameterized complexity of envy-free resource allocation in social networks2023-01-04Paper
Component order connectivity in directed graphs2022-08-18Paper
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50891632022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50891972022-07-18Paper
Complexity of the Steiner Network Problem with Respect to the Number of Terminals2022-07-18Paper
On Covering Segments with Unit Intervals2022-06-03Paper
https://portal.mardi4nfdi.de/entity/Q50757842022-05-11Paper
Preference Swaps for the Stable Matching Problem2021-12-31Paper
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints2021-11-02Paper
How to Navigate Through Obstacles2021-07-28Paper
Measuring what matters: a hybrid approach to dynamic programming with treewidth2021-07-06Paper
Towards a polynomial kernel for directed feedback vertex set2021-04-19Paper
Bisection of bounded treewidth graphs by convolutions2021-04-14Paper
Small Resolution Proofs for QBF using Dependency Treewidth2020-08-05Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs2020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q51112502020-05-26Paper
Lossy Kernels for Hitting Subgraphs2020-05-26Paper
Toward Cereceda's conjecture for planar graphs2020-05-21Paper
Using decomposition-parameters for QBF: mind the prefix!2020-03-13Paper
Integer programming and incidence treedepth2020-02-06Paper
A polynomial kernel for $3$-leaf power deletion2019-11-11Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs2019-09-30Paper
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets2019-08-07Paper
Symmetry properties of generalized graph truncations2019-07-17Paper
Meta-kernelization using well-structured modulators2018-09-17Paper
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion2018-09-07Paper
On the complexity of rainbow coloring problems2018-06-27Paper
Solving problems on graphs of high rank-width2018-04-06Paper
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion.2018-03-21Paper
Counting Linear Extensions: Parameterizations by Treewidth2018-03-02Paper
Meta-kernelization using Well-structured Modulators2017-09-29Paper
On the complexity of rainbow coloring problems2016-04-04Paper
Equimatchable Graphs on Surfaces2016-02-01Paper
Solving Problems on Graphs of High Rank-Width2015-10-30Paper
Equimatchable factor-critical graphs and independence number 22015-01-29Paper

Research outcomes over time

This page was built for person: Eduard Eiben