Pages that link to "Item:Q2835842"
From MaRDI portal
The following pages link to The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842):
Displaying 14 items.
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- (Q5874480) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
