Pages that link to "Item:Q5311096"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311096):
Displaying 13 items.
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- The genus of curve, pants and flip graphs (Q1702343) (← links)
- The Bidimensional Theory of Bounded-Genus Graphs (Q3440261) (← links)
- Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs (Q3455210) (← links)
- Contraction Bidimensionality: The Accurate Picture (Q3639283) (← links)
- (Q5091279) (← links)
- Bidimensional Parameters and Local Treewidth (Q5317565) (← links)
- Bidimensionality and Parameterized Algorithms (Invited Talk) (Q5363755) (← links)
- (Q5417618) (← links)
- Graph Drawing (Q5711635) (← links)
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus (Q5757875) (← links)