|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Computing simple paths from given points inside a polygon |
Tan, Xuehou |
2019 |
252 | C |
p. 67-76 |
article |
|
| 2 | Domination in some subclasses of bipartite graphs |
Pandey, Arti |
2019 |
252 | C |
p. 51-66 |
article |
|
| 3 | Editorial Board |
2019 |
252 | C |
p. ii |
article |
||
| 4 | New inequalities for network distance measures by using graph spectra |
Dehmer, Matthias |
2019 |
252 | C |
p. 17-27 |
article |
|
| 5 | On one extension of Dirac’s theorem on Hamiltonicity |
Büyükçolak, Yasemin |
2019 |
252 | C |
p. 10-16 |
article |
|
| 6 | On the reliability of generalized Petersen graphs |
Boruzanlı Ekinci, Gülnaz |
2019 |
252 | C |
p. 2-9 |
article |
|
| 7 | Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015) |
Duman, Ekrem |
2019 |
252 | C |
p. 1 |
article |
|
| 8 | Rank aggregation: New bounds for MCx |
Freund, Daniel |
2019 |
252 | C |
p. 28-36 |
article |
|
| 9 | Solving the integrated shipment routing problem of a less-than-truckload carrier |
Özener, Okan Örsan |
2019 |
252 | C |
p. 37-50 |
article |
9 results found