| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
|
Brimkov, Valentin
|
|
2007
|
155 |
14 |
p. 1812-1825
14 p.
|
article
|
| 2 |
Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks
|
Lozovanu, Dmitrii
|
|
2007
|
155 |
14 |
p. 1846-1857
12 p.
|
article
|
| 3 |
An efficient condition for a graph to be Hamiltonian
|
Li, Shengjia
|
|
2007
|
155 |
14 |
p. 1842-1845
4 p.
|
article
|
| 4 |
Contents
|
|
|
2007
|
155 |
14 |
p. v-
1 p.
|
article
|
| 5 |
Each maximal planar graph with exactly two separating triangles is Hamiltonian
|
Helden, Guido
|
|
2007
|
155 |
14 |
p. 1833-1836
4 p.
|
article
|
| 6 |
Guest Editors Listing for 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004) Guest Edited by Ulrich Faigle, Leo Liberti, Francesco Maffioli, and Stefan Pickl
|
|
|
2007
|
155 |
14 |
p. 1794-
1 p.
|
article
|
| 7 |
Memory management optimization problems for integrated circuit simulators
|
Bossart, Timothée
|
|
2007
|
155 |
14 |
p. 1795-1811
17 p.
|
article
|
| 8 |
New formulations for the Kissing Number Problem
|
Kucherenko, Sergei
|
|
2007
|
155 |
14 |
p. 1837-1841
5 p.
|
article
|
| 9 |
[No title]
|
|
|
2007
|
155 |
14 |
p. 1793-
1 p.
|
article
|
| 10 |
On powers of graphs of bounded NLC-width (clique-width)
|
Suchan, Karol
|
|
2007
|
155 |
14 |
p. 1885-1893
9 p.
|
article
|
| 11 |
On the generation of bicliques of a graph
|
Dias, Vânia M.F.
|
|
2007
|
155 |
14 |
p. 1826-1832
7 p.
|
article
|
| 12 |
On the parallel computation of the biconnected and strongly connected co-components of graphs
|
Nikolopoulos, Stavros D.
|
|
2007
|
155 |
14 |
p. 1858-1877
20 p.
|
article
|
| 13 |
Path–kipas Ramsey numbers
|
Salman, A.N.M.
|
|
2007
|
155 |
14 |
p. 1878-1884
7 p.
|
article
|
Journal description