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
 
                             2968 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
41-50 C p. 164-216
53 p.
artikel
2 A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality Mohan, Usha
2019
41-50 C p. 108-118
artikel
3 A 5 4 -approximation for subcubic 2EC using circulations and obliged edges Boyd, Sylvia
2016
41-50 C p. 48-58
11 p.
artikel
4 A 3 4 -approximation of Vizing’s conjecture for claw-free graphs Brešar, Boštjan

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

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

41-50 C p. 218-234
artikel
15 A branch-and-price algorithm for the robust graph coloring problem Archetti, Claudia
2014
41-50 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

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

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

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

41-50 C p. 186-196
artikel
24 A characterization of dissimilarity families of trees Baldisserri, Agnese
2017
41-50 C p. 35-45
11 p.
artikel
25 A characterization of double Roman trees Henning, Michael A.
2019
41-50 C p. 100-111
artikel
26 A characterization of edge b-critical graphs Bendali-Braham, Amel
2018
41-50 C p. 158-160
artikel
27 A characterization of interval orders with semiorder dimension two Apke, Alexander

41-50 C p. 142-150
artikel
28 A characterization of line graphs that are squares of graphs Milanič, Martin
2014
41-50 C p. 83-91
9 p.
artikel
29 A characterization of nested canalyzing functions with maximum average sensitivity Stearns, Richard E.
2018
41-50 C p. 5-14
artikel
30 A characterization of perfect Roman trees Sheikholeslami, S.M.

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

41-50 C p. 50-61
artikel
38 A classification of edge-colored graphs based on properly colored walks Li, Ruonan

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

41-50 C p. 92-105
artikel
42 A class of spectral bounds for Max k -Cut Anjos, Miguel F.

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

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

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

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

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

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

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

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

41-50 C p. 1-6
artikel
88 A formal framework for Stringology Soltys, Michael

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

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

41-50 C p. 75-89
artikel
111 Algorithms for computing the Shapley value of cooperative games on lattices Maafa, Khaled
2018
41-50 C p. 91-105
artikel
112 Algorithms for finding a rooted ( k , 1 ) -edge-connected orientation Király, Csaba
2014
41-50 C p. 263-268
6 p.
artikel
113 Algorithms for finding disjoint path covers in unit interval graphs Park, Jung-Heum
2016
41-50 C p. 132-149
18 p.
artikel
114 Algorithms for linear time reconstruction by discrete tomography Pagani, Silvia M.C.
2019
41-50 C p. 152-170
artikel
115 Algorithms for linear time reconstruction by discrete tomography II Ceko, Matthew

41-50 C p. 7-20
artikel
116 Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness Zinder, Y.
2015
41-50 C p. 28-53
26 p.
artikel
117 Algorithms for unipolar and generalized split graphs Eschen, Elaine M.
2014
41-50 C p. 195-201
7 p.
artikel
118 Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number Fellows, Michael
2018
41-50 C p. 94-100
artikel
119 Algorithms to approximately count and sample conforming colorings of graphs Miracle, Sarah
2016
41-50 C p. 133-149
artikel
120 A linear algorithm for secure domination in trees Burger, A.P.
2014
41-50 C p. 15-27
13 p.
artikel
121 A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs Pandit, Parthe
2018
41-50 C p. 155-169
artikel
122 A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout Shalini, Arul Jeya

41-50 C p. 10-18
artikel
123 A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph Ihm, Insung
2017
41-50 C p. 98-112
15 p.
artikel
124 A linear-time algorithm for testing full outer-2-planarity Hong, Seok-Hee
2019
41-50 C p. 234-257
artikel
125 A linear-time kernelization for the Rooted k -Leaf Outbranching Problem Kammer, Frank
2015
41-50 C p. 126-138
13 p.
artikel
126 Alliance polynomial of regular graphs Carballosa, Walter
2017
41-50 C p. 22-32
11 p.
artikel
127 Alliances in graphs of bounded clique-width Kiyomi, Masashi
2017
41-50 C p. 91-97
7 p.
artikel
128 All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs Wu, Haibo
2019
41-50 C p. 196-203
artikel
129 All-to-all broadcast problem of some classes of graphs under the half duplex all-port model Chang, Fei-Huang
2014
41-50 C p. 28-34
7 p.
artikel
130 Almost all regular graphs are normal Changiz Rezaei, Seyed Saeed
2017
41-50 C p. 51-55
5 p.
artikel
131 Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees Darties, Benoît
2018
41-50 C p. 124-136
artikel
132 Almost empty monochromatic triangles in planar point sets Basu, Deepan
2016
41-50 C p. 207-213
artikel
133 Almost every graph is divergent under the biclique operator Groshaus, Marina
2016
41-50 C p. 130-140
11 p.
artikel
134 A local analysis to determine all optimal solutions of p - k - max location problems on networks Schnepper, Teresa

41-50 C p. 217-234
artikel
135 A local maximizer for lattice width of 3-dimensional hollow bodies Averkov, Gennadiy

