Journals in DBLP
Algorithmica 2003, volume: 36, number: 4
Satoru Iwata Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:331-341 [Journal ] Wun-Tat Chan , Francis Y. L. Chin , Hing-Fung Ting Escaping a Grid by Edge-Disjoint Paths. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:343-359 [Journal ] Anna Galluccio , Guido Proietti Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:361-374 [Journal ] Hans L. Bodlaender , Udi Rotics Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:375-408 [Journal ]