nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A 1-(S,T)-edge-connectivity augmentation algorithm
|
Enni, Steffen |
|
1999 |
84 |
3 |
p. 529-535 |
artikel |
2 |
Augmenting hypergraphs by edges of size two
|
Bang-Jensen, Jorgen |
|
1999 |
84 |
3 |
p. 467-481 |
artikel |
3 |
Connectivity augmentation of networks: structures and algorithms
|
Frank, András |
|
1999 |
84 |
3 |
p. 439-441 |
artikel |
4 |
Coverings and structure of crossing families
|
Fleiner, Tamás |
|
1999 |
84 |
3 |
p. 505-518 |
artikel |
5 |
Covering symmetric supermodular functions by graphs
|
Benczúr, András A. |
|
1999 |
84 |
3 |
p. 483-503 |
artikel |
6 |
Directed vertex-connectivity augmentation
|
Frank, András |
|
1999 |
84 |
3 |
p. 537-553 |
artikel |
7 |
Edge-augmentation of hypergraphs
|
Cheng, Eddie |
|
1999 |
84 |
3 |
p. 443-465 |
artikel |
8 |
How to make a graph four-connected
|
Győri, Ervin |
|
1999 |
84 |
3 |
p. 555-563 |
artikel |
9 |
Hypergraph connectivity augmentation
|
Szigeti, Zoltán |
|
1999 |
84 |
3 |
p. 519-527 |
artikel |
10 |
Increasing the rooted-connectivity of a digraph by one
|
Frank, András |
|
1999 |
84 |
3 |
p. 565-576 |
artikel |
11 |
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
|
Benczúr, András A. |
|
1999 |
84 |
3 |
p. 595-640 |
artikel |
12 |
Successive edge-connectivity augmentation problems
|
Cheng, Eddie |
|
1999 |
84 |
3 |
p. 577-593 |
artikel |