The following pages link to Luke Mathieson (Q414865):
Displaying 8 items.
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Functional graphs of polynomials over finite fields (Q895996) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
