|
| << vorige | volgende >> |
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 |
| 1001 | Edge-disjoint paths in faulty augmented cubes |
Ma, Meijie |
|
96-97 | Index 1 |
p. 108-114 |
artikel |
|
| 1002 | Edge-disjoint properly colored cycles in edge-colored complete graphs |
Chen, Xiaozheng |
|
96-97 | Index 1 |
p. 84-96 |
artikel |
|
| 1003 | Edge-disjoint rainbow triangles in edge-colored graphs |
Li, Luyi |
|
96-97 | Index 1 |
p. 21-30 |
artikel |
|
| 1004 | Edge-disjoint spanning trees and forests of graphs |
Zhou, Jiang |
|
96-97 | Index 1 |
p. 74-81 |
artikel |
|
| 1005 | Edge dominating set and colorings on graphs with fixed clique-width |
Kobler, Daniel |
2003 |
96-97 | Index 1 |
p. 197-221 25 p. |
artikel |
|
| 1006 | Edge fault tolerance of graphs with respect to super edge connectivity |
Hong, Yanmei |
2012 |
96-97 | Index 1 |
p. 579-587 9 p. |
artikel |
|
| 1007 | Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs |
Guo, Jia |
|
96-97 | Index 1 |
p. 109-119 |
artikel |
|
| 1008 | Edge-grafting transformations on the average eccentricity of graphs and their applications |
He, Chunling |
2018 |
96-97 | Index 1 |
p. 95-105 |
artikel |
|
| 1009 | Edge intersection graphs of L -shaped paths in grids |
Cameron, Kathie |
2016 |
96-97 | Index 1 |
p. 185-194 |
artikel |
|
| 1010 | Edge intersection graphs of systems of paths on a grid with a bounded number of bends |
Asinowski, Andrei |
2009 |
96-97 | Index 1 |
p. 3174-3180 7 p. |
artikel |
|
| 1011 | Edge isoperimetric method: At least 2 / 3 of h -extra edge-connectivity of a kind of cube-based graphs concentrates on 2 n − 1 |
Zhang, Mingzu |
|
96-97 | Index 1 |
p. 167-174 |
artikel |
|
| 1012 | Edge metric dimension and mixed metric dimension of planar graph Q n |
Qu, Jing |
|
96-97 | Index 1 |
p. 462-475 |
artikel |
|
| 1013 | Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues |
Belardo, Francesco |
2019 |
96-97 | Index 1 |
p. 130-138 |
artikel |
|
| 1014 | Edge-rooted forests and the α -invariant of cone graphs |
Kook, W. |
2007 |
96-97 | Index 1 |
p. 1071-1075 5 p. |
artikel |
|
| 1015 | Edge separators for quasi-binary trees |
Ramírez Alfonsín, Jorge Luis |
2016 |
96-97 | Index 1 |
p. 284-289 |
artikel |
|
| 1016 | Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph |
Egawa, Yoshimi |
|
96-97 | Index 1 |
p. 142-158 |
artikel |
|
| 1017 | Edge-stable equimatchable graphs |
Deniz, Zakir |
2019 |
96-97 | Index 1 |
p. 136-147 |
artikel |
|
| 1018 | Edge weights and vertex colours: Minimizing sum count |
Baudon, Olivier |
2019 |
96-97 | Index 1 |
p. 13-24 |
artikel |
|
| 1019 | Editorial board |
1987 |
96-97 | Index 1 |
p. ii- 1 p. |
artikel |
||
| 1020 | Editorial Board |
2009 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1021 | Editorial Board |
2003 |
96-97 | Index 1 |
p. v-vii nvt p. |
artikel |
||
| 1022 | Editorial Board |
1994 |
96-97 | Index 1 |
p. iii-iv nvt p. |
artikel |
||
| 1023 | Editorial Board |
1997 |
96-97 | Index 1 |
p. iii-iv nvt p. |
artikel |
||
| 1024 | Editorial Board |
1997 |
96-97 | Index 1 |
p. iii-iv nvt p. |
artikel |
||
| 1025 | Editorial Board |
1998 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1026 | Editorial Board |
1998 |
96-97 | Index 1 |
p. IFC- 1 p. |
artikel |
||
| 1027 | Editorial Board |
1999 |
96-97 | Index 1 |
p. v- 1 p. |
artikel |
||
| 1028 | Editorial Board |
2006 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1029 | Editorial Board |
2006 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1030 | Editorial Board |
2008 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1031 | Editorial Board |
2018 |
96-97 | Index 1 |
p. ii |
artikel |
||
| 1032 | Editorial Board |
2018 |
96-97 | Index 1 |
p. ii |
artikel |
||
| 1033 | Editorial Board |
1989 |
96-97 | Index 1 |
p. ii- 1 p. |
artikel |
||
| 1034 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1035 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1036 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1037 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1038 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1039 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1040 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1041 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1042 | Editorial Board |
|
96-97 | Index 1 |
p. ii |
artikel |
||
| 1043 | Editorial Note: DAM Software Section |
Leonard, C.J |
2004 |
96-97 | Index 1 |
p. ix-x nvt p. |
artikel |
|
| 1044 | Editors nr. 1 |
2003 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1045 | Editors nr. 1 |
2002 |
96-97 | Index 1 |
p. v-vi nvt p. |
artikel |
||
| 1046 | Efficient algorithms for decomposing graphs under degree constraints |
Bazgan, Cristina |
2007 |
96-97 | Index 1 |
p. 979-988 10 p. |
artikel |
|
| 1047 | Efficient algorithms for path partitions |
Williams, Craig |
1990 |
96-97 | Index 1 |
p. 267-276 10 p. |
artikel |
|
| 1048 | Efficient algorithms for Roman domination on some classes of graphs |
Liedloff, Mathieu |
2008 |
96-97 | Index 1 |
p. 3400-3415 16 p. |
artikel |
|
| 1049 | Efficient algorithms for some path partitioning problems |
Brucker, Peter |
1995 |
96-97 | Index 1 |
p. 77-85 9 p. |
artikel |
|
| 1050 | Efficient broadcasting with linearly bounded faults |
Ciebiera, Krzysztof |
1998 |
96-97 | Index 1 |
p. 99-105 7 p. |
artikel |
|
| 1051 | Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints |
Kobayashi, Yasuaki |
|
96-97 | Index 1 |
p. 258-275 |
artikel |
|
| 1052 | Efficient construction of broadcast graphs |
Averbuch, A. |
2014 |
96-97 | Index 1 |
p. 9-14 6 p. |
artikel |
|
| 1053 | Efficient domination through eigenvalues |
Cardoso, Domingos M. |
2016 |
96-97 | Index 1 |
p. 54-62 9 p. |
artikel |
|
| 1054 | Efficient eight-regular circulants based on the Kronecker product |
Jha, Pranava K. |
2018 |
96-97 | Index 1 |
p. 207-218 |
artikel |
|
| 1055 | Efficient enumeration of transversal edge-partitions |
Shinraku, Koki |
|
96-97 | Index 1 |
p. 276-287 |
artikel |
|
| 1056 | Efficient fault-tolerant fixed routings on (k+1)-connected digraphs |
Wada, Koichi |
1992 |
96-97 | Index 1 |
p. 539-552 14 p. |
artikel |
|
| 1057 | Efficient generation of rotating workforce schedules |
Musliu, Nysret |
2002 |
96-97 | Index 1 |
p. 85-98 14 p. |
artikel |
|
| 1058 | Efficient implementation of a shifting algorithm |
Perl, Yehoshua |
1985 |
96-97 | Index 1 |
p. 71-80 10 p. |
artikel |
|
| 1059 | Efficient k -shot broadcasting in radio networks |
Kantor, Erez |
2016 |
96-97 | Index 1 |
p. 79-94 16 p. |
artikel |
|
| 1060 | Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation |
Pardey, Johannes |
|
96-97 | Index 1 |
p. 108-116 |
artikel |
|
| 1061 | Efficiently solvable special cases of bottleneck travelling salesman problems |
Burkard, R.E. |
1991 |
96-97 | Index 1 |
p. 61-76 16 p. |
artikel |
|
| 1062 | Efficient m-ary balanced codes |
Tallini, L.G. |
1999 |
96-97 | Index 1 |
p. 17-56 40 p. |
artikel |
|
| 1063 | Efficient methods of calculating the number of heapable permutations |
Chen, Benjamin |
|
96-97 | Index 1 |
p. 126-137 |
artikel |
|
| 1064 | Efficient methods of constructing universal cycles for k -permutations |
Chang, Zuling |
|
96-97 | Index 1 |
p. 120-134 |
artikel |
|
| 1065 | Efficient minimization of higher order submodular functions using monotonic Boolean functions |
Ramalingam, Srikumar |
2017 |
96-97 | Index 1 |
p. 1-19 19 p. |
artikel |
|
| 1066 | Efficient optimal equation formulation in lumped power-conserving systems |
Lamb, J.D. |
1998 |
96-97 | Index 1 |
p. 239-249 11 p. |
artikel |
|
| 1067 | Efficient parameterized algorithms for computing all-pairs shortest paths |
Kratsch, Stefan |
|
96-97 | Index 1 |
p. 102-119 |
artikel |
|
| 1068 | Efficient reformulation for 0–1 programs — methods and computational results |
Dietrich, B.L. |
1993 |
96-97 | Index 1 |
p. 147-175 29 p. |
artikel |
|
| 1069 | Efficient ( t , r ) broadcast dominating sets of the triangular lattice |
Harris, Pamela E. |
|
96-97 | Index 1 |
p. 180-192 |
artikel |
|
| 1070 | Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree |
Johnson, Charles R. |
2010 |
96-97 | Index 1 |
p. 681-691 11 p. |
artikel |
|
| 1071 | Eigenvalue multiplicity in regular graphs |
Rowlinson, Peter |
2019 |
96-97 | Index 1 |
p. 11-17 |
artikel |
|
| 1072 | Elementary sequences, sub-Fibonacci sequences |
Fishburn, Peter C. |
1993 |
96-97 | Index 1 |
p. 261-281 21 p. |
artikel |
|
| 1073 | Elusiveness of finding degrees |
Goyal, Dishant |
|
96-97 | Index 1 |
p. 128-139 |
artikel |
|
| 1074 | Embedding de Bruijn, Kautz and shuffle-exchange networks in books |
Hasunuma, Toru |
1997 |
96-97 | Index 1 |
p. 103-116 14 p. |
artikel |
|
| 1075 | Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 |
Opatrny, J |
2000 |
96-97 | Index 1 |
p. 237-254 18 p. |
artikel |
|
| 1076 | Embeddings of k -connected graphs of pathwidth k |
Gupta, Arvind |
2005 |
96-97 | Index 1 |
p. 242-265 24 p. |
artikel |
|
| 1077 | Embedding trees in recursive circulants |
Lim, Hyeong-Seok |
1996 |
96-97 | Index 1 |
p. 83-99 17 p. |
artikel |
|
| 1078 | Embedding various cycles with prescribed paths into k -ary n -cubes |
Yang, Yuxing |
2017 |
96-97 | Index 1 |
p. 161-169 9 p. |
artikel |
|
| 1079 | Energies of unitary one-matching bi-Cayley graphs over finite commutative rings |
Liu, Xiaogang |
2019 |
96-97 | Index 1 |
p. 170-179 |
artikel |
|
| 1080 | Energy of weighted digraphs |
Bhat, Mushtaq A. |
2017 |
96-97 | Index 1 |
p. 1-14 14 p. |
artikel |
|
| 1081 | Energy ordering of catacondensed hexagonal systems |
Rada, Juan |
2005 |
96-97 | Index 1 |
p. 437-443 7 p. |
artikel |
|
| 1082 | Enumerating and categorizing positive Boolean functions separable by a k -additive capacity |
Uyanık, Eda |
2017 |
96-97 | Index 1 |
p. 17-30 14 p. |
artikel |
|
| 1083 | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory |
Khachiyan, Leonid |
2007 |
96-97 | Index 1 |
p. 137-149 13 p. |
artikel |
|
| 1084 | Enumerating floorplans with walls |
Yamanaka, Katsuhisa |
|
96-97 | Index 1 |
p. 1-11 |
artikel |
|
| 1085 | Enumerating ( 2 + 2 ) -free posets by the number of minimal elements and other statistics |
Kitaev, Sergey |
2011 |
96-97 | Index 1 |
p. 2098-2108 11 p. |
artikel |
|
| 1086 | Enumerating lambda terms by weighted length of their De Bruijn representation |
Bodini, Olivier |
2018 |
96-97 | Index 1 |
p. 45-61 |
artikel |
|
| 1087 | Enumerating near-4-regular maps on the sphere and the torus |
Ren, Han |
2001 |
96-97 | Index 1 |
p. 273-288 16 p. |
artikel |
|
| 1088 | Enumeration and maximum number of maximal irredundant sets for chordal graphs |
Golovach, Petr A. |
2019 |
96-97 | Index 1 |
p. 69-85 |
artikel |
|
| 1089 | Enumeration aspects of maximal cliques and bicliques |
Gély, Alain |
2009 |
96-97 | Index 1 |
p. 1447-1459 13 p. |
artikel |
|
| 1090 | Enumeration of balanced ternary designs |
Kaski, Petteri |
2004 |
96-97 | Index 1 |
p. 133-141 9 p. |
artikel |
|
| 1091 | Enumeration of bipartite non-crossing geometric graphs |
Cheon, Gi-Sang |
|
96-97 | Index 1 |
p. 86-100 |
artikel |
|
| 1092 | Enumeration of Clar covers of parallelogram chains |
He, Bing-Hau |
|
96-97 | Index 1 |
p. 221-233 |
artikel |
|
| 1093 | Enumeration of factors in the Thue-Morse word |
Brlek, Srećko |
1989 |
96-97 | Index 1 |
p. 83-96 14 p. |
artikel |
|
| 1094 | Enumeration of irreducible binary words |
Kobayashi, Yuji |
1988 |
96-97 | Index 1 |
p. 221-232 12 p. |
artikel |
|
| 1095 | Enumeration of minimal connected dominating sets for chordal graphs |
Golovach, Petr A. |
|
96-97 | Index 1 |
p. 3-11 |
artikel |
|
| 1096 | Enumeration of perfect matchings of a type of Cartesian products of graphs |
Yan, Weigen |
2006 |
96-97 | Index 1 |
p. 145-157 13 p. |
artikel |
|
| 1097 | Enumeration of 2-regular circulant graphs and directed double networks |
Mamut, Aygul |
2009 |
96-97 | Index 1 |
p. 1024-1033 10 p. |
artikel |
|
| 1098 | Enumerations of humps and peaks in ( k , a ) -paths and ( n , m ) -Dyck paths via bijective proofs |
Du, Rosena R.X. |
2015 |
96-97 | Index 1 |
p. 42-49 8 p. |
artikel |
|
| 1099 | Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective |
Limaye, Girija |
|
96-97 | Index 1 |
p. 288-302 |
artikel |
|
| 1100 | EP theorems and linear complementarity problems |
Fukuda, Komei |
1998 |
96-97 | Index 1 |
p. 107-119 13 p. |
artikel |
|
| 1101 | Equations enforcing repetitions under permutations |
Day, Joel D. |
|
96-97 | Index 1 |
p. 61-78 |
artikel |
|
| 1102 | Equidistant codes in the Grassmannian |
Etzion, Tuvi |
2015 |
96-97 | Index 1 |
p. 87-97 11 p. |
artikel |
|
| 1103 | Equistable chordal graphs |
Peled, Uri N. |
2003 |
96-97 | Index 1 |
p. 203-210 8 p. |
artikel |
|
| 1104 | Equistable distance-hereditary graphs |
Korach, Ephraim |
2008 |
96-97 | Index 1 |
p. 462-477 16 p. |
artikel |
|
| 1105 | Equistable series–parallel graphs |
Korach, Ephraim |
2003 |
96-97 | Index 1 |
p. 149-162 14 p. |
artikel |
|
| 1106 | Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs |
Yan, Zhidan |
2014 |
96-97 | Index 1 |
p. 328-333 6 p. |
artikel |
|
| 1107 | Equitable colorings of Cartesian products of graphs |
Lin, Wu-Hsiung |
2012 |
96-97 | Index 1 |
p. 239-247 9 p. |
artikel |
|
| 1108 | Equitable colorings of Cartesian products with balanced complete multipartite graphs |
Yan, Zhidan |
2015 |
96-97 | Index 1 |
p. 200-203 4 p. |
artikel |
|
| 1109 | Equitable colorings of hypergraphs with few edges |
Akhmejanova, Margarita B. |
|
96-97 | Index 1 |
p. 2-12 |
artikel |
|
| 1110 | Equitable colorings of Kronecker products of graphs |
Lin, Wu-Hsiung |
2010 |
96-97 | Index 1 |
p. 1816-1826 11 p. |
artikel |
|
| 1111 | Equitable factorizations of edge-connected graphs |
Hasanvand, Morteza |
|
96-97 | Index 1 |
p. 136-145 |
artikel |
|
| 1112 | Equitable neighbour-sum-distinguishing edge and total colourings |
Baudon, Olivier |
2017 |
96-97 | Index 1 |
p. 40-53 14 p. |
artikel |
|
| 1113 | Equitable total coloring of complete r -partite p -balanced graphs |
da Silva, A.G. |
2019 |
96-97 | Index 1 |
p. 123-135 |
artikel |
|
| 1114 | Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 × n rectangles |
Langner, Johanna |
2018 |
96-97 | Index 1 |
p. 297-303 |
artikel |
|
| 1115 | Equivalence for negabent functions and their relative difference sets |
Anbar, Nurdagül |
2019 |
96-97 | Index 1 |
p. 1-12 |
artikel |
|
| 1116 | Equivalences and the complete hierarchy of intersection graphs of paths in a tree |
Golumbic, Martin Charles |
2008 |
96-97 | Index 1 |
p. 3203-3215 13 p. |
artikel |
|
| 1117 | Equivalent constraints for discrete sets |
Meyer, R.R |
1979 |
96-97 | Index 1 |
p. 31-50 20 p. |
artikel |
|
| 1118 | Equivalent realisations of a rigid graph |
Jackson, Bill |
2019 |
96-97 | Index 1 |
p. 42-58 |
artikel |
|
| 1119 | Equivalent versions of group-connectivity theorems and conjectures |
Kochol, Martin |
2019 |
96-97 | Index 1 |
p. 350-352 |
artikel |
|
| 1120 | Erdős–Ko–Rado theorems for a family of trees |
Feghali, Carl |
2018 |
96-97 | Index 1 |
p. 464-471 |
artikel |
|
| 1121 | Erratum to “Comparison of column generation models for channel assignment in cellular networks” |
Jaumard, Brigitte |
2002 |
96-97 | Index 1 |
p. 299-322 24 p. |
artikel |
|
| 1122 | Erratum to “Reduction of symmetric configurations n 3 ” [Discrete Appl. Math. 99 (1–3) (2000) 401 –411] |
Steffen, Eckhard |
2006 |
96-97 | Index 1 |
p. 1645-1646 2 p. |
artikel |
|
| 1123 | Error-correcting nonadaptive group testing with d e -disjunct matrices |
Macula, Anthony J. |
1997 |
96-97 | Index 1 |
p. 217-222 6 p. |
artikel |
|
| 1124 | Essential points of the n -cube subset partitioning characterisation |
Sahakyan, Hasmik |
2014 |
96-97 | Index 1 |
p. 205-213 9 p. |
artikel |
|
| 1125 | Essential upper bounds on the total domination number |
Henning, Michael A. |
2018 |
96-97 | Index 1 |
p. 103-115 |
artikel |
|
| 1126 | Establishing determinantal inequalities for positive-definite matrices |
Cerdeira, J.Orestes |
1995 |
96-97 | Index 1 |
p. 13-24 12 p. |
artikel |
|
| 1127 | Estimating satisfiability |
Boufkhad, Yacine |
2012 |
96-97 | Index 1 |
p. 61-80 20 p. |
artikel |
|
| 1128 | Estimating the r -colorability threshold for a random hypergraph |
Shabanov, Dmitry A. |
|
96-97 | Index 1 |
p. 168-183 |
artikel |
|
| 1129 | E -super vertex magic labelings of graphs |
Marimuthu, G. |
2012 |
96-97 | Index 1 |
p. 1766-1774 9 p. |
artikel |
|
| 1130 | Eulerian subgraphs and Hamilton-connected line graphs |
Li, Dengxin |
2005 |
96-97 | Index 1 |
p. 422-428 7 p. |
artikel |
|
| 1131 | Every 2-connected {claw, Z 2 }-free graph with minimum degree at least 4 contains two CISTs |
Chen, Xiaodong |
|
96-97 | Index 1 |
p. 51-64 |
artikel |
|
| 1132 | Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices |
Kuo, Che-Nan |
|
96-97 | Index 1 |
p. 1-9 |
artikel |
|
| 1133 | Every grid has an independent [1, 2]-set |
Aleid, S.A. |
2019 |
96-97 | Index 1 |
p. 14-21 |
artikel |
|
| 1134 | Every matroid is a submatroid of a uniformly dense matroid |
Lai, Hong-Jian |
1995 |
96-97 | Index 1 |
p. 151-160 10 p. |
artikel |
|
| 1135 | Every planar graph is 1-defective ( 9 , 2 ) -paintable |
Han, Ming |
|
96-97 | Index 1 |
p. 257-264 |
artikel |
|
| 1136 | Every toroidal graph without adjacent triangles is ( 4 , 1 ) * -choosable |
Xu, Baogang |
2007 |
96-97 | Index 1 |
p. 74-78 5 p. |
artikel |
|
| 1137 | Every triangle-free induced subgraph of the triangular lattice is ( 5 m , 2 m ) -choosable |
Aubry, Yves |
2014 |
96-97 | Index 1 |
p. 51-58 8 p. |
artikel |
|
| 1138 | Exact algorithms for counting 3-colorings of graphs |
Zhu, Enqiang |
|
96-97 | Index 1 |
p. 74-93 |
artikel |
|
| 1139 | Exact algorithms for dominating induced matching based on graph partition |
Xiao, Mingyu |
2015 |
96-97 | Index 1 |
p. 147-162 16 p. |
artikel |
|
| 1140 | Exact algorithms for weak Roman domination |
Chapelle, Mathieu |
2018 |
96-97 | Index 1 |
p. 79-92 |
artikel |
|
| 1141 | Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis |
Boros, Endre |
2004 |
96-97 | Index 1 |
p. 43-58 16 p. |
artikel |
|
| 1142 | Exact and approximate results on the least size of a graph with a given degree set |
Moondra, Jai |
|
96-97 | Index 1 |
p. 32-42 |
artikel |
|
| 1143 | Exact λ -numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips |
Adams, Sarah Spence |
2012 |
96-97 | Index 1 |
p. 436-447 12 p. |
artikel |
|
| 1144 | Exact satisfiability of linear CNF formulas |
Schuh, Bernd R. |
2018 |
96-97 | Index 1 |
p. 1-4 |
artikel |
|
| 1145 | Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs |
Liu, Xianliang |
2016 |
96-97 | Index 1 |
p. 111-116 6 p. |
artikel |
|
| 1146 | Exact value of e x ( n ; { C 3 , … , C s } ) for n ≤ ⌊ 25 ( s − 1 ) 8 ⌋ |
Abajo, E. |
2015 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 1147 | Exact values of e x ( ν ; { C 3 , C 4 , … , C n } ) |
Abajo, E. |
2010 |
96-97 | Index 1 |
p. 1869-1878 10 p. |
artikel |
|
| 1148 | Examples of products giving large graphs with given degree and diameter |
Delorme, C. |
1992 |
96-97 | Index 1 |
p. 157-167 11 p. |
artikel |
|
| 1149 | Excessive factorizations of bipartite multigraphs |
Cariolaro, David |
2010 |
96-97 | Index 1 |
p. 1760-1766 7 p. |
artikel |
|
| 1150 | Exchanges procedures for timetabling problems |
Ferland, Jacques A. |
1992 |
96-97 | Index 1 |
p. 237-253 17 p. |
artikel |
|
| 1151 | Excluding cycles with a fixed number of chords |
Aboulker, Pierre |
2015 |
96-97 | Index 1 |
p. 11-24 14 p. |
artikel |
|
| 1152 | Existence of directed triplewhist tournaments with the three person property 3 P D T W h ( v ) |
Abel, R.J.R. |
2008 |
96-97 | Index 1 |
p. 2655-2665 11 p. |
artikel |
|
| 1153 | Existence of directedwhist tournaments with the three person property 3 PDWh ( v ) |
Bennett, F.E. |
2006 |
96-97 | Index 1 |
p. 1939-1946 8 p. |
artikel |
|
| 1154 | Existence of paths with t blocks in k ( t ) -chromatic digraph |
El Joubbeh, Mouhamad |
|
96-97 | Index 1 |
p. 381-384 |
artikel |
|
| 1155 | Existence of resolvable optimal strong partially balanced designs |
Du, Beiliang |
2006 |
96-97 | Index 1 |
p. 930-941 12 p. |
artikel |
|
| 1156 | Expansion of layouts of complete binary trees into grids |
Lin, Y.-B. |
2003 |
96-97 | Index 1 |
p. 611-642 32 p. |
artikel |
|
| 1157 | Expected complexity of graph partitioning problems |
Kučera, Luděk |
1995 |
96-97 | Index 1 |
p. 193-212 20 p. |
artikel |
|
| 1158 | Expected polynomial-time randomized algorithm for graph coloring problem |
Ghosal, Subhankar |
|
96-97 | Index 1 |
p. 108-121 |
artikel |
|
| 1159 | Expected value expansions in rooted graphs |
Bailey, Alison |
2003 |
96-97 | Index 1 |
p. 555-571 17 p. |
artikel |
|
| 1160 | Explicit construction of graphs with an arbitrary large girth and of large size |
Lazebnik, Felix |
1995 |
96-97 | Index 1 |
p. 275-284 10 p. |
artikel |
|
| 1161 | Explicit expressions for the central characters of the symmetric group |
Katriel, Jacob |
1996 |
96-97 | Index 1 |
p. 149-156 8 p. |
artikel |
|
| 1162 | Exploiting partial knowledge of satisfying assignments |
Iwama, Kazuo |
2007 |
96-97 | Index 1 |
p. 1596-1603 8 p. |
artikel |
|
| 1163 | Exploring algorithmic solutions for the Independent Roman Domination problem in graphs |
Paul, Kaustav |
|
96-97 | Index 1 |
p. 143-152 |
artikel |
|
| 1164 | Exploring the concept of perfection in 3-hypergraphs |
García-Colín, Natalia |
2016 |
96-97 | Index 1 |
p. 164-170 |
artikel |
|
| 1165 | Extending shelling orders and a hierarchy of functions of unimodal simple polytopes |
Hoke, Kathy |
1995 |
96-97 | Index 1 |
p. 211-217 7 p. |
artikel |
|
| 1166 | Extensions de réseaux de connexité donnée |
Konig, Jean-Claude |
1989 |
96-97 | Index 1 |
p. 197-211 15 p. |
artikel |
|
| 1167 | Extensions of results on phylogeny graphs of degree bounded digraphs |
Choi, Myungho |
|
96-97 | Index 1 |
p. 30-45 |
artikel |
|
| 1168 | Extremal bipartite graphs of given connectivity with respect to matching energy |
Chen, Hanlin |
2018 |
96-97 | Index 1 |
p. 200-205 |
artikel |
|
| 1169 | Extremal graphs for blow-ups of stars and paths |
Kang, Liying |
|
96-97 | Index 1 |
p. 79-85 |
artikel |
|
| 1170 | Extremal graphs for the geometric–arithmetic index with given minimum degree |
Divnić, Tomica |
2014 |
96-97 | Index 1 |
p. 386-390 5 p. |
artikel |
|
| 1171 | Extremal graphs for vertex-degree-based invariants with given degree sequences |
Liu, Muhuo |
2019 |
96-97 | Index 1 |
p. 267-277 |
artikel |
|
| 1172 | Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance |
Hong, Yunchao |
|
96-97 | Index 1 |
p. 147-158 |
artikel |
|
| 1173 | Extremal graphs with respect to generalized A B C index |
Chen, Xiaodan |
2018 |
96-97 | Index 1 |
p. 115-124 |
artikel |
|
| 1174 | Extremal Halin graphs with respect to the signless Laplacian spectra |
Zhang, Minjie |
2016 |
96-97 | Index 1 |
p. 207-218 12 p. |
artikel |
|
| 1175 | Extremal hypergraphs for matching number and domination number |
Shan, Erfang |
2018 |
96-97 | Index 1 |
p. 415-421 |
artikel |
|
| 1176 | Extremal k -generalized quasi unicyclic graphs with respect to first and second Zagreb indices |
Javaid, Faisal |
2019 |
96-97 | Index 1 |
p. 153-158 |
artikel |
|
| 1177 | Extremal numbers for cycles in a hypercube |
Axenovich, Maria |
|
96-97 | Index 1 |
p. 1-3 |
artikel |
|
| 1178 | Extremal numbers for disjoint copies of a clique |
Zhang, Junxue |
|
96-97 | Index 1 |
p. 263-270 |
artikel |
|
| 1179 | Extremal polygonal cacti for bond incident degree indices |
Ye, Jiachang |
2019 |
96-97 | Index 1 |
p. 289-298 |
artikel |
|
| 1180 | Extremal problems for degree-based topological indices |
Tang, Yunfang |
2016 |
96-97 | Index 1 |
p. 134-143 10 p. |
artikel |
|
| 1181 | Extremal problems for trees with given segment sequence |
Andriantiana, Eric Ould Dadah |
2017 |
96-97 | Index 1 |
p. 20-34 15 p. |
artikel |
|
| 1182 | Extremal problems on consecutive L ( 2 , 1 ) -labelling |
Lu, Changhong |
2007 |
96-97 | Index 1 |
p. 1302-1313 12 p. |
artikel |
|
| 1183 | Extremal problems on distance spectra of graphs |
Lin, Huiqiu |
|
96-97 | Index 1 |
p. 139-147 |
artikel |
|
| 1184 | Extremal problems on ray sensor configurations |
Boyer, Kirk |
|
96-97 | Index 1 |
p. 87-100 |
artikel |
|
| 1185 | Extremal problems on saturation for the family of k -edge-connected graphs |
Lei, Hui |
2019 |
96-97 | Index 1 |
p. 278-283 |
artikel |
|
| 1186 | Extremal results for graphs of bounded metric dimension |
Geneson, Jesse |
|
96-97 | Index 1 |
p. 123-129 |
artikel |
|
| 1187 | Extremal trees of given segment sequence with respect to some eccentricity-based invariants |
Zhang, Minjie |
|
96-97 | Index 1 |
p. 111-123 |
artikel |
|
| 1188 | Extremal values and bounds for the zero forcing number |
Gentner, Michael |
2016 |
96-97 | Index 1 |
p. 196-200 5 p. |
artikel |
|
| 1189 | Extremal values for ratios of distances in trees |
Barefoot, C.A. |
1997 |
96-97 | Index 1 |
p. 37-56 20 p. |
artikel |
|
| 1190 | Extremal vertex-degree function index for trees and unicyclic graphs with given independence number |
Tomescu, Ioan |
|
96-97 | Index 1 |
p. 83-88 |
artikel |
|
| 1191 | Extremal vertex-degree function index with given order and dissociation number |
Huang, Jing |
|
96-97 | Index 1 |
p. 142-152 |
artikel |
|
| 1192 | Facets of the k-partition polytope |
Chopra, Sunil |
1995 |
96-97 | Index 1 |
p. 27-48 22 p. |
artikel |
|
| 1193 | Facets of the three-index assignment polytope |
Balas, Egon |
1989 |
96-97 | Index 1 |
p. 201-229 29 p. |
artikel |
|
| 1194 | Facial anagram-free edge-coloring of plane graphs |
Czap, Július |
2017 |
96-97 | Index 1 |
p. 151-155 5 p. |
artikel |
|
| 1195 | ℓ -facial edge colorings of graphs |
Lužar, Borut |
2015 |
96-97 | Index 1 |
p. 193-200 8 p. |
artikel |
|
| 1196 | Facial edge ranking of plane graphs |
Czap, Július |
2015 |
96-97 | Index 1 |
p. 60-64 5 p. |
artikel |
|
| 1197 | Facial L ( 2 , 1 ) -edge-labelings of trees |
Czap, Július |
|
96-97 | Index 1 |
p. 357-366 |
artikel |
|
| 1198 | Facial packing edge-coloring of plane graphs |
Czap, Július |
2016 |
96-97 | Index 1 |
p. 71-75 5 p. |
artikel |
|
| 1199 | Facial packing vertex-coloring of subdivided plane graphs |
Czap, Július |
2019 |
96-97 | Index 1 |
p. 95-100 |
artikel |
|
| 1200 | Facility location games with distinct desires |
Mei, Lili |
2019 |
96-97 | Index 1 |
p. 148-160 |
artikel |
|
| 1201 | 1-factor covers of regular graphs |
belcastro, sarah-marie |
2011 |
96-97 | Index 1 |
p. 281-287 7 p. |
artikel |
|
| 1202 | Factors of bi-regular bipartite graphs |
Egawa, Yoshimi |
|
96-97 | Index 1 |
p. 268-272 |
artikel |
|
| 1203 | Factors, spectral radius and toughness in bipartite graphs |
Chen, Yuanyuan |
|
96-97 | Index 1 |
p. 223-231 |
artikel |
|
| 1204 | Fair division with multiple pieces |
Nyman, Kathryn |
|
96-97 | Index 1 |
p. 115-122 |
artikel |
|
| 1205 | Fair multi-cake cutting |
Segal-Halevi, Erel |
|
96-97 | Index 1 |
p. 15-35 |
artikel |
|
| 1206 | Families of finite sets satisfying intersection restrictions |
Frankl, Peter |
|
96-97 | Index 1 |
p. 44-49 |
artikel |
|
| 1207 | Families of non-IRUP instances of the one-dimensional cutting stock problem |
Rietz, Jürgen |
2002 |
96-97 | Index 1 |
p. 229-245 17 p. |
artikel |
|
| 1208 | Fast algorithms for identifying maximal common connected sets of interval graphs |
Coulon, Fabien |
2006 |
96-97 | Index 1 |
p. 1709-1721 13 p. |
artikel |
|
| 1209 | Fast algorithms for min independent dominating set |
Bourgeois, N. |
2013 |
96-97 | Index 1 |
p. 558-572 15 p. |
artikel |
|
| 1210 | Fast approximation algorithm for job sequencing with deadlines |
Gens, G.V. |
1981 |
96-97 | Index 1 |
p. 313-318 6 p. |
artikel |
|
| 1211 | Faster isometric embedding in products of complete graphs |
Aurenhammer, Franz |
1994 |
96-97 | Index 1 |
p. 17-28 12 p. |
artikel |
|
| 1212 | Faster separation of 1-wheel inequalities by graph products |
de Vries, Sven |
2015 |
96-97 | Index 1 |
p. 74-83 10 p. |
artikel |
|
| 1213 | Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover |
Nishimura, Naomi |
2005 |
96-97 | Index 1 |
p. 229-245 17 p. |
artikel |
|
| 1214 | Fast gossiping with short unreliable messages |
Chlebus, Bogdan S. |
1994 |
96-97 | Index 1 |
p. 15-24 10 p. |
artikel |
|
| 1215 | Fast information sharing in a complete network |
Sunderam, V.S. |
1993 |
96-97 | Index 1 |
p. 75-86 12 p. |
artikel |
|
| 1216 | Fast winning strategies for Staller in the Maker–Breaker domination game |
Bujtás, Csilla |
|
96-97 | Index 1 |
p. 10-22 |
artikel |
|
| 1217 | Fat Hoffman graphs with smallest eigenvalue greater than −3 |
Munemasa, Akihiro |
|
96-97 | Index 1 |
p. 78-88 |
artikel |
|
| 1218 | Fault diagnosability of DQcube under the PMC model |
Lv, Mengjie |
2019 |
96-97 | Index 1 |
p. 180-192 |
artikel |
|
| 1219 | Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity |
Zhu, Bo |
|
96-97 | Index 1 |
p. 111-123 |
artikel |
|
| 1220 | Fault-tolerant routings in double fixed-step networks |
Fabrega, J. |
1997 |
96-97 | Index 1 |
p. 61-74 14 p. |
artikel |
|
| 1221 | Fault-tolerant strong Menger (edge) connectivity of arrangement graph |
Li, Pingshan |
|
96-97 | Index 1 |
p. 53-61 |
artikel |
|
| 1222 | Ferrers dimension of grid intersection graphs |
Chaplick, Steven |
2017 |
96-97 | Index 1 |
p. 130-135 6 p. |
artikel |
|
| 1223 | Few-weight codes over F p + u F p associated with down sets and their distance optimal Gray image |
Wu, Yansheng |
|
96-97 | Index 1 |
p. 315-322 |
artikel |
|
| 1224 | Fibonacci and Lucas p -cubes |
Wei, Jianxin |
|
96-97 | Index 1 |
p. 365-383 |
artikel |
|
| 1225 | Finding a homotopy base for directed paths in an acyclic graph |
Murota, Kazuo |
1987 |
96-97 | Index 1 |
p. 157-162 6 p. |
artikel |
|
| 1226 | Finding a mediocre player |
Dumitrescu, Adrian |
|
96-97 | Index 1 |
p. 15-24 |
artikel |
|
| 1227 | Finding and listing induced paths and cycles |
Hoàng, Chính T. |
2013 |
96-97 | Index 1 |
p. 633-641 9 p. |
artikel |
|
| 1228 | Finding a non-minority ball with majority answers |
Gerbner, Dániel |
2017 |
96-97 | Index 1 |
p. 18-31 14 p. |
artikel |
|
| 1229 | Finding biclique partitions of co-chordal graphs |
Lyu, Bochuan |
|
96-97 | Index 1 |
p. 278-287 |
artikel |
|
| 1230 | Finding clubs in graph classes |
Golovach, Petr A. |
2014 |
96-97 | Index 1 |
p. 57-65 9 p. |
artikel |
|
| 1231 | Finding dominating induced matchings in S 1 , 1 , 5 -free graphs in polynomial time |
Brandstädt, Andreas |
|
96-97 | Index 1 |
p. 269-280 |
artikel |
|
| 1232 | Finding dominating induced matchings in S 2 , 2 , 3 -free graphs in polynomial time |
Brandstädt, Andreas |
|
96-97 | Index 1 |
p. 417-434 |
artikel |
|
| 1233 | Finding kings in tournaments |
Biswas, Arindam |
|
96-97 | Index 1 |
p. 240-252 |
artikel |
|
| 1234 | Finding large cycles in Hamiltonian graphs |
Feder, Tomás |
2010 |
96-97 | Index 1 |
p. 882-893 12 p. |
artikel |
|
| 1235 | Finding monotone paths in edge-ordered graphs |
Katrenič, J. |
2010 |
96-97 | Index 1 |
p. 1624-1632 9 p. |
artikel |
|
| 1236 | Finding paths in graphs avoiding forbidden transitions |
Szeider, Stefan |
2003 |
96-97 | Index 1 |
p. 261-273 13 p. |
artikel |
|
| 1237 | Finding submasses in weighted strings with Fast Fourier Transform |
Bansal, Nikhil |
2007 |
96-97 | Index 1 |
p. 707-718 12 p. |
artikel |
|
| 1238 | Finding the closest ultrametric |
Di Summa, Marco |
2015 |
96-97 | Index 1 |
p. 70-80 11 p. |
artikel |
|
| 1239 | Finding the edge ranking number through vertex partitions |
Lin, Yo-Lin |
2013 |
96-97 | Index 1 |
p. 1067-1071 5 p. |
artikel |
|
| 1240 | Finding the maximum and minimum |
Aigner, Martin |
1997 |
96-97 | Index 1 |
p. 1-12 12 p. |
artikel |
|
| 1241 | Finding the Pareto-optima for the total and maximum tardiness single machine problem |
Tadei, R |
2002 |
96-97 | Index 1 |
p. 117-126 10 p. |
artikel |
|
| 1242 | Finding the two-core of a tree |
Becker, Ronald I. |
1985 |
96-97 | Index 1 |
p. 103-113 11 p. |
artikel |
|
| 1243 | Fine-grained parameterized complexity analysis of graph coloring problems |
Jaffke, Lars |
|
96-97 | Index 1 |
p. 33-46 |
artikel |
|
| 1244 | Finite automata for languages of combinatorial interest: An order theoretical point of view |
Simion, Rodica E. |
1989 |
96-97 | Index 1 |
p. 237-246 10 p. |
artikel |
|
| 1245 | Fire containment in grids of dimension three and higher |
Develin, Mike |
2007 |
96-97 | Index 1 |
p. 2257-2268 12 p. |
artikel |
|
| 1246 | Firefighting on the hexagonal grid |
Dean, Abdullah |
|
96-97 | Index 1 |
p. 16-22 |
artikel |
|
| 1247 | First-Fit coloring of bounded tolerance graphs |
Kierstead, H.A. |
2011 |
96-97 | Index 1 |
p. 605-611 7 p. |
artikel |
|
| 1248 | First-Fit coloring of { P 5 , K 4 − e } -free graphs |
Choudum, S.A. |
2010 |
96-97 | Index 1 |
p. 620-626 7 p. |
artikel |
|
| 1249 | First fit decreasing scheduling on uniform multiprocessors |
Kunde, Manfred |
1985 |
96-97 | Index 1 |
p. 165-177 13 p. |
artikel |
|
| 1250 | First order sentences about random graphs: Small number of alternations |
Matushkin, A.D. |
2018 |
96-97 | Index 1 |
p. 329-346 |
artikel |
|
| 1251 | Fixed cardinality stable sets |
Samer, Phillippe |
|
96-97 | Index 1 |
p. 137-148 |
artikel |
|
| 1252 | Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs |
Yamada, Suguru |
|
96-97 | Index 1 |
p. 343-354 |
artikel |
|
| 1253 | Fixed-parameter algorithms for the cocoloring problem |
Campos, Victor |
2014 |
96-97 | Index 1 |
p. 52-60 9 p. |
artikel |
|
| 1254 | Fixed points and connections between positive and negative cycles in Boolean networks |
Richard, Adrien |
2018 |
96-97 | Index 1 |
p. 1-10 |
artikel |
|
| 1255 | Flexible allocation on related machines with assignment restrictions |
Rawitz, Dror |
2018 |
96-97 | Index 1 |
p. 309-321 |
artikel |
|
| 1256 | Flexing infinite frameworks with applications to braced Penrose tilings |
Dewar, Sean |
|
96-97 | Index 1 |
p. 1-17 |
artikel |
|
| 1257 | Flows over edge-disjoint mixed multipaths and applications |
Aneja, Y.P. |
2007 |
96-97 | Index 1 |
p. 1979-2000 22 p. |
artikel |
|
| 1258 | Fly-automata for checking MSO 2 graph properties |
Courcelle, Bruno |
2018 |
96-97 | Index 1 |
p. 236-252 |
artikel |
|
| 1259 | Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition |
Wang, Qiang |
|
96-97 | Index 1 |
p. 290-300 |
artikel |
|
| 1260 | Forbidden Pairs of disconnected graphs for traceability and hamiltonicity |
Liao, Hongli |
|
96-97 | Index 1 |
p. 105-114 |
artikel |
|
| 1261 | Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words |
Takaoka, Asahi |
|
96-97 | Index 1 |
p. 285-301 |
artikel |
|
| 1262 | Forbidden rainbow subgraphs that force large monochromatic or multicolored k -connected subgraphs |
Li, Xihe |
|
96-97 | Index 1 |
p. 18-29 |
artikel |
|
| 1263 | Forbidding a set difference of size 1 |
Leader, Imre |
2014 |
96-97 | Index 1 |
p. 219-224 6 p. |
artikel |
|
| 1264 | Foreword |
Carlet, C |
2001 |
96-97 | Index 1 |
p. 1- 1 p. |
artikel |
|
| 1265 | Fork-forests in bi-colored complete bipartite graphs |
Axenovich, Maria |
2013 |
96-97 | Index 1 |
p. 1363-1366 4 p. |
artikel |
|
| 1266 | Formulas for approximating pseudo-Boolean random variables |
Ding, Guoli |
2008 |
96-97 | Index 1 |
p. 1581-1597 17 p. |
artikel |
|
| 1267 | Formulas for cube roots in F 3 m |
Ahmadi, Omran |
2007 |
96-97 | Index 1 |
p. 260-270 11 p. |
artikel |
|
| 1268 | Formulating the single machine sequencing problem with release dates as a mixed integer program |
Dyer, Martin E. |
1990 |
96-97 | Index 1 |
p. 255-270 16 p. |
artikel |
|
| 1269 | Formulations for the maximum common edge subgraph problem |
de Gastines, Etienne |
|
96-97 | Index 1 |
p. 115-130 |
artikel |
|
| 1270 | Forwarding index of cube-connected cycles |
Yan, Jun |
2009 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 1271 | Forwarding indices of folded n -cubes |
Hou, Xinmin |
2005 |
96-97 | Index 1 |
p. 490-492 3 p. |
artikel |
|
| 1272 | Forwarding indices of k-connected graphs |
Heydemann, M.C |
1992 |
96-97 | Index 1 |
p. 287-296 10 p. |
artikel |
|
| 1273 | Fractional acquisition in graphs |
Wenger, Paul S. |
2014 |
96-97 | Index 1 |
p. 142-148 7 p. |
artikel |
|
| 1274 | Fractional arboricity, strength, and principal partitions in graphs and matroids |
Catlin, Paul A. |
1992 |
96-97 | Index 1 |
p. 285-302 18 p. |
artikel |
|
| 1275 | Fractional domination of strong direct products |
Fisher, David C. |
1994 |
96-97 | Index 1 |
p. 89-91 3 p. |
artikel |
|
| 1276 | Fractionally total colouring G n , p |
Meagher, Conor |
2008 |
96-97 | Index 1 |
p. 1112-1124 13 p. |
artikel |
|
| 1277 | Fractional matching preclusion numbers of Cartesian product graphs |
Luan, Yu |
|
96-97 | Index 1 |
p. 100-112 |
artikel |
|
| 1278 | Fractional matchings and the Edmonds-Gallai theorem |
Pulleyblank, W.R |
1987 |
96-97 | Index 1 |
p. 51-58 8 p. |
artikel |
|
| 1279 | Fractional spanning tree packing, forest covering and eigenvalues |
Hong, Yanmei |
2016 |
96-97 | Index 1 |
p. 219-223 5 p. |
artikel |
|
| 1280 | Fractional total colouring |
Ryan, Jennifer |
1990 |
96-97 | Index 1 |
p. 287-292 6 p. |
artikel |
|
| 1281 | Fractional weak discrepancy and interval orders |
Shuchat, Alan |
2009 |
96-97 | Index 1 |
p. 1873-1884 12 p. |
artikel |
|
| 1282 | Fractional weak discrepancy and split semiorders |
Shuchat, Alan |
2011 |
96-97 | Index 1 |
p. 647-660 14 p. |
artikel |
|
| 1283 | Fragmented coloring of proper interval and split graphs |
Diwan, Ajit |
2015 |
96-97 | Index 1 |
p. 110-118 9 p. |
artikel |
|
| 1284 | Free monoids and forests of rational numbers |
Nathanson, Melvyn B. |
2017 |
96-97 | Index 1 |
p. 662-669 8 p. |
artikel |
|
| 1285 | Free multiflows in bidirected and skew-symmetric graphs |
Babenko, Maxim A. |
2007 |
96-97 | Index 1 |
p. 1715-1730 16 p. |
artikel |
|
| 1286 | Friedman numbers have density 1 |
Brand, Michael |
2013 |
96-97 | Index 1 |
p. 2389-2395 7 p. |
artikel |
|
| 1287 | Fringe thickness and maximum path length of binary trees |
Cameron, Helen |
1998 |
96-97 | Index 1 |
p. 75-97 23 p. |
artikel |
|
| 1288 | From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats |
Hellmuth, Marc |
|
96-97 | Index 1 |
p. 179-219 |
artikel |
|
| 1289 | From preemptive to non-preemptive speed-scaling scheduling |
Bampis, Evripidis |
2015 |
96-97 | Index 1 |
p. 11-20 10 p. |
artikel |
|
| 1290 | Frustration and isoperimetric inequalities for signed graphs |
Martin, Florian |
2017 |
96-97 | Index 1 |
p. 276-285 10 p. |
artikel |
|
| 1291 | Frustration-critical signed graphs |
Cappello, Chiara |
|
96-97 | Index 1 |
p. 183-193 |
artikel |
|
| 1292 | Fulkerson-covers of hypohamiltonian graphs |
Chen, Fuyuan |
2015 |
96-97 | Index 1 |
p. 66-73 8 p. |
artikel |
|
| 1293 | Full friendly index set — I |
Sinha, Deepa |
2013 |
96-97 | Index 1 |
p. 1262-1274 13 p. |
artikel |
|
| 1294 | Full orientability of graphs with at most one dependent arc |
Lai, Hsin-Hao |
2009 |
96-97 | Index 1 |
p. 2969-2972 4 p. |
artikel |
|
| 1295 | Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem |
Tamir, Arie |
1998 |
96-97 | Index 1 |
p. 229-243 15 p. |
artikel |
|
| 1296 | Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs |
Apollonio, Nicola |
|
96-97 | Index 1 |
p. 226-237 |
artikel |
|
| 1297 | Further acceleration in computing the gap greedy spanner: An empirical approach |
Salami, Hosein |
|
96-97 | Index 1 |
p. 33-52 |
artikel |
|
| 1298 | Further analysis of bent functions from C and D which are provably outside or inside M # |
Zhang, Fengrong |
|
96-97 | Index 1 |
p. 458-472 |
artikel |
|
| 1299 | Further combinatorial identities deriving from the nth power of a 2 × 2 matrix |
Mc Laughlin, James |
2006 |
96-97 | Index 1 |
p. 1301-1308 8 p. |
artikel |
|
| 1300 | Further cryptographic properties of the multiplicative inverse function |
Tang, Deng |
|
96-97 | Index 1 |
p. 191-211 |
artikel |
|
| 1301 | Further evidence towards the multiplicative 1-2-3 Conjecture |
Bensmail, Julien |
|
96-97 | Index 1 |
p. 135-144 |
artikel |
|
| 1302 | Further generalizations of the Wythoff game and the minimum excludant |
Gurvich, Vladimir |
2012 |
96-97 | Index 1 |
p. 941-947 7 p. |
artikel |
|
| 1303 | Further results on an equitable 1-2-3 Conjecture |
Bensmail, Julien |
|
96-97 | Index 1 |
p. 1-20 |
artikel |
|
| 1304 | Further results on injective edge coloring of graphs with maximum degree 5 |
Lu, Jian |
|
96-97 | Index 1 |
p. 176-184 |
artikel |
|
| 1305 | Further results on the deficiency of graphs |
Petrosyan, P.A. |
2017 |
96-97 | Index 1 |
p. 117-126 10 p. |
artikel |
|
| 1306 | Further results on the largest matching root of unicyclic graphs |
Liu, Weijun |
2017 |
96-97 | Index 1 |
p. 82-88 7 p. |
artikel |
|
| 1307 | Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs |
Cararo, Cintia Izabel |
|
96-97 | Index 1 |
p. 114-124 |
artikel |
|
| 1308 | F -WORM colorings: Results for 2 -connected graphs |
Bujtás, Csilla |
2017 |
96-97 | Index 1 |
p. 131-138 8 p. |
artikel |
|
| 1309 | Gallai and ℓ -uniform Ramsey numbers of complete bipartite graphs |
Liu, Yuchen |
|
96-97 | Index 1 |
p. 131-139 |
artikel |
|
| 1310 | Gallai–Ramsey numbers for graphs with chromatic number three |
Zhao, Qinghong |
|
96-97 | Index 1 |
p. 110-118 |
artikel |
|
| 1311 | Gallai–Ramsey numbers for multiple triangles |
Zhang, Fangfang |
|
96-97 | Index 1 |
p. 103-109 |
artikel |
|
| 1312 | Gallai’s question and constructions of almost hypotraceable graphs |
Wiener, Gábor |
2018 |
96-97 | Index 1 |
p. 270-278 |
artikel |
|
| 1313 | Game brush number |
Kinnersley, William B. |
2016 |
96-97 | Index 1 |
p. 1-14 14 p. |
artikel |
|
| 1314 | Game matching number of graphs |
Cranston, Daniel W. |
2013 |
96-97 | Index 1 |
p. 1828-1836 9 p. |
artikel |
|
| 1315 | Game of pure chance with restricted boundary |
Leung, Ho-Hon |
|
96-97 | Index 1 |
p. 613-625 |
artikel |
|
| 1316 | Game total domination critical graphs |
Henning, Michael A. |
2018 |
96-97 | Index 1 |
p. 28-37 |
artikel |
|
| 1317 | Game total domination for cycles and paths |
Dorbec, Paul |
2016 |
96-97 | Index 1 |
p. 7-18 12 p. |
artikel |
|
| 1318 | General eccentric connectivity index of trees and unicyclic graphs |
Vetrík, Tomáš |
|
96-97 | Index 1 |
p. 301-315 |
artikel |
|
| 1319 | Generalised Ramsey numbers for two sets of cycles |
Hansson, Mikael |
2018 |
96-97 | Index 1 |
p. 86-94 |
artikel |
|
| 1320 | Generalized balances in Sturmian words |
Fagnot, Isabelle |
2002 |
96-97 | Index 1 |
p. 83-101 19 p. |
artikel |
|
| 1321 | Generalized bicycles |
Berman, Kenneth A. |
1997 |
96-97 | Index 1 |
p. 27-40 14 p. |
artikel |
|
| 1322 | Generalized competition indices of symmetric primitive digraphs |
Kim, Hwa Kyung |
2012 |
96-97 | Index 1 |
p. 1583-1590 8 p. |
artikel |
|
| 1323 | Generalized competitively orientable complete multipartite graphs |
Choi, Myungho |
|
96-97 | Index 1 |
p. 65-72 |
artikel |
|
| 1324 | Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs |
Zaker, Manouchehr |
2013 |
96-97 | Index 1 |
p. 2716-2723 8 p. |
artikel |
|
| 1325 | Generalized distance spectral characterizations of graphs based on Smith Norm Form |
Qiu, Lihong |
|
96-97 | Index 1 |
p. 159-168 |
artikel |
|
| 1326 | Generalized exponents of primitive symmetric digraphs |
Brualdi, Richard A. |
1997 |
96-97 | Index 1 |
p. 275-293 19 p. |
artikel |
|
| 1327 | Generalized fault-tolerance for enhanced hypercubes |
Ma, Meijie |
|
96-97 | Index 1 |
p. 244-252 |
artikel |
|
| 1328 | Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees |
Hellmuth, Marc |
2019 |
96-97 | Index 1 |
p. 1-11 |
artikel |
|
| 1329 | Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees |
Hellmuth, Marc |
|
96-97 | Index 1 |
p. 495-511 |
artikel |
|
| 1330 | Generalized knight’s tour on 3D chessboards |
Bai, Sen |
2010 |
96-97 | Index 1 |
p. 1727-1731 5 p. |
artikel |
|
| 1331 | Generalized knight's tours on rectangular chessboards |
Chia, G.L. |
2005 |
96-97 | Index 1 |
p. 80-98 19 p. |
artikel |
|
| 1332 | Generalized neighbourhoods and a class of perfectly orderable graphs |
Cochand, M. |
1986 |
96-97 | Index 1 |
p. 213-220 8 p. |
artikel |
|
| 1333 | Generalized perfect graphs: Characterizations and inversion |
Trenk, Ann N. |
1995 |
96-97 | Index 1 |
p. 359-387 29 p. |
artikel |
|
| 1334 | Generalized roof duality and bisubmodular functions |
Kolmogorov, Vladimir |
2012 |
96-97 | Index 1 |
p. 416-426 11 p. |
artikel |
|
| 1335 | Generalized saturation game |
Patkós, Balázs |
|
96-97 | Index 1 |
p. 33-49 |
artikel |
|
| 1336 | Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs |
Żak, Andrzej |
2019 |
96-97 | Index 1 |
p. 299-306 |
artikel |
|
| 1337 | General lower bounds on the query complexity within the exact learning model |
Klasner, Norbert |
2000 |
96-97 | Index 1 |
p. 61-81 21 p. |
artikel |
|
| 1338 | General Randić index of unicyclic graphs with given diameter |
Alfuraidan, Monther Rashed |
|
96-97 | Index 1 |
p. 7-16 |
artikel |
|
| 1339 | General Randić matrix and general Randić incidence matrix |
Liu, Ruifang |
2015 |
96-97 | Index 1 |
p. 168-175 8 p. |
artikel |
|
| 1340 | General sum-connectivity index of unicyclic graphs with given diameter |
Alfuraidan, Monther Rashed |
|
96-97 | Index 1 |
p. 39-46 |
artikel |
|
| 1341 | General sum-connectivity index of unicyclic graphs with given maximum degree |
Swartz, Elize |
|
96-97 | Index 1 |
p. 238-249 |
artikel |
|
| 1342 | General vertex disjoint paths in series-parallel graphs |
Korach, Ephraim |
1993 |
96-97 | Index 1 |
p. 147-164 18 p. |
artikel |
|
| 1343 | Generating all minimal integral solutions to AND–OR systems of monotone inequalities: Conjunctions are simpler than disjunctions |
Khachiyan, Leonid |
2008 |
96-97 | Index 1 |
p. 2020-2034 15 p. |
artikel |
|
| 1344 | Generating non-jumping numbers recursively |
Peng, Yuejian |
2008 |
96-97 | Index 1 |
p. 1856-1864 9 p. |
artikel |
|
| 1345 | Generating permutations with given ups and downs |
van Baronaigien, D.Roelants |
1992 |
96-97 | Index 1 |
p. 57-65 9 p. |
artikel |
|
| 1346 | Generation of key predistribution schemes using secret sharing schemes |
Sáez, Germán |
2003 |
96-97 | Index 1 |
p. 239-249 11 p. |
artikel |
|
| 1347 | Genotyping of pooled microsatellite markers by combinatorial optimization techniques |
Lancia, Giuseppe |
1998 |
96-97 | Index 1 |
p. 291-314 24 p. |
artikel |
|
| 1348 | Geodesic-pancyclic graphs |
Chan, Hung-Chang |
2007 |
96-97 | Index 1 |
p. 1971-1978 8 p. |
artikel |
|
| 1349 | Geodesic pancyclicity and balanced pancyclicity of the generalized base- b hypercube |
Fang, Jywe-Fei |
2012 |
96-97 | Index 1 |
p. 548-559 12 p. |
artikel |
|
| 1350 | Geography, games and graphs |
de Werra, D. |
1980 |
96-97 | Index 1 |
p. 327-337 11 p. |
artikel |
|
| 1351 | Geometric tree graphs of points in convex position |
Hernando, M.C. |
1999 |
96-97 | Index 1 |
p. 51-66 16 p. |
artikel |
|
| 1352 | Geometry of gross substitutes valuations |
de Vries, Sven |
|
96-97 | Index 1 |
p. 16-23 |
artikel |
|
| 1353 | Girth of { C 3 , … , C s } -free extremal graphs |
Abajo, E. |
2012 |
96-97 | Index 1 |
p. 1311-1318 8 p. |
artikel |
|
| 1354 | Global cycle properties of locally isometric graphs |
Borchert, Adam |
2016 |
96-97 | Index 1 |
p. 16-26 11 p. |
artikel |
|
| 1355 | Global defensive alliances in the lexicographic product of paths and cycles |
Barbosa, Rommel M. |
|
96-97 | Index 1 |
p. 168-188 |
artikel |
|
| 1356 | Global majority consensus by local majority polling on graphs of a given degree sequence |
Abdullah, Mohammed Amin |
2015 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 1357 | Global offensive alliances in graphs and random graphs |
Harutyunyan, Ararat |
2014 |
96-97 | Index 1 |
p. 522-526 5 p. |
artikel |
|
| 1358 | Global Roman domination in graphs |
Roushini Leely Pushpam, P. |
2016 |
96-97 | Index 1 |
p. 176-185 10 p. |
artikel |
|
| 1359 | Global triple Roman dominating function |
Nahani Pour, F. |
|
96-97 | Index 1 |
p. 228-237 |
artikel |
|
| 1360 | Going Wide with the 1-2-3 Conjecture |
Bensmail, Julien |
|
96-97 | Index 1 |
p. 15-32 |
artikel |
|
| 1361 | Good characterizations and linear time recognition for 2-probe block graphs |
Le, Van Bang |
2017 |
96-97 | Index 1 |
p. 181-189 9 p. |
artikel |
|
| 1362 | Gossiping with multiple sends and receives |
Bagchi, A. |
1996 |
96-97 | Index 1 |
p. 105-116 12 p. |
artikel |
|
| 1363 | Graceful colorings of graphs with maximum degree three |
Pantoja, Paola T. |
|
96-97 | Index 1 |
p. 75-96 |
artikel |
|
| 1364 | Grammars with valuations — a discrete model for self-organization of biopolymers |
Dassow, Jürgen |
1982 |
96-97 | Index 1 |
p. 161-174 14 p. |
artikel |
|
| 1365 | Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context |
Cailloux, Jocelin |
|
96-97 | Index 1 |
p. 200-222 |
artikel |
|
| 1366 | Graph coloring on coarse grained multicomputers |
Gebremedhin, Assefaw Hadish |
2003 |
96-97 | Index 1 |
p. 179-198 20 p. |
artikel |
|
| 1367 | Graph connectivity and universal rigidity of bar frameworks |
Alfakih, A.Y. |
2017 |
96-97 | Index 1 |
p. 707-710 4 p. |
artikel |
|
| 1368 | Graph curvature via resistance distance |
Devriendt, Karel |
|
96-97 | Index 1 |
p. 68-78 |
artikel |
|
| 1369 | Graph operations that are good for greedoids |
Levit, Vadim E. |
2010 |
96-97 | Index 1 |
p. 1418-1423 6 p. |
artikel |
|
| 1370 | Graph parameters measuring neighbourhoods in graphs—Bounds and applications |
Gurski, Frank |
2008 |
96-97 | Index 1 |
p. 1865-1874 10 p. |
artikel |
|
| 1371 | Graph partition into small cliques |
Yan, Jin |
2014 |
96-97 | Index 1 |
p. 322-327 6 p. |
artikel |
|
| 1372 | Graphs admitting antimagic labeling for arbitrary sets of positive numbers |
Matamala, Martín |
|
96-97 | Index 1 |
p. 246-251 |
artikel |
|
| 1373 | Graphs G in which G − N [ v ] has a prescribed property for each vertex v |
Zhang, Bo |
|
96-97 | Index 1 |
p. 13-20 |
artikel |
|
| 1374 | Graphs G with nullity 2 c ( G ) + p ( G ) − 1 |
Chang, Sarula |
|
96-97 | Index 1 |
p. 38-58 |
artikel |
|
| 1375 | Graphs of f -class 1 |
Zhang, Xia |
2017 |
96-97 | Index 1 |
p. 197-204 8 p. |
artikel |
|
| 1376 | Graphs of separability at most 2 |
Cicalese, Ferdinando |
2012 |
96-97 | Index 1 |
p. 685-696 12 p. |
artikel |
|
| 1377 | Graphs of small rank-width are pivot-minors of graphs of small tree-width |
Kwon, O-joung |
2014 |
96-97 | Index 1 |
p. 108-118 11 p. |
artikel |
|
| 1378 | Graphs, partitions and Fibonacci numbers |
Knopfmacher, Arnold |
2007 |
96-97 | Index 1 |
p. 1175-1187 13 p. |
artikel |
|
| 1379 | Graphs that admit 3-to-1 or 2-to-1 maps onto the circle |
Hilton, A.J.W. |
1996 |
96-97 | Index 1 |
p. 347-377 31 p. |
artikel |
|
| 1380 | Graphs with degree sequence { ( m − 1 ) m , ( n − 1 ) n } and { m n , n m } |
Brimkov, Boris |
|
96-97 | Index 1 |
p. 477-486 |
artikel |
|
| 1381 | Graphs with integer matching polynomial zeros |
Akbari, S. |
2017 |
96-97 | Index 1 |
p. 1-8 8 p. |
artikel |
|
| 1382 | Graphs with many edge-colorings such that complete graphs are rainbow |
Bastos, Josefran de O. |
|
96-97 | Index 1 |
p. 151-164 |
artikel |
|
| 1383 | Graphs with maximal induced matchings of the same size |
Baptiste, Philippe |
2017 |
96-97 | Index 1 |
p. 15-28 14 p. |
artikel |
|
| 1384 | Graphs with maximum size and given paired-domination number |
Henning, Michael A. |
2014 |
96-97 | Index 1 |
p. 72-82 11 p. |
artikel |
|
| 1385 | Graphs with minimum fractional domatic number |
Gadouleau, Maximilien |
|
96-97 | Index 1 |
p. 140-148 |
artikel |
|
| 1386 | Graphs with most number of three point induced connected subgraphs |
Boesch, F.T. |
1995 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 1387 | Graphs without gap-vertex-labellings: Families and bounds |
Weffort-Santos, Celso A. |
|
96-97 | Index 1 |
p. 317-335 |
artikel |
|
| 1388 | Graphs with small fall-spectrum |
Silva, Ana |
2019 |
96-97 | Index 1 |
p. 183-188 |
artikel |
|
| 1389 | Graphs with small Italian domatic number |
Gallegos, Keith |
|
96-97 | Index 1 |
p. 20-31 |
artikel |
|
| 1390 | Graph theoretical invariants and elementary subgraphs of polyhex and polypent/polyhex systems of chemical relevance |
Dias, Jerry Ray |
1996 |
96-97 | Index 1 |
p. 79-114 36 p. |
artikel |
|
| 1391 | Graph transformations which preserve the multiplicity of an eigenvalue |
Yeong-Nan, Yeh |
1996 |
96-97 | Index 1 |
p. 221-228 8 p. |
artikel |
|
| 1392 | Greedy balanced pairs in N -free ordered sets |
Zaguia, Imed |
|
96-97 | Index 1 |
p. 539-544 |
artikel |
|
| 1393 | Greedy colorings of words |
Rautenbach, Dieter |
2012 |
96-97 | Index 1 |
p. 1872-1874 3 p. |
artikel |
|
| 1394 | Greedy linear extensions to minimize jumps |
El-Zahar, M.H. |
1985 |
96-97 | Index 1 |
p. 143-156 14 p. |
artikel |
|
| 1395 | Green functions on product networks |
Araúz, C. |
2019 |
96-97 | Index 1 |
p. 22-34 |
artikel |
|
| 1396 | Gridline graphs: a review in two dimensions and an extension to higher dimensions |
Peterson, Dale |
2003 |
96-97 | Index 1 |
p. 223-239 17 p. |
artikel |
|
| 1397 | Grid obstacle representation of graphs |
Bishnu, Arijit |
|
96-97 | Index 1 |
p. 39-51 |
artikel |
|
| 1398 | Group connectivity of graphs satisfying the Chvátal-condition |
Yang, Na |
|
96-97 | Index 1 |
p. 212-217 |
artikel |
|
| 1399 | Group parking permit problems |
de Lima, Murilo Santos |
|
96-97 | Index 1 |
p. 172-194 |
artikel |
|
| 1400 | Group testing with two defectives |
Chang, G.J. |
1982 |
96-97 | Index 1 |
p. 97-102 6 p. |
artikel |
|
| 1401 | Group theoretic properties of Rijndael-like ciphers |
Sparr, Rüdiger |
2008 |
96-97 | Index 1 |
p. 3139-3149 11 p. |
artikel |
|
| 1402 | Grundy packing coloring of graphs |
Gözüpek, Didem |
|
96-97 | Index 1 |
p. 17-30 |
artikel |
|
| 1403 | Guessing fractions of online sequences |
Konrad, Christian |
|
96-97 | Index 1 |
p. 147-161 |
artikel |
|
| 1404 | Guide for authors |
2002 |
96-97 | Index 1 |
p. I-IV nvt p. |
artikel |
||
| 1405 | Guide for authors |
2004 |
96-97 | Index 1 |
p. I-IV nvt p. |
artikel |
||
| 1406 | Guide for authors |
2005 |
96-97 | Index 1 |
p. I-IV nvt p. |
artikel |
||
| 1407 | Guide for authors |
2005 |
96-97 | Index 1 |
p. I-IV nvt p. |
artikel |
||
| 1408 | Half-integral five-terminus flows |
Karzanov, A.V. |
1987 |
96-97 | Index 1 |
p. 263-278 16 p. |
artikel |
|
| 1409 | Half-integral flows in a planar graph with four holes |
Karzanov, Alexander V. |
1995 |
96-97 | Index 1 |
p. 267-295 29 p. |
artikel |
|
| 1410 | Hamilton circuits in the directed wrapped Butterfly network |
Bermond, J-C. |
1998 |
96-97 | Index 1 |
p. 21-42 22 p. |
artikel |
|
| 1411 | Hamilton-connected claw-free graphs with Ore-degree conditions |
Liu, Xia |
|
96-97 | Index 1 |
p. 130-139 |
artikel |
|
| 1412 | Hamilton cycles in sparse locally connected graphs |
van Aardt, Susan A. |
2019 |
96-97 | Index 1 |
p. 276-288 |
artikel |
|
| 1413 | Hamiltonian and long cycles in bipartite graphs with connectivity |
Gan, Zhiyong |
|
96-97 | Index 1 |
p. 49-64 |
artikel |
|
| 1414 | Hamiltonian circuits determining the order of chromosomes |
Dorninger, Dietmar |
1994 |
96-97 | Index 1 |
p. 159-168 10 p. |
artikel |
|
| 1415 | Hamiltonian claw-free graphs involving minimum degrees |
Li, MingChu |
2013 |
96-97 | Index 1 |
p. 1530-1537 8 p. |
artikel |
|
| 1416 | Hamiltonian colorings of graphs |
Chartrand, Gary |
2005 |
96-97 | Index 1 |
p. 257-272 16 p. |
artikel |
|
| 1417 | Hamiltonian completions of sparse random graphs |
Gamarnik, David |
2005 |
96-97 | Index 1 |
p. 139-158 20 p. |
artikel |
|
| 1418 | Hamiltonian cycles and paths in faulty twisted hypercubes |
Liu, Huiqing |
2019 |
96-97 | Index 1 |
p. 243-249 |
artikel |
|
| 1419 | Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs |
Li, Ruijuan |
|
96-97 | Index 1 |
p. 451-458 |
artikel |
|
| 1420 | Hamiltonian cycles in spanning subgraphs of line graphs |
Li, Hao |
2016 |
96-97 | Index 1 |
p. 287-295 9 p. |
artikel |
|
| 1421 | Hamiltonian cycles in unitary prefix transposition rearrangement graphs |
Reis, C.S. |
2015 |
96-97 | Index 1 |
p. 82-86 5 p. |
artikel |
|
| 1422 | Hamiltonian cycles passing through linear forests in k -ary n -cubes |
Wang, Shiying |
2011 |
96-97 | Index 1 |
p. 1425-1435 11 p. |
artikel |
|
| 1423 | Hamiltonian laceability in hypercubes with faulty edges |
Wang, Fan |
2018 |
96-97 | Index 1 |
p. 438-445 |
artikel |
|
| 1424 | Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes |
Cheng, Dongqin |
2019 |
96-97 | Index 1 |
p. 56-71 |
artikel |
|
| 1425 | Hamiltonian path saturated graphs with small size |
Dudek, Aneta |
2006 |
96-97 | Index 1 |
p. 1372-1379 8 p. |
artikel |
|
| 1426 | Hamiltonian properties of some compound networks |
Qin, Xiao-Wen |
2018 |
96-97 | Index 1 |
p. 174-182 |
artikel |
|
| 1427 | Hamiltonian threshold graphs |
Harary, Frank |
1987 |
96-97 | Index 1 |
p. 11-15 5 p. |
artikel |
|
| 1428 | Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs |
Fisher, David C. |
1998 |
96-97 | Index 1 |
p. 93-105 13 p. |
artikel |
|
| 1429 | Hamiltonicity in 3-domination-critical graphs with α = δ + 2 |
Tian, Feng |
1999 |
96-97 | Index 1 |
p. 57-70 14 p. |
artikel |
|
| 1430 | Hamiltonicity of a type of interchange graphs |
Li, Xueliang |
1994 |
96-97 | Index 1 |
p. 107-111 5 p. |
artikel |
|
| 1431 | Hamiltonicity of bipartite biclaw-free graphs |
Flandrin, E. |
1994 |
96-97 | Index 1 |
p. 95-102 8 p. |
artikel |
|
| 1432 | Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices |
Wang, Rui |
2007 |
96-97 | Index 1 |
p. 2312-2320 9 p. |
artikel |
|
| 1433 | Hamming weights of symmetric Boolean functions |
Cusick, Thomas W. |
2016 |
96-97 | Index 1 |
p. 14-19 6 p. |
artikel |
|
| 1434 | Hard cases of the multifacility location problem |
Karzanov, Alexander V. |
2004 |
96-97 | Index 1 |
p. 368-373 6 p. |
artikel |
|
| 1435 | Hardness and approximation for L-EPG and B 1 -EPG graphs |
Epstein, Dror |
|
96-97 | Index 1 |
p. 224-228 |
artikel |
|
| 1436 | Hardness and approximation of the asynchronous border minimization problem |
Li, Cindy Y. |
2018 |
96-97 | Index 1 |
p. 101-117 |
artikel |
|
| 1437 | Hardness and efficiency on t -admissibility for graph operations |
Couto, Fernanda |
|
96-97 | Index 1 |
p. 342-348 |
artikel |
|
| 1438 | Hardness of learning loops, monoids, and semirings |
Chang, Ching-Lueh |
2014 |
96-97 | Index 1 |
p. 149-158 10 p. |
artikel |
|
| 1439 | Hardness results of global roman domination in graphs |
Panda, B.S. |
|
96-97 | Index 1 |
p. 337-348 |
artikel |
|
| 1440 | Hardness results of global total k -domination problem in graphs |
Panda, B.S. |
|
96-97 | Index 1 |
p. 223-238 |
artikel |
|
| 1441 | Hardness results on the gapped consecutive-ones property problem |
Maňuch, Ján |
2012 |
96-97 | Index 1 |
p. 2760-2768 9 p. |
artikel |
|
| 1442 | Hardness transitions and uniqueness of acyclic colouring |
M.A., Shalu |
|
96-97 | Index 1 |
p. 77-98 |
artikel |
|
| 1443 | Hard problems in similarity searching |
Moan, Christophe |
2004 |
96-97 | Index 1 |
p. 213-227 15 p. |
artikel |
|
| 1444 | Harmonious colourings of graphs |
Drgas-Burchardt, Ewa |
2017 |
96-97 | Index 1 |
p. 175-184 10 p. |
artikel |
|
| 1445 | Heights of representative systems |
Fishburn, Peter C. |
1979 |
96-97 | Index 1 |
p. 181-199 19 p. |
artikel |
|
| 1446 | Heredity of the index of convergence of the line digraph |
Yan, Weigen |
2003 |
96-97 | Index 1 |
p. 681-688 8 p. |
artikel |
|
| 1447 | Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures |
Zhang, Yi |
2018 |
96-97 | Index 1 |
p. 144-157 |
artikel |
|
| 1448 | Hierarchical approach to the process planning problem |
Kusiak, Andrew |
1987 |
96-97 | Index 1 |
p. 175-184 10 p. |
artikel |
|
| 1449 | Highly connected random geometric graphs |
Balister, Paul |
2009 |
96-97 | Index 1 |
p. 309-320 12 p. |
artikel |
|
| 1450 | Hitting sets online and unique-max coloring |
Even, Guy |
2014 |
96-97 | Index 1 |
p. 71-82 12 p. |
artikel |
|
| 1451 | H -join decomposable graphs and algorithms with runtime single exponential in rankwidth |
Bui-Xuan, Binh-Minh |
2010 |
96-97 | Index 1 |
p. 809-819 11 p. |
artikel |
|
| 1452 | Holes in random graphs |
Łuczak, Tomasz |
1991 |
96-97 | Index 1 |
p. 213-219 7 p. |
artikel |
|
| 1453 | Homogeneous sets, clique-separators, critical graphs, and optimal χ -binding functions |
Brause, Christoph |
|
96-97 | Index 1 |
p. 211-222 |
artikel |
|
| 1454 | Homomorphism bounds of signed bipartite K 4 -minor-free graphs and edge-colorings of 2 k -regular K 4 -minor-free multigraphs |
Beaudou, Laurent |
2019 |
96-97 | Index 1 |
p. 40-51 |
artikel |
|
| 1455 | Homomorphisms and Ramsey properties of antimatroids |
Korte, Bernhard |
1986 |
96-97 | Index 1 |
p. 283-290 8 p. |
artikel |
|
| 1456 | Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials |
Hou, Qing-Hu |
2006 |
96-97 | Index 1 |
p. 1183-1197 15 p. |
artikel |
|
| 1457 | Hosoya index of VDB-weighted graphs |
Cruz, Roberto |
|
96-97 | Index 1 |
p. 18-25 |
artikel |
|
| 1458 | Hosoya polynomials under gated amalgamations |
Xu, Shoujun |
2008 |
96-97 | Index 1 |
p. 2407-2419 13 p. |
artikel |
|
| 1459 | How to cut a cake fairly using a minimal number of cuts |
Webb, William A. |
1997 |
96-97 | Index 1 |
p. 183-190 8 p. |
artikel |
|
| 1460 | How to find overfull subgraphs in graphs with large maximum degree |
Niessen, Thomas |
1994 |
96-97 | Index 1 |
p. 117-125 9 p. |
artikel |
|
| 1461 | How to pack directed acyclic graphs into small blocks |
Asahiro, Yuichi |
|
96-97 | Index 1 |
p. 91-113 |
artikel |
|
| 1462 | h -restricted connectivity of locally twisted cubes |
Wei, Chia-Chen |
2017 |
96-97 | Index 1 |
p. 330-339 10 p. |
artikel |
|
| 1463 | Hyper- and reverse-Wiener indices of F-sums of graphs |
Metsidik, Metrose |
2010 |
96-97 | Index 1 |
p. 1433-1440 8 p. |
artikel |
|
| 1464 | Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width |
Gutin, Gregory |
2012 |
96-97 | Index 1 |
p. 2323-2328 6 p. |
artikel |
|
| 1465 | Hypercube embedding of generalized bipartite metrics |
Deza, Michel |
1995 |
96-97 | Index 1 |
p. 215-230 16 p. |
artikel |
|
| 1466 | Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2 |
Füredi, Zoltán |
|
96-97 | Index 1 |
p. 50-59 |
artikel |
|
| 1467 | Hyper K 1 , r and sub- K 1 , r fault tolerance of star graphs |
Yang, Yuxing |
|
96-97 | Index 1 |
p. 172-177 |
artikel |
|
| 1468 | Hyperspherical embedding of graphs and networks in communicability spaces |
Estrada, Ernesto |
|
96-97 | Index 1 |
p. 53-77 |
artikel |
|
| 1469 | Identifying codes and locating–dominating sets on paths and cycles |
Chen, Chunxia |
2011 |
96-97 | Index 1 |
p. 1540-1547 8 p. |
artikel |
|
| 1470 | Identifying codes on directed de Bruijn graphs |
Boutin, Debra |
2019 |
96-97 | Index 1 |
p. 29-41 |
artikel |
|
| 1471 | Implicit degree condition for hamiltonicity of 2-heavy graphs |
Huang, Xing |
2017 |
96-97 | Index 1 |
p. 126-131 6 p. |
artikel |
|
| 1472 | Implicit representation conjecture for semi-algebraic graphs |
Fitch, Matthew |
2019 |
96-97 | Index 1 |
p. 53-62 |
artikel |
|
| 1473 | Improper C-colorings of graphs |
Bujtás, Csilla |
2011 |
96-97 | Index 1 |
p. 174-186 13 p. |
artikel |
|
| 1474 | Improper sum-list colouring of 2-trees |
Drgas-Burchardt, Ewa |
2019 |
96-97 | Index 1 |
p. 73-84 |
artikel |
|
| 1475 | Improved algorithms for several network location problems with equality measures |
Mesa, Juan A. |
2003 |
96-97 | Index 1 |
p. 437-448 12 p. |
artikel |
|
| 1476 | Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches |
Lin, Jyh-Jye |
2010 |
96-97 | Index 1 |
p. 932-942 11 p. |
artikel |
|
| 1477 | Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 |
Crawford, Nicholas |
|
96-97 | Index 1 |
p. 80-83 |
artikel |
|
| 1478 | Improved approximation algorithms for cumulative VRP with stochastic demands |
Gaur, Daya Ram |
|
96-97 | Index 1 |
p. 133-143 |
artikel |
|
| 1479 | Improved approximation algorithms for weighted 2-path partitions |
Bar-Noy, Amotz |
2018 |
96-97 | Index 1 |
p. 15-37 |
artikel |
|
| 1480 | Improved approximation for maximum edge colouring problem |
Chandran, L. Sunil |
|
96-97 | Index 1 |
p. 42-52 |
artikel |
|
| 1481 | Improved book-embeddings of incomplete hypercubes |
Hasunuma, Toru |
2009 |
96-97 | Index 1 |
p. 1423-1431 9 p. |
artikel |
|
| 1482 | Improved bounds on the domination number of a tree |
Desormeaux, Wyatt J. |
2014 |
96-97 | Index 1 |
p. 88-94 7 p. |
artikel |
|
| 1483 | Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem |
Hansen, Pierre |
2009 |
96-97 | Index 1 |
p. 1267-1290 24 p. |
artikel |
|
| 1484 | Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem |
Punnen, Abraham P. |
1994 |
96-97 | Index 1 |
p. 91-93 3 p. |
artikel |
|
| 1485 | Improved descriptional complexity results on generalized forbidding grammars |
Fernau, Henning |
|
96-97 | Index 1 |
p. 2-18 |
artikel |
|
| 1486 | Improved induced matchings in sparse graphs |
Erman, Rok |
2010 |
96-97 | Index 1 |
p. 1994-2003 10 p. |
artikel |
|
| 1487 | Improved sufficient conditions for k -leaf-connected graphs |
Ao, Guoyan |
|
96-97 | Index 1 |
p. 17-30 |
artikel |
|
| 1488 | Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles |
Erveš, Rija |
2015 |
96-97 | Index 1 |
p. 90-97 8 p. |
artikel |
|
| 1489 | Improvements on the Johnson bound for Reed–Solomon codes |
Muralidhara, V.N. |
2009 |
96-97 | Index 1 |
p. 812-818 7 p. |
artikel |
|
| 1490 | Improving a Nordhaus–Gaddum type bound for total domination using an algorithm involving vertex disjoint stars |
Joubert, Ernst J. |
2017 |
96-97 | Index 1 |
p. 95-102 |
artikel |
|
| 1491 | Improving local search heuristics for some scheduling problems—I |
Brucker, Peter |
1996 |
96-97 | Index 1 |
p. 97-122 26 p. |
artikel |
|
| 1492 | Improving local search heuristics for some scheduling problems. Part II |
Brucker, Peter |
1997 |
96-97 | Index 1 |
p. 47-69 23 p. |
artikel |
|
| 1493 | Improving the Caro–Wei bound and applications to Turán stability |
Kelly, Tom |
|
96-97 | Index 1 |
p. 33-43 |
artikel |
|
| 1494 | Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity |
Rizomiliotis, Panagiotis |
2010 |
96-97 | Index 1 |
p. 2049-2055 7 p. |
artikel |
|
| 1495 | Improving the lower bound on opaque sets for equilateral triangle |
Izumi, Taisuke |
2016 |
96-97 | Index 1 |
p. 130-138 9 p. |
artikel |
|
| 1496 | Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method |
Billionnet, Alain |
2009 |
96-97 | Index 1 |
p. 1185-1197 13 p. |
artikel |
|
| 1497 | Inapproximability results and bounds for the Helly and Radon numbers of a graph |
Dourado, Mitre C. |
2017 |
96-97 | Index 1 |
p. 134-141 |
artikel |
|
| 1498 | Inapproximability results related to monophonic convexity |
Costa, Eurinardo R. |
2015 |
96-97 | Index 1 |
p. 70-74 5 p. |
artikel |
|
| 1499 | Incidence choosability of graphs |
Benmedjdoub, Brahim |
2019 |
96-97 | Index 1 |
p. 40-55 |
artikel |
|
| 1500 | Incidence coloring of graphs with high maximum average degree |
Bonamy, Marthe |
2017 |
96-97 | Index 1 |
p. 29-43 |
artikel |
|
| 1501 | Incremental delay enumeration: Space and time |
Capelli, Florent |
2019 |
96-97 | Index 1 |
p. 179-190 |
artikel |
|
| 1502 | Independence and average distance in graphs |
Firby, Peter |
1997 |
96-97 | Index 1 |
p. 27-37 11 p. |
artikel |
|
| 1503 | Independence in connected graphs |
Harant, Jochen |
2011 |
96-97 | Index 1 |
p. 79-86 8 p. |
artikel |
|
| 1504 | Independence, matching and packing coloring of the iterated Mycielskian of graphs |
Dliou, Kamal |
|
96-97 | Index 1 |
p. 22-33 |
artikel |
|
| 1505 | Independence number and minimum degree for path-factor critical uniform graphs |
Liu, Hongxia |
|
96-97 | Index 1 |
p. 153-158 |
artikel |
|
| 1506 | Independence polynomials of k-tree related graphs |
Song, Lanzhen |
2010 |
96-97 | Index 1 |
p. 943-950 8 p. |
artikel |
|
| 1507 | Independent distributions on a multi-branching AND–OR tree of height 2 |
Shigemizu, Mika |
|
96-97 | Index 1 |
p. 274-282 |
artikel |
|
| 1508 | Independent domination in outerplanar graphs |
Goddard, Wayne |
|
96-97 | Index 1 |
p. 52-57 |
artikel |
|
| 1509 | Independent domination in the graph defined by two consecutive levels of the n -cube |
Kalinowski, Thomas |
|
96-97 | Index 1 |
p. 161-172 |
artikel |
|
| 1510 | Independent ( k + 1 ) -domination in k -trees |
Borowiecki, Mieczysław |
|
96-97 | Index 1 |
p. 99-110 |
artikel |
|
| 1511 | Independent Roman { 2 } -domination in graphs |
Rahmouni, Abdelkader |
2018 |
96-97 | Index 1 |
p. 408-414 |
artikel |
|
| 1512 | Independent sets in bounded-degree hypergraphs |
Halldórsson, Magnús M. |
2009 |
96-97 | Index 1 |
p. 1773-1786 14 p. |
artikel |
|
| 1513 | Independent sets in extensions of 2 K 2 -free graphs |
Lozin, Vadim V. |
2005 |
96-97 | Index 1 |
p. 74-80 7 p. |
artikel |
|
| 1514 | Independent sets in Line of Sight networks |
Sangha, Pavan |
|
96-97 | Index 1 |
p. 100-115 |
artikel |
|
| 1515 | Index |
2000 |
96-97 | Index 1 |
p. 313-314 2 p. |
artikel |
||
| 1516 | Index |
2000 |
96-97 | Index 1 |
p. 455-456 2 p. |
artikel |
||
| 1517 | Indexing functions and time lower bounds for sorting on a mesh-connected computer |
Han, Yijie |
1992 |
96-97 | Index 1 |
p. 141-152 12 p. |
artikel |
|
| 1518 | Induced disjoint paths problem in a planar digraph |
Kobayashi, Yusuke |
2009 |
96-97 | Index 1 |
p. 3231-3238 8 p. |
artikel |
|
| 1519 | Induced forests in some distance-regular graphs |
Gunderson, Karen |
|
96-97 | Index 1 |
p. 290-300 |
artikel |
|
| 1520 | Induced matchings in asteroidal triple-free graphs |
Chang, Jou-Ming |
2003 |
96-97 | Index 1 |
p. 67-78 12 p. |
artikel |
|
| 1521 | Induced 2-regular subgraphs in k -chordal cubic graphs |
Henning, Michael A. |
2016 |
96-97 | Index 1 |
p. 73-79 7 p. |
artikel |
|
| 1522 | Induced star partition of graphs |
Shalu, M.A. |
|
96-97 | Index 1 |
p. 81-91 |
artikel |
|
| 1523 | Induced Turán problem in bipartite graphs |
Axenovich, Maria |
|
96-97 | Index 1 |
p. 497-505 |
artikel |
|
| 1524 | Inequalities between the K k -isolation number and the independent K k -isolation number of a graph |
Favaron, Odile |
|
96-97 | Index 1 |
p. 93-97 |
artikel |
|
| 1525 | Inexact tree pattern matching with 1-degree edit distance using finite automata |
Šestáková, Eliška |
|
96-97 | Index 1 |
p. 78-97 |
artikel |
|
| 1526 | Infinite quasi-transitive digraphs with domination number 2 |
Galeana-Sánchez, Hortensia |
2017 |
96-97 | Index 1 |
p. 44-50 7 p. |
artikel |
|
| 1527 | Influence of the normalization constraint on the integral simplex using decomposition |
Rosat, Samuel |
2017 |
96-97 | Index 1 |
p. 53-70 18 p. |
artikel |
|
| 1528 | Informative path planning as a maximum traveling salesman problem with submodular rewards |
Jawaid, Syed Talha |
2015 |
96-97 | Index 1 |
p. 112-127 16 p. |
artikel |
|
| 1529 | Injective chromatic index of sparse graphs |
Bu, Yuehua |
|
96-97 | Index 1 |
p. 9-16 |
artikel |
|
| 1530 | Injective coloring of planar graphs |
Bu, Yuehua |
2009 |
96-97 | Index 1 |
p. 663-672 10 p. |
artikel |
|
| 1531 | Injective coloring of some subclasses of bipartite graphs and chordal graphs |
Panda, B.S. |
|
96-97 | Index 1 |
p. 68-87 |
artikel |
|
| 1532 | Injective edge chromatic index of sparse graphs |
Hu, Xiaolan |
|
96-97 | Index 1 |
p. 50-56 |
artikel |
|
| 1533 | Injective edge coloring of graphs with maximum degree 5 |
Zhu, Junlei |
|
96-97 | Index 1 |
p. 119-126 |
artikel |
|
| 1534 | In-place algorithms for computing a largest clique in geometric intersection graphs |
De, Minati |
2014 |
96-97 | Index 1 |
p. 58-70 13 p. |
artikel |
|
| 1535 | Integer k -matchings of graphs |
Liu, Yan |
2018 |
96-97 | Index 1 |
p. 118-128 |
artikel |
|
| 1536 | Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation |
Pochet, Yves |
1995 |
96-97 | Index 1 |
p. 57-74 18 p. |
artikel |
|
| 1537 | “Integer-making” theorems |
Beck, József |
1981 |
96-97 | Index 1 |
p. 1-8 8 p. |
artikel |
|
| 1538 | Integer version of the multipath flow network synthesis problem |
Kabadi, S.N. |
2008 |
96-97 | Index 1 |
p. 3376-3399 24 p. |
artikel |
|
| 1539 | Integral cographs |
Allem, Luiz Emilio |
|
96-97 | Index 1 |
p. 153-167 |
artikel |
|
| 1540 | Integral trees of diameter 6 |
Wang, Ligong |
2007 |
96-97 | Index 1 |
p. 1254-1266 13 p. |
artikel |
|
| 1541 | Integral trees with diameter 6 |
Xi, Fangxu |
|
96-97 | Index 1 |
p. 76-90 |
artikel |
|
| 1542 | Integral values of generating functions of recursive sequences |
Knapp, M. |
|
96-97 | Index 1 |
p. 31-43 |
artikel |
|
| 1543 | Integrated production and delivery scheduling with disjoint windows |
Huo, Yumei |
2010 |
96-97 | Index 1 |
p. 921-931 11 p. |
artikel |
|
| 1544 | Interactive L systems with a fast local growth |
Raz, Yoav |
1988 |
96-97 | Index 1 |
p. 163-179 17 p. |
artikel |
|
| 1545 | Interchange graphs and the Hamiltonian cycle polytope |
Sierksma, Gerard |
1998 |
96-97 | Index 1 |
p. 217-224 8 p. |
artikel |
|
| 1546 | Interdiction problems on planar graphs |
Pan, Feng |
2016 |
96-97 | Index 1 |
p. 215-231 17 p. |
artikel |
|
| 1547 | Intersection models of weakly chordal graphs |
Golumbic, Martin Charles |
2009 |
96-97 | Index 1 |
p. 2031-2047 17 p. |
artikel |
|
| 1548 | Intersection of longest paths in graph classes |
Cerioli, Márcia R. |
|
96-97 | Index 1 |
p. 96-105 |
artikel |
|
| 1549 | Intersection-union systems |
Markowsky, George |
1983 |
96-97 | Index 1 |
p. 255-262 8 p. |
artikel |
|
| 1550 | Interval data minmax regret network optimization problems |
Averbakh, Igor |
2004 |
96-97 | Index 1 |
p. 289-301 13 p. |
artikel |
|
| 1551 | Interval edge-colorings of composition of graphs |
Tepanyan, H.H. |
2017 |
96-97 | Index 1 |
p. 368-374 7 p. |
artikel |
|
| 1552 | Interval edge-colorings of K 1 , m , n |
Grzesik, A. |
2014 |
96-97 | Index 1 |
p. 140-145 6 p. |
artikel |
|
| 1553 | Interval incidence coloring of bipartite graphs |
Janczewski, Robert |
2014 |
96-97 | Index 1 |
p. 131-140 10 p. |
artikel |
|
| 1554 | Interval orders based on weak orders |
Bogart, Kenneth P. |
1995 |
96-97 | Index 1 |
p. 93-98 6 p. |
artikel |
|
| 1555 | Interval orders with two interval lengths |
Boyadzhiyska, Simona |
2019 |
96-97 | Index 1 |
p. 52-63 |
artikel |
|
| 1556 | Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations |
Agarwala, Richa |
2000 |
96-97 | Index 1 |
p. 3-44 42 p. |
artikel |
|
| 1557 | Inverse minimum flow problem under the weighted sum-type Hamming distance |
Liu, Longcheng |
2017 |
96-97 | Index 1 |
p. 101-112 12 p. |
artikel |
|
| 1558 | Inverse optimization problems with multiple weight functions |
Bérczi, Kristóf |
|
96-97 | Index 1 |
p. 134-147 |
artikel |
|
| 1559 | Inverse quickest center location problem on a tree |
Keshtkar, Iman |
2019 |
96-97 | Index 1 |
p. 188-202 |
artikel |
|
| 1560 | Inversions in k-sorted permutations |
Dutton, Ronald D. |
1998 |
96-97 | Index 1 |
p. 49-56 8 p. |
artikel |
|
| 1561 | Inverted orders for monotone scoring rules |
Fishburn, Peter C. |
1981 |
96-97 | Index 1 |
p. 27-36 10 p. |
artikel |
|
| 1562 | Investigating the b -chromatic number of bipartite graphs by using the bicomplement |
Alkhateeb, Mais |
2014 |
96-97 | Index 1 |
p. 113-126 14 p. |
artikel |
|
| 1563 | Investigations on autark assignments |
Kullmann, Oliver |
2000 |
96-97 | Index 1 |
p. 99-137 39 p. |
artikel |
|
| 1564 | Irreducibility of recombination Markov chains in the triangular lattice |
Cannon, Sarah |
|
96-97 | Index 1 |
p. 75-130 |
artikel |
|
| 1565 | Irredundance graphs |
Mynhardt, C.M. |
|
96-97 | Index 1 |
p. 36-48 |
artikel |
|
| 1566 | Irredundancy in circular arc graphs |
Golumbic, Martin Charles |
1993 |
96-97 | Index 1 |
p. 79-89 11 p. |
artikel |
|
| 1567 | Irregular independence and irregular domination |
Borg, Peter |
2019 |
96-97 | Index 1 |
p. 76-84 |
artikel |
|
| 1568 | Irreversible k -threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion |
Dreyer Jr., Paul A. |
2009 |
96-97 | Index 1 |
p. 1615-1627 13 p. |
artikel |
|
| 1569 | Isolation of connected graphs |
Borg, Peter |
|
96-97 | Index 1 |
p. 154-165 |
artikel |
|
| 1570 | Italian domination in trees |
Henning, Michael A. |
2017 |
96-97 | Index 1 |
p. 557-564 8 p. |
artikel |
|
| 1571 | Italian domination of Cartesian products of directed cycles |
van Bommel, Christopher M. |
|
96-97 | Index 1 |
p. 82-86 |
artikel |
|
| 1572 | Job shop scheduling with unit time operations under resource constraints and release dates |
Szwarcfiter, Jayme Luiz |
1987 |
96-97 | Index 1 |
p. 227-233 7 p. |
artikel |
|
| 1573 | Joint performance of greedy heuristics for the integer knapsack problem |
Kohli, Rajeev |
1995 |
96-97 | Index 1 |
p. 37-48 12 p. |
artikel |
|
| 1574 | k -Ary spanning trees contained in tournaments |
Ai, Jiangdong |
|
96-97 | Index 1 |
p. 141-146 |
artikel |
|
| 1575 | k -circular matroids of graphs |
De Jesús, José F. |
2017 |
96-97 | Index 1 |
p. 33-50 18 p. |
artikel |
|
| 1576 | k -colored kernels |
Galena-Sánchez, Hortensia |
2012 |
96-97 | Index 1 |
p. 1971-1978 8 p. |
artikel |
|
| 1577 | k-connectivity and decomposition of graphs into forests |
Nishizeki, Takao |
1994 |
96-97 | Index 1 |
p. 295-301 7 p. |
artikel |
|
| 1578 | Kempe classes and almost bipartite graphs |
Cranston, Daniel W. |
|
96-97 | Index 1 |
p. 94-98 |
artikel |
|
| 1579 | Kernelization hardness of connectivity problems in d -degenerate graphs |
Cygan, Marek |
2012 |
96-97 | Index 1 |
p. 2131-2141 11 p. |
artikel |
|
| 1580 | Kernels by monochromatic paths in m -colored unions of quasi-transitive digraphs |
Galeana-Sánchez, Hortensia |
2010 |
96-97 | Index 1 |
p. 461-466 6 p. |
artikel |
|
| 1581 | Kernels by rainbow paths in arc-colored tournaments |
Bai, Yandong |
|
96-97 | Index 1 |
p. 14-21 |
artikel |
|
| 1582 | k -foldability of words |
Bjorkman, Beth |
2019 |
96-97 | Index 1 |
p. 19-30 |
artikel |
|
| 1583 | Kinetic maintenance of mobile k -centres on trees |
Durocher, Stephane |
2009 |
96-97 | Index 1 |
p. 1432-1446 15 p. |
artikel |
|
| 1584 | Kirchhoff index of composite graphs |
Zhang, Heping |
2009 |
96-97 | Index 1 |
p. 2918-2927 10 p. |
artikel |
|
| 1585 | K 5 , 5 is fully reconstructible in ℂ 3 |
Bernstein, Daniel Irving |
|
96-97 | Index 1 |
p. 442-447 |
artikel |
|
| 1586 | K 1 , 2 -isolation in graphs |
Zhang, Gang |
|
96-97 | Index 1 |
p. 365-374 |
artikel |
|
| 1587 | k -isolation in graphs |
Zhang, Gang |
|
96-97 | Index 1 |
p. 99-111 |
artikel |
|
| 1588 | ( k , j ) -coloring of sparse graphs |
Borodin, O.V. |
2011 |
96-97 | Index 1 |
p. 1947-1953 7 p. |
artikel |
|
| 1589 | k - L ( 2 , 1 ) -labelling for planar graphs is NP-complete for k ≥ 4 |
Eggemann, Nicole |
2010 |
96-97 | Index 1 |
p. 1777-1788 12 p. |
artikel |
|
| 1590 | König-Egerváry graphs, 2-bicritical graphs and fractional matchings |
Bourjolly, Jean-Marie |
1989 |
96-97 | Index 1 |
p. 63-82 20 p. |
artikel |
|
| 1591 | k-NLC graphs and polynomial algorithms |
Wanke, Egon |
1994 |
96-97 | Index 1 |
p. 251-266 16 p. |
artikel |
|
| 1592 | Knots in random walks |
Pippenger, Nicholas |
1989 |
96-97 | Index 1 |
p. 273-278 6 p. |
artikel |
|
| 1593 | k -path-connectivity of the complete balanced tripartite graph K n , n , n for n + 1 ≤ k ≤ 2 n − 4 |
Li, Shasha |
|
96-97 | Index 1 |
p. 279-294 |
artikel |
|
| 1594 | k -Rainbow domatic numbers |
Fujita, Shinya |
2012 |
96-97 | Index 1 |
p. 1104-1113 10 p. |
artikel |
|
| 1595 | k -restricted edge connectivity in ( p + 1 ) -clique-free graphs |
Wang, Shiying |
2015 |
96-97 | Index 1 |
p. 255-259 5 p. |
artikel |
|
| 1596 | k -strong spanning local tournaments in locally semicomplete digraphs |
Bang-Jensen, Jørgen |
2009 |
96-97 | Index 1 |
p. 2536-2540 5 p. |
artikel |
|
| 1597 | k-th order symmetric SAC boolean functions and bisecting binomial coefficients |
Cusick, T.W. |
2005 |
96-97 | Index 1 |
p. 73-86 14 p. |
artikel |
|
| 1598 | k -tuple colorings of the Cartesian product of graphs |
Bonomo, Flavia |
2018 |
96-97 | Index 1 |
p. 177-182 |
artikel |
|
| 1599 | k -tuple total domination in graphs |
Henning, Michael A. |
2010 |
96-97 | Index 1 |
p. 1006-1011 6 p. |
artikel |
|
| 1600 | Labeling algorithms for domination problems in sun-free chordal graphs |
Chang, Gerard J. |
1988 |
96-97 | Index 1 |
p. 21-34 14 p. |
artikel |
|
| 1601 | Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two |
Karst, Nathaniel |
2014 |
96-97 | Index 1 |
p. 101-108 8 p. |
artikel |
|
| 1602 | Labeling bipartite permutation graphs with a condition at distance two |
Araki, Toru |
2009 |
96-97 | Index 1 |
p. 1677-1686 10 p. |
artikel |
|
| 1603 | Labeling the r -path with a condition at distance two |
Georges, John P. |
2009 |
96-97 | Index 1 |
p. 3203-3215 13 p. |
artikel |
|
| 1604 | Labelling planar graphs without 4-cycles with a condition on distance two |
Wang, Weifan |
2008 |
96-97 | Index 1 |
p. 2241-2249 9 p. |
artikel |
|
| 1605 | Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem |
Thiongane, Babacar |
2006 |
96-97 | Index 1 |
p. 2200-2211 12 p. |
artikel |
|
| 1606 | Lagrangean methods for 0–1 quadratic problems |
Michelon, Philippe |
1993 |
96-97 | Index 1 |
p. 257-269 13 p. |
artikel |
|
| 1607 | Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms |
Campello, Ruy Eduardo |
1987 |
96-97 | Index 1 |
p. 119-136 18 p. |
artikel |
|
| 1608 | Laplacian pair state transfer in Q-graph |
Jiang, Ming |
|
96-97 | Index 1 |
p. 239-258 |
artikel |
|
| 1609 | La queste del saint Gra(AL): A computational approach to local algebra |
Mora, Teo |
1991 |
96-97 | Index 1 |
p. 161-190 30 p. |
artikel |
|
| 1610 | Large convex cones in hypercubes |
Füredi, Zoltán |
2008 |
96-97 | Index 1 |
p. 1536-1541 6 p. |
artikel |
|
| 1611 | Large (d, D, D′, s)-bipartite digraphs |
Gómez, J. |
1995 |
96-97 | Index 1 |
p. 103-114 12 p. |
artikel |
|
| 1612 | Large generalized cycles |
Gómez, J. |
1998 |
96-97 | Index 1 |
p. 107-123 17 p. |
artikel |
|
| 1613 | Large survivable nets and the generalized prisms |
Lai, Hong-Jian |
1995 |
96-97 | Index 1 |
p. 181-185 5 p. |
artikel |
|
| 1614 | Latin squares with bounded size of row prefix intersections |
Malewicz, Grzegorz |
2006 |
96-97 | Index 1 |
p. 1028-1031 4 p. |
artikel |
|
| 1615 | Lattice-theoretic properties of MPR-posets in phylogeny |
Miyakawa, Kampei |
2004 |
96-97 | Index 1 |
p. 169-192 24 p. |
artikel |
|
| 1616 | Layouts for mobility management in wireless ATM networks |
Flammini, Michele |
2009 |
96-97 | Index 1 |
p. 98-111 14 p. |
artikel |
|
| 1617 | L ( 2 , 1 ) -colorings and irreducible no-hole colorings of the direct product of graphs |
Mandal, Nibedita |
|
96-97 | Index 1 |
p. 186-200 |
artikel |
|
| 1618 | Learning faster than promised by the Vapnik-Chervonenkis dimension |
Blumer, Anselm |
1989 |
96-97 | Index 1 |
p. 47-53 7 p. |
artikel |
|
| 1619 | Learning random monotone DNF |
Jackson, Jeffrey C. |
2011 |
96-97 | Index 1 |
p. 259-271 13 p. |
artikel |
|
| 1620 | Learning with queries corrupted by classification noise |
Jackson, Jeffrey |
1999 |
96-97 | Index 1 |
p. 157-175 19 p. |
artikel |
|
| 1621 | Least and most colored bases |
Maffioli, Francesco |
2007 |
96-97 | Index 1 |
p. 1958-1970 13 p. |
artikel |
|
| 1622 | l 1 -embeddability under the edge-gluing operation on some nonbipartite graphs |
Wang, Guangfu |
|
96-97 | Index 1 |
p. 79-84 |
artikel |
|
| 1623 | Lengths of tours and permutations on a vertex set of a convex polygon |
Hiro, Ito |
2001 |
96-97 | Index 1 |
p. 63-71 9 p. |
artikel |
|
| 1624 | Liar’s dominating set problem on unit disk graphs |
Jallu, Ramesh K. |
|
96-97 | Index 1 |
p. 91-99 |
artikel |
|
| 1625 | Liar’s dominating sets in graphs |
Alimadadi, Abdollah |
2016 |
96-97 | Index 1 |
p. 204-210 7 p. |
artikel |
|
| 1626 | Liar’s domination in graphs: Complexity and algorithm |
Panda, B.S. |
2013 |
96-97 | Index 1 |
p. 1085-1092 8 p. |
artikel |
|
| 1627 | Lift-and-project for Mixed 0–1 programming: recent progress |
Balas, Egon |
2002 |
96-97 | Index 1 |
p. 129-154 26 p. |
artikel |
|
| 1628 | Lift-and-project ranks of the set covering polytope of circulant matrices |
Bianchi, Silvia M. |
2012 |
96-97 | Index 1 |
p. 2555-2562 8 p. |
artikel |
|
| 1629 | Light structures in 1-planar graphs with an application to linear 2-arboricity |
Liu, Juan |
2019 |
96-97 | Index 1 |
p. 120-130 |
artikel |
|
| 1630 | 2-limited broadcast domination in subcubic graphs |
Henning, Michael A. |
|
96-97 | Index 1 |
p. 691-706 |
artikel |
|
| 1631 | 2-limited dominating broadcasts on cubic graphs without induced 4-cycles |
Park, Boram |
|
96-97 | Index 1 |
p. 178-184 |
artikel |
|
| 1632 | Limited visibility Cops and Robber |
Clarke, N.E. |
|
96-97 | Index 1 |
p. 53-64 |
artikel |
|
| 1633 | Linear and cyclic distance-three labellings of trees |
King, Deborah |
2014 |
96-97 | Index 1 |
p. 109-120 12 p. |
artikel |
|
| 1634 | Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice |
Hibi, Takayuki |
1991 |
96-97 | Index 1 |
p. 145-150 6 p. |
artikel |
|
| 1635 | Linear binary codes with intersection properties |
Miklós, D. |
1984 |
96-97 | Index 1 |
p. 187-196 10 p. |
artikel |
|
| 1636 | Linear read-once and related Boolean functions |
Lozin, Vadim |
2018 |
96-97 | Index 1 |
p. 16-27 |
artikel |
|
| 1637 | Linear splicing and syntactic monoid |
Bonizzoni, P. |
2006 |
96-97 | Index 1 |
p. 452-470 19 p. |
artikel |
|
| 1638 | Linear time algorithms for Euclidean 1-center in ℜ d with non-linear convex constraints |
Das, Sandip |
|
96-97 | Index 1 |
p. 71-85 |
artikel |
|
| 1639 | Line segment disk cover |
Basappa, Manjanna |
|
96-97 | Index 1 |
p. 261-271 |
artikel |
|
| 1640 | List backbone colouring of graphs |
Bu, Yuehua |
2014 |
96-97 | Index 1 |
p. 45-51 7 p. |
artikel |
|
| 1641 | List coloring in the absence of two subgraphs |
Golovach, Petr A. |
2014 |
96-97 | Index 1 |
p. 123-130 8 p. |
artikel |
|
| 1642 | List distinguishing parameters of trees |
Ferrara, Michael |
2013 |
96-97 | Index 1 |
p. 864-869 6 p. |
artikel |
|
| 1643 | List injective coloring of planar graphs with girth 5, 6, 8 |
Bu, Yuehua |
2013 |
96-97 | Index 1 |
p. 1367-1377 11 p. |
artikel |
|
| 1644 | List injective edge-coloring of subcubic graphs |
Lv, Jian-Bo |
|
96-97 | Index 1 |
p. 163-170 |
artikel |
|
| 1645 | List of referees: volumes 1–10 |
1985 |
96-97 | Index 1 |
p. 1-4 4 p. |
artikel |
||
| 1646 | List rankings and on-line list rankings of graphs |
McDonald, Daniel C. |
2016 |
96-97 | Index 1 |
p. 109-125 17 p. |
artikel |
|
| 1647 | List r -dynamic coloring of graphs with small maximum average degree |
Zhu, Junlei |
2019 |
96-97 | Index 1 |
p. 254-263 |
artikel |
|
| 1648 | List recoloring of planar graphs |
Chandran, L. Sunil |
|
96-97 | Index 1 |
p. 71-87 |
artikel |
|
| 1649 | List schedules for cyclic scheduling |
Chrétienne, Philippe |
1999 |
96-97 | Index 1 |
p. 141-159 19 p. |
artikel |
|
| 1650 | List star edge coloring of sparse graphs |
Kerdjoudj, Samia |
2018 |
96-97 | Index 1 |
p. 115-125 |
artikel |
|
| 1651 | L ( j , k ) -labelling and maximum ordering-degrees for trees |
Juan, Justie Su-Tzu |
2010 |
96-97 | Index 1 |
p. 692-698 7 p. |
artikel |
|
| 1652 | L ( 2 , 1 ) -labeling of direct product of paths and cycles |
Jha, Pranava K. |
2005 |
96-97 | Index 1 |
p. 317-325 9 p. |
artikel |
|
| 1653 | L ( 2 , 1 ) -labeling of disk intersection graphs |
Chybowska-Sokół, Joanna |
|
96-97 | Index 1 |
p. 71-81 |
artikel |
|
| 1654 | L ( 2 , 1 ) -Labeling of Kneser graphs and coloring squares of Kneser graphs |
Shao, Zhendong |
2017 |
96-97 | Index 1 |
p. 106-114 9 p. |
artikel |
|
| 1655 | L ( 2 , 1 ) -labeling of oriented planar graphs |
Calamoneri, T. |
2013 |
96-97 | Index 1 |
p. 1719-1725 7 p. |
artikel |
|
| 1656 | L ( 2 , 1 ) -labeling of perfect elimination bipartite graphs |
Panda, B.S. |
2011 |
96-97 | Index 1 |
p. 1878-1888 11 p. |
artikel |
|
| 1657 | L ( 2 , 1 ) -labelings of Cartesian products of two cycles |
Schwarz, Christopher |
2006 |
96-97 | Index 1 |
p. 1522-1540 19 p. |
artikel |
|
| 1658 | L ( 2 , 1 ) -labelling of generalized prisms |
Chudá, Karina |
2012 |
96-97 | Index 1 |
p. 755-763 9 p. |
artikel |
|
| 1659 | L 1 -norm ball for CSIDH: Optimal strategy for choosing the secret key space |
Nakagawa, Kohei |
|
96-97 | Index 1 |
p. 70-88 |
artikel |
|
| 1660 | Local antimagic orientations of d -degenerate graphs |
Hu, Jie |
2019 |
96-97 | Index 1 |
p. 206-215 |
artikel |
|
| 1661 | Local condition for planar graphs of maximum degree 7 to be 8-totally colorable |
Chang, Gerard Jennhwa |
2011 |
96-97 | Index 1 |
p. 760-768 9 p. |
artikel |
|
| 1662 | Locally restricted colorings |
Blöchliger, Ivo |
2006 |
96-97 | Index 1 |
p. 158-165 8 p. |
artikel |
|
| 1663 | Local negative circuits and fixed points in non-expansive Boolean networks |
Richard, Adrien |
2011 |
96-97 | Index 1 |
p. 1085-1093 9 p. |
artikel |
|
| 1664 | Local WL invariance and hidden shades of regularity |
Fuhlbrück, Frank |
|
96-97 | Index 1 |
p. 191-198 |
artikel |
|
| 1665 | Locating and identifying codes in circulant networks |
Ghebleh, M. |
2013 |
96-97 | Index 1 |
p. 2001-2007 7 p. |
artikel |
|
| 1666 | Locating battery charging stations to facilitate almost shortest paths |
Arkin, Esther M. |
2019 |
96-97 | Index 1 |
p. 10-16 |
artikel |
|
| 1667 | Locating-dominating sets in local tournaments |
Bellitto, Thomas |
|
96-97 | Index 1 |
p. 14-24 |
artikel |
|
| 1668 | Locating–dominating sets in twin-free graphs |
Foucaud, Florent |
2016 |
96-97 | Index 1 |
p. 52-58 7 p. |
artikel |
|
| 1669 | Locating domination in bipartite graphs and their complements |
Hernando, C. |
2019 |
96-97 | Index 1 |
p. 195-203 |
artikel |
|
| 1670 | Locating service centers with precedence constraints |
Kaufman, Y. |
1993 |
96-97 | Index 1 |
p. 251-261 11 p. |
artikel |
|
| 1671 | Locating sets of vertices on Hamiltonian cycles |
Faudree, Ralph J. |
2016 |
96-97 | Index 1 |
p. 107-114 8 p. |
artikel |
|
| 1672 | Low complexity normal bases for F 2 mn |
Séguin, Gérald E. |
1990 |
96-97 | Index 1 |
p. 309-312 4 p. |
artikel |
|
| 1673 | Lower bounds for monotone counting circuits |
Jukna, Stasys |
2016 |
96-97 | Index 1 |
p. 139-152 14 p. |
artikel |
|
| 1674 | Lower bounds for optimal alignments of binary sequences |
Vinzant, Cynthia |
2009 |
96-97 | Index 1 |
p. 3341-3346 6 p. |
artikel |
|
| 1675 | Lower bounds for protrusion replacement by counting equivalence classes |
Jansen, Bart M.P. |
|
96-97 | Index 1 |
p. 12-27 |
artikel |
|
| 1676 | Lower bounds for Ramsey numbers of K n with a small subgraph removed |
Wang, Ye |
2012 |
96-97 | Index 1 |
p. 2063-2068 6 p. |
artikel |
|
| 1677 | Lower bounds for the clique and the chromatic numbers of a graph |
Edwards, C.S. |
1983 |
96-97 | Index 1 |
p. 51-64 14 p. |
artikel |
|
| 1678 | Lower bounds for the independence and k -independence number of graphs using the concept of degenerate degrees |
Zaker, Manouchehr |
2016 |
96-97 | Index 1 |
p. 204-216 13 p. |
artikel |
|
| 1679 | Lower bounds for the Laplacian energy of bipartite graphs |
Palacios, José Luis |
2018 |
96-97 | Index 1 |
p. 213-217 |
artikel |
|
| 1680 | Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations |
Smith, T.H.C. |
1990 |
96-97 | Index 1 |
p. 209-217 9 p. |
artikel |
|
| 1681 | Lower bounds for treewidth of product graphs |
Kozawa, Kyohei |
2014 |
96-97 | Index 1 |
p. 251-258 8 p. |
artikel |
|
| 1682 | Lower bounds on matching energy of graphs |
Khalashi Ghezelahmad, S. |
|
96-97 | Index 1 |
p. 153-159 |
artikel |
|
| 1683 | Lower bounds on the general first Zagreb index of graphs with low cyclomatic number |
Dehgardi, Nasrin |
|
96-97 | Index 1 |
p. 52-61 |
artikel |
|
| 1684 | Lower bounds on the independence number of certain graphs of odd girth at least seven |
Pedersen, Anders Sune |
2011 |
96-97 | Index 1 |
p. 143-151 9 p. |
artikel |
|
| 1685 | Lower bounds on Tuza constants for transversals in linear uniform hypergraphs |
Henning, Michael A. |
|
96-97 | Index 1 |
p. 12-22 |
artikel |
|
| 1686 | L ( p , q ) -labeling of digraphs |
Chen, Yi-Ting |
2009 |
96-97 | Index 1 |
p. 1750-1759 10 p. |
artikel |
|
| 1687 | L ( p , q ) -labeling of planar graphs with small girth |
Dong, Wei |
|
96-97 | Index 1 |
p. 592-601 |
artikel |
|
| 1688 | L ( p , q ) -labelings of subdivisions of graphs |
Chang, Fei-Huang |
|
96-97 | Index 1 |
p. 264-270 |
artikel |
|
| 1689 | Making the components of a graph k -connected |
Nikiforov, V. |
2007 |
96-97 | Index 1 |
p. 410-415 6 p. |
artikel |
|
| 1690 | Many-to-many disjoint paths in hypercubes with faulty vertices |
Li, Xiang-Jun |
2017 |
96-97 | Index 1 |
p. 229-242 14 p. |
artikel |
|
| 1691 | Markov word patterns and a relation on α -words |
Chuan, Wai-Fong |
2016 |
96-97 | Index 1 |
p. 63-87 25 p. |
artikel |
|
| 1692 | Master index: volumes 1–10 |
1985 |
96-97 | Index 1 |
p. 5-23 19 p. |
artikel |
||
| 1693 | Matching and spanning trails in digraphs |
Liu, Juan |
|
96-97 | Index 1 |
p. 417-431 |
artikel |
|
| 1694 | Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms |
Komusiewicz, Christian |
|
96-97 | Index 1 |
p. 44-58 |
artikel |
|
| 1695 | Matching extension and matching exclusion via the size or the spectral radius of graphs |
Miao, Shujing |
|
96-97 | Index 1 |
p. 214-230 |
artikel |
|
| 1696 | Matching extension in prism graphs |
Aldred, R.E.L. |
2017 |
96-97 | Index 1 |
p. 25-32 8 p. |
artikel |
|
| 1697 | Matching polynomials of path-trees of a complete bipartite graph |
Chen, Haiyan |
|
96-97 | Index 1 |
p. 173-179 |
artikel |
|
| 1698 | Matching preclusion for k -ary n -cubes with odd k ≥ 3 |
Hu, Xiaomin |
2017 |
96-97 | Index 1 |
p. 90-100 11 p. |
artikel |
|
| 1699 | Matching preclusion for n -grid graphs |
Ding, Qi |
2018 |
96-97 | Index 1 |
p. 194-206 |
artikel |
|
| 1700 | Matchings and paths in the cube |
Bollobás, Béla |
1997 |
96-97 | Index 1 |
p. 1-8 8 p. |
artikel |
|
| 1701 | Matchings in bipartite graphs with a given number of cuts |
Liu, Jinfeng |
|
96-97 | Index 1 |
p. 303-309 |
artikel |
|
| 1702 | Matchings in colored bipartite networks |
Yi, Tongnyoul |
2002 |
96-97 | Index 1 |
p. 261-277 17 p. |
artikel |
|
| 1703 | Matchings in graphs with a given number of cuts |
Liu, Jinfeng |
|
96-97 | Index 1 |
p. 473-481 |
artikel |
|
| 1704 | Matching with sizes (or scheduling with processing set restrictions) |
Biró, Péter |
2014 |
96-97 | Index 1 |
p. 61-67 7 p. |
artikel |
|
| 1705 | Mathematical properties of the gene duplication cost |
Górecki, Paweł |
2019 |
96-97 | Index 1 |
p. 114-122 |
artikel |
|
| 1706 | Matrices generated by semilattices |
Karlander, Johan |
1995 |
96-97 | Index 1 |
p. 51-56 6 p. |
artikel |
|
| 1707 | Matrix transpose on meshes with wormhole and XY routing |
Kuo-Shun, Ding |
1998 |
96-97 | Index 1 |
p. 41-59 19 p. |
artikel |
|
| 1708 | Matroid optimization problems with monotone monomials in the objective |
Fischer, Anja |
|
96-97 | Index 1 |
p. 20-35 |
artikel |
|
| 1709 | Matroid optimization with generalized constraints |
Srinivas, Mandayam A. |
1995 |
96-97 | Index 1 |
p. 161-174 14 p. |
artikel |
|
| 1710 | Matroid representation of clique complexes |
Kashiwabara, Kenji |
2007 |
96-97 | Index 1 |
p. 1910-1929 20 p. |
artikel |
|
| 1711 | Maximal hypercubes in Fibonacci and Lucas cubes |
Mollard, Michel |
2012 |
96-97 | Index 1 |
p. 2479-2483 5 p. |
artikel |
|
| 1712 | Maximal induced matchings in K 4 -free and K 5 -free graphs |
Basavaraju, Manu |
|
96-97 | Index 1 |
p. 407-418 |
artikel |
|
| 1713 | Maximal intervals of decrease and inflection points for node reliability |
Brown, Jason |
|
96-97 | Index 1 |
p. 40-44 |
artikel |
|
| 1714 | Maximal irredundant functions |
Fricke, G.H. |
1996 |
96-97 | Index 1 |
p. 267-277 11 p. |
artikel |
|
| 1715 | Maximally edge-connected graphs and Zeroth-order general Randić index for 0 < α < 1 |
Su, Guifu |
2014 |
96-97 | Index 1 |
p. 261-268 8 p. |
artikel |
|
| 1716 | Maximal strongly connected cliques in directed graphs: Algorithms and bounds |
Conte, Alessio |
|
96-97 | Index 1 |
p. 237-252 |
artikel |
|
| 1717 | Maximal value of the zeroth-order Randić index |
Pavlović, Ljiljana |
2003 |
96-97 | Index 1 |
p. 615-626 12 p. |
artikel |
|
| 1718 | Maxima of the A α -index of graphs with given size and domination number |
Zhang, Rong |
|
96-97 | Index 1 |
p. 35-45 |
artikel |
|
| 1719 | Maxima of the Q -index of non-bipartite graphs: Forbidden short odd cycles |
Miao, Lu |
|
96-97 | Index 1 |
p. 104-114 |
artikel |
|
| 1720 | Maximizing a lower bound on the computational complexity |
Gati, Georg |
1982 |
96-97 | Index 1 |
p. 175-180 6 p. |
artikel |
|
| 1721 | Maximizing breaks and bounding solutions to the mirrored traveling tournament problem |
Urrutia, Sebastián |
2006 |
96-97 | Index 1 |
p. 1932-1938 7 p. |
artikel |
|
| 1722 | Maximizing the degree powers of graphs with fixed size |
Zhang, Liwen |
|
96-97 | Index 1 |
p. 15-24 |
artikel |
|
| 1723 | Maximizing the number of cliques in graphs with given matching number |
Duan, Xiuzhuan |
|
96-97 | Index 1 |
p. 110-117 |
artikel |
|
| 1724 | Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations |
Rossi, André |
2016 |
96-97 | Index 1 |
p. 123-136 14 p. |
artikel |
|
| 1725 | Maximizing traveling salesman problem for special matrices |
Blokh, D. |
1995 |
96-97 | Index 1 |
p. 83-86 4 p. |
artikel |
|
| 1726 | Maximum bipartite subgraphs in graphs without short cycles |
Lin, Jing |
|
96-97 | Index 1 |
p. 18-25 |
artikel |
|
| 1727 | Maximum bisections of graphs without cycles of length four and five |
Wu, Shufei |
|
96-97 | Index 1 |
p. 209-220 |
artikel |
|
| 1728 | Maximum cuts in edge-colored graphs |
Faria, Luerbio |
|
96-97 | Index 1 |
p. 229-234 |
artikel |
|
| 1729 | Maximum eccentric connectivity index for graphs with given diameter |
Hauweele, Pierre |
2019 |
96-97 | Index 1 |
p. 102-111 |
artikel |
|
| 1730 | Maximum-entropy remote sampling |
Anstreicher, Kurt M. |
2001 |
96-97 | Index 1 |
p. 211-226 16 p. |
artikel |
|
| 1731 | Maximum Estrada index of bicyclic graphs |
Wang, Long |
2015 |
96-97 | Index 1 |
p. 194-199 6 p. |
artikel |
|
| 1732 | Maximum independent sets near the upper bound |
Schiermeyer, Ingo |
2019 |
96-97 | Index 1 |
p. 186-190 |
artikel |
|
| 1733 | Maximum locally irregular induced subgraphs via minimum irregulators |
Fioravantes, Foivos |
|
96-97 | Index 1 |
p. 168-189 |
artikel |
|
| 1734 | Maximum matching width: New characterizations and a fast algorithm for dominating set |
Jeong, Jisu |
2018 |
96-97 | Index 1 |
p. 114-124 |
artikel |
|
| 1735 | Maximum renamable Horn sub-CNFs |
Boros, Endre |
1999 |
96-97 | Index 1 |
p. 29-40 12 p. |
artikel |
|
| 1736 | Maximum Resistance-Harary index of cacti |
Fang, Wei |
2018 |
96-97 | Index 1 |
p. 160-170 |
artikel |
|
| 1737 | Maximum size of a minimum watching system and the graphs achieving the bound |
Auger, David |
2014 |
96-97 | Index 1 |
p. 20-33 14 p. |
artikel |
|
| 1738 | Maximum 0-1 timed matching on temporal graphs |
Mandal, Subhrangsu |
|
96-97 | Index 1 |
p. 310-326 |
artikel |
|
| 1739 | Maximum weight edge-constrained matchings |
Rusu, Irena |
2008 |
96-97 | Index 1 |
p. 662-672 11 p. |
artikel |
|
| 1740 | Maximum weighted matching with few edge crossings for 2-layered bipartite graph |
Haraguchi, Kazuya |
|
96-97 | Index 1 |
p. 40-52 |
artikel |
|
| 1741 | Maximum weight independent sets in classes related to claw-free graphs |
Karthick, T. |
2017 |
96-97 | Index 1 |
p. 233-239 7 p. |
artikel |
|
| 1742 | Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model |
Yuan, Jun |
|
96-97 | Index 1 |
p. 46-67 |
artikel |
|
| 1743 | Measures of closeness to cordiality for graphs |
Brahmbhatt, Anand |
|
96-97 | Index 1 |
p. 157-166 |
artikel |
|
| 1744 | Median hyperplanes in normed spaces — a survey |
Martini, Horst |
1998 |
96-97 | Index 1 |
p. 181-195 15 p. |
artikel |
|
| 1745 | Mediated digraphs and quantum nonlocality |
Gutin, G. |
2005 |
96-97 | Index 1 |
p. 41-50 10 p. |
artikel |
|
| 1746 | M 2 -equipackable graphs |
Zhang, Yuqin |
2006 |
96-97 | Index 1 |
p. 1766-1770 5 p. |
artikel |
|
| 1747 | Metric and ultrametric inequalities for directed graphs |
Gurvich, Vladimir |
|
96-97 | Index 1 |
p. 93-104 |
artikel |
|
| 1748 | Metric and ultrametric spaces of resistances |
Gurvich, Vladimir |
2010 |
96-97 | Index 1 |
p. 1496-1505 10 p. |
artikel |
|
| 1749 | Metric dimension and metric independence number of incidence graphs of symmetric designs |
Tang, Lang |
|
96-97 | Index 1 |
p. 43-50 |
artikel |
|
| 1750 | Metric dimension and pattern avoidance in graphs |
Geneson, Jesse |
|
96-97 | Index 1 |
p. 1-7 |
artikel |
|
| 1751 | Metric properties of generalized Sierpiński graphs over stars |
Alizadeh, Yaser |
2019 |
96-97 | Index 1 |
p. 48-55 |
artikel |
|
| 1752 | Metric spaces in which many triangles are degenerate |
Chvátal, Vašek |
|
96-97 | Index 1 |
p. 97-99 |
artikel |
|
| 1753 | MILP approach to pattern generation in logical analysis of data |
Ryoo, Hong Seo |
2009 |
96-97 | Index 1 |
p. 749-761 13 p. |
artikel |
|
| 1754 | Mim-Width I. Induced path problems |
Jaffke, Lars |
|
96-97 | Index 1 |
p. 153-168 |
artikel |
|
| 1755 | Min algebraic duality |
Llewellyn, Donna Crystal |
1987 |
96-97 | Index 1 |
p. 87-90 4 p. |
artikel |
|
| 1756 | Minimal arc-sets spanning dicycles |
Cornaz, D. |
2018 |
96-97 | Index 1 |
p. 33-43 |
artikel |
|
| 1757 | Minimal average cost of searching for a counterfeit coin: Restricted model |
Liu, Wen An |
2006 |
96-97 | Index 1 |
p. 1996-2009 14 p. |
artikel |
|
| 1758 | Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope |
Granot, Daniel |
1984 |
96-97 | Index 1 |
p. 171-185 15 p. |
artikel |
|
| 1759 | Minimal graphs for matching extensions |
Costa, M.-C. |
2018 |
96-97 | Index 1 |
p. 47-55 |
artikel |
|
| 1760 | Minimal obstructions to 2-polar cographs |
Hell, Pavol |
2019 |
96-97 | Index 1 |
p. 219-228 |
artikel |
|
| 1761 | Minimal obstructions to ( s , 1 ) -polarity in cographs |
Contreras-Mendoza, Fernando Esteban |
|
96-97 | Index 1 |
p. 111-117 |
artikel |
|
| 1762 | Minimal polynomials of the modified de Bruijn sequences |
Kyureghyan, Gohar M. |
2008 |
96-97 | Index 1 |
p. 1549-1553 5 p. |
artikel |
|
| 1763 | Minimal proper non-IRUP instances of the one-dimensional cutting stock problem |
Kartak, Vadim M. |
2015 |
96-97 | Index 1 |
p. 120-129 10 p. |
artikel |
|
| 1764 | Minimal spread of integral circulant graphs |
Bašić, Milan |
|
96-97 | Index 1 |
p. 317-333 |
artikel |
|
| 1765 | Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images |
Ronse, Christian |
1988 |
96-97 | Index 1 |
p. 67-79 13 p. |
artikel |
|
| 1766 | Minimal vertex separators of chordal graphs |
Kumar, P.Sreenivasa |
1998 |
96-97 | Index 1 |
p. 155-168 14 p. |
artikel |
|
| 1767 | Minimization on submodular flows |
Zimmermann, U. |
1982 |
96-97 | Index 1 |
p. 303-323 21 p. |
artikel |
|
| 1768 | Minimizing phylogenetic number to find good evolutionary trees |
Goldberg, Leslie Ann |
1996 |
96-97 | Index 1 |
p. 111-136 26 p. |
artikel |
|
| 1769 | Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem |
Kravchenko, Svetlana A. |
2000 |
96-97 | Index 1 |
p. 209-217 9 p. |
artikel |
|
| 1770 | Minimizing the number of tardy jobs with precedence constraints and agreeable due dates |
Steiner, George |
1997 |
96-97 | Index 1 |
p. 167-177 11 p. |
artikel |
|
| 1771 | Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs |
Ishii, Toshimasa |
2006 |
96-97 | Index 1 |
p. 2307-2329 23 p. |
artikel |
|
| 1772 | Minimum average-case queries of q + 1 -ary search game with small sets |
Meng, Kun |
2012 |
96-97 | Index 1 |
p. 618-627 10 p. |
artikel |
|
| 1773 | Minimum consistent subset of simple graph classes |
Dey, Sanjana |
|
96-97 | Index 1 |
p. 255-277 |
artikel |
|
| 1774 | Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width |
Fernandes, Cristina G. |
2009 |
96-97 | Index 1 |
p. 272-279 8 p. |
artikel |
|
| 1775 | Minimum degree conditions for H -linked graphs |
Kostochka, Alexandr |
2008 |
96-97 | Index 1 |
p. 1542-1548 7 p. |
artikel |
|
| 1776 | Minimum degree conditions for the strength and bandwidth of graphs |
Ichishima, Rikio |
|
96-97 | Index 1 |
p. 191-198 |
artikel |
|
| 1777 | Minimum degree, independence number and pseudo [ 2 , b ] -factors in graphs |
Bekkai, Siham |
2014 |
96-97 | Index 1 |
p. 108-114 7 p. |
artikel |
|
| 1778 | Minimum fill-in and treewidth of split + k e and split + k v graphs |
Mancini, Federico |
2010 |
96-97 | Index 1 |
p. 747-754 8 p. |
artikel |
|
| 1779 | Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number |
Jamil, Muhammad Kamran |
2017 |
96-97 | Index 1 |
p. 143-150 8 p. |
artikel |
|
| 1780 | Minimum k-broadcast graphs |
König, J.-C. |
1994 |
96-97 | Index 1 |
p. 199-209 11 p. |
artikel |
|
| 1781 | Minimum k -critical bipartite graphs |
Cichacz, Sylwia |
|
96-97 | Index 1 |
p. 54-66 |
artikel |
|
| 1782 | Minimum matrix representation of some key system |
Tichler, Krisztián |
2002 |
96-97 | Index 1 |
p. 267-277 11 p. |
artikel |
|
| 1783 | Minimum matrix representation of Sperner systems |
Bennett, F.E. |
1998 |
96-97 | Index 1 |
p. 9-17 9 p. |
artikel |
|
| 1784 | Minimum multiplicity edge coloring via orientation |
Bampas, Evangelos |
|
96-97 | Index 1 |
p. 380-388 |
artikel |
|
| 1785 | Minimum number of maximal dissociation sets in trees |
Zhang, Junxia |
|
96-97 | Index 1 |
p. 272-278 |
artikel |
|
| 1786 | Minimum restricted diameter spanning trees |
Hassin, Refael |
2004 |
96-97 | Index 1 |
p. 343-357 15 p. |
artikel |
|
| 1787 | Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover |
Chlebík, Miroslav |
2007 |
96-97 | Index 1 |
p. 172-179 8 p. |
artikel |
|
| 1788 | Minimum self-dual decompositions of positive dual-minor Boolean functions |
Bioch, Jan C. |
1999 |
96-97 | Index 1 |
p. 307-326 20 p. |
artikel |
|
| 1789 | Minimum size tree-decompositions |
Li, Bi |
2018 |
96-97 | Index 1 |
p. 109-127 |
artikel |
|
| 1790 | Minimum spanning hypertrees |
Tomescu, Ioan |
1994 |
96-97 | Index 1 |
p. 67-76 10 p. |
artikel |
|
| 1791 | Minimum time broadcast in faulty star networks |
Gargano, Luisa |
1998 |
96-97 | Index 1 |
p. 97-119 23 p. |
artikel |
|
| 1792 | Minimum t P 3 -saturation graphs |
He, Zhen |
|
96-97 | Index 1 |
p. 148-156 |
artikel |
|
| 1793 | Mining approximate patterns with frequent locally optimal occurrences |
Nakamura, Atsuyoshi |
2016 |
96-97 | Index 1 |
p. 123-152 30 p. |
artikel |
|
| 1794 | Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks |
Bhattacharya, Binay |
2015 |
96-97 | Index 1 |
p. 18-30 13 p. |
artikel |
|
| 1795 | Minmax regret for sink location on dynamic flow paths with general capacities |
Golin, Mordecai |
|
96-97 | Index 1 |
p. 1-26 |
artikel |
|
| 1796 | Minmax subtree cover problem on cacti |
Nagamochi, Hiroshi |
2006 |
96-97 | Index 1 |
p. 1254-1263 10 p. |
artikel |
|
| 1797 | Minor-obstructions for apex sub-unicyclic graphs |
Leivaditis, Alexandros |
|
96-97 | Index 1 |
p. 538-555 |
artikel |
|
| 1798 | Minor relation for quadrangulations on the projective plane |
Matsumoto, Naoki |
2016 |
96-97 | Index 1 |
p. 296-302 7 p. |
artikel |
|
| 1799 | Misère Nim with multi-player |
Liu, Wen An |
2017 |
96-97 | Index 1 |
p. 40-50 11 p. |
artikel |
|
| 1800 | Mixed covering arrays on 3-uniform hypergraphs |
Akhtar, Yasmeen |
2017 |
96-97 | Index 1 |
p. 8-22 |
artikel |
|
| 1801 | Mixed fault diameter of Cartesian graph bundles |
Erveš, Rija |
2013 |
96-97 | Index 1 |
p. 1726-1733 8 p. |
artikel |
|
| 1802 | Models, relaxations and exact approaches for the capacitated vehicle routing problem |
Toth, Paolo |
2002 |
96-97 | Index 1 |
p. 487-512 26 p. |
artikel |
|
| 1803 | Moderately exponential time algorithms for the maximum bounded-degree-1 set problem |
Chang, Maw-Shang |
2018 |
96-97 | Index 1 |
p. 114-125 |
artikel |
|
| 1804 | Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem |
Cong, Wei-jie |
2010 |
96-97 | Index 1 |
p. 627-635 9 p. |
artikel |
|
| 1805 | Modified hyper-Wiener index of trees |
Bozkurt Altındağ, Ş.B. |
|
96-97 | Index 1 |
p. 101-109 |
artikel |
|
| 1806 | Modular decomposition of graphs and the distance preserving property |
Zahedi, Emad |
2019 |
96-97 | Index 1 |
p. 192-198 |
artikel |
|
| 1807 | Modulo 5-orientations and degree sequences |
Han, Miaomiao |
2019 |
96-97 | Index 1 |
p. 155-163 |
artikel |
|
| 1808 | Modulo orientations with bounded independence number |
Han, Miaomiao |
|
96-97 | Index 1 |
p. 14-22 |
artikel |
|
| 1809 | Molecular graphs and the inverse Wiener index problem |
Wagner, Stephan G. |
2009 |
96-97 | Index 1 |
p. 1544-1554 11 p. |
artikel |
|
| 1810 | Moments in graphs |
Dalfó, C. |
2013 |
96-97 | Index 1 |
p. 768-777 10 p. |
artikel |
|
| 1811 | Monitoring the edges of a graph using distances |
Foucaud, Florent |
|
96-97 | Index 1 |
p. 424-438 |
artikel |
|
| 1812 | Monochromatic disconnection of graphs |
Li, Ping |
|
96-97 | Index 1 |
p. 171-179 |
artikel |
|
| 1813 | Monochromatic graph decompositions inspired by anti-Ramsey colorings |
Caro, Yair |
|
96-97 | Index 1 |
p. 190-200 |
artikel |
|
| 1814 | Monotone bargaining is Nash-solvable |
Gurvich, Vladimir |
2018 |
96-97 | Index 1 |
p. 1-15 |
artikel |
|
| 1815 | Monotonicity of the minimum cardinality of an identifying code in the hypercube |
Moncel, Julien |
2006 |
96-97 | Index 1 |
p. 898-899 2 p. |
artikel |
|
| 1816 | Monotonicity paradoxes in the theory of elections |
Fishburn, Peter C. |
1982 |
96-97 | Index 1 |
p. 119-134 16 p. |
artikel |
|
| 1817 | Moplex orderings generated by the LexDFS algorithm |
Xu, Shou-Jun |
2013 |
96-97 | Index 1 |
p. 2189-2195 7 p. |
artikel |
|
| 1818 | More fires and more fighters |
Costa, Vitor |
2013 |
96-97 | Index 1 |
p. 2410-2419 10 p. |
artikel |
|
| 1819 | More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index” |
Pavlović, Ljiljana |
2009 |
96-97 | Index 1 |
p. 2938-2944 7 p. |
artikel |
|
| 1820 | More results on the z -chromatic number of graphs |
Khaleghi, Abbas |
|
96-97 | Index 1 |
p. 89-99 |
artikel |
|
| 1821 | More ZCPS-Wh(v) and several new infinite classes of Z-cyclic whist tournaments |
Finizio, Norman J. |
1998 |
96-97 | Index 1 |
p. 193-202 10 p. |
artikel |
|
| 1822 | Multicolor bipartite Ramsey numbers of K t , s and large K n , n |
Wang, Xiuwen |
2016 |
96-97 | Index 1 |
p. 238-242 5 p. |
artikel |
|
| 1823 | Multicolor induced Ramsey numbers |
Song, Yanyan |
|
96-97 | Index 1 |
p. 269-280 |
artikel |
|
| 1824 | Multicommodity flows in certain planar directed networks |
Nagamochi, Hiroshi |
1990 |
96-97 | Index 1 |
p. 125-145 21 p. |
artikel |
|
| 1825 | Multiflows in symmetric digraphs |
Jarry, Aubin |
2012 |
96-97 | Index 1 |
p. 2208-2220 13 p. |
artikel |
|
| 1826 | 0-1 multilinear programming as a unifying theory for LAD pattern generation |
Yan, Kedong |
2017 |
96-97 | Index 1 |
p. 21-39 19 p. |
artikel |
|
| 1827 | Multi-machine scheduling with variance minimization |
Cai, Xiaoqiang |
1998 |
96-97 | Index 1 |
p. 55-70 16 p. |
artikel |
|
| 1828 | Multi-player Small Nim with Passes |
Liu, Wen An |
2018 |
96-97 | Index 1 |
p. 306-314 |
artikel |
|
| 1829 | Multiple factor Nordhaus–Gaddum type results for domination and total domination |
Henning, Michael A. |
2012 |
96-97 | Index 1 |
p. 1137-1142 6 p. |
artikel |
|
| 1830 | Multiple levels of preference in interactive strategic decisions |
Xu, Haiyan |
2009 |
96-97 | Index 1 |
p. 3300-3313 14 p. |
artikel |
|
| 1831 | Multiplicative circulant networks topological properties and communication algorithms |
Stojmenović, Ivan |
1997 |
96-97 | Index 1 |
p. 281-305 25 p. |
artikel |
|
| 1832 | Multiplicative Zagreb indices of k -trees |
Wang, Shaohui |
2015 |
96-97 | Index 1 |
p. 168-175 8 p. |
artikel |
|
| 1833 | Multiplicity of eigenvalues of cographs |
Allem, Luiz Emilio |
|
96-97 | Index 1 |
p. 43-52 |
artikel |
|
| 1834 | Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching |
Zhao, Jinxing |
|
96-97 | Index 1 |
p. 480-486 |
artikel |
|
| 1835 | Multiprocessor scheduling: combining LPT and MULTIFIT |
Lee, Chung-Yee |
1988 |
96-97 | Index 1 |
p. 233-242 10 p. |
artikel |
|
| 1836 | Multiprofessor scheduling |
Dosa, Gyorgy |
2018 |
96-97 | Index 1 |
p. 195-209 |
artikel |
|
| 1837 | Multi-symbol forbidden configurations |
Ellis, Keaton |
|
96-97 | Index 1 |
p. 24-36 |
artikel |
|
| 1838 | Mutual transferability for ( F , B , R ) -domination on strongly chordal graphs and cactus graphs |
Chu, Kuan-Ting |
2019 |
96-97 | Index 1 |
p. 41-52 |
artikel |
|
| 1839 | Nash-solvable two-person symmetric cycle game forms |
Boros, Endre |
2011 |
96-97 | Index 1 |
p. 1461-1487 27 p. |
artikel |
|
| 1840 | Navigating between packings of graphic sequences |
Erdős, Péter L. |
2019 |
96-97 | Index 1 |
p. 252-258 |
artikel |
|
| 1841 | Near-interval edge colorings of graphs |
Casselgren, Carl Johan |
|
96-97 | Index 1 |
p. 23-36 |
artikel |
|
| 1842 | Near-linear-time algorithm for the geodetic Radon number of grids |
Dourado, Mitre Costa |
2016 |
96-97 | Index 1 |
p. 277-283 |
artikel |
|
| 1843 | Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs |
Gu, Qian-Ping |
2019 |
96-97 | Index 1 |
p. 186-205 |
artikel |
|
| 1844 | Nearly equal distances in metric spaces |
Ophir, Amit |
2014 |
96-97 | Index 1 |
p. 122-127 6 p. |
artikel |
|
| 1845 | Nearly on line scheduling of preemptive independent tasks |
Sanlaville, Eric |
1995 |
96-97 | Index 1 |
p. 229-241 13 p. |
artikel |
|
| 1846 | Nearly optimal codebooks based on generalized Jacobi sums |
Heng, Ziling |
2018 |
96-97 | Index 1 |
p. 227-240 |
artikel |
|
| 1847 | Near-optimal induced universal graphs for cycles and paths |
Abrahamsen, Mikkel |
|
96-97 | Index 1 |
p. 1-13 |
artikel |
|
| 1848 | Necessary conditions for the existence of two classes of ZCPS-Wh( v ) |
Abel, R. Julian R. |
2011 |
96-97 | Index 1 |
p. 848-851 4 p. |
artikel |
|
| 1849 | Negative circuits for flows and submodular flows |
Zimmermann, Uwe |
1992 |
96-97 | Index 1 |
p. 179-189 11 p. |
artikel |
|
| 1850 | Neighbor connectivity of pancake graphs and burnt pancake graphs |
Gu, Mei-Mei |
|
96-97 | Index 1 |
p. 46-57 |
artikel |
|
| 1851 | Neighborhood hypergraphs of digraphs and some matrix permutation problems |
Gurvich, Vladimir |
2009 |
96-97 | Index 1 |
p. 2836-2845 10 p. |
artikel |
|
| 1852 | Neighborhood unions and cyclability of graphs |
Liu, Huiqing |
2004 |
96-97 | Index 1 |
p. 91-101 11 p. |
artikel |
|
| 1853 | Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree |
Dong, Aijun |
2014 |
96-97 | Index 1 |
p. 84-90 7 p. |
artikel |
|
| 1854 | Neighbor sum distinguishing edge colorings of sparse graphs |
Hu, Xiaolan |
2015 |
96-97 | Index 1 |
p. 119-125 7 p. |
artikel |
|
| 1855 | Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles |
Sun, Lin |
|
96-97 | Index 1 |
p. 146-153 |
artikel |
|
| 1856 | Neighbor sum distinguishing total choosability of planar graphs without 4-cycles |
Wang, Jihui |
2016 |
96-97 | Index 1 |
p. 215-219 5 p. |
artikel |
|
| 1857 | Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles |
Duan, Yuan-yuan |
|
96-97 | Index 1 |
p. 473-479 |
artikel |
|
| 1858 | Neighbor sum distinguishing total chromatic number of 2-degenerate graphs |
Xu, Changqing |
2018 |
96-97 | Index 1 |
p. 349-352 |
artikel |
|
| 1859 | Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring |
Lu, You |
2018 |
96-97 | Index 1 |
p. 109-115 |
artikel |
|
| 1860 | Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions |
Song, Chao |
|
96-97 | Index 1 |
p. 202-209 |
artikel |
|
| 1861 | Neighbor sum distinguishing total coloring of sparse IC-planar graphs |
Song, Wen-yao |
2018 |
96-97 | Index 1 |
p. 183-192 |
artikel |
|
| 1862 | Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ |
Cheng, Xiaohan |
2015 |
96-97 | Index 1 |
p. 34-41 8 p. |
artikel |
|
| 1863 | Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1–2–3 Conjecture |
Baudon, Olivier |
2018 |
96-97 | Index 1 |
p. 83-92 |
artikel |
|
| 1864 | Neighbour sum distinguishing edge-weightings with local constraints |
Dailly, Antoine |
|
96-97 | Index 1 |
p. 109-124 |
artikel |
|
| 1865 | Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz |
Przybyło, Jakub |
2016 |
96-97 | Index 1 |
p. 163-173 11 p. |
artikel |
|
| 1866 | Neither reading few bits twice nor reading illegally helps much |
Jukna, S. |
1998 |
96-97 | Index 1 |
p. 223-238 16 p. |
artikel |
|
| 1867 | Net Laplacian controllability for joins of signed graphs |
Stanić, Zoran |
|
96-97 | Index 1 |
p. 197-203 |
artikel |
|
| 1868 | Network decontamination under m -immunity |
Flocchini, Paola |
2016 |
96-97 | Index 1 |
p. 114-129 16 p. |
artikel |
|
| 1869 | New algorithms and bounds for halving pseudolines |
Bereg, Sergey |
|
96-97 | Index 1 |
p. 194-206 |
artikel |
|
| 1870 | New bounds for perfect k -hashing |
Costa, Simone |
|
96-97 | Index 1 |
p. 374-382 |
artikel |
|
| 1871 | New bounds for Ramsey numbers R ( K k − e , K l − e ) |
Goedgebeur, Jan |
|
96-97 | Index 1 |
p. 212-221 |
artikel |
|
| 1872 | New bounds on binary identifying codes |
Exoo, Geoffrey |
2008 |
96-97 | Index 1 |
p. 2250-2263 14 p. |
artikel |
|
| 1873 | New bounds on clique-chromatic numbers of Johnson graphs |
Raigorodskii, A.M. |
|
96-97 | Index 1 |
p. 724-729 |
artikel |
|
| 1874 | New bounds on the double domination number of trees |
Cabrera-Martínez, Abel |
|
96-97 | Index 1 |
p. 97-103 |
artikel |
|
| 1875 | New bounds on the minimum density of an identifying code for the infinite hexagonal grid |
Cukierman, Ari |
2013 |
96-97 | Index 1 |
p. 2910-2924 15 p. |
artikel |
|
| 1876 | New classes of facets of the cut polytope and tightness of I mm 22 Bell inequalities |
Avis, David |
2007 |
96-97 | Index 1 |
p. 1689-1699 11 p. |
artikel |
|
| 1877 | New comments on “A Hamilton sufficient condition for completely independent spanning tree” |
Li, Junjiang |
|
96-97 | Index 1 |
p. 10-15 |
artikel |
|
| 1878 | New exact approaches and approximation results for the Penalized Knapsack Problem |
Della Croce, Federico |
2019 |
96-97 | Index 1 |
p. 122-135 |
artikel |
|
| 1879 | New families of graphs without short cycles and large size |
Abajo, E. |
2010 |
96-97 | Index 1 |
p. 1127-1135 9 p. |
artikel |
|
| 1880 | New lower bounds for the first variable Zagreb index |
Martínez-Pérez, Alvaro |
|
96-97 | Index 1 |
p. 166-173 |
artikel |
|
| 1881 | New lower bounds for Tverberg partitions with tolerance in the plane |
Bereg, Sergey |
|
96-97 | Index 1 |
p. 596-603 |
artikel |
|
| 1882 | New orthogonality criterion for shortest vector of lattices and its applications |
Lee, Hyang-Sook |
|
96-97 | Index 1 |
p. 323-335 |
artikel |
|
| 1883 | New potential functions for greedy independence and coloring |
Borowiecki, Piotr |
2015 |
96-97 | Index 1 |
p. 61-72 12 p. |
artikel |
|
| 1884 | New results for the Longest Haplotype Reconstruction problem |
Dondi, Riccardo |
2012 |
96-97 | Index 1 |
p. 1299-1310 12 p. |
artikel |
|
| 1885 | New results for the Mondrian art problem |
Dalfó, C. |
|
96-97 | Index 1 |
p. 64-73 |
artikel |
|
| 1886 | New results on edge-coloring and total-coloring of split graphs |
Couto, Fernanda |
|
96-97 | Index 1 |
p. 297-306 |
artikel |
|
| 1887 | New results on radio k -labelings of distance graphs |
Korže, Danilo |
|
96-97 | Index 1 |
p. 472-479 |
artikel |
|
| 1888 | New results on two hypercube coloring problems |
Fu, Fang-Wei |
2013 |
96-97 | Index 1 |
p. 2937-2945 9 p. |
artikel |
|
| 1889 | New tabulation and sparse dynamic programming based techniques for sequence similarity problems |
Grabowski, Szymon |
2016 |
96-97 | Index 1 |
p. 96-103 8 p. |
artikel |
|
| 1890 | New type of coding problem motivated by database theory |
Katona, Gyula O.H. |
2004 |
96-97 | Index 1 |
p. 140-148 9 p. |
artikel |
|
| 1891 | New upper and lower bounds on the channel capacity of read/write isolated memory |
Golin, Mordecai J. |
2004 |
96-97 | Index 1 |
p. 35-48 14 p. |
artikel |
|
| 1892 | New Z-cyclic triplewhist frames and triplewhist tournament designs |
Abel, R. Julian R. |
2006 |
96-97 | Index 1 |
p. 1649-1673 25 p. |
artikel |
|
| 1893 | NIC-planar graphs |
Bachmaier, Christian |
2017 |
96-97 | Index 1 |
p. 23-40 |
artikel |
|
| 1894 | Nilpotent dynamics on signed interaction graphs and weak converses of Thomas’ rules |
Richard, Adrien |
2019 |
96-97 | Index 1 |
p. 160-175 |
artikel |
|
| 1895 | Nim with one or two dynamic restrictions |
Liu, Wen An |
2016 |
96-97 | Index 1 |
p. 48-64 17 p. |
artikel |
|
| 1896 | No graph with nullity η ( G ) = | V ( G ) | − 2 m ( G ) + 2 c ( G ) − 1 |
Li, Xin |
2019 |
96-97 | Index 1 |
p. 130-136 |
artikel |
|
| 1897 | No-hole k-tuple (r + 1)-distant colorings |
Troxell, Denise Sakai |
1996 |
96-97 | Index 1 |
p. 67-85 19 p. |
artikel |
|
| 1898 | No-hole k-tuple (r + 1)-distant colorings of odd cycles |
Guichard, David R. |
1996 |
96-97 | Index 1 |
p. 87-92 6 p. |
artikel |
|
| 1899 | Nominations for the George B. Dantzig prize |
1987 |
96-97 | Index 1 |
p. 190- 1 p. |
artikel |
||
| 1900 | Non-abelian key agreement protocols |
Anshel, Iris |
2003 |
96-97 | Index 1 |
p. 3-12 10 p. |
artikel |
|
| 1901 | Nonadaptive algorithms for threshold group testing |
Chen, Hong-Bin |
2009 |
96-97 | Index 1 |
p. 1581-1585 5 p. |
artikel |
|
| 1902 | Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes |
Mollard, Michel |
2017 |
96-97 | Index 1 |
p. 219-221 3 p. |
artikel |
|
| 1903 | Noncrossing Hamiltonian paths in geometric graphs |
Černý, Jakub |
2007 |
96-97 | Index 1 |
p. 1096-1105 10 p. |
artikel |
|
| 1904 | Nondegenerate functions and permutations |
O'Connor, Luke |
1997 |
96-97 | Index 1 |
p. 41-57 17 p. |
artikel |
|
| 1905 | Non-hamiltonian 1-tough triangulations with disjoint separating triangles |
Fujisawa, Jun |
|
96-97 | Index 1 |
p. 622-625 |
artikel |
|
| 1906 | Non-inclusive diagnosability of folded hypercube-like networks |
Zhuo, Nengjin |
|
96-97 | Index 1 |
p. 237-246 |
artikel |
|
| 1907 | Non-overlapping descents and ascents in stack-sortable permutations |
Kitaev, Sergey |
|
96-97 | Index 1 |
p. 112-119 |
artikel |
|
| 1908 | Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) |
Bafna, Vineet |
1996 |
96-97 | Index 1 |
p. 41-53 13 p. |
artikel |
|
| 1909 | Non-Singular graphs with a Singular Deck |
Farrugia, Alexander |
2016 |
96-97 | Index 1 |
p. 50-57 8 p. |
artikel |
|
| 1910 | Non-trivial t -intersecting separated families |
Frankl, Peter |
|
96-97 | Index 1 |
p. 124-137 |
artikel |
|
| 1911 | Nordhaus–Gaddum decompositions for group coloring and DP coloring |
Bickle, Allan |
|
96-97 | Index 1 |
p. 264-269 |
artikel |
|
| 1912 | Nordhaus–Gaddum problems for power domination |
Benson, Katherine F. |
2018 |
96-97 | Index 1 |
p. 103-113 |
artikel |
|
| 1913 | Nordhaus–Gaddum type inequalities for the two largest Laplacian eigenvalues |
Grijó, Rodrigo |
2019 |
96-97 | Index 1 |
p. 176-183 |
artikel |
|
| 1914 | Nordhaus–Gaddum type inequality for the fractional matching number of a graph |
Yang, Ting |
|
96-97 | Index 1 |
p. 59-67 |
artikel |
|
| 1915 | Nordhaus–Gaddum type inequality for the integer k-matching number of a graph |
Chen, Qian-Qian |
|
96-97 | Index 1 |
p. 21-31 |
artikel |
|
| 1916 | Nordhaus–Gaddum-type results for the generalized edge-connectivity of graphs |
Li, Xueliang |
2015 |
96-97 | Index 1 |
p. 102-112 11 p. |
artikel |
|
| 1917 | Nordhaus–Gaddum-type theorem for Wiener index of graphs when decomposing into three parts |
Li, Daobin |
2011 |
96-97 | Index 1 |
p. 1594-1600 7 p. |
artikel |
|
| 1918 | Norm statistics and the complexity of clustering problems |
Novick, Beth |
2009 |
96-97 | Index 1 |
p. 1831-1839 9 p. |
artikel |
|
| 1919 | Note |
Charon, Irène |
1997 |
96-97 | Index 1 |
p. 211-215 5 p. |
artikel |
|
| 1920 | Note on a pursuit game played on graphs |
Andreae, Thomas |
1984 |
96-97 | Index 1 |
p. 111-115 5 p. |
artikel |
|
| 1921 | Note on combinatorial optimization with max-linear objective functions |
Chung, Sung-Jin |
1993 |
96-97 | Index 1 |
p. 139-145 7 p. |
artikel |
|
| 1922 | Note on complexity of computing the domination of binary systems |
Chernyak, A.A. |
1997 |
96-97 | Index 1 |
p. 289-295 7 p. |
artikel |
|
| 1923 | Note on E -super vertex magic graphs |
Wang, Tao-Ming |
2014 |
96-97 | Index 1 |
p. 160-162 3 p. |
artikel |
|
| 1924 | Note on fair game edge-connectivity of graphs |
Furuya, Michitaka |
|
96-97 | Index 1 |
p. 132-135 |
artikel |
|
| 1925 | Note on injective edge-coloring of graphs |
Miao, Zhengke |
|
96-97 | Index 1 |
p. 65-74 |
artikel |
|
| 1926 | Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, “The disjunctive procedure and blocker duality” |
Leoni, V. |
2005 |
96-97 | Index 1 |
p. 251-255 5 p. |
artikel |
|
| 1927 | Note on non-uniform bin packing games |
Kern, Walter |
2014 |
96-97 | Index 1 |
p. 175-184 10 p. |
artikel |
|
| 1928 | Note on Sombor index of connected graphs with given degree sequence |
Wei, Peichao |
|
96-97 | Index 1 |
p. 51-55 |
artikel |
|
| 1929 | Note on the multiplicative Zagreb indices |
Kazemi, Ramin |
2016 |
96-97 | Index 1 |
p. 147-154 8 p. |
artikel |
|
| 1930 | Note on the upper bound of the rainbow index of a graph |
Cai, Qingqiong |
2016 |
96-97 | Index 1 |
p. 68-74 7 p. |
artikel |
|
| 1931 | Notes on Boolean read- k and multilinear circuits |
Jukna, Stasys |
|
96-97 | Index 1 |
p. 307-327 |
artikel |
|
| 1932 | [No title] |
Gutin, Gregory |
2002 |
96-97 | Index 1 |
p. 1-2 2 p. |
artikel |
|
| 1933 | NP-completeness of a family of graph-colouring problems |
Irving, Robert W. |
1983 |
96-97 | Index 1 |
p. 111-117 7 p. |
artikel |
|
| 1934 | NP -completeness of generalized multi-Skolem sequences |
Nordh, Gustav |
2007 |
96-97 | Index 1 |
p. 2061-2068 8 p. |
artikel |
|
| 1935 | ( N , p ) -equitable b-coloring of graphs |
Ait Taleb, Samiha |
2018 |
96-97 | Index 1 |
p. 1-15 |
artikel |
|
| 1936 | NP-hardness of the sorting buffer problem on the uniform metric |
Asahiro, Yuichi |
2012 |
96-97 | Index 1 |
p. 1453-1464 12 p. |
artikel |
|
| 1937 | Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem |
Miyata, Keizo |
2006 |
96-97 | Index 1 |
p. 2402-2410 9 p. |
artikel |
|
| 1938 | Null and non-rainbow colorings of projective plane and sphere triangulations |
Arocha, Jorge L. |
2016 |
96-97 | Index 1 |
p. 195-199 |
artikel |
|
| 1939 | Number of lines in hypergraphs |
Aboulker, Pierre |
2014 |
96-97 | Index 1 |
p. 137-140 4 p. |
artikel |
|
| 1940 | Numerical characterization of n -cube subset partitioning |
Sahakyan, H. |
2009 |
96-97 | Index 1 |
p. 2191-2197 7 p. |
artikel |
|
| 1941 | Numerical semigroups of Szemerédi type |
Adhikari, S.D. |
2019 |
96-97 | Index 1 |
p. 8-13 |
artikel |
|
| 1942 | Observations on a class of nasty linear complementarity problems |
Cottle, Richard W. |
1980 |
96-97 | Index 1 |
p. 89-111 23 p. |
artikel |
|
| 1943 | Obstructions for linear rank-width at most 1 |
Adler, Isolde |
2014 |
96-97 | Index 1 |
p. 3-13 11 p. |
artikel |
|
| 1944 | Occupation games on graphs in which the second player takes almost all vertices |
Shapovalov, Alexander |
2011 |
96-97 | Index 1 |
p. 1526-1527 2 p. |
artikel |
|
| 1945 | Odd gossiping |
Fertin, Guillaume |
2017 |
96-97 | Index 1 |
p. 550-561 12 p. |
artikel |
|
| 1946 | On a base exchange game on bispanning graphs |
Andres, Stephan Dominique |
2014 |
96-97 | Index 1 |
p. 25-36 12 p. |
artikel |
|
| 1947 | On a class of completable partial edge-colourings |
Rosa, Alexander |
1992 |
96-97 | Index 1 |
p. 293-299 7 p. |
artikel |
|
| 1948 | On a class of m -to-1 functions |
Ding, Zhiguo |
|
96-97 | Index 1 |
p. 208-210 |
artikel |
|
| 1949 | On a conjecture of Eǧecioǧlu and Iršič |
Wei, Jianxin |
|
96-97 | Index 1 |
p. 92-105 |
artikel |
|
| 1950 | On a conjecture of Erdős, Graham and Spencer, II |
Fang, Jin-Hui |
2008 |
96-97 | Index 1 |
p. 2950-2958 |
artikel |
|
| 1951 | On a conjecture of Foulds and Robinson about deltahedra |
Ning, Qi |
1987 |
96-97 | Index 1 |
p. 305-308 4 p. |
artikel |
|
| 1952 | On a conjecture of Graham and Lovász about distance matrices |
Collins, Karen L. |
1989 |
96-97 | Index 1 |
p. 27-35 9 p. |
artikel |
|
| 1953 | On a conjecture of Schweser and Stiebitz |
Liu, Muhuo |
|
96-97 | Index 1 |
p. 25-31 |
artikel |
|
| 1954 | On a conjecture of the Randić index |
You, Zhifu |
2009 |
96-97 | Index 1 |
p. 1766-1772 7 p. |
artikel |
|
| 1955 | On a conjecture of the Randić index and the minimum degree of graphs |
Liu, Jianxi |
2013 |
96-97 | Index 1 |
p. 2544-2548 5 p. |
artikel |
|
| 1956 | On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs |
Brimkov, Boris |
|
96-97 | Index 1 |
p. 290-302 |
artikel |
|
| 1957 | On a conjecture on the order of cages with a given girth pair |
Balbuena, C. |
2015 |
96-97 | Index 1 |
p. 24-33 10 p. |
artikel |
|
| 1958 | On a connection between the Pascal, Stirling and Vandermonde matrices |
Yang, Sheng-Liang |
2007 |
96-97 | Index 1 |
p. 2025-2030 6 p. |
artikel |
|
| 1959 | On acyclic conjugated molecules with minimal energies |
Zhang, Fuji |
1999 |
96-97 | Index 1 |
p. 71-84 14 p. |
artikel |
|
| 1960 | On a Diagonal Conjecture for classical Ramsey numbers |
Liang, Meilian |
2019 |
96-97 | Index 1 |
p. 195-200 |
artikel |
|
| 1961 | On a directed variation of the 1-2-3 and 1-2 Conjectures |
Barme, Emma |
2017 |
96-97 | Index 1 |
p. 123-131 9 p. |
artikel |
|
| 1962 | On a distance-constrained graph labeling to model cooperation |
Georges, J.P. |
|
96-97 | Index 1 |
p. 17-31 |
artikel |
|
| 1963 | On a generalized model of labeled graphs |
Kozak, Adam |
2013 |
96-97 | Index 1 |
p. 1818-1827 10 p. |
artikel |
|
| 1964 | On a group testing problem: Characterization of graphs with 2-complexity c 2 and maximum number of edges |
Gerzen, Tatjana |
2011 |
96-97 | Index 1 |
p. 2058-2068 11 p. |
artikel |
|
| 1965 | On a kind of restricted edge connectivity of graphs |
Meng, Jixiang |
2002 |
96-97 | Index 1 |
p. 183-193 11 p. |
artikel |
|
| 1966 | On algorithmic complexity of double Roman domination |
Poureidi, Abolfazl |
|
96-97 | Index 1 |
p. 539-551 |
artikel |
|
| 1967 | On almost bipartite non-König–Egerváry graphs |
Levit, Vadim E. |
|
96-97 | Index 1 |
p. 127-134 |
artikel |
|
| 1968 | On an application of convexity to discrete systems |
Poljak, Svatopluk |
1986 |
96-97 | Index 1 |
p. 27-32 6 p. |
artikel |
|
| 1969 | On an edge ranking problem of trees and graphs |
Iyer, Ananth.V. |
1991 |
96-97 | Index 1 |
p. 43-52 10 p. |
artikel |
|
| 1970 | On a new code, [ 2 n − 1 , n , 2 n − 1 ] |
Basu, M. |
2009 |
96-97 | Index 1 |
p. 402-405 4 p. |
artikel |
|
| 1971 | On a new cyclicity measure of graphs—The global cyclicity index |
Yang, Yujun |
2014 |
96-97 | Index 1 |
p. 88-97 10 p. |
artikel |
|
| 1972 | On an extremal hypergraph problem related to combinatorial batch codes |
Balachandran, Niranjan |
2014 |
96-97 | Index 1 |
p. 373-380 8 p. |
artikel |
|
| 1973 | On an extremal problem concerning the interval number of a graph |
Andreae, Thomas |
1986 |
96-97 | Index 1 |
p. 1-9 9 p. |
artikel |
|
| 1974 | On approximability of linear ordering and related NP-optimization problems on graphs |
Mishra, Sounaka |
2004 |
96-97 | Index 1 |
p. 249-269 21 p. |
artikel |
|
| 1975 | On approximating the d -girth of a graph |
Peleg, David |
2013 |
96-97 | Index 1 |
p. 2587-2596 10 p. |
artikel |
|
| 1976 | On approximating the Incremental Knapsack Problem |
Della Croce, Federico |
2019 |
96-97 | Index 1 |
p. 26-42 |
artikel |
|
| 1977 | On a problem of Erdős, Herzog and Schönheim |
Chen, Yong-Gao |
2012 |
96-97 | Index 1 |
p. 1501-1506 6 p. |
artikel |
|
| 1978 | On a relation between the atom-bond connectivity and the first geometric–arithmetic indices |
Zhong, Lingping |
2015 |
96-97 | Index 1 |
p. 249-253 5 p. |
artikel |
|
| 1979 | On a variant of Flory model |
Došlić, Tomislav |
|
96-97 | Index 1 |
p. 269-292 |
artikel |
|
| 1980 | On average connectivity of the strong product of graphs |
Abajo, E. |
2013 |
96-97 | Index 1 |
p. 2795-2801 7 p. |
artikel |
|
| 1981 | On average distance in tournaments and Eulerian digraphs |
Dankelmann, Peter |
2019 |
96-97 | Index 1 |
p. 38-47 |
artikel |
|
| 1982 | On bandwidth for the tensor product of paths and cycles |
Yung-Ling, Lai |
1997 |
96-97 | Index 1 |
p. 133-141 9 p. |
artikel |
|
| 1983 | On basic forbidden patterns of functions |
Elizalde, Sergi |
2011 |
96-97 | Index 1 |
p. 1207-1216 10 p. |
artikel |
|
| 1984 | On b -coloring of powers of hypercubes |
Francis, P. |
2017 |
96-97 | Index 1 |
p. 74-86 13 p. |
artikel |
|
| 1985 | On b -colorings in regular graphs |
Blidia, Mostafa |
2009 |
96-97 | Index 1 |
p. 1787-1793 7 p. |
artikel |
|
| 1986 | On b-greedy colourings and z-colourings |
Costa Ferreira da Silva, Jonas |
|
96-97 | Index 1 |
p. 250-268 |
artikel |
|
| 1987 | On bipartite graphs with minimal energy |
Li, Xueliang |
2009 |
96-97 | Index 1 |
p. 869-873 5 p. |
artikel |
|
| 1988 | On blockers and transversals of maximum independent sets in co-comparability graphs |
Lucke, Felicia |
|
96-97 | Index 1 |
p. 307-321 |
artikel |
|
| 1989 | On bounding the difference between the maximum degree and the chromatic number by a constant |
Weil, Vera |
2017 |
96-97 | Index 1 |
p. 228-234 7 p. |
artikel |
|
| 1990 | On broadcasting multiple messages in a d-dimensional grid |
Roditty, Y. |
1997 |
96-97 | Index 1 |
p. 277-284 8 p. |
artikel |
|
| 1991 | On card guessing game with one time riffle shuffle and complete feedback |
Liu, Pengda |
|
96-97 | Index 1 |
p. 270-278 |
artikel |
|
| 1992 | On CD-chromatic number and its lower bound in some classes of graphs |
M.A., Shalu |
|
96-97 | Index 1 |
p. 202-210 |
artikel |
|
| 1993 | On certain classes of fractional matchings |
Mühlbacher, J.R. |
1984 |
96-97 | Index 1 |
p. 235-244 10 p. |
artikel |
|
| 1994 | On chains of 3-connected matroids |
Bixby, Robert E. |
1986 |
96-97 | Index 1 |
p. 155-166 12 p. |
artikel |
|
| 1995 | On characterizing the critical graphs for matching Ramsey numbers |
Xu, Chuandong |
|
96-97 | Index 1 |
p. 15-20 |
artikel |
|
| 1996 | On ( 3 , 1 ) ∗ -choosability of planar graphs without adjacent short cycles |
Chen, Min |
2014 |
96-97 | Index 1 |
p. 159-166 8 p. |
artikel |
|
| 1997 | On chordal phylogeny graphs |
Eoh, Soogang |
|
96-97 | Index 1 |
p. 80-91 |
artikel |
|
| 1998 | On classes of minimal circular-imperfect graphs |
Pêcher, Arnaud |
2008 |
96-97 | Index 1 |
p. 998-1010 13 p. |
artikel |
|
| 1999 | On claw-free graphs with all but four eigenvalues equal to 0 or − 1 |
Sun, Shaowei |
|
96-97 | Index 1 |
p. 71-84 |
artikel |
|
| 2000 | On color-critical ( P 5 ,co- P 5 )-free graphs |
Dhaliwal, Harjinder S. |
2017 |
96-97 | Index 1 |
p. 142-148 7 p. |
artikel |
3648 gevonden resultaten
| << vorige | volgende >> |