The following pages link to Raul Lopes (Q324848):
Displaying 14 items.
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- (Q4263171) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- A proof for a conjecture of Gorgol (Q5890937) (← links)
- From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows (Q6131788) (← links)
- A study of networks with arc-disjoint branched flows (Q6492346) (← links)
- Finding forest-orderings of tournaments is NP-complete (Q6522147) (← links)
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
- New Menger-like dualities in digraphs and applications to half-integral linkages (Q6656974) (← links)