41-50 C p. 129-142
artikel
136 A lower bound for radio k -chromatic number Saha, Laxman
2015
41-50 C p. 87-100
14 p.
artikel
137 A lower bound on the crossing number of uniform hypergraphs Anshu, Anurag
2016
41-50 C p. 11-15
5 p.
artikel
138 A lower bound on the independence number of a graph in terms of degrees and local clique sizes Brause, C.
2016
41-50 C p. 59-67
9 p.
artikel
139 A lower bound on the order of the largest induced forest in planar graphs with high girth Dross, François
2016
41-50 C p. 99-107
9 p.
artikel
140 A lower bound on the zero forcing number Davila, Randy
2018
41-50 C p. 363-367
artikel
141 Alternating kernels Delgado-Escalante, Pietra
2018
41-50 C p. 153-164
artikel
142 Alternative formulations for the obnoxious p-median problem Lin, Chang-Chun

41-50 C p. 366-373
artikel
143 A magic rectangle set on Abelian groups and its application Cichacz, Sylwia

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

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

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

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

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

41-50 C p. 80-91
artikel
178 Analysis on Yu et al.’s dynamic algorithm for canonic DBC Eom, Sookyung

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

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

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

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

41-50 C p. 115-120
artikel
200 A new sufficient condition for pancyclability of graphs Cai, Junqing
2014
41-50 C p. 142-148
7 p.
artikel
201 A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs Contreras-Balbuena, Alejandro
2017
41-50 C p. 55-63
9 p.
artikel
202 An exact algorithm for a class of geometric set-cover problems Contardo, Claudio

41-50 C p. 25-35
artikel
203 An exact algorithm for maximum independent set in degree-5 graphs Xiao, Mingyu
2016
41-50 C p. 137-155
19 p.
artikel
204 An exact algorithm for the bottleneck 2-connected k -Steiner network problem in L p planes Brazil, M.
2016
41-50 C p. 47-69
23 p.
artikel
205 An extension of Lehman’s theorem and ideal set functions Király, Tamás
2016
41-50 C p. 251-263
13 p.
artikel
206 An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications Peng, Yuejian
2016
41-50 C p. 170-175
6 p.
artikel
207 An FPT algorithm for the vertex cover P 4 problem Tu, Jianhua
2016
41-50 C p. 186-190
5 p.
artikel
208 An improved algorithm to construct edge-independent spanning trees in augmented cubes Cheng, Baolei

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

41-50 C p. 275-291
artikel
211 An improved upper bound for the neighbor sum distinguishing index of graphs Wang, Guanghui
2014
41-50 C p. 126-128
3 p.
artikel
212 An improved upper bound for the subarray partial concentrators Hu, X.D.
1992
41-50 C p. 341-346
6 p.
artikel
213 An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph Zhang, Lianzhu
2014
41-50 C p. 348-354
7 p.
artikel
214 An improved upper bound on the double Roman domination number of graphs with minimum degree at least two Khoeilar, Rana
2019
41-50 C p. 159-167
artikel
215 An improvement on the number of simplices in F q d Pham, Duc Hiep
2017
41-50 C p. 95-105
11 p.
artikel
216 An inequality on global alliances for trees Yu, Alexandria
2015
41-50 C p. 227-229
3 p.
artikel
217 An infinite family of 2-connected graphs that have reliability factorisations Morgan, Kerri
2017
41-50 C p. 123-127
5 p.
artikel
218 An infinite family of graphs with a facile count of perfect matchings Rosenfeld, Vladimir R.
2014
41-50 C p. 210-214
5 p.
artikel
219 An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method Taghavi Afshord, Saeid
2015
41-50 C p. 208-219
12 p.
artikel
220 An integer programming approach for solving a generalized version of the Grundy domination number Campêlo, Manoel

41-50 C p. 26-48
artikel
221 An integer programming model for protein structure prediction using the 3D-HP side chain model Nunes, Luiz Fernando
2016
41-50 C p. 206-214
9 p.
artikel
222 An interleaved method for constructing de Bruijn sequences Zhao, Xiao-Xin
2019
41-50 C p. 234-245
artikel
223 An O ∗ ( 2 . 61 9 k ) algorithm for 4-Path Vertex Cover Tsur, Dekel

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

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

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

41-50 C p. 62-64
artikel
235 A note on deterministic zombies Bartier, Valentin

41-50 C p. 65-68
artikel
236 A note on domination number in maximal outerplanar graphs Liu, Chanjuan

41-50 C p. 90-94
artikel
237 A note on double domination in graphs Cabrera-Martínez, Abel

41-50 C p. 107-111
artikel
238 A note on easy and efficient computation of full abelian periods of a word Fici, Gabriele
2016
41-50 C p. 88-95
8 p.
artikel
239 A note on eigenvalue bounds for independence numbers of non-regular graphs Li, Yusheng
2014
41-50 C p. 146-149
4 p.
artikel
240 A note on equidistant subspace codes Bartoli, Daniele
2016
41-50 C p. 291-296
6 p.
artikel
241 A note on generalized semitotal point graphs Cheuk, Danny

