NOVA. The University of Newcastle's Digital Repository
List View
Showing items 1 - 6 of 6.
Add to Quick Collection All 6 Results
| Title | Author/Creator | Date | Full Text | Reviewed | |
|---|---|---|---|---|---|
| A complexity dichotomy for finding disjoint solutions of vertex deletion problems | Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf | 2009 | — | 
|
|
| Fixed-parameter algorithms for Kemeny rankings | Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. | 2009 | — |
|
|
| Graph-based data clustering with overlaps | Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Joannes | 2009 | — |
|
|
| Fixed-parameter algorithms for Kemeny Scores | Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. | 2008 | — |
|
|
| Parameterized algorithms and hardness results for some graph Motif problems | Betzler, Nadja; Fellows, Michael R.; Komusiewicz, Christian; Niedermeier, Rolf | 2008 | — |
|
|
| A refined search tree technique for Dominating Set on planar graphs | Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf... More | 2005 | — |
|
Author/Creator
- Guo, Jiong (4)
- Betzler, Nadja (3)
- Komusiewicz, Christian (2)
- Rosamond, Frances A. (2)
- Alber, Jochen (1)
- Fan, Hongbing (1)
- Fernau, Henning (1)
- Moser, Hannes (1)
Keyword
- graphs (3)
- rank aggregation (2)
- Graph Motif problem (1)
- Kemeny Scores (1)
- NP-hard minimization (1)
- bridge-connectedness (1)
- computational complexity (1)
- computational social choice (1)
- consensus permutation (1)
- edge modifications (1)
Format Type
Resource Type
- conference paper (4)
- journal article (2)
