|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
151 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments |
Charon, Irène |
2006 |
96-97 | 15 |
p. 2097-2116 20 p. |
article |
|
| 2 | A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem |
Erdoğan, Güneş |
2010 |
96-97 | 15 |
p. 1599-1614 16 p. |
article |
|
| 3 | A covering problem that is easy for trees but NP -complete for trivalent graphs |
Bardeli, Rolf |
2008 |
96-97 | 15 |
p. 2855-2866 |
article |
|
| 4 | A distance-labelling problem for hypercubes |
Zhou, Sanming |
2008 |
96-97 | 15 |
p. 2846-2854 |
article |
|
| 5 | A method for efficiently computing the number of codewords of fixed weights in linear codes |
Bouyukliev, Iliya |
2008 |
96-97 | 15 |
p. 2986-3004 |
article |
|
| 6 | Analysing local algorithms in location-aware quasi-unit-disk graphs |
Hassinen, Marja |
2011 |
96-97 | 15 |
p. 1566-1580 15 p. |
article |
|
| 7 | Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences |
Gawiejnowicz, Stanisław |
2006 |
96-97 | 15 |
p. 2150-2166 17 p. |
article |
|
| 8 | An asymptotic analysis of the evolutionary spatial prisoner’s dilemma on a path |
Burger, A.P. |
2012 |
96-97 | 15 |
p. 2075-2088 14 p. |
article |
|
| 9 | A new trust region technique for the maximum weight clique problem |
Busygin, Stanislav |
2006 |
96-97 | 15 |
p. 2080-2096 17 p. |
article |
|
| 10 | An improved algorithm for the longest induced path problem on k -chordal graphs |
Ishizeki, Tetsuya |
2008 |
96-97 | 15 |
p. 3057-3059 |
article |
|
| 11 | A note on kernels and Sperner’s Lemma |
Király, Tamás |
2009 |
96-97 | 15 |
p. 3327-3331 5 p. |
article |
|
| 12 | A note on the weakly convex and convex domination numbers of a torus |
Raczek, Joanna |
2010 |
96-97 | 15 |
p. 1708-1713 6 p. |
article |
|
| 13 | APN permutations on Z n and Costas arrays |
Drakakis, Konstantinos |
2009 |
96-97 | 15 |
p. 3320-3326 7 p. |
article |
|
| 14 | Application of an optimization problem in Max-Plus algebra to scheduling problems |
Bouquard, J.-L. |
2006 |
96-97 | 15 |
p. 2064-2079 16 p. |
article |
|
| 15 | Approximation schemes for parallel machine scheduling with availability constraints |
Fu, Bin |
2011 |
96-97 | 15 |
p. 1555-1565 11 p. |
article |
|
| 16 | A proof of a conjecture on the Randić index of graphs with given girth |
Li, Xueliang |
2009 |
96-97 | 15 |
p. 3332-3335 4 p. |
article |
|
| 17 | A stabilized column generation scheme for the traveling salesman subtour problem |
Westerlund, Andreas |
2006 |
96-97 | 15 |
p. 2212-2238 27 p. |
article |
|
| 18 | Bounded edge-connectivity and edge-persistence of Cartesian product of graphs |
Lu, You |
2009 |
96-97 | 15 |
p. 3249-3257 9 p. |
article |
|
| 19 | Bounds on the quality of reconstructed images in binary tomography |
Batenburg, K. Joost |
2013 |
96-97 | 15 |
p. 2236-2251 16 p. |
article |
|
| 20 | Center location problems on tree graphs with subtree-shaped customers |
Puerto, J. |
2008 |
96-97 | 15 |
p. 2890-2910 |
article |
|
| 21 | Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs |
Kaplan, Haim |
2009 |
96-97 | 15 |
p. 3216-3230 15 p. |
article |
|
| 22 | Checking oriented matroid isomorphism by means of canonical labeling |
Bokowski, Jürgen |
2013 |
96-97 | 15 |
p. 2269-2280 12 p. |
article |
|
| 23 | Classification and generation of nanocones |
Brinkmann, Gunnar |
2011 |
96-97 | 15 |
p. 1528-1539 12 p. |
article |
|
| 24 | Cluster editing with locally bounded modifications |
Komusiewicz, Christian |
2012 |
96-97 | 15 |
p. 2259-2270 12 p. |
article |
|
| 25 | Competition numbers of complete r -partite graphs |
Li, Bo-Jr |
2012 |
96-97 | 15 |
p. 2271-2276 6 p. |
article |
|
| 26 | Competitive algorithms for the bicriteria k -server problem |
Flammini, Michele |
2006 |
96-97 | 15 |
p. 2117-2127 11 p. |
article |
|
| 27 | Complexity of minimizing the total flow time with interval data and minmax regret criterion |
Lebedev, Vasilij |
2006 |
96-97 | 15 |
p. 2167-2177 11 p. |
article |
|
| 28 | Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections |
Balázs, Péter |
2013 |
96-97 | 15 |
p. 2224-2235 12 p. |
article |
|
| 29 | Computing an eigenvector of an inverse Monge matrix in max–plus algebra |
Imaev, Aleksey A. |
2010 |
96-97 | 15 |
p. 1701-1707 7 p. |
article |
|
| 30 | Congestion games with failures |
Penn, Michal |
2011 |
96-97 | 15 |
p. 1508-1525 18 p. |
article |
|
| 31 | Contents |
2009 |
96-97 | 15 |
p. vii-viii nvt p. |
article |
||
| 32 | Contents |
2010 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 33 | Contents |
2006 |
96-97 | 15 |
p. vii-viii nvt p. |
article |
||
| 34 | Contents |
2007 |
96-97 | 15 |
p. vii- 1 p. |
article |
||
| 35 | Contents |
2013 |
96-97 | 15 |
p. v- 1 p. |
article |
||
| 36 | Contents |
2011 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 37 | Contents |
2012 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 38 | Contents |
2008 |
96-97 | 15 |
p. vii-viii |
article |
||
| 39 | Deterministic algorithms for multi-criteria Max-TSP |
Manthey, Bodo |
2012 |
96-97 | 15 |
p. 2277-2285 9 p. |
article |
|
| 40 | Diameter-sufficient conditions for a graph to be super-restricted connected |
Balbuena, Camino |
2008 |
96-97 | 15 |
p. 2827-2834 |
article |
|
| 41 | Discrete Geometry for Computer Imagery |
Debled-Rennesson, Isabelle |
2013 |
96-97 | 15 |
p. 2223- 1 p. |
article |
|
| 42 | Discrete tomography determination of bounded lattice sets from four X-rays |
Brunetti, S. |
2013 |
96-97 | 15 |
p. 2281-2292 12 p. |
article |
|
| 43 | Disjoint dominating and total dominating sets in graphs |
Henning, Michael A. |
2010 |
96-97 | 15 |
p. 1615-1623 9 p. |
article |
|
| 44 | Dynamic chromatic number of regular graphs |
Alishahi, Meysam |
2012 |
96-97 | 15 |
p. 2098-2103 6 p. |
article |
|
| 45 | Editorial Board |
2009 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 46 | Editorial Board |
2006 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 47 | Editorial Board |
2007 |
96-97 | 15 |
p. v-vi nvt p. |
article |
||
| 48 | Editorial Board |
2008 |
96-97 | 15 |
p. v-vi |
article |
||
| 49 | Efficient edge domination in regular graphs |
Cardoso, Domingos M. |
2008 |
96-97 | 15 |
p. 3060-3065 |
article |
|
| 50 | Enumeration formula for ( 2 , n ) -cubes in discrete planes |
Domenjoud, Eric |
2012 |
96-97 | 15 |
p. 2158-2171 14 p. |
article |
|
| 51 | Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets |
Kůrková, Věra |
2007 |
96-97 | 15 |
p. 1930-1942 13 p. |
article |
|
| 52 | Existence of finite test-sets for k-power-freeness of uniform morphisms |
Richomme, G. |
2007 |
96-97 | 15 |
p. 2001-2016 16 p. |
article |
|
| 53 | Extremal Hosoya index and Merrifield–Simmons index of hexagonal spiders |
Shiu, W.C. |
2008 |
96-97 | 15 |
p. 2978-2985 |
article |
|
| 54 | Finding monotone paths in edge-ordered graphs |
Katrenič, J. |
2010 |
96-97 | 15 |
p. 1624-1632 9 p. |
article |
|
| 55 | Flows over edge-disjoint mixed multipaths and applications |
Aneja, Y.P. |
2007 |
96-97 | 15 |
p. 1979-2000 22 p. |
article |
|
| 56 | FPTAS for half-products minimization with scheduling applications |
Erel, Erdal |
2008 |
96-97 | 15 |
p. 3046-3056 |
article |
|
| 57 | Geodesic-pancyclic graphs |
Chan, Hung-Chang |
2007 |
96-97 | 15 |
p. 1971-1978 8 p. |
article |
|
| 58 | Girth of pancake graphs |
Compeau, Phillip E.C. |
2011 |
96-97 | 15 |
p. 1641-1645 5 p. |
article |
|
| 59 | Guest Editor Listing |
2006 |
96-97 | 15 |
p. 2043- 1 p. |
article |
||
| 60 | Guide for authors |
2006 |
96-97 | 15 |
p. I-IV nvt p. |
article |
||
| 61 | Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width |
Gutin, Gregory |
2012 |
96-97 | 15 |
p. 2323-2328 6 p. |
article |
|
| 62 | Identifying codes and locating–dominating sets on paths and cycles |
Chen, Chunxia |
2011 |
96-97 | 15 |
p. 1540-1547 8 p. |
article |
|
| 63 | Incoherent majorities: The McGarvey problem in judgement aggregation |
Nehring, Klaus |
2011 |
96-97 | 15 |
p. 1488-1507 20 p. |
article |
|
| 64 | Induced disjoint paths problem in a planar digraph |
Kobayashi, Yusuke |
2009 |
96-97 | 15 |
p. 3231-3238 8 p. |
article |
|
| 65 | Jordan canonical form of Pascal-type matrices via sequences of binomial type |
Yang, Sheng-liang |
2008 |
96-97 | 15 |
p. 3040-3045 |
article |
|
| 66 | Kernelization hardness of connectivity problems in d -degenerate graphs |
Cygan, Marek |
2012 |
96-97 | 15 |
p. 2131-2141 11 p. |
article |
|
| 67 | Labeling the r -path with a condition at distance two |
Georges, John P. |
2009 |
96-97 | 15 |
p. 3203-3215 13 p. |
article |
|
| 68 | Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem |
Thiongane, Babacar |
2006 |
96-97 | 15 |
p. 2200-2211 12 p. |
article |
|
| 69 | Least and most colored bases |
Maffioli, Francesco |
2007 |
96-97 | 15 |
p. 1958-1970 13 p. |
article |
|
| 70 | LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth |
Giannopoulou, Archontia C. |
2012 |
96-97 | 15 |
p. 2089-2097 9 p. |
article |
|
| 71 | Locating and paired-dominating sets in graphs |
McCoy, John |
2009 |
96-97 | 15 |
p. 3268-3280 13 p. |
article |
|
| 72 | Lower bounds for optimal alignments of binary sequences |
Vinzant, Cynthia |
2009 |
96-97 | 15 |
p. 3341-3346 6 p. |
article |
|
| 73 | Matching interdiction |
Zenklusen, Rico |
2010 |
96-97 | 15 |
p. 1676-1690 15 p. |
article |
|
| 74 | Matroid representation of clique complexes |
Kashiwabara, Kenji |
2007 |
96-97 | 15 |
p. 1910-1929 20 p. |
article |
|
| 75 | Minimizing a sum of submodular functions |
Kolmogorov, Vladimir |
2012 |
96-97 | 15 |
p. 2246-2258 13 p. |
article |
|
| 76 | Minsum hyperspheres in normed spaces |
Körner, Mark-Christoph |
2012 |
96-97 | 15 |
p. 2221-2233 13 p. |
article |
|
| 77 | Multiflows in symmetric digraphs |
Jarry, Aubin |
2012 |
96-97 | 15 |
p. 2208-2220 13 p. |
article |
|
| 78 | Multiple levels of preference in interactive strategic decisions |
Xu, Haiyan |
2009 |
96-97 | 15 |
p. 3300-3313 14 p. |
article |
|
| 79 | Nash-solvable two-person symmetric cycle game forms |
Boros, Endre |
2011 |
96-97 | 15 |
p. 1461-1487 27 p. |
article |
|
| 80 | Necessary conditions and frame constructions for Z -cyclic patterned starter whist tournaments |
Hu, Sihuang |
2012 |
96-97 | 15 |
p. 2188-2198 11 p. |
article |
|
| 81 | Nordhaus–Gaddum-type theorem for Wiener index of graphs when decomposing into three parts |
Li, Daobin |
2011 |
96-97 | 15 |
p. 1594-1600 7 p. |
article |
|
| 82 | Note on maximal split-stable subgraphs |
Faigle, Ulrich |
2007 |
96-97 | 15 |
p. 2031-2038 8 p. |
article |
|
| 83 | Occupation games on graphs in which the second player takes almost all vertices |
Shapovalov, Alexander |
2011 |
96-97 | 15 |
p. 1526-1527 2 p. |
article |
|
| 84 | On a conjecture of Erdős, Graham and Spencer, II |
Fang, Jin-Hui |
2008 |
96-97 | 15 |
p. 2950-2958 |
article |
|
| 85 | On a connection between the Pascal, Stirling and Vandermonde matrices |
Yang, Sheng-Liang |
2007 |
96-97 | 15 |
p. 2025-2030 6 p. |
article |
|
| 86 | On atom–bond connectivity index of connected graphs |
Xing, Rundan |
2011 |
96-97 | 15 |
p. 1617-1630 14 p. |
article |
|
| 87 | On cover-structure graphs |
Wunderlich, Henning |
2009 |
96-97 | 15 |
p. 3289-3299 11 p. |
article |
|
| 88 | On forcing matching number of boron–nitrogen fullerene graphs |
Jiang, Xiaoyan |
2011 |
96-97 | 15 |
p. 1581-1593 13 p. |
article |
|
| 89 | On hamiltonian colorings for some graphs |
Shen, Yufa |
2008 |
96-97 | 15 |
p. 3028-3034 |
article |
|
| 90 | On Harary index of graphs |
Xu, Kexiang |
2011 |
96-97 | 15 |
p. 1631-1640 10 p. |
article |
|
| 91 | On L ( d , 1 ) -labeling of Cartesian product of a cycle and a path |
Chiang, Shih-Hu |
2008 |
96-97 | 15 |
p. 2867-2881 |
article |
|
| 92 | On Opsut’s conjecture for hypercompetition numbers of hypergraphs |
Park, Boram |
2012 |
96-97 | 15 |
p. 2286-2293 8 p. |
article |
|
| 93 | On orthogonal ray graphs |
Shrestha, Anish Man Singh |
2010 |
96-97 | 15 |
p. 1650-1659 10 p. |
article |
|
| 94 | On real number labelings and graph invertibility |
Choi, Jeong-Ok |
2012 |
96-97 | 15 |
p. 2116-2130 15 p. |
article |
|
| 95 | On some identities for the Fibonomial coefficients via generating function |
Trojovský, Pavel |
2007 |
96-97 | 15 |
p. 2017-2024 8 p. |
article |
|
| 96 | On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes |
Aoshima, Yoshikazu |
2012 |
96-97 | 15 |
p. 2104-2115 12 p. |
article |
|
| 97 | On the L 2 -discrepancy |
Oh, Jinsoo |
2007 |
96-97 | 15 |
p. 2039-2042 4 p. |
article |
|
| 98 | On the lifetime of a random binary sequence |
Eryılmaz, Serkan |
2011 |
96-97 | 15 |
p. 1646-1649 4 p. |
article |
|
| 99 | On the power of permitting features in cooperating context-free array grammar systems |
Subramanian, K.G. |
2013 |
96-97 | 15 |
p. 2328-2335 8 p. |
article |
|
| 100 | On the shape of permutomino tiles |
Blondin Massé, A. |
2013 |
96-97 | 15 |
p. 2316-2327 12 p. |
article |
|
| 101 | Optimal receiver scheduling algorithms for a multicast problem |
Bertossi, A.A. |
2009 |
96-97 | 15 |
p. 3187-3197 11 p. |
article |
|
| 102 | Ordering connected graphs having small degree distances |
Tomescu, Ioan |
2010 |
96-97 | 15 |
p. 1714-1717 4 p. |
article |
|
| 103 | Parameterized graph cleaning problems |
Marx, Dániel |
2009 |
96-97 | 15 |
p. 3258-3267 10 p. |
article |
|
| 104 | Polygonal estimation of planar convex-set perimeter from its two projections |
Baudrier, Étienne |
2013 |
96-97 | 15 |
p. 2252-2268 17 p. |
article |
|
| 105 | Polyhedral results for the bipartite induced subgraph problem |
Fouilhoux, Pierre |
2006 |
96-97 | 15 |
p. 2128-2149 22 p. |
article |
|
| 106 | Pooling designs with surprisingly high degree of error correction in a finite vector space |
Guo, Jun |
2012 |
96-97 | 15 |
p. 2172-2176 5 p. |
article |
|
| 107 | Positive circuits and maximal number of fixed points in discrete dynamical systems |
Richard, Adrien |
2009 |
96-97 | 15 |
p. 3281-3288 8 p. |
article |
|
| 108 | Positivity of third order linear recurrence sequences |
Laohakosol, Vichian |
2009 |
96-97 | 15 |
p. 3239-3248 10 p. |
article |
|
| 109 | Preface |
Chrétienne, P. |
2006 |
96-97 | 15 |
p. 2041-2042 2 p. |
article |
|
| 110 | Random walks and the effective resistance sum rules |
Chen, Haiyan |
2010 |
96-97 | 15 |
p. 1691-1700 10 p. |
article |
|
| 111 | Range minimization problems in path-facility location on trees |
Puerto, Justo |
2012 |
96-97 | 15 |
p. 2294-2305 12 p. |
article |
|
| 112 | Recognizing line-polar bipartite graphs in time O ( n ) |
Ekim, Tınaz |
2010 |
96-97 | 15 |
p. 1593-1598 6 p. |
article |
|
| 113 | Reconfiguration of list edge-colorings in a graph |
Ito, Takehiro |
2012 |
96-97 | 15 |
p. 2199-2207 9 p. |
article |
|
| 114 | Redundancies of correction capability optimized Reed–Muller codes |
Bras-Amorós, Maria |
2008 |
96-97 | 15 |
p. 3005-3010 |
article |
|
| 115 | Relations between gene regulatory networks and cell dynamics in Boolean models |
Didier, Gilles |
2012 |
96-97 | 15 |
p. 2147-2157 11 p. |
article |
|
| 116 | Rooted tree statistics from Matula numbers |
Deutsch, Emeric |
2012 |
96-97 | 15 |
p. 2314-2322 9 p. |
article |
|
| 117 | Routing to reduce the cost of wavelength conversion |
Erlebach, Thomas |
2008 |
96-97 | 15 |
p. 2911-2923 |
article |
|
| 118 | Signed star k -subdomination numbers in graphs |
Saei, Reza |
2008 |
96-97 | 15 |
p. 3066-3070 |
article |
|
| 119 | Single machine scheduling with controllable release and processing parameters |
Shakhlevich, Natalia V. |
2006 |
96-97 | 15 |
p. 2178-2199 22 p. |
article |
|
| 120 | Sorting with networks of data structures |
Biedl, Therese |
2010 |
96-97 | 15 |
p. 1579-1586 8 p. |
article |
|
| 121 | Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph |
Takata, Ken |
2010 |
96-97 | 15 |
p. 1660-1667 8 p. |
article |
|
| 122 | Strong edge colouring of subcubic graphs |
Hocquard, Hervé |
2011 |
96-97 | 15 |
p. 1650-1657 8 p. |
article |
|
| 123 | Strong structural properties of unidirectional star graphs |
Cheng, Eddie |
2008 |
96-97 | 15 |
p. 2939-2949 |
article |
|
| 124 | Supply chain scheduling: Sequence coordination |
Agnetis, Alessandro |
2006 |
96-97 | 15 |
p. 2044-2063 20 p. |
article |
|
| 125 | The binding number of a graph and its cliques |
Lyle, Jeremy |
2009 |
96-97 | 15 |
p. 3336-3340 5 p. |
article |
|
| 126 | The expressive power of binary submodular functions |
Živný, Stanislav |
2009 |
96-97 | 15 |
p. 3347-3358 12 p. |
article |
|
| 127 | The global forcing number of the parallelogram polyhex |
Sedlar, Jelena |
2012 |
96-97 | 15 |
p. 2306-2313 8 p. |
article |
|
| 128 | The Hosoya polynomial decomposition for catacondensed benzenoid graphs |
Xu, Shoujun |
2008 |
96-97 | 15 |
p. 2930-2938 |
article |
|
| 129 | The Independence Number for De Bruijn networks and Kautz networks |
Deng, Zhi-Guo |
2008 |
96-97 | 15 |
p. 3035-3039 |
article |
|
| 130 | The inverse problem for certain tree parameters |
Czabarka, Éva |
2009 |
96-97 | 15 |
p. 3314-3319 6 p. |
article |
|
| 131 | The k -in-a-tree problem for graphs of girth at least k |
Liu, W. |
2010 |
96-97 | 15 |
p. 1644-1649 6 p. |
article |
|
| 132 | The matching energy of a graph |
Gutman, Ivan |
2012 |
96-97 | 15 |
p. 2177-2187 11 p. |
article |
|
| 133 | The median function on graphs with bounded profiles |
Balakrishnan, Kannan |
2008 |
96-97 | 15 |
p. 2882-2889 |
article |
|
| 134 | The minimum spanning strong subdigraph problem is fixed parameter tractable |
Bang-Jensen, Jørgen |
2008 |
96-97 | 15 |
p. 2924-2929 |
article |
|
| 135 | The profile of the Cartesian product of graphs |
Kuo, David |
2008 |
96-97 | 15 |
p. 2835-2845 |
article |
|
| 136 | The Sheffer group and the Riordan group |
He, Tian-Xiao |
2007 |
96-97 | 15 |
p. 1895-1909 15 p. |
article |
|
| 137 | The smallest values of algebraic connectivity for unicyclic graphs |
Li, Jianxi |
2010 |
96-97 | 15 |
p. 1633-1643 11 p. |
article |
|
| 138 | The stable marriage problem with master preference lists |
Irving, Robert W. |
2008 |
96-97 | 15 |
p. 2959-2977 |
article |
|
| 139 | The test suite generation problem: Optimal instances and their implications |
Cheng, Christine T. |
2007 |
96-97 | 15 |
p. 1943-1957 15 p. |
article |
|
| 140 | The Wiener index in iterated line graphs |
Knor, M. |
2012 |
96-97 | 15 |
p. 2234-2245 12 p. |
article |
|
| 141 | The Zagreb coindices of graph operations |
Ashrafi, A.R. |
2010 |
96-97 | 15 |
p. 1571-1578 8 p. |
article |
|
| 142 | Tighter bounds of the First Fit algorithm for the bin-packing problem |
Xia, Binzhou |
2010 |
96-97 | 15 |
p. 1668-1675 8 p. |
article |
|
| 143 | Topological relations between separating circles |
Veelaert, Peter |
2013 |
96-97 | 15 |
p. 2336-2347 12 p. |
article |
|
| 144 | Total domination changing and stable graphs upon vertex removal |
Desormeaux, Wyatt J. |
2011 |
96-97 | 15 |
p. 1548-1554 7 p. |
article |
|
| 145 | Total domination critical and stable graphs upon edge removal |
Desormeaux, Wyatt J. |
2010 |
96-97 | 15 |
p. 1587-1592 6 p. |
article |
|
| 146 | Total outer-connected domination numbers of trees |
Cyman, Joanna |
2009 |
96-97 | 15 |
p. 3198-3202 5 p. |
article |
|
| 147 | Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line |
Lachaud, Jacques-Olivier |
2013 |
96-97 | 15 |
p. 2293-2315 23 p. |
article |
|
| 148 | Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number |
Dehghan, A. |
2012 |
96-97 | 15 |
p. 2142-2146 5 p. |
article |
|
| 149 | Vertex PI indices of four sums of graphs |
Li, Shuhua |
2011 |
96-97 | 15 |
p. 1601-1607 7 p. |
article |
|
| 150 | Visualization of quasi-median networks |
Schwarz, Konrad |
2011 |
96-97 | 15 |
p. 1608-1616 9 p. |
article |
|
| 151 | Weighted fusion graphs: Merging properties and watersheds |
Cousty, Jean |
2008 |
96-97 | 15 |
p. 3011-3027 |
article |
151 results found