|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
67 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Almost Hadamard matrices: The case of arbitrary exponents |
Banica, Teodor |
2013 |
96-97 | 16-17 |
p. 2367-2379 13 p. |
article |
|
| 2 | A majorization method for localizing graph topological indices |
Bianchi, Monica |
2013 |
96-97 | 16-17 |
p. 2731-2739 9 p. |
article |
|
| 3 | Analysis of a multi-category classifier |
Anthony, Martin |
2012 |
96-97 | 16-17 |
p. 2329-2338 10 p. |
article |
|
| 4 | Arc-disjoint paths and trees in 2-regular digraphs |
Bang-Jensen, Jørgen |
2013 |
96-97 | 16-17 |
p. 2724-2730 7 p. |
article |
|
| 5 | A recursion formula for resistance distances and its applications |
Yang, Yujun |
2013 |
96-97 | 16-17 |
p. 2702-2715 14 p. |
article |
|
| 6 | A Riemann hypothesis analogue for near-MDS codes |
Kim, Dong Chan |
2012 |
96-97 | 16-17 |
p. 2440-2444 5 p. |
article |
|
| 7 | A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems |
Puerto, J. |
2013 |
96-97 | 16-17 |
p. 2624-2646 23 p. |
article |
|
| 8 | b -chromatic numbers of powers of paths and cycles |
Lin, Wu-Hsiung |
2013 |
96-97 | 16-17 |
p. 2532-2536 5 p. |
article |
|
| 9 | Bicyclic graphs with maximal revised Szeged index |
Li, Xueliang |
2013 |
96-97 | 16-17 |
p. 2527-2531 5 p. |
article |
|
| 10 | Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes |
Li, Hao |
2013 |
96-97 | 16-17 |
p. 2753-2757 5 p. |
article |
|
| 11 | Bounds on neighborhood total domination in graphs |
Henning, Michael A. |
2013 |
96-97 | 16-17 |
p. 2460-2466 7 p. |
article |
|
| 12 | Characterization of removable elements with respect to having k disjoint bases in a matroid |
Li, Ping |
2012 |
96-97 | 16-17 |
p. 2445-2451 7 p. |
article |
|
| 13 | Compact MILP models for optimal and Pareto-optimal LAD patterns |
Guo, Cui |
2012 |
96-97 | 16-17 |
p. 2339-2348 10 p. |
article |
|
| 14 | Contents |
2013 |
96-97 | 16-17 |
p. v-vii nvt p. |
article |
||
| 15 | Contents |
2012 |
96-97 | 16-17 |
p. v-vi nvt p. |
article |
||
| 16 | Dense and sparse graph partition |
Darlay, Julien |
2012 |
96-97 | 16-17 |
p. 2389-2396 8 p. |
article |
|
| 17 | Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties |
Toutant, Jean-Luc |
2013 |
96-97 | 16-17 |
p. 2662-2677 16 p. |
article |
|
| 18 | Distance edge-colourings and matchings |
Kang, Ross J. |
2012 |
96-97 | 16-17 |
p. 2435-2439 5 p. |
article |
|
| 19 | Distance spectral spread of a graph |
Yu, Guanglong |
2012 |
96-97 | 16-17 |
p. 2474-2478 5 p. |
article |
|
| 20 | Extremal values on the eccentric distance sum of trees |
Geng, Xianya |
2013 |
96-97 | 16-17 |
p. 2427-2439 13 p. |
article |
|
| 21 | Finding a smallest odd hole in a claw-free graph using global structure |
Kennedy, Wm. Sean |
2013 |
96-97 | 16-17 |
p. 2492-2498 7 p. |
article |
|
| 22 | Forbidden subgraphs and the König–Egerváry property |
Bonomo, Flavia |
2013 |
96-97 | 16-17 |
p. 2380-2388 9 p. |
article |
|
| 23 | Friedman numbers have density 1 |
Brand, Michael |
2013 |
96-97 | 16-17 |
p. 2389-2395 7 p. |
article |
|
| 24 | Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs |
Zaker, Manouchehr |
2013 |
96-97 | 16-17 |
p. 2716-2723 8 p. |
article |
|
| 25 | Generalized k -ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation |
Wotzlaw, Andreas |
2012 |
96-97 | 16-17 |
p. 2349-2363 15 p. |
article |
|
| 26 | Generalized roof duality |
Kahl, Fredrik |
2012 |
96-97 | 16-17 |
p. 2419-2434 16 p. |
article |
|
| 27 | H -force sets of locally semicomplete digraphs |
Zhang, Xinhong |
2012 |
96-97 | 16-17 |
p. 2491-2496 6 p. |
article |
|
| 28 | How many attackers can selfish defenders catch? |
Mavronicolas, Marios |
2013 |
96-97 | 16-17 |
p. 2563-2586 24 p. |
article |
|
| 29 | Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth |
Addis, Bernardetta |
2013 |
96-97 | 16-17 |
p. 2349-2360 12 p. |
article |
|
| 30 | Improving the extraction and expansion method for large graph coloring |
Hao, Jin-Kao |
2012 |
96-97 | 16-17 |
p. 2397-2407 11 p. |
article |
|
| 31 | Inverse multi-objective combinatorial optimization |
Roland, Julien |
2013 |
96-97 | 16-17 |
p. 2764-2771 8 p. |
article |
|
| 32 | Locating a semi-obnoxious covering facility with repelling polygonal regions |
Plastria, Frank |
2013 |
96-97 | 16-17 |
p. 2604-2623 20 p. |
article |
|
| 33 | Maximal hypercubes in Fibonacci and Lucas cubes |
Mollard, Michel |
2012 |
96-97 | 16-17 |
p. 2479-2483 5 p. |
article |
|
| 34 | Maximum weight independent sets in hole- and dart-free graphs |
Basavaraju, M. |
2012 |
96-97 | 16-17 |
p. 2364-2369 6 p. |
article |
|
| 35 | More fires and more fighters |
Costa, Vitor |
2013 |
96-97 | 16-17 |
p. 2410-2419 10 p. |
article |
|
| 36 | Network descriptors based on betweenness centrality and transmission and their extremal values |
Vukičević, Damir |
2013 |
96-97 | 16-17 |
p. 2678-2686 9 p. |
article |
|
| 37 | Nonexistence of certain types of plateaued functions |
Hyun, Jong Yoon |
2013 |
96-97 | 16-17 |
p. 2745-2748 4 p. |
article |
|
| 38 | On a conjecture of the Randić index and the minimum degree of graphs |
Liu, Jianxi |
2013 |
96-97 | 16-17 |
p. 2544-2548 5 p. |
article |
|
| 39 | On a new type of distance Fibonacci numbers |
Włoch, Iwona |
2013 |
96-97 | 16-17 |
p. 2695-2701 7 p. |
article |
|
| 40 | On approximating the d -girth of a graph |
Peleg, David |
2013 |
96-97 | 16-17 |
p. 2587-2596 10 p. |
article |
|
| 41 | On dominating sets whose induced subgraphs have a bounded diameter |
Schaudt, Oliver |
2013 |
96-97 | 16-17 |
p. 2647-2652 6 p. |
article |
|
| 42 | On families of quadratic surfaces having fixed intersections with two hyperplanes |
Belotti, Pietro |
2013 |
96-97 | 16-17 |
p. 2778-2793 16 p. |
article |
|
| 43 | Online binary minimax trees |
Maßberg, Jens |
2013 |
96-97 | 16-17 |
p. 2556-2562 7 p. |
article |
|
| 44 | On n -fold L ( j , k ) -and circular L ( j , k ) -labelings of graphs |
Lin, Wensong |
2012 |
96-97 | 16-17 |
p. 2452-2461 10 p. |
article |
|
| 45 | On strong edge-colouring of subcubic graphs |
Hocquard, Hervé |
2013 |
96-97 | 16-17 |
p. 2467-2479 13 p. |
article |
|
| 46 | On the existence of retransmission permutation arrays |
Wanless, Ian M. |
2013 |
96-97 | 16-17 |
p. 2772-2777 6 p. |
article |
|
| 47 | On the harmonic index and the chromatic number of a graph |
Deng, Hanyuan |
2013 |
96-97 | 16-17 |
p. 2740-2744 5 p. |
article |
|
| 48 | On the range of size of sum graphs & integral sum graphs of a given order |
Tiwari, Apurv |
2013 |
96-97 | 16-17 |
p. 2653-2661 9 p. |
article |
|
| 49 | On the skewness of the join of graphs |
Chia, Gek L. |
2013 |
96-97 | 16-17 |
p. 2405-2409 5 p. |
article |
|
| 50 | On the vertex-pancyclicity of hypertournaments |
Li, Hongwei |
2013 |
96-97 | 16-17 |
p. 2749-2752 4 p. |
article |
|
| 51 | On upper bounds for multiple domination numbers of graphs |
Przybyło, Jakub |
2013 |
96-97 | 16-17 |
p. 2758-2763 6 p. |
article |
|
| 52 | Optimal approximability of bookmark assignments |
Asahiro, Yuichi |
2013 |
96-97 | 16-17 |
p. 2361-2366 6 p. |
article |
|
| 53 | Optimal ( r , ≤ 3 ) -locating–dominating codes in the infinite king grid |
Pelto, Mikko |
2013 |
96-97 | 16-17 |
p. 2597-2603 7 p. |
article |
|
| 54 | Optimising sum-of-squares measures for clustering multisets defined over a metric space |
Kettleborough, George |
2013 |
96-97 | 16-17 |
p. 2499-2513 15 p. |
article |
|
| 55 | Patience of matrix games |
Hansen, Kristoffer Arnsfelt |
2013 |
96-97 | 16-17 |
p. 2440-2459 20 p. |
article |
|
| 56 | Rainbow vertex k -connection in graphs |
Liu, Henry |
2013 |
96-97 | 16-17 |
p. 2549-2555 7 p. |
article |
|
| 57 | Restricted non-separable planar maps and some pattern avoiding permutations |
Kitaev, Sergey |
2013 |
96-97 | 16-17 |
p. 2514-2526 13 p. |
article |
|
| 58 | Retraction notice to “Pancyclic graphs and degree sum, neighborhood union involving distance two” |
2012 |
96-97 | 16-17 |
p. 2497- 1 p. |
article |
||
| 59 | Scheduling coupled-operation jobs with exact time-lags |
Condotta, A. |
2012 |
96-97 | 16-17 |
p. 2370-2388 19 p. |
article |
|
| 60 | Scheduling tasks with exponential duration on unrelated parallel machines |
Nouri, Mostafa |
2012 |
96-97 | 16-17 |
p. 2462-2473 12 p. |
article |
|
| 61 | Some results on Vizing’s conjecture and related problems |
Pilipczuk, Marcin |
2012 |
96-97 | 16-17 |
p. 2484-2490 7 p. |
article |
|
| 62 | Super-simple balanced incomplete block designs with block size 5 and index 3 |
Chen, Kejun |
2013 |
96-97 | 16-17 |
p. 2396-2404 9 p. |
article |
|
| 63 | The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle |
Wang, Yiqiao |
2013 |
96-97 | 16-17 |
p. 2687-2694 8 p. |
article |
|
| 64 | The distance spectral radius of digraphs |
Lin, Huiqiu |
2013 |
96-97 | 16-17 |
p. 2537-2543 7 p. |
article |
|
| 65 | The relationship between the eccentric connectivity index and Zagreb indices |
Hua, Hongbo |
2013 |
96-97 | 16-17 |
p. 2480-2491 12 p. |
article |
|
| 66 | The total bondage number of grid graphs |
Hu, Fu-Tao |
2012 |
96-97 | 16-17 |
p. 2408-2418 11 p. |
article |
|
| 67 | Upper bounds on the diameter of domination dot-critical graphs with given connectivity |
Furuya, Michitaka |
2013 |
96-97 | 16-17 |
p. 2420-2426 7 p. |
article |
67 results found