The following pages link to (Q4886099):
Displayed 13 items.
- The density maximization problem in graphs (Q386420) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Distance measures for embedded graphs (Q1984601) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)