The following pages link to (Q4633895):
Displaying 19 items.
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Directed NLC-width (Q906393) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)