41-50 C p. 114-127
artikel
242 A note on generic rigidity of graphs in higher dimension Jordán, Tibor

41-50 C p. 97-101
artikel
243 A note on k -metric dimensional graphs Corregidor, Samuel G.

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

41-50 C p. 492-502
artikel
246 A note on partitions of graphs under degree constraints Zu, Chunlei

41-50 C p. 631-633
artikel
247 A note on 1-planar graphs Ackerman, Eyal
2014
41-50 C p. 104-108
5 p.
artikel
248 A note on 1-planar graphs with minimum degree 7 Biedl, Therese

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

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

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

41-50 C p. 591-593
artikel
262 A note on the packing chromatic number of lexicographic products Božović, Dragana

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

41-50 C p. 21-26
artikel
273 Antimagic orientations of graphs with given independence number Song, Zi-Xia

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

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

41-50 C p. 19-28
artikel
287 A polynomial algorithm for minimizing discrete convic functions in fixed dimension Veselov, S.I.

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

41-50 C p. 278-293
artikel
294 Approximability of guarding weak visibility polygons Bhattacharya, Pritam
2017
41-50 C p. 109-129
21 p.
artikel
295 Approximability of the dispersed p → -neighbor k -supplier problem van Ee, Martijn

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

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

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

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

41-50 C p. 20-27
artikel
315 A proof for a conjecture of Gorgol Campos, V.
2018
41-50 C p. 202-207
artikel
316 A proof of a conjecture on the differential of a subcubic graph Khoeilar, R.

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

41-50 C p. 253-256
artikel
323 A recognition algorithm for simple-triangle graphs Takaoka, Asahi

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

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

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

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

41-50 C p. 178-182
artikel
335 A short note on the existence of infinite sequences of γ -graphs of graphs Finbow, Stephen

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

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

41-50 C p. 248-261
artikel
341 A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers R ( 3 , k ) Zhu, Rujie
2016
41-50 C p. 216-221
6 p.
artikel
342 Aspects of upper defensive alliances Bazgan, Cristina
2019
41-50 C p. 111-120
artikel
343 A study of scheduling problems with preemptions on multi-core computers with GPU accelerators Błażewicz, Jacek
2015
41-50 C p. 72-82
11 p.
artikel
344 A study on load-balanced variants of the bin packing problem Castro-Silva, D.
2019
41-50 C p. 4-14
artikel
345 A subexponential-time algorithm for the Maximum Independent Set Problem in P t -free graphs Brause, Christoph
2017
41-50 C p. 113-118
6 p.
artikel
346 A sufficient condition for a planar graph to be 4 -choosable Xu, Renyu
2017
41-50 C p. 120-122
3 p.
artikel
347 A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable Zhu, Enqiang
2017
41-50 C p. 148-153
6 p.
artikel
348 A sufficient Q -spectral condition for a graph to be β -deficient involving minimum degree Liu, Weijun
2019
41-50 C p. 158-167
artikel
349 A survey-based approach for designing the lines of a rapid transit network Escudero, L.F.
2016
41-50 C p. 14-34
artikel
350 A survey of integrity Bagga, K.S.
1992
41-50 C p. 13-28
16 p.
artikel
351 A survey on flows in graphs and matroids Guenin, Bertrand
2016
41-50 C p. 122-132
11 p.
artikel
352 Asymmetric colorings of products of graphs and digraphs Broere, Izak
2019
41-50 C p. 56-64
artikel
353 A symmetry-free polynomial formulation of the capacitated vehicle routing problem Gadegaard, S.L.

41-50 C p. 179-192
artikel
354 Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs Maurer, Ueli M.
1992
41-50 C p. 421-436
16 p.
artikel
355 Asymptotic enumeration of perfect matchings in m -barrel fullerene graphs Behmaram, Afshin
2019
41-50 C p. 153-162
artikel
356 Asymptotic results on weakly increasing subsequences in random words Işlak, Ümi̇t
2018
41-50 C p. 171-189
artikel
357 Asymptotic surviving rate of trees with multiple fire sources Costa, Vitor
2015
41-50 C p. 14-19
6 p.
artikel
358 A ternary search problem on two disjoint sets Li, Shengjia
2018
41-50 C p. 221-235
artikel
359 A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs Vernet, Mathilde

41-50 C p. 203-216
artikel
360 A three-person deterministic graphical game without Nash equilibria Boros, Endre
2018
41-50 C p. 21-38
artikel
361 A tie-break model for graph search Corneil, Derek G.
2016
41-50 C p. 89-100
12 p.
artikel
362 A tight analysis of the Submodular–Supermodular Procedure Byrnes, Kevin M.
2015
41-50 C p. 275-282
8 p.
artikel
363 A tight lower bound for Vertex Planarization on graphs of bounded treewidth Pilipczuk, Marcin
2017
41-50 C p. 211-216
6 p.
artikel
364 A tree distinguishing polynomial Liu, Pengyu

41-50 C p. 1-8
artikel
365 A two-commodity flow formulation for the capacitated truck-and-trailer routing problem Bartolini, E.

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

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

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

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

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

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

