The following pages link to Call routing and the ratcatcher (Q1330799):
Displayed 36 items.
- Minor-Minimal Planar Graphs of Even Branch-Width (Q3068814) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- (Q4972036) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- (Q5089157) (← links)
- (Q5115814) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5743390) (← links)
- (Q5743430) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs (Q6039430) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Simulation of quantum many-body systems on Amazon cloud (Q6101364) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- Bounding branch-width (Q6133165) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)