|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
29 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A polynomial algorithm for finding T-span of generalized cacti |
Giaro, Krzysztof |
2003 |
129 | 2-3 |
p. 371-382 12 p. |
article |
|
| 2 | Approximating covering integer programs with multiplicity constraints |
Kolliopoulos, Stavros G |
2003 |
129 | 2-3 |
p. 461-473 13 p. |
article |
|
| 3 | 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times |
Karuno, Yoshiyuki |
2003 |
129 | 2-3 |
p. 433-447 15 p. |
article |
|
| 4 | A simple minimum T-cut algorithm |
Rizzi, Romeo |
2003 |
129 | 2-3 |
p. 539-544 6 p. |
article |
|
| 5 | Author index to volume 129 |
2003 |
129 | 2-3 |
p. 549-551 3 p. |
article |
||
| 6 | Bounds on the average connectivity of a graph |
Dankelmann, Peter |
2003 |
129 | 2-3 |
p. 305-318 14 p. |
article |
|
| 7 | Classification of whist tournaments with up to 12 players |
Haanpää, Harri |
2003 |
129 | 2-3 |
p. 399-407 9 p. |
article |
|
| 8 | Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers |
Klavžar, Sandi |
2003 |
129 | 2-3 |
p. 449-460 12 p. |
article |
|
| 9 | Contents |
2003 |
129 | 2-3 |
p. v-vii nvt p. |
article |
||
| 10 | Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori |
Honkala, Iiro |
2003 |
129 | 2-3 |
p. 409-419 11 p. |
article |
|
| 11 | Domination analysis of combinatorial optimization problems |
Gutin, Gregory |
2003 |
129 | 2-3 |
p. 513-520 8 p. |
article |
|
| 12 | Efficient dominating sets in Cayley graphs |
Dejter, Italo J. |
2003 |
129 | 2-3 |
p. 319-328 10 p. |
article |
|
| 13 | Excluded-minor characterizations of antimatroids arisen from posets and graph searches |
Nakamura, M. |
2003 |
129 | 2-3 |
p. 487-498 12 p. |
article |
|
| 14 | Generating r-regular graphs |
Ding, Guoli |
2003 |
129 | 2-3 |
p. 329-343 15 p. |
article |
|
| 15 | Guide to authors |
2003 |
129 | 2-3 |
p. I-IV nvt p. |
article |
||
| 16 | IFC (Editorial Board) |
2003 |
129 | 2-3 |
p. IFC- 1 p. |
article |
||
| 17 | Interval degree and bandwidth of a graph |
Fomin, Fedor V |
2003 |
129 | 2-3 |
p. 345-359 15 p. |
article |
|
| 18 | Minimum 3-geodetically connected graphs |
Bosı́ková, Martina |
2003 |
129 | 2-3 |
p. 263-283 21 p. |
article |
|
| 19 | On linear and circular structure of (claw, net)-free graphs |
Brandstädt, Andreas |
2003 |
129 | 2-3 |
p. 285-303 19 p. |
article |
|
| 20 | On strong Menger-connectivity of star graphs |
Oh, Eunseuk |
2003 |
129 | 2-3 |
p. 499-511 13 p. |
article |
|
| 21 | On the minimum local-vertex-connectivity augmentation in graphs |
Nagamochi, Hiroshi |
2003 |
129 | 2-3 |
p. 475-486 12 p. |
article |
|
| 22 | On variations of P 4-sparse graphs |
Brandstädt, Andreas |
2003 |
129 | 2-3 |
p. 521-532 12 p. |
article |
|
| 23 | Pairs of graphs with site and bond percolation critical probabilities in opposite orders |
Wierman, John C. |
2003 |
129 | 2-3 |
p. 545-548 4 p. |
article |
|
| 24 | Planar k-cycle resonant graphs with k=1,2 |
Guo, Xiaofeng |
2003 |
129 | 2-3 |
p. 383-397 15 p. |
article |
|
| 25 | Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems |
Benczúr, András A. |
2003 |
129 | 2-3 |
p. 233-262 30 p. |
article |
|
| 26 | Symmetry properties of chordal rings of degree 3 |
Barrière, Lali |
2003 |
129 | 2-3 |
p. 211-232 22 p. |
article |
|
| 27 | The complexity of the T-coloring problem for graphs with small degree |
Giaro, Krzysztof |
2003 |
129 | 2-3 |
p. 361-369 9 p. |
article |
|
| 28 | Upper bounds on ATSP neighborhood size |
Gutin, Gregory |
2003 |
129 | 2-3 |
p. 533-538 6 p. |
article |
|
| 29 | Using transforming matrices to generate DNA clone grids |
Huang, Hua-Min |
2003 |
129 | 2-3 |
p. 421-431 11 p. |
article |
29 results found