Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
   volgende >>
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             2883 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A 9 7 -approximation algorithm for Graphic TSP in cubic bipartite graphs Karp, Jeremy A.
2016
81-90 C p. 164-216
53 p.
artikel
2 A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality Mohan, Usha
2019
81-90 C p. 108-118
artikel
3 A 5 4 -approximation for subcubic 2EC using circulations and obliged edges Boyd, Sylvia
2016
81-90 C p. 48-58
11 p.
artikel
4 A 3 4 -approximation of Vizing’s conjecture for claw-free graphs Brešar, Boštjan

81-90 C p. 416-422
artikel
5 Abelian borders in binary words Christodoulakis, Manolis
2014
81-90 C p. 141-146
6 p.
artikel
6 A bijection between bargraphs and Dyck paths Deutsch, Emeric
2018
81-90 C p. 340-344
artikel
7 A Boolean theory of signatures for tonal scales Simeone, B.
2014
81-90 C p. 283-294
12 p.
artikel
8 A bounded-risk mechanism for the kidney exchange game Esfandiari, Hossein
2018
81-90 C p. 46-53
artikel
9 A bound for judicious k -partitions of graphs Fan, Genghua
2014
81-90 C p. 86-99
14 p.
artikel
10 About some robustness and complexity properties of G -graphs networks Culus, Jean-François
2015
81-90 C p. 34-45
12 p.
artikel
11 About the minimum mean cycle-canceling algorithm Gauthier, Jean Bertrand
2015
81-90 C p. 115-134
20 p.
artikel
12 About the number of directed paths in tournaments El Sahili, Amine

81-90 C p. 115-126
artikel
13 A branch-and-cut algorithm for the maximum k -balanced subgraph of a signed graph Figueiredo, Rosa
2019
81-90 C p. 164-185
artikel
14 A branch-and-cut algorithm for the soft-clustered vehicle-routing problem Heßler, Katrin

81-90 C p. 218-234
artikel
15 A branch-and-price algorithm for the robust graph coloring problem Archetti, Claudia
2014
81-90 C p. 49-59
11 p.
artikel
16 A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand Bianchessi, Nicola

81-90 C p. 152-170
artikel
17 ( a , b ) -rectangle patterns in permutations and words Kitaev, Sergey
2015
81-90 C p. 128-146
19 p.
artikel
18 A brief history of parameterized matching problems Mendivelso, Juan

81-90 C p. 103-115
artikel
19 Absolute algebraic connectivity of double brooms and trees Richter, Sebastian
2016
81-90 C p. 213-221
9 p.
artikel
20 Accelerated partial decoding in wavelet trees Baruch, Gilad

81-90 C p. 2-10
artikel
21 Accuracy of techniques for the logical analysis of data Anthony, Martin
1999
81-90 C p. 247-257
11 p.
artikel
22 A characterisation of clique-width through nested partitions Courcelle, Bruno
2015
81-90 C p. 70-81
12 p.
artikel
23 A characterization of balanced Boolean functions with optimal algebraic immunity Xie, Tao

81-90 C p. 186-196
artikel
24 A characterization of dissimilarity families of trees Baldisserri, Agnese
2017
81-90 C p. 35-45
11 p.
artikel
25 A characterization of double Roman trees Henning, Michael A.
2019
81-90 C p. 100-111
artikel
26 A characterization of edge b-critical graphs Bendali-Braham, Amel
2018
81-90 C p. 158-160
artikel
27 A characterization of line graphs that are squares of graphs Milanič, Martin
2014
81-90 C p. 83-91
9 p.
artikel
28 A characterization of nested canalyzing functions with maximum average sensitivity Stearns, Richard E.
2018
81-90 C p. 5-14
artikel
29 A characterization of perfect Roman trees Sheikholeslami, S.M.

81-90 C p. 501-508
artikel
30 A characterization of P 5 -free, diameter-2-critical graphs Haynes, Teresa W.
2014
81-90 C p. 135-139
5 p.
artikel
31 A characterization of P 5 -free graphs with a homeomorphically irreducible spanning tree Diemunsch, Jennifer
2015
81-90 C p. 71-78
8 p.
artikel
32 A characterization of some families of Cohen–Macaulay, Gorenstein and/or Buchsbaum rings García-García, J.I.
2019
81-90 C p. 166-176
artikel
33 A characterization of substar graphs Joos, Felix
2014
81-90 C p. 115-118
4 p.
artikel
34 A characterization of the non-trivial diameter two graphs of minimum size Henning, Michael A.
2015
81-90 C p. 91-95
5 p.
artikel
35 A characterization of the resonance graph of an outerplane bipartite graph Che, Zhongyuan
2019
81-90 C p. 264-268
artikel
36 A classification of edge-colored graphs based on properly colored walks Li, Ruonan

81-90 C p. 590-595
artikel
37 A class of asymptotically optimal group screening strategies with limited item participation Cheng, Yongxi
2019
81-90 C p. 83-95
artikel
38 A class of asymptotically optimal group testing strategies to identify good items Cheng, Yongxi
2019
81-90 C p. 109-116
artikel
39 A class of functions with low-valued Walsh spectrum Li, Fengwei

81-90 C p. 92-105
artikel
40 A class of spectral bounds for Max k -Cut Anjos, Miguel F.

81-90 C p. 12-24
artikel
41 A class of three-weight and five-weight linear codes Li, Fei
2018
81-90 C p. 25-38
artikel
42 A coloring algorithm for 4 K 1 -free line graphs Fraser, Dallas J.
2018
81-90 C p. 76-85
artikel
43 A combinatorial formula for the Schur coefficients of chromatic symmetric functions Wang, David G.L.

81-90 C p. 621-630
artikel
44 A comparison of integer programming models for the partial directed weighted improper coloring problem Hertz, Alain
2019
81-90 C p. 229-245
artikel
45 A complete characterization of jump inequalities for the hop-constrained shortest path problem Riedl, Wolfgang F.
2017
81-90 C p. 95-113
19 p.
artikel
46 A complexity theory for hard enumeration problems Creignou, Nadia
2019
81-90 C p. 191-209
artikel
47 A computational comparison of compact MILP formulations for the zero forcing number Agra, Agostinho
2019
81-90 C p. 169-183
artikel
48 A computational study of f -reversible processes on graphs Lima, Carlos V.G.C.
2018
81-90 C p. 77-93
artikel
49 A computational substantiation of the d -step approach to the number of distinct squares problem Deza, Antoine
2016
81-90 C p. 81-87
7 p.
artikel
50 A concise characterization of strong knapsack facets Chopra, Sunil
2019
81-90 C p. 136-152
artikel
51 A connected version of the graph coloring game Charpentier, Clément

81-90 C p. 744-750
artikel
52 A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees Xiao, Chuanqi
2017
81-90 C p. 230-234
artikel
53 A constant factor approximation algorithm for boxicity of circular arc graphs Adiga, Abhijin
2014
81-90 C p. 1-18
18 p.
artikel
54 A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs Bouznif, M.
2016
81-90 C p. 27-40
14 p.
artikel
55 A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost Hu, Xuewei

81-90 C p. 407-422
artikel
56 A convexity upper bound for the number of maximal bicliques of a bipartite graph Albano, Alexandre
2014
81-90 C p. 12-24
13 p.
artikel
57 A counterexample to a conjecture on facial unique-maximal colorings Lidický, Bernard
2018
81-90 C p. 123-125
artikel
58 A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs Bowler, N.
2017
81-90 C p. 151-153
3 p.
artikel
59 A counterexample to the pseudo 2-factor isomorphic graph conjecture Goedgebeur, Jan
2015
81-90 C p. 57-60
4 p.
artikel
60 Acyclic edge coloring of graphs Wang, Tao
2014
81-90 C p. 290-303
14 p.
artikel
61 Acyclic 4-edge colouring of non-regular subcubic graphs in linear time Lukot’ka, Robert
2014
81-90 C p. 110-112
3 p.
artikel
62 Adaptive group testing with a constrained number of positive responses improved Damaschke, Peter
2016
81-90 C p. 208-212
5 p.
artikel
63 Adaptive majority problems for restricted query graphs and for weighted sets Damásdi, Gábor

81-90 C p. 235-245
artikel
64 A Dawson-like clustering of human mitochondrial DNA sequences based on protein coding region Soares, Inês
2019
81-90 C p. 139-145
artikel
65 Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56] Aguilera, Néstor E.
2018
81-90 C p. 311-315
artikel
66 Adding isolated vertices makes some greedy online algorithms optimal Boyar, Joan
2018
81-90 C p. 12-21
artikel
67 Addressing graph products and distance-regular graphs Cioabă, Sebastian M.
2017
81-90 C p. 46-54
9 p.
artikel
68 A de Bruijn–Erdös Theorem for ( q , q − 4 ) -graphs Schrader, Rainer

81-90 C p. 198-201
artikel
69 A decision algorithm for reversible pairs of polygons Akiyama, Jin
2014
81-90 C p. 19-26
8 p.
artikel
70 A decomposition of the space of TU-games using addition and transfer invariance Béal, Sylvain
2015
81-90 C p. 1-13
13 p.
artikel
71 A depth-first search algorithm for computing pseudo-closed sets Bazin, Alexandre
2018
81-90 C p. 28-35
artikel
72 A deterministic version of the game of zombies and survivors on graphs Fitzpatrick, S.L.
2016
81-90 C p. 1-12
12 p.
artikel
73 A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs Malyshev, D.S.
2016
81-90 C p. 117-126
10 p.
artikel
74 Adjacency polynomials of digraph transformations Deng, Aiping
2016
81-90 C p. 15-38
24 p.
artikel
75 Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs Tian, Shuangliang
2015
81-90 C p. 220-226
7 p.
artikel
76 Adjoining to ( s , t ) -Wythoff’s game its P -positions as moves Liu, Wen An
2014
81-90 C p. 28-43
16 p.
artikel
77 A doubly nonnegative relaxation for modularity density maximization Izunaga, Yoichi

81-90 C p. 69-78
artikel
78 Advances in Combinatorial Optimization Martello, Silvano
2015
81-90 C p. 1-3
3 p.
artikel
79 Adynamic coloring of graphs Šurimová, Mária

81-90 C p. 224-233
artikel
80 A family of efficient six-regular circulants representable as a Kronecker product Jha, Pranava K.
2016
81-90 C p. 72-84
13 p.
artikel
81 A family of mixed graphs with large order and diameter 2 Araujo-Pardo, G.
2017
81-90 C p. 57-63
7 p.
artikel
82 A fast discovery algorithm for large common connected induced subgraphs Conte, Alessio
2019
81-90 C p. 210-222
artikel
83 A faster algorithm for packing branchings in digraphs Lee, Orlando
2015
81-90 C p. 121-131
11 p.
artikel
84 A faster parameterized algorithm for Pseudoforest Deletion Bodlaender, Hans L.
2018
81-90 C p. 42-56
artikel
85 A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows Alix, Munier Kordon

81-90 C p. 1-6
artikel
86 A formal framework for Stringology Soltys, Michael

81-90 C p. 141-151
artikel
87 A formulation of the wide partition conjecture using the atom problem in discrete tomography Guíñez, Flavio
2014
81-90 C p. 121-130
10 p.
artikel
88 A functional completeness theorem for De Morgan functions Movsisyan, Yu.M.
2014
81-90 C p. 1-16
16 p.
artikel
89 A general compiler for password-authenticated group key exchange protocol in the standard model Wei, Fushan
2018
81-90 C p. 78-86
artikel
90 A generalization of an independent set with application to ( K q ; k ) -stable graphs Żak, Andrzej
2014
81-90 C p. 421-427
7 p.
artikel
91 A generalization of Opsut’s result on the competition numbers of line graphs Kim, Suh-Ryung
2015
81-90 C p. 152-159
8 p.
artikel
92 A generalization of the Haemers–Mathon bound for near hexagons De Bruyn, Bart
2019
81-90 C p. 272-282
artikel
93 Agent incentives of strategic behavior in resource exchange Chen, Zhou
2019
81-90 C p. 15-25
artikel
94 A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm Makuracki, Bartosz
2019
81-90 C p. 25-36
artikel
95 A graph with the partial order competition dimension greater than five Choi, Jihoon
2019
81-90 C p. 262-266
artikel
96 A Hamilton sufficient condition for completely independent spanning tree Hong, Xia

81-90 C p. 183-187
artikel
97 A heuristic approach for searching ( d , n ) -packing colorings of infinite lattices Korže, Danilo
2019
81-90 C p. 353-358
artikel
98 A heuristic for cumulative vehicle routing using column generation Gaur, Daya Ram
2017
81-90 C p. 140-157
18 p.
artikel
99 A hierarchical framework for recovery in compressive sensing Colbourn, Charles J.
2018
81-90 C p. 96-107
artikel
100 A hybrid algorithm with cluster analysis in modelling high dimensional data Tunga, Burcu
2018
81-90 C p. 161-168
artikel
101 A hybrid classifier based on boxes and nearest neighbors Anthony, Martin
2014
81-90 C p. 1-11
11 p.
artikel
102 A hybrid framework of data hiding and encryption in H.264/SVC Liu, Shaohui
2018
81-90 C p. 48-57
artikel
103 A kind of conditional connectivity of transposition networks generated by k -trees Yang, Weihua
2018
81-90 C p. 132-138
artikel
104 A Lex-BFS-based recognition algorithm for Robinsonian matrices Laurent, M.
2017
81-90 C p. 151-165
15 p.
artikel
105 Algebraic bounds for heterogeneous site percolation on directed and undirected graphs Hamilton, Kathleen E.
2017
81-90 C p. 124-142
19 p.
artikel
106 Algorithmic aspects of rotor-routing and the notion of linear equivalence Tóthmérész, Lilla
2018
81-90 C p. 428-437
artikel
107 Algorithmic aspects of switch cographs Cohen-Addad, Vincent
2016
81-90 C p. 23-42
20 p.
artikel
108 Algorithms and applications for a class of bilevel MILPs Poirion, Pierre-Louis

81-90 C p. 75-89
artikel
109 Algorithms for computing the Shapley value of cooperative games on lattices Maafa, Khaled
2018
81-90 C p. 91-105
artikel
110 Algorithms for finding a rooted ( k , 1 ) -edge-connected orientation Király, Csaba
2014
81-90 C p. 263-268
6 p.
artikel
111 Algorithms for finding disjoint path covers in unit interval graphs Park, Jung-Heum
2016
81-90 C p. 132-149
18 p.
artikel
112 Algorithms for linear time reconstruction by discrete tomography Pagani, Silvia M.C.
2019
81-90 C p. 152-170
artikel
113 Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness Zinder, Y.
2015
81-90 C p. 28-53
26 p.
artikel
114 Algorithms for unipolar and generalized split graphs Eschen, Elaine M.
2014
81-90 C p. 195-201
7 p.
artikel
115 Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number Fellows, Michael
2018
81-90 C p. 94-100
artikel
116 Algorithms to approximately count and sample conforming colorings of graphs Miracle, Sarah
2016
81-90 C p. 133-149
artikel
117 A linear algorithm for secure domination in trees Burger, A.P.
2014
81-90 C p. 15-27
13 p.
artikel
118 A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs Pandit, Parthe
2018
81-90 C p. 155-169
artikel
119 A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout Shalini, Arul Jeya

