1. R. Andersen, Finding large and small dense subgraphs, February 2007. Preprint available at: arXiv:cs/0702032v1
2. Genome rearrangements and sorting by reversals;Bafna;SIAM Journal on Computing,1996
3. Traffic grooming on the path;Bermond;Theoretical Computer Science,2007
4. Grooming;Bermond,2006
5. Traffic grooming in bidirectional WDM ring networks;Bermond,2006