| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1001 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1002 |
Contents
|
|
|
2018
|
96-97 |
C |
p. v-vi
|
artikel
|
| 1003 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1004 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1005 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1006 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1007 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1008 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1009 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1010 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1011 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1012 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1013 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1014 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1015 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1016 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1017 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1018 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1019 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1020 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1021 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1022 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1023 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1024 |
Contents
|
|
|
|
96-97 |
C |
p. v
|
artikel
|
| 1025 |
Continuous time quantum walks on graphs: Group state transfer
|
Brown, Luke C.
|
|
|
96-97 |
C |
p. 68-80
|
artikel
|
| 1026 |
Contraction obstructions for connected graph searching
|
Best, Micah J
|
|
2016
|
96-97 |
C |
p. 27-47
21 p.
|
artikel
|
| 1027 |
Convergence and correctness of belief propagation for weighted min–max flow
|
Dai, Guowei
|
|
|
96-97 |
C |
p. 122-130
|
artikel
|
| 1028 |
Convex dominating sets in maximal outerplanar graphs
|
Lemańska, Magdalena
|
|
2019
|
96-97 |
C |
p. 142-157
|
artikel
|
| 1029 |
Convex generalized flows
|
Holzhauser, Michael
|
|
2015
|
96-97 |
C |
p. 86-99
14 p.
|
artikel
|
| 1030 |
Convex hulls of superincreasing knapsacks and lexicographic orderings
|
Gupte, Akshay
|
|
2016
|
96-97 |
C |
p. 150-163
14 p.
|
artikel
|
| 1031 |
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels
|
Tarsissi, Lama
|
|
|
96-97 |
C |
p. 270-289
|
artikel
|
| 1032 |
Convex
(
0
,
1
)
-matrices and their epitopes
|
Brualdi, Richard A.
|
|
|
96-97 |
C |
p. 21-34
|
artikel
|
| 1033 |
Cooperative assignment games with the inverse Monge property
|
Martínez-de-Albéniz, F. Javier
|
|
2014
|
96-97 |
C |
p. 42-50
9 p.
|
artikel
|
| 1034 |
Cooperative games on simplicial complexes
|
Martino, Ivan
|
|
|
96-97 |
C |
p. 246-256
|
artikel
|
| 1035 |
Cooperative games with restricted formation of coalitions
|
Koshevoy, Gleb
|
|
2017
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 1036 |
Cooperative twin-crane scheduling
|
Briskorn, Dirk
|
|
2016
|
96-97 |
C |
p. 40-57
18 p.
|
artikel
|
| 1037 |
Coprime networks of the composite numbers: Pseudo-randomness and synchronizability
|
Miraj, Md Rahil
|
|
|
96-97 |
C |
p. 96-110
|
artikel
|
| 1038 |
Cops and an Insightful Robber
|
Huggan, Melissa A.
|
|
|
96-97 |
C |
p. 112-119
|
artikel
|
| 1039 |
Cops and attacking robbers with cycle constraints
|
Clow, Alexander
|
|
|
96-97 |
C |
p. 327-342
|
artikel
|
| 1040 |
Cops and Robber on butterflies, grids, and AT-free graphs
|
Akhtar, Sheikh Shakil
|
|
|
96-97 |
C |
p. 231-245
|
artikel
|
| 1041 |
Cops that surround a robber
|
Burgess, Andrea C.
|
|
|
96-97 |
C |
p. 552-566
|
artikel
|
| 1042 |
4-cop-win graphs have at least 19 vertices
|
Turcotte, Jérémie
|
|
|
96-97 |
C |
p. 74-98
|
artikel
|
| 1043 |
Core-based criterion for extreme supermodular functions
|
Studený, Milan
|
|
2016
|
96-97 |
C |
p. 122-151
30 p.
|
artikel
|
| 1044 |
Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
|
Araki, Toru
|
|
|
96-97 |
C |
p. 139-144
|
artikel
|
| 1045 |
Correction of the paper “Bicyclic graphs with extremal values of PI index”
|
Ma, Gang
|
|
2016
|
96-97 |
C |
p. 132-133
2 p.
|
artikel
|
| 1046 |
Correction to “On the distance Laplacian spectral radius of bipartite graphs” [Discrete Appl. Math. 186 (2015) 207–213]
|
Niu, Aihong
|
|
2016
|
96-97 |
C |
p. 137-140
4 p.
|
artikel
|
| 1047 |
Correction to the paper: Patterson–Wiedemann construction revisited
|
Kavut, Selçuk
|
|
2016
|
96-97 |
C |
p. 185-187
3 p.
|
artikel
|
| 1048 |
Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs
|
Cambie, Stijn
|
|
|
96-97 |
C |
p. 139-142
|
artikel
|
| 1049 |
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]
|
Ausserhofer, Markus
|
|
|
96-97 |
C |
p. 222-226
|
artikel
|
| 1050 |
Corrigendum to “Characterization of polynomially complete quasigroups based on latin squares for cryptographic transformations” [Discrete Appl. Math. 200 (2016) 5–17]
|
Artamonov, V.A.
|
|
2017
|
96-97 |
C |
p. 222-
1 p.
|
artikel
|
| 1051 |
Corrigendum to “On maximum graphs in Tutte polynomial posets” [Discrete Appl. Math. 339 (2023) 78–88]
|
Kahl, Nathan
|
|
|
96-97 |
C |
p. 276-277
|
artikel
|
| 1052 |
Corrigendum to “On strongly regular signed graphs” [Discrete Applied Mathematics 271 (2019) 184–190]
|
Stanić, Zoran
|
|
|
96-97 |
C |
p. 640
|
artikel
|
| 1053 |
Corrigendum to “Polar cographs” [Discrete Appl. Math. 156 (2008) 1652–1660]
|
Ekim, T.
|
|
2014
|
96-97 |
C |
p. 158-
1 p.
|
artikel
|
| 1054 |
Corrigendum to “The distance spectral radius of digraphs”: [Discrete Appl. Math. 161 (2013) 2537–2543]
|
Lin, Huiqiu
|
|
2015
|
96-97 |
C |
p. 51-52
2 p.
|
artikel
|
| 1055 |
Corrigendum to “The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions” [Discrete Appl. Math. 297 (2021) 60–70]
|
Su, Sihong
|
|
|
96-97 |
C |
p. 323
|
artikel
|
| 1056 |
Corrigendum to “Transit functions and pyramid-like binary clustering systems” [Discrete Appl. Math. 357 (2024) 365–384]
|
Changat, Manoj
|
|
|
96-97 |
C |
p. 280
|
artikel
|
| 1057 |
Cost-performance tradeoffs for interconnection networks
|
Kruskal, Clyde P
|
|
1992
|
96-97 |
C |
p. 359-385
27 p.
|
artikel
|
| 1058 |
Co-TT graphs and a characterization of split co-TT graphs
|
Golumbic, Martin Charles
|
|
2014
|
96-97 |
C |
p. 168-174
7 p.
|
artikel
|
| 1059 |
Coulson-type integral formulas for the general (skew) Estrada index of a vertex
|
Qiao, Lu
|
|
|
96-97 |
C |
p. 288-303
|
artikel
|
| 1060 |
Counterexamples to the conjecture on orientations of graphs with minimum Wiener index
|
Fang, Yibin
|
|
2017
|
96-97 |
C |
p. 213-220
|
artikel
|
| 1061 |
Counting and enumerating galled networks
|
Gunawan, Andreas D.M.
|
|
|
96-97 |
C |
p. 644-654
|
artikel
|
| 1062 |
Counting Candy Crush configurations
|
Hamilton, Adam
|
|
|
96-97 |
C |
p. 47-56
|
artikel
|
| 1063 |
Counting disjoint hypercubes in Fibonacci cubes
|
Saygı, Elif
|
|
2016
|
96-97 |
C |
p. 231-237
7 p.
|
artikel
|
| 1064 |
Counting graceful labelings of trees: A theoretical and empirical study
|
Anick, David
|
|
2016
|
96-97 |
C |
p. 65-81
17 p.
|
artikel
|
| 1065 |
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
|
Lin, Min-Sheng
|
|
2018
|
96-97 |
C |
p. 236-244
|
artikel
|
| 1066 |
Counting independent sets in a tolerance graph
|
Lin, Min-Sheng
|
|
2015
|
96-97 |
C |
p. 174-184
11 p.
|
artikel
|
| 1067 |
Counting independent sets in tree convex bipartite graphs
|
Lin, Min-Sheng
|
|
2017
|
96-97 |
C |
p. 113-122
10 p.
|
artikel
|
| 1068 |
Counting independent sets in tricyclic graphs
|
Poureidi, Abolfazl
|
|
|
96-97 |
C |
p. 138-146
|
artikel
|
| 1069 |
Counting inequivalent monotone Boolean functions
|
Stephen, Tamon
|
|
2014
|
96-97 |
C |
p. 15-24
10 p.
|
artikel
|
| 1070 |
Counting inversion sequences by parity successions and runs
|
Mansour, Toufik
|
|
|
96-97 |
C |
p. 24-39
|
artikel
|
| 1071 |
Counting kernels in directed graphs with arbitrary orientations
|
Jartoux, Bruno
|
|
|
96-97 |
C |
p. 62-73
|
artikel
|
| 1072 |
Counting Markov equivalence classes for DAG models on trees
|
Radhakrishnan, Adityanarayanan
|
|
2018
|
96-97 |
C |
p. 170-185
|
artikel
|
| 1073 |
Counting
4
×
4
matrix partitions of graphs
|
Dyer, Martin
|
|
2016
|
96-97 |
C |
p. 76-92
17 p.
|
artikel
|
| 1074 |
Counting maximal independent sets in some
n
-gonal cacti
|
Klamsakul, Natawat
|
|
|
96-97 |
C |
p. 234-280
|
artikel
|
| 1075 |
Counting phylogenetic networks with few reticulation vertices: A second approach
|
Fuchs, Michael
|
|
|
96-97 |
C |
p. 140-149
|
artikel
|
| 1076 |
Counting rotation symmetric functions using Polya’s theorem
|
K.V., Lakshmy
|
|
2014
|
96-97 |
C |
p. 162-167
6 p.
|
artikel
|
| 1077 |
Counting
r
×
s
rectangles in (Catalan) words
|
Fried, Sela
|
|
|
96-97 |
C |
p. 247-259
|
artikel
|
| 1078 |
Counting spanning trees of (1,
N
)-periodic graphs
|
Zhang, Jingyuan
|
|
|
96-97 |
C |
p. 88-101
|
artikel
|
| 1079 |
Counting the minimum number of arcs in an oriented graph having weak diameter 2
|
Das, Sandip
|
|
|
96-97 |
C |
p. 222-236
|
artikel
|
| 1080 |
Counting the number of non-equivalent vertex colorings of a graph
|
Hertz, Alain
|
|
2016
|
96-97 |
C |
p. 62-71
10 p.
|
artikel
|
| 1081 |
Coupled task scheduling with convex resource consumption functions
|
Mosheiov, Gur
|
|
|
96-97 |
C |
p. 128-133
|
artikel
|
| 1082 |
2-coupon coloring of cubic graphs containing 3-cycle or 4-cycle
|
Akbari, S.
|
|
|
96-97 |
C |
p. 105-110
|
artikel
|
| 1083 |
Covering and packing of triangles intersecting a straight line
|
Pandit, Supantha
|
|
|
96-97 |
C |
p. 92-110
|
artikel
|
| 1084 |
Covering automorphisms and some eigenvalues of a graph
|
Rosenfeld, Vladimir R.
|
|
|
96-97 |
C |
p. 25-30
|
artikel
|
| 1085 |
Covering Italian domination in graphs
|
Khodkar, Abdollah
|
|
|
96-97 |
C |
p. 324-331
|
artikel
|
| 1086 |
Coverings of planar and three-dimensional sets with subsets of smaller diameter
|
Tolmachev, A.D.
|
|
|
96-97 |
C |
p. 270-281
|
artikel
|
| 1087 |
CPG graphs: Some structural and hardness results
|
Champseix, Nicolas
|
|
|
96-97 |
C |
p. 17-35
|
artikel
|
| 1088 |
Critical and maximum independent sets of a graph
|
Jarden, Adi
|
|
|
96-97 |
C |
p. 127-134
|
artikel
|
| 1089 |
Critical independent sets of König–Egerváry graphs
|
Yang, Zixuan
|
|
|
96-97 |
C |
p. 1-5
|
artikel
|
| 1090 |
Critical
(
P
6
,
b
a
n
n
e
r
)
-free graphs
|
Huang, Shenwei
|
|
2019
|
96-97 |
C |
p. 143-151
|
artikel
|
| 1091 |
Critical (
P
5
, bull)-free graphs
|
Huang, Shenwei
|
|
|
96-97 |
C |
p. 15-25
|
artikel
|
| 1092 |
Critical
(
P
5
,
d
a
r
t
)
-free graphs
|
Xia, Wen
|
|
|
96-97 |
C |
p. 44-52
|
artikel
|
| 1093 |
Critical vertices and edges in
H
-free graphs
|
Paulusma, Daniël
|
|
2019
|
96-97 |
C |
p. 361-367
|
artikel
|
| 1094 |
Cross–series–parallel digraphs
|
Dornemann, Jorin
|
|
|
96-97 |
C |
p. 57-65
|
artikel
|
| 1095 |
Cryptanalysis of stream cipher LIZARD using division property and MILP based cube attack
|
Karthika, S.K.
|
|
|
96-97 |
C |
p. 63-78
|
artikel
|
| 1096 |
Cryptographic properties of the hidden weighted bit function
|
Wang, Qichun
|
|
2014
|
96-97 |
C |
p. 1-10
10 p.
|
artikel
|
| 1097 |
Cryptography and Future Security
|
Kim, Jongsung
|
|
2018
|
96-97 |
C |
p. 1
|
artikel
|
| 1098 |
Cube-connected circulants: Bisection width, Wiener and forwarding indices
|
Mokhtar, Hamid
|
|
|
96-97 |
C |
p. 48-68
|
artikel
|
| 1099 |
Cube-free resonance graphs
|
Che, Zhongyuan
|
|
|
96-97 |
C |
p. 262-268
|
artikel
|
| 1100 |
Cubic and quartic net-regular strongly regular signed graphs
|
Anđelić, Milica
|
|
|
96-97 |
C |
p. 216-225
|
artikel
|
| 1101 |
Cubic vertices of minimal bicritical graphs
|
Guo, Jing
|
|
|
96-97 |
C |
p. 44-48
|
artikel
|
| 1102 |
Cutoff phenomenon for random walks on Kneser graphs
|
Pourmiri, Ali
|
|
|
96-97 |
C |
p. 100-106
|
artikel
|
| 1103 |
Cutting out polygon collections with a saw
|
Dumitrescu, Adrian
|
|
2017
|
96-97 |
C |
p. 98-108
11 p.
|
artikel
|
| 1104 |
Cyclability in graph classes
|
Crespelle, Christophe
|
|
|
96-97 |
C |
p. 147-178
|
artikel
|
| 1105 |
Cycle energy and its size dependence
|
Gutman, Ivan
|
|
|
96-97 |
C |
p. 534-537
|
artikel
|
| 1106 |
Cycle intersection in spanning trees: A shorter proof of a conjecture and applications
|
De Caria Di Fonzo, Pablo
|
|
|
96-97 |
C |
p. 10-14
|
artikel
|
| 1107 |
Cycle Kronecker products that are representable as optimal circulants
|
Jha, Pranava K.
|
|
2015
|
96-97 |
C |
p. 130-138
9 p.
|
artikel
|
| 1108 |
Cycle selections
|
Baratto, Marie
|
|
|
96-97 |
C |
p. 4-24
|
artikel
|
| 1109 |
Cycles embedding in balanced hypercubes with faulty edges and vertices
|
Cheng, Dongqin
|
|
2018
|
96-97 |
C |
p. 56-69
|
artikel
|
| 1110 |
Cycles embedding in folded hypercubes under the conditional fault model
|
Cheng, Dongqin
|
|
2017
|
96-97 |
C |
p. 60-68
9 p.
|
artikel
|
| 1111 |
Cycles embedding in folded hypercubes with conditionally faulty vertices
|
Kuo, Che-Nan
|
|
2017
|
96-97 |
C |
p. 55-59
5 p.
|
artikel
|
| 1112 |
Cycles in complementary prisms
|
Meierling, Dirk
|
|
2015
|
96-97 |
C |
p. 180-186
7 p.
|
artikel
|
| 1113 |
Cycles in cube-connected cycles graphs
|
Hsu, Lih-Hsing
|
|
2014
|
96-97 |
C |
p. 163-171
9 p.
|
artikel
|
| 1114 |
Cycles in the burnt pancake graph
|
Blanco, Saúl A.
|
|
2019
|
96-97 |
C |
p. 1-14
|
artikel
|
| 1115 |
Cyclic base ordering of certain degenerate graphs
|
Gu, Xiaofeng
|
|
|
96-97 |
C |
p. 148-156
|
artikel
|
| 1116 |
Cyclic deficiency of graphs
|
Asratian, Armen S.
|
|
2019
|
96-97 |
C |
p. 171-185
|
artikel
|
| 1117 |
Cyclic edge and cyclic vertex connectivity of
(
4
,
5
,
6
)
-fullerene graphs
|
Liang, Jun
|
|
|
96-97 |
C |
p. 94-104
|
artikel
|
| 1118 |
Deciding the existence of a cherry-picking sequence is hard on two trees
|
Döcker, Janosch
|
|
2019
|
96-97 |
C |
p. 131-143
|
artikel
|
| 1119 |
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
|
Brignall, Robert
|
|
2019
|
96-97 |
C |
p. 60-66
|
artikel
|
| 1120 |
Decision trees based on 1-consequences
|
Moshkov, Mikhail
|
|
|
96-97 |
C |
p. 208-214
|
artikel
|
| 1121 |
Decision trees with minimum average depth for sorting eight elements
|
AbouEisha, Hassan
|
|
2016
|
96-97 |
C |
p. 203-207
5 p.
|
artikel
|
| 1122 |
Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture
|
Bensmail, Julien
|
|
2019
|
96-97 |
C |
p. 1-9
|
artikel
|
| 1123 |
Decomposing a graph into shortest paths with bounded eccentricity
|
Birmelé, Etienne
|
|
|
96-97 |
C |
p. 353-374
|
artikel
|
| 1124 |
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
|
Huang, Ziwen
|
|
2019
|
96-97 |
C |
p. 112-118
|
artikel
|
| 1125 |
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
|
Aboomahigir, Elham
|
|
|
96-97 |
C |
p. 52-55
|
artikel
|
| 1126 |
Decomposing clique search problems into smaller instances based on node and edge colorings
|
Szabó, Sándor
|
|
2018
|
96-97 |
C |
p. 118-129
|
artikel
|
| 1127 |
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
|
Asratian, Armen S.
|
|
|
96-97 |
C |
p. 25-35
|
artikel
|
| 1128 |
Decomposing highly connected graphs into paths of length five
|
Botler, F.
|
|
2018
|
96-97 |
C |
p. 128-138
|
artikel
|
| 1129 |
Decomposing split graphs into locally irregular graphs
|
Lintzmayer, C.N.
|
|
|
96-97 |
C |
p. 33-44
|
artikel
|
| 1130 |
Decomposing the feasibility of Clustered Spanning Tree by Paths
|
Guttmann-Beck, Nili
|
|
|
96-97 |
C |
p. 160-180
|
artikel
|
| 1131 |
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
|
Korenblit, M.
|
|
2017
|
96-97 |
C |
p. 60-72
13 p.
|
artikel
|
| 1132 |
Decomposition of circulant digraphs with two jumps into cycles of equal lengths
|
Bogdanowicz, Zbigniew R.
|
|
2015
|
96-97 |
C |
p. 45-51
7 p.
|
artikel
|
| 1133 |
Decomposition of graphs with constraint on minimum degree
|
Qin, Xiang
|
|
|
96-97 |
C |
p. 64-71
|
artikel
|
| 1134 |
Decomposition of planar graphs with forbidden configurations
|
Li, Lingxi
|
|
|
96-97 |
C |
p. 147-158
|
artikel
|
| 1135 |
Decompositions of graphs based on a new graph product
|
Boode, Antoon H.
|
|
2019
|
96-97 |
C |
p. 31-40
|
artikel
|
| 1136 |
Decomposition theorem on matchable distributive lattices
|
Zhang, Heping
|
|
2014
|
96-97 |
C |
p. 239-248
10 p.
|
artikel
|
| 1137 |
Decomposition theorems for square-free
2
-matchings in bipartite graphs
|
Takazawa, Kenjiro
|
|
2017
|
96-97 |
C |
p. 215-223
9 p.
|
artikel
|
| 1138 |
Decycling bubble sort graphs
|
Wang, Jian
|
|
2015
|
96-97 |
C |
p. 178-182
5 p.
|
artikel
|
| 1139 |
Defect of an octahedron in a rational lattice
|
Fadin, Mikhail
|
|
|
96-97 |
C |
p. 37-43
|
artikel
|
| 1140 |
Defensive alliances in graphs of bounded treewidth
|
Bliem, Bernhard
|
|
2018
|
96-97 |
C |
p. 334-339
|
artikel
|
| 1141 |
Defensive domination in proper interval graphs
|
Ekim, Tınaz
|
|
|
96-97 |
C |
p. 59-69
|
artikel
|
| 1142 |
Defining binary phylogenetic trees using parsimony: New bounds
|
Wilde, Mirko
|
|
|
96-97 |
C |
p. 257-269
|
artikel
|
| 1143 |
Degenerate drawing of outerplanar graphs with two edge lengths
|
Kim, Chol-Un
|
|
|
96-97 |
C |
p. 178-188
|
artikel
|
| 1144 |
Degenerate matchings and edge colorings
|
Baste, Julien
|
|
2018
|
96-97 |
C |
p. 38-44
|
artikel
|
| 1145 |
Degree and distance based topological descriptors of power graphs of finite non-abelian groups
|
Ali, Fawad
|
|
|
96-97 |
C |
p. 62-76
|
artikel
|
| 1146 |
Degree-based function index for graphs with given diameter
|
Vetrík, Tomáš
|
|
|
96-97 |
C |
p. 59-70
|
artikel
|
| 1147 |
Degree conditions for graphs to be maximally
k
-restricted edge connected and super
k
-restricted edge connected
|
Wang, Shiying
|
|
2015
|
96-97 |
C |
p. 258-263
6 p.
|
artikel
|
| 1148 |
Degree diameter problem on honeycomb networks
|
Holub, Přemysl
|
|
2014
|
96-97 |
C |
p. 139-151
13 p.
|
artikel
|
| 1149 |
Degree sequence conditions for a graph to be disjoint path coverable
|
Sabir, Eminjan
|
|
|
96-97 |
C |
p. 62-69
|
artikel
|
| 1150 |
Degree sequence realizations with given packing and covering of spanning trees
|
Liu, Fengxia
|
|
2015
|
96-97 |
C |
p. 113-118
6 p.
|
artikel
|
| 1151 |
Degree sequences for k-regulable ribbon realizations
|
Guo, Xia
|
|
|
96-97 |
C |
p. 50-65
|
artikel
|
| 1152 |
Degree sum and graph linkage with prescribed path lengths
|
Coll, Vincent E.
|
|
2019
|
96-97 |
C |
p. 85-94
|
artikel
|
| 1153 |
Degree sum condition for vertex-disjoint triangles and pentagons
|
Wang, Maoqun
|
|
|
96-97 |
C |
p. 88-95
|
artikel
|
| 1154 |
Degree sums and proper connection number of graphs
|
Wu, Yueyu
|
|
|
96-97 |
C |
p. 360-367
|
artikel
|
| 1155 |
Delta–wye reduction of almost-planar graphs
|
Wagner, Donald K.
|
|
2015
|
96-97 |
C |
p. 158-167
10 p.
|
artikel
|
| 1156 |
Dembowski–Ostrom polynomials and reversed Dickson polynomials
|
Fernando, Neranga
|
|
|
96-97 |
C |
p. 66-79
|
artikel
|
| 1157 |
Dense bipartite circulants and their routing via rectangular twisted torus
|
Jha, Pranava K.
|
|
2014
|
96-97 |
C |
p. 141-158
18 p.
|
artikel
|
| 1158 |
Dense group networks
|
Campbell, Lowell
|
|
1992
|
96-97 |
C |
p. 65-71
7 p.
|
artikel
|
| 1159 |
Dense on-line arbitrarily partitionable graphs
|
Kalinowski, Rafał
|
|
2017
|
96-97 |
C |
p. 71-77
7 p.
|
artikel
|
| 1160 |
Dense subgraphs in random graphs
|
Balister, Paul
|
|
2019
|
96-97 |
C |
p. 66-74
|
artikel
|
| 1161 |
Descent generating polynomials for (
n
−
3
)- and (
n
−
4
)-stack-sortable (pattern-avoiding) permutations
|
Zhang, Philip B.
|
|
|
96-97 |
C |
p. 1-14
|
artikel
|
| 1162 |
Design and analysis of fault-tolerant multibus interconnection networks
|
Camarda, Pietro
|
|
1992
|
96-97 |
C |
p. 45-64
20 p.
|
artikel
|
| 1163 |
Destroying longest cycles in graphs and digraphs
|
van Aardt, Susan A.
|
|
2015
|
96-97 |
C |
p. 251-259
9 p.
|
artikel
|
| 1164 |
Detecting and enumerating small induced subgraphs in
c
-closed graphs
|
Koana, Tomohiro
|
|
|
96-97 |
C |
p. 198-207
|
artikel
|
| 1165 |
Determining equitable total chromatic number for infinite classes of complete
r
-partite graphs
|
da Silva, A.G.
|
|
|
96-97 |
C |
p. 56-67
|
artikel
|
| 1166 |
Determining some graph joins by the signless Laplacian spectrum
|
Ye, Jiachang
|
|
|
96-97 |
C |
p. 17-24
|
artikel
|
| 1167 |
Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs
|
Lozovanu, Dmitrii
|
|
2015
|
96-97 |
C |
p. 169-180
12 p.
|
artikel
|
| 1168 |
Deterministic construction of compressed sensing matrices from constant dimension codes
|
Wang, Gang
|
|
|
96-97 |
C |
p. 9-17
|
artikel
|
| 1169 |
Deterministic distributed construction of
T
-dominating sets in time
T
|
Miller, Avery
|
|
2017
|
96-97 |
C |
p. 172-178
7 p.
|
artikel
|
| 1170 |
Deterministic parameterized algorithms for the Graph Motif problem
|
Pinter, Ron Y.
|
|
2016
|
96-97 |
C |
p. 162-178
17 p.
|
artikel
|
| 1171 |
Deterministic walks with choice
|
Beeler, Katy E.
|
|
2014
|
96-97 |
C |
p. 100-107
8 p.
|
artikel
|
| 1172 |
Detour trees
|
Jobson, Adam S.
|
|
2016
|
96-97 |
C |
p. 73-80
8 p.
|
artikel
|
| 1173 |
3D geo-graphs: Efficient flip verification for the spherical zoning problem
|
Ludden, Ian G.
|
|
|
96-97 |
C |
p. 329-346
|
artikel
|
| 1174 |
Diagnosis of constant faults in iteration-free circuits over monotone basis
|
Alrawaf, Saad
|
|
2014
|
96-97 |
C |
p. 287-291
5 p.
|
artikel
|
| 1175 |
Diagnosis of constant faults in read-once contact networks over finite bases
|
Busbait, Monther
|
|
2015
|
96-97 |
C |
p. 76-88
13 p.
|
artikel
|
| 1176 |
Diagonal flips in plane graphs with triangular and quadrangular faces
|
Matsumoto, Naoki
|
|
|
96-97 |
C |
p. 292-305
|
artikel
|
| 1177 |
Diameters of Cayley graphs generated by transposition trees
|
Kraft, Benjamin
|
|
2015
|
96-97 |
C |
p. 178-188
11 p.
|
artikel
|
| 1178 |
Diameters of cubic graphs
|
Jørgensen, Leif K.
|
|
1992
|
96-97 |
C |
p. 347-351
5 p.
|
artikel
|
| 1179 |
Diametral broadcast graphs
|
Grigoryan, Hayk
|
|
2014
|
96-97 |
C |
p. 53-59
7 p.
|
artikel
|
| 1180 |
Dichotomizing
k
-vertex-critical
H
-free graphs for
H
of order four
|
Cameron, Ben
|
|
|
96-97 |
C |
p. 106-115
|
artikel
|
| 1181 |
Diclique digraphs
|
Gutierrez, Marisa
|
|
|
96-97 |
C |
p. 197-210
|
artikel
|
| 1182 |
Differentially private response mechanisms on categorical data
|
Holohan, Naoise
|
|
2016
|
96-97 |
C |
p. 86-98
13 p.
|
artikel
|
| 1183 |
Differential property of Present-like structure
|
Hong, Deukjo
|
|
2018
|
96-97 |
C |
p. 13-24
|
artikel
|
| 1184 |
Diffuse reflection diameter in simple polygons
|
Barequet, Gill
|
|
2016
|
96-97 |
C |
p. 123-132
|
artikel
|
| 1185 |
Digraphs of bounded elimination width
|
Fernau, Henning
|
|
2014
|
96-97 |
C |
p. 78-87
10 p.
|
artikel
|
| 1186 |
Digraphs whose
m
-step competition graphs are trees
|
Choi, Myungho
|
|
|
96-97 |
C |
p. 234-246
|
artikel
|
| 1187 |
Digraph width measures in parameterized algorithmics
|
Ganian, Robert
|
|
2014
|
96-97 |
C |
p. 88-107
20 p.
|
artikel
|
| 1188 |
Dijkstra graphs
|
Bento, Lucila M.S.
|
|
2019
|
96-97 |
C |
p. 52-62
|
artikel
|
| 1189 |
[
1
,
2
]
-dimension of graphs
|
Chang, Fei-Huang
|
|
|
96-97 |
C |
p. 232-245
|
artikel
|
| 1190 |
Dips at small sizes for topological graph obstruction sets
|
Kim, Hyoungjun
|
|
|
96-97 |
C |
p. 139-166
|
artikel
|
| 1191 |
Directed cycle
k
-connectivity of complete digraphs and complete regular bipartite digraphs
|
Wang, Chuchu
|
|
|
96-97 |
C |
p. 203-213
|
artikel
|
| 1192 |
Directed elimination games
|
Engelmann, Viktor
|
|
2016
|
96-97 |
C |
p. 187-198
12 p.
|
artikel
|
| 1193 |
Directed weighted improper coloring for cellular channel allocation
|
Archetti, Claudia
|
|
2015
|
96-97 |
C |
p. 46-60
15 p.
|
artikel
|
| 1194 |
Direct merging of delta encoded files
|
Shapira, Dana
|
|
|
96-97 |
C |
p. 130-140
|
artikel
|
| 1195 |
Direct-optimal basis computation by means of the fusion of simplification rules
|
Rodríguez-Lorenzo, Estrella
|
|
2018
|
96-97 |
C |
p. 106-119
|
artikel
|
| 1196 |
Discounted tree solutions
|
Béal, Sylvain
|
|
2017
|
96-97 |
C |
p. 1-17
17 p.
|
artikel
|
| 1197 |
Discrepancy inequalities for directed graphs
|
Chung, Fan
|
|
|
96-97 |
C |
p. 30-42
|
artikel
|
| 1198 |
Discrepancy minimizing spectral clustering
|
Bolla, Marianna
|
|
2018
|
96-97 |
C |
p. 286-289
|
artikel
|
| 1199 |
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
|
Lin, Lan
|
|
|
96-97 |
C |
p. 201-214
|
artikel
|
| 1200 |
Discrete segments of
Z
3
constructed by synchronization of words
|
Provençal, Xavier
|
|
2015
|
96-97 |
C |
p. 102-117
16 p.
|
artikel
|
| 1201 |
Discrete Tomography determination of bounded sets in
Z
n
|
Brunetti, S.
|
|
2015
|
96-97 |
C |
p. 20-30
11 p.
|
artikel
|
| 1202 |
Discretization vertex orders in distance geometry
|
Cassioli, Andrea
|
|
2015
|
96-97 |
C |
p. 27-41
15 p.
|
artikel
|
| 1203 |
Disjoint cycles in graphs with restricted independence number
|
Molla, Theodore
|
|
|
96-97 |
C |
p. 95-105
|
artikel
|
| 1204 |
Disjoint Hamilton cycles in transposition graphs
|
Hussak, Walter
|
|
2016
|
96-97 |
C |
p. 56-64
9 p.
|
artikel
|
| 1205 |
Disjoint isolating sets and graphs with maximum isolation number
|
Boyer, Geoffrey
|
|
|
96-97 |
C |
p. 110-116
|
artikel
|
| 1206 |
Disjointness graphs of segments in
R
2
are almost all hamiltonian
|
Leaños, J.
|
|
|
96-97 |
C |
p. 168-173
|
artikel
|
| 1207 |
Dispersing points on intervals
|
Li, Shimin
|
|
2018
|
96-97 |
C |
p. 106-118
|
artikel
|
| 1208 |
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
|
Yang, Wei
|
|
|
96-97 |
C |
p. 99-102
|
artikel
|
| 1209 |
Disproofs of three conjectures on the power domination of graphs
|
Yang, Wei
|
|
|
96-97 |
C |
p. 62-64
|
artikel
|
| 1210 |
Disproofs of two conjectures on no hole anti-
n
-labeling of graphs
|
Wang, Fangxia
|
|
|
96-97 |
C |
p. 72-76
|
artikel
|
| 1211 |
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms
|
Manyem, Prabhu
|
|
2018
|
96-97 |
C |
p. 102-117
|
artikel
|
| 1212 |
Distance and distance signless Laplacian spread of connected graphs
|
You, Lihua
|
|
2017
|
96-97 |
C |
p. 140-147
8 p.
|
artikel
|
| 1213 |
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
|
Casablanca, Rocío M.
|
|
2019
|
96-97 |
C |
p. 105-117
|
artikel
|
| 1214 |
ℓ
-distance-balanced graphs
|
Miklavič, Štefko
|
|
2018
|
96-97 |
C |
p. 143-154
|
artikel
|
| 1215 |
2-distance coloring of planar graphs without 4, 6-cycles
|
Bu, Yuehua
|
|
|
96-97 |
C |
p. 135-143
|
artikel
|
| 1216 |
Distance-constrained labellings of Cartesian products of graphs
|
Lladó, Anna
|
|
|
96-97 |
C |
p. 375-383
|
artikel
|
| 1217 |
Distance domination, guarding and covering of maximal outerplanar graphs
|
Canales, Santiago
|
|
2015
|
96-97 |
C |
p. 41-49
9 p.
|
artikel
|
| 1218 |
Distance
k
-domination, distance
k
-guarding, and distance
k
-vertex cover of maximal outerplanar graphs
|
Alvarado, José D.
|
|
2015
|
96-97 |
C |
p. 154-159
6 p.
|
artikel
|
| 1219 |
Distance Laplacian spectra of graphs: A survey
|
Rather, Bilal Ahmad
|
|
|
96-97 |
C |
p. 136-195
|
artikel
|
| 1220 |
Distance magic graphs
G
×
C
n
|
Cichacz, Sylwia
|
|
2014
|
96-97 |
C |
p. 80-87
8 p.
|
artikel
|
| 1221 |
Distance measures for Interval Type-2 fuzzy numbers
|
Figueroa-García, Juan Carlos
|
|
2015
|
96-97 |
C |
p. 93-102
10 p.
|
artikel
|
| 1222 |
Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
|
Huang, Xueyi
|
|
|
96-97 |
C |
p. 95-108
|
artikel
|
| 1223 |
Distance restricted optimal pebbling in cycles
|
Shiue, Chin-Lin
|
|
|
96-97 |
C |
p. 125-133
|
artikel
|
| 1224 |
Distance restricted optimal pebbling in paths
|
Shiue, Chin-Lin
|
|
|
96-97 |
C |
p. 46-54
|
artikel
|
| 1225 |
Distances between sets based on set commonality
|
Horadam, K.J.
|
|
2014
|
96-97 |
C |
p. 310-314
5 p.
|
artikel
|
| 1226 |
Distances in graphs of girth 6 and generalised cages
|
Alochukwu, Alex
|
|
|
96-97 |
C |
p. 125-137
|
artikel
|
| 1227 |
Distant irregularity strength of graphs with bounded minimum degree
|
Przybyło, Jakub
|
|
2017
|
96-97 |
C |
p. 159-165
7 p.
|
artikel
|
| 1228 |
Distinct distances and arithmetic progressions
|
Dumitrescu, Adrian
|
|
2019
|
96-97 |
C |
p. 38-41
|
artikel
|
| 1229 |
Distinct spreads in vector spaces over finite fields
|
Lund, Ben
|
|
2018
|
96-97 |
C |
p. 154-158
|
artikel
|
| 1230 |
Distinguishing graphs via cycles
|
Klobas, Nina
|
|
|
96-97 |
C |
p. 74-98
|
artikel
|
| 1231 |
Distinguishing numbers and distinguishing indices of oriented graphs
|
Meslem, Kahina
|
|
|
96-97 |
C |
p. 330-342
|
artikel
|
| 1232 |
Distributed One-Pass Online AUC Maximization
|
Liu, Xin
|
|
|
96-97 |
C |
p. 322-336
|
artikel
|
| 1233 |
Distribution centers in graphs
|
Desormeaux, Wyatt J.
|
|
2018
|
96-97 |
C |
p. 186-193
|
artikel
|
| 1234 |
Distributions of statistics on separable permutations
|
Chen, Joanna N.
|
|
|
96-97 |
C |
p. 169-179
|
artikel
|
| 1235 |
Distributivity of a segmentation lattice
|
Pavlík, Jan
|
|
|
96-97 |
C |
p. 300-316
|
artikel
|
| 1236 |
Diverse data selection via combinatorial quasi-concavity of distance covariance: A polynomial time global minimax algorithm
|
Vepakomma, Praneeth
|
|
2019
|
96-97 |
C |
p. 182-191
|
artikel
|
| 1237 |
Diverse fair allocations: Complexity and algorithms
|
Mittal, Harshil
|
|
|
96-97 |
C |
p. 343-353
|
artikel
|
| 1238 |
Divisibility and coloring of some
P
5
-free graphs
|
Song, Jialei
|
|
|
96-97 |
C |
p. 144-151
|
artikel
|
| 1239 |
(
d
,
n
)
-packing colorings of infinite lattices
|
Korže, Danilo
|
|
2018
|
96-97 |
C |
p. 97-108
|
artikel
|
| 1240 |
Dominating and irredundant broadcasts in graphs
|
Mynhardt, C.M.
|
|
2017
|
96-97 |
C |
p. 80-90
11 p.
|
artikel
|
| 1241 |
Dominating induced matchings in
S
1
,
2
,
4
-free graphs
|
Brandstädt, Andreas
|
|
|
96-97 |
C |
p. 83-92
|
artikel
|
| 1242 |
Dominating maximal outerplane graphs and Hamiltonian plane triangulations
|
Plummer, Michael D.
|
|
|
96-97 |
C |
p. 162-167
|
artikel
|
| 1243 |
Dominating plane triangulations
|
Plummer, Michael D.
|
|
2016
|
96-97 |
C |
p. 175-182
8 p.
|
artikel
|
| 1244 |
Dominating sets reconfiguration under token sliding
|
Bonamy, Marthe
|
|
|
96-97 |
C |
p. 6-18
|
artikel
|
| 1245 |
Domination and convexity problems in the target set selection model
|
Araújo, Rafael
|
|
|
96-97 |
C |
p. 14-23
|
artikel
|
| 1246 |
Domination and dominator colorings in planar graphs with small diameter
|
Goddard, Wayne
|
|
|
96-97 |
C |
p. 80-92
|
artikel
|
| 1247 |
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
|
Çalışkan, Cafer
|
|
2019
|
96-97 |
C |
p. 15-24
|
artikel
|
| 1248 |
Domination and location in twin-free digraphs
|
Foucaud, Florent
|
|
|
96-97 |
C |
p. 42-52
|
artikel
|
| 1249 |
Domination and total domination in cubic graphs of large girth
|
Dantas, Simone
|
|
2014
|
96-97 |
C |
p. 128-132
5 p.
|
artikel
|
| 1250 |
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
|
Bazgan, Cristina
|
|
|
96-97 |
C |
p. 23-42
|
artikel
|
| 1251 |
Domination, coloring and stability in
P
5
-reducible graphs
|
Fouquet, Jean-Luc
|
|
2015
|
96-97 |
C |
p. 122-129
8 p.
|
artikel
|
| 1252 |
Domination cover rubbling
|
Beeler, Robert A.
|
|
2019
|
96-97 |
C |
p. 75-85
|
artikel
|
| 1253 |
Domination game on uniform hypergraphs
|
Bujtás, Csilla
|
|
2019
|
96-97 |
C |
p. 65-75
|
artikel
|
| 1254 |
Domination in direct products of complete graphs
|
Vemuri, Harish
|
|
|
96-97 |
C |
p. 473-482
|
artikel
|
| 1255 |
[
1
,
2
]
-domination in graphs
|
Yang, Xiaojing
|
|
2014
|
96-97 |
C |
p. 79-86
8 p.
|
artikel
|
| 1256 |
Domination in intersecting hypergraphs
|
Dong, Yanxia
|
|
2018
|
96-97 |
C |
p. 155-159
|
artikel
|
| 1257 |
Domination in some subclasses of bipartite graphs
|
Pandey, Arti
|
|
2019
|
96-97 |
C |
p. 51-66
|
artikel
|
| 1258 |
Domination number, independent domination number and
k
-independence number in trees
|
Cui, Qing
|
|
|
96-97 |
C |
p. 176-184
|
artikel
|
| 1259 |
Domination of maximal
K
4
-minor free graphs and maximal
K
2
,
3
-minor free graphs, and disproofs of two conjectures on planar graphs
|
Zhu, Tingting
|
|
2015
|
96-97 |
C |
p. 147-153
7 p.
|
artikel
|
| 1260 |
Domination parameters in hypertrees and sibling trees
|
Rajasingh, Indra
|
|
|
96-97 |
C |
p. 237-245
|
artikel
|
| 1261 |
Domination parameters with number
2
: Interrelations and algorithmic consequences
|
Bonomo, Flavia
|
|
2018
|
96-97 |
C |
p. 23-50
|
artikel
|
| 1262 |
Domination problems with no conflicts
|
Cornet, Alexis
|
|
2018
|
96-97 |
C |
p. 78-88
|
artikel
|
| 1263 |
Domination ratio of a family of integer distance digraphs with arbitrary degree
|
Huang, Jia
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 1264 |
Domination ratio of integer distance digraphs
|
Huang, Jia
|
|
2019
|
96-97 |
C |
p. 104-115
|
artikel
|
| 1265 |
Domination related parameters in the generalized lexicographic product of graphs
|
Samodivkin, Vladimir
|
|
|
96-97 |
C |
p. 77-84
|
artikel
|
| 1266 |
Domination versus disjunctive domination in trees
|
Henning, Michael A.
|
|
2015
|
96-97 |
C |
p. 171-177
7 p.
|
artikel
|
| 1267 |
Domination versus edge domination
|
Baste, Julien
|
|
|
96-97 |
C |
p. 343-349
|
artikel
|
| 1268 |
Domination versus edge domination on claw-free graphs
|
Civan, Yusuf
|
|
|
96-97 |
C |
p. 171-172
|
artikel
|
| 1269 |
Dot product dimension of unicyclic graphs
|
Bahrami, Mahin
|
|
|
96-97 |
C |
p. 196-213
|
artikel
|
| 1270 |
Dot product dimensions of graphs
|
Li, Bo-Jr
|
|
2014
|
96-97 |
C |
p. 159-163
5 p.
|
artikel
|
| 1271 |
Double domination in lexicographic product graphs
|
Cabrera Martínez, Abel
|
|
|
96-97 |
C |
p. 290-300
|
artikel
|
| 1272 |
Double domination in rooted product graphs
|
Cabrera-Martínez, Abel
|
|
|
96-97 |
C |
p. 127-135
|
artikel
|
| 1273 |
Double Roman domination
|
Beeler, Robert A.
|
|
2016
|
96-97 |
C |
p. 23-29
7 p.
|
artikel
|
| 1274 |
Double Roman domination number
|
V., Anu
|
|
2018
|
96-97 |
C |
p. 198-204
|
artikel
|
| 1275 |
Double Roman domination stability in graphs
|
Zhuang, Wei
|
|
|
96-97 |
C |
p. 254-263
|
artikel
|
| 1276 |
DP-4-colorability of planar graphs without adjacent cycles of given length
|
Liu, Runrun
|
|
|
96-97 |
C |
p. 245-251
|
artikel
|
| 1277 |
DP-3-coloring of planar graphs without certain cycles
|
Rao, Mengjiao
|
|
|
96-97 |
C |
p. 35-45
|
artikel
|
| 1278 |
Dual bounded generation: Polynomial, second-order cone and positive semidefinite matrix inequalities
|
Elbassioni, Khaled
|
|
|
96-97 |
C |
p. 173-188
|
artikel
|
| 1279 |
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations
|
Köppe, Matthias
|
|
|
96-97 |
C |
p. 84-106
|
artikel
|
| 1280 |
3D well-composed polyhedral complexes
|
Gonzalez-Diaz, Rocio
|
|
2015
|
96-97 |
C |
p. 59-77
19 p.
|
artikel
|
| 1281 |
3-dynamic coloring and list 3-dynamic coloring of
K
1
,
3
-free graphs
|
Li, Hao
|
|
2017
|
96-97 |
C |
p. 166-171
6 p.
|
artikel
|
| 1282 |
Dynamic coloring of graphs having no
K
5
minor
|
Kim, Younjin
|
|
2016
|
96-97 |
C |
p. 81-89
9 p.
|
artikel
|
| 1283 |
Dynamic coloring of IC-planar graphs
|
Hu, Xiaoxue
|
|
|
96-97 |
C |
p. 45-49
|
artikel
|
| 1284 |
Dynamic coloring parameters for graphs with given genus
|
Loeb, Sarah
|
|
2018
|
96-97 |
C |
p. 129-141
|
artikel
|
| 1285 |
Dynamic determination of variable sizes of chunks in a deduplication system
|
Hirsch, Michael
|
|
|
96-97 |
C |
p. 81-91
|
artikel
|
| 1286 |
Dynamic index and LZ factorization in compressed space
|
Nishimoto, Takaaki
|
|
|
96-97 |
C |
p. 116-129
|
artikel
|
| 1287 |
Dynamic monopolies for interval graphs with bounded thresholds
|
Bessy, Stéphane
|
|
2019
|
96-97 |
C |
p. 256-261
|
artikel
|
| 1288 |
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks
|
Khoshkhah, Kaveh
|
|
2014
|
96-97 |
C |
p. 81-89
9 p.
|
artikel
|
| 1289 |
Dynamic monopolies in two-way bootstrap percolation
|
Jeger, Clemens
|
|
2019
|
96-97 |
C |
p. 116-126
|
artikel
|
| 1290 |
Dynamic programming bi-criteria combinatorial optimization
|
Mankowski, Michal
|
|
|
96-97 |
C |
p. 513-533
|
artikel
|
| 1291 |
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
|
Nakamura, Satoshi
|
|
|
96-97 |
C |
p. 220-229
|
artikel
|
| 1292 |
Ear decomposition and induced even cycles
|
Peng, Dongmei
|
|
2019
|
96-97 |
C |
p. 161-166
|
artikel
|
| 1293 |
Easy computation of eccentricity approximating trees
|
Ducoffe, Guillaume
|
|
2019
|
96-97 |
C |
p. 267-271
|
artikel
|
| 1294 |
Eccentricity approximating trees
|
Dragan, Feodor F.
|
|
2017
|
96-97 |
C |
p. 142-156
|
artikel
|
| 1295 |
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
|
Cheng, Christine T.
|
|
2016
|
96-97 |
C |
p. 27-34
8 p.
|
artikel
|
| 1296 |
Eccentricity matrix of corona of two graphs
|
Pandey, Smrati
|
|
|
96-97 |
C |
p. 354-363
|
artikel
|
| 1297 |
Eccentricity spectral radius of
t
-clique trees with given diameter
|
Qiu, Zhengping
|
|
|
96-97 |
C |
p. 202-217
|
artikel
|
| 1298 |
Eccentricity sums in trees
|
Smith, Heather
|
|
2016
|
96-97 |
C |
p. 120-131
12 p.
|
artikel
|
| 1299 |
Edge addition and the change in Kemeny’s constant
|
Kirkland, Stephen
|
|
|
96-97 |
C |
p. 77-90
|
artikel
|
| 1300 |
Edge clique partition in
(
k
,
ℓ
)
-graphs
|
Jones, Átila A.
|
|
|
96-97 |
C |
p. 89-97
|
artikel
|
| 1301 |
Edge coloring of graphs of signed class 1 and 2
|
Janczewski, Robert
|
|
|
96-97 |
C |
p. 311-319
|
artikel
|
| 1302 |
Edge-coloring of plane multigraphs with many colors on facial cycles
|
Czap, Július
|
|
|
96-97 |
C |
p. 80-85
|
artikel
|
| 1303 |
Edge coloring of signed graphs
|
Zhang, Li
|
|
|
96-97 |
C |
p. 234-242
|
artikel
|
| 1304 |
Edge-colouring graphs with bounded local degree sums
|
Zatesko, L.M.
|
|
|
96-97 |
C |
p. 268-283
|
artikel
|
| 1305 |
Edge consecutive gracefulness of a graph
|
Pereira, Jessica
|
|
|
96-97 |
C |
p. 214-220
|
artikel
|
| 1306 |
Edge construction of molecular NSSDs
|
Farrugia, Alexander
|
|
2019
|
96-97 |
C |
p. 130-140
|
artikel
|
| 1307 |
Edge decomposition of connected claw-free cubic graphs
|
Hong, Yanmei
|
|
|
96-97 |
C |
p. 246-250
|
artikel
|
| 1308 |
Edge deletion to tree-like graph classes
|
Koch, Ivo
|
|
|
96-97 |
C |
p. 122-131
|
artikel
|
| 1309 |
Edge disjoint caterpillar realizations
|
Miklós, István
|
|
|
96-97 |
C |
p. 327-344
|
artikel
|
| 1310 |
Edge-disjoint paths in faulty augmented cubes
|
Ma, Meijie
|
|
|
96-97 |
C |
p. 108-114
|
artikel
|
| 1311 |
Edge-disjoint properly colored cycles in edge-colored complete graphs
|
Chen, Xiaozheng
|
|
|
96-97 |
C |
p. 84-96
|
artikel
|
| 1312 |
Edge-disjoint rainbow triangles in edge-colored graphs
|
Li, Luyi
|
|
|
96-97 |
C |
p. 21-30
|
artikel
|
| 1313 |
Edge-disjoint spanning trees and forests of graphs
|
Zhou, Jiang
|
|
|
96-97 |
C |
p. 74-81
|
artikel
|
| 1314 |
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
|
Guo, Jia
|
|
|
96-97 |
C |
p. 109-119
|
artikel
|
| 1315 |
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
|
Li, Pingshan
|
|
2019
|
96-97 |
C |
p. 145-152
|
artikel
|
| 1316 |
Edge-grafting transformations on the average eccentricity of graphs and their applications
|
He, Chunling
|
|
2018
|
96-97 |
C |
p. 95-105
|
artikel
|
| 1317 |
Edge-intersection graphs of boundary-generated paths in a grid
|
Golumbic, Martin Charles
|
|
2018
|
96-97 |
C |
p. 214-222
|
artikel
|
| 1318 |
Edge-intersection graphs of grid paths: The bend-number
|
Heldt, Daniel
|
|
2014
|
96-97 |
C |
p. 144-162
19 p.
|
artikel
|
| 1319 |
Edge intersection graphs of
L
-shaped paths in grids
|
Cameron, Kathie
|
|
2016
|
96-97 |
C |
p. 185-194
|
artikel
|
| 1320 |
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 |
C |
p. 167-174
|
artikel
|
| 1321 |
Edge metric dimension and mixed metric dimension of planar graph
Q
n
|
Qu, Jing
|
|
|
96-97 |
C |
p. 462-475
|
artikel
|
| 1322 |
Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues
|
Belardo, Francesco
|
|
2019
|
96-97 |
C |
p. 130-138
|
artikel
|
| 1323 |
Edge-removing games on graphs
|
Yu, Alianna Singyue
|
|
|
96-97 |
C |
p. 75-85
|
artikel
|
| 1324 |
Edge separators for quasi-binary trees
|
Ramírez Alfonsín, Jorge Luis
|
|
2016
|
96-97 |
C |
p. 284-289
|
artikel
|
| 1325 |
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 |
C |
p. 142-158
|
artikel
|
| 1326 |
Edge-stable equimatchable graphs
|
Deniz, Zakir
|
|
2019
|
96-97 |
C |
p. 136-147
|
artikel
|
| 1327 |
Edge-treewidth: Algorithmic and combinatorial properties
|
Magne, Loïc
|
|
|
96-97 |
C |
p. 40-54
|
artikel
|
| 1328 |
Edge weights and vertex colours: Minimizing sum count
|
Baudon, Olivier
|
|
2019
|
96-97 |
C |
p. 13-24
|
artikel
|
| 1329 |
Editorial
|
|
|
1999
|
96-97 |
C |
p. 245-
1 p.
|
artikel
|
| 1330 |
Editorial
|
|
|
1999
|
96-97 |
C |
p. 1-2
2 p.
|
artikel
|
| 1331 |
Editorial Board
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 1332 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1333 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1334 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1335 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1336 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1337 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1338 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1339 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1340 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1341 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1342 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1343 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1344 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1345 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1346 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1347 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1348 |
Editorial Board
|
|
|
1992
|
96-97 |
C |
p. iii-iv
nvt p.
|
artikel
|
| 1349 |
Editorial Board
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 1350 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1351 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1352 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1353 |
Editorial Board
|
|
|
2017
|
96-97 |
C |
p. v-vi
|
artikel
|
| 1354 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1355 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1356 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1357 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1358 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1359 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1360 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1361 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1362 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1363 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1364 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1365 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1366 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1367 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1368 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1369 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1370 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1371 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1372 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1373 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1374 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1375 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1376 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1377 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1378 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1379 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1380 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1381 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1382 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1383 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1384 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1385 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1386 |
Editorial Board
|
|
|
2019
|
96-97 |
C |
p. ii
|
artikel
|
| 1387 |
Editorial Board
|
|
|
2018
|
96-97 |
C |
p. ii
|
artikel
|
| 1388 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1389 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1390 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1391 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1392 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1393 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1394 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1395 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1396 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1397 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1398 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1399 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1400 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1401 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1402 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1403 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1404 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1405 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1406 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1407 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1408 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1409 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1410 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1411 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1412 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1413 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1414 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1415 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1416 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1417 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1418 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1419 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1420 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1421 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1422 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1423 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1424 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1425 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1426 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1427 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1428 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1429 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1430 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1431 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1432 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1433 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1434 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1435 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1436 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1437 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1438 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1439 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1440 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1441 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1442 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1443 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1444 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1445 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1446 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1447 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1448 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1449 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1450 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1451 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1452 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1453 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1454 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1455 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1456 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1457 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1458 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1459 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1460 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1461 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1462 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1463 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1464 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1465 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1466 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1467 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1468 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1469 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1470 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1471 |
Editorial Board
|
|
|
|
96-97 |
C |
p. ii
|
artikel
|
| 1472 |
Editorial: Stringology Algorithms
|
Holub, Jan
|
|
2016
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 1473 |
Effective resistances and spanning trees in the complete bipartite graph plus a matching
|
Ge, Jun
|
|
|
96-97 |
C |
p. 145-153
|
artikel
|
| 1474 |
Effect of predomination and vertex removal on the game total domination number of a graph
|
Iršič, Vesna
|
|
2019
|
96-97 |
C |
p. 216-225
|
artikel
|
| 1475 |
Effects of edge addition or removal on the nullity of a graph
|
Batal, Ahmet
|
|
|
96-97 |
C |
p. 56-65
|
artikel
|
| 1476 |
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
|
Fast, Caleb C.
|
|
2018
|
96-97 |
C |
p. 215-226
|
artikel
|
| 1477 |
Efficient algorithms for dualizing large-scale hypergraphs
|
Murakami, Keisuke
|
|
2014
|
96-97 |
C |
p. 83-94
12 p.
|
artikel
|
| 1478 |
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
|
Ando, Kazutoshi
|
|
2017
|
96-97 |
C |
p. 1-10
10 p.
|
artikel
|
| 1479 |
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
|
Kobayashi, Yasuaki
|
|
|
96-97 |
C |
p. 258-275
|
artikel
|
| 1480 |
Efficient construction of broadcast graphs
|
Averbuch, A.
|
|
2014
|
96-97 |
C |
p. 9-14
6 p.
|
artikel
|
| 1481 |
Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
|
Kudin, S.
|
|
|
96-97 |
C |
p. 150-157
|
artikel
|
| 1482 |
Efficient domination for classes of
P
6
-free graphs
|
Brandstädt, Andreas
|
|
2017
|
96-97 |
C |
p. 15-27
13 p.
|
artikel
|
| 1483 |
Efficient domination through eigenvalues
|
Cardoso, Domingos M.
|
|
2016
|
96-97 |
C |
p. 54-62
9 p.
|
artikel
|
| 1484 |
Efficient eight-regular circulants based on the Kronecker product
|
Jha, Pranava K.
|
|
2018
|
96-97 |
C |
p. 207-218
|
artikel
|
| 1485 |
Efficient enumeration of dominating sets for sparse graphs
|
Kurita, Kazuhiro
|
|
|
96-97 |
C |
p. 283-295
|
artikel
|
| 1486 |
Efficient enumeration of graph orientations with sources
|
Conte, Alessio
|
|
2018
|
96-97 |
C |
p. 22-37
|
artikel
|
| 1487 |
Efficient enumeration of maximal induced bicliques
|
Hermelin, Danny
|
|
|
96-97 |
C |
p. 253-261
|
artikel
|
| 1488 |
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
|
Brosse, Caroline
|
|
|
96-97 |
C |
p. 34-51
|
artikel
|
| 1489 |
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
|
Yamazaki, Kazuaki
|
|
|
96-97 |
C |
p. 190-199
|
artikel
|
| 1490 |
Efficient enumeration of transversal edge-partitions
|
Shinraku, Koki
|
|
|
96-97 |
C |
p. 276-287
|
artikel
|
| 1491 |
Efficient fault-tolerant fixed routings on (k+1)-connected digraphs
|
Wada, Koichi
|
|
1992
|
96-97 |
C |
p. 539-552
14 p.
|
artikel
|
| 1492 |
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope
|
Hoeksma, Ruben
|
|
2016
|
96-97 |
C |
p. 136-145
10 p.
|
artikel
|
| 1493 |
Efficient independent set approximation in unit disk graphs
|
Das, Gautam K.
|
|
|
96-97 |
C |
p. 63-70
|
artikel
|
| 1494 |
Efficient
k
-shot broadcasting in radio networks
|
Kantor, Erez
|
|
2016
|
96-97 |
C |
p. 79-94
16 p.
|
artikel
|
| 1495 |
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
|
Berry, Anne
|
|
2015
|
96-97 |
C |
p. 50-61
12 p.
|
artikel
|
| 1496 |
Efficiently enumerating minimal triangulations
|
Carmeli, Nofar
|
|
|
96-97 |
C |
p. 216-236
|
artikel
|
| 1497 |
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation
|
Pardey, Johannes
|
|
|
96-97 |
C |
p. 108-116
|
artikel
|
| 1498 |
Efficient methods of calculating the number of heapable permutations
|
Chen, Benjamin
|
|
|
96-97 |
C |
p. 126-137
|
artikel
|
| 1499 |
Efficient methods of constructing universal cycles for
k
-permutations
|
Chang, Zuling
|
|
|
96-97 |
C |
p. 120-134
|
artikel
|
| 1500 |
Efficient minimization of higher order submodular functions using monotonic Boolean functions
|
Ramalingam, Srikumar
|
|
2017
|
96-97 |
C |
p. 1-19
19 p.
|
artikel
|
| 1501 |
Efficient parameterized algorithms for computing all-pairs shortest paths
|
Kratsch, Stefan
|
|
|
96-97 |
C |
p. 102-119
|
artikel
|
| 1502 |
Efficient
(
t
,
r
)
broadcast dominating sets of the triangular lattice
|
Harris, Pamela E.
|
|
|
96-97 |
C |
p. 180-192
|
artikel
|
| 1503 |
Eigenvalue location in cographs
|
Jacobs, David P.
|
|
2018
|
96-97 |
C |
p. 220-235
|
artikel
|
| 1504 |
Eigenvalue multiplicity in regular graphs
|
Rowlinson, Peter
|
|
2019
|
96-97 |
C |
p. 11-17
|
artikel
|
| 1505 |
Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
|
Zhen, Wenhao
|
|
|
96-97 |
C |
p. 23-29
|
artikel
|
| 1506 |
Eigenvector-based identification of bipartite subgraphs
|
Paul, Debdas
|
|
2019
|
96-97 |
C |
p. 146-158
|
artikel
|
| 1507 |
Elementary matrix equivalence and core transformation graphs for Parikh matrices
|
Poovanandran, Ghajendran
|
|
2018
|
96-97 |
C |
p. 276-289
|
artikel
|
| 1508 |
Elliptic approximations of propositional formulae
|
van Maaren, Hans
|
|
1999
|
96-97 |
C |
p. 223-244
22 p.
|
artikel
|
| 1509 |
Elusiveness of finding degrees
|
Goyal, Dishant
|
|
|
96-97 |
C |
p. 128-139
|
artikel
|
| 1510 |
Embedding finite involution semigroups in matrices with transposition
|
Lee, Edmond W.H.
|
|
|
96-97 |
C |
p. 327-330
|
artikel
|
| 1511 |
Embedding
K
3
,
3
and
K
5
on the double torus
|
Gagarin, Andrei
|
|
|
96-97 |
C |
p. 29-47
|
artikel
|
| 1512 |
Embedding of hypercubes into sibling trees
|
Arockiaraj, Micheal
|
|
2014
|
96-97 |
C |
p. 9-14
6 p.
|
artikel
|
| 1513 |
Embedding planar 5-graphs in three pages
|
Guan, Xiaxia
|
|
|
96-97 |
C |
p. 108-121
|
artikel
|
| 1514 |
Embedding various cycles with prescribed paths into
k
-ary
n
-cubes
|
Yang, Yuxing
|
|
2017
|
96-97 |
C |
p. 161-169
9 p.
|
artikel
|
| 1515 |
Emerging applications, models and algorithms in combinatorial optimization
|
Ayuso, Antonio Alonso
|
|
|
96-97 |
C |
p. 1-3
|
artikel
|
| 1516 |
Empirical analysis of algorithms for the shortest negative cost cycle problem
|
Anderson, Matthew
|
|
2019
|
96-97 |
C |
p. 167-184
|
artikel
|
| 1517 |
Employee workload balancing by graph partitioning
|
Ceselli, Alberto
|
|
2014
|
96-97 |
C |
p. 112-129
18 p.
|
artikel
|
| 1518 |
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
|
Chroni, Maria
|
|
2018
|
96-97 |
C |
p. 145-164
|
artikel
|
| 1519 |
End-vertices of LBFS of (AT-free) bigraphs
|
Gorzny, Jan
|
|
2017
|
96-97 |
C |
p. 87-94
8 p.
|
artikel
|
| 1520 |
Energies of unitary one-matching bi-Cayley graphs over finite commutative rings
|
Liu, Xiaogang
|
|
2019
|
96-97 |
C |
p. 170-179
|
artikel
|
| 1521 |
Energy of a graph and Randić index of subgraphs
|
Arizmendi, Gerardo
|
|
|
96-97 |
C |
p. 136-142
|
artikel
|
| 1522 |
Energy of signed digraphs
|
Pirzada, S.
|
|
2014
|
96-97 |
C |
p. 195-205
11 p.
|
artikel
|
| 1523 |
Energy of weighted digraphs
|
Bhat, Mushtaq A.
|
|
2017
|
96-97 |
C |
p. 1-14
14 p.
|
artikel
|
| 1524 |
Enumerating and categorizing positive Boolean functions separable by a
k
-additive capacity
|
Uyanık, Eda
|
|
2017
|
96-97 |
C |
p. 17-30
14 p.
|
artikel
|
| 1525 |
Enumerating connected induced subgraphs: Improved delay and experimental comparison
|
Komusiewicz, Christian
|
|
|
96-97 |
C |
p. 262-282
|
artikel
|
| 1526 |
Enumerating floorplans with walls
|
Yamanaka, Katsuhisa
|
|
|
96-97 |
C |
p. 1-11
|
artikel
|
| 1527 |
Enumerating grammar-based extractions
|
Peterfreund, Liat
|
|
|
96-97 |
C |
p. 372-392
|
artikel
|
| 1528 |
Enumerating graphs via even/odd dichotomy
|
Hujdurović, Ademir
|
|
|
96-97 |
C |
p. 252-262
|
artikel
|
| 1529 |
Enumerating lambda terms by weighted length of their De Bruijn representation
|
Bodini, Olivier
|
|
2018
|
96-97 |
C |
p. 45-61
|
artikel
|
| 1530 |
Enumerating minimal dominating sets in chordal bipartite graphs
|
Golovach, Petr A.
|
|
2016
|
96-97 |
C |
p. 30-36
7 p.
|
artikel
|
| 1531 |
Enumerating models of DNF faster: Breaking the dependency on the formula size
|
Capelli, Florent
|
|
|
96-97 |
C |
p. 203-215
|
artikel
|
| 1532 |
Enumerating numerical sets associated to a numerical semigroup
|
Chen, April
|
|
|
96-97 |
C |
p. 218-231
|
artikel
|
| 1533 |
Enumeration and extensions of word-representants
|
Gaetz, Marisa
|
|
|
96-97 |
C |
p. 423-433
|
artikel
|
| 1534 |
Enumeration and maximum number of maximal irredundant sets for chordal graphs
|
Golovach, Petr A.
|
|
2019
|
96-97 |
C |
p. 69-85
|
artikel
|
| 1535 |
Enumeration of bipartite non-crossing geometric graphs
|
Cheon, Gi-Sang
|
|
|
96-97 |
C |
p. 86-100
|
artikel
|
| 1536 |
Enumeration of Clar covers of parallelogram chains
|
He, Bing-Hau
|
|
|
96-97 |
C |
p. 221-233
|
artikel
|
| 1537 |
Enumeration of inversion sequences avoiding triples of relations
|
Cao, Wenqin
|
|
2019
|
96-97 |
C |
p. 86-97
|
artikel
|
| 1538 |
Enumeration of minimal connected dominating sets for chordal graphs
|
Golovach, Petr A.
|
|
|
96-97 |
C |
p. 3-11
|
artikel
|
| 1539 |
Enumeration of simple games with two equivalence classes of players
|
Kurz, Sascha
|
|
|
96-97 |
C |
p. 26-35
|
artikel
|
| 1540 |
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
|
Li, Danyi
|
|
|
96-97 |
C |
p. 320-325
|
artikel
|
| 1541 |
Enumerations of humps and peaks in
(
k
,
a
)
-paths and
(
n
,
m
)
-Dyck paths via bijective proofs
|
Du, Rosena R.X.
|
|
2015
|
96-97 |
C |
p. 42-49
8 p.
|
artikel
|
| 1542 |
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective
|
Limaye, Girija
|
|
|
96-97 |
C |
p. 288-302
|
artikel
|
| 1543 |
Equal relation between
g
-good-neighbor diagnosability under the PMC model and
g
-good-neighbor diagnosability under the MM
∗
model of a graph
|
Hu, Xiaomin
|
|
2019
|
96-97 |
C |
p. 96-103
|
artikel
|
| 1544 |
Equations enforcing repetitions under permutations
|
Day, Joel D.
|
|
|
96-97 |
C |
p. 61-78
|
artikel
|
| 1545 |
Equidistant codes in the Grassmannian
|
Etzion, Tuvi
|
|
2015
|
96-97 |
C |
p. 87-97
11 p.
|
artikel
|
| 1546 |
Equilibrium paths in discounted supergames
|
Berg, Kimmo
|
|
2019
|
96-97 |
C |
p. 1-27
|
artikel
|
| 1547 |
Equistable simplicial, very well-covered, and line graphs
|
Levit, Vadim E.
|
|
2014
|
96-97 |
C |
p. 205-212
8 p.
|
artikel
|
| 1548 |
Equitable coloring of hypergraphs
|
Furmańczyk, Hanna
|
|
2019
|
96-97 |
C |
p. 186-192
|
artikel
|
| 1549 |
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
|
Yan, Zhidan
|
|
2014
|
96-97 |
C |
p. 328-333
6 p.
|
artikel
|
| 1550 |
Equitable colorings of Cartesian products with balanced complete multipartite graphs
|
Yan, Zhidan
|
|
2015
|
96-97 |
C |
p. 200-203
4 p.
|
artikel
|
| 1551 |
Equitable colorings of hypergraphs with few edges
|
Akhmejanova, Margarita B.
|
|
|
96-97 |
C |
p. 2-12
|
artikel
|
| 1552 |
Equitable factorizations of edge-connected graphs
|
Hasanvand, Morteza
|
|
|
96-97 |
C |
p. 136-145
|
artikel
|
| 1553 |
Equitable neighbour-sum-distinguishing edge and total colourings
|
Baudon, Olivier
|
|
2017
|
96-97 |
C |
p. 40-53
14 p.
|
artikel
|
| 1554 |
Equitable total coloring of complete
r
-partite
p
-balanced graphs
|
da Silva, A.G.
|
|
2019
|
96-97 |
C |
p. 123-135
|
artikel
|
| 1555 |
Equitable total-coloring of subcubic graphs
|
Gui, Hao
|
|
2015
|
96-97 |
C |
p. 167-170
4 p.
|
artikel
|
| 1556 |
Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of
2
×
n
rectangles
|
Langner, Johanna
|
|
2018
|
96-97 |
C |
p. 297-303
|
artikel
|
| 1557 |
Equivalence between pathbreadth and strong pathbreadth
|
Ducoffe, Guillaume
|
|
2019
|
96-97 |
C |
p. 185-188
|
artikel
|
| 1558 |
Equivalence for negabent functions and their relative difference sets
|
Anbar, Nurdagül
|
|
2019
|
96-97 |
C |
p. 1-12
|
artikel
|
| 1559 |
Equivalent realisations of a rigid graph
|
Jackson, Bill
|
|
2019
|
96-97 |
C |
p. 42-58
|
artikel
|
| 1560 |
Equivalent versions of group-connectivity theorems and conjectures
|
Kochol, Martin
|
|
2019
|
96-97 |
C |
p. 350-352
|
artikel
|
| 1561 |
Erdös–Gallai-type problems for distance-edge-monitoring numbers
|
Ji, Zhen
|
|
|
96-97 |
C |
p. 275-285
|
artikel
|
| 1562 |
Erdős–Ko–Rado theorems for a family of trees
|
Feghali, Carl
|
|
2018
|
96-97 |
C |
p. 464-471
|
artikel
|
| 1563 |
Erdős–Ko–Rado theorems on the weak Bruhat lattice
|
Fishel, Susanna
|
|
2019
|
96-97 |
C |
p. 65-75
|
artikel
|
| 1564 |
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]
|
Dulio, Paolo
|
|
|
96-97 |
C |
p. 403-404
|
artikel
|
| 1565 |
Erratum to “Characterizing acyclic graphs by labeling edges” [Discrete Appl. Math. 164 (2014) 492–499]
|
Urrutia, Sebastián
|
|
2015
|
96-97 |
C |
p. 254-255
2 p.
|
artikel
|
| 1566 |
Erratum to “On oriented cliques with respect to push operation” [Discrete Appl. Math. 232 (2017) 50–63]
|
Bensmail, Julien
|
|
2019
|
96-97 |
C |
p. 276-278
|
artikel
|
| 1567 |
Essential obstacles to Helly circular-arc graphs
|
Safe, Martín D.
|
|
|
96-97 |
C |
p. 245-258
|
artikel
|
| 1568 |
Essential upper bounds on the total domination number
|
Henning, Michael A.
|
|
2018
|
96-97 |
C |
p. 103-115
|
artikel
|
| 1569 |
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
|
Stanić, Zoran
|
|
|
96-97 |
C |
p. 32-40
|
artikel
|
| 1570 |
Estimating the
r
-colorability threshold for a random hypergraph
|
Shabanov, Dmitry A.
|
|
|
96-97 |
C |
p. 168-183
|
artikel
|
| 1571 |
Estimation of Laplacian spectra of direct and strong product graphs
|
Sayama, Hiroki
|
|
2016
|
96-97 |
C |
p. 160-170
11 p.
|
artikel
|
| 1572 |
Estrada index and subgraph centrality of hypergraphs via tensors
|
Zhou, Hong
|
|
|
96-97 |
C |
p. 120-129
|
artikel
|
| 1573 |
Eternal dominating sets on digraphs and orientations of graphs
|
Bagan, Guillaume
|
|
|
96-97 |
C |
p. 99-115
|
artikel
|
| 1574 |
Eternal domination on prisms of graphs
|
Krim-Yee, Aaron
|
|
|
96-97 |
C |
p. 734-736
|
artikel
|
| 1575 |
Euclidean farthest-point Voronoi diagram of a digital edge
|
Roussillon, Tristan
|
|
2015
|
96-97 |
C |
p. 118-129
12 p.
|
artikel
|
| 1576 |
Eulerian orientations and vertex-connectivity
|
Hörsch, Florian
|
|
|
96-97 |
C |
p. 115-124
|
artikel
|
| 1577 |
Even Cycle Decompositions of index 3 by a novel coloring technique
|
Bonvicini, Simona
|
|
|
96-97 |
C |
p. 49-62
|
artikel
|
| 1578 |
Every 2-connected {claw,
Z
2
}-free graph with minimum degree at least 4 contains two CISTs
|
Chen, Xiaodong
|
|
|
96-97 |
C |
p. 51-64
|
artikel
|
| 1579 |
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
|
Kuo, Che-Nan
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 1580 |
Every grid has an independent [1, 2]-set
|
Aleid, S.A.
|
|
2019
|
96-97 |
C |
p. 14-21
|
artikel
|
| 1581 |
Every planar graph is 1-defective
(
9
,
2
)
-paintable
|
Han, Ming
|
|
|
96-97 |
C |
p. 257-264
|
artikel
|
| 1582 |
Every triangle-free induced subgraph of the triangular lattice is
(
5
m
,
2
m
)
-choosable
|
Aubry, Yves
|
|
2014
|
96-97 |
C |
p. 51-58
8 p.
|
artikel
|
| 1583 |
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics
|
Fischer, A.
|
|
2014
|
96-97 |
C |
p. 97-114
18 p.
|
artikel
|
| 1584 |
Exact algorithms for counting 3-colorings of graphs
|
Zhu, Enqiang
|
|
|
96-97 |
C |
p. 74-93
|
artikel
|
| 1585 |
Exact algorithms for dominating induced matching based on graph partition
|
Xiao, Mingyu
|
|
2015
|
96-97 |
C |
p. 147-162
16 p.
|
artikel
|
| 1586 |
Exact algorithms for weak Roman domination
|
Chapelle, Mathieu
|
|
2018
|
96-97 |
C |
p. 79-92
|
artikel
|
| 1587 |
Exact and approximate results on the least size of a graph with a given degree set
|
Moondra, Jai
|
|
|
96-97 |
C |
p. 32-42
|
artikel
|
| 1588 |
Exact bounds of the Möbius inverse of monotone set functions
|
Grabisch, Michel
|
|
2015
|
96-97 |
C |
p. 7-12
6 p.
|
artikel
|
| 1589 |
Exact capacitated domination: On the computational complexity of uniqueness
|
Gutin, Gregory Z.
|
|
|
96-97 |
C |
p. 155-169
|
artikel
|
| 1590 |
Exact performance of MULTIFIT for nonsimultaneous machines
|
Hwang, Hark-Chin
|
|
2014
|
96-97 |
C |
p. 172-187
16 p.
|
artikel
|
| 1591 |
Exact-2-relation graphs
|
Long, Yangjing
|
|
|
96-97 |
C |
p. 212-226
|
artikel
|
| 1592 |
Exact satisfiability of linear CNF formulas
|
Schuh, Bernd R.
|
|
2018
|
96-97 |
C |
p. 1-4
|
artikel
|
| 1593 |
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs
|
Liu, Xianliang
|
|
2016
|
96-97 |
C |
p. 111-116
6 p.
|
artikel
|
| 1594 |
Exact square coloring of subcubic planar graphs
|
Foucaud, Florent
|
|
|
96-97 |
C |
p. 74-89
|
artikel
|
| 1595 |
Exact value of
e
x
(
n
;
{
C
3
,
…
,
C
s
}
)
for
n
≤
⌊
25
(
s
−
1
)
8
⌋
|
Abajo, E.
|
|
2015
|
96-97 |
C |
p. 1-7
7 p.
|
artikel
|
| 1596 |
Exact vertex forwarding index of the Strong product of complete graph and cycle
|
Qian, Weimin
|
|
|
96-97 |
C |
p. 69-84
|
artikel
|
| 1597 |
Examples of products giving large graphs with given degree and diameter
|
Delorme, C.
|
|
1992
|
96-97 |
C |
p. 157-167
11 p.
|
artikel
|
| 1598 |
Excluding cycles with a fixed number of chords
|
Aboulker, Pierre
|
|
2015
|
96-97 |
C |
p. 11-24
14 p.
|
artikel
|
| 1599 |
Executing bigraphical reactive systems
|
Gassara, Amal
|
|
2019
|
96-97 |
C |
p. 73-92
|
artikel
|
| 1600 |
Exhaustive generation for permutations avoiding (colored) regular sets of patterns
|
Do, Phan Thuan
|
|
2019
|
96-97 |
C |
p. 44-53
|
artikel
|
| 1601 |
Existence of all generalized fractional
(
g
,
f
)
-factors of graphs
|
Egawa, Yoshimi
|
|
|
96-97 |
C |
p. 265-271
|
artikel
|
| 1602 |
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
|
Iimura, Takuya
|
|
2014
|
96-97 |
C |
p. 26-33
8 p.
|
artikel
|
| 1603 |
Existence of EFX for two additive valuations
|
Mahara, Ryoga
|
|
|
96-97 |
C |
p. 115-122
|
artikel
|
| 1604 |
Existence of paths with
t
blocks in
k
(
t
)
-chromatic digraph
|
El Joubbeh, Mouhamad
|
|
|
96-97 |
C |
p. 381-384
|
artikel
|
| 1605 |
Existentially closed graphs via permutation polynomials over finite fields
|
Hai, Nguyen Minh
|
|
2016
|
96-97 |
C |
p. 116-125
10 p.
|
artikel
|
| 1606 |
Expected polynomial-time randomized algorithm for graph coloring problem
|
Ghosal, Subhankar
|
|
|
96-97 |
C |
p. 108-121
|
artikel
|
| 1607 |
Explicit inverse of nonsingular Jacobi matrices
|
Encinas, A.M.
|
|
2019
|
96-97 |
C |
p. 130-139
|
artikel
|
| 1608 |
Exploratory knowledge discovery over Web of Data
|
Alam, Mehwish
|
|
2018
|
96-97 |
C |
p. 2-17
|
artikel
|
| 1609 |
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs
|
Paul, Kaustav
|
|
|
96-97 |
C |
p. 143-152
|
artikel
|
| 1610 |
Exploring graphs with distinct
M
-eigenvalues: Product operation, Wronskian vertices, and controllability
|
Shan, Haiying
|
|
|
96-97 |
C |
p. 125-136
|
artikel
|
| 1611 |
Exploring symmetries in cographs: Obtaining spectra and energies
|
Jones, Átila
|
|
|
96-97 |
C |
p. 120-133
|
artikel
|
| 1612 |
Exploring the concept of perfection in 3-hypergraphs
|
García-Colín, Natalia
|
|
2016
|
96-97 |
C |
p. 164-170
|
artikel
|
| 1613 |
Exploring the rigidity of planar configurations of points and rods
|
Lundqvist, Signe
|
|
|
96-97 |
C |
p. 68-82
|
artikel
|
| 1614 |
Exploring the role of graph spectra in graph coloring algorithm performance
|
Smith-Miles, Kate
|
|
|
96-97 |
C |
p. 107-121
|
artikel
|
| 1615 |
Extended framework for constructing (complete) permutations by specifying their coordinate functions
|
Sun, Tianfeng
|
|
2018
|
96-97 |
C |
p. 322-330
|
artikel
|
| 1616 |
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
|
Akleman, Ergun
|
|
2015
|
96-97 |
C |
p. 61-79
19 p.
|
artikel
|
| 1617 |
Extending single tolerances to set tolerances
|
Jäger, Gerold
|
|
|
96-97 |
C |
p. 197-215
|
artikel
|
| 1618 |
Extending some results on the second neighborhood conjecture
|
Dara, Suresh
|
|
|
96-97 |
C |
p. 1-17
|
artikel
|
| 1619 |
Extension of some edge graph problems: Standard, parameterized and approximation complexity
|
Casel, Katrin
|
|
|
96-97 |
C |
p. 183-201
|
artikel
|
| 1620 |
Extension operators for TU games and the Lovász extension
|
Casajus, André
|
|
|
96-97 |
C |
p. 66-73
|
artikel
|
| 1621 |
Extensions of results on phylogeny graphs of degree bounded digraphs
|
Choi, Myungho
|
|
|
96-97 |
C |
p. 30-45
|
artikel
|
| 1622 |
Extensions of the combinatorial game
(
K
,
t
)
-Wythoff
|
Li, Haiyan
|
|
|
96-97 |
C |
p. 52-63
|
artikel
|
| 1623 |
Extremal anti-forcing numbers of perfect matchings of graphs
|
Deng, Kai
|
|
2017
|
96-97 |
C |
p. 69-79
11 p.
|
artikel
|
| 1624 |
Extremal bipartite graphs of given connectivity with respect to matching energy
|
Chen, Hanlin
|
|
2018
|
96-97 |
C |
p. 200-205
|
artikel
|
| 1625 |
Extremal digraphs for open neighbourhood location-domination and identifying codes
|
Foucaud, Florent
|
|
|
96-97 |
C |
p. 62-74
|
artikel
|
| 1626 |
Extremal families of redundantly rigid graphs in three dimensions
|
Jordán, Tibor
|
|
|
96-97 |
C |
p. 448-464
|
artikel
|
| 1627 |
Extremal graphs for average sizes of maximal matchings
|
Engbers, John
|
|
|
96-97 |
C |
p. 308-321
|
artikel
|
| 1628 |
Extremal graphs for blow-ups of stars and paths
|
Kang, Liying
|
|
|
96-97 |
C |
p. 79-85
|
artikel
|
| 1629 |
Extremal graphs for the geometric–arithmetic index with given minimum degree
|
Divnić, Tomica
|
|
2014
|
96-97 |
C |
p. 386-390
5 p.
|
artikel
|
| 1630 |
Extremal graphs for vertex-degree-based invariants with given degree sequences
|
Liu, Muhuo
|
|
2019
|
96-97 |
C |
p. 267-277
|
artikel
|
| 1631 |
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
|
Hong, Yunchao
|
|
|
96-97 |
C |
p. 147-158
|
artikel
|
| 1632 |
Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
|
Zhang, Huihui
|
|
2019
|
96-97 |
C |
p. 204-221
|
artikel
|
| 1633 |
Extremal graphs with respect to generalized
A
B
C
index
|
Chen, Xiaodan
|
|
2018
|
96-97 |
C |
p. 115-124
|
artikel
|
| 1634 |
Extremal graphs with respect to two distance-based topological indices
|
Zhang, Wanping
|
|
|
96-97 |
C |
p. 63-74
|
artikel
|
| 1635 |
Extremal Halin graphs with respect to the signless Laplacian spectra
|
Zhang, Minjie
|
|
2016
|
96-97 |
C |
p. 207-218
12 p.
|
artikel
|
| 1636 |
Extremal hypergraphs for matching number and domination number
|
Shan, Erfang
|
|
2018
|
96-97 |
C |
p. 415-421
|
artikel
|
| 1637 |
Extremal
k
-forcing sets in oriented graphs
|
Caro, Yair
|
|
2019
|
96-97 |
C |
p. 42-55
|
artikel
|
| 1638 |
Extremal
k
-generalized quasi unicyclic graphs with respect to first and second Zagreb indices
|
Javaid, Faisal
|
|
2019
|
96-97 |
C |
p. 153-158
|
artikel
|
| 1639 |
Extremal Kirchhoff index in polycyclic chains
|
Liu, Hechao
|
|
|
96-97 |
C |
p. 292-300
|
artikel
|
| 1640 |
Extremal numbers for cycles in a hypercube
|
Axenovich, Maria
|
|
|
96-97 |
C |
p. 1-3
|
artikel
|
| 1641 |
Extremal numbers for disjoint copies of a clique
|
Zhang, Junxue
|
|
|
96-97 |
C |
p. 263-270
|
artikel
|
| 1642 |
Extremal numbers of leaves for trees with fixed diameter and maximum degree
|
Feng, Xing
|
|
|
96-97 |
C |
p. 290-293
|
artikel
|
| 1643 |
Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield–Simmons index
|
Wei, Wei
|
|
2019
|
96-97 |
C |
p. 205-217
|
artikel
|
| 1644 |
Extremal polygonal cacti for bond incident degree indices
|
Ye, Jiachang
|
|
2019
|
96-97 |
C |
p. 289-298
|
artikel
|
| 1645 |
Extremal polygonal chains with respect to the Kirchhoff index
|
Ma, Qi
|
|
|
96-97 |
C |
p. 218-226
|
artikel
|
| 1646 |
Extremal problems for connected set enumeration
|
Luo, Zuwen
|
|
|
96-97 |
C |
p. 41-52
|
artikel
|
| 1647 |
Extremal problems for degree-based topological indices
|
Tang, Yunfang
|
|
2016
|
96-97 |
C |
p. 134-143
10 p.
|
artikel
|
| 1648 |
Extremal problems for trees with given segment sequence
|
Andriantiana, Eric Ould Dadah
|
|
2017
|
96-97 |
C |
p. 20-34
15 p.
|
artikel
|
| 1649 |
Extremal problems on distance spectra of graphs
|
Lin, Huiqiu
|
|
|
96-97 |
C |
p. 139-147
|
artikel
|
| 1650 |
Extremal problems on ray sensor configurations
|
Boyer, Kirk
|
|
|
96-97 |
C |
p. 87-100
|
artikel
|
| 1651 |
Extremal problems on saturation for the family of
k
-edge-connected graphs
|
Lei, Hui
|
|
2019
|
96-97 |
C |
p. 278-283
|
artikel
|
| 1652 |
Extremal problems on Steiner
k
-distances
|
Wang, Hua
|
|
|
96-97 |
C |
p. 13-26
|
artikel
|
| 1653 |
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number
|
Zhang, Yuan
|
|
|
96-97 |
C |
p. 190-206
|
artikel
|
| 1654 |
Extremal problems related to Betti numbers of flag complexes
|
Adamaszek, Michał
|
|
2014
|
96-97 |
C |
p. 8-15
8 p.
|
artikel
|
| 1655 |
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices
|
Du, Jianwei
|
|
|
96-97 |
C |
p. 200-211
|
artikel
|
| 1656 |
Extremal results for graphs of bounded metric dimension
|
Geneson, Jesse
|
|
|
96-97 |
C |
p. 123-129
|
artikel
|
| 1657 |
Extremal results on the spectral radius of function-weighted adjacency matrices
|
Li, Xueliang
|
|
|
96-97 |
C |
p. 204-216
|
artikel
|
| 1658 |
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
|
Shen, Chenghao
|
|
|
96-97 |
C |
p. 315-323
|
artikel
|
| 1659 |
Extremal spectral radius of graphs with cyclic edge-connectivity
|
Wang, Yu
|
|
|
96-97 |
C |
p. 316-331
|
artikel
|
| 1660 |
Extremal trees of given segment sequence with respect to some eccentricity-based invariants
|
Zhang, Minjie
|
|
|
96-97 |
C |
p. 111-123
|
artikel
|
| 1661 |
Extremal values and bounds for the zero forcing number
|
Gentner, Michael
|
|
2016
|
96-97 |
C |
p. 196-200
5 p.
|
artikel
|
| 1662 |
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
|
Tomescu, Ioan
|
|
|
96-97 |
C |
p. 83-88
|
artikel
|
| 1663 |
Extremal vertex-degree function index with given order and dissociation number
|
Huang, Jing
|
|
|
96-97 |
C |
p. 142-152
|
artikel
|
| 1664 |
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
|
Lee, Jinwook
|
|
2017
|
96-97 |
C |
p. 210-218
9 p.
|
artikel
|
| 1665 |
Extreme Wiener indices of trees with given number of vertices of maximum degree
|
Božović, Vladimir
|
|
|
96-97 |
C |
p. 23-31
|
artikel
|
| 1666 |
Facet-generating procedures for the maximum-impact coloring polytope
|
Braga, Mónica
|
|
|
96-97 |
C |
p. 96-112
|
artikel
|
| 1667 |
Facets and facet subgraphs of symmetric edge polytopes
|
Chen, Tianran
|
|
|
96-97 |
C |
p. 139-153
|
artikel
|
| 1668 |
Facets for single module and multi-module capacitated lot-sizing problems without backlogging
|
Bansal, Manish
|
|
2019
|
96-97 |
C |
p. 117-141
|
artikel
|
| 1669 |
Facets of the axial three-index assignment polytope
|
Dokka, Trivikram
|
|
2016
|
96-97 |
C |
p. 86-104
19 p.
|
artikel
|
| 1670 |
Facial anagram-free edge-coloring of plane graphs
|
Czap, Július
|
|
2017
|
96-97 |
C |
p. 151-155
5 p.
|
artikel
|
| 1671 |
ℓ
-facial edge colorings of graphs
|
Lužar, Borut
|
|
2015
|
96-97 |
C |
p. 193-200
8 p.
|
artikel
|
| 1672 |
Facial edge ranking of plane graphs
|
Czap, Július
|
|
2015
|
96-97 |
C |
p. 60-64
5 p.
|
artikel
|
| 1673 |
Facial
L
(
2
,
1
)
-edge-labelings of trees
|
Czap, Július
|
|
|
96-97 |
C |
p. 357-366
|
artikel
|
| 1674 |
Facial matchings in plane graphs
|
Czap, Július
|
|
|
96-97 |
C |
p. 16-22
|
artikel
|
| 1675 |
Facial packing edge-coloring of plane graphs
|
Czap, Július
|
|
2016
|
96-97 |
C |
p. 71-75
5 p.
|
artikel
|
| 1676 |
Facial packing vertex-coloring of subdivided plane graphs
|
Czap, Július
|
|
2019
|
96-97 |
C |
p. 95-100
|
artikel
|
| 1677 |
Facial unique-maximum edge and total coloring of plane graphs
|
Fabrici, Igor
|
|
|
96-97 |
C |
p. 171-179
|
artikel
|
| 1678 |
Facility location games with distinct desires
|
Mei, Lili
|
|
2019
|
96-97 |
C |
p. 148-160
|
artikel
|
| 1679 |
Factorization and pseudofactorization of weighted graphs
|
Sheridan, Kristin
|
|
|
96-97 |
C |
p. 81-105
|
artikel
|
| 1680 |
Factorization of network reliability with perfect nodes II: Connectivity matrix
|
Burgos, Juan Manuel
|
|
2016
|
96-97 |
C |
p. 91-100
10 p.
|
artikel
|
| 1681 |
Factorization of network reliability with perfect nodes I: Introduction and statements
|
Burgos, Juan Manuel
|
|
2016
|
96-97 |
C |
p. 82-90
9 p.
|
artikel
|
| 1682 |
Factors of bi-regular bipartite graphs
|
Egawa, Yoshimi
|
|
|
96-97 |
C |
p. 268-272
|
artikel
|
| 1683 |
Factors, spectral radius and toughness in bipartite graphs
|
Chen, Yuanyuan
|
|
|
96-97 |
C |
p. 223-231
|
artikel
|
| 1684 |
Fair division with multiple pieces
|
Nyman, Kathryn
|
|
|
96-97 |
C |
p. 115-122
|
artikel
|
| 1685 |
Fair integral submodular flows
|
Frank, András
|
|
|
96-97 |
C |
p. 416-434
|
artikel
|
| 1686 |
Fairly allocating contiguous blocks of indivisible items
|
Suksompong, Warut
|
|
2019
|
96-97 |
C |
p. 227-236
|
artikel
|
| 1687 |
Fair multi-cake cutting
|
Segal-Halevi, Erel
|
|
|
96-97 |
C |
p. 15-35
|
artikel
|
| 1688 |
Fairness in graph-theoretical optimization problems
|
Hojny, Christopher
|
|
|
96-97 |
C |
p. 178-192
|
artikel
|
| 1689 |
Families of finite sets satisfying intersection restrictions
|
Frankl, Peter
|
|
|
96-97 |
C |
p. 44-49
|
artikel
|
| 1690 |
Fast algorithms for indices of nested split graphs approximating real complex networks
|
Sciriha, Irene
|
|
|
96-97 |
C |
p. 152-164
|
artikel
|
| 1691 |
Fast approximation for computing the fractional arboricity and extraction of communities of a graph
|
Toko Worou, Bio Mikaila
|
|
2016
|
96-97 |
C |
p. 179-195
17 p.
|
artikel
|
| 1692 |
Fast computation of linear approximation of general word-oriented composite function
|
Ma, Sudong
|
|
|
96-97 |
C |
p. 157-172
|
artikel
|
| 1693 |
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
|
Minato, Shin-ichi
|
|
|
96-97 |
C |
p. 467-486
|
artikel
|
| 1694 |
Faster and enhanced inclusion-minimal cograph completion
|
Crespelle, Christophe
|
|
|
96-97 |
C |
p. 138-151
|
artikel
|
| 1695 |
Faster separation of 1-wheel inequalities by graph products
|
de Vries, Sven
|
|
2015
|
96-97 |
C |
p. 74-83
10 p.
|
artikel
|
| 1696 |
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
|
Shimizu, Satoshi
|
|
2017
|
96-97 |
C |
p. 120-134
15 p.
|
artikel
|
| 1697 |
Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity
|
Sivignon, Isabelle
|
|
2015
|
96-97 |
C |
p. 130-146
17 p.
|
artikel
|
| 1698 |
Fast winning strategies for Staller in the Maker–Breaker domination game
|
Bujtás, Csilla
|
|
|
96-97 |
C |
p. 10-22
|
artikel
|
| 1699 |
Fat Hoffman graphs with smallest eigenvalue greater than −3
|
Munemasa, Akihiro
|
|
|
96-97 |
C |
p. 78-88
|
artikel
|
| 1700 |
Fault diagnosability of DQcube under the PMC model
|
Lv, Mengjie
|
|
2019
|
96-97 |
C |
p. 180-192
|
artikel
|
| 1701 |
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
|
Hu, Xiaolan
|
|
2014
|
96-97 |
C |
p. 152-161
10 p.
|
artikel
|
| 1702 |
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity
|
Zhu, Bo
|
|
|
96-97 |
C |
p. 111-123
|
artikel
|
| 1703 |
Fault-tolerant detectors for distinguishing sets in cubic graphs
|
Seo, Suk J.
|
|
|
96-97 |
C |
p. 25-33
|
artikel
|
| 1704 |
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
|
Cai, Hongyan
|
|
2015
|
96-97 |
C |
p. 33-40
8 p.
|
artikel
|
| 1705 |
Fault-tolerant strong Menger connectivity with conditional faults on wheel networks
|
Wang, Shiying
|
|
|
96-97 |
C |
p. 115-126
|
artikel
|
| 1706 |
Fault-tolerant strong Menger (edge) connectivity of arrangement graph
|
Li, Pingshan
|
|
|
96-97 |
C |
p. 53-61
|
artikel
|
| 1707 |
Fault tolerant supergraphs with automorphisms
|
Ganesan, Ashwin
|
|
2019
|
96-97 |
C |
p. 274-279
|
artikel
|
| 1708 |
Feasibility Pump-like heuristics for mixed integer problems
|
De Santis, M.
|
|
2014
|
96-97 |
C |
p. 152-167
16 p.
|
artikel
|
| 1709 |
Feedback edge sets in temporal graphs
|
Haag, Roman
|
|
|
96-97 |
C |
p. 65-78
|
artikel
|
| 1710 |
Feedback game on
3
-chromatic Eulerian triangulations of surfaces
|
Higashitani, Akihiro
|
|
|
96-97 |
C |
p. 30-38
|
artikel
|
| 1711 |
Few-weight codes over
F
p
+
u
F
p
associated with down sets and their distance optimal Gray image
|
Wu, Yansheng
|
|
|
96-97 |
C |
p. 315-322
|
artikel
|
| 1712 |
Fibonacci and Lucas
p
-cubes
|
Wei, Jianxin
|
|
|
96-97 |
C |
p. 365-383
|
artikel
|
| 1713 |
Fibonacci-run graphs I: Basic properties
|
Eğecioğlu, Ömer
|
|
|
96-97 |
C |
p. 70-84
|
artikel
|
| 1714 |
Fibonacci-run graphs II: Degree sequences
|
Eğecioğlu, Ömer
|
|
|
96-97 |
C |
p. 56-71
|
artikel
|
| 1715 |
Finding all minimum cost flows and a faster algorithm for the
K
best flow problem
|
Könen, David
|
|
|
96-97 |
C |
p. 333-349
|
artikel
|
| 1716 |
Finding a mediocre player
|
Dumitrescu, Adrian
|
|
|
96-97 |
C |
p. 15-24
|
artikel
|
| 1717 |
Finding a non-minority ball with majority answers
|
Gerbner, Dániel
|
|
2017
|
96-97 |
C |
p. 18-31
14 p.
|
artikel
|
| 1718 |
Finding biclique partitions of co-chordal graphs
|
Lyu, Bochuan
|
|
|
96-97 |
C |
p. 278-287
|
artikel
|
| 1719 |
Finding broadcast 2-centers of a tree under the postal model
|
Tsou, Cheng-Hsiao
|
|
|
96-97 |
C |
p. 182-190
|
artikel
|
| 1720 |
Finding clubs in graph classes
|
Golovach, Petr A.
|
|
2014
|
96-97 |
C |
p. 57-65
9 p.
|
artikel
|
| 1721 |
Finding cut-vertices in the square roots of a graph
|
Ducoffe, Guillaume
|
|
2019
|
96-97 |
C |
p. 158-174
|
artikel
|
| 1722 |
Finding densest
k
-connected subgraphs
|
Bonchi, Francesco
|
|
|
96-97 |
C |
p. 34-47
|
artikel
|
| 1723 |
Finding dominating induced matchings in
S
1
,
1
,
5
-free graphs in polynomial time
|
Brandstädt, Andreas
|
|
|
96-97 |
C |
p. 269-280
|
artikel
|
| 1724 |
Finding dominating induced matchings in
S
2
,
2
,
3
-free graphs in polynomial time
|
Brandstädt, Andreas
|
|
|
96-97 |
C |
p. 417-434
|
artikel
|
| 1725 |
Finding
k
-community structures in special graph classes
|
Baghirova, Narmina
|
|
|
96-97 |
C |
p. 159-175
|
artikel
|
| 1726 |
Finding kings in tournaments
|
Biswas, Arindam
|
|
|
96-97 |
C |
p. 240-252
|
artikel
|
| 1727 |
Finding non-minority balls with majority and plurality queries
|
Chang, Huilan
|
|
|
96-97 |
C |
p. 631-639
|
artikel
|
| 1728 |
Finding spanning trees with perfect matchings
|
Bérczi, Kristóf
|
|
|
96-97 |
C |
p. 137-147
|
artikel
|
| 1729 |
Finding the closest ultrametric
|
Di Summa, Marco
|
|
2015
|
96-97 |
C |
p. 70-80
11 p.
|
artikel
|
| 1730 |
Fine-grained parameterized complexity analysis of graph coloring problems
|
Jaffke, Lars
|
|
|
96-97 |
C |
p. 33-46
|
artikel
|
| 1731 |
Finitary and cofinitary gammoids
|
Afzali Borujeni, Seyed Hadi
|
|
2016
|
96-97 |
C |
p. 2-10
9 p.
|
artikel
|
| 1732 |
Firefighting on the hexagonal grid
|
Dean, Abdullah
|
|
|
96-97 |
C |
p. 16-22
|
artikel
|
| 1733 |
First order sentences about random graphs: Small number of alternations
|
Matushkin, A.D.
|
|
2018
|
96-97 |
C |
p. 329-346
|
artikel
|
| 1734 |
(
F
,
I
)
-security in graphs
|
Petrie, Caleb
|
|
2014
|
96-97 |
C |
p. 285-295
11 p.
|
artikel
|
| 1735 |
Fisher information distance: A geometrical reading
|
Costa, Sueli I.R.
|
|
2015
|
96-97 |
C |
p. 59-69
11 p.
|
artikel
|
| 1736 |
Fixed cardinality stable sets
|
Samer, Phillippe
|
|
|
96-97 |
C |
p. 137-148
|
artikel
|
| 1737 |
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
|
Yamada, Suguru
|
|
|
96-97 |
C |
p. 343-354
|
artikel
|
| 1738 |
Fixed-parameter algorithms for DAG Partitioning
|
van Bevern, René
|
|
2017
|
96-97 |
C |
p. 134-160
27 p.
|
artikel
|
| 1739 |
Fixed-parameter algorithms for the cocoloring problem
|
Campos, Victor
|
|
2014
|
96-97 |
C |
p. 52-60
9 p.
|
artikel
|
| 1740 |
Fixed points and connections between positive and negative cycles in Boolean networks
|
Richard, Adrien
|
|
2018
|
96-97 |
C |
p. 1-10
|
artikel
|
| 1741 |
Fixed points of a random restricted growth sequence
|
Mansour, Toufik
|
|
|
96-97 |
C |
p. 171-177
|
artikel
|
| 1742 |
Fixing knockout tournaments with seeds
|
Manurangsi, Pasin
|
|
|
96-97 |
C |
p. 21-35
|
artikel
|
| 1743 |
Flexibility of planar graphs—Sharpening the tools to get lists of size four
|
Choi, Ilkyoo
|
|
|
96-97 |
C |
p. 120-132
|
artikel
|
| 1744 |
Flexible allocation on related machines with assignment restrictions
|
Rawitz, Dror
|
|
2018
|
96-97 |
C |
p. 309-321
|
artikel
|
| 1745 |
Flexible flow shop with dedicated buffers
|
Ernst, Andreas
|
|
2019
|
96-97 |
C |
p. 148-163
|
artikel
|
| 1746 |
Flexing infinite frameworks with applications to braced Penrose tilings
|
Dewar, Sean
|
|
|
96-97 |
C |
p. 1-17
|
artikel
|
| 1747 |
Flip paths between lattice triangulations
|
Sims, William
|
|
|
96-97 |
C |
p. 140-163
|
artikel
|
| 1748 |
Flow resistance to resistance ratios in cubic graphs
|
Allie, Imran
|
|
|
96-97 |
C |
p. 362-367
|
artikel
|
| 1749 |
Fly-automata for checking
MSO
2
graph properties
|
Courcelle, Bruno
|
|
2018
|
96-97 |
C |
p. 236-252
|
artikel
|
| 1750 |
Forbidden induced subgraph characterization of circle graphs within split graphs
|
Bonomo-Braberman, Flavia
|
|
|
96-97 |
C |
p. 43-75
|
artikel
|
| 1751 |
Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition
|
Wang, Qiang
|
|
|
96-97 |
C |
p. 290-300
|
artikel
|
| 1752 |
Forbidden Pairs of disconnected graphs for traceability and hamiltonicity
|
Liao, Hongli
|
|
|
96-97 |
C |
p. 105-114
|
artikel
|
| 1753 |
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
|
Takaoka, Asahi
|
|
|
96-97 |
C |
p. 285-301
|
artikel
|
| 1754 |
Forbidden rainbow subgraphs that force large monochromatic or multicolored
k
-connected subgraphs
|
Li, Xihe
|
|
|
96-97 |
C |
p. 18-29
|
artikel
|
| 1755 |
Forbidden subgraphs for supereulerian and hamiltonian graphs
|
Yang, Xiaojing
|
|
|
96-97 |
C |
p. 192-200
|
artikel
|
| 1756 |
Forbidden triples generating a finite set of graphs with minimum degree three
|
Egawa, Yoshimi
|
|
|
96-97 |
C |
p. 282-295
|
artikel
|
| 1757 |
Forbidding a set difference of size 1
|
Leader, Imre
|
|
2014
|
96-97 |
C |
p. 219-224
6 p.
|
artikel
|
| 1758 |
Forcing and anti-forcing edges in bipartite graphs
|
Che, Zhongyuan
|
|
2018
|
96-97 |
C |
p. 70-77
|
artikel
|
| 1759 |
Forcing brushes
|
Meierling, D.
|
|
2019
|
96-97 |
C |
p. 359-360
|
artikel
|
| 1760 |
Foreword
|
Bermond, Jean-Claude
|
|
1992
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 1761 |
Foreword
|
Błażewicz, Jacek
|
|
2015
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 1762 |
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada
|
Corneil, Derek G.
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 1763 |
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013
|
Heggernes, Pinar
|
|
2016
|
96-97 |
C |
p. 1-2
2 p.
|
artikel
|
| 1764 |
Formulations for the maximum common edge subgraph problem
|
de Gastines, Etienne
|
|
|
96-97 |
C |
p. 115-130
|
artikel
|
| 1765 |
Forwarding indices of k-connected graphs
|
Heydemann, M.C
|
|
1992
|
96-97 |
C |
p. 287-296
10 p.
|
artikel
|
| 1766 |
Forward linearised tree pattern matching using tree pattern border array
|
Trávníček, Jan
|
|
|
96-97 |
C |
p. 33-43
|
artikel
|
| 1767 |
Four cycle decomposition of
λ
K
(
n
,
2
)
|
C., Cecily Sahai
|
|
|
96-97 |
C |
p. 65-70
|
artikel
|
| 1768 |
Four-searchable biconnected outerplanar graphs
|
Diner, Öznur Yaşar
|
|
|
96-97 |
C |
p. 70-82
|
artikel
|
| 1769 |
FPT algorithms for packing
k
-safe spanning rooted sub(di)graphs
|
Bessy, Stéphane
|
|
|
96-97 |
C |
p. 80-94
|
artikel
|
| 1770 |
Fractional acquisition in graphs
|
Wenger, Paul S.
|
|
2014
|
96-97 |
C |
p. 142-148
7 p.
|
artikel
|
| 1771 |
Fractional matching preclusion for arrangement graphs
|
Ma, Tianlong
|
|
2019
|
96-97 |
C |
p. 181-189
|
artikel
|
| 1772 |
Fractional matching preclusion number of graphs
|
Zou, Jinyu
|
|
|
96-97 |
C |
p. 142-153
|
artikel
|
| 1773 |
Fractional matching preclusion numbers of Cartesian product graphs
|
Luan, Yu
|
|
|
96-97 |
C |
p. 100-112
|
artikel
|
| 1774 |
Fractional spanning tree packing, forest covering and eigenvalues
|
Hong, Yanmei
|
|
2016
|
96-97 |
C |
p. 219-223
5 p.
|
artikel
|
| 1775 |
Fractional Thue chromatic number of graphs
|
Zhong, Yaling
|
|
2016
|
96-97 |
C |
p. 191-199
9 p.
|
artikel
|
| 1776 |
Fractional zero forcing via three-color forcing games
|
Hogben, Leslie
|
|
2016
|
96-97 |
C |
p. 114-129
16 p.
|
artikel
|
| 1777 |
Fragmented coloring of proper interval and split graphs
|
Diwan, Ajit
|
|
2015
|
96-97 |
C |
p. 110-118
9 p.
|
artikel
|
| 1778 |
From logical gates synthesis to chromatic bicritical clutters
|
Benzaken, C.
|
|
1999
|
96-97 |
C |
p. 259-305
47 p.
|
artikel
|
| 1779 |
From matchings to independent sets
|
Lozin, Vadim
|
|
2017
|
96-97 |
C |
p. 4-14
11 p.
|
artikel
|
| 1780 |
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
|
Hellmuth, Marc
|
|
|
96-97 |
C |
p. 179-219
|
artikel
|
| 1781 |
From modular decomposition trees to rooted median graphs
|
Bruckmann, Carmen
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 1782 |
From preemptive to non-preemptive speed-scaling scheduling
|
Bampis, Evripidis
|
|
2015
|
96-97 |
C |
p. 11-20
10 p.
|
artikel
|
| 1783 |
From tree-decompositions to clique-width terms
|
Courcelle, Bruno
|
|
2018
|
96-97 |
C |
p. 125-144
|
artikel
|
| 1784 |
Frustration-critical signed graphs
|
Cappello, Chiara
|
|
|
96-97 |
C |
p. 183-193
|
artikel
|
| 1785 |
Fulkerson-covers of hypohamiltonian graphs
|
Chen, Fuyuan
|
|
2015
|
96-97 |
C |
p. 66-73
8 p.
|
artikel
|
| 1786 |
Full degree spanning trees in random regular graphs
|
Acquaviva, Sarah
|
|
|
96-97 |
C |
p. 85-93
|
artikel
|
| 1787 |
Fullerenes with the maximum Clar number
|
Gao, Yang
|
|
2016
|
96-97 |
C |
p. 58-69
12 p.
|
artikel
|
| 1788 |
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
|
Apollonio, Nicola
|
|
|
96-97 |
C |
p. 226-237
|
artikel
|
| 1789 |
Functorial hierarchical clustering with overlaps
|
Culbertson, Jared
|
|
2018
|
96-97 |
C |
p. 108-123
|
artikel
|
| 1790 |
Further acceleration in computing the gap greedy spanner: An empirical approach
|
Salami, Hosein
|
|
|
96-97 |
C |
p. 33-52
|
artikel
|
| 1791 |
Further analysis of bent functions from
C
and
D
which are provably outside or inside
M
#
|
Zhang, Fengrong
|
|
|
96-97 |
C |
p. 458-472
|
artikel
|
| 1792 |
Further cryptographic properties of the multiplicative inverse function
|
Tang, Deng
|
|
|
96-97 |
C |
p. 191-211
|
artikel
|
| 1793 |
Further evidence towards the multiplicative 1-2-3 Conjecture
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 135-144
|
artikel
|
| 1794 |
Further hardness results on rainbow and strong rainbow connectivity
|
Lauri, Juho
|
|
2016
|
96-97 |
C |
p. 191-200
10 p.
|
artikel
|
| 1795 |
Further result on acyclic chromatic index of planar graphs
|
Wang, Tao
|
|
2016
|
96-97 |
C |
p. 228-247
20 p.
|
artikel
|
| 1796 |
Further results on an equitable 1-2-3 Conjecture
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 1-20
|
artikel
|
| 1797 |
Further results on controllable graphs
|
Stanić, Zoran
|
|
2014
|
96-97 |
C |
p. 215-221
7 p.
|
artikel
|
| 1798 |
Further results on injective edge coloring of graphs with maximum degree 5
|
Lu, Jian
|
|
|
96-97 |
C |
p. 176-184
|
artikel
|
| 1799 |
Further results on random walk labelings
|
Fried, Sela
|
|
|
96-97 |
C |
p. 211-221
|
artikel
|
| 1800 |
Further results on the deficiency of graphs
|
Petrosyan, P.A.
|
|
2017
|
96-97 |
C |
p. 117-126
10 p.
|
artikel
|
| 1801 |
Further results on the largest matching root of unicyclic graphs
|
Liu, Weijun
|
|
2017
|
96-97 |
C |
p. 82-88
7 p.
|
artikel
|
| 1802 |
Further results on the Merrifield–Simmons index
|
Hua, Hongbo
|
|
|
96-97 |
C |
p. 231-241
|
artikel
|
| 1803 |
Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs
|
Cararo, Cintia Izabel
|
|
|
96-97 |
C |
p. 114-124
|
artikel
|
| 1804 |
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems
|
Yu, Xiaohui
|
|
|
96-97 |
C |
p. 117-132
|
artikel
|
| 1805 |
F
-WORM colorings: Results for
2
-connected graphs
|
Bujtás, Csilla
|
|
2017
|
96-97 |
C |
p. 131-138
8 p.
|
artikel
|
| 1806 |
Gallai and
ℓ
-uniform Ramsey numbers of complete bipartite graphs
|
Liu, Yuchen
|
|
|
96-97 |
C |
p. 131-139
|
artikel
|
| 1807 |
Gallai–Ramsey numbers for books
|
Zou, Jinyu
|
|
2019
|
96-97 |
C |
p. 164-177
|
artikel
|
| 1808 |
Gallai–Ramsey numbers for graphs with chromatic number three
|
Zhao, Qinghong
|
|
|
96-97 |
C |
p. 110-118
|
artikel
|
| 1809 |
Gallai–Ramsey numbers for multiple triangles
|
Zhang, Fangfang
|
|
|
96-97 |
C |
p. 103-109
|
artikel
|
| 1810 |
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
|
Li, Luyi
|
|
|
96-97 |
C |
p. 81-87
|
artikel
|
| 1811 |
Gallai’s question and constructions of almost hypotraceable graphs
|
Wiener, Gábor
|
|
2018
|
96-97 |
C |
p. 270-278
|
artikel
|
| 1812 |
Game brush number
|
Kinnersley, William B.
|
|
2016
|
96-97 |
C |
p. 1-14
14 p.
|
artikel
|
| 1813 |
Game edge-connectivity of graphs
|
Matsumoto, Naoki
|
|
|
96-97 |
C |
p. 155-164
|
artikel
|
| 1814 |
Game of pure chance with restricted boundary
|
Leung, Ho-Hon
|
|
|
96-97 |
C |
p. 613-625
|
artikel
|
| 1815 |
Games on concept lattices: Shapley value and core
|
Faigle, Ulrich
|
|
2016
|
96-97 |
C |
p. 29-47
19 p.
|
artikel
|
| 1816 |
Games restricted by simplicial complexes and an application to vertiport cooperation
|
Jiménez-Losada, A.
|
|
|
96-97 |
C |
p. 45-54
|
artikel
|
| 1817 |
Game total domination critical graphs
|
Henning, Michael A.
|
|
2018
|
96-97 |
C |
p. 28-37
|
artikel
|
| 1818 |
Game total domination for cycles and paths
|
Dorbec, Paul
|
|
2016
|
96-97 |
C |
p. 7-18
12 p.
|
artikel
|
| 1819 |
Game total domination for cyclic bipartite graphs
|
Jiang, Yisheng
|
|
2019
|
96-97 |
C |
p. 120-127
|
artikel
|
| 1820 |
Gap one bounds for the equitable chromatic number of block graphs
|
Dybizbański, Janusz
|
|
|
96-97 |
C |
p. 15-28
|
artikel
|
| 1821 |
Gated independence in graphs
|
Civan, Yusuf
|
|
|
96-97 |
C |
p. 121-138
|
artikel
|
| 1822 |
Gaussian discrepancy: A probabilistic relaxation of vector balancing
|
Chewi, Sinho
|
|
|
96-97 |
C |
p. 123-141
|
artikel
|
| 1823 |
Gaussian random projections for Euclidean membership problems
|
Vu, Ky
|
|
2019
|
96-97 |
C |
p. 93-102
|
artikel
|
| 1824 |
Gender consistent resolving rules in marriage problems
|
Dimitrov, Dinko
|
|
|
96-97 |
C |
p. 147-151
|
artikel
|
| 1825 |
General cut-generating procedures for the stable set polytope
|
Corrêa, Ricardo C.
|
|
2018
|
96-97 |
C |
p. 28-41
|
artikel
|
| 1826 |
General eccentric connectivity index of trees and unicyclic graphs
|
Vetrík, Tomáš
|
|
|
96-97 |
C |
p. 301-315
|
artikel
|
| 1827 |
Generalised outerplanar Turán numbers and maximum number of
k
-vertex subtrees
|
Matolcsi, Dávid
|
|
|
96-97 |
C |
p. 115-124
|
artikel
|
| 1828 |
Generalised Ramsey numbers for two sets of cycles
|
Hansson, Mikael
|
|
2018
|
96-97 |
C |
p. 86-94
|
artikel
|
| 1829 |
Generalizations of bounds on the index of convergence to weighted digraphs
|
Merlet, Glenn
|
|
2014
|
96-97 |
C |
p. 121-134
14 p.
|
artikel
|
| 1830 |
Generalized bent Boolean functions and strongly regular Cayley graphs
|
Riera, Constanza
|
|
|
96-97 |
C |
p. 367-374
|
artikel
|
| 1831 |
Generalized bijective maps between
G
-parking functions, spanning trees, and the Tutte polynomial
|
Frizzell, Carrie
|
|
|
96-97 |
C |
p. 517-532
|
artikel
|
| 1832 |
Generalized competitively orientable complete multipartite graphs
|
Choi, Myungho
|
|
|
96-97 |
C |
p. 65-72
|
artikel
|
| 1833 |
Generalized cut method for computing the edge-Wiener index
|
Tratnik, Niko
|
|
|
96-97 |
C |
p. 222-233
|
artikel
|
| 1834 |
Generalized degrees and Menger path systems
|
Faudree, R.J.
|
|
1992
|
96-97 |
C |
p. 179-191
13 p.
|
artikel
|
| 1835 |
Generalized distance spectral characterizations of graphs based on Smith Norm Form
|
Qiu, Lihong
|
|
|
96-97 |
C |
p. 159-168
|
artikel
|
| 1836 |
Generalized fault-tolerance for enhanced hypercubes
|
Ma, Meijie
|
|
|
96-97 |
C |
p. 244-252
|
artikel
|
| 1837 |
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees
|
Hellmuth, Marc
|
|
2019
|
96-97 |
C |
p. 1-11
|
artikel
|
| 1838 |
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees
|
Hellmuth, Marc
|
|
|
96-97 |
C |
p. 495-511
|
artikel
|
| 1839 |
Generalized local branching heuristics and the capacitated ring tree problem
|
Hill, Alessandro
|
|
2018
|
96-97 |
C |
p. 34-52
|
artikel
|
| 1840 |
Generalized matroid matching
|
Recski, András
|
|
|
96-97 |
C |
p. 129-133
|
artikel
|
| 1841 |
Generalized minor inequalities for the set covering polyhedron related to circulant matrices
|
Tolomei, Paola B.
|
|
2016
|
96-97 |
C |
p. 214-222
|
artikel
|
| 1842 |
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms
|
Nguyen, Minh Hieu
|
|
|
96-97 |
C |
p. 71-90
|
artikel
|
| 1843 |
Generalized saturation game
|
Patkós, Balázs
|
|
|
96-97 |
C |
p. 33-49
|
artikel
|
| 1844 |
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
|
Żak, Andrzej
|
|
2019
|
96-97 |
C |
p. 299-306
|
artikel
|
| 1845 |
General multiplicative Zagreb indices of trees
|
Vetrík, Tomáš
|
|
|
96-97 |
C |
p. 341-351
|
artikel
|
| 1846 |
General properties on Sombor indices
|
Rada, Juan
|
|
|
96-97 |
C |
p. 87-97
|
artikel
|
| 1847 |
General Randić index of unicyclic graphs with given diameter
|
Alfuraidan, Monther Rashed
|
|
|
96-97 |
C |
p. 7-16
|
artikel
|
| 1848 |
General Randić matrix and general Randić incidence matrix
|
Liu, Ruifang
|
|
2015
|
96-97 |
C |
p. 168-175
8 p.
|
artikel
|
| 1849 |
General sum-connectivity index of unicyclic graphs with given diameter
|
Alfuraidan, Monther Rashed
|
|
|
96-97 |
C |
p. 39-46
|
artikel
|
| 1850 |
General sum-connectivity index of unicyclic graphs with given maximum degree
|
Swartz, Elize
|
|
|
96-97 |
C |
p. 238-249
|
artikel
|
| 1851 |
General upper bound on the game domination number
|
Bujtás, Csilla
|
|
|
96-97 |
C |
p. 530-538
|
artikel
|
| 1852 |
General upper bounds on independent
k
-rainbow domination
|
Fujita, Shinya
|
|
2019
|
96-97 |
C |
p. 105-113
|
artikel
|
| 1853 |
Generating all minimal petri net unsolvable binary words
|
Erofeev, Evgeny
|
|
|
96-97 |
C |
p. 35-53
|
artikel
|
| 1854 |
Generating binary partial Hadamard matrices
|
Álvarez, V.
|
|
2019
|
96-97 |
C |
p. 2-7
|
artikel
|
| 1855 |
Generating carbon nanotube caps of almost all chiralities, using six molecular segment types
|
Amsharov, Konstantin
|
|
|
96-97 |
C |
p. 55-60
|
artikel
|
| 1856 |
Generating irreducible copositive matrices using the stable set problem
|
Dickinson, Peter J.C.
|
|
|
96-97 |
C |
p. 103-117
|
artikel
|
| 1857 |
Generating minimal redundant and maximal irredundant subhypergraphs
|
Boros, Endre
|
|
|
96-97 |
C |
p. 217-229
|
artikel
|
| 1858 |
Generating the states of a binary stochastic system
|
Shier, D.R.
|
|
1992
|
96-97 |
C |
p. 489-500
12 p.
|
artikel
|
| 1859 |
Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
|
Minamikawa, Norito
|
|
|
96-97 |
C |
p. 43-67
|
artikel
|
| 1860 |
Geodetic convexity parameters for
(
q
,
q
−
4
)
-graphs
|
Dourado, Mitre C.
|
|
2017
|
96-97 |
C |
p. 64-71
8 p.
|
artikel
|
| 1861 |
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
|
Mudgal, Apurva
|
|
2016
|
96-97 |
C |
p. 143-162
20 p.
|
artikel
|
| 1862 |
Geometry of gross substitutes valuations
|
de Vries, Sven
|
|
|
96-97 |
C |
p. 16-23
|
artikel
|
| 1863 |
Glimpses are forever in RC4 amidst the spectre of biases
|
Chakraborty, Chandratop
|
|
|
96-97 |
C |
p. 84-102
|
artikel
|
| 1864 |
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs
|
van Aardt, Susan A.
|
|
2016
|
96-97 |
C |
p. 171-179
9 p.
|
artikel
|
| 1865 |
Global cycle properties of locally isometric graphs
|
Borchert, Adam
|
|
2016
|
96-97 |
C |
p. 16-26
11 p.
|
artikel
|
| 1866 |
Global defensive alliances in the lexicographic product of paths and cycles
|
Barbosa, Rommel M.
|
|
|
96-97 |
C |
p. 168-188
|
artikel
|
| 1867 |
Global edge alliances in graphs
|
Lewoń, Robert
|
|
2019
|
96-97 |
C |
p. 305-315
|
artikel
|
| 1868 |
Global majority consensus by local majority polling on graphs of a given degree sequence
|
Abdullah, Mohammed Amin
|
|
2015
|
96-97 |
C |
p. 1-10
10 p.
|
artikel
|
| 1869 |
Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
|
Clinch, Katie
|
|
|
96-97 |
C |
p. 241-261
|
artikel
|
| 1870 |
Global Roman domination in graphs
|
Roushini Leely Pushpam, P.
|
|
2016
|
96-97 |
C |
p. 176-185
10 p.
|
artikel
|
| 1871 |
Global security in claw-free cubic graphs
|
Jesse-Józefczyk, Katarzyna
|
|
2014
|
96-97 |
C |
p. 11-23
13 p.
|
artikel
|
| 1872 |
Global triple Roman dominating function
|
Nahani Pour, F.
|
|
|
96-97 |
C |
p. 228-237
|
artikel
|
| 1873 |
Going Wide with the 1-2-3 Conjecture
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 15-32
|
artikel
|
| 1874 |
Good characterizations and linear time recognition for 2-probe block graphs
|
Le, Van Bang
|
|
2017
|
96-97 |
C |
p. 181-189
9 p.
|
artikel
|
| 1875 |
Graceful colorings of graphs with maximum degree three
|
Pantoja, Paola T.
|
|
|
96-97 |
C |
p. 75-96
|
artikel
|
| 1876 |
Graft Analogue of general Kotzig–Lovász decomposition
|
Kita, Nanao
|
|
|
96-97 |
C |
p. 355-364
|
artikel
|
| 1877 |
Grammars and clique-width bounds from split decompositions
|
Courcelle, Bruno
|
|
|
96-97 |
C |
p. 93-117
|
artikel
|
| 1878 |
Graph classes and Ramsey numbers
|
Belmonte, Rémy
|
|
2014
|
96-97 |
C |
p. 16-27
12 p.
|
artikel
|
| 1879 |
Graph classes with and without powers of bounded clique-width
|
Bonomo, Flavia
|
|
2016
|
96-97 |
C |
p. 3-15
13 p.
|
artikel
|
| 1880 |
Graph clustering with Boltzmann machines
|
Miasnikof, Pierre
|
|
|
96-97 |
C |
p. 208-223
|
artikel
|
| 1881 |
Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
|
Cailloux, Jocelin
|
|
|
96-97 |
C |
p. 200-222
|
artikel
|
| 1882 |
Graph curvature via resistance distance
|
Devriendt, Karel
|
|
|
96-97 |
C |
p. 68-78
|
artikel
|
| 1883 |
Graph exploration by a deterministic memoryless automaton with pebbles
|
Pattanayak, Debasish
|
|
|
96-97 |
C |
p. 149-160
|
artikel
|
| 1884 |
Graph extensions, edit number and regular graphs
|
Ganesan, Ghurumuruhan
|
|
2019
|
96-97 |
C |
p. 269-275
|
artikel
|
| 1885 |
Graph grabbing game on totally-weighted graphs
|
Matsumoto, Naoki
|
|
|
96-97 |
C |
p. 384-390
|
artikel
|
| 1886 |
Graphical representations of cyclic permutation groups
|
Grech, Mariusz
|
|
|
96-97 |
C |
p. 172-179
|
artikel
|
| 1887 |
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding
|
Zhang, Xiaohui
|
|
|
96-97 |
C |
p. 37-46
|
artikel
|
| 1888 |
Graphic sequences, distances and
k
-degree anonymity
|
Salas, Julián
|
|
2015
|
96-97 |
C |
p. 25-31
7 p.
|
artikel
|
| 1889 |
Graph indices via the AM–GM inequality
|
Sababheh, M.
|
|
2017
|
96-97 |
C |
p. 100-111
12 p.
|
artikel
|
| 1890 |
Graph metric with no proper inclusion between lines
|
Chen, Xiaomin
|
|
2015
|
96-97 |
C |
p. 59-70
12 p.
|
artikel
|
| 1891 |
Graph multi-coloring for a job scheduling application
|
Thevenin, Simon
|
|
2018
|
96-97 |
C |
p. 218-235
|
artikel
|
| 1892 |
Graph odometry
|
Dutle, Aaron
|
|
2016
|
96-97 |
C |
p. 108-115
8 p.
|
artikel
|
| 1893 |
Graph partition into small cliques
|
Yan, Jin
|
|
2014
|
96-97 |
C |
p. 322-327
6 p.
|
artikel
|
| 1894 |
Graph pebbling algorithms and Lemke graphs
|
Cusack, Charles A.
|
|
2019
|
96-97 |
C |
p. 72-82
|
artikel
|
| 1895 |
Graph polynomials and paintability of plane graphs
|
Grytczuk, Jarosław
|
|
|
96-97 |
C |
p. 71-79
|
artikel
|
| 1896 |
Graph products of the trivariate total domination polynomial and related polynomials
|
Dod, Markus
|
|
2016
|
96-97 |
C |
p. 92-101
10 p.
|
artikel
|
| 1897 |
Graph
r
-hued colorings—A survey
|
Chen, Ye
|
|
|
96-97 |
C |
p. 24-48
|
artikel
|
| 1898 |
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
|
Matamala, Martín
|
|
|
96-97 |
C |
p. 246-251
|
artikel
|
| 1899 |
Graphs and digraphs represented by intervals and circular arcs
|
Das, Ashok Kumar
|
|
2017
|
96-97 |
C |
p. 41-49
9 p.
|
artikel
|
| 1900 |
Graphs
G
in which
G
−
N
[
v
]
has a prescribed property for each vertex
v
|
Zhang, Bo
|
|
|
96-97 |
C |
p. 13-20
|
artikel
|
| 1901 |
Graphs
G
with nullity
2
c
(
G
)
+
p
(
G
)
−
1
|
Chang, Sarula
|
|
|
96-97 |
C |
p. 38-58
|
artikel
|
| 1902 |
Graphs inducing totally balanced and submodular Chinese postman games
|
Albizuri, M. Josune
|
|
2014
|
96-97 |
C |
p. 98-103
6 p.
|
artikel
|
| 1903 |
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
|
Boyacı, Arman
|
|
2016
|
96-97 |
C |
p. 47-60
14 p.
|
artikel
|
| 1904 |
Graphs of
f
-class 1
|
Zhang, Xia
|
|
2017
|
96-97 |
C |
p. 197-204
8 p.
|
artikel
|
| 1905 |
Graphs of small rank-width are pivot-minors of graphs of small tree-width
|
Kwon, O-joung
|
|
2014
|
96-97 |
C |
p. 108-118
11 p.
|
artikel
|
| 1906 |
Graphs on alphabets as models for large interconnection networks
|
Gómez, J.
|
|
1992
|
96-97 |
C |
p. 227-243
17 p.
|
artikel
|
| 1907 |
Graphs whose Wiener index does not change when a specific vertex is removed
|
Knor, Martin
|
|
2018
|
96-97 |
C |
p. 126-132
|
artikel
|
| 1908 |
Graphs with a unique maximum independent set up to automorphisms
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 124-135
|
artikel
|
| 1909 |
Graphs with degree sequence
{
(
m
−
1
)
m
,
(
n
−
1
)
n
}
and
{
m
n
,
n
m
}
|
Brimkov, Boris
|
|
|
96-97 |
C |
p. 477-486
|
artikel
|
| 1910 |
Graphs with doubly resolving number 2
|
Jannesari, Mohsen
|
|
|
96-97 |
C |
p. 178-183
|
artikel
|
| 1911 |
Graphs with each edge in at most one maximum matching
|
Niu, Mengyuan
|
|
|
96-97 |
C |
p. 70-74
|
artikel
|
| 1912 |
Graphs with few
P
4
’s under the convexity of paths of order three
|
Campos, Victor
|
|
2015
|
96-97 |
C |
p. 28-39
12 p.
|
artikel
|
| 1913 |
Graphs with integer matching polynomial zeros
|
Akbari, S.
|
|
2017
|
96-97 |
C |
p. 1-8
8 p.
|
artikel
|
| 1914 |
Graphs with many edge-colorings such that complete graphs are rainbow
|
Bastos, Josefran de O.
|
|
|
96-97 |
C |
p. 151-164
|
artikel
|
| 1915 |
Graphs with maximal
σ
irregularity
|
Abdo, Hosam
|
|
2018
|
96-97 |
C |
p. 57-64
|
artikel
|
| 1916 |
Graphs with maximum size and given paired-domination number
|
Henning, Michael A.
|
|
2014
|
96-97 |
C |
p. 72-82
11 p.
|
artikel
|
| 1917 |
Graphs with minimum fractional domatic number
|
Gadouleau, Maximilien
|
|
|
96-97 |
C |
p. 140-148
|
artikel
|
| 1918 |
Graphs without gap-vertex-labellings: Families and bounds
|
Weffort-Santos, Celso A.
|
|
|
96-97 |
C |
p. 317-335
|
artikel
|
| 1919 |
Graphs with small diameter after edge deletion
|
Chung, F.R.K.
|
|
1992
|
96-97 |
C |
p. 73-94
22 p.
|
artikel
|
| 1920 |
Graphs with small fall-spectrum
|
Silva, Ana
|
|
2019
|
96-97 |
C |
p. 183-188
|
artikel
|
| 1921 |
Graphs with small Italian domatic number
|
Gallegos, Keith
|
|
|
96-97 |
C |
p. 20-31
|
artikel
|
| 1922 |
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
|
Bessy, Stéphane
|
|
|
96-97 |
C |
p. 195-200
|
artikel
|
| 1923 |
Graphs with two trivial critical ideals
|
Alfaro, Carlos A.
|
|
2014
|
96-97 |
C |
p. 33-44
12 p.
|
artikel
|
| 1924 |
Graph vulnerability parameters, compression, and quasi-threshold graphs
|
Kahl, Nathan
|
|
2019
|
96-97 |
C |
p. 119-126
|
artikel
|
| 1925 |
Graph vulnerability parameters, compression, and threshold graphs
|
Kahl, Nathan
|
|
|
96-97 |
C |
p. 108-116
|
artikel
|
| 1926 |
Greedy balanced pairs in
N
-free ordered sets
|
Zaguia, Imed
|
|
|
96-97 |
C |
p. 539-544
|
artikel
|
| 1927 |
Greedy flipping of pancakes and burnt pancakes
|
Sawada, Joe
|
|
2016
|
96-97 |
C |
p. 61-74
|
artikel
|
| 1928 |
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
|
De Agostino, Sergio
|
|
|
96-97 |
C |
p. 200-206
|
artikel
|
| 1929 |
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem
|
Andres, Stephan Dominique
|
|
|
96-97 |
C |
p. 4-7
|
artikel
|
| 1930 |
Green functions on product networks
|
Araúz, C.
|
|
2019
|
96-97 |
C |
p. 22-34
|
artikel
|
| 1931 |
Grid obstacle representation of graphs
|
Bishnu, Arijit
|
|
|
96-97 |
C |
p. 39-51
|
artikel
|
| 1932 |
Grid spanners with low forwarding index for energy efficient networks
|
Giroire, Frédéric
|
|
2018
|
96-97 |
C |
p. 99-107
|
artikel
|
| 1933 |
Grünbaum colorings of triangulations on the projective plane
|
Kasai, Michiko
|
|
2016
|
96-97 |
C |
p. 155-163
9 p.
|
artikel
|
| 1934 |
Group centralization of network indices
|
Krnc, Matjaž
|
|
2015
|
96-97 |
C |
p. 147-157
11 p.
|
artikel
|
| 1935 |
Group connectivity of graphs satisfying the Chvátal-condition
|
Yang, Na
|
|
|
96-97 |
C |
p. 212-217
|
artikel
|
| 1936 |
Group distance magic labeling of tetravalent circulant graphs
|
Deng, Guixin
|
|
|
96-97 |
C |
p. 19-26
|
artikel
|
| 1937 |
Group inverse of the Laplacian of connections of networks
|
Gago, S.
|
|
2019
|
96-97 |
C |
p. 152-159
|
artikel
|
| 1938 |
Group parking permit problems
|
de Lima, Murilo Santos
|
|
|
96-97 |
C |
p. 172-194
|
artikel
|
| 1939 |
Grundy dominating sequences on
X
-join product
|
Nasini, Graciela
|
|
|
96-97 |
C |
p. 138-149
|
artikel
|
| 1940 |
Grundy packing coloring of graphs
|
Gözüpek, Didem
|
|
|
96-97 |
C |
p. 17-30
|
artikel
|
| 1941 |
Guessing fractions of online sequences
|
Konrad, Christian
|
|
|
96-97 |
C |
p. 147-161
|
artikel
|
| 1942 |
Guest editors’ foreword
|
Heggernes, Pinar
|
|
2014
|
96-97 |
C |
p. 1-2
2 p.
|
artikel
|
| 1943 |
Half-regular factorizations of the complete bipartite graph
|
Aksen, Mark
|
|
2017
|
96-97 |
C |
p. 21-33
13 p.
|
artikel
|
| 1944 |
Hamilton-connected claw-free graphs with Ore-degree conditions
|
Liu, Xia
|
|
|
96-97 |
C |
p. 130-139
|
artikel
|
| 1945 |
Hamilton cycles in sparse locally connected graphs
|
van Aardt, Susan A.
|
|
2019
|
96-97 |
C |
p. 276-288
|
artikel
|
| 1946 |
Hamiltonian and long cycles in bipartite graphs with connectivity
|
Gan, Zhiyong
|
|
|
96-97 |
C |
p. 49-64
|
artikel
|
| 1947 |
Hamiltonian cycles and paths in faulty twisted hypercubes
|
Liu, Huiqing
|
|
2019
|
96-97 |
C |
p. 243-249
|
artikel
|
| 1948 |
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
|
Li, Ruijuan
|
|
|
96-97 |
C |
p. 451-458
|
artikel
|
| 1949 |
Hamiltonian cycles in covering graphs of trees
|
Hell, Pavol
|
|
|
96-97 |
C |
p. 271-281
|
artikel
|
| 1950 |
Hamiltonian cycles in linear-convex supergrid graphs
|
Hung, Ruo-Wei
|
|
2016
|
96-97 |
C |
p. 99-112
14 p.
|
artikel
|
| 1951 |
Hamiltonian cycles in spanning subgraphs of line graphs
|
Li, Hao
|
|
2016
|
96-97 |
C |
p. 287-295
9 p.
|
artikel
|
| 1952 |
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
|
Reis, C.S.
|
|
2015
|
96-97 |
C |
p. 82-86
5 p.
|
artikel
|
| 1953 |
Hamiltonian laceability in hypercubes with faulty edges
|
Wang, Fan
|
|
2018
|
96-97 |
C |
p. 438-445
|
artikel
|
| 1954 |
Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
|
Cheng, Dongqin
|
|
2019
|
96-97 |
C |
p. 56-71
|
artikel
|
| 1955 |
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
|
Xue, Shudan
|
|
|
96-97 |
C |
p. 68-80
|
artikel
|
| 1956 |
Hamiltonian properties of some compound networks
|
Qin, Xiao-Wen
|
|
2018
|
96-97 |
C |
p. 174-182
|
artikel
|
| 1957 |
Hamiltonicity of covering graphs of trees
|
Bradshaw, Peter
|
|
|
96-97 |
C |
p. 449-464
|
artikel
|
| 1958 |
Hamiltonicity of locally hamiltonian and locally traceable graphs
|
de Wet, Johan P.
|
|
2018
|
96-97 |
C |
p. 137-152
|
artikel
|
| 1959 |
Hamming weights of symmetric Boolean functions
|
Cusick, Thomas W.
|
|
2016
|
96-97 |
C |
p. 14-19
6 p.
|
artikel
|
| 1960 |
Hardness and approximation for L-EPG and
B
1
-EPG graphs
|
Epstein, Dror
|
|
|
96-97 |
C |
p. 224-228
|
artikel
|
| 1961 |
Hardness and approximation of the asynchronous border minimization problem
|
Li, Cindy Y.
|
|
2018
|
96-97 |
C |
p. 101-117
|
artikel
|
| 1962 |
Hardness and efficiency on
t
-admissibility for graph operations
|
Couto, Fernanda
|
|
|
96-97 |
C |
p. 342-348
|
artikel
|
| 1963 |
Hardness of
k
-anonymous microaggregation
|
Thaeter, Florian
|
|
|
96-97 |
C |
p. 149-158
|
artikel
|
| 1964 |
Hardness of learning loops, monoids, and semirings
|
Chang, Ching-Lueh
|
|
2014
|
96-97 |
C |
p. 149-158
10 p.
|
artikel
|
| 1965 |
Hardness results of global roman domination in graphs
|
Panda, B.S.
|
|
|
96-97 |
C |
p. 337-348
|
artikel
|
| 1966 |
Hardness results of global total
k
-domination problem in graphs
|
Panda, B.S.
|
|
|
96-97 |
C |
p. 223-238
|
artikel
|
| 1967 |
Hardness transitions and uniqueness of acyclic colouring
|
M.A., Shalu
|
|
|
96-97 |
C |
p. 77-98
|
artikel
|
| 1968 |
Harmonic index of a line graph
|
Wang, Tao
|
|
|
96-97 |
C |
p. 284-296
|
artikel
|
| 1969 |
Hart and Mas-Colell consistency in PERT problems
|
Bergantiños, Gustavo
|
|
2018
|
96-97 |
C |
p. 11-20
|
artikel
|
| 1970 |
H
-colouring
P
t
-free graphs in subexponential time
|
Groenland, Carla
|
|
2019
|
96-97 |
C |
p. 184-189
|
artikel
|
| 1971 |
Hereditary classes of graphs: A parametric approach
|
Lozin, Vadim
|
|
|
96-97 |
C |
p. 134-151
|
artikel
|
| 1972 |
Heuristics for the Steiner problem in graphs
|
Plesník, J.
|
|
1992
|
96-97 |
C |
p. 451-463
13 p.
|
artikel
|
| 1973 |
Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures
|
Zhang, Yi
|
|
2018
|
96-97 |
C |
p. 144-157
|
artikel
|
| 1974 |
Higher order matching preclusion for regular interconnection networks
|
Cheng, Eddie
|
|
|
96-97 |
C |
p. 107-124
|
artikel
|
| 1975 |
Hitting sets online and unique-max coloring
|
Even, Guy
|
|
2014
|
96-97 |
C |
p. 71-82
12 p.
|
artikel
|
| 1976 |
Homogeneous sets, clique-separators, critical graphs, and optimal
χ
-binding functions
|
Brause, Christoph
|
|
|
96-97 |
C |
p. 211-222
|
artikel
|
| 1977 |
Homomorphic extensions of CRT-based secret sharing
|
Ersoy, Oğuzhan
|
|
|
96-97 |
C |
p. 317-329
|
artikel
|
| 1978 |
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 |
C |
p. 40-51
|
artikel
|
| 1979 |
Homothetic polygons and beyond: Maximal cliques in intersection graphs
|
Brimkov, Valentin E.
|
|
|
96-97 |
C |
p. 263-277
|
artikel
|
| 1980 |
Hosoya index of thorny polymers
|
Došlić, Tomislav
|
|
|
96-97 |
C |
p. 277-287
|
artikel
|
| 1981 |
Hosoya index of VDB-weighted graphs
|
Cruz, Roberto
|
|
|
96-97 |
C |
p. 18-25
|
artikel
|
| 1982 |
House of Graphs 2.0: A database of interesting graphs and more
|
Coolsaet, Kris
|
|
|
96-97 |
C |
p. 97-107
|
artikel
|
| 1983 |
House-swapping with divorcing and engaged pairs
|
Cechlárová, Katarína
|
|
2016
|
96-97 |
C |
p. 1-8
8 p.
|
artikel
|
| 1984 |
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
|
Fischer, Mareike
|
|
|
96-97 |
C |
p. 303-320
|
artikel
|
| 1985 |
How long does it take for all users in a social network to choose their communities?
|
Bermond, Jean-Claude
|
|
2019
|
96-97 |
C |
p. 37-57
|
artikel
|
| 1986 |
How many double squares can a string contain?
|
Deza, Antoine
|
|
2015
|
96-97 |
C |
p. 52-69
18 p.
|
artikel
|
| 1987 |
How to build a graph in
n
days: Some variations of graph assembly
|
Dougherty, Aria L.
|
|
|
96-97 |
C |
p. 20-28
|
artikel
|
| 1988 |
How to pack directed acyclic graphs into small blocks
|
Asahiro, Yuichi
|
|
|
96-97 |
C |
p. 91-113
|
artikel
|
| 1989 |
How tree-based is my network? Proximity measures for unrooted phylogenetic networks
|
Fischer, Mareike
|
|
|
96-97 |
C |
p. 98-114
|
artikel
|
| 1990 |
H
-sequences and 2-step coreness in graphs
|
Wu, Jianliang
|
|
|
96-97 |
C |
p. 258-268
|
artikel
|
| 1991 |
Hull and geodetic numbers for some classes of oriented graphs
|
Araújo, J.
|
|
|
96-97 |
C |
p. 14-27
|
artikel
|
| 1992 |
Hull number:
P
5
-free graphs and reduction rules
|
Araujo, J.
|
|
2016
|
96-97 |
C |
p. 171-175
|
artikel
|
| 1993 |
Hybrid intermittent fault diagnosis of general graphs
|
Yang, Lulu
|
|
|
96-97 |
C |
p. 16-32
|
artikel
|
| 1994 |
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 |
C |
p. 50-59
|
artikel
|
| 1995 |
Hyper
K
1
,
r
and sub-
K
1
,
r
fault tolerance of star graphs
|
Yang, Yuxing
|
|
|
96-97 |
C |
p. 172-177
|
artikel
|
| 1996 |
Hyperspherical embedding of graphs and networks in communicability spaces
|
Estrada, Ernesto
|
|
|
96-97 |
C |
p. 53-77
|
artikel
|
| 1997 |
Identifying codes and searching with balls in graphs
|
Kim, Younjin
|
|
2015
|
96-97 |
C |
p. 39-47
9 p.
|
artikel
|
| 1998 |
Identifying codes in the direct product of a complete graph and some special graphs
|
Lu, Mei
|
|
2019
|
96-97 |
C |
p. 175-182
|
artikel
|
| 1999 |
Identifying codes of corona product graphs
|
Feng, Min
|
|
2014
|
96-97 |
C |
p. 88-96
9 p.
|
artikel
|
| 2000 |
Identifying codes on directed de Bruijn graphs
|
Boutin, Debra
|
|
2019
|
96-97 |
C |
p. 29-41
|
artikel
|
Tijdschrift beschrijving