Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation Satoru Iwata OriginalPaper 09 May 2003 Pages: 331 - 341
Escaping a Grid by Edge-Disjoint Paths Wun-Tat ChanFrancis Y. L. ChinHing-Fung Ting OriginalPaper 09 May 2003 Pages: 343 - 359
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems Anna GalluccioGuido Proietti OriginalPaper 09 May 2003 Pages: 361 - 374
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition Hans L. BodlaenderUdi Rotics OriginalPaper 09 May 2003 Pages: 375 - 408