81-90 C p. 10-18
artikel
120 A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph Ihm, Insung
2017
81-90 C p. 98-112
15 p.
artikel
121 A linear-time algorithm for testing full outer-2-planarity Hong, Seok-Hee
2019
81-90 C p. 234-257
artikel
122 A linear-time kernelization for the Rooted k -Leaf Outbranching Problem Kammer, Frank
2015
81-90 C p. 126-138
13 p.
artikel
123 Alliance polynomial of regular graphs Carballosa, Walter
2017
81-90 C p. 22-32
11 p.
artikel
124 Alliances in graphs of bounded clique-width Kiyomi, Masashi
2017
81-90 C p. 91-97
7 p.
artikel
125 All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs Wu, Haibo
2019
81-90 C p. 196-203
artikel
126 All-to-all broadcast problem of some classes of graphs under the half duplex all-port model Chang, Fei-Huang
2014
81-90 C p. 28-34
7 p.
artikel
127 Almost all regular graphs are normal Changiz Rezaei, Seyed Saeed
2017
81-90 C p. 51-55
5 p.
artikel
128 Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees Darties, Benoît
2018
81-90 C p. 124-136
artikel
129 Almost empty monochromatic triangles in planar point sets Basu, Deepan
2016
81-90 C p. 207-213
artikel
130 Almost every graph is divergent under the biclique operator Groshaus, Marina
2016
81-90 C p. 130-140
11 p.
artikel
131 A lower bound for radio k -chromatic number Saha, Laxman
2015
81-90 C p. 87-100
14 p.
artikel
132 A lower bound on the crossing number of uniform hypergraphs Anshu, Anurag
2016
81-90 C p. 11-15
5 p.
artikel
133 A lower bound on the independence number of a graph in terms of degrees and local clique sizes Brause, C.
2016
81-90 C p. 59-67
9 p.
artikel
134 A lower bound on the order of the largest induced forest in planar graphs with high girth Dross, François
2016
81-90 C p. 99-107
9 p.
artikel
135 A lower bound on the zero forcing number Davila, Randy
2018
81-90 C p. 363-367
artikel
136 Alternating kernels Delgado-Escalante, Pietra
2018
81-90 C p. 153-164
artikel
137 Alternative formulations for the obnoxious p-median problem Lin, Chang-Chun

81-90 C p. 366-373
artikel
138 A magic rectangle set on Abelian groups and its application Cichacz, Sylwia

81-90 C p. 201-210
artikel
139 A map of the P -positions in ‘Nim With a Pass’ played on heap sizes of at most four Chan, W.H.
2018
81-90 C p. 44-55
artikel
140 A matheuristic for the asymmetric capacitated vehicle routing problem Leggieri, Valeria
2018
81-90 C p. 139-150
artikel
141 A maximizing characteristic for critical configurations of chip-firing games on digraphs Nguyen, Hoang Thach
2018
81-90 C p. 38-46
artikel
142 Ambiguity and deficiency for differentially 4 -uniform monomial permutations on F 2 n Yan, Yang
2018
81-90 C p. 175-183
artikel
143 A measure for a balanced workload and its extremal values Govorčin, Jelena
2016
81-90 C p. 59-66
8 p.
artikel
144 Ameso optimization: A relaxation of discrete midpoint convexity Chen, Wen

81-90 C p. 177-192
artikel
145 A method for computing local contributions to graph energy based on Estrada–Benzi approach Safaei, F.
2019
81-90 C p. 214-226
artikel
146 A method for constructing artificial DNA libraries based on generalized de Bruijn sequences Kozak, Adam
2019
81-90 C p. 127-144
artikel
147 A minimax result for perfect matchings of a polyomino graph Zhou, Xiangqian
2016
81-90 C p. 165-171
7 p.
artikel
148 A min – max relation in flowgraphs and some applications Ferreira, Carlos Eduardo
2018
81-90 C p. 65-76
artikel
149 A model for finding transition-minors Klocker, Benedikt

81-90 C p. 242-264
artikel
150 A modified bootstrap percolation on a random graph coupled with a lattice Janson, Svante
2019
81-90 C p. 152-165
artikel
151 Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order Pai, Kung-Jui
2019
81-90 C p. 223-236
artikel
152 A multiobjective optimization algorithm for the weighted LCS Becerra, David
2016
81-90 C p. 37-47
11 p.
artikel
153 An A B C -Problem for location and consensus functions on graphs McMorris, F.R.
2016
81-90 C p. 15-28
14 p.
artikel
154 An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services Bruglieri, Maurizio
2019
81-90 C p. 185-200
artikel
155 An algebraic algorithm for solving parametric integer programs Fu, Norie
2018
81-90 C p. 253-264
artikel
156 An algebraic approach to lifts of digraphs Dalfó, C.
2019
81-90 C p. 68-76
artikel
157 An algebraic expression of the number partitioning problem Kubo, Susumu

81-90 C p. 283-296
artikel
158 An algorithm computing combinatorial specifications of permutation classes Bassino, Frédérique
2017
81-90 C p. 16-44
29 p.
artikel
159 An algorithm for delta–wye reduction of almost-planar graphs Gitler, Isidoro

81-90 C p. 631-641
artikel
160 An algorithm for identifying cycle-plus-triangles graphs Bérczi, Kristóf
2017
81-90 C p. 10-16
7 p.
artikel
161 An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances Bordewich, M.
2016
81-90 C p. 47-59
13 p.
artikel
162 An algorithm for the class of pure implicational formulas Franco, John
1999
81-90 C p. 89-106
18 p.
artikel
163 An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems Komusiewicz, Christian
2015
81-90 C p. 145-161
17 p.
artikel
164 An algorithmic metatheorem for directed treewidth de Oliveira Oliveira, Mateus
2016
81-90 C p. 49-76
28 p.
artikel
165 An algorithmic separating hyperplane theorem and its applications Kalantari, Bahman
2019
81-90 C p. 59-82
artikel
166 An algorithmic toolbox for periodic partial words Manea, Florin
2014
81-90 C p. 174-192
19 p.
artikel
167 An algorithm to find maximum area polygons circumscribed about a convex polygon Ausserhofer, Markus
2019
81-90 C p. 98-108
artikel
168 An algorithm which outputs a graph with a specified chromatic factor Delbourgo, Daniel
2019
81-90 C p. 128-150
artikel
169 An alternative approach to distance geometry using L ∞ distances Crippen, Gordon M.
2015
81-90 C p. 20-26
7 p.
artikel
170 Analysis of a generalized Linear Ordering Problem via integer programming Méndez-Díaz, Isabel
2019
81-90 C p. 93-107
artikel
171 Analysis of minimal path routing schemes in the presence of faults M. Gordon, Jesse
1992
81-90 C p. 245-263
19 p.
artikel
172 Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs Gu, Mei-Mei

81-90 C p. 80-91
artikel
173 Analysis on Yu et al.’s dynamic algorithm for canonic DBC Eom, Sookyung

81-90 C p. 31-40
artikel
174 An analysis of root functions—A subclass of the Impossible Class of Faulty Functions (ICFF) Pasalic, E.
2017
81-90 C p. 1-13
13 p.
artikel
175 An approximation algorithm for the longest cycle problem in solid grid graphs Asgharian Sardroud, Asghar
2016
81-90 C p. 6-12
7 p.
artikel
176 An approximation algorithm for the partial covering 0–1 integer program Takazawa, Yotaro

81-90 C p. 126-133
artikel
177 An easy counting lemma Engelhardt, Matthias R.
2019
81-90 C p. 175-185
artikel
178 An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications Li, Jianxi
2014
81-90 C p. 104-115
12 p.
artikel
179 An efficient algorithm to determine all shortest paths in Sierpiński graphs Hinz, Andreas M.
2014
81-90 C p. 111-120
10 p.
artikel
180 An efficient lattice reduction using reuse technique blockwisely on NTRU Chung, Kyungmi
2016
81-90 C p. 88-98
11 p.
artikel
181 An efficient RSA-based certificateless public key encryption scheme Lin, Xi-Jun
2018
81-90 C p. 39-47
artikel
182 A new algorithm for Boolean matrix factorization which admits overcovering Belohlavek, Radim
2018
81-90 C p. 36-52
artikel
183 A new approach to finding the extra connectivity of graphs Zhu, Qiang

81-90 C p. 265-271
artikel
184 A new approach to gross error detection for GPS networks Dalfó, C.
2019
81-90 C p. 193-199
artikel
185 A new class of optimal linear codes with flexible parameters Luo, Gaojun
2018
81-90 C p. 126-131
artikel
186 A new construction of broadcast graphs Harutyunyan, Hovhannes A.

81-90 C p. 144-155
artikel
187 A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity Zhang, Hui
2019
81-90 C p. 13-28
artikel
188 A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities Murthy, Ishwar
2019
81-90 C p. 119-143
artikel
189 A new general family of mixed graphs Dalfó, C.
2019
81-90 C p. 99-106
artikel
190 A new look at the de Bruijn graph Fredricksen, Harold
1992
81-90 C p. 193-203
11 p.
artikel
191 A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture Henning, Michael A.
2014
81-90 C p. 45-52
8 p.
artikel
192 A new lower bound on the double domination number of a graph Hajian, Majid
2019
81-90 C p. 280-282
artikel
193 A new measure for comparing biomedical regions of interest in segmentation of digital images Conci, Aura
2015
81-90 C p. 103-113
11 p.
artikel
194 A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space Prosanov, Roman

81-90 C p. 115-120
artikel
195 A new sufficient condition for pancyclability of graphs Cai, Junqing
2014
81-90 C p. 142-148
7 p.
artikel
196 A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs Contreras-Balbuena, Alejandro
2017
81-90 C p. 55-63
9 p.
artikel
197 An exact algorithm for maximum independent set in degree-5 graphs Xiao, Mingyu
2016
81-90 C p. 137-155
19 p.
artikel
198 An exact algorithm for the bottleneck 2-connected k -Steiner network problem in L p planes Brazil, M.
2016
81-90 C p. 47-69
23 p.
artikel
199 An extension of Lehman’s theorem and ideal set functions Király, Tamás
2016
81-90 C p. 251-263
13 p.
artikel
200 An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications Peng, Yuejian
2016
81-90 C p. 170-175
6 p.
artikel
201 An FPT algorithm for the vertex cover P 4 problem Tu, Jianhua
2016
81-90 C p. 186-190
5 p.
artikel
202 An improved algorithm to construct edge-independent spanning trees in augmented cubes Cheng, Baolei

81-90 C p. 55-70
artikel
203 An improved lower bound on the independence number of a graph Henning, Michael A.
2014
81-90 C p. 120-128
9 p.
artikel
204 An improved upper bound for the acyclic chromatic number of 1-planar graphs Yang, Wanshun

81-90 C p. 275-291
artikel
205 An improved upper bound for the neighbor sum distinguishing index of graphs Wang, Guanghui
2014
81-90 C p. 126-128
3 p.
artikel
206 An improved upper bound for the subarray partial concentrators Hu, X.D.
1992
81-90 C p. 341-346
6 p.
artikel
207 An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph Zhang, Lianzhu
2014
81-90 C p. 348-354
7 p.
artikel
208 An improved upper bound on the double Roman domination number of graphs with minimum degree at least two Khoeilar, Rana
2019
81-90 C p. 159-167
artikel
209 An improvement on the number of simplices in F q d Pham, Duc Hiep
2017
81-90 C p. 95-105
11 p.
artikel
210 An inequality on global alliances for trees Yu, Alexandria
2015
81-90 C p. 227-229
3 p.
artikel
211 An infinite family of 2-connected graphs that have reliability factorisations Morgan, Kerri
2017
81-90 C p. 123-127
5 p.
artikel
212 An infinite family of graphs with a facile count of perfect matchings Rosenfeld, Vladimir R.
2014
81-90 C p. 210-214
5 p.
artikel
213 An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method Taghavi Afshord, Saeid
2015
81-90 C p. 208-219
12 p.
artikel
214 An integer programming model for protein structure prediction using the 3D-HP side chain model Nunes, Luiz Fernando
2016
81-90 C p. 206-214
9 p.
artikel
215 An interleaved method for constructing de Bruijn sequences Zhao, Xiao-Xin
2019
81-90 C p. 234-245
artikel
216 An O ∗ ( 2 . 61 9 k ) algorithm for 4-Path Vertex Cover Tsur, Dekel

81-90 C p. 1-14
artikel
217 An O ( n 2 ) time algorithm for the minimal permutation completion problem Crespelle, Christophe
2019
81-90 C p. 80-95
artikel
218 A note about online nonrepetitive coloring k -trees Keszegh, Balázs

81-90 C p. 108-112
artikel
219 A note on a directed version of the 1-2-3 Conjecture Horňák, Mirko
2018
81-90 C p. 472-476
artikel
220 A note on adjacent vertex distinguishing colorings of graphs Axenovich, M.
2016
81-90 C p. 1-7
7 p.
artikel
221 A note on an alternating upper bound for random walks on semigroups Chung, Fan
2014
81-90 C p. 24-29
6 p.
artikel
222 A note on antimagic orientations of even regular graphs Yang, Donglei
2019
81-90 C p. 224-228
artikel
223 A note on b-coloring of Kneser graphs Shaebani, Saeed
2019
81-90 C p. 368-369
artikel
224 A note on 3-bisections in subcubic graphs Cui, Qing

81-90 C p. 147-152
artikel
225 A note on 2-bisections of claw-free cubic graphs Abreu, Marién
2018
81-90 C p. 214-217
artikel
226 A note on breaking small automorphisms in graphs Kalinowski, Rafał
2017
81-90 C p. 221-225
artikel
227 A note on coloring digraphs of large girth Steiner, Raphael

81-90 C p. 62-64
artikel
228 A note on domination number in maximal outerplanar graphs Liu, Chanjuan

81-90 C p. 90-94
artikel
229 A note on easy and efficient computation of full abelian periods of a word Fici, Gabriele
2016
81-90 C p. 88-95
8 p.
artikel
230 A note on eigenvalue bounds for independence numbers of non-regular graphs Li, Yusheng
2014
81-90 C p. 146-149
4 p.
artikel
231 A note on equidistant subspace codes Bartoli, Daniele
2016
81-90 C p. 291-296
6 p.
artikel
232 A note on generalized semitotal point graphs Cheuk, Danny

