| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A connection between circular colorings and periodic schedules
|
Yeh, Hong-Gwa
|
|
2009
|
157 |
7 |
p. 1663-1668
6 p.
|
article
|
| 2 |
An improved randomized approximation algorithm for maximum triangle packing
|
Chen, Zhi-Zhong
|
|
2009
|
157 |
7 |
p. 1640-1646
7 p.
|
article
|
| 3 |
Approximation algorithms and hardness results for the clique packing problem
|
Chataigner, F.
|
|
2009
|
157 |
7 |
p. 1396-1406
11 p.
|
article
|
| 4 |
Approximation algorithms for constrained generalized tree alignment problem
|
Divakaran, Srikrishnan
|
|
2009
|
157 |
7 |
p. 1407-1422
16 p.
|
article
|
| 5 |
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
|
Sun, Lingli
|
|
2009
|
157 |
7 |
p. 1650-1654
5 p.
|
article
|
| 6 |
Conflict-free coloring of unit disks
|
Lev-Tov, Nissan
|
|
2009
|
157 |
7 |
p. 1521-1532
12 p.
|
article
|
| 7 |
Conjugated trees with minimum general Randić index
|
Chen, Xiaodan
|
|
2009
|
157 |
7 |
p. 1379-1386
8 p.
|
article
|
| 8 |
Contents
|
|
|
2009
|
157 |
7 |
p. vii-ix
nvt p.
|
article
|
| 9 |
Corrigendum to “Variable space search for graph coloring” [Discrete Appl. Math. 156 (2008) 2551–2560]
|
Hertz, Alain
|
|
2009
|
157 |
7 |
p. 1335-1336
2 p.
|
article
|
| 10 |
Editorial Board
|
|
|
2009
|
157 |
7 |
p. v-vi
nvt p.
|
article
|
| 11 |
Enumeration aspects of maximal cliques and bicliques
|
Gély, Alain
|
|
2009
|
157 |
7 |
p. 1447-1459
13 p.
|
article
|
| 12 |
Exact wirelength of hypercubes on a grid
|
Manuel, Paul
|
|
2009
|
157 |
7 |
p. 1486-1495
10 p.
|
article
|
| 13 |
Extension problems with degree bounds
|
Feder, Tomas
|
|
2009
|
157 |
7 |
p. 1592-1599
8 p.
|
article
|
| 14 |
Gray codes for non-crossing partitions and dissections of a convex polygon
|
Huemer, Clemens
|
|
2009
|
157 |
7 |
p. 1509-1520
12 p.
|
article
|
| 15 |
Improved book-embeddings of incomplete hypercubes
|
Hasunuma, Toru
|
|
2009
|
157 |
7 |
p. 1423-1431
9 p.
|
article
|
| 16 |
Irreversible
k
-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
|
Dreyer Jr., Paul A.
|
|
2009
|
157 |
7 |
p. 1615-1627
13 p.
|
article
|
| 17 |
Kinetic maintenance of mobile
k
-centres on trees
|
Durocher, Stephane
|
|
2009
|
157 |
7 |
p. 1432-1446
15 p.
|
article
|
| 18 |
Laminar structure of ptolemaic graphs with applications
|
Uehara, Ryuhei
|
|
2009
|
157 |
7 |
p. 1533-1543
11 p.
|
article
|
| 19 |
Lower bounds for three algorithms for transversal hypergraph generation
|
Hagen, Matthias
|
|
2009
|
157 |
7 |
p. 1460-1469
10 p.
|
article
|
| 20 |
Minimum-weight cycle covers and their approximability
|
Manthey, Bodo
|
|
2009
|
157 |
7 |
p. 1470-1480
11 p.
|
article
|
| 21 |
Molecular graphs and the inverse Wiener index problem
|
Wagner, Stephan G.
|
|
2009
|
157 |
7 |
p. 1544-1554
11 p.
|
article
|
| 22 |
Nonadaptive algorithms for threshold group testing
|
Chen, Hong-Bin
|
|
2009
|
157 |
7 |
p. 1581-1585
5 p.
|
article
|
| 23 |
On intermediate factorial languages
|
Shur, Arseny M.
|
|
2009
|
157 |
7 |
p. 1669-1675
7 p.
|
article
|
| 24 |
On randomized algorithms for the majority problem
|
Christofides, Demetres
|
|
2009
|
157 |
7 |
p. 1481-1485
5 p.
|
article
|
| 25 |
On reciprocal complementary Wiener number
|
Zhou, Bo
|
|
2009
|
157 |
7 |
p. 1628-1633
6 p.
|
article
|
| 26 |
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
|
Guillemot, Sylvain
|
|
2009
|
157 |
7 |
p. 1555-1570
16 p.
|
article
|
| 27 |
On the diameter of a domination dot-critical graph
|
Jafari Rad, Nader
|
|
2009
|
157 |
7 |
p. 1647-1649
3 p.
|
article
|
| 28 |
On the number of connected convex subgraphs of a connected acyclic digraph
|
Gutin, Gregory
|
|
2009
|
157 |
7 |
p. 1660-1662
3 p.
|
article
|
| 29 |
On the 3-restricted edge connectivity of permutation graphs
|
Balbuena, C.
|
|
2009
|
157 |
7 |
p. 1586-1591
6 p.
|
article
|
| 30 |
On the spanning fan-connectivity of graphs
|
Lin, Cheng-Kuan
|
|
2009
|
157 |
7 |
p. 1342-1348
7 p.
|
article
|
| 31 |
Polynomial reduction of time–space scheduling to time scheduling
|
Studenovský, J.
|
|
2009
|
157 |
7 |
p. 1364-1378
15 p.
|
article
|
| 32 |
RNA secondary structure, permutations, and statistics
|
Willenbring, Robert
|
|
2009
|
157 |
7 |
p. 1607-1614
8 p.
|
article
|
| 33 |
Short containers in Cayley graphs
|
Gao, Shuhong
|
|
2009
|
157 |
7 |
p. 1354-1363
10 p.
|
article
|
| 34 |
Simple games and weighted games: A theoretical and computational viewpoint
|
Freixas, Josep
|
|
2009
|
157 |
7 |
p. 1496-1508
13 p.
|
article
|
| 35 |
Superconnectivity of regular graphs with small diameter
|
Balbuena, Camino
|
|
2009
|
157 |
7 |
p. 1349-1353
5 p.
|
article
|
| 36 |
The competition number of a graph with exactly
h
holes, all of which are independent
|
Li, Bo-Jr
|
|
2009
|
157 |
7 |
p. 1337-1341
5 p.
|
article
|
| 37 |
The number of independent sets in unicyclic graphs with a given diameter
|
Li, Shuchao
|
|
2009
|
157 |
7 |
p. 1387-1395
9 p.
|
article
|
| 38 |
The upper connected geodetic number and forcing connected geodetic number of a graph
|
Santhakumaran, A.P.
|
|
2009
|
157 |
7 |
p. 1571-1580
10 p.
|
article
|
| 39 |
The vertex PI index and Szeged index of bridge graphs
|
Mansour, Toufik
|
|
2009
|
157 |
7 |
p. 1600-1606
7 p.
|
article
|
| 40 |
Upper bounds on the
k
-domination number and the
k
-Roman domination number
|
Hansberg, Adriana
|
|
2009
|
157 |
7 |
p. 1634-1639
6 p.
|
article
|
| 41 |
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
|
Denman, Richard
|
|
2009
|
157 |
7 |
p. 1655-1659
5 p.
|
article
|
Journal description