Connectivity augmentation of networks: structures and algorithms András Frank Foreword 16 March 1999 Pages: 439 - 441
Augmenting hypergraphs by edges of size two Jorgen Bang-JensenBill Jackson OriginalPaper 14 February 2014 Pages: 467 - 481
Covering symmetric supermodular functions by graphs András A. BenczúrAndrás Frank OriginalPaper 14 February 2014 Pages: 483 - 503
Coverings and structure of crossing families Tamás FleinerTibor Jordán OriginalPaper 14 February 2014 Pages: 505 - 518
A 1-(S,T)-edge-connectivity augmentation algorithm Steffen Enni OriginalPaper 14 February 2014 Pages: 529 - 535
Directed vertex-connectivity augmentation András FrankTibor Jordán OriginalPaper 14 February 2014 Pages: 537 - 553
How to make a graph four-connected Ervin GyőriTibor Jordán OriginalPaper 14 February 2014 Pages: 555 - 563
Increasing the rooted-connectivity of a digraph by one András Frank OriginalPaper 14 February 2014 Pages: 565 - 576
Successive edge-connectivity augmentation problems Eddie ChengTibor Jordán OriginalPaper 14 February 2014 Pages: 577 - 593
Parallel and fast sequential algorithms for undirected edge connectivity augmentation András A. Benczúr OriginalPaper 14 February 2014 Pages: 595 - 640