81-90 C p. 114-127
artikel
233 A note on k -metric dimensional graphs Corregidor, Samuel G.

81-90 C p. 523-533
artikel
234 A note on many-to-many matchings and stable allocations Baïou, Mourad
2016
81-90 C p. 181-184
4 p.
artikel
235 A note on M-convex functions on jump systems Murota, Kazuo

81-90 C p. 492-502
artikel
236 A note on partitions of graphs under degree constraints Zu, Chunlei

81-90 C p. 631-633
artikel
237 A note on 1-planar graphs Ackerman, Eyal
2014
81-90 C p. 104-108
5 p.
artikel
238 A note on 1-planar graphs with minimum degree 7 Biedl, Therese

81-90 C p. 230-232
artikel
239 A note on S -packing colorings of lattices Goddard, Wayne
2014
81-90 C p. 255-262
8 p.
artikel
240 A note on “Tenacity of a graph with maximum connectivity” Shirdel, G.H.
2014
81-90 C p. 273-275
3 p.
artikel
241 A note on the computation of the fraction of smallest denominator in between two irreducible fractions Sivignon, Isabelle
2016
81-90 C p. 197-201
5 p.
artikel
242 A note on the diameter of convex polytope Yang, Yaguang

81-90 C p. 534-538
artikel
243 A note on the dispersion of admissible lattices Ullrich, Mario
2019
81-90 C p. 385-387
artikel
244 A note on the global offensive alliances in graphs Rad, Nader Jafari
2018
81-90 C p. 373-376
artikel
245 A note on the Grundy number and graph products Clarke, Nancy E.
2016
81-90 C p. 1-7
7 p.
artikel
246 A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees Fuchs, Michael

81-90 C p. 64-71
artikel
247 A note on the localization number of random graphs: Diameter two case Dudek, Andrzej
2019
81-90 C p. 107-112
artikel
248 A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines Yan, Yujie
2015
81-90 C p. 295-300
6 p.
artikel
249 A note on the middle levels problem Gusmão, Andréia C.S.
2016
81-90 C p. 290-296
artikel
250 A note on the multiple-recursive matrix method for generating pseudorandom vectors Bishoi, Susil Kumar
2017
81-90 C p. 67-75
9 p.
artikel
251 A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization Buchheim, Christoph

81-90 C p. 591-593
artikel
252 A note on the packing chromatic number of lexicographic products Božović, Dragana

81-90 C p. 34-37
artikel
253 A note on the polytope of bipartite TSP Kovács, Gergely
2018
81-90 C p. 92-100
artikel
254 A note on the set union knapsack problem Arulselvan, Ashwin
2014
81-90 C p. 214-218
5 p.
artikel
255 A note on total domination and 2-rainbow domination in graphs Furuya, Michitaka
2015
81-90 C p. 229-230
2 p.
artikel
256 A note on visibility-constrained Voronoi diagrams Aurenhammer, F.
2014
81-90 C p. 52-56
5 p.
artikel
257 An overview of ( κ , τ ) -regular sets and their applications Cardoso, Domingos M.
2019
81-90 C p. 2-10
artikel
258 Anticoloring of the rook’s graph Berend, Daniel
2015
81-90 C p. 1-15
15 p.
artikel
259 Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings Jiménez, Andrea
2014
81-90 C p. 45-61
17 p.
artikel
260 Anti-forcing numbers of perfect matchings of graphs Lei, Hongchuan
2016
81-90 C p. 95-105
11 p.
artikel
261 Anti-forcing polynomials for benzenoid systems with forcing edges Zhao, Shuang
2018
81-90 C p. 342-356
artikel
262 Antimagic orientation of lobsters Gao, Yuping

81-90 C p. 21-26
artikel
263 Antimagic orientations of graphs with given independence number Song, Zi-Xia

81-90 C p. 163-170
artikel
264 Antimatroids induced by matchings Kawase, Yasushi
2019
81-90 C p. 342-349
artikel
265 An upper bound of Δ ( E ) < 3 ∕ 2 for skiving stock instances of the divisible case Martinovic, J.
2017
81-90 C p. 161-167
7 p.
artikel
266 An upper bound on the extremal version of Hajnal’s triangle-free game Biró, Csaba
2016
81-90 C p. 20-28
9 p.
artikel
267 An upper bound on the sum of powers of the degrees of simple 1-planar graphs Czap, Július
2014
81-90 C p. 146-151
6 p.
artikel
268 An upper bound on Wiener Indices of maximal planar graphs Che, Zhongyuan
2019
81-90 C p. 76-86
artikel
269 A parallel algorithm for constructing independent spanning trees in twisted cubes Chang, Jou-Ming
2017
81-90 C p. 74-82
9 p.
artikel
270 A parameterization for a class of complete games with abstention Freixas, Josep
2019
81-90 C p. 21-39
artikel
271 A P 3 ⃗ -decomposition of tournaments and bipartite digraphs Wang, Fangxia
2017
81-90 C p. 158-165
8 p.
artikel
272 A permutation code preserving a double Eulerian bistatistic Baril, Jean-Luc
2017
81-90 C p. 9-15
7 p.
artikel
273 A polyhedral investigation of star colorings Hojny, Christopher
2016
81-90 C p. 59-78
20 p.
artikel
274 A polyhedral study of the diameter constrained minimum spanning tree problem Gouveia, Luis

81-90 C p. 364-379
artikel
275 A polyhedral study of the maximum stable set problem with weights on vertex-subsets Campêlo, Manoel
2016
81-90 C p. 223-234
artikel
276 A polynomial algorithm for convex quadratic optimization subject to linear inequalities Chubanov, Sergei

81-90 C p. 19-28
artikel
277 A polynomial algorithm for minimizing discrete convic functions in fixed dimension Veselov, S.I.

81-90 C p. 11-19
artikel
278 A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines Chrétienne, Philippe
2018
81-90 C p. 132-139
artikel
279 A polynomial algorithm for weighted scattering number in interval graphs Li, Fengwei
2019
81-90 C p. 118-124
artikel
280 A polynomial recognition of unit forms using graph-based strategies Alves, Jesmmer
2019
81-90 C p. 61-72
artikel
281 Application of coding theory to interconnection networks Zémor, Gilles
1992
81-90 C p. 553-562
10 p.
artikel
282 Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs Felisiak, Mariusz
2015
81-90 C p. 49-64
16 p.
artikel
283 Applications of max-plus algebra to flow shop scheduling problems Kubo, Susumu

81-90 C p. 278-293
artikel
284 Approximability of guarding weak visibility polygons Bhattacharya, Pritam
2017
81-90 C p. 109-129
21 p.
artikel
285 Approximability of the dispersed p → -neighbor k -supplier problem van Ee, Martijn

81-90 C p. 219-229
artikel
286 Approximability of the two-stage stochastic knapsack problem with discretely distributed weights Kosuch, Stefanie
2014
81-90 C p. 192-204
13 p.
artikel
287 Approximate association via dissociation You, Jie
2017
81-90 C p. 202-209
8 p.
artikel
288 Approximate robust optimization for the Connected Facility Location problem Bardossy, M. Gisela
2016
81-90 C p. 246-260
artikel
289 Approximate tradeoffs on weighted labeled matroids Gourvès, Laurent
2015
81-90 C p. 154-166
13 p.
artikel
290 Approximating 2-cliques in unit disk graphs Pattillo, Jeffrey
2014
81-90 C p. 178-187
10 p.
artikel
291 Approximating connected safe sets in weighted trees Ehard, Stefan

81-90 C p. 216-223
artikel
292 Approximating maximum uniquely restricted matchings in bipartite graphs Baste, Julien
2019
81-90 C p. 30-40
artikel
293 Approximating the path-distance-width for AT-free graphs and graphs in related classes Otachi, Yota
2014
81-90 C p. 69-77
9 p.
artikel
294 Approximating weighted induced matchings Lin, Min Chih
2018
81-90 C p. 304-310
artikel
295 Approximation algorithm for minimum connected 3-path vertex cover Liu, Pengcheng

81-90 C p. 77-84
artikel
296 Approximation algorithm for squared metric facility location problem with nonuniform capacities Xu, Yicheng
2019
81-90 C p. 208-217
artikel
297 1.5-approximation algorithm for the 2 -Convex Recoloring problem Bar-Yehuda, Reuven
2018
81-90 C p. 2-11
artikel
298 Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions Elbassioni, Khaled
2017
81-90 C p. 56-70
15 p.
artikel
299 Approximation algorithms for minimum (weight) connected k -path vertex cover Li, Xiaosong
2016
81-90 C p. 101-108
8 p.
artikel
300 Approximation algorithms for some position-dependent scheduling problems Yang, Liya

81-90 C p. 22-31
artikel
301 Approximation algorithms for the fault-tolerant facility location problem with penalties Ji, Sai
2019
81-90 C p. 62-75
artikel
302 Approximation of the parallel machine scheduling problem with additional unit resources Hebrard, Emmanuel
2016
81-90 C p. 126-135
10 p.
artikel
303 A priori TSP in the scenario model van Ee, Martijn
2018
81-90 C p. 331-341
artikel
304 A procedural egalitarian solution for NTU-games Dietzenbacher, Bas

81-90 C p. 20-27
artikel
305 A proof for a conjecture of Gorgol Campos, V.
2018
81-90 C p. 202-207
artikel
306 A proof of a conjecture on the differential of a subcubic graph Khoeilar, R.

81-90 C p. 27-39
artikel
307 A proof of the conjecture regarding the sum of domination number and average eccentricity Du, Zhibin
2016
81-90 C p. 105-113
9 p.
artikel
308 A pseudo-polynomial time algorithm for solving the resource dependent assignment problem Shabtay, Dvir
2015
81-90 C p. 115-121
7 p.
artikel
309 A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem Ravelo, S.V.
2017
81-90 C p. 158-175
18 p.
artikel
310 A quadratic algorithm for road coloring Béal, Marie-Pierre
2014
81-90 C p. 15-29
15 p.
artikel
311 A random model of publication activity Backhausz, Ágnes
2014
81-90 C p. 78-89
12 p.
artikel
312 A recognition algorithm for adjusted interval digraphs Takaoka, Asahi

81-90 C p. 253-256
artikel
313 A recognition algorithm for simple-triangle graphs Takaoka, Asahi

81-90 C p. 196-207
artikel
314 A reduction algorithm for the weighted stable set problem in claw-free graphs Nobili, Paolo
2014
81-90 C p. 245-262
18 p.
artikel
315 A relation between proximity and the third largest distance eigenvalue of a graph Mojallal, Seyed Ahmad

81-90 C p. 50-58
artikel
316 A remark on random 2-SAT Goerdt, Andreas
1999
81-90 C p. 107-110
4 p.
artikel
317 A resource-frugal probabilistic dictionary and applications in bioinformatics Marchet, Camille

81-90 C p. 92-102
artikel
318 A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs Bensmail, Julien
2019
81-90 C p. 31-39
artikel
319 A robber locating strategy for trees Brandt, A.
2017
81-90 C p. 99-106
artikel
320 A rounding theorem for unique binary tomographic reconstruction Dulio, Paolo
2019
81-90 C p. 54-69
artikel
321 Arrival time dependent routing policies in public transport Bérczi, Kristóf
2018
81-90 C p. 93-102
artikel
322 A sharp lower bound of the spectral radius with application to the energy of a graph Guo, Ji-Ming

81-90 C p. 59-63
artikel
323 A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n − 3 Absil, Romain
2018
81-90 C p. 3-11
artikel
324 A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path Choi, Ilkyoo

81-90 C p. 178-182
artikel
325 A short note on the existence of infinite sequences of γ -graphs of graphs Finbow, Stephen

81-90 C p. 182-187
artikel
326 A short note on: There is no graph G with G S R ≅ K r , s , r , s ≥ 2 Lenin, R.
2019
81-90 C p. 204-205
artikel
327 A simple algorithm and min–max formula for the inverse arborescence problem Frank, András

81-90 C p. 85-93
artikel
328 A simple algorithm for secure domination in proper interval graphs Zou, Y.H.
2019
81-90 C p. 289-293
artikel
329 A single axiom for Boolean algebras Kwuida, Léonard
2018
81-90 C p. 85-90
artikel
330 A single shuffle is enough for secure card-based computation of any Boolean circuit Shinagawa, Kazumasa

81-90 C p. 248-261
artikel
331 A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers R ( 3 , k ) Zhu, Rujie
2016
81-90 C p. 216-221
6 p.
artikel
332 Aspects of upper defensive alliances Bazgan, Cristina
2019
81-90 C p. 111-120
artikel
333 A study of scheduling problems with preemptions on multi-core computers with GPU accelerators Błażewicz, Jacek
2015
81-90 C p. 72-82
11 p.
artikel
334 A study on load-balanced variants of the bin packing problem Castro-Silva, D.
2019
81-90 C p. 4-14
artikel
335 A subexponential-time algorithm for the Maximum Independent Set Problem in P t -free graphs Brause, Christoph
2017
81-90 C p. 113-118
6 p.
artikel
336 A sufficient condition for a planar graph to be 4 -choosable Xu, Renyu
2017
81-90 C p. 120-122
3 p.
artikel
337 A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable Zhu, Enqiang
2017
81-90 C p. 148-153
6 p.
artikel
338 A sufficient Q -spectral condition for a graph to be β -deficient involving minimum degree Liu, Weijun
2019
81-90 C p. 158-167
artikel
339 A survey-based approach for designing the lines of a rapid transit network Escudero, L.F.
2016
81-90 C p. 14-34
artikel
340 A survey of integrity Bagga, K.S.
1992
81-90 C p. 13-28
16 p.
artikel
341 A survey on flows in graphs and matroids Guenin, Bertrand
2016
81-90 C p. 122-132
11 p.
artikel
342 Asymmetric colorings of products of graphs and digraphs Broere, Izak
2019
81-90 C p. 56-64
artikel
343 Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs Maurer, Ueli M.
1992
81-90 C p. 421-436
16 p.
artikel
344 Asymptotic enumeration of perfect matchings in m -barrel fullerene graphs Behmaram, Afshin
2019
81-90 C p. 153-162
artikel
345 Asymptotic results on weakly increasing subsequences in random words Işlak, Ümi̇t
2018
81-90 C p. 171-189
artikel
346 Asymptotic surviving rate of trees with multiple fire sources Costa, Vitor
2015
81-90 C p. 14-19
6 p.
artikel
347 A ternary search problem on two disjoint sets Li, Shengjia
2018
81-90 C p. 221-235
artikel
348 A three-person deterministic graphical game without Nash equilibria Boros, Endre
2018
81-90 C p. 21-38
artikel
349 A tie-break model for graph search Corneil, Derek G.
2016
81-90 C p. 89-100
12 p.
artikel
350 A tight analysis of the Submodular–Supermodular Procedure Byrnes, Kevin M.
2015
81-90 C p. 275-282
8 p.
artikel
351 A tight lower bound for Vertex Planarization on graphs of bounded treewidth Pilipczuk, Marcin
2017
81-90 C p. 211-216
6 p.
artikel
352 A tree distinguishing polynomial Liu, Pengyu