41-50 C p. 120-133
artikel
404 Bipartite finite Toeplitz graphs Nicoloso, Sara
2014
41-50 C p. 233-244
12 p.
artikel
405 Bipartite Ramsey numbers of paths for random graphs Liu, Meng
2019
41-50 C p. 171-174
artikel
406 Bisecting and D -secting families for set systems Balachandran, Niranjan

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

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

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

41-50 C p. 82-91
artikel
439 Burning a graph is hard Bessy, Stéphane
2017
41-50 C p. 73-87
artikel
440 Burning number of caterpillars Liu, Huiqing

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

41-50 C p. 90-96
artikel
444 Capacitated discrete unit disk cover Mishra, Pawan K.

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

41-50 C p. 231-244
artikel
451 Characterising circular-arc contact B 0 –VPG graphs Bonomo-Braberman, Flavia

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

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

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

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

41-50 C p. 188-200
artikel
486 Circuit k -covers of signed graphs Chen, Jing

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

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

41-50 C p. 73-82
artikel
517 3-color Schur numbers Boza, L.
2019
41-50 C p. 59-68
artikel
518 Color spanning objects: Algorithms and hardness results Banerjee, Sandip

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

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

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

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

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

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

41-50 C p. 585-591
artikel
552 Complexity aspects of the triangle path convexity Dourado, Mitre C.
2016
41-50 C p. 39-47
9 p.
artikel
553 Complexity of correspondence H -colourings Feder, Tomás

41-50 C p. 235-245
artikel
554 Complexity of Grundy coloring and its variants Bonnet, Édouard
2018
41-50 C p. 99-114
artikel
555 Complexity of independency and cliquy trees Casel, Katrin

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

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

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

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

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

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

41-50 C p. 367-379
artikel
590 Conditional edge-fault-tolerant Hamiltonicity of the data center network Qin, Xiao-Wen

41-50 C p. 165-179
artikel
591 Conditional fractional matching preclusion of n -dimensional torus networks Hu, Xiaomin

41-50 C p. 157-165
artikel
592 Conditional matching preclusion for regular bipartite graphs and their Cartesian product Lin, Ruizhi

41-50 C p. 17-25
artikel
593 Conflict-free connection number of random graphs Gu, Ran

41-50 C p. 522-532
artikel
594 Conic relaxation approaches for equal deployment problems Safarina, Sena

41-50 C p. 111-125
artikel
595 1-2-3 Conjecture in digraphs: More results and directions Bensmail, Julien

41-50 C p. 124-137
artikel
596 Connected domination in maximal outerplanar graphs Zhuang, Wei

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

41-50 C p. 37-42
artikel
598 2-Connected graphs with minimum general sum-connectivity index Tomescu, Ioan
2014
41-50 C p. 135-141
7 p.
artikel
599 Connected greedy coloring of H -free graphs Mota, Esdras

41-50 C p. 572-584
artikel
600 Connected positive influence dominating set in k-regular graph Yao, Xiaopeng

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

41-50 C p. 98-107
artikel
604 Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs Chen, Shuya

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

41-50 C p. 61-68
artikel
608 Constant work-space algorithms for facility location problems Bhattacharya, Binay K.

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

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

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

41-50 C p. 384-390
artikel
622 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
623 Contents 2014
41-50 C p. v-
1 p.
artikel
624 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
625 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
626 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
627 Contents 2014
41-50 C p. v-
1 p.
artikel
628 Contents 2014
41-50 C p. v-
1 p.
artikel
629 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
630 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
631 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
632 Contents 2015
41-50 C p. v-
1 p.
artikel
633 Contents 2015
41-50 C p. v-
1 p.
artikel
634 Contents 2015
41-50 C p. v-
1 p.
artikel
635 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
636 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
637 Contents 2015
41-50 C p. v-
1 p.
artikel
638 Contents 2015
41-50 C p. v-
1 p.
artikel
639 Contents 2015
41-50 C p. v-
1 p.
artikel
640 Contents 2015
41-50 C p. v-
1 p.
artikel
641 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
642 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
643 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
644 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
645 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
646 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
647 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
648 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
649 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
650 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
651 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
652 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
653 Contents 2017
41-50 C p. v-
1 p.
artikel
654 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
655 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
656 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
657 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
658 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
659 Contents 2017
41-50 C p. v-
1 p.
artikel
660 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
661 Contents 2017
41-50 C p. v-
1 p.
artikel
662 Contents 2017
41-50 C p. v-
1 p.
artikel
663 Contents 2016
41-50 C p. v-
1 p.
artikel
664 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
665 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
666 Contents 2016
41-50 C p. v-
1 p.
artikel
667 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
668 Contents 2017
41-50 C p. v-
1 p.
artikel
669 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
670 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
671 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
672 Contents 2014
41-50 C p. v-
1 p.
artikel
673 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
674 Contents 2014
41-50 C p. v-vi
nvt p.
artikel
675 Contents 2014
41-50 C p. v-
1 p.
artikel
676 Contents 2014
41-50 C p. v-vii
nvt p.
artikel
677 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
678 Contents 2016
41-50 C p. v-vi
nvt p.
artikel
679 Contents 2015
41-50 C p. v-vi
nvt p.
artikel
680 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
681 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
682 Contents 2017
41-50 C p. v-
1 p.
artikel
683 Contents 2018
41-50 C p. v-vi
artikel
684 Contents 2017
41-50 C p. v-vi
artikel
685 Contents 2016
41-50 C p. v-vi
artikel
686 Contents 2017
41-50 C p. v-vi
nvt p.
artikel
687 Contents 2018
41-50 C p. v-vi
artikel
688 Contraction obstructions for connected graph searching Best, Micah J
2016
41-50 C p. 27-47
21 p.
artikel
689 Convex dominating sets in maximal outerplanar graphs Lemańska, Magdalena
2019
41-50 C p. 142-157
artikel
690 Convex generalized flows Holzhauser, Michael
2015
41-50 C p. 86-99
14 p.
artikel
691 Convex hulls of superincreasing knapsacks and lexicographic orderings Gupte, Akshay
2016
41-50 C p. 150-163
14 p.
artikel
692 Convex ( 0 , 1 ) -matrices and their epitopes Brualdi, Richard A.

