Your selections:
What makes equitable connected partition easy
- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy
Advances in the degree/diameter problem
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances
Leaf powers and their properties: using the trees
- Fellows, Michael R., Meister, Daniel, Rosamond, Frances A., Sritharan, R., Telle, Jan Arne
Parameterized algorithms and hardness results for some graph Motif problems
- Betzler, Nadja, Fellows, Michael R., Komusiewicz, Christian, Niedermeier, Rolf
Strong edge-magic graphs of maximum size
- MacDougall, James A., Wallis, W. D.
Sparse semi-magic squares and vertex-magic labelings
- Gray, I. D., MacDougall, James A.
Complete characterization of almost Moore digraphs of degree three
- Baskoro, Edy Tri, Miller, Mirka, Širáň, Jozef, Sutton, Martin
Are you sure you would like to clear your session, including search history and login status?