|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
25 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A complete adaptive algorithm for propositional satisfiability |
Bruni, Renato |
2003 |
127 | 3 |
p. 523-534 12 p. |
article |
|
| 2 | A new proof of Wojcicka's conjecture |
Chen, Yaojun |
2003 |
127 | 3 |
p. 545-554 10 p. |
article |
|
| 3 | An O(n 2) algorithm for maximum cycle mean of Monge matrices in max-algebra |
Gavalec, Martin |
2003 |
127 | 3 |
p. 651-656 6 p. |
article |
|
| 4 | Author index (last vol./issue) |
2003 |
127 | 3 |
p. 691-693 3 p. |
article |
||
| 5 | Bernoulli numbers and the probability of a birthday surprise |
Tsaban, Boaz |
2003 |
127 | 3 |
p. 657-663 7 p. |
article |
|
| 6 | Bipartite-perfect graphs |
Bang Le, Van |
2003 |
127 | 3 |
p. 581-599 19 p. |
article |
|
| 7 | Complexity of robust single facility location problems on networks with uncertain edge lengths |
Averbakh, Igor |
2003 |
127 | 3 |
p. 505-522 18 p. |
article |
|
| 8 | Connectivity of vertex and edge transitive graphs |
Meng, Jixiang |
2003 |
127 | 3 |
p. 601-613 13 p. |
article |
|
| 9 | Contents all nrs. if necessary |
2003 |
127 | 3 |
p. iv-v nvt p. |
article |
||
| 10 | Exact bounds on the order of the maximum clique of a graph |
Budinich, Marco |
2003 |
127 | 3 |
p. 535-543 9 p. |
article |
|
| 11 | Heuristics and meta-heuristics for 2-layer straight line crossing minimization |
Martı́, Rafael |
2003 |
127 | 3 |
p. 665-678 14 p. |
article |
|
| 12 | IFC (non-1st issue/vol) |
2003 |
127 | 3 |
p. IFC- 1 p. |
article |
||
| 13 | Maximal value of the zeroth-order Randić index |
Pavlović, Ljiljana |
2003 |
127 | 3 |
p. 615-626 12 p. |
article |
|
| 14 | On cutting a few vertices from a graph |
Feige, Uriel |
2003 |
127 | 3 |
p. 643-649 7 p. |
article |
|
| 15 | On sum coloring of graphs |
Salavatipour, Mohammad R |
2003 |
127 | 3 |
p. 477-488 12 p. |
article |
|
| 16 | On the domination search number |
Fomin, Fedor V |
2003 |
127 | 3 |
p. 565-580 16 p. |
article |
|
| 17 | Parameterized complexity of vertex colouring |
Cai, Leizhen |
2003 |
127 | 3 |
p. 415-429 15 p. |
article |
|
| 18 | Parametric min-cuts analysis in a network |
Aneja, Y.P |
2003 |
127 | 3 |
p. 679-689 11 p. |
article |
|
| 19 | Reconstructing minimal rooted trees |
Semple, Charles |
2003 |
127 | 3 |
p. 489-503 15 p. |
article |
|
| 20 | Scheduling unitary task systems with zero–one communication delays for quasi-interval orders |
Moukrim, Aziz |
2003 |
127 | 3 |
p. 461-476 16 p. |
article |
|
| 21 | Sparse Hypercube—a minimal k-line broadcast graph |
Fujita, Satoshi |
2003 |
127 | 3 |
p. 431-446 16 p. |
article |
|
| 22 | Sphere of influence graphs and the L ∞-metric |
Michael, T.S |
2003 |
127 | 3 |
p. 447-460 14 p. |
article |
|
| 23 | The disjunctivities of ω-languages |
Yeh, Y.T |
2003 |
127 | 3 |
p. 627-641 15 p. |
article |
|
| 24 | The power of small coalitions in graphs |
Bermond, J-C |
2003 |
127 | 3 |
p. 399-414 16 p. |
article |
|
| 25 | Total balancedness condition for Steiner tree games |
Fang, Qizhi |
2003 |
127 | 3 |
p. 555-563 9 p. |
article |
25 results found