Complete characterization of almost Moore digraphs of degree three

- Baskoro, Edy Tri, Miller, Mirka, Širáň, Jozef, Sutton, Martin

Upper domination: complexity and approximation

- Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th.

Parameterized algorithms and hardness results for some graph Motif problems

- Betzler, Nadja, Fellows, Michael R., Komusiewicz, Christian, Niedermeier, Rolf

Clustering with partial information

- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances

Clustering with partial information

- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances

On distance-irregular labelings of cycles and wheels

- Bong, Novi H., Lin, Yuqing, Slamin,

What makes equitable connected partition easy

- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy

Graph-based data clustering with overlaps

- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes

Leaf powers and their properties: using the trees

- Fellows, Michael R., Meister, Daniel, Rosamond, Frances A., Sritharan, R., Telle, Jan Arne

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

Large interconnection networks with given degree and diameter

- Feria Puron, Ramiro

Sparse semi-magic squares and vertex-magic labelings

- Gray, I. D., MacDougall, James A.

Vertex-magic labeling of regular graphs: disjoint unions and assemblages

- Gray, I. D., MacDougall, J. A.

Vertex-magic labelings: mutations

- Gray, I. D., MacDougall, James A.

Resolvability of graphs

- Grigorious, Cyriac

An algorithm for the optimization of multiple classifiers in data mining based on graphs

- Kelarev, Andrei, Ryan, Joe, Yearwood, John

All regular graphs of small odd order are vertex-magic

- Kimberley, Jason S., MacDougall, James A.

Strong edge-magic graphs of maximum size

- MacDougall, James A., Wallis, W. D.

Advances in the degree/diameter problem

- Miller, Mirka

Characterisation of graphs with exclusive sum labelling

- Miller, Mirka, Ryan, Joe, Ryjáček, Zdeněk