|
| << vorige |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
3648 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 3001 | Some results on ( 1 , 2 ) -rainbow connection number |
Ma, Yingbin |
|
96-97 | Index 1 |
p. 231-238 |
artikel |
|
| 3002 | Some results on the avoidance of vincular patterns by multisets |
Mansour, Toufik |
2015 |
96-97 | Index 1 |
p. 201-208 8 p. |
artikel |
|
| 3003 | Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs |
Galeana-Sánchez, Hortensia |
2016 |
96-97 | Index 1 |
p. 235-245 |
artikel |
|
| 3004 | Some results on the Wiener index related to the Šoltés problem of graphs |
Dobrynin, Andrey A. |
|
96-97 | Index 1 |
p. 154-160 |
artikel |
|
| 3005 | Some results on Vizing’s conjecture and related problems |
Pilipczuk, Marcin |
2012 |
96-97 | Index 1 |
p. 2484-2490 7 p. |
artikel |
|
| 3006 | Some results related to the tenacity and existence of k -trees |
Moazzami, Dara |
2009 |
96-97 | Index 1 |
p. 1794-1798 5 p. |
artikel |
|
| 3007 | Some special minimum k -geodetically connected graphs |
Lan, Yingjie |
2011 |
96-97 | Index 1 |
p. 1002-1012 11 p. |
artikel |
|
| 3008 | Some spectral conditions for star-factors in bipartite graphs |
Zhou, Sizhong |
|
96-97 | Index 1 |
p. 124-130 |
artikel |
|
| 3009 | Some spectral inequalities for connected bipartite graphs with maximum A α -index |
Li, Shuchao |
|
96-97 | Index 1 |
p. 97-109 |
artikel |
|
| 3010 | Some spectral invariants of the neighborhood corona of graphs |
Yang, Yujun |
|
96-97 | Index 1 |
p. 300-308 |
artikel |
|
| 3011 | Some star-critical Ramsey numbers |
Li, Zhen |
2015 |
96-97 | Index 1 |
p. 301-305 5 p. |
artikel |
|
| 3012 | Some sufficient conditions for graphs being k -leaf-connected |
Wu, Jiadong |
|
96-97 | Index 1 |
p. 11-20 |
artikel |
|
| 3013 | Some tight bounds on the minimum and maximum forcing numbers of graphs |
Liu, Qianqian |
|
96-97 | Index 1 |
p. 126-135 |
artikel |
|
| 3014 | Source sink flows with capacity installation in batches |
Chopra, Sunil |
1998 |
96-97 | Index 1 |
p. 165-192 28 p. |
artikel |
|
| 3015 | Space reduction constraints for the median of permutations problem |
Milosz, Robin |
|
96-97 | Index 1 |
p. 201-213 |
artikel |
|
| 3016 | S -packing chromatic vertex-critical graphs |
Holub, Přemysl |
|
96-97 | Index 1 |
p. 119-127 |
artikel |
|
| 3017 | S -packing coloring of cubic Halin graphs |
Tarhini, Batoul |
|
96-97 | Index 1 |
p. 53-58 |
artikel |
|
| 3018 | S -packing colorings of distance graphs G ( Z , { 2 , t } ) |
Brešar, Boštjan |
|
96-97 | Index 1 |
p. 143-154 |
artikel |
|
| 3019 | Spanners in randomly weighted graphs: Independent edge lengths |
Frieze, Alan |
|
96-97 | Index 1 |
p. 68-74 |
artikel |
|
| 3020 | Spanning acyclic subdigraphs and strong t -panconnectivity of tournaments |
Xiao, Lan |
|
96-97 | Index 1 |
p. 9-19 |
artikel |
|
| 3021 | Spanning connectivity of K 1 , r -free split graphs |
Xiong, Wei |
|
96-97 | Index 1 |
p. 176-183 |
artikel |
|
| 3022 | Spanning forests and the golden ratio |
Chebotarev, Pavel |
2008 |
96-97 | Index 1 |
p. 813-821 9 p. |
artikel |
|
| 3023 | Spanning k -trees and distance signless Laplacian spectral radius of graphs |
Zhou, Sizhong |
|
96-97 | Index 1 |
p. 358-365 |
artikel |
|
| 3024 | Spanning local tournaments in locally semicomplete digraphs |
Guo, Yubao |
1997 |
96-97 | Index 1 |
p. 119-125 7 p. |
artikel |
|
| 3025 | Spanning paths in graphs |
Mafuta, Phillip |
2019 |
96-97 | Index 1 |
p. 278-282 |
artikel |
|
| 3026 | Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices |
Huang, Xinyu |
|
96-97 | Index 1 |
p. 105-109 |
artikel |
|
| 3027 | Spans of preference functions for de Bruijn sequences |
Alhakim, Abbas |
2012 |
96-97 | Index 1 |
p. 992-998 7 p. |
artikel |
|
| 3028 | Sparse hypergraphs with applications in combinatorial rigidity |
Jordán, Tibor |
2015 |
96-97 | Index 1 |
p. 93-101 9 p. |
artikel |
|
| 3029 | Sparse orthogonal matrices and the Haar wavelet |
Cheon, Gi-Sang |
2000 |
96-97 | Index 1 |
p. 63-76 14 p. |
artikel |
|
| 3030 | Sparse recovery with integrality constraints |
Lange, Jan-Hendrik |
|
96-97 | Index 1 |
p. 346-366 |
artikel |
|
| 3031 | Sparsest cuts and concurrent flows in product graphs |
Bonsma, Paul |
2004 |
96-97 | Index 1 |
p. 173-182 10 p. |
artikel |
|
| 3032 | Spectral characterization of the complete graph removing a path of small length |
Mao, Lihuan |
2019 |
96-97 | Index 1 |
p. 260-268 |
artikel |
|
| 3033 | Spectral conditions of pancyclicity for t -tough graphs |
Benediktovich, Vladimir I. |
|
96-97 | Index 1 |
p. 130-137 |
artikel |
|
| 3034 | Spectral distances on graphs |
Gu, Jiao |
2015 |
96-97 | Index 1 |
p. 56-74 19 p. |
artikel |
|
| 3035 | Spectral extrema of F 2 -free graphs with given size revisited |
Chen, Yuan |
|
96-97 | Index 1 |
p. 294-307 |
artikel |
|
| 3036 | Spectral partitioning with multiple eigenvectors |
Alpert, Charles J |
1999 |
96-97 | Index 1 |
p. 3-26 24 p. |
artikel |
|
| 3037 | Spectra of the Mycielskian of a signed graph and related products |
Ul Rashid, Mir Riyaz |
|
96-97 | Index 1 |
p. 124-144 |
artikel |
|
| 3038 | Sphericity, cubicity, and edge clique covers of graphs |
Michael, T.S. |
2006 |
96-97 | Index 1 |
p. 1309-1313 5 p. |
artikel |
|
| 3039 | Splicing representations of strictly locally testable languages |
Head, Tom |
1998 |
96-97 | Index 1 |
p. 139-147 9 p. |
artikel |
|
| 3040 | splitting number is NP-complete |
Faria, L. |
2001 |
96-97 | Index 1 |
p. 65-83 19 p. |
artikel |
|
| 3041 | Spreading in graphs |
Brešar, Boštjan |
|
96-97 | Index 1 |
p. 139-150 |
artikel |
|
| 3042 | Stability aspects of the traveling salesman problem based on k-best solutions |
Libura, Marek |
1998 |
96-97 | Index 1 |
p. 159-185 27 p. |
artikel |
|
| 3043 | Stable- Π partitions of graphs |
Dabrowski, Konrad K. |
2015 |
96-97 | Index 1 |
p. 104-114 11 p. |
artikel |
|
| 3044 | Star-critical Ramsey number of F n versus K 4 |
Haghi, Sh. |
2017 |
96-97 | Index 1 |
p. 203-209 7 p. |
artikel |
|
| 3045 | Star-critical Ramsey numbers |
Hook, Jonelle |
2011 |
96-97 | Index 1 |
p. 328-334 7 p. |
artikel |
|
| 3046 | Star-critical Ramsey numbers involving large books |
Li, Yan |
|
96-97 | Index 1 |
p. 68-76 |
artikel |
|
| 3047 | Star-factors with large components, fractional k -extendability and spectral radius in graphs |
Zhou, Sizhong |
|
96-97 | Index 1 |
p. 402-411 |
artikel |
|
| 3048 | State transfer and star complements in graphs |
Zhou, Jiang |
|
96-97 | Index 1 |
p. 130-134 |
artikel |
|
| 3049 | Statistics on bargraphs viewed as cornerless Motzkin paths |
Deutsch, Emeric |
2017 |
96-97 | Index 1 |
p. 54-66 13 p. |
artikel |
|
| 3050 | Steinberg-like theorems for backbone colouring |
Araujo, J. |
2018 |
96-97 | Index 1 |
p. 155-167 |
artikel |
|
| 3051 | Steiner intervals in graphs |
Kubicka, Ewa |
1998 |
96-97 | Index 1 |
p. 181-190 10 p. |
artikel |
|
| 3052 | Stirling networks: a versatile combinatorial topology for multiprocessor systems |
Das, Sajal K. |
1992 |
96-97 | Index 1 |
p. 119-146 28 p. |
artikel |
|
| 3053 | Strengthened bounds for the probability of k -out-of- n events |
Qiu, Feng |
2016 |
96-97 | Index 1 |
p. 232-240 9 p. |
artikel |
|
| 3054 | Strengthened Ore conditions for ( s , t ) -supereulerian graphs |
Lei, Lan |
|
96-97 | Index 1 |
p. 68-80 |
artikel |
|
| 3055 | Strengthening Brooks’ chromatic bound on P 6 -free graphs |
Gupta, Uttam K. |
|
96-97 | Index 1 |
p. 334-346 |
artikel |
|
| 3056 | Strictly unimodality of the probability that the binomial distribution is more than its expectation |
Sun, Ping |
|
96-97 | Index 1 |
p. 1-5 |
artikel |
|
| 3057 | Strict neighbor-distinguishing index of K 4 -minor-free graphs |
Gu, Jing |
|
96-97 | Index 1 |
p. 87-95 |
artikel |
|
| 3058 | Strict 2-threshold graphs |
Mahadev, N.V.R. |
1988 |
96-97 | Index 1 |
p. 113-131 19 p. |
artikel |
|
| 3059 | Strong and weak edges of a graph and linkages with the vertex cover problem |
Han, Qiaoming |
2012 |
96-97 | Index 1 |
p. 197-203 7 p. |
artikel |
|
| 3060 | Strong chromatic index of K 1 , t -free graphs |
Dębski, Michał |
|
96-97 | Index 1 |
p. 53-60 |
artikel |
|
| 3061 | Strong edge-coloring of cubic bipartite graphs: A counterexample |
Cranston, Daniel W. |
|
96-97 | Index 1 |
p. 258-260 |
artikel |
|
| 3062 | Strong edge-coloring of 2-degenerate graphs |
Yu, Gexin |
|
96-97 | Index 1 |
p. 11-14 |
artikel |
|
| 3063 | Strong edge-colouring of sparse planar graphs |
Bensmail, Julien |
2014 |
96-97 | Index 1 |
p. 229-234 6 p. |
artikel |
|
| 3064 | Strong incidence coloring of outerplanar graphs |
Mousavi, Fatemeh Sadat |
|
96-97 | Index 1 |
p. 293-301 |
artikel |
|
| 3065 | Strong intractability results for generalized convex recoloring problems |
Moura, Phablo F.S. |
|
96-97 | Index 1 |
p. 252-260 |
artikel |
|
| 3066 | Strongly restricted permutations and tiling with fences |
Edwards, Kenneth |
2015 |
96-97 | Index 1 |
p. 82-90 9 p. |
artikel |
|
| 3067 | Strongly rigid tensegrity graphs on the line |
Jackson, Bill |
2013 |
96-97 | Index 1 |
p. 1147-1149 3 p. |
artikel |
|
| 3068 | Strong qualitative independence |
Katona, Gyula O.H. |
2004 |
96-97 | Index 1 |
p. 87-95 9 p. |
artikel |
|
| 3069 | Strong resolving partitions for strong product graphs and Cartesian product graphs |
González Yero, Ismael |
2016 |
96-97 | Index 1 |
p. 70-78 9 p. |
artikel |
|
| 3070 | Strong robustness of randomized rumor spreading protocols |
Doerr, Benjamin |
2013 |
96-97 | Index 1 |
p. 778-793 16 p. |
artikel |
|
| 3071 | Strong unimodularity for matrices and hypergraphs |
Crama, Yves |
1986 |
96-97 | Index 1 |
p. 221-239 19 p. |
artikel |
|
| 3072 | Structural analysis of a fractional matching problem |
Chandrasekaran, R. |
2009 |
96-97 | Index 1 |
p. 3708-3720 13 p. |
artikel |
|
| 3073 | Structurally parameterized d -scattered set |
Katsikarelis, Ioannis |
|
96-97 | Index 1 |
p. 168-186 |
artikel |
|
| 3074 | Structural parameterization for minimum conflict-free colouring |
Ashok, Pradeesha |
|
96-97 | Index 1 |
p. 239-253 |
artikel |
|
| 3075 | Structural parameters, tight bounds, and approximation for ( k , r ) -center |
Katsikarelis, Ioannis |
2019 |
96-97 | Index 1 |
p. 90-117 |
artikel |
|
| 3076 | Structural properties of matroid matchings |
Vande Vate, John H. |
1992 |
96-97 | Index 1 |
p. 69-85 17 p. |
artikel |
|
| 3077 | Structural properties of resonance graphs of plane elementary bipartite graphs |
Che, Zhongyuan |
|
96-97 | Index 1 |
p. 102-110 |
artikel |
|
| 3078 | Structure and coloring of ( P 7 , C 5 , diamond)-free graphs |
Chen, Ran |
|
96-97 | Index 1 |
p. 298-307 |
artikel |
|
| 3079 | Structure connectivity and substructure connectivity of star graphs |
Li, Chunfang |
|
96-97 | Index 1 |
p. 472-480 |
artikel |
|
| 3080 | Structure of cycles in minimal strong digraphs |
Arcos-Argudo, Miguel |
2019 |
96-97 | Index 1 |
p. 35-41 |
artikel |
|
| 3081 | Structure of i-components of perfect binary codes |
Solov'eva, F.I. |
2001 |
96-97 | Index 1 |
p. 189-197 9 p. |
artikel |
|
| 3082 | Structure of some ( P 7 , C 4 )-free graphs with application to colorings |
Chen, Ran |
|
96-97 | Index 1 |
p. 14-23 |
artikel |
|
| 3083 | Student-project allocation with preferences over projects: Algorithmic and experimental results |
Manlove, David |
|
96-97 | Index 1 |
p. 220-234 |
artikel |
|
| 3084 | Subdivisions of four blocks cycles in digraphs with large chromatic number |
Al-Mniny, Darine |
|
96-97 | Index 1 |
p. 71-75 |
artikel |
|
| 3085 | Subgraphs with orthogonal factorizations in graphs |
Zhou, Sizhong |
|
96-97 | Index 1 |
p. 29-34 |
artikel |
|
| 3086 | Subject index volumes 1–92 |
2000 |
96-97 | Index 1 |
p. 3-120 118 p. |
artikel |
||
| 3087 | Sublinear approximation algorithms for boxicity and related problems |
Adiga, Abhijin |
2018 |
96-97 | Index 1 |
p. 7-22 |
artikel |
|
| 3088 | Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem |
Conforti, Michele |
1984 |
96-97 | Index 1 |
p. 251-274 24 p. |
artikel |
|
| 3089 | Subnetwork reliability analysis in k -ary n -cubes |
Feng, Kai |
2019 |
96-97 | Index 1 |
p. 85-92 |
artikel |
|
| 3090 | Subnetwork reliability analysis of star networks |
Hu, Xiaomin |
|
96-97 | Index 1 |
p. 180-188 |
artikel |
|
| 3091 | Subset-conjunctive rules for breast cancer diagnosis |
Kohli, Rajeev |
2006 |
96-97 | Index 1 |
p. 1100-1112 13 p. |
artikel |
|
| 3092 | Substitutable choice functions and convex geometry |
Fuji, Jugo |
2015 |
96-97 | Index 1 |
p. 283-285 3 p. |
artikel |
|
| 3093 | Subtree and substar intersection numbers |
Chang, Yi-Wu |
1993 |
96-97 | Index 1 |
p. 205-220 16 p. |
artikel |
|
| 3094 | Sub-trees of a random tree |
Kamiński, Bogumił |
2019 |
96-97 | Index 1 |
p. 119-129 |
artikel |
|
| 3095 | Succinct data structures for bounded clique-width graphs |
Chakraborty, Sankardeep |
|
96-97 | Index 1 |
p. 55-68 |
artikel |
|
| 3096 | Sufficient conditions for a balanced bipartite digraph to be even pancyclic |
Darbinyan, Samvel Kh. |
2018 |
96-97 | Index 1 |
p. 70-76 |
artikel |
|
| 3097 | Sufficient conditions for graphs with girth g to be maximally k -restricted edge connected |
Zhang, Lei |
2019 |
96-97 | Index 1 |
p. 320-325 |
artikel |
|
| 3098 | Sufficient conditions for Hamiltonian cycles in bipartite digraphs |
Darbinyan, Samvel Kh. |
2019 |
96-97 | Index 1 |
p. 87-96 |
artikel |
|
| 3099 | Sufficient conditions for k -factors and spanning trees of graphs |
Ao, Guoyan |
|
96-97 | Index 1 |
p. 124-135 |
artikel |
|
| 3100 | Sufficient conditions for k -leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index |
An, Mingqiang |
|
96-97 | Index 1 |
p. 74-80 |
artikel |
|
| 3101 | Sufficient conditions for 2-rainbow connected graphs |
Kemnitz, Arnfried |
2016 |
96-97 | Index 1 |
p. 247-250 4 p. |
artikel |
|
| 3102 | Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs |
Chen, Zhibing |
2017 |
96-97 | Index 1 |
p. 64-70 7 p. |
artikel |
|
| 3103 | Sufficient sparseness conditions for G 2 to be ( Δ + 1 ) -choosable, when Δ ≥ 5 |
Cranston, Daniel W. |
2014 |
96-97 | Index 1 |
p. 167-176 10 p. |
artikel |
|
| 3104 | Sum of weighted distances in trees |
Cai, Qingqiong |
2019 |
96-97 | Index 1 |
p. 67-84 |
artikel |
|
| 3105 | Sums of squares based approximation algorithms for MAX-SAT |
van Maaren, H. |
2008 |
96-97 | Index 1 |
p. 1754-1779 26 p. |
artikel |
|
| 3106 | Super connectivity of folded twisted crossed cubes |
Guo, Litao |
|
96-97 | Index 1 |
p. 56-63 |
artikel |
|
| 3107 | Super edge-connectivity of dense digraphs and graphs |
Soneoka, Terunao |
1992 |
96-97 | Index 1 |
p. 511-523 13 p. |
artikel |
|
| 3108 | Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs |
Ma, Xiaoling |
2016 |
96-97 | Index 1 |
p. 111-130 20 p. |
artikel |
|
| 3109 | Supereulerianity of k -edge-connected graphs with a restriction on small bonds |
Niu, Zhaohong |
2010 |
96-97 | Index 1 |
p. 37-43 7 p. |
artikel |
|
| 3110 | Super-simple balanced incomplete block designs with block size 5 and index 3 |
Chen, Kejun |
2013 |
96-97 | Index 1 |
p. 2396-2404 9 p. |
artikel |
|
| 3111 | Super-simple Steiner pentagon systems |
Abel, R.J.R. |
2008 |
96-97 | Index 1 |
p. 780-793 14 p. |
artikel |
|
| 3112 | Super-simple (v,5,2)-designs |
O.F. Gronau, Hans-Dietrich |
2004 |
96-97 | Index 1 |
p. 65-77 13 p. |
artikel |
|
| 3113 | Super-simple ( v , 5 , 4 ) designs |
Chen, Kejun |
2007 |
96-97 | Index 1 |
p. 904-913 10 p. |
artikel |
|
| 3114 | Super-simple ( v , 4 , 2 ) directed designs and a lower bound for the minimum size of their defining set |
Boostan, M. |
2016 |
96-97 | Index 1 |
p. 14-23 10 p. |
artikel |
|
| 3115 | Surface digitizations by dilations which are tunnel-free |
Lincke, C. |
2003 |
96-97 | Index 1 |
p. 81-91 11 p. |
artikel |
|
| 3116 | Surrogate duality relaxation for job shop scheduling |
Fisher, M.L. |
1983 |
96-97 | Index 1 |
p. 65-75 11 p. |
artikel |
|
| 3117 | Switchdec polyhedra |
Gaillard, A. |
1997 |
96-97 | Index 1 |
p. 141-163 23 p. |
artikel |
|
| 3118 | Sylvester power and weighted sums on the Frobenius set in arithmetic progression |
Komatsu, Takao |
|
96-97 | Index 1 |
p. 110-126 |
artikel |
|
| 3119 | Symmetric matrices and codes correcting rank errors beyond the ⌊ ( d - 1 ) / 2 ⌋ bound |
Gabidulin, Ernst M. |
2006 |
96-97 | Index 1 |
p. 305-312 8 p. |
artikel |
|
| 3120 | Symmetric property and reliability of locally twisted cubes |
Chang, Xuenan |
|
96-97 | Index 1 |
p. 257-269 |
artikel |
|
| 3121 | Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes |
Xu, Liqiong |
|
96-97 | Index 1 |
p. 41-45 |
artikel |
|
| 3122 | Symmetries and sense of direction in labeled graphs |
Flocchini, Paola |
1998 |
96-97 | Index 1 |
p. 99-115 17 p. |
artikel |
|
| 3123 | Synthetic description of a semiorder |
Pirlot, Marc |
1991 |
96-97 | Index 1 |
p. 299-308 10 p. |
artikel |
|
| 3124 | System of unbiased representatives for a collection of bicolorings |
Balachandran, Niranjan |
|
96-97 | Index 1 |
p. 116-127 |
artikel |
|
| 3125 | Systems of distant representatives |
Fiala, Jiří |
2005 |
96-97 | Index 1 |
p. 306-316 11 p. |
artikel |
|
| 3126 | Systems of sets such that each set properly intersects at most one other set—Application to cluster analysis |
Bertrand, P. |
2008 |
96-97 | Index 1 |
p. 1220-1236 17 p. |
artikel |
|
| 3127 | Tandem cyclic alignment |
Benson, Gary |
2005 |
96-97 | Index 1 |
p. 124-133 10 p. |
artikel |
|
| 3128 | Target set selection for conservative populations |
Feige, Uriel |
|
96-97 | Index 1 |
p. 119-132 |
artikel |
|
| 3129 | Target set selection with maximum activation time |
Keiler, Lucas |
|
96-97 | Index 1 |
p. 199-217 |
artikel |
|
| 3130 | T-choosability in graphs |
Alon, Noga |
1998 |
96-97 | Index 1 |
p. 1-13 13 p. |
artikel |
|
| 3131 | t -CIS codes over G F ( p ) and orthogonal arrays |
Kim, Hyun Jin |
2017 |
96-97 | Index 1 |
p. 601-612 12 p. |
artikel |
|
| 3132 | TC operations and Latin bricks |
Hazan, Simone |
1989 |
96-97 | Index 1 |
p. 167-177 11 p. |
artikel |
|
| 3133 | 25th Anniversary Econometric Institute, Rotterdam |
1981 |
96-97 | Index 1 |
p. 328- 1 p. |
artikel |
||
| 3134 | The advantage of truncated permutations |
Gilboa, Shoni |
|
96-97 | Index 1 |
p. 214-223 |
artikel |
|
| 3135 | The algorithm and complexity of secure domination in 3-dimensional box graphs |
Wang, Cai-Xia |
|
96-97 | Index 1 |
p. 63-74 |
artikel |
|
| 3136 | The algorithmic complexity of minus domination in graphs |
Dunbar, Jean |
1996 |
96-97 | Index 1 |
p. 73-84 12 p. |
artikel |
|
| 3137 | The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs |
Fiol, M.A. |
1998 |
96-97 | Index 1 |
p. 77-97 21 p. |
artikel |
|
| 3138 | The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets |
Dannenberg, Katharina |
2019 |
96-97 | Index 1 |
p. 101-114 |
artikel |
|
| 3139 | The arborescence-realization problem |
Swaminathan, R.P. |
1995 |
96-97 | Index 1 |
p. 267-283 17 p. |
artikel |
|
| 3140 | The arithmetic-periodicity of cut for C = { 1 , 2 c } |
Ellis, Paul |
|
96-97 | Index 1 |
p. 391-403 |
artikel |
|
| 3141 | The asymptotic value of graph energy for random graphs with degree-based weights |
Li, Xueliang |
|
96-97 | Index 1 |
p. 481-488 |
artikel |
|
| 3142 | The availability of crumbling wall quorum systems |
Peleg, David |
1997 |
96-97 | Index 1 |
p. 69-83 15 p. |
artikel |
|
| 3143 | The average connectivity of a digraph |
Henning, Michael A. |
2004 |
96-97 | Index 1 |
p. 143-153 11 p. |
artikel |
|
| 3144 | The average dimension of the hull of cyclic codes |
Skersys, Gintaras |
2003 |
96-97 | Index 1 |
p. 275-292 18 p. |
artikel |
|
| 3145 | The average Laplacian polynomial of a graph |
Zhang, Yanan |
|
96-97 | Index 1 |
p. 737-743 |
artikel |
|
| 3146 | The average reliability of a graph |
Brown, J.I. |
2014 |
96-97 | Index 1 |
p. 19-33 15 p. |
artikel |
|
| 3147 | The bank safe problem |
Von Randow, R. |
1982 |
96-97 | Index 1 |
p. 335-337 3 p. |
artikel |
|
| 3148 | The basic algorithm for pseudo-Boolean programming revisited |
Crama, Yves |
1990 |
96-97 | Index 1 |
p. 171-185 15 p. |
artikel |
|
| 3149 | The b -chromatic number and f -chromatic vertex number of regular graphs |
El Sahili, Amine |
2014 |
96-97 | Index 1 |
p. 79-85 7 p. |
artikel |
|
| 3150 | The b-chromatic number of a graph |
Irving, Robert W. |
1999 |
96-97 | Index 1 |
p. 127-141 15 p. |
artikel |
|
| 3151 | The biclique partitioning polytope |
de Sousa Filho, Gilberto F. |
|
96-97 | Index 1 |
p. 118-130 |
artikel |
|
| 3152 | The Bin Packing Problem with Item Fragmentation:A worst-case analysis |
Bertazzi, Luca |
2019 |
96-97 | Index 1 |
p. 63-77 |
artikel |
|
| 3153 | The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases |
Punnen, Abraham P. |
2015 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 3154 | The bisection width and the isoperimetric number of arrays |
Cemil Azizoğlu, M |
2004 |
96-97 | Index 1 |
p. 3-12 10 p. |
artikel |
|
| 3155 | The bottleneck 2-connected k -Steiner network problem for k ≤ 2 |
Brazil, M. |
2012 |
96-97 | Index 1 |
p. 1028-1038 11 p. |
artikel |
|
| 3156 | The boundary of a graph and its isoperimetric inequality |
Steinerberger, Stefan |
|
96-97 | Index 1 |
p. 125-134 |
artikel |
|
| 3157 | The box-TDI system associated with 2-edge connected spanning subgraphs |
Chen, Xujin |
2009 |
96-97 | Index 1 |
p. 118-125 8 p. |
artikel |
|
| 3158 | The caterpillar-packing polytope |
Marenco, Javier |
2018 |
96-97 | Index 1 |
p. 4-15 |
artikel |
|
| 3159 | The channel capacity of read/write isolated memory |
Wang, Chuanlong |
2016 |
96-97 | Index 1 |
p. 264-273 10 p. |
artikel |
|
| 3160 | The characterization of branching dependencies |
Demetrovics, János |
1992 |
96-97 | Index 1 |
p. 139-153 15 p. |
artikel |
|
| 3161 | The chromatic number of odd-hole-free graphs |
Chen, Rong |
|
96-97 | Index 1 |
p. 84-87 |
artikel |
|
| 3162 | The chromatic number of signed graphs with bounded maximum average degree |
Jacques, Fabien |
|
96-97 | Index 1 |
p. 43-59 |
artikel |
|
| 3163 | The circular chromatic number of signed series–parallel graphs of given girth |
Zhu, Jialu |
|
96-97 | Index 1 |
p. 82-92 |
artikel |
|
| 3164 | The clique distribution in powers of hypercubes |
Kou, Yongfang |
|
96-97 | Index 1 |
p. 76-85 |
artikel |
|
| 3165 | The clique operator on circular-arc graphs |
Lin, Min Chih |
2010 |
96-97 | Index 1 |
p. 1259-1267 9 p. |
artikel |
|
| 3166 | The clique operator on graphs with few P 4 's |
de Mello, C.P. |
2006 |
96-97 | Index 1 |
p. 485-492 8 p. |
artikel |
|
| 3167 | The combinatorics of Motzkin polyominoes |
Baril, Jean-Luc |
|
96-97 | Index 1 |
p. 1-15 |
artikel |
|
| 3168 | The combinatorics of tandem duplication |
Penso-Dolfin, L. |
2015 |
96-97 | Index 1 |
p. 1-22 22 p. |
artikel |
|
| 3169 | The competition number of a graph whose holes do not overlap much |
Kim, Suh-Ryung |
2010 |
96-97 | Index 1 |
p. 1456-1460 5 p. |
artikel |
|
| 3170 | The competition number of a graph with exactly h holes, all of which are independent |
Li, Bo-Jr |
2009 |
96-97 | Index 1 |
p. 1337-1341 5 p. |
artikel |
|
| 3171 | The complexity of colouring symmetric relational systems |
Brewster, Richard |
1994 |
96-97 | Index 1 |
p. 95-105 11 p. |
artikel |
|
| 3172 | The complexity of completing partial Latin squares |
Colbourn, Charles J. |
1984 |
96-97 | Index 1 |
p. 25-30 6 p. |
artikel |
|
| 3173 | The complexity of detecting fixed-density clusters |
Holzapfel, Klaus |
2006 |
96-97 | Index 1 |
p. 1547-1562 16 p. |
artikel |
|
| 3174 | The complexity of dissociation set problems in graphs |
Orlovich, Yury |
2011 |
96-97 | Index 1 |
p. 1352-1366 15 p. |
artikel |
|
| 3175 | The complexity of finding arc-disjoint branching flows |
Bang-Jensen, J. |
2016 |
96-97 | Index 1 |
p. 16-26 11 p. |
artikel |
|
| 3176 | The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem |
Dantas, Simone |
2015 |
96-97 | Index 1 |
p. 15-24 10 p. |
artikel |
|
| 3177 | The complexity of generalized clique covering |
Corneil, D.G. |
1988 |
96-97 | Index 1 |
p. 109-118 10 p. |
artikel |
|
| 3178 | The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization |
Mielikäinen, Taneli |
2006 |
96-97 | Index 1 |
p. 684-691 8 p. |
artikel |
|
| 3179 | The complexity of minimizing certain cost metrics for k-source spanning trees |
Connamacher, Harold S. |
2003 |
96-97 | Index 1 |
p. 113-127 15 p. |
artikel |
|
| 3180 | The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence |
Kalinowski, Thomas |
2009 |
96-97 | Index 1 |
p. 2089-2104 16 p. |
artikel |
|
| 3181 | The complexity of minimum convex coloring |
Kammer, Frank |
2012 |
96-97 | Index 1 |
p. 810-833 24 p. |
artikel |
|
| 3182 | The complexity of recognizing tough cubic graphs |
Bauer, D. |
1997 |
96-97 | Index 1 |
p. 35-44 10 p. |
artikel |
|
| 3183 | The complexity of register allocation |
Krause, Philipp Klaus |
2014 |
96-97 | Index 1 |
p. 51-59 9 p. |
artikel |
|
| 3184 | The complexity of restricted star colouring |
M.A., Shalu |
|
96-97 | Index 1 |
p. 327-350 |
artikel |
|
| 3185 | The complexity of the locally connected spanning tree problem |
Cai, Leizhen |
2003 |
96-97 | Index 1 |
p. 63-75 13 p. |
artikel |
|
| 3186 | The complexity of tropical graph homomorphisms |
Foucaud, Florent |
2017 |
96-97 | Index 1 |
p. 64-81 18 p. |
artikel |
|
| 3187 | The computational complexity of the backbone coloring problem for planar graphs with connected backbones |
Janczewski, Robert |
2015 |
96-97 | Index 1 |
p. 237-242 6 p. |
artikel |
|
| 3188 | The connection between polynomial optimization, maximum cliques and Turán densities |
Wu, Biao |
2017 |
96-97 | Index 1 |
p. 114-121 8 p. |
artikel |
|
| 3189 | The connectivity of a graph and its complement |
Hellwig, Angelika |
2008 |
96-97 | Index 1 |
p. 3325-3328 4 p. |
artikel |
|
| 3190 | The connectivity of hierarchical Cayley digraphs |
Hamidoune, Y.O. |
1992 |
96-97 | Index 1 |
p. 275-280 6 p. |
artikel |
|
| 3191 | The convexity spectra of graphs |
Tong, Li-Da |
2008 |
96-97 | Index 1 |
p. 1838-1845 8 p. |
artikel |
|
| 3192 | The co-secure domination in proper interval graphs |
Zou, Yun-Hao |
|
96-97 | Index 1 |
p. 68-71 |
artikel |
|
| 3193 | The covering radius of Hadamard codes in odd graphs |
Solé, Patrick |
1992 |
96-97 | Index 1 |
p. 501-510 10 p. |
artikel |
|
| 3194 | The crossing number of locally twisted cubes L T Q n |
Lingqi, Zhao |
|
96-97 | Index 1 |
p. 407-418 |
artikel |
|
| 3195 | The crossing numbers of generalized Petersen graphs with small order |
Lin, Xiaohui |
2009 |
96-97 | Index 1 |
p. 1016-1023 8 p. |
artikel |
|
| 3196 | The cyclic wirelength of trees |
Bezrukov, S.L. |
1998 |
96-97 | Index 1 |
p. 275-277 3 p. |
artikel |
|
| 3197 | The decycling number of generalized Petersen graphs |
Gao, Liqing |
2015 |
96-97 | Index 1 |
p. 297-300 4 p. |
artikel |
|
| 3198 | The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension |
Maiorov, Vitaly |
1998 |
96-97 | Index 1 |
p. 81-93 13 p. |
artikel |
|
| 3199 | The degree sequence of the preferential attachment model |
Yu, Lu |
|
96-97 | Index 1 |
p. 158-167 |
artikel |
|
| 3200 | The delay of circuits whose inputs have specified arrival times |
Rautenbach, Dieter |
2007 |
96-97 | Index 1 |
p. 1233-1243 11 p. |
artikel |
|
| 3201 | The depth and width of local minima in discrete solution spaces |
Ryan, Jennifer |
1995 |
96-97 | Index 1 |
p. 75-82 8 p. |
artikel |
|
| 3202 | The difference between remoteness and radius of a graph |
Hua, Hongbo |
2015 |
96-97 | Index 1 |
p. 103-110 8 p. |
artikel |
|
| 3203 | The differential of the line graph L ( G ) |
Basilio, Ludwin A. |
|
96-97 | Index 1 |
p. 82-89 |
artikel |
|
| 3204 | The diophantine problem of Frobenius: A close bound |
Krawczyk, Hugo |
1989 |
96-97 | Index 1 |
p. 289-291 3 p. |
artikel |
|
| 3205 | The discrete Radon transform and its approximate inversion via linear programming |
Fishburn, Peter |
1997 |
96-97 | Index 1 |
p. 39-61 23 p. |
artikel |
|
| 3206 | The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities |
Yokote, Koji |
|
96-97 | Index 1 |
p. 134-143 |
artikel |
|
| 3207 | The disjoint shortest paths problem |
Eilam-Tzoreff, Tali |
1998 |
96-97 | Index 1 |
p. 113-138 26 p. |
artikel |
|
| 3208 | The disjunctivities of ω-languages |
Yeh, Y.T |
2003 |
96-97 | Index 1 |
p. 627-641 15 p. |
artikel |
|
| 3209 | The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes |
Kim, Jon-Lark |
2011 |
96-97 | Index 1 |
p. 2222-2228 7 p. |
artikel |
|
| 3210 | The distance-edge-monitoring numbers of subdivision graphs |
Ji, Zhen |
|
96-97 | Index 1 |
p. 37-47 |
artikel |
|
| 3211 | The domination number of the graph defined by two levels of the n -cube |
Badakhshian, Leila |
2019 |
96-97 | Index 1 |
p. 30-37 |
artikel |
|
| 3212 | The D -representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words |
Chuan, Wai-Fong |
2014 |
96-97 | Index 1 |
p. 71-83 13 p. |
artikel |
|
| 3213 | The edge-chromatic class of regular graphs of degree 4 and their complements |
Chetwynd, A.G |
1987 |
96-97 | Index 1 |
p. 125-134 10 p. |
artikel |
|
| 3214 | The edge-diametric theorem in Hamming spaces |
Bey, Christian |
2008 |
96-97 | Index 1 |
p. 1510-1517 8 p. |
artikel |
|
| 3215 | The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph |
Zhang, Mingzu |
|
96-97 | Index 1 |
p. 322-330 |
artikel |
|
| 3216 | The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree |
Qiao, Hongwei |
|
96-97 | Index 1 |
p. 174-181 |
artikel |
|
| 3217 | The effect of machine availability on the worst-case performance of LPT |
Hwang, Hark-Chin |
2005 |
96-97 | Index 1 |
p. 49-61 13 p. |
artikel |
|
| 3218 | The effect of side-information on smooth entropy |
Yang, Bo |
2004 |
96-97 | Index 1 |
p. 151-157 7 p. |
artikel |
|
| 3219 | The expected number of symmetries in locally restricted trees II |
McKeon, Kathleen A. |
1996 |
96-97 | Index 1 |
p. 245-253 9 p. |
artikel |
|
| 3220 | The expected values for the Kirchhoff indices in the random hexagonal-quadrilateral chain and its spiro chain |
Qin, Wei |
|
96-97 | Index 1 |
p. 150-163 |
artikel |
|
| 3221 | The exponential growth of the packing chromatic number of iterated Mycielskians |
Bidine, Ez-Zobair |
|
96-97 | Index 1 |
p. 232-241 |
artikel |
|
| 3222 | The exponent of the primitive Cayley digraphs on finite Abelian groups |
Jian-Zhong, Wang |
1997 |
96-97 | Index 1 |
p. 177-191 15 p. |
artikel |
|
| 3223 | The extendability of Cayley graphs generated by transpositions |
Feng, Yong-De |
|
96-97 | Index 1 |
p. 134-139 |
artikel |
|
| 3224 | The 3-extra conditional diagnosability of balanced hypercubes under MM ∗ model |
Li, Lili |
|
96-97 | Index 1 |
p. 310-316 |
artikel |
|
| 3225 | The extremal values of the Wiener index of a tree with given degree sequence |
Wang, Hua |
2008 |
96-97 | Index 1 |
p. 2647-2654 8 p. |
artikel |
|
| 3226 | The fault-diameter and wide-diameter of twisted hypercubes |
Qi, Hao |
2018 |
96-97 | Index 1 |
p. 154-160 |
artikel |
|
| 3227 | The fault tolerance of ( n , k ) -bubble-sort networks |
Zhao, Shu-Li |
|
96-97 | Index 1 |
p. 204-211 |
artikel |
|
| 3228 | The feasibility problem for line graphs |
Caro, Yair |
|
96-97 | Index 1 |
p. 167-180 |
artikel |
|
| 3229 | The firefighter problem with more than one firefighter on trees |
Bazgan, Cristina |
2013 |
96-97 | Index 1 |
p. 899-908 10 p. |
artikel |
|
| 3230 | The first order definability of graphs: Upper bounds for quantifier depth |
Pikhurko, Oleg |
2006 |
96-97 | Index 1 |
p. 2511-2529 19 p. |
artikel |
|
| 3231 | The flip Markov chain for connected regular graphs |
Cooper, Colin |
2019 |
96-97 | Index 1 |
p. 56-79 |
artikel |
|
| 3232 | The forcing hull and forcing geodetic numbers of graphs |
Tong, Li-Da |
2009 |
96-97 | Index 1 |
p. 1159-1163 5 p. |
artikel |
|
| 3233 | The forwarding index of directed networks |
Manoussakis, Yannis |
1996 |
96-97 | Index 1 |
p. 279-291 13 p. |
artikel |
|
| 3234 | The fractional strong metric dimension in three graph products |
Kang, Cong X. |
2018 |
96-97 | Index 1 |
p. 190-203 |
artikel |
|
| 3235 | The fractional weak discrepancy of a partially ordered set |
Shuchat, Alan |
2007 |
96-97 | Index 1 |
p. 2227-2235 9 p. |
artikel |
|
| 3236 | The game chromatic index of some trees of maximum degree 4 |
Chan, Wai Hong |
2014 |
96-97 | Index 1 |
p. 1-6 6 p. |
artikel |
|
| 3237 | The gap between the rank of a complex unit gain graph and its underlying graph |
Du, Kexin |
|
96-97 | Index 1 |
p. 399-412 |
artikel |
|
| 3238 | The generalized connectivity of alternating group graphs and ( n , k ) -star graphs |
Zhao, Shu-Li |
2018 |
96-97 | Index 1 |
p. 310-321 |
artikel |
|
| 3239 | The generalized 4-connectivity of burnt pancake graphs |
Wang, Jing |
|
96-97 | Index 1 |
p. 93-114 |
artikel |
|
| 3240 | The generalized 4-connectivity of hierarchical cubic networks |
Zhao, Shu-Li |
|
96-97 | Index 1 |
p. 194-206 |
artikel |
|
| 3241 | The generalized 4-connectivity of hypercubes |
Lin, Shangwei |
2017 |
96-97 | Index 1 |
p. 60-67 8 p. |
artikel |
|
| 3242 | The geometry of carpentry and joinery |
Morin, Pat |
2004 |
96-97 | Index 1 |
p. 374-380 7 p. |
artikel |
|
| 3243 | The Gergonne p-pile problem and the dynamics of the function x |→ ⌊ (x + r) p ⌋ |
Harrison, John |
1998 |
96-97 | Index 1 |
p. 103-113 11 p. |
artikel |
|
| 3244 | The global forcing number of the parallelogram polyhex |
Sedlar, Jelena |
2012 |
96-97 | Index 1 |
p. 2306-2313 8 p. |
artikel |
|
| 3245 | The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs |
Wang, Mujiangshan |
2018 |
96-97 | Index 1 |
p. 108-118 |
artikel |
|
| 3246 | The 1-good neighbor connectivity of unidirectional star graph networks |
Li, Chunfang |
|
96-97 | Index 1 |
p. 1-11 |
artikel |
|
| 3247 | The Gowers U 3 norm of one family of cubic power permutations |
Li, Zhaole |
|
96-97 | Index 1 |
p. 208-222 |
artikel |
|
| 3248 | The graph sandwich problem for 1-join composition is NP-complete |
de Figueiredo, Celina M.H. |
2002 |
96-97 | Index 1 |
p. 73-82 10 p. |
artikel |
|
| 3249 | The graphs cospectral with the pineapple graph |
Topcu, Hatice |
2019 |
96-97 | Index 1 |
p. 52-59 |
artikel |
|
| 3250 | The Hamilton Cycle Problem for locally traceable and locally hamiltonian graphs |
de Wet, Johan P. |
2019 |
96-97 | Index 1 |
p. 291-308 |
artikel |
|
| 3251 | The hamiltonicity and path t -coloring of Sierpiński-like graphs |
Xue, Bing |
2012 |
96-97 | Index 1 |
p. 1822-1836 15 p. |
artikel |
|
| 3252 | The Hamiltonicity of directed σ-τ Cayley graphs (Or: A tale of backtracking) |
Ruskey, Frank |
1995 |
96-97 | Index 1 |
p. 75-83 9 p. |
artikel |
|
| 3253 | The hardness of approximating the boxicity, cubicity and threshold dimension of a graph |
Adiga, Abhijin |
2010 |
96-97 | Index 1 |
p. 1719-1726 8 p. |
artikel |
|
| 3254 | The height and width of bargraphs |
Blecher, Aubrey |
2015 |
96-97 | Index 1 |
p. 36-44 9 p. |
artikel |
|
| 3255 | The h -extra connectivity and h -extra conditional diagnosability of Bubble-sort star graphs |
Zhu, Q. |
2018 |
96-97 | Index 1 |
p. 322-333 |
artikel |
|
| 3256 | The hierarchy of circuit diameters and transportation polytopes |
Borgwardt, S. |
2018 |
96-97 | Index 1 |
p. 8-24 |
artikel |
|
| 3257 | The high order spectral extremal results for graphs and their applications |
Liu, Chunmeng |
|
96-97 | Index 1 |
p. 209-214 |
artikel |
|
| 3258 | The Horn renamability, q-Horn and SLUR threshold for random k -CNF formulas |
Chao, D. |
2015 |
96-97 | Index 1 |
p. 44-51 8 p. |
artikel |
|
| 3259 | The Hosoya polynomial decomposition for catacondensed benzenoid graphs |
Xu, Shoujun |
2008 |
96-97 | Index 1 |
p. 2930-2938 |
artikel |
|
| 3260 | The h -restricted connectivity of balanced hypercubes |
Cheng, Dongqin |
|
96-97 | Index 1 |
p. 133-141 |
artikel |
|
| 3261 | The hyper-Wiener index of the generalized hierarchical product of graphs |
Eliasi, Mehdi |
2011 |
96-97 | Index 1 |
p. 866-871 6 p. |
artikel |
|
| 3262 | The incidence game chromatic number |
Andres, Stephan Dominique |
2009 |
96-97 | Index 1 |
p. 1980-1987 8 p. |
artikel |
|
| 3263 | The inclusion-free edge-colorings of ( 3 , Δ ) -bipartite graphs |
Chen, Lily |
|
96-97 | Index 1 |
p. 159-164 |
artikel |
|
| 3264 | The indefinite zero-one quadratic problem |
Carter, Michael W. |
1984 |
96-97 | Index 1 |
p. 23-44 22 p. |
artikel |
|
| 3265 | The Independence Number for De Bruijn networks and Kautz networks |
Deng, Zhi-Guo |
2008 |
96-97 | Index 1 |
p. 3035-3039 |
artikel |
|
| 3266 | The independence polynomial of rooted products of graphs |
Rosenfeld, Vladimir R. |
2010 |
96-97 | Index 1 |
p. 551-558 8 p. |
artikel |
|
| 3267 | The α -index of graphs without intersecting triangles/quadrangles as a minor |
Zhang, Yanting |
|
96-97 | Index 1 |
p. 324-335 |
artikel |
|
| 3268 | The infection time of graphs |
Dimitriou, Tassos |
2006 |
96-97 | Index 1 |
p. 2577-2589 13 p. |
artikel |
|
| 3269 | The integrity of a cubic graph |
Vince, A. |
2004 |
96-97 | Index 1 |
p. 223-239 17 p. |
artikel |
|
| 3270 | The interior and exterior polynomials are well-defined |
Guan, Xiaxia |
|
96-97 | Index 1 |
p. 246-253 |
artikel |
|
| 3271 | The Intermediate Price of Anarchy ( I P o A ) in bin packing games |
Dosa, Gyorgy |
2018 |
96-97 | Index 1 |
p. 16-25 |
artikel |
|
| 3272 | The intersection spectrum of hooked Skolem sequences and applications |
Shalaby, Nabil |
2014 |
96-97 | Index 1 |
p. 239-260 22 p. |
artikel |
|
| 3273 | The interval number of a complete multipartite graph |
Hopkins, Laurie B. |
1984 |
96-97 | Index 1 |
p. 163-187 25 p. |
artikel |
|
| 3274 | The interval structure of ( 0 , 1 ) -matrices |
Brualdi, Richard A. |
2019 |
96-97 | Index 1 |
p. 3-15 |
artikel |
|
| 3275 | The 0–1 inverse maximum stable set problem |
Chung, Yerim |
2008 |
96-97 | Index 1 |
p. 2501-2516 16 p. |
artikel |
|
| 3276 | The inverse protein folding problem on 2D and 3D lattices |
Berman, Piotr |
2007 |
96-97 | Index 1 |
p. 719-732 14 p. |
artikel |
|
| 3277 | The k -centrum Chinese Postman delivery problem and a related cost allocation game |
Granot, Daniel |
2014 |
96-97 | Index 1 |
p. 100-108 9 p. |
artikel |
|
| 3278 | The κ k -connectivity of line graphs |
Li, Hengzhe |
|
96-97 | Index 1 |
p. 1-8 |
artikel |
|
| 3279 | The k -edge intersection graphs of paths in a tree |
Golumbic, Martin Charles |
2008 |
96-97 | Index 1 |
p. 451-461 11 p. |
artikel |
|
| 3280 | The k -rainbow bondage number of a graph |
Dehgardi, N. |
2014 |
96-97 | Index 1 |
p. 133-139 7 p. |
artikel |
|
| 3281 | The k -rainbow reinforcement numbers in graphs |
Amjadi, J. |
2017 |
96-97 | Index 1 |
p. 394-404 11 p. |
artikel |
|
| 3282 | The k -regular induced subgraph problem |
Agra, Agostinho |
2017 |
96-97 | Index 1 |
p. 14-30 17 p. |
artikel |
|
| 3283 | The Laplacian characteristic polynomial of the path-tree of the complete graph |
Zhou, Jinqiu |
|
96-97 | Index 1 |
p. 308-313 |
artikel |
|
| 3284 | The leaf-free graphs with nullity 2 c ( G ) − 1 |
Chang, Sarula |
|
96-97 | Index 1 |
p. 44-54 |
artikel |
|
| 3285 | The least Euclidean distortion constant of a distance-regular graph |
Cioabă, Sebastian M. |
|
96-97 | Index 1 |
p. 212-225 |
artikel |
|
| 3286 | The level matrix of a tree and its spectrum |
Dossou-Olory, Audace A.V. |
|
96-97 | Index 1 |
p. 1-12 |
artikel |
|
| 3287 | The linear 2-arboricity of IC-planar graphs |
Liu, Juan |
|
96-97 | Index 1 |
p. 1-7 |
artikel |
|
| 3288 | The linear arboricity of K 5 -minor free graphs |
Yang, Fan |
|
96-97 | Index 1 |
p. 49-60 |
artikel |
|
| 3289 | The linear chromatic number of a Sperner family |
Akhtar, Reza |
2014 |
96-97 | Index 1 |
p. 1-8 8 p. |
artikel |
|
| 3290 | The Linzertorte problem, or a unified approach to painting, baking and weaving |
Hochbaum, Dorit S. |
1986 |
96-97 | Index 1 |
p. 17-32 16 p. |
artikel |
|
| 3291 | The L ( 2 , 1 ) -labeling of unigraphs |
Calamoneri, Tiziana |
2011 |
96-97 | Index 1 |
p. 1196-1206 11 p. |
artikel |
|
| 3292 | The L ( 2 , 1 ) -labelling of trees |
Wang, Wei-Fan |
2006 |
96-97 | Index 1 |
p. 598-603 6 p. |
artikel |
|
| 3293 | The localization game on Cartesian products |
Boshoff, Jeandré |
|
96-97 | Index 1 |
p. 247-259 |
artikel |
|
| 3294 | The localization game on oriented graphs |
Bonato, Anthony |
|
96-97 | Index 1 |
p. 145-157 |
artikel |
|
| 3295 | The L ( p , q ) -labelling of planar graphs without 4-cycles |
Zhu, Haiyang |
2014 |
96-97 | Index 1 |
p. 355-363 9 p. |
artikel |
|
| 3296 | The LPT heuristic for minimizing total load on a proportionate openshop |
Gerstl, Enrique |
|
96-97 | Index 1 |
p. 190-198 |
artikel |
|
| 3297 | The matching energy of random graphs |
Chen, Xiaolin |
2015 |
96-97 | Index 1 |
p. 102-109 8 p. |
artikel |
|
| 3298 | The matching polynomial of the path-tree of a complete graph |
Guo, Mingxu |
|
96-97 | Index 1 |
p. 244-249 |
artikel |
|
| 3299 | The max-flow min-cut property and ± 1 -resistant sets |
Abdi, Ahmad |
|
96-97 | Index 1 |
p. 455-476 |
artikel |
|
| 3300 | The maximal energy of classes of integral circulant graphs |
Sander, J.W. |
2012 |
96-97 | Index 1 |
p. 2015-2029 15 p. |
artikel |
|
| 3301 | The maximum agreement subtree problem |
Martin, Daniel M. |
2013 |
96-97 | Index 1 |
p. 1805-1817 13 p. |
artikel |
|
| 3302 | The maximum degree and diameter-bounded subgraph in the mesh |
Miller, Mirka |
2012 |
96-97 | Index 1 |
p. 1782-1790 9 p. |
artikel |
|
| 3303 | The maximum deviation just-in-time scheduling problem |
Brauner, N. |
2004 |
96-97 | Index 1 |
p. 25-50 26 p. |
artikel |
|
| 3304 | The maximum infection time of the P 3 convexity in graphs with bounded maximum degree |
Marcilon, Thiago |
2018 |
96-97 | Index 1 |
p. 245-257 |
artikel |
|
| 3305 | The maximum matching extendability and factor-criticality of 1-planar graphs |
Zhang, Jiangyue |
|
96-97 | Index 1 |
p. 247-254 |
artikel |
|
| 3306 | The maximum number of winning 2-sets |
West, Douglas B. |
1991 |
96-97 | Index 1 |
p. 279-284 6 p. |
artikel |
|
| 3307 | The maximum α -spectral radius and the majorization theorem of k -uniform supertrees |
You, Lihua |
|
96-97 | Index 1 |
p. 663-675 |
artikel |
|
| 3308 | The Maximum Travelling Salesman Problem on symmetric Demidenko matrices |
Deı̆neko, Vladimir G. |
2000 |
96-97 | Index 1 |
p. 413-425 13 p. |
artikel |
|
| 3309 | The median function of a block graph: Axiomatic characterizations |
Changat, Manoj |
|
96-97 | Index 1 |
p. 246-259 |
artikel |
|
| 3310 | The median function on graphs with bounded profiles |
Balakrishnan, Kannan |
2008 |
96-97 | Index 1 |
p. 2882-2889 |
artikel |
|
| 3311 | The median procedure in the semilattice of orders |
Leclerc, Bruno |
2003 |
96-97 | Index 1 |
p. 285-302 18 p. |
artikel |
|
| 3312 | The median procedure on median graphs |
McMorris, F.R. |
1998 |
96-97 | Index 1 |
p. 165-181 17 p. |
artikel |
|
| 3313 | The Metropolis algorithm for graph bisection |
Jerrum, Mark |
1998 |
96-97 | Index 1 |
p. 155-175 21 p. |
artikel |
|
| 3314 | The 22 minimal dichotomy decompositions of the K 5 -distance |
Fichet, Bernard |
2008 |
96-97 | Index 1 |
p. 1263-1270 8 p. |
artikel |
|
| 3315 | The minimum degree Group Steiner problem |
Kortsarz, Guy |
|
96-97 | Index 1 |
p. 229-239 |
artikel |
|
| 3316 | The minimum identifying code graphs |
Raspaud, André |
2012 |
96-97 | Index 1 |
p. 1385-1389 5 p. |
artikel |
|
| 3317 | The minimum number of e -vertex-covers among hypergraphs with e edges of given ranks |
Chang, F.H. |
2009 |
96-97 | Index 1 |
p. 164-169 6 p. |
artikel |
|
| 3318 | The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree |
Yang, Weihua |
2014 |
96-97 | Index 1 |
p. 304-309 6 p. |
artikel |
|
| 3319 | The minimum size of graphs satisfying cut conditions |
Jobson, Adam S. |
2018 |
96-97 | Index 1 |
p. 89-96 |
artikel |
|
| 3320 | The minimum spanning strong subdigraph problem is fixed parameter tractable |
Bang-Jensen, Jørgen |
2008 |
96-97 | Index 1 |
p. 2924-2929 |
artikel |
|
| 3321 | The minimum span of L(2,1)-labelings of certain generalized Petersen graphs |
Adams, Sarah Spence |
2007 |
96-97 | Index 1 |
p. 1314-1325 12 p. |
artikel |
|
| 3322 | The minimum span of L ( 2 , 1 ) -labelings of generalized flowers |
Karst, Nathaniel |
2015 |
96-97 | Index 1 |
p. 139-151 13 p. |
artikel |
|
| 3323 | The monadic second order logic of graphs VI: on several representations of graphs by relational structures |
Courcelle, Bruno |
1994 |
96-97 | Index 1 |
p. 117-149 33 p. |
artikel |
|
| 3324 | The multicolored graph realization problem |
Díaz, Josep |
|
96-97 | Index 1 |
p. 146-159 |
artikel |
|
| 3325 | The multiple originator broadcasting problem in graphs |
Chia, Ma-Lian |
2007 |
96-97 | Index 1 |
p. 1188-1199 12 p. |
artikel |
|
| 3326 | The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences |
Cheng, Christine T. |
|
96-97 | Index 1 |
p. 207-218 |
artikel |
|
| 3327 | The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut |
Cornaz, D. |
2019 |
96-97 | Index 1 |
p. 11-37 |
artikel |
|
| 3328 | The new FIFA rules are hard: complexity aspects of sports competitions |
Kern, Walter |
2001 |
96-97 | Index 1 |
p. 317-323 7 p. |
artikel |
|
| 3329 | The NLC-width and clique-width for powers of graphs of bounded tree-width |
Gurski, Frank |
2009 |
96-97 | Index 1 |
p. 583-595 13 p. |
artikel |
|
| 3330 | The no-meet matroid |
Ben-Ameur, Walid |
|
96-97 | Index 1 |
p. 94-107 |
artikel |
|
| 3331 | The nonidealness index of rank-ideal matrices |
Argiroffo, Gabriela R. |
2010 |
96-97 | Index 1 |
p. 1325-1335 11 p. |
artikel |
|
| 3332 | The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains |
Huang, Jing |
2016 |
96-97 | Index 1 |
p. 67-79 13 p. |
artikel |
|
| 3333 | The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions |
Chen, Xi |
|
96-97 | Index 1 |
p. 477-491 |
artikel |
|
| 3334 | The number of clone orderings |
Newberg, Lee Aaron |
1996 |
96-97 | Index 1 |
p. 233-245 13 p. |
artikel |
|
| 3335 | The number of convex polyominoes and the generating function of Jacobi polynomials |
Guo, Victor J.W. |
2006 |
96-97 | Index 1 |
p. 587-593 7 p. |
artikel |
|
| 3336 | The number of dissociation sets in connected graphs |
Yuan, Bo-Jun |
|
96-97 | Index 1 |
p. 196-203 |
artikel |
|
| 3337 | The number of excellent discrete Morse functions on graphs |
Ayala, R. |
2011 |
96-97 | Index 1 |
p. 1676-1688 13 p. |
artikel |
|
| 3338 | The number of independent sets of unicyclic graphs with given matching number |
Chen, Gong |
2012 |
96-97 | Index 1 |
p. 108-115 8 p. |
artikel |
|
| 3339 | The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs |
Korzhik, Vladimir P. |
|
96-97 | Index 1 |
p. 122-128 |
artikel |
|
| 3340 | The number of ribbon tilings for strips |
Chen, Yinsong |
|
96-97 | Index 1 |
p. 85-103 |
artikel |
|
| 3341 | The number of steps and the final configuration of relaxation procedures on graphs |
Chen, Sheng-Hua |
2015 |
96-97 | Index 1 |
p. 50-53 4 p. |
artikel |
|
| 3342 | The number of subtrees in graphs with given number of cut edges |
Xu, Kexiang |
|
96-97 | Index 1 |
p. 283-296 |
artikel |
|
| 3343 | The numbers of repeated palindromes in the Fibonacci and Tribonacci words |
Huang, Yuke |
2017 |
96-97 | Index 1 |
p. 78-90 13 p. |
artikel |
|
| 3344 | The optimal unicyclic graphs for pair-connected reliability |
Siegrist, Kyle T. |
1993 |
96-97 | Index 1 |
p. 235-243 9 p. |
artikel |
|
| 3345 | The Overfull Conjecture on split-comparability and split-interval graphs |
da Soledade Gonzaga, Luis Gustavo |
|
96-97 | Index 1 |
p. 228-238 |
artikel |
|
| 3346 | The packing chromatic number of hypercubes |
Torres, Pablo |
2015 |
96-97 | Index 1 |
p. 127-140 14 p. |
artikel |
|
| 3347 | The packing coloring of distance graphs D ( k , t ) |
Ekstein, Jan |
2014 |
96-97 | Index 1 |
p. 100-106 7 p. |
artikel |
|
| 3348 | The packing coloring problem for lobsters and partner limited graphs |
Argiroffo, G. |
2014 |
96-97 | Index 1 |
p. 373-382 10 p. |
artikel |
|
| 3349 | The parameterized complexity of the induced matching problem |
Moser, Hannes |
2009 |
96-97 | Index 1 |
p. 715-727 13 p. |
artikel |
|
| 3350 | The partial order competition dimensions of bipartite graphs |
Choi, Jihoon |
2019 |
96-97 | Index 1 |
p. 47-55 |
artikel |
|
| 3351 | The partition bargaining problem |
Rothblum, Uriel G. |
2008 |
96-97 | Index 1 |
p. 428-443 16 p. |
artikel |
|
| 3352 | The 3-path-connectivity of the hypercubes |
Zhu, Wen-Han |
|
96-97 | Index 1 |
p. 203-209 |
artikel |
|
| 3353 | The 3-path-connectivity of the star graphs |
Li, Lin |
|
96-97 | Index 1 |
p. 215-235 |
artikel |
|
| 3354 | The period of the Fibonacci random number generator |
Parker, J.D. |
1988 |
96-97 | Index 1 |
p. 145-164 20 p. |
artikel |
|
| 3355 | The pessimistic diagnosability of three kinds of graphs |
Gu, Mei-Mei |
2017 |
96-97 | Index 1 |
p. 548-556 9 p. |
artikel |
|
| 3356 | The Pfaffian property of circulant graphs |
Lu, Fuliang |
2015 |
96-97 | Index 1 |
p. 185-192 8 p. |
artikel |
|
| 3357 | The phylogeny number of a graph in the aspect of its triangles and diamonds |
Eoh, Soogang |
|
96-97 | Index 1 |
p. 304-314 |
artikel |
|
| 3358 | The planar multiterminal cut problem |
Hartvigsen, David |
1998 |
96-97 | Index 1 |
p. 203-222 20 p. |
artikel |
|
| 3359 | The planar Ramsey number P R ( C 4 , K 8 ) |
Chen, Yaojun |
2014 |
96-97 | Index 1 |
p. 28-34 7 p. |
artikel |
|
| 3360 | The p -maxian problem on interval graphs |
Cheng, Yukun |
2010 |
96-97 | Index 1 |
p. 1986-1993 8 p. |
artikel |
|
| 3361 | The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings |
Cazaux, Bastien |
2016 |
96-97 | Index 1 |
p. 48-60 13 p. |
artikel |
|
| 3362 | The preclusion numbers and edge preclusion numbers in a class of Cayley graphs |
Zhang, Guozhen |
|
96-97 | Index 1 |
p. 465-471 |
artikel |
|
| 3363 | The price of connectivity for dominating set: Upper bounds and complexity |
Camby, Eglantine |
2014 |
96-97 | Index 1 |
p. 53-59 7 p. |
artikel |
|
| 3364 | The price of connectivity for feedback vertex set |
Belmonte, Rémy |
2017 |
96-97 | Index 1 |
p. 132-143 12 p. |
artikel |
|
| 3365 | The probabilistic approach to limited packings in graphs |
Gagarin, Andrei |
2015 |
96-97 | Index 1 |
p. 146-153 8 p. |
artikel |
|
| 3366 | The profile of the Cartesian product of graphs |
Kuo, David |
2008 |
96-97 | Index 1 |
p. 2835-2845 |
artikel |
|
| 3367 | The proper 2-connection number and size of graphs |
Doan, Trung Duy |
|
96-97 | Index 1 |
p. 296-303 |
artikel |
|
| 3368 | The proper linear spaces on 17 points |
Betten, A |
1999 |
96-97 | Index 1 |
p. 83-108 26 p. |
artikel |
|
| 3369 | The pseudograph ( r , s , a , t ) -threshold number |
Hilton, Anthony J.W. |
2016 |
96-97 | Index 1 |
p. 153-163 11 p. |
artikel |
|
| 3370 | The quadratic M-convexity testing problem |
Iwamasa, Yuni |
2018 |
96-97 | Index 1 |
p. 106-114 |
artikel |
|
| 3371 | The query complexity of a permutation-based variant of Mastermind |
Afshani, Peyman |
2019 |
96-97 | Index 1 |
p. 28-50 |
artikel |
|
| 3372 | The rainbow numbers of cycles in maximal bipartite planar graph |
Ren, Lei |
|
96-97 | Index 1 |
p. 37-43 |
artikel |
|
| 3373 | The Ramsey number for a cycle of length six versus a clique of order eight |
Chen, Yaojun |
2009 |
96-97 | Index 1 |
p. 8-12 5 p. |
artikel |
|
| 3374 | The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph |
Wu, Qi |
|
96-97 | Index 1 |
p. 66-78 |
artikel |
|
| 3375 | The rank-width of the square grid |
Jelínek, Vít |
2010 |
96-97 | Index 1 |
p. 841-850 10 p. |
artikel |
|
| 3376 | The read once formula of a series–parallel network |
Mundici, Daniele |
|
96-97 | Index 1 |
p. 304-310 |
artikel |
|
| 3377 | The relationship between the eccentric connectivity index and Zagreb indices |
Hua, Hongbo |
2013 |
96-97 | Index 1 |
p. 2480-2491 12 p. |
artikel |
|
| 3378 | The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width |
Klasing, Ralf |
1998 |
96-97 | Index 1 |
p. 229-246 18 p. |
artikel |
|
| 3379 | The reliability analysis based on the generalized connectivity in balanced hypercubes |
Wei, Chao |
|
96-97 | Index 1 |
p. 19-32 |
artikel |
|
| 3380 | The resistance distance of a dual number weighted graph |
Li, Yu |
|
96-97 | Index 1 |
p. 154-165 |
artikel |
|
| 3381 | The resolution complexity of random graph k-colorability |
Beame, Paul |
2005 |
96-97 | Index 1 |
p. 25-47 23 p. |
artikel |
|
| 3382 | The restricted h -connectivity of the data center network DCell |
Wang, Xi |
2016 |
96-97 | Index 1 |
p. 144-157 14 p. |
artikel |
|
| 3383 | The Roman { 2 } -domatic number of graphs |
Volkmann, Lutz |
2019 |
96-97 | Index 1 |
p. 235-241 |
artikel |
|
| 3384 | The sandpile group of a polygon flower |
Chen, Haiyan |
2019 |
96-97 | Index 1 |
p. 68-82 |
artikel |
|
| 3385 | The sandwich problem for cutsets: Clique cutset, k -star cutset |
Teixeira, Rafael B. |
2006 |
96-97 | Index 1 |
p. 1791-1798 8 p. |
artikel |
|
| 3386 | The Schrijver system of the flow cone in series–parallel graphs |
Barbato, Michele |
|
96-97 | Index 1 |
p. 162-167 |
artikel |
|
| 3387 | The second Zagreb indices of unicyclic graphs with given degree sequences |
Liu, Muhuo |
2014 |
96-97 | Index 1 |
p. 217-221 5 p. |
artikel |
|
| 3388 | The set of reversible 90 150 cellular automata is regular |
Sarkar, Palash |
1998 |
96-97 | Index 1 |
p. 199-213 15 p. |
artikel |
|
| 3389 | The setup polyhedron of series-parallel posets |
Schrader, Rainer |
1997 |
96-97 | Index 1 |
p. 213-221 9 p. |
artikel |
|
| 3390 | The shape of node reliability |
Brown, Jason I. |
2018 |
96-97 | Index 1 |
p. 41-55 |
artikel |
|
| 3391 | The Shields–Harary numbers of K m , n for continuous concave cost functions vanishing at 1 |
Holliday, John |
2008 |
96-97 | Index 1 |
p. 82-87 6 p. |
artikel |
|
| 3392 | The shortest-path problem for graphs with random arc-lengths |
Frieze, A.M. |
1985 |
96-97 | Index 1 |
p. 57-77 21 p. |
artikel |
|
| 3393 | The signed domatic number of some regular graphs |
Meierling, Dirk |
2009 |
96-97 | Index 1 |
p. 1905-1912 8 p. |
artikel |
|
| 3394 | The signed Roman k -domatic number of a graph |
Volkmann, Lutz |
2015 |
96-97 | Index 1 |
p. 150-157 8 p. |
artikel |
|
| 3395 | The signed star domination numbers of the Cartesian product graphs |
Wang, Changping |
2007 |
96-97 | Index 1 |
p. 1497-1505 9 p. |
artikel |
|
| 3396 | The simultaneous metric dimension of graph families |
Ramírez-Cruz, Yunior |
2016 |
96-97 | Index 1 |
p. 241-250 10 p. |
artikel |
|
| 3397 | The six classes of trees with the largest algebraic connectivity |
Yuan, Xi-Ying |
2008 |
96-97 | Index 1 |
p. 757-769 13 p. |
artikel |
|
| 3398 | The skeleton of the symmetric traveling salesman polytope |
Sierksma, Gerard |
1993 |
96-97 | Index 1 |
p. 63-74 12 p. |
artikel |
|
| 3399 | The S -labeling problem: An algorithmic tour |
Fertin, Guillaume |
2018 |
96-97 | Index 1 |
p. 49-61 |
artikel |
|
| 3400 | The Solitaire Clobber game and correducibility of graphs |
Dantas, Simone |
|
96-97 | Index 1 |
p. 144-150 |
artikel |
|
| 3401 | The Solitaire Clobber game and the correducibility of k -connected graphs |
Fujimori, Tatsuya |
|
96-97 | Index 1 |
p. 16-22 |
artikel |
|
| 3402 | The solution and applications of a combinatorial problem |
Xu, Gaokui |
2012 |
96-97 | Index 1 |
p. 1643-1649 7 p. |
artikel |
|
| 3403 | The spanning cyclability of Cayley graphs generated by transposition trees |
Qiao, Hongwei |
|
96-97 | Index 1 |
p. 60-69 |
artikel |
|
| 3404 | The spectrum and toughness of regular graphs |
Cioabă, Sebastian M. |
|
96-97 | Index 1 |
p. 43-52 |
artikel |
|
| 3405 | The splitting power of branching programs of bounded repetition and CNFs of bounded width |
Razgon, Igor |
|
96-97 | Index 1 |
p. 366-381 |
artikel |
|
| 3406 | The square density of words having a sequence of FS-double squares |
Patawar, Maithilee |
|
96-97 | Index 1 |
p. 349-358 |
artikel |
|
| 3407 | The ( α , β , s , t ) -diameter of graphs: A particular case of conditional diameter |
Rodríguez, J.A. |
2006 |
96-97 | Index 1 |
p. 2024-2031 8 p. |
artikel |
|
| 3408 | The Steiner k -Wiener index of graphs with given minimum degree |
Dankelmann, Peter |
2019 |
96-97 | Index 1 |
p. 35-43 |
artikel |
|
| 3409 | The Steiner ratio of high-dimensional Banach–Minkowski spaces |
Cieslik, Dietmar |
2004 |
96-97 | Index 1 |
p. 29-34 6 p. |
artikel |
|
| 3410 | The Steiner ratio of L 2k d |
Cieslik, Dietmar |
1999 |
96-97 | Index 1 |
p. 217-221 5 p. |
artikel |
|
| 3411 | The Steiner tree in K 1 , r -free split graphs—A Dichotomy |
Renjith, P. |
|
96-97 | Index 1 |
p. 246-255 |
artikel |
|
| 3412 | The ( 1 , 2 ) -step competition graph of a pure local tournament that is not round decomposable |
Zhang, Xinhong |
2016 |
96-97 | Index 1 |
p. 180-190 11 p. |
artikel |
|
| 3413 | The ( 1 , 2 ) -step competition graph of a tournament |
Factor, Kim A.S. |
2011 |
96-97 | Index 1 |
p. 100-103 4 p. |
artikel |
|
| 3414 | The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions |
Gkenosis, Dimitrios |
|
96-97 | Index 1 |
p. 269-277 |
artikel |
|
| 3415 | The structure of minimally t -tough, 2 K 2 -free graphs |
Ma, Hui |
|
96-97 | Index 1 |
p. 1-9 |
artikel |
|
| 3416 | The sum necessary to ensure that a degree sequence pair has an A -connected realization |
Guan, Jing-Xin |
|
96-97 | Index 1 |
p. 97-107 |
artikel |
|
| 3417 | The test suite generation problem: Optimal instances and their implications |
Cheng, Christine T. |
2007 |
96-97 | Index 1 |
p. 1943-1957 15 p. |
artikel |
|
| 3418 | The threshold order of a Boolean function |
Wang, Chi |
1991 |
96-97 | Index 1 |
p. 51-69 19 p. |
artikel |
|
| 3419 | The t-median function on graphs |
McMorris, F.R. |
2006 |
96-97 | Index 1 |
p. 2599-2608 10 p. |
artikel |
|
| 3420 | The Tower of Hanoi problem on Path h graphs |
Berend, Daniel |
2012 |
96-97 | Index 1 |
p. 1465-1483 19 p. |
artikel |
|
| 3421 | The train frequency compatibility problem |
Cerdeira, Jorge Orestes |
2019 |
96-97 | Index 1 |
p. 18-26 |
artikel |
|
| 3422 | The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions |
Engels, Birgit |
2010 |
96-97 | Index 1 |
p. 298-307 10 p. |
artikel |
|
| 3423 | The trees with the second smallest normalized Laplacian eigenvalue at least 1 − 3 2 |
Tian, Xiaoguo |
2017 |
96-97 | Index 1 |
p. 118-133 16 p. |
artikel |
|
| 3424 | The Turán number for spanning linear forests |
Wang, Jian |
2019 |
96-97 | Index 1 |
p. 291-294 |
artikel |
|
| 3425 | The Turán number of the triangular pyramid of 3-layers |
Ghosh, Debarun |
|
96-97 | Index 1 |
p. 75-85 |
artikel |
|
| 3426 | The undirected optical indices of complete m -ary trees |
Lo, Yuan-Hsun |
|
96-97 | Index 1 |
p. 173-181 |
artikel |
|
| 3427 | The unit acquisition number of a graph |
Johnson, Frederick |
2019 |
96-97 | Index 1 |
p. 166-176 |
artikel |
|
| 3428 | The upper connected geodetic number and forcing connected geodetic number of a graph |
Santhakumaran, A.P. |
2009 |
96-97 | Index 1 |
p. 1571-1580 10 p. |
artikel |
|
| 3429 | The variation of the Randić index with regard to minimum and maximum degree |
Milivojević, Milica |
2017 |
96-97 | Index 1 |
p. 286-293 8 p. |
artikel |
|
| 3430 | The VC-dimension of graphs with respect to k -connected subgraphs |
Munaro, Andrea |
2016 |
96-97 | Index 1 |
p. 163-174 12 p. |
artikel |
|
| 3431 | The vertex leafage of chordal graphs |
Chaplick, Steven |
2014 |
96-97 | Index 1 |
p. 14-25 12 p. |
artikel |
|
| 3432 | The vertex Turán density in 3-ary n -cubes |
Li, Xiao-Chen |
|
96-97 | Index 1 |
p. 129-141 |
artikel |
|
| 3433 | The von Neumann entropy of random multipartite graphs |
Hu, Dan |
2017 |
96-97 | Index 1 |
p. 201-206 |
artikel |
|
| 3434 | The weighted total cophenetic index: A novel balance index for phylogenetic networks |
Knüver, Linda |
|
96-97 | Index 1 |
p. 89-142 |
artikel |
|
| 3435 | The wide-diameter of Z n , k |
Qi, Hao |
2017 |
96-97 | Index 1 |
p. 193-201 9 p. |
artikel |
|
| 3436 | The Wiener index in iterated line graphs |
Knor, M. |
2012 |
96-97 | Index 1 |
p. 2234-2245 12 p. |
artikel |
|
| 3437 | The Wiener number of the hexagonal net |
Shiu, W.C. |
1997 |
96-97 | Index 1 |
p. 101-111 11 p. |
artikel |
|
| 3438 | The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines |
Chang, Soo Y. |
1999 |
96-97 | Index 1 |
p. 135-147 13 p. |
artikel |
|
| 3439 | The zero forcing number of claw-free cubic graphs |
He, Mengya |
|
96-97 | Index 1 |
p. 321-330 |
artikel |
|
| 3440 | The zero forcing polynomial of a graph |
Boyer, Kirk |
2019 |
96-97 | Index 1 |
p. 35-48 |
artikel |
|
| 3441 | The zoo of tree spanner problems |
Liebchen, Christian |
2008 |
96-97 | Index 1 |
p. 569-587 19 p. |
artikel |
|
| 3442 | Thin edges in the subgraph induced by noncubic vertices of a brace |
He, Xiaoling |
|
96-97 | Index 1 |
p. 153-156 |
artikel |
|
| 3443 | Thrackles: An improved upper bound |
Fulek, Radoslav |
2019 |
96-97 | Index 1 |
p. 226-231 |
artikel |
|
| 3444 | Three-dimensional axial assignment problems with decomposable cost coefficients |
Burkard, Rainer E. |
1996 |
96-97 | Index 1 |
p. 123-139 17 p. |
artikel |
|
| 3445 | Three-dimensional orthogonal graph drawing algorithms |
Eades, Peter |
2000 |
96-97 | Index 1 |
p. 55-87 33 p. |
artikel |
|
| 3446 | Three results towards approximation of special maximum matchings in graphs |
Mkrtchyan, Vahan |
|
96-97 | Index 1 |
p. 127-136 |
artikel |
|
| 3447 | Three supplements to Reid’s theorem in multipartite tournaments |
Li, Shengjia |
2010 |
96-97 | Index 1 |
p. 340-348 9 p. |
artikel |
|
| 3448 | Threshold group testing with consecutive positives |
Chang, Huilan |
2014 |
96-97 | Index 1 |
p. 68-72 5 p. |
artikel |
|
| 3449 | Thue choosability of trees |
Fiorenzi, Francesca |
2011 |
96-97 | Index 1 |
p. 2045-2049 5 p. |
artikel |
|
| 3450 | Tight approximations for resource constrained scheduling and bin packing |
Srivastav, Anand |
1997 |
96-97 | Index 1 |
p. 223-245 23 p. |
artikel |
|
| 3451 | Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs |
Doron-Arad, Ilan |
|
96-97 | Index 1 |
p. 453-464 |
artikel |
|
| 3452 | Tight bounds on odd chromatic number of some standard graph products |
Priyamvada, |
|
96-97 | Index 1 |
p. 1-13 |
artikel |
|
| 3453 | Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs |
Furmańczyk, Hanna |
2018 |
96-97 | Index 1 |
p. 116-122 |
artikel |
|
| 3454 | Tight conditions for spanning trees with leaf degree at most k in graphs |
Lin, Jifu |
|
96-97 | Index 1 |
p. 97-104 |
artikel |
|
| 3455 | Tight-optimal circulants vis-à-vis twisted tori |
Jha, Pranava K. |
2014 |
96-97 | Index 1 |
p. 24-34 11 p. |
artikel |
|
| 3456 | Tight upper bound of the rainbow vertex-connection number for 2-connected graphs |
Li, Xueliang |
2014 |
96-97 | Index 1 |
p. 62-69 8 p. |
artikel |
|
| 3457 | Topological properties on the diameters of the integer simplex |
Ma, Meijie |
2015 |
96-97 | Index 1 |
p. 291-294 4 p. |
artikel |
|
| 3458 | Topological sweep of the complete graph |
Rafalin, Eynat |
2008 |
96-97 | Index 1 |
p. 3276-3290 15 p. |
artikel |
|
| 3459 | Top to random shuffles on colored permutations |
Nakano, Fumihiko |
|
96-97 | Index 1 |
p. 336-348 |
artikel |
|
| 3460 | Torus-like graphs and their paired many-to-many disjoint path covers |
Park, Jung-Heum |
|
96-97 | Index 1 |
p. 64-77 |
artikel |
|
| 3461 | Total coloring of planar graphs without 6-cycles |
Hou, Jianfeng |
2011 |
96-97 | Index 1 |
p. 157-163 7 p. |
artikel |
|
| 3462 | Total colorings of complete multipartite graphs using amalgamations |
Dalal, Aseem |
|
96-97 | Index 1 |
p. 186-195 |
artikel |
|
| 3463 | Total colorings of planar graphs without chordal 6-cycles |
Wang, Bing |
2014 |
96-97 | Index 1 |
p. 116-121 6 p. |
artikel |
|
| 3464 | Total colorings of planar graphs without intersecting 5-cycles |
Wang, Bing |
2012 |
96-97 | Index 1 |
p. 1815-1821 7 p. |
artikel |
|
| 3465 | Total domination number of grid graphs |
Gravier, Sylvain |
2002 |
96-97 | Index 1 |
p. 119-128 10 p. |
artikel |
|
| 3466 | Total domination stability in graphs |
Henning, Michael A. |
2018 |
96-97 | Index 1 |
p. 246-255 |
artikel |
|
| 3467 | Total k -domination in Cartesian product of complete graphs |
Carballosa, Walter |
|
96-97 | Index 1 |
p. 25-41 |
artikel |
|
| 3468 | ( 2 , 1 ) -total labeling of trees with large maximum degree |
Chen, Dong |
2015 |
96-97 | Index 1 |
p. 61-69 9 p. |
artikel |
|
| 3469 | (2,1)-Total labelling of outerplanar graphs |
Chen, Dong |
2007 |
96-97 | Index 1 |
p. 2585-2593 9 p. |
artikel |
|
| 3470 | Totally balanced and totally unimodular matrices defined by center location problems |
Tamir, Arie |
1987 |
96-97 | Index 1 |
p. 245-263 19 p. |
artikel |
|
| 3471 | Total-rainbow connection and forbidden subgraphs |
Zhang, Jingshu |
|
96-97 | Index 1 |
p. 364-370 |
artikel |
|
| 3472 | Total Roman domination in the lexicographic product of graphs |
Campanelli, Nicolás |
2019 |
96-97 | Index 1 |
p. 88-95 |
artikel |
|
| 3473 | Total tessellation cover: Bounds, hardness, and applications |
Abreu, Alexandre |
|
96-97 | Index 1 |
p. 149-161 |
artikel |
|
| 3474 | (Total) Vector domination for graphs with bounded branchwidth |
Ishii, Toshimasa |
2016 |
96-97 | Index 1 |
p. 80-89 10 p. |
artikel |
|
| 3475 | Toughness and binding number |
Bauer, D. |
2014 |
96-97 | Index 1 |
p. 60-68 9 p. |
artikel |
|
| 3476 | Toughness and distance spectral radius in graphs involving minimum degree |
Lou, Jing |
|
96-97 | Index 1 |
p. 34-47 |
artikel |
|
| 3477 | Toughness and prism-hamiltonicity of P 4 -free graphs |
Ellingham, M.N. |
|
96-97 | Index 1 |
p. 201-206 |
artikel |
|
| 3478 | To vote or not to vote: What is the quota? |
Holzman, Ron |
1988 |
96-97 | Index 1 |
p. 133-141 9 p. |
artikel |
|
| 3479 | Towards extending the Ahlswede–Khachatrian theorem to cross t -intersecting families |
Lee, Sang June |
2017 |
96-97 | Index 1 |
p. 627-645 19 p. |
artikel |
|
| 3480 | Tower of covering arrays |
Torres-Jimenez, Jose |
2015 |
96-97 | Index 1 |
p. 141-146 6 p. |
artikel |
|
| 3481 | Transferable domination number of graphs |
Chang, Fei-Huang |
|
96-97 | Index 1 |
p. 135-146 |
artikel |
|
| 3482 | Transformation completeness properties of SVPC transformation sets |
Tai, S.C. |
1991 |
96-97 | Index 1 |
p. 263-273 11 p. |
artikel |
|
| 3483 | Transforming a graph into a 1-balanced graph |
Kannan, Lavanya |
2009 |
96-97 | Index 1 |
p. 300-308 9 p. |
artikel |
|
| 3484 | Transforms of pseudo-Boolean random variables |
Ding, Guoli |
2010 |
96-97 | Index 1 |
p. 13-24 12 p. |
artikel |
|
| 3485 | Transient length in sequential iteration of threshold functions |
Fogelman, F. |
1983 |
96-97 | Index 1 |
p. 95-98 4 p. |
artikel |
|
| 3486 | Transmitting in the n-dimensional cube |
Alon, Noga |
1992 |
96-97 | Index 1 |
p. 9-11 3 p. |
artikel |
|
| 3487 | Tree-decompositions of small pathwidth |
Telle, Jan Arne |
2005 |
96-97 | Index 1 |
p. 210-218 9 p. |
artikel |
|
| 3488 | Tree decompositions with small cost |
Bodlaender, Hans L. |
2005 |
96-97 | Index 1 |
p. 143-154 12 p. |
artikel |
|
| 3489 | Trees of extremal connectivity index |
Liu, Huiqing |
2006 |
96-97 | Index 1 |
p. 106-119 14 p. |
artikel |
|
| 3490 | Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction |
Panda, B.S. |
2009 |
96-97 | Index 1 |
p. 2153-2169 17 p. |
artikel |
|
| 3491 | Trees with maximum p -reinforcement number |
Lu, You |
2014 |
96-97 | Index 1 |
p. 43-54 12 p. |
artikel |
|
| 3492 | Treewidth for graphs with small chordality |
Bodlaender, Hans L. |
1997 |
96-97 | Index 1 |
p. 45-61 17 p. |
artikel |
|
| 3493 | Treewidth of the q -Kneser graphs |
Cao, Mengyu |
|
96-97 | Index 1 |
p. 174-180 |
artikel |
|
| 3494 | Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree |
Farooq, Rashid |
|
96-97 | Index 1 |
p. 26-34 |
artikel |
|
| 3495 | Triangle-free graphs and forbidden subgraphs |
Brandt, Stephan |
2002 |
96-97 | Index 1 |
p. 25-33 9 p. |
artikel |
|
| 3496 | Triangle-free signed graphs with small negative inertia index |
Duan, Fang |
|
96-97 | Index 1 |
p. 135-142 |
artikel |
|
| 3497 | Trichotomy for integer linear systems based on their sign patterns |
Kimura, Kei |
2016 |
96-97 | Index 1 |
p. 67-78 12 p. |
artikel |
|
| 3498 | Tricyclic graphs with maximum Merrifield–Simmons index |
Zhu, Zhongxun |
2010 |
96-97 | Index 1 |
p. 204-212 9 p. |
artikel |
|
| 3499 | Tricyclic graph with maximal Estrada index |
Zhu, Zhongxun |
2014 |
96-97 | Index 1 |
p. 364-372 9 p. |
artikel |
|
| 3500 | Trivial two-stage group testing for complexes using almost disjunct matrices |
Macula, Anthony J. |
2004 |
96-97 | Index 1 |
p. 97-107 11 p. |
artikel |
|
| 3501 | Truncated metric dimension for finite graphs |
Frongillo, Rafael M. |
|
96-97 | Index 1 |
p. 150-169 |
artikel |
|
| 3502 | Turán number of 3-free strong digraphs with out-degree restriction |
Chen, Bin |
|
96-97 | Index 1 |
p. 252-264 |
artikel |
|
| 3503 | Turán problem of signed graph for negative odd cycle |
Wang, Junjie |
|
96-97 | Index 1 |
p. 157-166 |
artikel |
|
| 3504 | Tutte sets in graphs II: The complexity of finding maximum Tutte sets |
Bauer, D. |
2007 |
96-97 | Index 1 |
p. 1336-1343 8 p. |
artikel |
|
| 3505 | t -wise balanced designs |
Laue, Reinhard |
2009 |
96-97 | Index 1 |
p. 2136-2142 7 p. |
artikel |
|
| 3506 | Two classes of edge domination in graphs |
Xu, Baogen |
2006 |
96-97 | Index 1 |
p. 1541-1546 6 p. |
artikel |
|
| 3507 | Two classes of 1-resilient semi-bent functions based on disjoint linear codes |
Li, Luyang |
|
96-97 | Index 1 |
p. 147-157 |
artikel |
|
| 3508 | Two classes of ternary codes and their weight distributions |
Ding, Cunsheng |
2001 |
96-97 | Index 1 |
p. 37-53 17 p. |
artikel |
|
| 3509 | Two completely independent spanning trees of split graphs |
Chen, Xiaodong |
|
96-97 | Index 1 |
p. 76-78 |
artikel |
|
| 3510 | Two dependent probabilistic chip-collecting games |
Harrington, Joshua |
|
96-97 | Index 1 |
p. 74-86 |
artikel |
|
| 3511 | Two-dimensional minimax Latin hypercube designs |
van Dam, Edwin R. |
2008 |
96-97 | Index 1 |
p. 3483-3493 11 p. |
artikel |
|
| 3512 | Two-dimensional strip packing with unloading constraints |
da Silveira, Jefferson L.M. |
2014 |
96-97 | Index 1 |
p. 512-521 10 p. |
artikel |
|
| 3513 | Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs |
Zhang, Hui |
|
96-97 | Index 1 |
p. 320-328 |
artikel |
|
| 3514 | Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs |
Xue, Shudan |
|
96-97 | Index 1 |
p. 196-208 |
artikel |
|
| 3515 | Two-disjoint-cycle-cover pancyclicity of augmented cubes |
Cheng, Dongqin |
|
96-97 | Index 1 |
p. 240-246 |
artikel |
|
| 3516 | Two equivalent measures on weighted hypergraphs |
Ito, Hiro |
2006 |
96-97 | Index 1 |
p. 2330-2334 5 p. |
artikel |
|
| 3517 | Two-graphs and NSSDs: An algebraic approach |
Sciriha, Irene |
2019 |
96-97 | Index 1 |
p. 92-102 |
artikel |
|
| 3518 | Two kinds of generalized connectivity of dual cubes |
Zhao, Shu-Li |
2019 |
96-97 | Index 1 |
p. 306-316 |
artikel |
|
| 3519 | Two more characterizations of König–Egerváry graphs |
Jarden, Adi |
2017 |
96-97 | Index 1 |
p. 175-180 6 p. |
artikel |
|
| 3520 | Two-page book embedding of trees under vertex-neighborhood constraints |
Moran, Shlomo |
1993 |
96-97 | Index 1 |
p. 233-241 9 p. |
artikel |
|
| 3521 | Two-path subsets: Efficient counting and applications to performability analysis |
Ball, Michael O. |
1998 |
96-97 | Index 1 |
p. 25-45 21 p. |
artikel |
|
| 3522 | Two results about the hypercube |
Balogh, József |
|
96-97 | Index 1 |
p. 322-326 |
artikel |
|
| 3523 | Two results on the bit extraction problem |
Friedl, Katalin |
2000 |
96-97 | Index 1 |
p. 443-454 12 p. |
artikel |
|
| 3524 | Two sensitivity theorems in fuzzy integer programming |
Asratian, A.S. |
2004 |
96-97 | Index 1 |
p. 129-140 12 p. |
artikel |
|
| 3525 | Two-to-one functions from Galois extensions |
Bartoli, Daniele |
|
96-97 | Index 1 |
p. 194-201 |
artikel |
|
| 3526 | Two-tuple balance of non-binary sequences with ideal two-level autocorrelation |
Gong, Guang |
2006 |
96-97 | Index 1 |
p. 2590-2598 9 p. |
artikel |
|
| 3527 | UET scheduling with unit interprocessor communication delays |
Rayward-Smith, V.J. |
1987 |
96-97 | Index 1 |
p. 55-71 17 p. |
artikel |
|
| 3528 | Uncolorable mixed hypergraphs |
Tuza, Zsolt |
2000 |
96-97 | Index 1 |
p. 209-227 19 p. |
artikel |
|
| 3529 | Unconstrained 0–1 optimization and Lagrangean relaxation |
Adams, Warren E. |
1990 |
96-97 | Index 1 |
p. 131-142 12 p. |
artikel |
|
| 3530 | Unextendible product bases and 1-factorization of complete graphs |
Feng, Keqin |
2006 |
96-97 | Index 1 |
p. 942-949 8 p. |
artikel |
|
| 3531 | Unicyclic graphs of given girth k ≥ 4 having smallest general sum-connectivity index |
Tomescu, Ioan |
2014 |
96-97 | Index 1 |
p. 344-348 5 p. |
artikel |
|
| 3532 | Unicyclic signed graphs with minimal energy |
Bhat, Mushtaq A. |
2017 |
96-97 | Index 1 |
p. 32-39 8 p. |
artikel |
|
| 3533 | Unicyclic signed graphs with the first ⌊ n + 1 2 ⌋ largest energies |
Zhu, Jianming |
|
96-97 | Index 1 |
p. 350-363 |
artikel |
|
| 3534 | Uniform and monotone line sum optimization |
Koutecký, Martin |
|
96-97 | Index 1 |
p. 165-170 |
artikel |
|
| 3535 | Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees |
Alizadeh, Behrooz |
2011 |
96-97 | Index 1 |
p. 706-716 11 p. |
artikel |
|
| 3536 | Uniform homomorphisms of de Bruijn and Kautz networks |
Tvrdik, Pavel |
1998 |
96-97 | Index 1 |
p. 279-301 23 p. |
artikel |
|
| 3537 | Union–intersection-bounded families and their applications |
Gu, Yujie |
2019 |
96-97 | Index 1 |
p. 346-354 |
artikel |
|
| 3538 | Unique intersectability of diamond-free graphs |
Guo, Jun-Lin |
2011 |
96-97 | Index 1 |
p. 774-778 5 p. |
artikel |
|
| 3539 | Uniquely identifying the edges of a graph: The edge metric dimension |
Kelenc, Aleksander |
2018 |
96-97 | Index 1 |
p. 204-220 |
artikel |
|
| 3540 | Uniquely restricted matchings in subcubic graphs |
Fürst, Maximilian |
2019 |
96-97 | Index 1 |
p. 189-194 |
artikel |
|
| 3541 | Unique-maximum edge-colouring of plane graphs with respect to faces |
Fabrici, Igor |
2015 |
96-97 | Index 1 |
p. 239-243 5 p. |
artikel |
|
| 3542 | Uniqueness of currents in infinite resistive networks |
Soardi, Paolo M. |
1991 |
96-97 | Index 1 |
p. 37-49 13 p. |
artikel |
|
| 3543 | Unique response Roman domination in graphs |
Ebrahimi Targhi, E. |
2011 |
96-97 | Index 1 |
p. 1110-1117 8 p. |
artikel |
|
| 3544 | Unital designs with blocking sets |
Al-Azemi, Abdullah |
2014 |
96-97 | Index 1 |
p. 102-112 11 p. |
artikel |
|
| 3545 | Unitary Cayley graphs of finite semisimple rings |
Tangsakul, Thanatach |
|
96-97 | Index 1 |
p. 87-94 |
artikel |
|
| 3546 | Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depths |
Norris, N. |
1995 |
96-97 | Index 1 |
p. 61-74 14 p. |
artikel |
|
| 3547 | Unreliable point facility location problems on networks |
Puerto, Justo |
2014 |
96-97 | Index 1 |
p. 188-203 16 p. |
artikel |
|
| 3548 | Untangling planar graphs from a specified vertex position—Hard cases |
Kang, M. |
2011 |
96-97 | Index 1 |
p. 789-799 11 p. |
artikel |
|
| 3549 | Upper and lower bounds for competitive group testing |
Scheidweiler, Robert |
|
96-97 | Index 1 |
p. 136-150 |
artikel |
|
| 3550 | Upper bound for DP-chromatic number of a graph |
Lv, Jian-Bo |
|
96-97 | Index 1 |
p. 28-32 |
artikel |
|
| 3551 | Upper bounds and approximation results for the k -slow burning problem |
Hiller, Michaela |
|
96-97 | Index 1 |
p. 88-104 |
artikel |
|
| 3552 | Upper bounds for bar visibility of subgraphs and n -vertex graphs |
Feng, Yuanrui |
|
96-97 | Index 1 |
p. 272-274 |
artikel |
|
| 3553 | Upper bounds for constant weight and Lee codes slightly outside the plotkin range |
Tarnanen, Hannu |
1987 |
96-97 | Index 1 |
p. 265-277 13 p. |
artikel |
|
| 3554 | Upper bounds for some graph invariants in terms of blocks and cut-vertices |
Zaker, Manouchehr |
|
96-97 | Index 1 |
p. 50-60 |
artikel |
|
| 3555 | Upper bounds for stabbing simplices by a line |
Daum-Sadon, Inbar |
|
96-97 | Index 1 |
p. 248-259 |
artikel |
|
| 3556 | Upper bounds for the achromatic and coloring numbers of a graph |
Wu, Baoyindureng |
2017 |
96-97 | Index 1 |
p. 375-380 6 p. |
artikel |
|
| 3557 | Upper bounds for the complexity of sequences generated by symmetric Boolean functions |
Merekin, Yu.V. |
2001 |
96-97 | Index 1 |
p. 227-231 5 p. |
artikel |
|
| 3558 | Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number |
Dehghan, A. |
2012 |
96-97 | Index 1 |
p. 2142-2146 5 p. |
artikel |
|
| 3559 | Upper bounds for the inverse sum indeg index of graphs |
Matejić, M.M. |
2018 |
96-97 | Index 1 |
p. 258-267 |
artikel |
|
| 3560 | Upper bounds for the M D -numbers and characterization of extremal graphs |
Li, Ping |
|
96-97 | Index 1 |
p. 1-12 |
artikel |
|
| 3561 | Upper bounds of r -hued colorings of planar graphs |
Song, Huimin |
2018 |
96-97 | Index 1 |
p. 262-269 |
artikel |
|
| 3562 | Upper bounds on adjacent vertex distinguishing total chromatic number of graphs |
Hu, Xiaolan |
2017 |
96-97 | Index 1 |
p. 29-32 4 p. |
artikel |
|
| 3563 | Upper bounds on ATSP neighborhood size |
Gutin, Gregory |
2003 |
96-97 | Index 1 |
p. 533-538 6 p. |
artikel |
|
| 3564 | Upper bounds on the average eccentricity of K 3 -free and C 4 -free graphs |
Dankelmann, P. |
2019 |
96-97 | Index 1 |
p. 106-114 |
artikel |
|
| 3565 | Upper bounds on the balanced 〈 r , s 〉 -domination number of a graph |
Roux, A. |
2014 |
96-97 | Index 1 |
p. 214-221 8 p. |
artikel |
|
| 3566 | Upper bounds on the Boolean rank of Kronecker products |
Haviv, Ishay |
|
96-97 | Index 1 |
p. 82-96 |
artikel |
|
| 3567 | Upper bounds on the diameter of domination dot-critical graphs with given connectivity |
Furuya, Michitaka |
2013 |
96-97 | Index 1 |
p. 2420-2426 7 p. |
artikel |
|
| 3568 | Upper bounds on the k -domination number and the k -Roman domination number |
Hansberg, Adriana |
2009 |
96-97 | Index 1 |
p. 1634-1639 6 p. |
artikel |
|
| 3569 | Upper bounds on the k -forcing number of a graph |
Amos, David |
2015 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 3570 | Upper bounds on the signed total domatic number of graphs |
Volkmann, Lutz |
2011 |
96-97 | Index 1 |
p. 832-837 6 p. |
artikel |
|
| 3571 | Upper bounds on the upper signed total domination number of graphs |
Shan, Erfang |
2009 |
96-97 | Index 1 |
p. 1098-1103 6 p. |
artikel |
|
| 3572 | Using a similarity measure for credible classification |
Subasi, M. |
2009 |
96-97 | Index 1 |
p. 1104-1112 9 p. |
artikel |
|
| 3573 | Using Lagrangian dual information to generate degree constrained spanning trees |
Andrade, Rafael |
2006 |
96-97 | Index 1 |
p. 703-717 15 p. |
artikel |
|
| 3574 | Using solution properties within an enumerative search to solve a sports league scheduling problem |
Hamiez, J.-P. |
2008 |
96-97 | Index 1 |
p. 1683-1693 11 p. |
artikel |
|
| 3575 | Using well-solvable quadratic assignment problems for VLSI interconnect applications |
Emanuel, Ben |
2012 |
96-97 | Index 1 |
p. 525-535 11 p. |
artikel |
|
| 3576 | Valid constraints for the Point Packing in a Square problem |
Costa, Alberto |
2013 |
96-97 | Index 1 |
p. 2901-2909 9 p. |
artikel |
|
| 3577 | Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints |
Wolsey, Laurence A. |
1990 |
96-97 | Index 1 |
p. 251-261 11 p. |
artikel |
|
| 3578 | Valid inequalities for mixed 0–1 programs |
Van Roy, Tony J. |
1986 |
96-97 | Index 1 |
p. 199-213 15 p. |
artikel |
|
| 3579 | Van Lier sequences |
Fishburn, Peter C. |
1990 |
96-97 | Index 1 |
p. 209-220 12 p. |
artikel |
|
| 3580 | Vapnik-Chervonenkis dimension of recurrent neural networks |
Koiran, Pascal |
1998 |
96-97 | Index 1 |
p. 63-79 17 p. |
artikel |
|
| 3581 | γ -variable first-order logic of preferential attachment random graphs |
Malyshkin, Y.A. |
|
96-97 | Index 1 |
p. 223-227 |
artikel |
|
| 3582 | Variable space search for graph coloring |
Hertz, Alain |
2008 |
96-97 | Index 1 |
p. 2551-2560 10 p. |
artikel |
|
| 3583 | Variants of ( s , t ) -Wythoff’s game |
Li, Haiyan |
2017 |
96-97 | Index 1 |
p. 1-12 |
artikel |
|
| 3584 | Variants of the Erdős distinct sums problem and variance method |
Costa, Simone |
|
96-97 | Index 1 |
p. 110-123 |
artikel |
|
| 3585 | Variants of the majority problem |
Aigner, Martin |
2004 |
96-97 | Index 1 |
p. 3-25 23 p. |
artikel |
|
| 3586 | Variations of largest rectangle recognition amidst a bichromatic point set |
Acharyya, Ankush |
|
96-97 | Index 1 |
p. 35-50 |
artikel |
|
| 3587 | Variations on the Erdős distinct-sums problem |
Costa, Simone |
|
96-97 | Index 1 |
p. 172-185 |
artikel |
|
| 3588 | VC-dimension and pseudo-random graphs |
Pham, Thang |
|
96-97 | Index 1 |
p. 231-246 |
artikel |
|
| 3589 | VC-dimensions of finite automata and commutative finite automata with k letters and n states |
Ishigami, Yoshiyasu |
1997 |
96-97 | Index 1 |
p. 123-134 12 p. |
artikel |
|
| 3590 | VC-dimensions of finite automata and commutative finite automata with k letters and n states |
Ishigami, Yoshiyasu |
1997 |
96-97 | Index 1 |
p. 229-240 12 p. |
artikel |
|
| 3591 | Vector bin packing with multiple-choice |
Patt-Shamir, Boaz |
2012 |
96-97 | Index 1 |
p. 1591-1600 10 p. |
artikel |
|
| 3592 | Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs |
Cordero-Michel, Narda |
|
96-97 | Index 1 |
p. 281-289 |
artikel |
|
| 3593 | Vertex-colouring of 3-chromatic circulant graphs |
Nicoloso, S. |
2017 |
96-97 | Index 1 |
p. 121-138 18 p. |
artikel |
|
| 3594 | Vertex connectivity of the power graph of a finite cyclic group |
Chattopadhyay, Sriparna |
2019 |
96-97 | Index 1 |
p. 259-271 |
artikel |
|
| 3595 | Vertex-critical ( P 5 , c h a i r ) -free graphs |
Huang, Shenwei |
|
96-97 | Index 1 |
p. 9-15 |
artikel |
|
| 3596 | Vertex-critical ( P 3 + ℓ P 1 ) -free and vertex-critical (gem, co-gem)-free graphs |
Abuadas, Tala |
|
96-97 | Index 1 |
p. 179-187 |
artikel |
|
| 3597 | Vertex-degree based topological indices of digraphs |
Monsalve, Juan |
|
96-97 | Index 1 |
p. 13-24 |
artikel |
|
| 3598 | Vertex-degree-based topological indices over starlike trees |
Betancur, Clara |
2015 |
96-97 | Index 1 |
p. 18-25 8 p. |
artikel |
|
| 3599 | Vertex-disjoint stars in K 1 , r -free graphs |
Jiang, Suyun |
|
96-97 | Index 1 |
p. 189-197 |
artikel |
|
| 3600 | Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes |
Kuo, Che-Nan |
2016 |
96-97 | Index 1 |
p. 80-85 6 p. |
artikel |
|
| 3601 | 1-vertex-fault-tolerant cycles embedding on folded hypercubes |
Hsieh, Sun-Yuan |
2009 |
96-97 | Index 1 |
p. 3094-3098 5 p. |
artikel |
|
| 3602 | Vertex-magic labeling of regular graphs: Disjoint unions and assemblages |
Gray, I.D. |
2012 |
96-97 | Index 1 |
p. 1114-1125 12 p. |
artikel |
|
| 3603 | Vertex-pancyclicity of edge-face-total graphs |
Wang, Wei-Fan |
2004 |
96-97 | Index 1 |
p. 364-367 4 p. |
artikel |
|
| 3604 | Vertex-pancyclism in the generalized sum of digraphs |
Cordero-Michel, Narda |
|
96-97 | Index 1 |
p. 94-101 |
artikel |
|
| 3605 | Vertex partitioning problems on graphs with bounded tree width |
Aravind, N.R. |
|
96-97 | Index 1 |
p. 254-270 |
artikel |
|
| 3606 | Vertex types in threshold and chain graphs |
Anđelić, Milica |
2019 |
96-97 | Index 1 |
p. 159-168 |
artikel |
|
| 3607 | Vertices removal for feasibility of clustered spanning trees |
Guttmann-Beck, Nili |
|
96-97 | Index 1 |
p. 68-84 |
artikel |
|
| 3608 | Very fast parallel algorithms for approximate edge coloring |
Han, Yijie |
2001 |
96-97 | Index 1 |
p. 227-238 12 p. |
artikel |
|
| 3609 | Vicinal orders of trees |
Peled, Uri N. |
1990 |
96-97 | Index 1 |
p. 211-219 9 p. |
artikel |
|
| 3610 | Voronoi polytopes for polyhedral norms on lattices |
Deza, Michel |
2015 |
96-97 | Index 1 |
p. 42-52 11 p. |
artikel |
|
| 3611 | Votes and a half-binomial |
Frame, J.S. |
1985 |
96-97 | Index 1 |
p. 31-40 10 p. |
artikel |
|
| 3612 | VPG and EPG bend-numbers of Halin graphs |
Francis, Mathew C. |
2016 |
96-97 | Index 1 |
p. 95-105 11 p. |
artikel |
|
| 3613 | Vulnerability analysis of multiprocessor system based on burnt pancake networks |
Liu, Jiafei |
|
96-97 | Index 1 |
p. 304-320 |
artikel |
|
| 3614 | Waiting patterns for a printer |
Merlini, D. |
2004 |
96-97 | Index 1 |
p. 359-373 15 p. |
artikel |
|
| 3615 | Weak degeneracy of planar graphs without 4- and 6-cycles |
Wang, Tao |
|
96-97 | Index 1 |
p. 110-118 |
artikel |
|
| 3616 | Weakly bipancyclic bipartite graphs |
Hu, Zhiquan |
2015 |
96-97 | Index 1 |
p. 102-120 19 p. |
artikel |
|
| 3617 | Weakly connected Roman domination in graphs |
Raczek, Joanna |
2019 |
96-97 | Index 1 |
p. 151-159 |
artikel |
|
| 3618 | Weakly toll convexity in graph products |
Repolusk, Polona |
|
96-97 | Index 1 |
p. 15-22 |
artikel |
|
| 3619 | Weak saturation number for multiple copies of the complete graph with a star removed |
Pu, Liqun |
2016 |
96-97 | Index 1 |
p. 216-220 5 p. |
artikel |
|
| 3620 | Webster sequences, apportionment problems, and just-in-time sequencing |
Li, Xiaomin |
|
96-97 | Index 1 |
p. 52-69 |
artikel |
|
| 3621 | Weighted antimagic labeling |
Matamala, Martín |
2018 |
96-97 | Index 1 |
p. 194-201 |
artikel |
|
| 3622 | Weighted efficient domination for some classes of H -free and of ( H 1 , H 2 ) -free graphs |
Brandstädt, Andreas |
2018 |
96-97 | Index 1 |
p. 130-144 |
artikel |
|
| 3623 | Weighted efficient domination in two subclasses of P 6 -free graphs |
Brandstädt, Andreas |
2016 |
96-97 | Index 1 |
p. 38-46 9 p. |
artikel |
|
| 3624 | Weighted exchange distance of basis pairs |
Bérczi, Kristóf |
|
96-97 | Index 1 |
p. 130-143 |
artikel |
|
| 3625 | Weighted fractional and integral k-matching in hypergraphs |
Srivastav, Anand |
1995 |
96-97 | Index 1 |
p. 255-269 15 p. |
artikel |
|
| 3626 | Weighted Harary indices of apex trees and k -apex trees |
Xu, Kexiang |
2015 |
96-97 | Index 1 |
p. 30-40 11 p. |
artikel |
|
| 3627 | Weighted independent sets in classes of P 6 -free graphs |
Karthick, T. |
2016 |
96-97 | Index 1 |
p. 217-226 10 p. |
artikel |
|
| 3628 | Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences |
Escoffier, Bruno |
|
96-97 | Index 1 |
p. 6-12 |
artikel |
|
| 3629 | Weighted total acquisition |
Bagan, Guillaume |
|
96-97 | Index 1 |
p. 260-282 |
artikel |
|
| 3630 | Well-covered graphs and factors |
Randerath, Bert |
2006 |
96-97 | Index 1 |
p. 1416-1428 13 p. |
artikel |
|
| 3631 | Well-indumatched Pseudoforests |
Büyükçolak, Yasemin |
|
96-97 | Index 1 |
p. 85-102 |
artikel |
|
| 3632 | What is the meaning of the graph energy after all? |
Estrada, Ernesto |
2017 |
96-97 | Index 1 |
p. 71-77 7 p. |
artikel |
|
| 3633 | Wheel and star-critical Ramsey numbers for quadrilateral |
Wu, Yali |
2015 |
96-97 | Index 1 |
p. 260-271 12 p. |
artikel |
|
| 3634 | Which generalized Randić indices are suitable measures of molecular branching? |
Vukičević, Damir |
2010 |
96-97 | Index 1 |
p. 2056-2065 10 p. |
artikel |
|
| 3635 | Which tree has the smallest A B C index among trees with k leaves? |
Magnant, Colton |
2015 |
96-97 | Index 1 |
p. 143-146 4 p. |
artikel |
|
| 3636 | Wiener index and graphs, almost half of whose vertices satisfy Šoltés property |
Akhmejanova, Margarita |
|
96-97 | Index 1 |
p. 37-42 |
artikel |
|
| 3637 | Wiener index of quadrangulation graphs |
Győri, Ervin |
|
96-97 | Index 1 |
p. 262-269 |
artikel |
|
| 3638 | Wiener number of hexagonal jagged-rectangles |
Shiu, W.C. |
1997 |
96-97 | Index 1 |
p. 83-96 14 p. |
artikel |
|
| 3639 | Window queries for intersecting objects, maximal points and approximations using coresets |
Chanchary, Farah |
|
96-97 | Index 1 |
p. 295-310 |
artikel |
|
| 3640 | Word length perturbations in certain symmetric presentations of dihedral groups |
Allocca, Michael P. |
2017 |
96-97 | Index 1 |
p. 33-45 13 p. |
artikel |
|
| 3641 | Worst case behavior of the steepest edge simplex method |
Goldfarb, Donald |
1979 |
96-97 | Index 1 |
p. 277-285 9 p. |
artikel |
|
| 3642 | Worst-case efficient dominating sets in digraphs |
Dejter, Italo J. |
2013 |
96-97 | Index 1 |
p. 944-952 9 p. |
artikel |
|
| 3643 | Worst-case study of local search for MAX-k-SAT |
Hirsch, Edward A. |
2003 |
96-97 | Index 1 |
p. 173-184 12 p. |
artikel |
|
| 3644 | XSAT and NAE-SAT of linear CNF classes |
Porschen, Stefan |
2014 |
96-97 | Index 1 |
p. 1-14 14 p. |
artikel |
|
| 3645 | Y-equivalence and rhombic realization of projective-planar quadrangulations |
Nakamoto, Atsuhiro |
|
96-97 | Index 1 |
p. 98-112 |
artikel |
|
| 3646 | Zagreb eccentricity indices of unicyclic graphs |
Qi, Xuli |
2017 |
96-97 | Index 1 |
p. 166-174 9 p. |
artikel |
|
| 3647 | Z-cyclic whist tournaments with a patterned starter initial round |
Finizio, Norman J. |
1994 |
96-97 | Index 1 |
p. 287-293 7 p. |
artikel |
|
| 3648 | Zero–one laws for k -variable first-order logic of sparse random graphs |
Razafimahatratra, A.S. |
|
96-97 | Index 1 |
p. 121-128 |
artikel |
3648 gevonden resultaten
| << vorige |