|
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 comparison of lower bounds for the symmetric circulant traveling salesman problem |
de Klerk, Etienne |
2011 |
159 | 16 |
p. 1815-1826 12 p. |
article |
|
| 2 | Acyclic and star colorings of cographs |
Lyons, Andrew |
2011 |
159 | 16 |
p. 1842-1850 9 p. |
article |
|
| 3 | A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems |
Ben-Ameur, Walid |
2011 |
159 | 16 |
p. 1689-1698 10 p. |
article |
|
| 4 | A system-theoretic model for cooperation, interaction and allocation |
Faigle, Ulrich |
2011 |
159 | 16 |
p. 1736-1750 15 p. |
article |
|
| 5 | Average update times for fully-dynamic all-pairs shortest paths |
Friedrich, Tobias |
2011 |
159 | 16 |
p. 1751-1758 8 p. |
article |
|
| 6 | Competitive subset selection with two agents |
Nicosia, Gaia |
2011 |
159 | 16 |
p. 1865-1877 13 p. |
article |
|
| 7 | Contents |
2011 |
159 | 16 |
p. v-vi nvt p. |
article |
||
| 8 | Extremal P 4 -stable graphs |
Horváth, Illés |
2011 |
159 | 16 |
p. 1786-1792 7 p. |
article |
|
| 9 | Flow hypergraph reducibility |
Guedes, A.L.P. |
2011 |
159 | 16 |
p. 1775-1785 11 p. |
article |
|
| 10 | Frugal, acyclic and star colourings of graphs |
Kang, Ross J. |
2011 |
159 | 16 |
p. 1806-1814 9 p. |
article |
|
| 11 | Hamiltonian properties of locally connected graphs with bounded vertex degree |
Gordon, Valery S. |
2011 |
159 | 16 |
p. 1759-1774 16 p. |
article |
|
| 12 | L ( 2 , 1 ) -labeling of perfect elimination bipartite graphs |
Panda, B.S. |
2011 |
159 | 16 |
p. 1878-1888 11 p. |
article |
|
| 13 | Local protein threading by Mixed Integer Programming |
Collet, G. |
2011 |
159 | 16 |
p. 1707-1716 10 p. |
article |
|
| 14 | On resistance of graphs |
Petrosyan, P.A. |
2011 |
159 | 16 |
p. 1889-1900 12 p. |
article |
|
| 15 | On the forbidden induced subgraph sandwich problem |
Dantas, Simone |
2011 |
159 | 16 |
p. 1717-1725 9 p. |
article |
|
| 16 | On the sizes of graphs and their powers: The undirected case |
Auger, David |
2011 |
159 | 16 |
p. 1666-1675 10 p. |
article |
|
| 17 | On two-stage stochastic knapsack problems |
Kosuch, S. |
2011 |
159 | 16 |
p. 1827-1841 15 p. |
article |
|
| 18 | Partial characterizations of circle graphs |
Bonomo, Flavia |
2011 |
159 | 16 |
p. 1699-1706 8 p. |
article |
|
| 19 | Paths, trees and matchings under disjunctive constraints |
Darmann, Andreas |
2011 |
159 | 16 |
p. 1726-1735 10 p. |
article |
|
| 20 | Searching for mobile intruders in circular corridors by two 1-searchers |
Jiang, Bo |
2011 |
159 | 16 |
p. 1793-1805 13 p. |
article |
|
| 21 | 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009) |
Cafieri, Sonia |
2011 |
159 | 16 |
p. 1659- 1 p. |
article |
|
| 22 | The game chromatic index of wheels |
Andres, Stephan Dominique |
2011 |
159 | 16 |
p. 1660-1665 6 p. |
article |
|
| 23 | The number of excellent discrete Morse functions on graphs |
Ayala, R. |
2011 |
159 | 16 |
p. 1676-1688 13 p. |
article |
|
| 24 | The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm |
Simonetti, L. |
2011 |
159 | 16 |
p. 1901-1914 14 p. |
article |
|
| 25 | Total chromatic number of unichord-free graphs |
Machado, R.C.S. |
2011 |
159 | 16 |
p. 1851-1864 14 p. |
article |
25 results found