41-50 C p. 21-34
artikel
693 Cooperative assignment games with the inverse Monge property Martínez-de-Albéniz, F. Javier
2014
41-50 C p. 42-50
9 p.
artikel
694 Cooperative games on simplicial complexes Martino, Ivan

41-50 C p. 246-256
artikel
695 Cooperative games with restricted formation of coalitions Koshevoy, Gleb
2017
41-50 C p. 1-13
13 p.
artikel
696 Cooperative twin-crane scheduling Briskorn, Dirk
2016
41-50 C p. 40-57
18 p.
artikel
697 Cops and an Insightful Robber Huggan, Melissa A.

41-50 C p. 112-119
artikel
698 Cops that surround a robber Burgess, Andrea C.

41-50 C p. 552-566
artikel
699 4-cop-win graphs have at least 19 vertices Turcotte, Jérémie

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

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

41-50 C p. 644-654
artikel
712 Counting Candy Crush configurations Hamilton, Adam

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

41-50 C p. 128-133
artikel
724 CPG graphs: Some structural and hardness results Champseix, Nicolas

41-50 C p. 17-35
artikel
725 Critical and maximum independent sets of a graph Jarden, Adi

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

41-50 C p. 48-68
artikel
731 Cube-free resonance graphs Che, Zhongyuan

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

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

41-50 C p. 353-374
artikel
748 Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph Huang, Ziwen
2019
41-50 C p. 112-118
artikel
749 Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs Aboomahigir, Elham

41-50 C p. 52-55
artikel
750 Decomposing clique search problems into smaller instances based on node and edge colorings Szabó, Sándor
2018
41-50 C p. 118-129
artikel
751 Decomposing highly connected graphs into paths of length five Botler, F.
2018
41-50 C p. 128-138
artikel
752 Decomposing split graphs into locally irregular graphs Lintzmayer, C.N.

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

41-50 C p. 37-43
artikel
760 Defensive alliances in graphs of bounded treewidth Bliem, Bernhard
2018
41-50 C p. 334-339
artikel
761 Degenerate matchings and edge colorings Baste, Julien
2018
41-50 C p. 38-44
artikel
762 Degree conditions for graphs to be maximally k -restricted edge connected and super k -restricted edge connected Wang, Shiying
2015
41-50 C p. 258-263
6 p.
artikel
763 Degree diameter problem on honeycomb networks Holub, Přemysl
2014
41-50 C p. 139-151
13 p.
artikel
764 Degree sequence realizations with given packing and covering of spanning trees Liu, Fengxia
2015
41-50 C p. 113-118
6 p.
artikel
765 Degree sum and graph linkage with prescribed path lengths Coll, Vincent E.
2019
41-50 C p. 85-94
artikel
766 Delta–wye reduction of almost-planar graphs Wagner, Donald K.
2015
41-50 C p. 158-167
10 p.
artikel
767 Dembowski–Ostrom polynomials and reversed Dickson polynomials Fernando, Neranga

41-50 C p. 66-79
artikel
768 Dense bipartite circulants and their routing via rectangular twisted torus Jha, Pranava K.
2014
41-50 C p. 141-158
18 p.
artikel
769 Dense group networks Campbell, Lowell
1992
41-50 C p. 65-71
7 p.
artikel
770 Dense on-line arbitrarily partitionable graphs Kalinowski, Rafał
2017
41-50 C p. 71-77
7 p.
artikel
771 Dense subgraphs in random graphs Balister, Paul
2019
41-50 C p. 66-74
artikel
772 Design and analysis of fault-tolerant multibus interconnection networks Camarda, Pietro
1992
41-50 C p. 45-64
20 p.
artikel
773 Destroying longest cycles in graphs and digraphs van Aardt, Susan A.
2015
41-50 C p. 251-259
9 p.
artikel
774 Determining equitable total chromatic number for infinite classes of complete r -partite graphs da Silva, A.G.

