|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
74 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 |
1-10 | 7-8 |
p. 1277-1280 4 p. |
article |
|
| 2 | Acute triangulations of convex quadrilaterals |
Cavicchioli, Maddalena |
2012 |
1-10 | 7-8 |
p. 1253-1256 4 p. |
article |
|
| 3 | Acyclic edge coloring of planar graphs without 5-cycles |
Shu, Qiaojun |
2012 |
1-10 | 7-8 |
p. 1211-1223 13 p. |
article |
|
| 4 | Affine inequivalence of cubic Maiorana–McFarland type bent functions |
Gangopadhyay, Sugata |
2013 |
1-10 | 7-8 |
p. 1141-1146 6 p. |
article |
|
| 5 | A linear-time algorithm for finding an edge-partition with max-min ratio at most two |
Chu, An-Chiang |
2013 |
1-10 | 7-8 |
p. 932-943 12 p. |
article |
|
| 6 | An approximation algorithm for the Generalized k -Multicut problem |
Zhang, Peng |
2012 |
1-10 | 7-8 |
p. 1240-1247 8 p. |
article |
|
| 7 | An extension of A.R. Rao’s characterization of potentially K m + 1 -graphic sequences |
Yin, Jian-Hua |
2013 |
1-10 | 7-8 |
p. 1118-1127 10 p. |
article |
|
| 8 | An improved on-line algorithm for single parallel-batch machine scheduling with delivery times |
Tian, Ji |
2012 |
1-10 | 7-8 |
p. 1191-1210 20 p. |
article |
|
| 9 | A note on approximating the b -chromatic number |
Galčík, František |
2013 |
1-10 | 7-8 |
p. 1137-1140 4 p. |
article |
|
| 10 | A note on entire choosability of plane graphs |
Dong, Wei |
2012 |
1-10 | 7-8 |
p. 1257-1261 5 p. |
article |
|
| 11 | A note on planar graphs with large width parameters and small grid-minors |
Grigoriev, Alexander |
2012 |
1-10 | 7-8 |
p. 1262-1269 8 p. |
article |
|
| 12 | A parallelogram tile fills the plane by translation in at most two distinct ways |
Blondin Massé, A. |
2012 |
1-10 | 7-8 |
p. 1011-1018 8 p. |
article |
|
| 13 | Approximation algorithms for a geometric set cover problem |
Brimkov, Valentin E. |
2012 |
1-10 | 7-8 |
p. 1039-1052 14 p. |
article |
|
| 14 | b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture |
Lin, Wu-Hsiung |
2013 |
1-10 | 7-8 |
p. 1060-1066 7 p. |
article |
|
| 15 | Commute times of random walks on trees |
Konsowa, Mokhtar |
2013 |
1-10 | 7-8 |
p. 1014-1021 8 p. |
article |
|
| 16 | Condorcet domains of tiling type |
Danilov, Vladimir I. |
2012 |
1-10 | 7-8 |
p. 933-940 8 p. |
article |
|
| 17 | Contents |
2012 |
1-10 | 7-8 |
p. v-vi nvt p. |
article |
||
| 18 | Cooperative location games based on the minimum diameter spanning Steiner subgraph problem |
Puerto, Justo |
2012 |
1-10 | 7-8 |
p. 970-979 10 p. |
article |
|
| 19 | Corner cuts are close to optimal: From solid grids to polygons and back |
Feldmann, Andreas Emil |
2013 |
1-10 | 7-8 |
p. 970-998 29 p. |
article |
|
| 20 | Cournot tâtonnement and dominance solvability in finite games |
Kukushkin, Nikolai S. |
2012 |
1-10 | 7-8 |
p. 948-958 11 p. |
article |
|
| 21 | Directed domination in oriented graphs |
Caro, Yair |
2012 |
1-10 | 7-8 |
p. 1053-1063 11 p. |
article |
|
| 22 | Edge contractions in subclasses of chordal graphs |
Belmonte, Rémy |
2012 |
1-10 | 7-8 |
p. 999-1010 12 p. |
article |
|
| 23 | Editorial Board |
2013 |
1-10 | 7-8 |
p. v-vi nvt p. |
article |
||
| 24 | Finding lower bounds on the complexity of secret sharing schemes by linear programming |
Padró, Carles |
2013 |
1-10 | 7-8 |
p. 1072-1084 13 p. |
article |
|
| 25 | Finding the edge ranking number through vertex partitions |
Lin, Yo-Lin |
2013 |
1-10 | 7-8 |
p. 1067-1071 5 p. |
article |
|
| 26 | From kernels in directed graphs to fixed points and negative cycles in Boolean networks |
Richard, Adrien |
2013 |
1-10 | 7-8 |
p. 1106-1117 12 p. |
article |
|
| 27 | Further generalizations of the Wythoff game and the minimum excludant |
Gurvich, Vladimir |
2012 |
1-10 | 7-8 |
p. 941-947 7 p. |
article |
|
| 28 | Further results on hierarchical product of graphs |
Tavakoli, M. |
2013 |
1-10 | 7-8 |
p. 1162-1167 6 p. |
article |
|
| 29 | Integral mixed unit interval graphs |
Le, Van Bang |
2013 |
1-10 | 7-8 |
p. 1028-1036 9 p. |
article |
|
| 30 | Kernelization for cycle transversal problems |
Xia, Ge |
2012 |
1-10 | 7-8 |
p. 1224-1231 8 p. |
article |
|
| 31 | k -Rainbow domatic numbers |
Fujita, Shinya |
2012 |
1-10 | 7-8 |
p. 1104-1113 10 p. |
article |
|
| 32 | LAD models, trees, and an analog of the fundamental theorem of arithmetic |
Brauner, Nadia |
2013 |
1-10 | 7-8 |
p. 909-920 12 p. |
article |
|
| 33 | Liar’s domination in graphs: Complexity and algorithm |
Panda, B.S. |
2013 |
1-10 | 7-8 |
p. 1085-1092 8 p. |
article |
|
| 34 | Minimum decomposition into convex binary matrices |
Jarray, Fethi |
2012 |
1-10 | 7-8 |
p. 1164-1175 12 p. |
article |
|
| 35 | Multiple factor Nordhaus–Gaddum type results for domination and total domination |
Henning, Michael A. |
2012 |
1-10 | 7-8 |
p. 1137-1142 6 p. |
article |
|
| 36 | Normal Helly circular-arc graphs and its subclasses |
Lin, Min Chih |
2013 |
1-10 | 7-8 |
p. 1037-1059 23 p. |
article |
|
| 37 | On dynamic coloring for planar graphs and graphs of higher genus |
Chen, Ye |
2012 |
1-10 | 7-8 |
p. 1064-1071 8 p. |
article |
|
| 38 | On graphs for which the connected domination number is at most the total domination number |
Schaudt, Oliver |
2012 |
1-10 | 7-8 |
p. 1281-1284 4 p. |
article |
|
| 39 | On the complexity of computing the temporal hybridization number for two phylogenies |
Humphries, Peter J. |
2013 |
1-10 | 7-8 |
p. 871-880 10 p. |
article |
|
| 40 | On the complexity of recognizing S-composite and S-prime graphs |
Hellmuth, Marc |
2013 |
1-10 | 7-8 |
p. 1006-1013 8 p. |
article |
|
| 41 | On the connectivity of p -diamond-free vertex transitive graphs |
Tian, Yingzhi |
2012 |
1-10 | 7-8 |
p. 1285-1290 6 p. |
article |
|
| 42 | On the difference of the domination number of a digraph and of its reverse |
Gyürki, Štefan |
2012 |
1-10 | 7-8 |
p. 1270-1276 7 p. |
article |
|
| 43 | On the L ( 2 , 1 ) -labelings of amalgamations of graphs |
Adams, Sarah Spence |
2013 |
1-10 | 7-8 |
p. 881-888 8 p. |
article |
|
| 44 | On the number of blocks required to access the core |
Béal, Sylvain |
2012 |
1-10 | 7-8 |
p. 925-932 8 p. |
article |
|
| 45 | On the online track assignment problem |
Demange, Marc |
2012 |
1-10 | 7-8 |
p. 1072-1093 22 p. |
article |
|
| 46 | On the reciprocal degree distance of graphs |
Hua, Hongbo |
2012 |
1-10 | 7-8 |
p. 1152-1163 12 p. |
article |
|
| 47 | On the strong metric dimension of corona product graphs and join graphs |
Kuziak, Dorota |
2013 |
1-10 | 7-8 |
p. 1022-1027 6 p. |
article |
|
| 48 | On the t -pebbling number and the 2 t -pebbling property of graphs |
Gao, Ze-Tu |
2013 |
1-10 | 7-8 |
p. 999-1005 7 p. |
article |
|
| 49 | On α -total domination in graphs |
Henning, Michael A. |
2012 |
1-10 | 7-8 |
p. 1143-1151 9 p. |
article |
|
| 50 | (2)-pancyclic graphs |
Zamfirescu, Carol T. |
2013 |
1-10 | 7-8 |
p. 1128-1136 9 p. |
article |
|
| 51 | Planar graphs without 4- and 5-cycles are acyclically 4-choosable |
Chen, Min |
2013 |
1-10 | 7-8 |
p. 921-931 11 p. |
article |
|
| 52 | Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index |
Divnić, Tomica R. |
2013 |
1-10 | 7-8 |
p. 953-960 8 p. |
article |
|
| 53 | Proximity thresholds for matching extension in the torus and Klein bottle |
Aldred, R.E.L. |
2012 |
1-10 | 7-8 |
p. 985-991 7 p. |
article |
|
| 54 | Quasi-hamiltonian paths in semicomplete multipartite digraphs |
Bang-Jensen, Jørgen |
2013 |
1-10 | 7-8 |
p. 889-898 10 p. |
article |
|
| 55 | Recursive method to solve the problem of “Gambling with God” |
Shao, Huang |
2012 |
1-10 | 7-8 |
p. 980-984 5 p. |
article |
|
| 56 | Right angle crossing graphs and 1-planarity |
Eades, Peter |
2013 |
1-10 | 7-8 |
p. 961-969 9 p. |
article |
|
| 57 | Spans of preference functions for de Bruijn sequences |
Alhakim, Abbas |
2012 |
1-10 | 7-8 |
p. 992-998 7 p. |
article |
|
| 58 | Strongly rigid tensegrity graphs on the line |
Jackson, Bill |
2013 |
1-10 | 7-8 |
p. 1147-1149 3 p. |
article |
|
| 59 | Strong matching preclusion under the conditional fault model |
Park, Jung-Heum |
2013 |
1-10 | 7-8 |
p. 1093-1105 13 p. |
article |
|
| 60 | Super restricted edge connectivity of regular edge-transitive graphs |
Zhou, Jin-Xin |
2012 |
1-10 | 7-8 |
p. 1248-1252 5 p. |
article |
|
| 61 | Testability of minimum balanced multiway cut densities |
Bolla, Marianna |
2012 |
1-10 | 7-8 |
p. 1019-1027 9 p. |
article |
|
| 62 | The asymptotic behavior of some indices of iterated line graphs of regular graphs |
Yan, Weigen |
2012 |
1-10 | 7-8 |
p. 1232-1239 8 p. |
article |
|
| 63 | The bottleneck 2-connected k -Steiner network problem for k ≤ 2 |
Brazil, M. |
2012 |
1-10 | 7-8 |
p. 1028-1038 11 p. |
article |
|
| 64 | The competition numbers of complete multipartite graphs with many partite sets |
Kim, Suh-Ryung |
2012 |
1-10 | 7-8 |
p. 1176-1182 7 p. |
article |
|
| 65 | The complexity of flood-filling games on graphs |
Meeks, Kitty |
2012 |
1-10 | 7-8 |
p. 959-969 11 p. |
article |
|
| 66 | The firefighter problem with more than one firefighter on trees |
Bazgan, Cristina |
2013 |
1-10 | 7-8 |
p. 899-908 10 p. |
article |
|
| 67 | The interval ordering problem |
Dürr, Christoph |
2012 |
1-10 | 7-8 |
p. 1094-1103 10 p. |
article |
|
| 68 | The stochastic generalized bin packing problem |
Perboli, Guido |
2012 |
1-10 | 7-8 |
p. 1291-1297 7 p. |
article |
|
| 69 | The sum choice number of P 3 □ P n |
Heinold, Brian |
2012 |
1-10 | 7-8 |
p. 1126-1136 11 p. |
article |
|
| 70 | Towards optimal kernel for connected vertex cover in planar graphs |
Kowalik, Łukasz |
2013 |
1-10 | 7-8 |
p. 1154-1161 8 p. |
article |
|
| 71 | Vertex covers and eternal dominating sets |
Klostermeyer, William F. |
2012 |
1-10 | 7-8 |
p. 1183-1190 8 p. |
article |
|
| 72 | Vertex-magic labeling of regular graphs: Disjoint unions and assemblages |
Gray, I.D. |
2012 |
1-10 | 7-8 |
p. 1114-1125 12 p. |
article |
|
| 73 | Wiener index versus Szeged index in networks |
Klavžar, Sandi |
2013 |
1-10 | 7-8 |
p. 1150-1153 4 p. |
article |
|
| 74 | Worst-case efficient dominating sets in digraphs |
Dejter, Italo J. |
2013 |
1-10 | 7-8 |
p. 944-952 9 p. |
article |
74 results found