Pages that link to "Item:Q2849341"
From MaRDI portal
The following pages link to Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341):
Displaying 11 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- The solution space of sorting with recurring comparison faults (Q726101) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- The Solution Space of Sorting with Recurring Comparison Faults (Q2819522) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- (Q5092387) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)