41-50 C p. 56-67
artikel
775 Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs Lozovanu, Dmitrii
2015
41-50 C p. 169-180
12 p.
artikel
776 Deterministic construction of compressed sensing matrices from constant dimension codes Wang, Gang

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

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

41-50 C p. 130-140
artikel
796 Direct-optimal basis computation by means of the fusion of simplification rules Rodríguez-Lorenzo, Estrella
2018
41-50 C p. 106-119
artikel
797 Discounted tree solutions Béal, Sylvain
2017
41-50 C p. 1-17
17 p.
artikel
798 Discrepancy inequalities for directed graphs Chung, Fan
2014
41-50 C p. 30-42
13 p.
artikel
799 Discrepancy minimizing spectral clustering Bolla, Marianna
2018
41-50 C p. 286-289
artikel
800 Discrete segments of Z 3 constructed by synchronization of words Provençal, Xavier
2015
41-50 C p. 102-117
16 p.
artikel
801 Discrete Tomography determination of bounded sets in Z n Brunetti, S.
2015
41-50 C p. 20-30
11 p.
artikel
802 Discretization vertex orders in distance geometry Cassioli, Andrea
2015
41-50 C p. 27-41
15 p.
artikel
803 Disjoint Hamilton cycles in transposition graphs Hussak, Walter
2016
41-50 C p. 56-64
9 p.
artikel
804 Dispersing points on intervals Li, Shimin
2018
41-50 C p. 106-118
artikel
805 Disproofs of two conjectures on no hole anti- n -labeling of graphs Wang, Fangxia

41-50 C p. 72-76
artikel
806 Disruption recovery at airports: Integer programming formulations and polynomial time algorithms Manyem, Prabhu
2018
41-50 C p. 102-117
artikel
807 Distance and distance signless Laplacian spread of connected graphs You, Lihua
2017
41-50 C p. 140-147
8 p.
artikel
808 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
41-50 C p. 105-117
artikel
809 ℓ -distance-balanced graphs Miklavič, Štefko
2018
41-50 C p. 143-154
artikel
810 Distance domination, guarding and covering of maximal outerplanar graphs Canales, Santiago
2015
41-50 C p. 41-49
9 p.
artikel
811 Distance k -domination, distance k -guarding, and distance k -vertex cover of maximal outerplanar graphs Alvarado, José D.
2015
41-50 C p. 154-159
6 p.
artikel
812 Distance magic graphs G × C n Cichacz, Sylwia
2014
41-50 C p. 80-87
8 p.
artikel
813 Distance measures for Interval Type-2 fuzzy numbers Figueroa-García, Juan Carlos
2015
41-50 C p. 93-102
10 p.
artikel
814 Distance restricted optimal pebbling in cycles Shiue, Chin-Lin

41-50 C p. 125-133
artikel
815 Distance restricted optimal pebbling in paths Shiue, Chin-Lin

41-50 C p. 46-54
artikel
816 Distances between sets based on set commonality Horadam, K.J.
2014
41-50 C p. 310-314
5 p.
artikel
817 Distances in graphs of girth 6 and generalised cages Alochukwu, Alex

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

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

41-50 C p. 83-92
artikel
827 Dominating maximal outerplane graphs and Hamiltonian plane triangulations Plummer, Michael D.

41-50 C p. 162-167
artikel
828 Dominating plane triangulations Plummer, Michael D.
2016
41-50 C p. 175-182
8 p.
artikel
829 Dominating sets reconfiguration under token sliding Bonamy, Marthe

41-50 C p. 6-18
artikel
830 Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups Çalışkan, Cafer
2019
41-50 C p. 15-24
artikel
831 Domination and location in twin-free digraphs Foucaud, Florent

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

41-50 C p. 23-42
artikel
834 Domination, coloring and stability in P 5 -reducible graphs Fouquet, Jean-Luc
2015
41-50 C p. 122-129
8 p.
artikel
835 Domination cover rubbling Beeler, Robert A.
2019
41-50 C p. 75-85
artikel
836 Domination game on uniform hypergraphs Bujtás, Csilla
2019
41-50 C p. 65-75
artikel
837 Domination in direct products of complete graphs Vemuri, Harish

41-50 C p. 473-482
artikel
838 [ 1 , 2 ] -domination in graphs Yang, Xiaojing
2014
41-50 C p. 79-86
8 p.
artikel
839 Domination in intersecting hypergraphs Dong, Yanxia
2018
41-50 C p. 155-159
artikel
840 Domination in some subclasses of bipartite graphs Pandey, Arti
2019
41-50 C p. 51-66
artikel
841 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
41-50 C p. 147-153
7 p.
artikel
842 Domination parameters in hypertrees and sibling trees Rajasingh, Indra

