The following pages link to Archontia C. Giannopoulou (Q395007):
Displaying 37 items.
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs (Q2820855) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- A min-max theorem for LIFO-search (Q2857377) (← links)
- Excluding Graphs as Immersions in Surface Embedded Graphs (Q2864308) (← links)
- Computing Tree-Depth Faster Than 2 n (Q2867079) (← links)
- Optimizing the graph minors weak structure theorem (Q2870501) (← links)
- New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting (Q2894484) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs. (Q2955008) (← links)
- Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) (Q2978504) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- (Q4608585) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q4634398) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5111388) (← links)
- Neighborhood complexity and kernelization for nowhere dense classes of graphs (Q5111394) (← links)
- The Directed Flat Wall Theorem (Q5146780) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (Q5363764) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Excluding Single-Crossing Matching Minors in Bipartite Graphs (Q6420941) (← links)
- Braces of Perfect Matching Width 2 (Q6503423) (← links)
- Directed tangle tree-decompositions and applications (Q6575091) (← links)
- A graph searching game for block treedepth and a cubic kernel by vertex cover (Q6590085) (← links)
