Pages that link to "Item:Q3376690"
From MaRDI portal
The following pages link to New upper bounds on the decomposability of planar graphs (Q3376690):
Displayed 16 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings (Q3161084) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)