81-90 C p. 1-8
artikel
353 A two-commodity flow formulation for the capacitated truck-and-trailer routing problem Bartolini, E.

81-90 C p. 3-18
artikel
354 Augmenting the algebraic connectivity for certain families of graphs Justel, Claudia
2019
81-90 C p. 51-60
artikel
355 A universal tree-based network with the minimum number of reticulations Bordewich, Magnus
2018
81-90 C p. 357-362
artikel
356 Automated generation of conjectures on forbidden subgraph characterization Desrosiers, Christian
2014
81-90 C p. 177-194
18 p.
artikel
357 Automatic complexity of Fibonacci and Tribonacci words Kjos-Hanssen, Bjørn

81-90 C p. 446-454
artikel
358 Autotopism stabilized colouring games on rook’s graphs Falcón, Raúl M.
2019
81-90 C p. 200-212
artikel
359 A variant of k -nearest neighbors search with cyclically permuted query points for rotation-invariant image processing Foulds, Leslie R.
2015
81-90 C p. 123-144
22 p.
artikel
360 A variation on bisecting the binomial coefficients Ionaşcu, Eugen J.
2018
81-90 C p. 276-284
artikel
361 AVD-total-colouring of complete equipartite graphs Luiz, Atílio G.
2015
81-90 C p. 189-195
7 p.
artikel
362 Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs Casablanca, Rocío M.

81-90 C p. 233-247
artikel
363 Averaging 2-rainbow domination and Roman domination Alvarado, José D.
2016
81-90 C p. 202-207
6 p.
artikel
364 A Vizing-like theorem for union vertex-distinguishing edge coloring Bousquet, Nicolas
2017
81-90 C p. 88-98
artikel
365 A Vizing-type result for semi-total domination Asplund, John
2019
81-90 C p. 8-12
artikel
366 Axiomatic characterization of the center function. The case of non-universal axioms Changat, Manoj
2018
81-90 C p. 56-69
artikel
367 Axiomatic characterization of the center function. The case of universal axioms Changat, Manoj
2017
81-90 C p. 44-57
artikel
368 Axiomatic characterization of the interval function of a bipartite graph Changat, Manoj

81-90 C p. 19-28
artikel
369 Axiomatic characterization of the median and antimedian function on a complete graph minus a matching Changat, Manoj
2017
81-90 C p. 50-59
10 p.
artikel
370 Badly-covered graphs Cappelle, Márcia R.
2015
81-90 C p. 99-103
5 p.
artikel
371 Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity Wang, Qichun
2014
81-90 C p. 25-32
8 p.
artikel
372 Balanced compact clustering for efficient range queries in metric spaces Ceselli, Alberto
2014
81-90 C p. 43-67
25 p.
artikel
373 Balanced partitions of 3-colored geometric sets in the plane Bereg, Sergey
2015
81-90 C p. 21-32
12 p.
artikel
374 Balanced 2 p -variable rotation symmetric Boolean functions with optimal algebraic immunity Sun, Lei
2016
81-90 C p. 20-30
11 p.
artikel
375 Bandwidth allocation in cellular networks with multiple interferences Bar-Yehuda, Reuven
2015
81-90 C p. 23-36
14 p.
artikel
376 Base graph–connection graph: Dissection and construction Potočnik, Primož

81-90 C p. 116-128
artikel
377 Best monotone degree conditions for binding number and cycle structure Bauer, D.
2015
81-90 C p. 8-17
10 p.
artikel
378 Best second order bounds for two-terminal network reliability with dependent edge failures Hansen, Pierre
1999
81-90 C p. 375-393
19 p.
artikel
379 Bichain graphs: Geometric model and universal graphs Brignall, Robert
2016
81-90 C p. 16-29
14 p.
artikel
380 Biclique-colouring verification complexity and biclique-colouring power graphs Macêdo Filho, H.B.
2015
81-90 C p. 65-76
12 p.
artikel
381 Biclique graphs of interval bigraphs Cruz, E.P.

81-90 C p. 134-143
artikel
382 Bicyclic graphs with maximal edge revised Szeged index Liu, Mengmeng
2016
81-90 C p. 225-230
6 p.
artikel
383 Bicyclic signed graphs with at most one odd cycle and maximal energy Wang, Dijian
2019
81-90 C p. 244-255
artikel
384 Bidual Horn functions and extensions Eiter, Thomas
1999
81-90 C p. 55-88
34 p.
artikel
385 Bigraphic pairs with an A -connected realization Guan, Jing-Xin
2018
81-90 C p. 75-81
artikel
386 Bijective counting of humps and peaks in ( k , a ) -paths Yan, Sherry H.F.
2015
81-90 C p. 208-212
5 p.
artikel
387 Bilinear maps and graphs Martín, Antonio J. Calderón
2019
81-90 C p. 69-78
artikel
388 Binary action games: Deviation properties, semi-strict equilibria and potentials Iimura, Takuya
2018
81-90 C p. 57-68
artikel
389 Binary linear programming models for robust broadcasting in communication networks McGarvey, Ronald G.
2016
81-90 C p. 173-184
12 p.
artikel
390 Binary linear programming solutions and non-approximability for control problems in voting systems Gurski, Frank
2014
81-90 C p. 391-398
8 p.
artikel
391 Binary set systems and totally balanced hypergraphs Châtel, Célia

81-90 C p. 120-133
artikel
392 Bipartite finite Toeplitz graphs Nicoloso, Sara
2014
81-90 C p. 233-244
12 p.
artikel
393 Bipartite Ramsey numbers of paths for random graphs Liu, Meng
2019
81-90 C p. 171-174
artikel
394 Bisecting and D -secting families for set systems Balachandran, Niranjan

81-90 C p. 2-13
artikel
395 Bisecting binomial coefficients Ionaşcu, Eugen J.
2017
81-90 C p. 70-83
artikel
396 2-bisections in claw-free cubic multigraphs Cui, Qing
2019
81-90 C p. 325-330
artikel
397 Bisections of graphs without K 2 , l Jin, Jing
2019
81-90 C p. 112-118
artikel
398 Block-indifference graphs: Characterization, structural and spectral properties Abreu, Nair Maria Maia de
2019
81-90 C p. 60-67
artikel
399 Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3) De Bruyn, Bart
2019
81-90 C p. 121-129
artikel
400 Blocking zero forcing processes in Cartesian products of graphs Karst, Nathaniel

81-90 C p. 380-396
artikel
401 Bondage number of grid graphs Dettlaff, Magda
2014
81-90 C p. 94-99
6 p.
artikel
402 Bondage number of the strong product of two trees Zhao, Weisheng
2017
81-90 C p. 133-145
13 p.
artikel
403 Book drawings of complete bipartite graphs de Klerk, Etienne
2014
81-90 C p. 80-93
14 p.
artikel
404 Boundary enumerator polynomial of hypercubes in Fibonacci cubes Saygı, Elif
2019
81-90 C p. 191-199
artikel
405 Boundary-type sets in maximal outerplanar graphs Allgeier, Benjamin
2019
81-90 C p. 163-170
artikel
406 Bounding the clique-width of H -free split graphs Brandstädt, Andreas
2016
81-90 C p. 30-39
10 p.
artikel
407 Bounding the sum of the largest Laplacian eigenvalues of graphs Rocha, I.
2014
81-90 C p. 95-103
9 p.
artikel
408 Bounds for the energy of weighted graphs Ganie, Hilal A.
2019
81-90 C p. 91-101
artikel
409 Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank Wang, Long
2014
81-90 C p. 276-281
6 p.
artikel
410 Bounds for the probability of union of events following monotonic distribution Kumaran, V.
2017
81-90 C p. 98-119
22 p.
artikel
411 Bounds on the burning number Bessy, Stéphane
2018
81-90 C p. 16-22
artikel
412 Bounds on the differentiating-total domination number of a tree Ning, Wenjie
2016
81-90 C p. 153-160
8 p.
artikel
413 Bounds on the disparity and separation of tournament solutions Brandt, Felix
2015
81-90 C p. 41-49
9 p.
artikel
414 Bounds on the 2 -domination number Bujtás, Csilla
2018
81-90 C p. 4-15
artikel
415 Bounds on the P I index of unicyclic and bicyclic graphs with given girth Ma, Gang
2017
81-90 C p. 156-161
6 p.
artikel
416 Bounds on the spectral radius of uniform hypergraphs Liu, Lele
2019
81-90 C p. 160-169
artikel
417 Bounds on weak roman and 2-rainbow domination numbers Chellali, Mustapha
2014
81-90 C p. 27-32
6 p.
artikel
418 Branch-and-cut approaches for p -Cluster Editing Bulhões, Teobaldo
2017
81-90 C p. 51-64
14 p.
artikel
419 Broadcast domination and multipacking in strongly chordal graphs Brewster, Richard C.
2019
81-90 C p. 108-118
artikel
420 Broadcasting and spanning trees in de Bruijn and Kautz networks Heydemann, M.C.
1992
81-90 C p. 297-317
21 p.
artikel
421 Broadcasting in DMA-bound bounded degree graphs Lazard, E.
1992
81-90 C p. 387-400
14 p.
artikel
422 Broadcasts on paths and cycles Bouchouika, Sabrina

81-90 C p. 375-395
artikel
423 Brushing without capacity restrictions Bryant, Darryn
2014
81-90 C p. 33-45
13 p.
artikel
424 Brush your trees! Penso, L.D.
2015
81-90 C p. 167-170
4 p.
artikel
425 Bubblesort, stacksort and their duals Ferrari, Luca S.
2014
81-90 C p. 64-71
8 p.
artikel
426 Bundling all shortest paths Dębski, Michał

81-90 C p. 82-91
artikel
427 Burning a graph is hard Bessy, Stéphane
2017
81-90 C p. 73-87
artikel
428 Burning number of caterpillars Liu, Huiqing

81-90 C p. 332-340
artikel
429 Cacti with maximum eccentricity resistance-distance sum He, Fangguo
2017
81-90 C p. 117-125
9 p.
artikel
430 Cacti with n -vertices and t cycles having extremal Wiener index Gutman, Ivan
2017
81-90 C p. 189-200
artikel
431 Cactus graphs with minimum edge revised Szeged index Liu, Mengmeng

81-90 C p. 90-96
artikel
432 Capacitated discrete unit disk cover Mishra, Pawan K.

81-90 C p. 242-251
artikel
433 Capacity restricted optimal pebbling in graphs Shiue, Chin-Lin
2019
81-90 C p. 284-288
artikel
434 Cayley graphs of diameter two and any degree with order half of the Moore bound Abas, Marcel
2014
81-90 C p. 1-7
7 p.
artikel
435 Certifying coloring algorithms for graphs without long induced paths Kamiński, Marcin
2019
81-90 C p. 258-267
artikel
436 Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue Johnson, Charles R.
2017
81-90 C p. 33-51
19 p.
artikel
437 Changing and unchanging the diameter of a hypercube Graham, Niali
1992
81-90 C p. 265-274
10 p.
artikel
438 Channel assignment problem and relaxed 2-distant coloring of graphs Lin, Wensong

81-90 C p. 231-244
artikel
439 Characterising circular-arc contact B 0 –VPG graphs Bonomo-Braberman, Flavia

81-90 C p. 435-443
artikel
440 Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns Cooper, Martin C.
2015
81-90 C p. 89-113
25 p.
artikel
441 Characterization of classical graph classes by weighted clique graphs Bonomo, Flavia
2014
81-90 C p. 83-95
13 p.
artikel
442 Characterization of color patterns by dynamic H -paths Benítez-Bobadilla, Germán
2019
81-90 C p. 41-51
artikel
443 Characterization of facets of the hop constrained chain polytope via dynamic programming Grötschel, Martin
2014
81-90 C p. 229-246
18 p.
artikel
444 Characterization of forbidden subgraphs for the existence of even factors in a graph Xiong, Liming
2017
81-90 C p. 135-139
5 p.
artikel
445 Characterization of minimum cycle basis in weighted partial 2-trees Narayanaswamy, N.S.
2015
81-90 C p. 77-81
5 p.
artikel
446 Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations Artamonov, V.A.
2016
81-90 C p. 5-17
13 p.
artikel
447 Characterization of rotation words generated by homeomorphisms on a circle Ma, Guanzhong
2015
81-90 C p. 244-248
5 p.
artikel
448 Characterization of split graphs with at most four distinct eigenvalues Ghorbani, Modjtaba
2015
81-90 C p. 231-236
6 p.
artikel
449 Characterization of the deletion of ( 26 , 6 ) -simple points as multivalued ( N , 26 ) -retractions Escribano, Carmen
2015
81-90 C p. 31-41
11 p.
artikel
450 Characterizations and enumerations of patterns of signed shifts Elizalde, Sergi

81-90 C p. 92-114
artikel
451 Characterizations of cographs as intersection graphs of paths on a grid Cohen, Elad
2014
81-90 C p. 46-57
12 p.
artikel
452 Characterizations of ( 4 K 1 , C 4 , C 5 )-free graphs Fraser, Dallas J.
2017
81-90 C p. 166-174
9 p.
artikel
453 Characterizations, probe and sandwich problems on ( k , ℓ ) -cographs Couto, Fernanda

81-90 C p. 118-133
artikel
454 Characterizing and computing the structure of clique intersections in strongly chordal graphs Nevries, Ragnar
2015
81-90 C p. 221-234
14 p.
artikel
455 Characterizing and recognizing LR-visibility polygons Tan, Xuehou
2014
81-90 C p. 303-311
9 p.
artikel
456 Characterizing approximate-matching dependencies in formal concept analysis with pattern structures Baixeries, Jaume
2018
81-90 C p. 18-27
artikel
457 Characterizing graphs of maximum matching width at most 2 Jeong, Jisu
2018
81-90 C p. 102-113
artikel
458 Characterizing interval graphs which are probe unit interval graphs Grippo, Luciano N.
2019
81-90 C p. 83-95
artikel
459 Characterizing 5-map graphs by 2-fan-crossing graphs Brandenburg, Franz J.
2019
81-90 C p. 10-20
artikel
460 Characterizing minimally flat symmetric hypergraphs Kaszanitzky, Viktória E.
2018
81-90 C p. 256-269
artikel
461 Characterizing the fullerene graphs with the minimum forcing number 3 Shi, Lingjuan

