The following pages link to Rolf Niedermeier (Q175575):
Displaying 8 items.
- The complexity of finding effectors (Q519899) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- On multidimensional curves with Hilbert property (Q1587370) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions (Q6496832) (← links)
