|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
17 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A large set of non-Hamiltonian graphs |
Katona, Gyula Y. |
2001 |
115 | 1-3 |
p. 99-115 17 p. |
article |
|
| 2 | An orientation theorem with parity conditions |
Frank, András |
2001 |
115 | 1-3 |
p. 37-47 11 p. |
article |
|
| 3 | Bandwidth and topological bandwidth of graphs with few P 4's |
Kloks, Ton |
2001 |
115 | 1-3 |
p. 117-133 17 p. |
article |
|
| 4 | Bipartition constrained edge-splitting in directed graphs |
Gabow, Harold N. |
2001 |
115 | 1-3 |
p. 49-62 14 p. |
article |
|
| 5 | Combinatorial problems related to origin–destination matrices |
Boros, Endre |
2001 |
115 | 1-3 |
p. 15-36 22 p. |
article |
|
| 6 | Crossing-free segments and triangles in point configurations |
Károlyi, Gyula |
2001 |
115 | 1-3 |
p. 77-88 12 p. |
article |
|
| 7 | Lengths of tours and permutations on a vertex set of a convex polygon |
Hiro, Ito |
2001 |
115 | 1-3 |
p. 63-71 9 p. |
article |
|
| 8 | On kernel-less clique-acyclic orientations of minimally imperfect graphs |
Sakuma, Tadashi |
2001 |
115 | 1-3 |
p. 209-219 11 p. |
article |
|
| 9 | On the binary solitaire cone |
Avis, David |
2001 |
115 | 1-3 |
p. 3-14 12 p. |
article |
|
| 10 | Preface |
Katoh, Naoki |
2001 |
115 | 1-3 |
p. 1- 1 p. |
article |
|
| 11 | Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati–Tardella |
Murota, Kazuo |
2001 |
115 | 1-3 |
p. 151-176 26 p. |
article |
|
| 12 | Rigidity of multi-story buildings |
Radics, Norbert |
2001 |
115 | 1-3 |
p. 187-198 12 p. |
article |
|
| 13 | Some polynomially solvable subcases of the detailed routing problem in VLSI design |
Recski, András |
2001 |
115 | 1-3 |
p. 199-208 10 p. |
article |
|
| 14 | Spanning trees with constraints on the leaf degree |
Kaneko, Atsushi |
2001 |
115 | 1-3 |
p. 73-76 4 p. |
article |
|
| 15 | Subdivisions of integral base polytopes |
Kashiwabara, Kenji |
2001 |
115 | 1-3 |
p. 89-97 9 p. |
article |
|
| 16 | The edge-disjoint paths problem is NP-complete for series–parallel graphs |
Nishizeki, Takao |
2001 |
115 | 1-3 |
p. 177-186 10 p. |
article |
|
| 17 | Topological optimization with a network reliability constraint |
Koide, T. |
2001 |
115 | 1-3 |
p. 135-149 15 p. |
article |
17 results found