Pages that link to "Item:Q1785205"
From MaRDI portal
The following pages link to New algorithms for maximum disjoint paths based on tree-likeness (Q1785205):
Displaying 7 items.
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- (Q5158500) (← links)
- Walking through waypoints (Q5918830) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
