The following pages link to Call routing and the ratcatcher (Q1330799):
Displayed 50 items.
- Communication tree problems (Q995575) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- 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)