81-90 C p. 181-204
artikel
462 Charm bracelets and their application to the construction of periodic Golay pairs Đoković, Dragomir Ž.
2015
81-90 C p. 32-40
9 p.
artikel
463 Chasing robbers on random geometric graphs—An alternative approach Alon, Noga
2014
81-90 C p. 149-152
4 p.
artikel
464 Chip-firing games on Eulerian digraphs and NP -hardness of computing the rank of a divisor on a graph Kiss, Viktor
2015
81-90 C p. 48-56
9 p.
artikel
465 Choice identification of a graph Chang, Ting-Pang
2014
81-90 C p. 61-71
11 p.
artikel
466 Choosability and paintability of the lexicographic product of graphs Keszegh, Balázs
2017
81-90 C p. 84-90
7 p.
artikel
467 (3, 1)-Choosability of toroidal graphs with some forbidden short cycles Jing, Yubo
2015
81-90 C p. 243-247
5 p.
artikel
468 Chordal rings as fault-tolerant loops Zimmerman, Guy W
1992
81-90 C p. 563-573
11 p.
artikel
469 Chosen IV cryptanalysis on reduced round ChaCha and Salsa Maitra, Subhamoy
2016
81-90 C p. 88-97
10 p.
artikel
470 Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs Brimkov, Boris
2016
81-90 C p. 13-21
9 p.
artikel
471 Chromatic-choosability of the power of graphs Kim, Seog-Jin
2015
81-90 C p. 120-125
6 p.
artikel
472 Chronological rectangle digraphs which are two-terminal series–parallel Huang, Jing
2019
81-90 C p. 246-257
artikel
473 Chvátal–Gomory cuts for the Steiner tree problem Gaul, Daniela

81-90 C p. 188-200
artikel
474 Circuit k -covers of signed graphs Chen, Jing

81-90 C p. 41-54
artikel
475 Circular backbone colorings: On matching and tree backbones of planar graphs Araujo, J.
2018
81-90 C p. 69-82
artikel
476 (Circular) backbone colouring: Forest backbones in planar graphs Havet, Frédéric
2014
81-90 C p. 119-134
16 p.
artikel
477 Classes of uniformly most reliable graphs for all-terminal reliability Archer, Kassie
2019
81-90 C p. 12-29
artikel
478 Classification of de Bruijn-based labeled digraphs Kasprzak, Marta
2018
81-90 C p. 86-92
artikel
479 Classification of digital n -manifolds Evako, Alexander V.
2015
81-90 C p. 289-296
8 p.
artikel
480 Classification of rings with crosscap two class of graphs Asir, T.
2019
81-90 C p. 13-21
artikel
481 Classifying negative and positive points by optimal box clustering Serafini, Paolo
2014
81-90 C p. 270-282
13 p.
artikel
482 Classifying the clique-width of H -free bipartite graphs Dabrowski, Konrad K.
2016
81-90 C p. 43-51
9 p.
artikel
483 Clique cover products and unimodality of independence polynomials Zhu, Bao-Xuan
2016
81-90 C p. 172-180
9 p.
artikel
484 Clique cycle-transversals in distance-hereditary graphs Brandstädt, Andreas
2016
81-90 C p. 38-44
artikel
485 Clique-perfectness of complements of line graphs Bonomo, Flavia
2015
81-90 C p. 19-44
26 p.
artikel
486 Clique-width of full bubble model graphs Meister, Daniel
2015
81-90 C p. 138-167
30 p.
artikel
487 Clique-width of path powers Heggernes, Pinar
2016
81-90 C p. 62-72
11 p.
artikel
488 Closed factorization Badkobeh, Golnaz
2016
81-90 C p. 23-29
7 p.
artikel
489 Closed-form formulas for the Zhang–Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations Chou, Chien-Pin
2016
81-90 C p. 101-108
8 p.
artikel
490 Cluster connectivity of hypercube-based networks under the super fault-tolerance condition Kung, Tzu-Liang

81-90 C p. 143-156
artikel
491 Clustering on k -edge-colored graphs Angel, E.
2016
81-90 C p. 15-22
8 p.
artikel
492 Codes for distributed storage from 3-regular graphs Gao, Shuhong
2017
81-90 C p. 82-89
8 p.
artikel
493 Coherent network partitions Angeleska, Angela
2019
81-90 C p. 283-290
artikel
494 Collapsible graphs and Hamilton cycles of line graphs Li, Xiangwen
2015
81-90 C p. 132-142
11 p.
artikel
495 Collapsible subgraphs of a 4-edge-connected graph Gu, Ran
2019
81-90 C p. 272-277
artikel
496 Color-blind index in graphs of very low degree Diemunsch, Jennifer
2017
81-90 C p. 122-129
8 p.
artikel
497 Colorful edge decomposition of graphs: Some polynomial cases Dehghan, Ali
2017
81-90 C p. 155-165
11 p.
artikel
498 Colorful linear programming, Nash equilibrium, and pivots Meunier, Frédéric
2018
81-90 C p. 78-91
artikel
499 Coloring graphs characterized by a forbidden subgraph Golovach, Petr A.
2015
81-90 C p. 101-110
10 p.
artikel
500 Coloring graphs without short cycles and long induced paths Golovach, Petr A.
2014
81-90 C p. 107-120
14 p.
artikel
501 4-coloring ( P 6 , bull ) -free graphs Maffray, Frédéric
2017
81-90 C p. 198-210
13 p.
artikel
502 Coloring squares of graphs with mad constraints Hocquard, Hervé
2019
81-90 C p. 64-73
artikel
503 Coloring the square of a sparse graph G with almost Δ ( G ) colors Yancey, Matthew P.
2016
81-90 C p. 211-215
5 p.
artikel
504 Color-line and proper color-line graphs Le, Van Bang

81-90 C p. 73-82
artikel
505 3-color Schur numbers Boza, L.
2019
81-90 C p. 59-68
artikel
506 Color spanning objects: Algorithms and hardness results Banerjee, Sandip

81-90 C p. 14-22
artikel
507 Colour degree matrices of graphs with at most one cycle Hillebrand, A.
2016
81-90 C p. 144-152
9 p.
artikel
508 ( 2 , 2 ) -colourings and clique-free σ -hypergraphs Caro, Yair
2015
81-90 C p. 38-43
6 p.
artikel
509 Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Gimadi, E.Kh.
2015
81-90 C p. 54-61
8 p.
artikel
510 Combinatorial approximation algorithms for buy-at-bulk connected facility location problems Bley, Andreas
2016
81-90 C p. 34-46
13 p.
artikel
511 Combinatorial Optimization: Between Practice and Theory Brodnik, Andrej
2019
81-90 C p. 1-3
artikel
512 Combinatorial optimization with one quadratic term: Spanning trees and forests Buchheim, Christoph
2014
81-90 C p. 34-52
19 p.
artikel
513 Combined location and routing problems for drug distribution Ceselli, Alberto
2014
81-90 C p. 130-145
16 p.
artikel
514 Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly Alkaya, Ali Fuat
2015
81-90 C p. 2-16
15 p.
artikel
515 Comments on “A Hamilton sufficient condition for completely independent spanning tree” Qin, Xiao-Wen

81-90 C p. 730-733
artikel
516 Community detection in networks via a spectral heuristic based on the clustering coefficient Nascimento, Mariá C.V.
2014
81-90 C p. 89-99
11 p.
artikel
517 Comparative results and bounds for the eccentric-adjacency index Hua, Hongbo

81-90 C p. 188-196
artikel
518 Comparing the metric and strong dimensions of graphs Moravcik, Gaia
2017
81-90 C p. 68-79
12 p.
artikel
519 Comparing the power of cops to zombies in pursuit-evasion games Offner, David
2019
81-90 C p. 144-151
artikel
520 Comparing Wiener complexity with eccentric complexity Xu, Kexiang

81-90 C p. 7-16
artikel
521 Comparison between the Szeged index and the eccentric connectivity index Das, Kinkar Ch.
2015
81-90 C p. 74-86
13 p.
artikel
522 Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees Das, Kinkar Ch.
2014
81-90 C p. 35-41
7 p.
artikel
523 Comparison of mean hitting times for a degree-biased random walk Gerbaud, Antoine
2014
81-90 C p. 104-109
6 p.
artikel
524 Comparison theorems on resistance distances and Kirchhoff indices of S , T -isomers Yang, Yujun
2014
81-90 C p. 87-93
7 p.
artikel
525 Compatible recurrent identities of the sandpile group and maximal stable configurations Gao, Yibo

81-90 C p. 123-137
artikel
526 Complementary Riordan arrays Luzón, Ana
2014
81-90 C p. 75-87
13 p.
artikel
527 Complete characterization of bicyclic graphs with minimal Kirchhoff index Liu, Jia-Bao
2016
81-90 C p. 95-107
13 p.
artikel
528 Complete characterization of graphs for direct comparing Zagreb indices Horoldagva, Batmend
2016
81-90 C p. 146-154
9 p.
artikel
529 Complete colorings of planar graphs Araujo-Pardo, G.
2019
81-90 C p. 86-97
artikel
530 Complete oriented colourings and the oriented achromatic number Sopena, Éric
2014
81-90 C p. 102-112
11 p.
artikel
531 Complete solution of equation W ( L 3 ( T ) ) = W ( T ) for the Wiener index of iterated line graphs of trees Knor, M.
2014
81-90 C p. 90-103
14 p.
artikel
532 Complete split graph determined by its (signless) Laplacian spectrum Das, Kinkar Ch.
2016
81-90 C p. 45-51
7 p.
artikel
533 Complete subgraphs in connected graphs and its application to spectral moment Fang, Longfei

81-90 C p. 36-42
artikel
534 Complete weight enumerators of some irreducible cyclic codes Shi, Zexia
2017
81-90 C p. 182-192
11 p.
artikel
535 Completing colored graphs to meet a target property Cook, Kathryn
2017
81-90 C p. 39-51
13 p.
artikel
536 Complexity analysis of propositional resolution with autarky pruning Van Gelder, Allen
1999
81-90 C p. 195-221
27 p.
artikel
537 Complexity and approximations for submodular minimization problems on two variables per inequality constraints Hochbaum, Dorit S.
2018
81-90 C p. 252-261
artikel
538 Complexity and computation of connected zero forcing Brimkov, Boris
2017
81-90 C p. 31-45
15 p.
artikel
539 Complexity aspects of ℓ -chord convexities Dourado, Mitre C.

81-90 C p. 585-591
artikel
540 Complexity aspects of the triangle path convexity Dourado, Mitre C.
2016
81-90 C p. 39-47
9 p.
artikel
541 Complexity of correspondence H -colourings Feder, Tomás

81-90 C p. 235-245
artikel
542 Complexity of Grundy coloring and its variants Bonnet, Édouard
2018
81-90 C p. 99-114
artikel
543 Complexity of independency and cliquy trees Casel, Katrin

81-90 C p. 2-15
artikel
544 Complexity of minimum irreducible infeasible subsystem covers for flow networks Joormann, Imke
2018
81-90 C p. 124-142
artikel
545 Complexity of planar signed graph homomorphisms to cycles Dross, François

81-90 C p. 166-178
artikel
546 Complexity of rainbow vertex connectivity problems for restricted graph classes Lauri, Juho
2017
81-90 C p. 132-146
15 p.
artikel
547 Complexity of some graph-based bounds on the probability of a union of events Scozzari, Andrea
2018
81-90 C p. 186-197
artikel
548 Complexity of splits reconstruction for low-degree trees Gaspers, Serge
2015
81-90 C p. 89-100
12 p.
artikel
549 Complexity of total outer-connected domination problem in graphs Panda, B.S.
2016
81-90 C p. 110-122
13 p.
artikel
550 Complexity results for common due date scheduling problems with interval data and minmax regret criterion Kacem, Imed
2019
81-90 C p. 76-89
artikel
551 Complexity-separating graph classes for vertex, edge and total colouring de Figueiredo, Celina M.H.

81-90 C p. 162-171
artikel
552 Component-cardinality-constrained critical node problem in graphs Lalou, M.
2016
81-90 C p. 150-163
artikel
553 Computational advances in combinatorial optimization Jordán, Tibor
2018
81-90 C p. 1-3
artikel
554 Computational complexity aspects of point visibility graphs Himmel, Anne-Sophie
2019
81-90 C p. 283-290
artikel
555 Computational complexity of distance edge labeling Knop, Dušan
2018
81-90 C p. 80-98
artikel
556 Computational complexity of minimum P 4 vertex cover problem for regular and K 1 , 4 -free graphs Safina Devi, N.
2015
81-90 C p. 114-121
8 p.
artikel
557 Computational determination of the largest lattice polytope diameter Chadder, Nathan

81-90 C p. 106-110
artikel
558 Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations Jiménez, Andrea
2016
81-90 C p. 45-60
artikel
559 Computing a minimum paired-dominating set in strongly orderable graphs Pradhan, D.
2019
81-90 C p. 37-50
artikel
560 Computing covers using prefix tables Alatabbi, Ali
2016
81-90 C p. 2-9
8 p.
artikel
561 Computing distance moments on graphs with transitive Djoković–Winkler relation Klavžar, Sandi
2014
81-90 C p. 269-272
4 p.
artikel
562 Computing graph gonality is hard Gijswijt, Dion

81-90 C p. 134-149
artikel
563 Computing HOMFLY polynomials of 2-bridge links from 4-plat representation Murakami, Masahiko
2014
81-90 C p. 271-284
14 p.
artikel
564 Computing longest common extensions in partial words Blanchet-Sadri, F.
2018
81-90 C p. 119-139
artikel
565 Computing maximum non-crossing matching in convex bipartite graphs Chen, Danny Z.
2015
81-90 C p. 50-60
11 p.
artikel
566 Computing similarity distances between rankings Farnoud (Hassanzadeh), Farzad
2017
81-90 C p. 157-175
artikel
567 Computing simple paths from given points inside a polygon Tan, Xuehou
2019
81-90 C p. 67-76
artikel
568 Computing solutions to the congruence 1 n + 2 n + ⋯ + n n ≡ p ( mod n ) Alekseyev, Max A.

