The following pages link to Eduard Eiben (Q1647833):
Displaying 42 items.
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Integer programming and incidence treedepth (Q2293088) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Symmetry properties of generalized graph truncations (Q2312611) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Equimatchable Graphs on Surfaces (Q3466352) (← links)
- Counting Linear Extensions: Parameterizations by Treewidth (Q4606310) (← links)
- A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. (Q4608593) (← links)
- How to Navigate Through Obstacles (Q5002723) (← links)
- (Q5075784) (← links)
- (Q5089163) (← links)
- (Q5089197) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Toward Cereceda's conjecture for planar graphs (Q5110690) (← links)
- (Q5111250) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Meta-kernelization using Well-structured Modulators (Q5363765) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- (Q5874284) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- A Colored Path Problem and Its Applications (Q5888938) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- Removing Connected Obstacles in the Plane is FPT (Q6059988) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
- (Q6089654) (← links)
- A polynomial kernel for $3$-leaf power deletion (Q6328924) (← links)