41-50 C p. 237-245
artikel
843 Domination parameters with number 2 : Interrelations and algorithmic consequences Bonomo, Flavia
2018
41-50 C p. 23-50
artikel
844 Domination problems with no conflicts Cornet, Alexis
2018
41-50 C p. 78-88
artikel
845 Domination ratio of integer distance digraphs Huang, Jia
2019
41-50 C p. 104-115
artikel
846 Domination related parameters in the generalized lexicographic product of graphs Samodivkin, Vladimir

41-50 C p. 77-84
artikel
847 Domination versus disjunctive domination in trees Henning, Michael A.
2015
41-50 C p. 171-177
7 p.
artikel
848 Domination versus edge domination Baste, Julien

41-50 C p. 343-349
artikel
849 Dot product dimensions of graphs Li, Bo-Jr
2014
41-50 C p. 159-163
5 p.
artikel
850 Double domination in lexicographic product graphs Cabrera Martínez, Abel

41-50 C p. 290-300
artikel
851 Double Roman domination Beeler, Robert A.
2016
41-50 C p. 23-29
7 p.
artikel
852 Double Roman domination number V., Anu
2018
41-50 C p. 198-204
artikel
853 DP-4-colorability of planar graphs without adjacent cycles of given length Liu, Runrun

41-50 C p. 245-251
artikel
854 DP-3-coloring of planar graphs without certain cycles Rao, Mengjiao

41-50 C p. 35-45
artikel
855 3D well-composed polyhedral complexes Gonzalez-Diaz, Rocio
2015
41-50 C p. 59-77
19 p.
artikel
856 3-dynamic coloring and list 3-dynamic coloring of K 1 , 3 -free graphs Li, Hao
2017
41-50 C p. 166-171
6 p.
artikel
857 Dynamic coloring of graphs having no K 5 minor Kim, Younjin
2016
41-50 C p. 81-89
9 p.
artikel
858 Dynamic coloring parameters for graphs with given genus Loeb, Sarah
2018
41-50 C p. 129-141
artikel
859 Dynamic determination of variable sizes of chunks in a deduplication system Hirsch, Michael

41-50 C p. 81-91
artikel
860 Dynamic index and LZ factorization in compressed space Nishimoto, Takaaki

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

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

41-50 C p. 80-85
artikel
871 Edge coloring of signed graphs Zhang, Li

41-50 C p. 234-242
artikel
872 Edge-colouring graphs with bounded local degree sums Zatesko, L.M.

41-50 C p. 268-283
artikel
873 Edge consecutive gracefulness of a graph Pereira, Jessica

41-50 C p. 214-220
artikel
874 Edge construction of molecular NSSDs Farrugia, Alexander
2019
41-50 C p. 130-140
artikel
875 Edge decomposition of connected claw-free cubic graphs Hong, Yanmei

41-50 C p. 246-250
artikel
876 Edge disjoint caterpillar realizations Miklós, István

41-50 C p. 327-344
artikel
877 Edge-disjoint paths in faulty augmented cubes Ma, Meijie

41-50 C p. 108-114
artikel
878 Edge-disjoint spanning trees and forests of graphs Zhou, Jiang

41-50 C p. 74-81
artikel
879 Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs Guo, Jia