81-90 C p. 3-9
artikel
569 Computing square roots of graphs with low maximum degree Cochefert, Manfred
2018
81-90 C p. 93-101
artikel
570 Computing the blocks of a quasi-median graph Herrmann, Sven
2014
81-90 C p. 129-138
10 p.
artikel
571 Computing the coarseness with strips or boxes Díaz-Báñez, J.M.
2017
81-90 C p. 80-90
11 p.
artikel
572 Computing the differential of a graph: Hardness, approximability and exact algorithms Bermudo, S.
2014
81-90 C p. 69-82
14 p.
artikel
573 Computing the P 3 -hull number of a graph, a polyhedral approach Blaum, Manuela
2019
81-90 C p. 155-166
artikel
574 Computing with an algebraic-perturbation variant of Barvinok’s algorithm Lee, Jon
2018
81-90 C p. 63-77
artikel
575 Conditional connectivity of folded hypercubes Zhao, Shuli
2019
81-90 C p. 388-392
artikel
576 Conditional diagnosability of bubble-sort star graphs Guo, Jia
2016
81-90 C p. 141-149
9 p.
artikel
577 Conditional diagnosability of multiprocessor systems based on complete-transposition graphs Xu, Liqiong

81-90 C p. 367-379
artikel
578 Conditional edge-fault-tolerant Hamiltonicity of the data center network Qin, Xiao-Wen

81-90 C p. 165-179
artikel
579 Conditional fractional matching preclusion of n -dimensional torus networks Hu, Xiaomin

81-90 C p. 157-165
artikel
580 Conflict-free connection number of random graphs Gu, Ran

81-90 C p. 522-532
artikel
581 Conic relaxation approaches for equal deployment problems Safarina, Sena

81-90 C p. 111-125
artikel
582 1-2-3 Conjecture in digraphs: More results and directions Bensmail, Julien

81-90 C p. 124-137
artikel
583 Connected domination in maximal outerplanar graphs Zhuang, Wei

81-90 C p. 533-541
artikel
584 Connected graph G with σ 2 ( G ) ≥ 2 3 n and K 1 , 4 -free contains a Hamiltonian path Momège, Benjamin

81-90 C p. 37-42
artikel
585 2-Connected graphs with minimum general sum-connectivity index Tomescu, Ioan
2014
81-90 C p. 135-141
7 p.
artikel
586 Connected greedy coloring of H -free graphs Mota, Esdras

81-90 C p. 572-584
artikel
587 Connected positive influence dominating set in k-regular graph Yao, Xiaopeng

81-90 C p. 65-76
artikel
588 Connected realizations of joint-degree matrices Amanatidis, Georgios
2018
81-90 C p. 65-74
artikel
589 Connections between two cycles — a new design of dense processor interconnection networks Bar-Yehuda, Reuven
1992
81-90 C p. 29-43
15 p.
artikel
590 Connectivity and diagnosability of center k -ary n -cubes Wang, Mujiangshan

81-90 C p. 98-107
artikel
591 Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs Chen, Shuya

81-90 C p. 135-146
artikel
592 Connectivity of consecutive-d digraphs Du, D.-Z
1992
81-90 C p. 169-177
9 p.
artikel
593 Connectivity, persistence and fault diagnosis of interconnection networks based on O k and 2O k graphs Ghafoor, Arif
1992
81-90 C p. 205-226
22 p.
artikel
594 Constant threshold intersection graphs of orthodox paths in trees Bornstein, Claudson Ferreira

81-90 C p. 61-68
artikel
595 Constant work-space algorithms for facility location problems Bhattacharya, Binay K.

81-90 C p. 456-472
artikel
596 Constructing completely independent spanning trees in crossed cubes Cheng, Baolei
2017
81-90 C p. 100-109
10 p.
artikel
597 Constructing day-balanced round-robin tournaments with partitions Erzurumluoğlu, Aras
2018
81-90 C p. 81-91
artikel
598 Constructing error-correcting binary codes using transitive permutation groups Laaksonen, Antti
2017
81-90 C p. 65-70
6 p.
artikel
599 Constructing formally self-dual codes over R k Karadeniz, Suat
2014
81-90 C p. 188-196
9 p.
artikel
600 Constructing new families of transmission irregular graphs Xu, Kexiang

81-90 C p. 383-391
artikel
601 Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks Chen, Yindong
2019
81-90 C p. 1-12
artikel
602 Construction methods for generalized bent functions Hodžić, S.
2018
81-90 C p. 14-23
artikel
603 Construction of all tournament matrices with prescribed row sum vector Hacioglu, Ilhan
2014
81-90 C p. 147-152
6 p.
artikel
604 Construction of extremal mixed graphs of diameter two López, Nacho
2019
81-90 C p. 204-211
artikel
605 Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity Li, Jingjing

81-90 C p. 218-227
artikel
606 Constructions of k -critical P 5 -free graphs Hoàng, Chính T.
2015
81-90 C p. 91-98
8 p.
artikel
607 Constructions of rotation symmetric bent functions with high algebraic degree Zhao, Qinglan
2018
81-90 C p. 15-29
artikel
608 Constructive characterizations concerning weak Roman domination in trees Cabrera-Martínez, Abel

81-90 C p. 384-390
artikel
609 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
610 Contents 2014
81-90 C p. v-
1 p.
artikel
611 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
612 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
613 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
614 Contents 2014
81-90 C p. v-
1 p.
artikel
615 Contents 2014
81-90 C p. v-
1 p.
artikel
616 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
617 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
618 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
619 Contents 2015
81-90 C p. v-
1 p.
artikel
620 Contents 2015
81-90 C p. v-
1 p.
artikel
621 Contents 2015
81-90 C p. v-
1 p.
artikel
622 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
623 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
624 Contents 2015
81-90 C p. v-
1 p.
artikel
625 Contents 2015
81-90 C p. v-
1 p.
artikel
626 Contents 2015
81-90 C p. v-
1 p.
artikel
627 Contents 2015
81-90 C p. v-
1 p.
artikel
628 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
629 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
630 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
631 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
632 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
633 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
634 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
635 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
636 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
637 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
638 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
639 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
640 Contents 2017
81-90 C p. v-
1 p.
artikel
641 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
642 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
643 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
644 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
645 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
646 Contents 2017
81-90 C p. v-
1 p.
artikel
647 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
648 Contents 2017
81-90 C p. v-
1 p.
artikel
649 Contents 2017
81-90 C p. v-
1 p.
artikel
650 Contents 2016
81-90 C p. v-
1 p.
artikel
651 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
652 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
653 Contents 2016
81-90 C p. v-
1 p.
artikel
654 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
655 Contents 2017
81-90 C p. v-
1 p.
artikel
656 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
657 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
658 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
659 Contents 2014
81-90 C p. v-
1 p.
artikel
660 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
661 Contents 2014
81-90 C p. v-vi
nvt p.
artikel
662 Contents 2014
81-90 C p. v-
1 p.
artikel
663 Contents 2014
81-90 C p. v-vii
nvt p.
artikel
664 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
665 Contents 2016
81-90 C p. v-vi
nvt p.
artikel
666 Contents 2015
81-90 C p. v-vi
nvt p.
artikel
667 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
668 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
669 Contents 2017
81-90 C p. v-
1 p.
artikel
670 Contents 2018
81-90 C p. v-vi
artikel
671 Contents 2017
81-90 C p. v-vi
artikel
672 Contents 2016
81-90 C p. v-vi
artikel
673 Contents 2017
81-90 C p. v-vi
nvt p.
artikel
674 Contents 2018
81-90 C p. v-vi
artikel
675 Contraction obstructions for connected graph searching Best, Micah J
2016
81-90 C p. 27-47
21 p.
artikel
676 Convex dominating sets in maximal outerplanar graphs Lemańska, Magdalena
2019
81-90 C p. 142-157
artikel
677 Convex generalized flows Holzhauser, Michael
2015
81-90 C p. 86-99
14 p.
artikel
678 Convex hulls of superincreasing knapsacks and lexicographic orderings Gupte, Akshay
2016
81-90 C p. 150-163
14 p.
artikel
679 Cooperative assignment games with the inverse Monge property Martínez-de-Albéniz, F. Javier
2014
81-90 C p. 42-50
9 p.
artikel
680 Cooperative games on simplicial complexes Martino, Ivan

81-90 C p. 246-256
artikel
681 Cooperative games with restricted formation of coalitions Koshevoy, Gleb
2017
81-90 C p. 1-13
13 p.
artikel
682 Cooperative twin-crane scheduling Briskorn, Dirk
2016
81-90 C p. 40-57
18 p.
artikel
683 Cops and an Insightful Robber Huggan, Melissa A.

81-90 C p. 112-119
artikel
684 Cops that surround a robber Burgess, Andrea C.

81-90 C p. 552-566
artikel
685 Core-based criterion for extreme supermodular functions Studený, Milan
2016
81-90 C p. 122-151
30 p.
artikel
686 Correction of the paper “Bicyclic graphs with extremal values of PI index” Ma, Gang
2016
81-90 C p. 132-133
2 p.
artikel
687 Correction to “On the distance Laplacian spectral radius of bipartite graphs” [Discrete Appl. Math. 186 (2015) 207–213] Niu, Aihong
2016
81-90 C p. 137-140
4 p.
artikel
688 Correction to the paper: Patterson–Wiedemann construction revisited Kavut, Selçuk
2016
81-90 C p. 185-187
3 p.
artikel
689 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
81-90 C p. 222-
1 p.
artikel
690 Corrigendum to “On strongly regular signed graphs” [Discrete Applied Mathematics 271 (2019) 184–190] Stanić, Zoran

81-90 C p. 640
artikel
691 Corrigendum to “Polar cographs” [Discrete Appl. Math. 156 (2008) 1652–1660] Ekim, T.
2014
81-90 C p. 158-
1 p.
artikel
692 Corrigendum to “The distance spectral radius of digraphs”: [Discrete Appl. Math. 161 (2013) 2537–2543] Lin, Huiqiu
2015
81-90 C p. 51-52
2 p.
artikel
693 Cost-performance tradeoffs for interconnection networks Kruskal, Clyde P
1992
81-90 C p. 359-385
27 p.
artikel
694 Co-TT graphs and a characterization of split co-TT graphs Golumbic, Martin Charles
2014
81-90 C p. 168-174
7 p.
artikel
695 Counterexamples to the conjecture on orientations of graphs with minimum Wiener index Fang, Yibin
2017
81-90 C p. 213-220
artikel
696 Counting and enumerating galled networks Gunawan, Andreas D.M.

81-90 C p. 644-654
artikel
697 Counting Candy Crush configurations Hamilton, Adam

81-90 C p. 47-56
artikel
698 Counting disjoint hypercubes in Fibonacci cubes Saygı, Elif
2016
81-90 C p. 231-237
7 p.
artikel
699 Counting graceful labelings of trees: A theoretical and empirical study Anick, David
2016
81-90 C p. 65-81
17 p.
artikel
700 Counting independent sets and maximal independent sets in some subclasses of bipartite graphs Lin, Min-Sheng
2018
81-90 C p. 236-244
artikel
701 Counting independent sets in a tolerance graph Lin, Min-Sheng
2015
81-90 C p. 174-184
11 p.
artikel
702 Counting independent sets in tree convex bipartite graphs Lin, Min-Sheng
2017
81-90 C p. 113-122
10 p.
artikel
703 Counting inequivalent monotone Boolean functions Stephen, Tamon
2014
81-90 C p. 15-24
10 p.
artikel
704 Counting Markov equivalence classes for DAG models on trees Radhakrishnan, Adityanarayanan
2018
81-90 C p. 170-185
artikel
705 Counting 4 × 4 matrix partitions of graphs Dyer, Martin
2016
81-90 C p. 76-92
17 p.
artikel
706 Counting rotation symmetric functions using Polya’s theorem K.V., Lakshmy
2014
81-90 C p. 162-167
6 p.
artikel
707 Counting the number of non-equivalent vertex colorings of a graph Hertz, Alain
2016
81-90 C p. 62-71
10 p.
artikel
708 Coupled task scheduling with convex resource consumption functions Mosheiov, Gur

81-90 C p. 128-133
artikel
709 CPG graphs: Some structural and hardness results Champseix, Nicolas

81-90 C p. 17-35
artikel
710 Critical and maximum independent sets of a graph Jarden, Adi

81-90 C p. 127-134
artikel
711 Critical ( P 6 , b a n n e r ) -free graphs Huang, Shenwei
2019
81-90 C p. 143-151
artikel
712 Critical vertices and edges in H -free graphs Paulusma, Daniël
2019
81-90 C p. 361-367
artikel
713 Cryptographic properties of the hidden weighted bit function Wang, Qichun
2014
81-90 C p. 1-10
10 p.
artikel
714 Cryptography and Future Security Kim, Jongsung
2018
81-90 C p. 1
artikel
715 Cube-connected circulants: Bisection width, Wiener and forwarding indices Mokhtar, Hamid

81-90 C p. 48-68
artikel
716 Cube-free resonance graphs Che, Zhongyuan

81-90 C p. 262-268
artikel
717 Cutoff phenomenon for random walks on Kneser graphs Pourmiri, Ali
2014
81-90 C p. 100-106
7 p.
artikel
718 Cutting out polygon collections with a saw Dumitrescu, Adrian
2017
81-90 C p. 98-108
11 p.
artikel
719 Cycle energy and its size dependence Gutman, Ivan

81-90 C p. 534-537
artikel
720 Cycle Kronecker products that are representable as optimal circulants Jha, Pranava K.
2015
81-90 C p. 130-138
9 p.
artikel
721 Cycles embedding in balanced hypercubes with faulty edges and vertices Cheng, Dongqin
2018
81-90 C p. 56-69
artikel
722 Cycles embedding in folded hypercubes under the conditional fault model Cheng, Dongqin
2017
81-90 C p. 60-68
9 p.
artikel
723 Cycles embedding in folded hypercubes with conditionally faulty vertices Kuo, Che-Nan
2017
81-90 C p. 55-59
5 p.
artikel
724 Cycles in complementary prisms Meierling, Dirk
2015
81-90 C p. 180-186
7 p.
artikel
725 Cycles in cube-connected cycles graphs Hsu, Lih-Hsing
2014
81-90 C p. 163-171
9 p.
artikel
726 Cycles in the burnt pancake graph Blanco, Saúl A.
2019
81-90 C p. 1-14
artikel
727 Cyclic deficiency of graphs Asratian, Armen S.
2019
81-90 C p. 171-185
artikel
728 Deciding the existence of a cherry-picking sequence is hard on two trees Döcker, Janosch
2019
81-90 C p. 131-143
artikel
729 Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs Brignall, Robert
2019
81-90 C p. 60-66
artikel
730 Decision trees with minimum average depth for sorting eight elements AbouEisha, Hassan
2016
81-90 C p. 203-207
5 p.
artikel
731 Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture Bensmail, Julien
2019
81-90 C p. 1-9
artikel
732 Decomposing a graph into shortest paths with bounded eccentricity Birmelé, Etienne

