|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
42 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs |
Klavžar, Sandi |
2012 |
160 | 7-8 |
p. 1277-1280 4 p. |
article |
|
| 2 | Acute triangulations of convex quadrilaterals |
Cavicchioli, Maddalena |
2012 |
160 | 7-8 |
p. 1253-1256 4 p. |
article |
|
| 3 | Acyclic edge coloring of planar graphs without 5-cycles |
Shu, Qiaojun |
2012 |
160 | 7-8 |
p. 1211-1223 13 p. |
article |
|
| 4 | An approximation algorithm for the Generalized k -Multicut problem |
Zhang, Peng |
2012 |
160 | 7-8 |
p. 1240-1247 8 p. |
article |
|
| 5 | An improved on-line algorithm for single parallel-batch machine scheduling with delivery times |
Tian, Ji |
2012 |
160 | 7-8 |
p. 1191-1210 20 p. |
article |
|
| 6 | A note on entire choosability of plane graphs |
Dong, Wei |
2012 |
160 | 7-8 |
p. 1257-1261 5 p. |
article |
|
| 7 | A note on planar graphs with large width parameters and small grid-minors |
Grigoriev, Alexander |
2012 |
160 | 7-8 |
p. 1262-1269 8 p. |
article |
|
| 8 | A parallelogram tile fills the plane by translation in at most two distinct ways |
Blondin Massé, A. |
2012 |
160 | 7-8 |
p. 1011-1018 8 p. |
article |
|
| 9 | Approximation algorithms for a geometric set cover problem |
Brimkov, Valentin E. |
2012 |
160 | 7-8 |
p. 1039-1052 14 p. |
article |
|
| 10 | Condorcet domains of tiling type |
Danilov, Vladimir I. |
2012 |
160 | 7-8 |
p. 933-940 8 p. |
article |
|
| 11 | Contents |
2012 |
160 | 7-8 |
p. v-vi nvt p. |
article |
||
| 12 | Cooperative location games based on the minimum diameter spanning Steiner subgraph problem |
Puerto, Justo |
2012 |
160 | 7-8 |
p. 970-979 10 p. |
article |
|
| 13 | Cournot tâtonnement and dominance solvability in finite games |
Kukushkin, Nikolai S. |
2012 |
160 | 7-8 |
p. 948-958 11 p. |
article |
|
| 14 | Directed domination in oriented graphs |
Caro, Yair |
2012 |
160 | 7-8 |
p. 1053-1063 11 p. |
article |
|
| 15 | Edge contractions in subclasses of chordal graphs |
Belmonte, Rémy |
2012 |
160 | 7-8 |
p. 999-1010 12 p. |
article |
|
| 16 | Further generalizations of the Wythoff game and the minimum excludant |
Gurvich, Vladimir |
2012 |
160 | 7-8 |
p. 941-947 7 p. |
article |
|
| 17 | Kernelization for cycle transversal problems |
Xia, Ge |
2012 |
160 | 7-8 |
p. 1224-1231 8 p. |
article |
|
| 18 | k -Rainbow domatic numbers |
Fujita, Shinya |
2012 |
160 | 7-8 |
p. 1104-1113 10 p. |
article |
|
| 19 | Minimum decomposition into convex binary matrices |
Jarray, Fethi |
2012 |
160 | 7-8 |
p. 1164-1175 12 p. |
article |
|
| 20 | Multiple factor Nordhaus–Gaddum type results for domination and total domination |
Henning, Michael A. |
2012 |
160 | 7-8 |
p. 1137-1142 6 p. |
article |
|
| 21 | On dynamic coloring for planar graphs and graphs of higher genus |
Chen, Ye |
2012 |
160 | 7-8 |
p. 1064-1071 8 p. |
article |
|
| 22 | On graphs for which the connected domination number is at most the total domination number |
Schaudt, Oliver |
2012 |
160 | 7-8 |
p. 1281-1284 4 p. |
article |
|
| 23 | On the connectivity of p -diamond-free vertex transitive graphs |
Tian, Yingzhi |
2012 |
160 | 7-8 |
p. 1285-1290 6 p. |
article |
|
| 24 | On the difference of the domination number of a digraph and of its reverse |
Gyürki, Štefan |
2012 |
160 | 7-8 |
p. 1270-1276 7 p. |
article |
|
| 25 | On the number of blocks required to access the core |
Béal, Sylvain |
2012 |
160 | 7-8 |
p. 925-932 8 p. |
article |
|
| 26 | On the online track assignment problem |
Demange, Marc |
2012 |
160 | 7-8 |
p. 1072-1093 22 p. |
article |
|
| 27 | On the reciprocal degree distance of graphs |
Hua, Hongbo |
2012 |
160 | 7-8 |
p. 1152-1163 12 p. |
article |
|
| 28 | On α -total domination in graphs |
Henning, Michael A. |
2012 |
160 | 7-8 |
p. 1143-1151 9 p. |
article |
|
| 29 | Proximity thresholds for matching extension in the torus and Klein bottle |
Aldred, R.E.L. |
2012 |
160 | 7-8 |
p. 985-991 7 p. |
article |
|
| 30 | Recursive method to solve the problem of “Gambling with God” |
Shao, Huang |
2012 |
160 | 7-8 |
p. 980-984 5 p. |
article |
|
| 31 | Spans of preference functions for de Bruijn sequences |
Alhakim, Abbas |
2012 |
160 | 7-8 |
p. 992-998 7 p. |
article |
|
| 32 | Super restricted edge connectivity of regular edge-transitive graphs |
Zhou, Jin-Xin |
2012 |
160 | 7-8 |
p. 1248-1252 5 p. |
article |
|
| 33 | Testability of minimum balanced multiway cut densities |
Bolla, Marianna |
2012 |
160 | 7-8 |
p. 1019-1027 9 p. |
article |
|
| 34 | The asymptotic behavior of some indices of iterated line graphs of regular graphs |
Yan, Weigen |
2012 |
160 | 7-8 |
p. 1232-1239 8 p. |
article |
|
| 35 | The bottleneck 2-connected k -Steiner network problem for k ≤ 2 |
Brazil, M. |
2012 |
160 | 7-8 |
p. 1028-1038 11 p. |
article |
|
| 36 | The competition numbers of complete multipartite graphs with many partite sets |
Kim, Suh-Ryung |
2012 |
160 | 7-8 |
p. 1176-1182 7 p. |
article |
|
| 37 | The complexity of flood-filling games on graphs |
Meeks, Kitty |
2012 |
160 | 7-8 |
p. 959-969 11 p. |
article |
|
| 38 | The interval ordering problem |
Dürr, Christoph |
2012 |
160 | 7-8 |
p. 1094-1103 10 p. |
article |
|
| 39 | The stochastic generalized bin packing problem |
Perboli, Guido |
2012 |
160 | 7-8 |
p. 1291-1297 7 p. |
article |
|
| 40 | The sum choice number of P 3 □ P n |
Heinold, Brian |
2012 |
160 | 7-8 |
p. 1126-1136 11 p. |
article |
|
| 41 | Vertex covers and eternal dominating sets |
Klostermeyer, William F. |
2012 |
160 | 7-8 |
p. 1183-1190 8 p. |
article |
|
| 42 | Vertex-magic labeling of regular graphs: Disjoint unions and assemblages |
Gray, I.D. |
2012 |
160 | 7-8 |
p. 1114-1125 12 p. |
article |
42 results found