Authors: CHROBAK M NAKANO S

Citation: M. Chrobak et S. Nakano, MINIMUM-WIDTH GRID DRAWINGS OF PLANE GRAPHS, Computational geometry, 11(1), 1998, pp. 29-54

Authors: CHROBAK M LARMORE LL REINGOLD N WESTBROOK J

Citation: M. Chrobak et al., PAGE MIGRATION ALGORITHMS USING WORK-FUNCTIONS, Journal of algorithms, 24(1), 1997, pp. 124-157

Authors: CHROBAK M LARMORE LL LUND C REINGOLD N

Citation: M. Chrobak et al., A BETTER LOWER-BOUND ON THE COMPETITIVE RATIO OF THE RANDOMIZED 2-SERVER PROBLEM, Information processing letters, 63(2), 1997, pp. 79-83

Authors: CHROBAK M PAYNE TH

Citation: M. Chrobak et Th. Payne, A LINEAR-TIME ALGORITHM FOR DRAWING A PLANAR GRAPH ON A GRID, Information processing letters, 54(4), 1995, pp. 241-246

Authors: CHROBAK M RYTTER W

Citation: M. Chrobak et W. Rytter, 2 RESULTS ON LINEAR EMBEDDINGS OF COMPLETE BINARY-TREES, Theoretical computer science, 136(2), 1994, pp. 507-526

Authors: CHROBAK M LARMORE LL

Citation: M. Chrobak et Ll. Larmore, GENEROSITY HELPS OR AN 11-COMPETITIVE ALGORITHM FOR 3 SERVERS, Journal of algorithms, 16(2), 1994, pp. 234-263