81-90 C p. 353-374
artikel
733 Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph Huang, Ziwen
2019
81-90 C p. 112-118
artikel
734 Decomposing clique search problems into smaller instances based on node and edge colorings Szabó, Sándor
2018
81-90 C p. 118-129
artikel
735 Decomposing highly connected graphs into paths of length five Botler, F.
2018
81-90 C p. 128-138
artikel
736 Decomposing split graphs into locally irregular graphs Lintzmayer, C.N.

81-90 C p. 33-44
artikel
737 Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs Korenblit, M.
2017
81-90 C p. 60-72
13 p.
artikel
738 Decomposition of circulant digraphs with two jumps into cycles of equal lengths Bogdanowicz, Zbigniew R.
2015
81-90 C p. 45-51
7 p.
artikel
739 Decompositions of graphs based on a new graph product Boode, Antoon H.
2019
81-90 C p. 31-40
artikel
740 Decomposition theorem on matchable distributive lattices Zhang, Heping
2014
81-90 C p. 239-248
10 p.
artikel
741 Decomposition theorems for square-free 2 -matchings in bipartite graphs Takazawa, Kenjiro
2017
81-90 C p. 215-223
9 p.
artikel
742 Decycling bubble sort graphs Wang, Jian
2015
81-90 C p. 178-182
5 p.
artikel
743 Defect of an octahedron in a rational lattice Fadin, Mikhail

81-90 C p. 37-43
artikel
744 Defensive alliances in graphs of bounded treewidth Bliem, Bernhard
2018
81-90 C p. 334-339
artikel
745 Degenerate matchings and edge colorings Baste, Julien
2018
81-90 C p. 38-44
artikel
746 Degree conditions for graphs to be maximally k -restricted edge connected and super k -restricted edge connected Wang, Shiying
2015
81-90 C p. 258-263
6 p.
artikel
747 Degree diameter problem on honeycomb networks Holub, Přemysl
2014
81-90 C p. 139-151
13 p.
artikel
748 Degree sequence realizations with given packing and covering of spanning trees Liu, Fengxia
2015
81-90 C p. 113-118
6 p.
artikel
749 Degree sum and graph linkage with prescribed path lengths Coll, Vincent E.
2019
81-90 C p. 85-94
artikel
750 Delta–wye reduction of almost-planar graphs Wagner, Donald K.
2015
81-90 C p. 158-167
10 p.
artikel
751 Dense bipartite circulants and their routing via rectangular twisted torus Jha, Pranava K.
2014
81-90 C p. 141-158
18 p.
artikel
752 Dense group networks Campbell, Lowell
1992
81-90 C p. 65-71
7 p.
artikel
753 Dense on-line arbitrarily partitionable graphs Kalinowski, Rafał
2017
81-90 C p. 71-77
7 p.
artikel
754 Dense subgraphs in random graphs Balister, Paul
2019
81-90 C p. 66-74
artikel
755 Design and analysis of fault-tolerant multibus interconnection networks Camarda, Pietro
1992
81-90 C p. 45-64
20 p.
artikel
756 Destroying longest cycles in graphs and digraphs van Aardt, Susan A.
2015
81-90 C p. 251-259
9 p.
artikel
757 Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs Lozovanu, Dmitrii
2015
81-90 C p. 169-180
12 p.
artikel
758 Deterministic construction of compressed sensing matrices from constant dimension codes Wang, Gang

81-90 C p. 9-17
artikel
759 Deterministic distributed construction of T -dominating sets in time T Miller, Avery
2017
81-90 C p. 172-178
7 p.
artikel
760 Deterministic parameterized algorithms for the Graph Motif problem Pinter, Ron Y.
2016
81-90 C p. 162-178
17 p.
artikel
761 Deterministic walks with choice Beeler, Katy E.
2014
81-90 C p. 100-107
8 p.
artikel
762 Detour trees Jobson, Adam S.
2016
81-90 C p. 73-80
8 p.
artikel
763 Diagnosis of constant faults in iteration-free circuits over monotone basis Alrawaf, Saad
2014
81-90 C p. 287-291
5 p.
artikel
764 Diagnosis of constant faults in read-once contact networks over finite bases Busbait, Monther
2015
81-90 C p. 76-88
13 p.
artikel
765 Diagonal flips in plane graphs with triangular and quadrangular faces Matsumoto, Naoki

81-90 C p. 292-305
artikel
766 Diameters of Cayley graphs generated by transposition trees Kraft, Benjamin
2015
81-90 C p. 178-188
11 p.
artikel
767 Diameters of cubic graphs Jørgensen, Leif K.
1992
81-90 C p. 347-351
5 p.
artikel
768 Diametral broadcast graphs Grigoryan, Hayk
2014
81-90 C p. 53-59
7 p.
artikel
769 Differentially private response mechanisms on categorical data Holohan, Naoise
2016
81-90 C p. 86-98
13 p.
artikel
770 Differential property of Present-like structure Hong, Deukjo
2018
81-90 C p. 13-24
artikel
771 Diffuse reflection diameter in simple polygons Barequet, Gill
2016
81-90 C p. 123-132
artikel
772 Digraphs of bounded elimination width Fernau, Henning
2014
81-90 C p. 78-87
10 p.
artikel
773 Digraph width measures in parameterized algorithmics Ganian, Robert
2014
81-90 C p. 88-107
20 p.
artikel
774 Dijkstra graphs Bento, Lucila M.S.
2019
81-90 C p. 52-62
artikel
775 Directed elimination games Engelmann, Viktor
2016
81-90 C p. 187-198
12 p.
artikel
776 Directed weighted improper coloring for cellular channel allocation Archetti, Claudia
2015
81-90 C p. 46-60
15 p.
artikel
777 Direct merging of delta encoded files Shapira, Dana

81-90 C p. 130-140
artikel
778 Direct-optimal basis computation by means of the fusion of simplification rules Rodríguez-Lorenzo, Estrella
2018
81-90 C p. 106-119
artikel
779 Discounted tree solutions Béal, Sylvain
2017
81-90 C p. 1-17
17 p.
artikel
780 Discrepancy inequalities for directed graphs Chung, Fan
2014
81-90 C p. 30-42
13 p.
artikel
781 Discrepancy minimizing spectral clustering Bolla, Marianna
2018
81-90 C p. 286-289
artikel
782 Discrete segments of Z 3 constructed by synchronization of words Provençal, Xavier
2015
81-90 C p. 102-117
16 p.
artikel
783 Discrete Tomography determination of bounded sets in Z n Brunetti, S.
2015
81-90 C p. 20-30
11 p.
artikel
784 Discretization vertex orders in distance geometry Cassioli, Andrea
2015
81-90 C p. 27-41
15 p.
artikel
785 Disjoint Hamilton cycles in transposition graphs Hussak, Walter
2016
81-90 C p. 56-64
9 p.
artikel
786 Dispersing points on intervals Li, Shimin
2018
81-90 C p. 106-118
artikel
787 Disruption recovery at airports: Integer programming formulations and polynomial time algorithms Manyem, Prabhu
2018
81-90 C p. 102-117
artikel
788 Distance and distance signless Laplacian spread of connected graphs You, Lihua
2017
81-90 C p. 140-147
8 p.
artikel
789 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
81-90 C p. 105-117
artikel
790 ℓ -distance-balanced graphs Miklavič, Štefko
2018
81-90 C p. 143-154
artikel
791 Distance domination, guarding and covering of maximal outerplanar graphs Canales, Santiago
2015
81-90 C p. 41-49
9 p.
artikel
792 Distance k -domination, distance k -guarding, and distance k -vertex cover of maximal outerplanar graphs Alvarado, José D.
2015
81-90 C p. 154-159
6 p.
artikel
793 Distance magic graphs G × C n Cichacz, Sylwia
2014
81-90 C p. 80-87
8 p.
artikel
794 Distance measures for Interval Type-2 fuzzy numbers Figueroa-García, Juan Carlos
2015
81-90 C p. 93-102
10 p.
artikel
795 Distance restricted optimal pebbling in cycles Shiue, Chin-Lin

81-90 C p. 125-133
artikel
796 Distances between sets based on set commonality Horadam, K.J.
2014
81-90 C p. 310-314
5 p.
artikel
797 Distances in graphs of girth 6 and generalised cages Alochukwu, Alex

81-90 C p. 125-137
artikel
798 Distant irregularity strength of graphs with bounded minimum degree Przybyło, Jakub
2017
81-90 C p. 159-165
7 p.
artikel
799 Distinct distances and arithmetic progressions Dumitrescu, Adrian
2019
81-90 C p. 38-41
artikel
800 Distinct spreads in vector spaces over finite fields Lund, Ben
2018
81-90 C p. 154-158
artikel
801 Distinguishing numbers and distinguishing indices of oriented graphs Meslem, Kahina

81-90 C p. 330-342
artikel
802 Distribution centers in graphs Desormeaux, Wyatt J.
2018
81-90 C p. 186-193
artikel
803 Diverse data selection via combinatorial quasi-concavity of distance covariance: A polynomial time global minimax algorithm Vepakomma, Praneeth
2019
81-90 C p. 182-191
artikel
804 ( d , n ) -packing colorings of infinite lattices Korže, Danilo
2018
81-90 C p. 97-108
artikel
805 Dominating and irredundant broadcasts in graphs Mynhardt, C.M.
2017
81-90 C p. 80-90
11 p.
artikel
806 Dominating induced matchings in S 1 , 2 , 4 -free graphs Brandstädt, Andreas

81-90 C p. 83-92
artikel
807 Dominating maximal outerplane graphs and Hamiltonian plane triangulations Plummer, Michael D.

81-90 C p. 162-167
artikel
808 Dominating plane triangulations Plummer, Michael D.
2016
81-90 C p. 175-182
8 p.
artikel
809 Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups Çalışkan, Cafer
2019
81-90 C p. 15-24
artikel
810 Domination and location in twin-free digraphs Foucaud, Florent

81-90 C p. 42-52
artikel
811 Domination and total domination in cubic graphs of large girth Dantas, Simone
2014
81-90 C p. 128-132
5 p.
artikel
812 Domination chain: Characterisation, classical complexity, parameterised complexity and approximability Bazgan, Cristina

81-90 C p. 23-42
artikel
813 Domination, coloring and stability in P 5 -reducible graphs Fouquet, Jean-Luc
2015
81-90 C p. 122-129
8 p.
artikel
814 Domination cover rubbling Beeler, Robert A.
2019
81-90 C p. 75-85
artikel
815 Domination game on uniform hypergraphs Bujtás, Csilla
2019
81-90 C p. 65-75
artikel
816 Domination in direct products of complete graphs Vemuri, Harish

81-90 C p. 473-482
artikel
817 [ 1 , 2 ] -domination in graphs Yang, Xiaojing
2014
81-90 C p. 79-86
8 p.
artikel
818 Domination in intersecting hypergraphs Dong, Yanxia
2018
81-90 C p. 155-159
artikel
819 Domination in some subclasses of bipartite graphs Pandey, Arti
2019
81-90 C p. 51-66
artikel
820 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
81-90 C p. 147-153
7 p.
artikel
821 Domination parameters in hypertrees and sibling trees Rajasingh, Indra

81-90 C p. 237-245
artikel
822 Domination parameters with number 2 : Interrelations and algorithmic consequences Bonomo, Flavia
2018
81-90 C p. 23-50
artikel
823 Domination problems with no conflicts Cornet, Alexis
2018
81-90 C p. 78-88
artikel
824 Domination ratio of integer distance digraphs Huang, Jia
2019
81-90 C p. 104-115
artikel
825 Domination versus disjunctive domination in trees Henning, Michael A.
2015
81-90 C p. 171-177
7 p.
artikel
826 Domination versus edge domination Baste, Julien

81-90 C p. 343-349
artikel
827 Dot product dimensions of graphs Li, Bo-Jr
2014
81-90 C p. 159-163
5 p.
artikel
828 Double domination in lexicographic product graphs Cabrera Martínez, Abel

81-90 C p. 290-300
artikel
829 Double Roman domination Beeler, Robert A.
2016
81-90 C p. 23-29
7 p.
artikel
830 Double Roman domination number V., Anu
2018
81-90 C p. 198-204
artikel
831 DP-4-colorability of planar graphs without adjacent cycles of given length Liu, Runrun

81-90 C p. 245-251
artikel
832 3D well-composed polyhedral complexes Gonzalez-Diaz, Rocio
2015
81-90 C p. 59-77
19 p.
artikel
833 3-dynamic coloring and list 3-dynamic coloring of K 1 , 3 -free graphs Li, Hao
2017
81-90 C p. 166-171
6 p.
artikel
834 Dynamic coloring of graphs having no K 5 minor Kim, Younjin
2016
81-90 C p. 81-89
9 p.
artikel
835 Dynamic coloring parameters for graphs with given genus Loeb, Sarah
2018
81-90 C p. 129-141
artikel
836 Dynamic determination of variable sizes of chunks in a deduplication system Hirsch, Michael

81-90 C p. 81-91
artikel
837 Dynamic index and LZ factorization in compressed space Nishimoto, Takaaki

81-90 C p. 116-129
artikel
838 Dynamic monopolies for interval graphs with bounded thresholds Bessy, Stéphane
2019
81-90 C p. 256-261
artikel
839 Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks Khoshkhah, Kaveh
2014
81-90 C p. 81-89
9 p.
artikel
840 Dynamic monopolies in two-way bootstrap percolation Jeger, Clemens
2019
81-90 C p. 116-126
artikel
841 Dynamic programming bi-criteria combinatorial optimization Mankowski, Michal

81-90 C p. 513-533
artikel
842 Ear decomposition and induced even cycles Peng, Dongmei
2019
81-90 C p. 161-166
artikel
843 Easy computation of eccentricity approximating trees Ducoffe, Guillaume
2019
81-90 C p. 267-271
artikel
844 Eccentricity approximating trees Dragan, Feodor F.
2017
81-90 C p. 142-156
artikel
845 Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings Cheng, Christine T.
2016
81-90 C p. 27-34
8 p.
artikel
846 Eccentricity sums in trees Smith, Heather
2016
81-90 C p. 120-131
12 p.
artikel
847 Edge-coloring of plane multigraphs with many colors on facial cycles Czap, Július

81-90 C p. 80-85
artikel
848 Edge coloring of signed graphs Zhang, Li

81-90 C p. 234-242
artikel
849 Edge-colouring graphs with bounded local degree sums Zatesko, L.M.

81-90 C p. 268-283
artikel
850 Edge consecutive gracefulness of a graph Pereira, Jessica

81-90 C p. 214-220
artikel
851 Edge construction of molecular NSSDs Farrugia, Alexander
2019
81-90 C p. 130-140
artikel
852 Edge decomposition of connected claw-free cubic graphs Hong, Yanmei

