Pages that link to "Item:Q5901631"

The following pages link to LATIN 2004: Theoretical Informatics (Q5901631):

Displaying 4 items.

• The degree-diameter problem for sparse graph classes (Q491538) (← links)
• A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
• Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
• Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)