The following pages link to Call routing and the ratcatcher (Q1330799):
Displaying 50 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Connected graph searching (Q690489) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Computing rank-width exactly (Q989474) (← links)
- 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)