81-90 C p. 246-250
artikel
853 Edge disjoint caterpillar realizations Miklós, István

81-90 C p. 327-344
artikel
854 Edge-disjoint paths in faulty augmented cubes Ma, Meijie

81-90 C p. 108-114
artikel
855 Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks Li, Pingshan
2019
81-90 C p. 145-152
artikel
856 Edge-grafting transformations on the average eccentricity of graphs and their applications He, Chunling
2018
81-90 C p. 95-105
artikel
857 Edge-intersection graphs of boundary-generated paths in a grid Golumbic, Martin Charles
2018
81-90 C p. 214-222
artikel
858 Edge-intersection graphs of grid paths: The bend-number Heldt, Daniel
2014
81-90 C p. 144-162
19 p.
artikel
859 Edge intersection graphs of L -shaped paths in grids Cameron, Kathie
2016
81-90 C p. 185-194
artikel
860 Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues Belardo, Francesco
2019
81-90 C p. 130-138
artikel
861 Edge separators for quasi-binary trees Ramírez Alfonsín, Jorge Luis
2016
81-90 C p. 284-289
artikel
862 Edge-stable equimatchable graphs Deniz, Zakir
2019
81-90 C p. 136-147
artikel
863 Edge weights and vertex colours: Minimizing sum count Baudon, Olivier
2019
81-90 C p. 13-24
artikel
864 Editorial 1999
81-90 C p. 245-
1 p.
artikel
865 Editorial 1999
81-90 C p. 1-2
2 p.
artikel
866 Editorial Board 1992
81-90 C p. iii-iv
nvt p.
artikel
867 Editorial Board 2017
81-90 C p. v-
1 p.
artikel
868 Editorial Board 2018
81-90 C p. ii
artikel
869 Editorial Board 2018
81-90 C p. ii
artikel
870 Editorial Board 2018
81-90 C p. ii
artikel
871 Editorial Board 2019
81-90 C p. ii
artikel
872 Editorial Board 2018
81-90 C p. ii
artikel
873 Editorial Board 2019
81-90 C p. ii
artikel
874 Editorial Board 2019
81-90 C p. ii
artikel
875 Editorial Board 2019
81-90 C p. ii
artikel
876 Editorial Board 2019
81-90 C p. ii
artikel
877 Editorial Board 2019
81-90 C p. ii
artikel
878 Editorial Board 2019
81-90 C p. ii
artikel
879 Editorial Board 2019
81-90 C p. ii
artikel
880 Editorial Board 2019
81-90 C p. ii
artikel
881 Editorial Board 2019
81-90 C p. ii
artikel
882 Editorial Board 2019
81-90 C p. ii
artikel
883 Editorial Board 2019
81-90 C p. ii
artikel
884 Editorial Board 2019
81-90 C p. ii
artikel
885 Editorial Board 2019
81-90 C p. ii
artikel
886 Editorial Board 2019
81-90 C p. ii
artikel
887 Editorial Board 2019
81-90 C p. ii
artikel
888 Editorial Board
81-90 C p. ii
artikel
889 Editorial Board 2019
81-90 C p. ii
artikel
890 Editorial Board
81-90 C p. ii
artikel
891 Editorial Board 2019
81-90 C p. ii
artikel
892 Editorial Board 2019
81-90 C p. ii
artikel
893 Editorial Board 2019
81-90 C p. ii
artikel
894 Editorial Board 2018
81-90 C p. ii
artikel
895 Editorial Board 2017
81-90 C p. v-vi
nvt p.
artikel
896 Editorial Board 2018
81-90 C p. ii
artikel
897 Editorial Board 2018
81-90 C p. ii
artikel
898 Editorial Board 2018
81-90 C p. ii
artikel
899 Editorial Board 2017
81-90 C p. v-vi
artikel
900 Editorial Board 2018
81-90 C p. ii
artikel
901 Editorial Board 2018
81-90 C p. ii
artikel
902 Editorial Board 2018
81-90 C p. ii
artikel
903 Editorial Board 2018
81-90 C p. ii
artikel
904 Editorial Board 2018
81-90 C p. ii
artikel
905 Editorial Board 2018
81-90 C p. ii
artikel
906 Editorial Board 2018
81-90 C p. ii
artikel
907 Editorial Board
81-90 C p. ii
artikel
908 Editorial Board
81-90 C p. ii
artikel
909 Editorial Board
81-90 C p. ii
artikel
910 Editorial Board
81-90 C p. ii
artikel
911 Editorial Board
81-90 C p. ii
artikel
912 Editorial Board
81-90 C p. ii
artikel
913 Editorial Board
81-90 C p. ii
artikel
914 Editorial Board
81-90 C p. ii
artikel
915 Editorial Board
81-90 C p. ii
artikel
916 Editorial Board
81-90 C p. ii
artikel
917 Editorial Board
81-90 C p. ii
artikel
918 Editorial Board
81-90 C p. ii
artikel
919 Editorial Board
81-90 C p. ii
artikel
920 Editorial Board
81-90 C p. ii
artikel
921 Editorial Board
81-90 C p. ii
artikel
922 Editorial Board
81-90 C p. ii
artikel
923 Editorial Board
81-90 C p. ii
artikel
924 Editorial Board
81-90 C p. ii
artikel
925 Editorial Board
81-90 C p. ii
artikel
926 Editorial Board
81-90 C p. ii
artikel
927 Editorial Board
81-90 C p. ii
artikel
928 Editorial Board
81-90 C p. ii
artikel
929 Editorial: Stringology Algorithms Holub, Jan
2016
81-90 C p. 1-
1 p.
artikel
930 Effect of predomination and vertex removal on the game total domination number of a graph Iršič, Vesna
2019
81-90 C p. 216-225
artikel
931 Effects of vertex degrees on the zero-forcing number and propagation time of a graph Fast, Caleb C.
2018
81-90 C p. 215-226
artikel
932 Efficient algorithms for dualizing large-scale hypergraphs Murakami, Keisuke
2014
81-90 C p. 83-94
12 p.
artikel
933 Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions Ando, Kazutoshi
2017
81-90 C p. 1-10
10 p.
artikel
934 Efficient construction of broadcast graphs Averbuch, A.
2014
81-90 C p. 9-14
6 p.
artikel
935 Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization Kudin, S.

81-90 C p. 150-157
artikel
936 Efficient domination for classes of P 6 -free graphs Brandstädt, Andreas
2017
81-90 C p. 15-27
13 p.
artikel
937 Efficient domination through eigenvalues Cardoso, Domingos M.
2016
81-90 C p. 54-62
9 p.
artikel
938 Efficient eight-regular circulants based on the Kronecker product Jha, Pranava K.
2018
81-90 C p. 207-218
artikel
939 Efficient enumeration of graph orientations with sources Conte, Alessio
2018
81-90 C p. 22-37
artikel
940 Efficient fault-tolerant fixed routings on (k+1)-connected digraphs Wada, Koichi
1992
81-90 C p. 539-552
14 p.
artikel
941 Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope Hoeksma, Ruben
2016
81-90 C p. 136-145
10 p.
artikel
942 Efficient independent set approximation in unit disk graphs Das, Gautam K.

81-90 C p. 63-70
artikel
943 Efficient k -shot broadcasting in radio networks Kantor, Erez
2016
81-90 C p. 79-94
16 p.
artikel
944 Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds Berry, Anne
2015
81-90 C p. 50-61
12 p.
artikel
945 Efficient minimization of higher order submodular functions using monotonic Boolean functions Ramalingam, Srikumar
2017
81-90 C p. 1-19
19 p.
artikel
946 Efficient ( t , r ) broadcast dominating sets of the triangular lattice Harris, Pamela E.

81-90 C p. 180-192
artikel
947 Eigenvalue location in cographs Jacobs, David P.
2018
81-90 C p. 220-235
artikel
948 Eigenvalue multiplicity in regular graphs Rowlinson, Peter
2019
81-90 C p. 11-17
artikel
949 Eigenvector-based identification of bipartite subgraphs Paul, Debdas
2019
81-90 C p. 146-158
artikel
950 Elementary matrix equivalence and core transformation graphs for Parikh matrices Poovanandran, Ghajendran
2018
81-90 C p. 276-289
artikel
951 Elliptic approximations of propositional formulae van Maaren, Hans
1999
81-90 C p. 223-244
22 p.
artikel
952 Elusiveness of finding degrees Goyal, Dishant

81-90 C p. 128-139
artikel
953 Embedding of hypercubes into sibling trees Arockiaraj, Micheal
2014
81-90 C p. 9-14
6 p.
artikel
954 Embedding planar 5-graphs in three pages Guan, Xiaxia

81-90 C p. 108-121
artikel
955 Embedding various cycles with prescribed paths into k -ary n -cubes Yang, Yuxing
2017
81-90 C p. 161-169
9 p.
artikel
956 Empirical analysis of algorithms for the shortest negative cost cycle problem Anderson, Matthew
2019
81-90 C p. 167-184
artikel
957 Employee workload balancing by graph partitioning Ceselli, Alberto
2014
81-90 C p. 112-129
18 p.
artikel
958 Encoding watermark numbers as reducible permutation graphs using self-inverting permutations Chroni, Maria
2018
81-90 C p. 145-164
artikel
959 End-vertices of LBFS of (AT-free) bigraphs Gorzny, Jan
2017
81-90 C p. 87-94
8 p.
artikel
960 Energies of unitary one-matching bi-Cayley graphs over finite commutative rings Liu, Xiaogang
2019
81-90 C p. 170-179
artikel
961 Energy of signed digraphs Pirzada, S.
2014
81-90 C p. 195-205
11 p.
artikel
962 Energy of weighted digraphs Bhat, Mushtaq A.
2017
81-90 C p. 1-14
14 p.
artikel
963 Enumerating and categorizing positive Boolean functions separable by a k -additive capacity Uyanık, Eda
2017
81-90 C p. 17-30
14 p.
artikel
964 Enumerating graphs via even/odd dichotomy Hujdurović, Ademir

81-90 C p. 252-262
artikel
965 Enumerating lambda terms by weighted length of their De Bruijn representation Bodini, Olivier
2018
81-90 C p. 45-61
artikel
966 Enumerating minimal dominating sets in chordal bipartite graphs Golovach, Petr A.
2016
81-90 C p. 30-36
7 p.
artikel
967 Enumeration and extensions of word-representants Gaetz, Marisa

81-90 C p. 423-433
artikel
968 Enumeration and maximum number of maximal irredundant sets for chordal graphs Golovach, Petr A.
2019
81-90 C p. 69-85
artikel
969 Enumeration of inversion sequences avoiding triples of relations Cao, Wenqin
2019
81-90 C p. 86-97
artikel
970 Enumeration of minimal connected dominating sets for chordal graphs Golovach, Petr A.

81-90 C p. 3-11
artikel
971 Enumerations of humps and peaks in ( k , a ) -paths and ( n , m ) -Dyck paths via bijective proofs Du, Rosena R.X.
2015
81-90 C p. 42-49
8 p.
artikel
972 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
81-90 C p. 96-103
artikel
973 Equations enforcing repetitions under permutations Day, Joel D.

81-90 C p. 61-78
artikel
974 Equidistant codes in the Grassmannian Etzion, Tuvi
2015
81-90 C p. 87-97
11 p.
artikel
975 Equilibrium paths in discounted supergames Berg, Kimmo
2019
81-90 C p. 1-27
artikel
976 Equistable simplicial, very well-covered, and line graphs Levit, Vadim E.
2014
81-90 C p. 205-212
8 p.
artikel
977 Equitable coloring of hypergraphs Furmańczyk, Hanna
2019
81-90 C p. 186-192
artikel
978 Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs Yan, Zhidan
2014
81-90 C p. 328-333
6 p.
artikel
979 Equitable colorings of Cartesian products with balanced complete multipartite graphs Yan, Zhidan
2015
81-90 C p. 200-203
4 p.
artikel
980 Equitable colorings of hypergraphs with few edges Akhmejanova, Margarita B.

81-90 C p. 2-12
artikel
981 Equitable neighbour-sum-distinguishing edge and total colourings Baudon, Olivier
2017
81-90 C p. 40-53
14 p.
artikel
982 Equitable total coloring of complete r -partite p -balanced graphs da Silva, A.G.
2019
81-90 C p. 123-135
artikel
983 Equitable total-coloring of subcubic graphs Gui, Hao
2015
81-90 C p. 167-170
4 p.
artikel
984 Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 × n rectangles Langner, Johanna
2018
81-90 C p. 297-303
artikel
985 Equivalence between pathbreadth and strong pathbreadth Ducoffe, Guillaume
2019
81-90 C p. 185-188
artikel
986 Equivalence for negabent functions and their relative difference sets Anbar, Nurdagül
2019
81-90 C p. 1-12
artikel
987 Equivalent realisations of a rigid graph Jackson, Bill
2019
81-90 C p. 42-58
artikel
988 Equivalent versions of group-connectivity theorems and conjectures Kochol, Martin
2019
81-90 C p. 350-352
artikel
989 Erdős–Ko–Rado theorems for a family of trees Feghali, Carl
2018
81-90 C p. 464-471
artikel
990 Erdős–Ko–Rado theorems on the weak Bruhat lattice Fishel, Susanna
2019
81-90 C p. 65-75
artikel
991 Erratum to “Characterizing acyclic graphs by labeling edges” [Discrete Appl. Math. 164 (2014) 492–499] Urrutia, Sebastián
2015
81-90 C p. 254-255
2 p.
artikel
992 Erratum to “On oriented cliques with respect to push operation” [Discrete Appl. Math. 232 (2017) 50–63] Bensmail, Julien
2019
81-90 C p. 276-278
artikel
993 Essential upper bounds on the total domination number Henning, Michael A.
2018
81-90 C p. 103-115
artikel
994 Estimating the r -colorability threshold for a random hypergraph Shabanov, Dmitry A.

81-90 C p. 168-183
artikel
995 Estimation of Laplacian spectra of direct and strong product graphs Sayama, Hiroki
2016
81-90 C p. 160-170
11 p.
artikel
996 Eternal dominating sets on digraphs and orientations of graphs Bagan, Guillaume

81-90 C p. 99-115
artikel
997 Eternal domination on prisms of graphs Krim-Yee, Aaron

81-90 C p. 734-736
artikel
998 Euclidean farthest-point Voronoi diagram of a digital edge Roussillon, Tristan
2015
81-90 C p. 118-129
12 p.
artikel
999 Eulerian orientations and vertex-connectivity Hörsch, Florian

81-90 C p. 115-124
artikel
1000 Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices Kuo, Che-Nan

81-90 C p. 1-9
artikel
                             2883 gevonden resultaten
 
   volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland