Pages that link to "Item:Q5897773"
From MaRDI portal
The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897773):
Displayed 7 items.
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- On the Complexity of Sandpile Prediction Problems (Q2811962) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)