|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
18 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem |
Erdoğan, Güneş |
2010 |
158 | 15 |
p. 1599-1614 16 p. |
article |
|
| 2 | A note on the weakly convex and convex domination numbers of a torus |
Raczek, Joanna |
2010 |
158 | 15 |
p. 1708-1713 6 p. |
article |
|
| 3 | Computing an eigenvector of an inverse Monge matrix in max–plus algebra |
Imaev, Aleksey A. |
2010 |
158 | 15 |
p. 1701-1707 7 p. |
article |
|
| 4 | Contents |
2010 |
158 | 15 |
p. v-vi nvt p. |
article |
||
| 5 | Disjoint dominating and total dominating sets in graphs |
Henning, Michael A. |
2010 |
158 | 15 |
p. 1615-1623 9 p. |
article |
|
| 6 | Finding monotone paths in edge-ordered graphs |
Katrenič, J. |
2010 |
158 | 15 |
p. 1624-1632 9 p. |
article |
|
| 7 | Matching interdiction |
Zenklusen, Rico |
2010 |
158 | 15 |
p. 1676-1690 15 p. |
article |
|
| 8 | On orthogonal ray graphs |
Shrestha, Anish Man Singh |
2010 |
158 | 15 |
p. 1650-1659 10 p. |
article |
|
| 9 | Ordering connected graphs having small degree distances |
Tomescu, Ioan |
2010 |
158 | 15 |
p. 1714-1717 4 p. |
article |
|
| 10 | Random walks and the effective resistance sum rules |
Chen, Haiyan |
2010 |
158 | 15 |
p. 1691-1700 10 p. |
article |
|
| 11 | Recognizing line-polar bipartite graphs in time O ( n ) |
Ekim, Tınaz |
2010 |
158 | 15 |
p. 1593-1598 6 p. |
article |
|
| 12 | Sorting with networks of data structures |
Biedl, Therese |
2010 |
158 | 15 |
p. 1579-1586 8 p. |
article |
|
| 13 | Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph |
Takata, Ken |
2010 |
158 | 15 |
p. 1660-1667 8 p. |
article |
|
| 14 | The k -in-a-tree problem for graphs of girth at least k |
Liu, W. |
2010 |
158 | 15 |
p. 1644-1649 6 p. |
article |
|
| 15 | The smallest values of algebraic connectivity for unicyclic graphs |
Li, Jianxi |
2010 |
158 | 15 |
p. 1633-1643 11 p. |
article |
|
| 16 | The Zagreb coindices of graph operations |
Ashrafi, A.R. |
2010 |
158 | 15 |
p. 1571-1578 8 p. |
article |
|
| 17 | Tighter bounds of the First Fit algorithm for the bin-packing problem |
Xia, Binzhou |
2010 |
158 | 15 |
p. 1668-1675 8 p. |
article |
|
| 18 | Total domination critical and stable graphs upon edge removal |
Desormeaux, Wyatt J. |
2010 |
158 | 15 |
p. 1587-1592 6 p. |
article |
18 results found