The following pages link to Call routing and the ratcatcher (Q1330799):
Displayed 50 items.
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
- Efficient reassembling of three-regular planar graphs (Q2175057) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- The carvingwidth of hypercubes (Q2509307) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- The branchwidth of graphs and their cycle matroids (Q2642007) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- On planar graphs with large tree-width and small grid minors (Q2839208) (← links)
- Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212) (← links)
- On the Tree-Width of Planar Graphs (Q2851524) (← links)
- (Q2857427) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) (Q2945175) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- 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)