|
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 | Branchwidth of chordal graphs |
Paul, Christophe |
2009 |
157 | 12 |
p. 2718-2725 8 p. |
article |
|
| 2 | Computing branchwidth via efficient triangulations and blocks |
Fomin, Fedor V. |
2009 |
157 | 12 |
p. 2726-2736 11 p. |
article |
|
| 3 | Connected graph searching in chordal graphs |
Nisse, Nicolas |
2009 |
157 | 12 |
p. 2603-2610 8 p. |
article |
|
| 4 | Contents |
2009 |
157 | 12 |
p. v-vi nvt p. |
article |
||
| 5 | Distance constrained labelings of planar graphs with no short cycles |
Dvořák, Zdeněk |
2009 |
157 | 12 |
p. 2634-2645 12 p. |
article |
|
| 6 | Finding the longest isometric cycle in a graph |
Lokshtanov, Daniel |
2009 |
157 | 12 |
p. 2670-2674 5 p. |
article |
|
| 7 | Graph labellings with variable weights, a survey |
Griggs, Jerrold R. |
2009 |
157 | 12 |
p. 2646-2658 13 p. |
article |
|
| 8 | Guest editors’ foreword |
Kratochvíl, Jan |
2009 |
157 | 12 |
p. 2575-2576 2 p. |
article |
|
| 9 | Linear delay enumeration and monadic second-order logic |
Courcelle, Bruno |
2009 |
157 | 12 |
p. 2675-2700 26 p. |
article |
|
| 10 | Minimal split completions |
Heggernes, Pinar |
2009 |
157 | 12 |
p. 2659-2669 11 p. |
article |
|
| 11 | Minors of simplicial complexes |
Kaiser, Tomáš |
2009 |
157 | 12 |
p. 2597-2602 6 p. |
article |
|
| 12 | On minimizing the number of ADMs in a general topology optical network |
Flammini, Michele |
2009 |
157 | 12 |
p. 2701-2717 17 p. |
article |
|
| 13 | On probe permutation graphs |
Chandler, David B. |
2009 |
157 | 12 |
p. 2611-2619 9 p. |
article |
|
| 14 | Partitioning graphs of supply and demand |
Ito, Takehiro |
2009 |
157 | 12 |
p. 2620-2633 14 p. |
article |
|
| 15 | Recent developments on graphs of bounded clique-width |
Kamiński, Marcin |
2009 |
157 | 12 |
p. 2747-2761 15 p. |
article |
|
| 16 | Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm |
Dorn, Frederic |
2009 |
157 | 12 |
p. 2737-2746 10 p. |
article |
|
| 17 | Tree-width of graphs without a 3×3 grid minor |
Birmelé, E. |
2009 |
157 | 12 |
p. 2577-2596 20 p. |
article |
17 results found