41-50 C p. 109-119
artikel
880 Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks Li, Pingshan
2019
41-50 C p. 145-152
artikel
881 Edge-grafting transformations on the average eccentricity of graphs and their applications He, Chunling
2018
41-50 C p. 95-105
artikel
882 Edge-intersection graphs of boundary-generated paths in a grid Golumbic, Martin Charles
2018
41-50 C p. 214-222
artikel
883 Edge-intersection graphs of grid paths: The bend-number Heldt, Daniel
2014
41-50 C p. 144-162
19 p.
artikel
884 Edge intersection graphs of L -shaped paths in grids Cameron, Kathie
2016
41-50 C p. 185-194
artikel
885 Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues Belardo, Francesco
2019
41-50 C p. 130-138
artikel
886 Edge separators for quasi-binary trees Ramírez Alfonsín, Jorge Luis
2016
41-50 C p. 284-289
artikel
887 Edge-stable equimatchable graphs Deniz, Zakir
2019
41-50 C p. 136-147
artikel
888 Edge weights and vertex colours: Minimizing sum count Baudon, Olivier
2019
41-50 C p. 13-24
artikel
889 Editorial 1999
41-50 C p. 245-
1 p.
artikel
890 Editorial 1999
41-50 C p. 1-2
2 p.
artikel
891 Editorial Board 1992
41-50 C p. iii-iv
nvt p.
artikel
892 Editorial Board 2017
41-50 C p. v-
1 p.
artikel
893 Editorial Board 2018
41-50 C p. ii
artikel
894 Editorial Board 2018
41-50 C p. ii
artikel
895 Editorial Board 2018
41-50 C p. ii
artikel
896 Editorial Board 2019
41-50 C p. ii
artikel
897 Editorial Board 2018
41-50 C p. ii
artikel
898 Editorial Board 2019
41-50 C p. ii
artikel
899 Editorial Board 2019
41-50 C p. ii
artikel
900 Editorial Board 2019
41-50 C p. ii
artikel
901 Editorial Board 2019
41-50 C p. ii
artikel
902 Editorial Board 2019
41-50 C p. ii
artikel
903 Editorial Board 2019
41-50 C p. ii
artikel
904 Editorial Board 2019
41-50 C p. ii
artikel
905 Editorial Board 2019
41-50 C p. ii
artikel
906 Editorial Board 2019
41-50 C p. ii
artikel
907 Editorial Board 2019
41-50 C p. ii
artikel
908 Editorial Board 2019
41-50 C p. ii
artikel
909 Editorial Board 2019
41-50 C p. ii
artikel
910 Editorial Board 2019
41-50 C p. ii
artikel
911 Editorial Board 2019
41-50 C p. ii
artikel
912 Editorial Board 2019
41-50 C p. ii
artikel
913 Editorial Board
41-50 C p. ii
artikel
914 Editorial Board 2019
41-50 C p. ii
artikel
915 Editorial Board
41-50 C p. ii
artikel
916 Editorial Board 2019
41-50 C p. ii
artikel
917 Editorial Board 2019
41-50 C p. ii
artikel
918 Editorial Board 2019
41-50 C p. ii
artikel
919 Editorial Board 2018
41-50 C p. ii
artikel
920 Editorial Board 2017
41-50 C p. v-vi
nvt p.
artikel
921 Editorial Board 2018
41-50 C p. ii
artikel
922 Editorial Board 2018
41-50 C p. ii
artikel
923 Editorial Board 2018
41-50 C p. ii
artikel
924 Editorial Board 2017
41-50 C p. v-vi
artikel
925 Editorial Board 2018
41-50 C p. ii
artikel
926 Editorial Board 2018
41-50 C p. ii
artikel
927 Editorial Board 2018
41-50 C p. ii
artikel
928 Editorial Board 2018
41-50 C p. ii
artikel
929 Editorial Board 2018
41-50 C p. ii
artikel
930 Editorial Board 2018
41-50 C p. ii
artikel
931 Editorial Board 2018
41-50 C p. ii
artikel
932 Editorial Board
41-50 C p. ii
artikel
933 Editorial Board
41-50 C p. ii
artikel
934 Editorial Board
41-50 C p. ii
artikel
935 Editorial Board
41-50 C p. ii
artikel
936 Editorial Board
41-50 C p. ii
artikel
937 Editorial Board
41-50 C p. ii
artikel
938 Editorial Board
41-50 C p. ii
artikel
939 Editorial Board
41-50 C p. ii
artikel
940 Editorial Board
41-50 C p. ii
artikel
941 Editorial Board
41-50 C p. ii
artikel
942 Editorial Board
41-50 C p. ii
artikel
943 Editorial Board
41-50 C p. ii
artikel
944 Editorial Board
41-50 C p. ii
artikel
945 Editorial Board
41-50 C p. ii
artikel
946 Editorial Board
41-50 C p. ii
artikel
947 Editorial Board
41-50 C p. ii
artikel
948 Editorial Board
41-50 C p. ii
artikel
949 Editorial Board
41-50 C p. ii
artikel
950 Editorial Board
41-50 C p. ii
artikel
951 Editorial Board
41-50 C p. ii
artikel
952 Editorial Board
41-50 C p. ii
artikel
953 Editorial Board
41-50 C p. ii
artikel
954 Editorial Board
41-50 C p. ii
artikel
955 Editorial Board
41-50 C p. ii
artikel
956 Editorial Board
41-50 C p. ii
artikel
957 Editorial Board
41-50 C p. ii
artikel
958 Editorial Board
41-50 C p. ii
artikel
959 Editorial Board
41-50 C p. ii
artikel
960 Editorial: Stringology Algorithms Holub, Jan
2016
41-50 C p. 1-
1 p.
artikel
961 Effect of predomination and vertex removal on the game total domination number of a graph Iršič, Vesna
2019
41-50 C p. 216-225
artikel
962 Effects of vertex degrees on the zero-forcing number and propagation time of a graph Fast, Caleb C.
2018
41-50 C p. 215-226
artikel
963 Efficient algorithms for dualizing large-scale hypergraphs Murakami, Keisuke
2014
41-50 C p. 83-94
12 p.
artikel
964 Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions Ando, Kazutoshi
2017
41-50 C p. 1-10
10 p.
artikel
965 Efficient construction of broadcast graphs Averbuch, A.
2014
41-50 C p. 9-14
6 p.
artikel
966 Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization Kudin, S.

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

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

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

41-50 C p. 128-139
artikel
984 Embedding of hypercubes into sibling trees Arockiaraj, Micheal
2014
41-50 C p. 9-14
6 p.
artikel
985 Embedding planar 5-graphs in three pages Guan, Xiaxia

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

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

41-50 C p. 423-433
artikel
999 Enumeration and maximum number of maximal irredundant sets for chordal graphs Golovach, Petr A.
2019
41-50 C p. 69-85
artikel
1000 Enumeration of inversion sequences avoiding triples of relations Cao, Wenqin
2019
41-50 C p. 86-97
artikel
                             2968 gevonden resultaten
 
   volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland