Pages that link to "Item:Q5311123"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311123):
Displaying 15 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- (Q2721971) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs. (Q2955008) (← links)
- Parameterized Complexity of Independence and Domination on Geometric Graphs (Q3499733) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Parameterized complexity: exponential speed-up for planar graph problems (Q4828563) (← links)
- (Q4972036) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)