| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A
7
/
3
-approximation algorithm for feedback vertex set in tournaments via Sherali–Adams
|
Aprile, Manuel
|
|
|
96-97 |
C |
p. 149-160
|
artikel
|
| 2 |
A
9
7
-approximation algorithm for Graphic TSP in cubic bipartite graphs
|
Karp, Jeremy A.
|
|
2016
|
96-97 |
C |
p. 164-216
53 p.
|
artikel
|
| 3 |
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph
|
Călinescu, Gruia
|
|
|
96-97 |
C |
p. 241-261
|
artikel
|
| 4 |
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
|
Mohan, Usha
|
|
2019
|
96-97 |
C |
p. 108-118
|
artikel
|
| 5 |
A 2/3-approximation algorithm for vertex-weighted matching
|
Al-Herz, Ahmed
|
|
|
96-97 |
C |
p. 46-67
|
artikel
|
| 6 |
A
5
4
-approximation for subcubic 2EC using circulations and obliged edges
|
Boyd, Sylvia
|
|
2016
|
96-97 |
C |
p. 48-58
11 p.
|
artikel
|
| 7 |
A
3
4
-approximation of Vizing’s conjecture for claw-free graphs
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 416-422
|
artikel
|
| 8 |
A
(
B
+
1
)
-approximation for network flow interdiction with unit costs
|
Boeckmann, Jan
|
|
|
96-97 |
C |
p. 58-71
|
artikel
|
| 9 |
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G
2
-connected medians
|
Bénéteau, Laurine
|
|
|
96-97 |
C |
p. 55-74
|
artikel
|
| 10 |
Abelian borders in binary words
|
Christodoulakis, Manolis
|
|
2014
|
96-97 |
C |
p. 141-146
6 p.
|
artikel
|
| 11 |
A biased edge coloring game
|
Wang, Runze
|
|
|
96-97 |
C |
p. 193-200
|
artikel
|
| 12 |
A bijection between bargraphs and Dyck paths
|
Deutsch, Emeric
|
|
2018
|
96-97 |
C |
p. 340-344
|
artikel
|
| 13 |
A Boolean theory of signatures for tonal scales
|
Simeone, B.
|
|
2014
|
96-97 |
C |
p. 283-294
12 p.
|
artikel
|
| 14 |
A bounded-risk mechanism for the kidney exchange game
|
Esfandiari, Hossein
|
|
2018
|
96-97 |
C |
p. 46-53
|
artikel
|
| 15 |
A bound for judicious
k
-partitions of graphs
|
Fan, Genghua
|
|
2014
|
96-97 |
C |
p. 86-99
14 p.
|
artikel
|
| 16 |
About some robustness and complexity properties of
G
-graphs networks
|
Culus, Jean-François
|
|
2015
|
96-97 |
C |
p. 34-45
12 p.
|
artikel
|
| 17 |
About
S
-packing coloring of 3-irregular subcubic graphs
|
Mortada, Maidoun
|
|
|
96-97 |
C |
p. 16-18
|
artikel
|
| 18 |
About the minimum mean cycle-canceling algorithm
|
Gauthier, Jean Bertrand
|
|
2015
|
96-97 |
C |
p. 115-134
20 p.
|
artikel
|
| 19 |
About the number of directed paths in tournaments
|
El Sahili, Amine
|
|
|
96-97 |
C |
p. 115-126
|
artikel
|
| 20 |
A branch-and-bound approach to the no-idle flowshop scheduling problem
|
Jarboui, Bassem
|
|
|
96-97 |
C |
p. 297-310
|
artikel
|
| 21 |
A branch-and-cut algorithm for the maximum
k
-balanced subgraph of a signed graph
|
Figueiredo, Rosa
|
|
2019
|
96-97 |
C |
p. 164-185
|
artikel
|
| 22 |
A branch-and-cut algorithm for the routing and spectrum allocation problem
|
Bianchetti, Marcelo
|
|
|
96-97 |
C |
p. 107-126
|
artikel
|
| 23 |
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
|
Heßler, Katrin
|
|
|
96-97 |
C |
p. 218-234
|
artikel
|
| 24 |
A branch-and-price algorithm for the Minimum Sum Coloring Problem
|
Delle Donne, Diego
|
|
|
96-97 |
C |
p. 39-56
|
artikel
|
| 25 |
A branch-and-price algorithm for the robust graph coloring problem
|
Archetti, Claudia
|
|
2014
|
96-97 |
C |
p. 49-59
11 p.
|
artikel
|
| 26 |
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
|
Bianchessi, Nicola
|
|
|
96-97 |
C |
p. 152-170
|
artikel
|
| 27 |
(
a
,
b
)
-rectangle patterns in permutations and words
|
Kitaev, Sergey
|
|
2015
|
96-97 |
C |
p. 128-146
19 p.
|
artikel
|
| 28 |
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
|
Lu, Changhong
|
|
|
96-97 |
C |
p. 147-159
|
artikel
|
| 29 |
A brief history of parameterized matching problems
|
Mendivelso, Juan
|
|
|
96-97 |
C |
p. 103-115
|
artikel
|
| 30 |
Absolute algebraic connectivity of double brooms and trees
|
Richter, Sebastian
|
|
2016
|
96-97 |
C |
p. 213-221
9 p.
|
artikel
|
| 31 |
Accelerated partial decoding in wavelet trees
|
Baruch, Gilad
|
|
|
96-97 |
C |
p. 2-10
|
artikel
|
| 32 |
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
|
Gauci, John Baptist
|
|
|
96-97 |
C |
p. 126-137
|
artikel
|
| 33 |
Accuracy of techniques for the logical analysis of data
|
Anthony, Martin
|
|
1999
|
96-97 |
C |
p. 247-257
11 p.
|
artikel
|
| 34 |
A characterisation of clique-width through nested partitions
|
Courcelle, Bruno
|
|
2015
|
96-97 |
C |
p. 70-81
12 p.
|
artikel
|
| 35 |
A characterization of balanced Boolean functions with optimal algebraic immunity
|
Xie, Tao
|
|
|
96-97 |
C |
p. 186-196
|
artikel
|
| 36 |
A characterization of dissimilarity families of trees
|
Baldisserri, Agnese
|
|
2017
|
96-97 |
C |
p. 35-45
11 p.
|
artikel
|
| 37 |
A characterization of double Roman trees
|
Henning, Michael A.
|
|
2019
|
96-97 |
C |
p. 100-111
|
artikel
|
| 38 |
A characterization of edge b-critical graphs
|
Bendali-Braham, Amel
|
|
2018
|
96-97 |
C |
p. 158-160
|
artikel
|
| 39 |
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
|
Haynes, Teresa W.
|
|
|
96-97 |
C |
p. 457-467
|
artikel
|
| 40 |
A characterization of graphs with given total coalition numbers
|
Henning, Michael A.
|
|
|
96-97 |
C |
p. 395-403
|
artikel
|
| 41 |
A characterization of graphs with maximum cycle isolation number
|
Chen, Siyue
|
|
|
96-97 |
C |
p. 161-175
|
artikel
|
| 42 |
A characterization of graphs with regular distance-2 graphs
|
Gaar, Elisabeth
|
|
|
96-97 |
C |
p. 181-218
|
artikel
|
| 43 |
A characterization of interval orders with semiorder dimension two
|
Apke, Alexander
|
|
|
96-97 |
C |
p. 142-150
|
artikel
|
| 44 |
A characterization of line graphs that are squares of graphs
|
Milanič, Martin
|
|
2014
|
96-97 |
C |
p. 83-91
9 p.
|
artikel
|
| 45 |
A characterization of nested canalyzing functions with maximum average sensitivity
|
Stearns, Richard E.
|
|
2018
|
96-97 |
C |
p. 5-14
|
artikel
|
| 46 |
A characterization of perfect Roman trees
|
Sheikholeslami, S.M.
|
|
|
96-97 |
C |
p. 501-508
|
artikel
|
| 47 |
A characterization of
P
5
-free, diameter-2-critical graphs
|
Haynes, Teresa W.
|
|
2014
|
96-97 |
C |
p. 135-139
5 p.
|
artikel
|
| 48 |
A characterization of
P
5
-free graphs with a homeomorphically irreducible spanning tree
|
Diemunsch, Jennifer
|
|
2015
|
96-97 |
C |
p. 71-78
8 p.
|
artikel
|
| 49 |
A characterization of positive spanning sets with ties to strongly edge-connected digraphs
|
Cornaz, Denis
|
|
|
96-97 |
C |
p. 105-119
|
artikel
|
| 50 |
A characterization of some families of Cohen–Macaulay, Gorenstein and/or Buchsbaum rings
|
García-García, J.I.
|
|
2019
|
96-97 |
C |
p. 166-176
|
artikel
|
| 51 |
A characterization of substar graphs
|
Joos, Felix
|
|
2014
|
96-97 |
C |
p. 115-118
4 p.
|
artikel
|
| 52 |
A characterization of 4-
χ
S
-vertex-critical graphs for packing sequences with
s
1
=
1
and
s
2
≥
3
|
Klavžar, Sandi
|
|
|
96-97 |
C |
p. 46-55
|
artikel
|
| 53 |
A characterization of the non-trivial diameter two graphs of minimum size
|
Henning, Michael A.
|
|
2015
|
96-97 |
C |
p. 91-95
5 p.
|
artikel
|
| 54 |
A characterization of the resonance graph of an outerplane bipartite graph
|
Che, Zhongyuan
|
|
2019
|
96-97 |
C |
p. 264-268
|
artikel
|
| 55 |
A characterization of trees based on edge-deletion and its applications for domination-type invariants
|
Furuya, Michitaka
|
|
|
96-97 |
C |
p. 50-61
|
artikel
|
| 56 |
A characterization of unit interval bigraphs of open and closed intervals
|
Das, Ashok Kumar
|
|
|
96-97 |
C |
p. 231-243
|
artikel
|
| 57 |
A characterization of well-indumatchable graphs having girth greater than seven
|
Finbow, Arthur S.
|
|
|
96-97 |
C |
p. 261-271
|
artikel
|
| 58 |
Achromatic number and facial achromatic number of connected locally-connected graphs
|
Matsumoto, Naoki
|
|
|
96-97 |
C |
p. 34-41
|
artikel
|
| 59 |
A classification of edge-colored graphs based on properly colored walks
|
Li, Ruonan
|
|
|
96-97 |
C |
p. 590-595
|
artikel
|
| 60 |
A class of asymptotically optimal group screening strategies with limited item participation
|
Cheng, Yongxi
|
|
2019
|
96-97 |
C |
p. 83-95
|
artikel
|
| 61 |
A class of asymptotically optimal group testing strategies to identify good items
|
Cheng, Yongxi
|
|
2019
|
96-97 |
C |
p. 109-116
|
artikel
|
| 62 |
A class of functions with low-valued Walsh spectrum
|
Li, Fengwei
|
|
|
96-97 |
C |
p. 92-105
|
artikel
|
| 63 |
A class of graphs that complementation makes infinitely many Cohen–Macaulay members
|
Ashitha, T.
|
|
|
96-97 |
C |
p. 189-198
|
artikel
|
| 64 |
A class of spectral bounds for Max
k
-Cut
|
Anjos, Miguel F.
|
|
|
96-97 |
C |
p. 12-24
|
artikel
|
| 65 |
A class of three-weight and five-weight linear codes
|
Li, Fei
|
|
2018
|
96-97 |
C |
p. 25-38
|
artikel
|
| 66 |
A coloring algorithm for
4
K
1
-free line graphs
|
Fraser, Dallas J.
|
|
2018
|
96-97 |
C |
p. 76-85
|
artikel
|
| 67 |
A combinatorial formula for the Schur coefficients of chromatic symmetric functions
|
Wang, David G.L.
|
|
|
96-97 |
C |
p. 621-630
|
artikel
|
| 68 |
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
|
Mendes, Wilder P.
|
|
|
96-97 |
C |
p. 71-81
|
artikel
|
| 69 |
A compact quadratic model and linearizations for the minimum linear arrangement problem
|
de Andrade, Rafael Castro
|
|
|
96-97 |
C |
p. 134-148
|
artikel
|
| 70 |
A comparison of integer programming models for the partial directed weighted improper coloring problem
|
Hertz, Alain
|
|
2019
|
96-97 |
C |
p. 229-245
|
artikel
|
| 71 |
A complete analysis of the convergence of
C
m
(
D
)
m
=
1
∞
for a multipartite tournament
D
|
Jung, Ji-Hwan
|
|
|
96-97 |
C |
p. 344-357
|
artikel
|
| 72 |
A complete characterization of jump inequalities for the hop-constrained shortest path problem
|
Riedl, Wolfgang F.
|
|
2017
|
96-97 |
C |
p. 95-113
19 p.
|
artikel
|
| 73 |
A complexity theory for hard enumeration problems
|
Creignou, Nadia
|
|
2019
|
96-97 |
C |
p. 191-209
|
artikel
|
| 74 |
A computational comparison of compact MILP formulations for the zero forcing number
|
Agra, Agostinho
|
|
2019
|
96-97 |
C |
p. 169-183
|
artikel
|
| 75 |
A computational study of
f
-reversible processes on graphs
|
Lima, Carlos V.G.C.
|
|
2018
|
96-97 |
C |
p. 77-93
|
artikel
|
| 76 |
A computational study on Integer Programming formulations for Hop-constrained survivable network design
|
Gudapati, Naga V.C.
|
|
|
96-97 |
C |
p. 71-81
|
artikel
|
| 77 |
A computational substantiation of the
d
-step approach to the number of distinct squares problem
|
Deza, Antoine
|
|
2016
|
96-97 |
C |
p. 81-87
7 p.
|
artikel
|
| 78 |
A concise characterization of strong knapsack facets
|
Chopra, Sunil
|
|
2019
|
96-97 |
C |
p. 136-152
|
artikel
|
| 79 |
A conjecture on the lower bound of the signed edge domination number of 2-connected graphs
|
Feng, Xing
|
|
|
96-97 |
C |
p. 42-45
|
artikel
|
| 80 |
A connected version of the graph coloring game
|
Charpentier, Clément
|
|
|
96-97 |
C |
p. 744-750
|
artikel
|
| 81 |
A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees
|
Xiao, Chuanqi
|
|
2017
|
96-97 |
C |
p. 230-234
|
artikel
|
| 82 |
A constant factor approximation algorithm for boxicity of circular arc graphs
|
Adiga, Abhijin
|
|
2014
|
96-97 |
C |
p. 1-18
18 p.
|
artikel
|
| 83 |
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case
|
Kuroki, Yuko
|
|
|
96-97 |
C |
p. 201-214
|
artikel
|
| 84 |
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
|
Bouznif, M.
|
|
2016
|
96-97 |
C |
p. 27-40
14 p.
|
artikel
|
| 85 |
A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
|
Abreu, Marién
|
|
|
96-97 |
C |
p. 134-138
|
artikel
|
| 86 |
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
|
Hu, Xuewei
|
|
|
96-97 |
C |
p. 407-422
|
artikel
|
| 87 |
A construction of uniquely colourable graphs with equal colour class sizes
|
Mohr, Samuel
|
|
|
96-97 |
C |
p. 122-126
|
artikel
|
| 88 |
A convexity upper bound for the number of maximal bicliques of a bipartite graph
|
Albano, Alexandre
|
|
2014
|
96-97 |
C |
p. 12-24
13 p.
|
artikel
|
| 89 |
A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences
|
Lerner, Eduard
|
|
|
96-97 |
C |
p. 1-12
|
artikel
|
| 90 |
A counterexample to a conjecture on facial unique-maximal colorings
|
Lidický, Bernard
|
|
2018
|
96-97 |
C |
p. 123-125
|
artikel
|
| 91 |
A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs
|
Bowler, N.
|
|
2017
|
96-97 |
C |
p. 151-153
3 p.
|
artikel
|
| 92 |
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
|
Hambardzumyan, Lianna
|
|
|
96-97 |
C |
p. 117-122
|
artikel
|
| 93 |
A counterexample to the pseudo 2-factor isomorphic graph conjecture
|
Goedgebeur, Jan
|
|
2015
|
96-97 |
C |
p. 57-60
4 p.
|
artikel
|
| 94 |
Acyclic coloring of claw-free graphs with small degree
|
Wang, Juan
|
|
|
96-97 |
C |
p. 272-280
|
artikel
|
| 95 |
Acyclic coloring of products of digraphs
|
Costa, Isnard Lopes
|
|
|
96-97 |
C |
p. 59-69
|
artikel
|
| 96 |
Acyclic edge coloring of graphs
|
Wang, Tao
|
|
2014
|
96-97 |
C |
p. 290-303
14 p.
|
artikel
|
| 97 |
Acyclic 4-edge colouring of non-regular subcubic graphs in linear time
|
Lukot’ka, Robert
|
|
2014
|
96-97 |
C |
p. 110-112
3 p.
|
artikel
|
| 98 |
Adaptive group testing with a constrained number of positive responses improved
|
Damaschke, Peter
|
|
2016
|
96-97 |
C |
p. 208-212
5 p.
|
artikel
|
| 99 |
Adaptive majority problems for restricted query graphs and for weighted sets
|
Damásdi, Gábor
|
|
|
96-97 |
C |
p. 235-245
|
artikel
|
| 100 |
A Dawson-like clustering of human mitochondrial DNA sequences based on protein coding region
|
Soares, Inês
|
|
2019
|
96-97 |
C |
p. 139-145
|
artikel
|
| 101 |
Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56]
|
Aguilera, Néstor E.
|
|
2018
|
96-97 |
C |
p. 311-315
|
artikel
|
| 102 |
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
|
Li, Hengzhe
|
|
|
96-97 |
C |
p. 274-281
|
artikel
|
| 103 |
Adding isolated vertices makes some greedy online algorithms optimal
|
Boyar, Joan
|
|
2018
|
96-97 |
C |
p. 12-21
|
artikel
|
| 104 |
Addressing graph products and distance-regular graphs
|
Cioabă, Sebastian M.
|
|
2017
|
96-97 |
C |
p. 46-54
9 p.
|
artikel
|
| 105 |
A de Bruijn–Erdös Theorem for
(
q
,
q
−
4
)
-graphs
|
Schrader, Rainer
|
|
|
96-97 |
C |
p. 198-201
|
artikel
|
| 106 |
A decision algorithm for reversible pairs of polygons
|
Akiyama, Jin
|
|
2014
|
96-97 |
C |
p. 19-26
8 p.
|
artikel
|
| 107 |
A decomposition of the space of TU-games using addition and transfer invariance
|
Béal, Sylvain
|
|
2015
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 108 |
A depth-first search algorithm for computing pseudo-closed sets
|
Bazin, Alexandre
|
|
2018
|
96-97 |
C |
p. 28-35
|
artikel
|
| 109 |
A deterministic version of the game of zombies and survivors on graphs
|
Fitzpatrick, S.L.
|
|
2016
|
96-97 |
C |
p. 1-12
12 p.
|
artikel
|
| 110 |
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
|
Malyshev, D.S.
|
|
2016
|
96-97 |
C |
p. 117-126
10 p.
|
artikel
|
| 111 |
Adjacency polynomials of digraph transformations
|
Deng, Aiping
|
|
2016
|
96-97 |
C |
p. 15-38
24 p.
|
artikel
|
| 112 |
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
|
Sun, Lin
|
|
|
96-97 |
C |
p. 257-271
|
artikel
|
| 113 |
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
|
Tian, Shuangliang
|
|
2015
|
96-97 |
C |
p. 220-226
7 p.
|
artikel
|
| 114 |
Adjoining to (K,s,t)-Wythoff’s game its P-generators as moves
|
Li, Haiyan
|
|
|
96-97 |
C |
p. 476-487
|
artikel
|
| 115 |
Adjoining to
(
s
,
t
)
-Wythoff’s game its
P
-positions as moves
|
Liu, Wen An
|
|
2014
|
96-97 |
C |
p. 28-43
16 p.
|
artikel
|
| 116 |
A doubly nonnegative relaxation for modularity density maximization
|
Izunaga, Yoichi
|
|
|
96-97 |
C |
p. 69-78
|
artikel
|
| 117 |
Advances in Combinatorial Optimization
|
Martello, Silvano
|
|
2015
|
96-97 |
C |
p. 1-3
3 p.
|
artikel
|
| 118 |
Adynamic coloring of graphs
|
Šurimová, Mária
|
|
|
96-97 |
C |
p. 224-233
|
artikel
|
| 119 |
A family of bipartite circulant tournaments with acyclic disconnection 3
|
Goldfeder, Ilan A.
|
|
|
96-97 |
C |
p. 324-330
|
artikel
|
| 120 |
A family of efficient six-regular circulants representable as a Kronecker product
|
Jha, Pranava K.
|
|
2016
|
96-97 |
C |
p. 72-84
13 p.
|
artikel
|
| 121 |
A family of mixed graphs with large order and diameter 2
|
Araujo-Pardo, G.
|
|
2017
|
96-97 |
C |
p. 57-63
7 p.
|
artikel
|
| 122 |
A fast discovery algorithm for large common connected induced subgraphs
|
Conte, Alessio
|
|
2019
|
96-97 |
C |
p. 210-222
|
artikel
|
| 123 |
A faster algorithm for Cops and Robbers
|
Petr, Jan
|
|
|
96-97 |
C |
p. 11-14
|
artikel
|
| 124 |
A faster algorithm for packing branchings in digraphs
|
Lee, Orlando
|
|
2015
|
96-97 |
C |
p. 121-131
11 p.
|
artikel
|
| 125 |
A faster FPTAS for counting two-rowed contingency tables
|
Alon, Tzvi
|
|
|
96-97 |
C |
p. 161-170
|
artikel
|
| 126 |
A faster FPTAS for knapsack problem with cardinality constraint
|
Li, Wenxin
|
|
|
96-97 |
C |
p. 71-85
|
artikel
|
| 127 |
A faster parameterized algorithm for Pseudoforest Deletion
|
Bodlaender, Hans L.
|
|
2018
|
96-97 |
C |
p. 42-56
|
artikel
|
| 128 |
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
|
Alix, Munier Kordon
|
|
|
96-97 |
C |
p. 1-6
|
artikel
|
| 129 |
A formal framework for Stringology
|
Soltys, Michael
|
|
|
96-97 |
C |
p. 141-151
|
artikel
|
| 130 |
A formulation of the wide partition conjecture using the atom problem in discrete tomography
|
Guíñez, Flavio
|
|
2014
|
96-97 |
C |
p. 121-130
10 p.
|
artikel
|
| 131 |
A functional completeness theorem for De Morgan functions
|
Movsisyan, Yu.M.
|
|
2014
|
96-97 |
C |
p. 1-16
16 p.
|
artikel
|
| 132 |
A general compiler for password-authenticated group key exchange protocol in the standard model
|
Wei, Fushan
|
|
2018
|
96-97 |
C |
p. 78-86
|
artikel
|
| 133 |
A generalization of an independent set with application to
(
K
q
;
k
)
-stable graphs
|
Żak, Andrzej
|
|
2014
|
96-97 |
C |
p. 421-427
7 p.
|
artikel
|
| 134 |
A generalization of Opsut’s result on the competition numbers of line graphs
|
Kim, Suh-Ryung
|
|
2015
|
96-97 |
C |
p. 152-159
8 p.
|
artikel
|
| 135 |
A generalization of the Haemers–Mathon bound for near hexagons
|
De Bruyn, Bart
|
|
2019
|
96-97 |
C |
p. 272-282
|
artikel
|
| 136 |
A generalization of the independence number
|
Katona, Gyula O.H.
|
|
|
96-97 |
C |
p. 1-3
|
artikel
|
| 137 |
A general method to find the spectrum and eigenspaces of the
k
-token graph of a cycle, and 2-token through continuous fractions
|
Reyes, M.A.
|
|
|
96-97 |
C |
p. 353-365
|
artikel
|
| 138 |
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
|
Ye, Mengdie
|
|
|
96-97 |
C |
p. 95-114
|
artikel
|
| 139 |
Agent incentives of strategic behavior in resource exchange
|
Chen, Zhou
|
|
2019
|
96-97 |
C |
p. 15-25
|
artikel
|
| 140 |
A geometric lower bound on the extension complexity of polytopes based on the
f
-vector
|
Dewez, Julien
|
|
|
96-97 |
C |
p. 22-38
|
artikel
|
| 141 |
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
|
Makuracki, Bartosz
|
|
2019
|
96-97 |
C |
p. 25-36
|
artikel
|
| 142 |
A graph with the partial order competition dimension greater than five
|
Choi, Jihoon
|
|
2019
|
96-97 |
C |
p. 262-266
|
artikel
|
| 143 |
A Hamilton sufficient condition for completely independent spanning tree
|
Hong, Xia
|
|
|
96-97 |
C |
p. 183-187
|
artikel
|
| 144 |
A heuristic approach for searching
(
d
,
n
)
-packing colorings of infinite lattices
|
Korže, Danilo
|
|
2019
|
96-97 |
C |
p. 353-358
|
artikel
|
| 145 |
A heuristic for cumulative vehicle routing using column generation
|
Gaur, Daya Ram
|
|
2017
|
96-97 |
C |
p. 140-157
18 p.
|
artikel
|
| 146 |
A hierarchical framework for recovery in compressive sensing
|
Colbourn, Charles J.
|
|
2018
|
96-97 |
C |
p. 96-107
|
artikel
|
| 147 |
A hybrid algorithm with cluster analysis in modelling high dimensional data
|
Tunga, Burcu
|
|
2018
|
96-97 |
C |
p. 161-168
|
artikel
|
| 148 |
A hybrid classifier based on boxes and nearest neighbors
|
Anthony, Martin
|
|
2014
|
96-97 |
C |
p. 1-11
11 p.
|
artikel
|
| 149 |
A hybrid framework of data hiding and encryption in H.264/SVC
|
Liu, Shaohui
|
|
2018
|
96-97 |
C |
p. 48-57
|
artikel
|
| 150 |
A kind of conditional connectivity of transposition networks generated by
k
-trees
|
Yang, Weihua
|
|
2018
|
96-97 |
C |
p. 132-138
|
artikel
|
| 151 |
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees
|
Lappo, Egor
|
|
|
96-97 |
C |
p. 65-81
|
artikel
|
| 152 |
A Lex-BFS-based recognition algorithm for Robinsonian matrices
|
Laurent, M.
|
|
2017
|
96-97 |
C |
p. 151-165
15 p.
|
artikel
|
| 153 |
Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
|
Hamilton, Kathleen E.
|
|
2017
|
96-97 |
C |
p. 124-142
19 p.
|
artikel
|
| 154 |
Algebraic degree of spectra of Cayley hypergraphs
|
Sripaisan, Naparat
|
|
|
96-97 |
C |
p. 87-94
|
artikel
|
| 155 |
Algebraic properties of soluble posets
|
Cigler, Grega
|
|
|
96-97 |
C |
p. 211-220
|
artikel
|
| 156 |
Algorithm for partial sweep coverage on a line
|
Zhao, Lei
|
|
|
96-97 |
C |
p. 220-228
|
artikel
|
| 157 |
Algorithmic aspects of broadcast independence
|
Bessy, S.
|
|
|
96-97 |
C |
p. 142-149
|
artikel
|
| 158 |
Algorithmic aspects of rotor-routing and the notion of linear equivalence
|
Tóthmérész, Lilla
|
|
2018
|
96-97 |
C |
p. 428-437
|
artikel
|
| 159 |
Algorithmic aspects of switch cographs
|
Cohen-Addad, Vincent
|
|
2016
|
96-97 |
C |
p. 23-42
20 p.
|
artikel
|
| 160 |
Algorithmic enumeration of surrounding polygons
|
Yamanaka, Katsuhisa
|
|
|
96-97 |
C |
p. 305-313
|
artikel
|
| 161 |
Algorithmic results for weak Roman domination problem in graphs
|
Paul, Kaustav
|
|
|
96-97 |
C |
p. 278-289
|
artikel
|
| 162 |
Algorithmic results on locating-total domination in graphs
|
Poureidi, Abolfazl
|
|
|
96-97 |
C |
p. 36-44
|
artikel
|
| 163 |
Algorithmic study on 2-transitivity of graphs
|
Paul, Subhabrata
|
|
|
96-97 |
C |
p. 57-75
|
artikel
|
| 164 |
Algorithmic techniques for finding resistance distances on structured graphs
|
Evans, E.J.
|
|
|
96-97 |
C |
p. 387-407
|
artikel
|
| 165 |
Algorithms and applications for a class of bilevel MILPs
|
Poirion, Pierre-Louis
|
|
|
96-97 |
C |
p. 75-89
|
artikel
|
| 166 |
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups
|
Lorenzo-Freire, S.
|
|
|
96-97 |
C |
p. 113-124
|
artikel
|
| 167 |
Algorithms for computing the Shapley value of cooperative games on lattices
|
Maafa, Khaled
|
|
2018
|
96-97 |
C |
p. 91-105
|
artikel
|
| 168 |
Algorithms for finding a rooted
(
k
,
1
)
-edge-connected orientation
|
Király, Csaba
|
|
2014
|
96-97 |
C |
p. 263-268
6 p.
|
artikel
|
| 169 |
Algorithms for finding disjoint path covers in unit interval graphs
|
Park, Jung-Heum
|
|
2016
|
96-97 |
C |
p. 132-149
18 p.
|
artikel
|
| 170 |
Algorithms for linear time reconstruction by discrete tomography
|
Pagani, Silvia M.C.
|
|
2019
|
96-97 |
C |
p. 152-170
|
artikel
|
| 171 |
Algorithms for linear time reconstruction by discrete tomography II
|
Ceko, Matthew
|
|
|
96-97 |
C |
p. 7-20
|
artikel
|
| 172 |
Algorithms for maximum social welfare of online random trading
|
Chen, Xujin
|
|
|
96-97 |
C |
p. 229-240
|
artikel
|
| 173 |
Algorithms for Radon partitions with tolerance
|
Bereg, Sergey
|
|
|
96-97 |
C |
p. 207-215
|
artikel
|
| 174 |
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
|
Zinder, Y.
|
|
2015
|
96-97 |
C |
p. 28-53
26 p.
|
artikel
|
| 175 |
Algorithms for the clique problem with multiple-choice constraints under a series–parallel dependency graph
|
Bärmann, Andreas
|
|
|
96-97 |
C |
p. 145-166
|
artikel
|
| 176 |
Algorithms for unipolar and generalized split graphs
|
Eschen, Elaine M.
|
|
2014
|
96-97 |
C |
p. 195-201
7 p.
|
artikel
|
| 177 |
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
|
Fellows, Michael
|
|
2018
|
96-97 |
C |
p. 94-100
|
artikel
|
| 178 |
Algorithms to approximately count and sample conforming colorings of graphs
|
Miracle, Sarah
|
|
2016
|
96-97 |
C |
p. 133-149
|
artikel
|
| 179 |
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
|
Djeumou Fomeni, Franklin
|
|
|
96-97 |
C |
p. 52-68
|
artikel
|
| 180 |
A linear algorithm for secure domination in trees
|
Burger, A.P.
|
|
2014
|
96-97 |
C |
p. 15-27
13 p.
|
artikel
|
| 181 |
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
|
Pandit, Parthe
|
|
2018
|
96-97 |
C |
p. 155-169
|
artikel
|
| 182 |
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
|
Shalini, Arul Jeya
|
|
|
96-97 |
C |
p. 10-18
|
artikel
|
| 183 |
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
|
Ihm, Insung
|
|
2017
|
96-97 |
C |
p. 98-112
15 p.
|
artikel
|
| 184 |
A linear-time algorithm for minimum
k
-hop dominating set of a cactus graph
|
Abu-Affash, A. Karim
|
|
|
96-97 |
C |
p. 488-499
|
artikel
|
| 185 |
A linear-time algorithm for semitotal domination in strongly chordal graphs
|
Tripathi, Vikash
|
|
|
96-97 |
C |
p. 77-88
|
artikel
|
| 186 |
A linear-time algorithm for testing full outer-2-planarity
|
Hong, Seok-Hee
|
|
2019
|
96-97 |
C |
p. 234-257
|
artikel
|
| 187 |
A linear time algorithm for the nullity of vertex-weighted block graphs
|
Singh, Ranveer
|
|
|
96-97 |
C |
p. 61-70
|
artikel
|
| 188 |
A linear time algorithm for the robust recoverable selection problem
|
Lachmann, Thomas
|
|
|
96-97 |
C |
p. 94-107
|
artikel
|
| 189 |
A linear-time certifying algorithm for recognizing generalized series–parallel graphs
|
Chin, Francis Y.L.
|
|
|
96-97 |
C |
p. 152-171
|
artikel
|
| 190 |
A linear-time kernelization for the Rooted
k
-Leaf Outbranching Problem
|
Kammer, Frank
|
|
2015
|
96-97 |
C |
p. 126-138
13 p.
|
artikel
|
| 191 |
Alliance polynomial of regular graphs
|
Carballosa, Walter
|
|
2017
|
96-97 |
C |
p. 22-32
11 p.
|
artikel
|
| 192 |
Alliances in graphs of bounded clique-width
|
Kiyomi, Masashi
|
|
2017
|
96-97 |
C |
p. 91-97
7 p.
|
artikel
|
| 193 |
Allocation of indivisible items with individual preference graphs
|
Chiarelli, Nina
|
|
|
96-97 |
C |
p. 45-62
|
artikel
|
| 194 |
All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs
|
Wu, Haibo
|
|
2019
|
96-97 |
C |
p. 196-203
|
artikel
|
| 195 |
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
|
Chang, Fei-Huang
|
|
2014
|
96-97 |
C |
p. 28-34
7 p.
|
artikel
|
| 196 |
Almost all regular graphs are normal
|
Changiz Rezaei, Seyed Saeed
|
|
2017
|
96-97 |
C |
p. 51-55
5 p.
|
artikel
|
| 197 |
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
|
Darties, Benoît
|
|
2018
|
96-97 |
C |
p. 124-136
|
artikel
|
| 198 |
Almost empty monochromatic triangles in planar point sets
|
Basu, Deepan
|
|
2016
|
96-97 |
C |
p. 207-213
|
artikel
|
| 199 |
Almost every graph is divergent under the biclique operator
|
Groshaus, Marina
|
|
2016
|
96-97 |
C |
p. 130-140
11 p.
|
artikel
|
| 200 |
A local analysis to determine all optimal solutions of
p
-
k
-
max
location problems on networks
|
Schnepper, Teresa
|
|
|
96-97 |
C |
p. 217-234
|
artikel
|
| 201 |
A local maximizer for lattice width of 3-dimensional hollow bodies
|
Averkov, Gennadiy
|
|
|
96-97 |
C |
p. 129-142
|
artikel
|
| 202 |
A local search approximation algorithm for the multiway cut problem
|
Bloch-Hansen, Andrew
|
|
|
96-97 |
C |
p. 8-21
|
artikel
|
| 203 |
A lower bound for radio
k
-chromatic number
|
Saha, Laxman
|
|
2015
|
96-97 |
C |
p. 87-100
14 p.
|
artikel
|
| 204 |
A lower bound for secure domination number of an outerplanar graph
|
Araki, Toru
|
|
|
96-97 |
C |
p. 81-85
|
artikel
|
| 205 |
A lower bound on the constant in the Fourier min-entropy/influence conjecture
|
Biswas, Aniruddha
|
|
|
96-97 |
C |
p. 23-32
|
artikel
|
| 206 |
A lower bound on the crossing number of uniform hypergraphs
|
Anshu, Anurag
|
|
2016
|
96-97 |
C |
p. 11-15
5 p.
|
artikel
|
| 207 |
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
|
Brause, C.
|
|
2016
|
96-97 |
C |
p. 59-67
9 p.
|
artikel
|
| 208 |
A lower bound on the modified Randić index of line graphs
|
Zou, Zitao
|
|
|
96-97 |
C |
p. 136-140
|
artikel
|
| 209 |
A lower bound on the order of the largest induced forest in planar graphs with high girth
|
Dross, François
|
|
2016
|
96-97 |
C |
p. 99-107
9 p.
|
artikel
|
| 210 |
A lower bound on the third-order nonlinearity of the simplest
PS
a
p
bent functions
|
Li, Zhaole
|
|
|
96-97 |
C |
p. 148-161
|
artikel
|
| 211 |
A lower bound on the zero forcing number
|
Davila, Randy
|
|
2018
|
96-97 |
C |
p. 363-367
|
artikel
|
| 212 |
Alphabetic points in restricted growth functions
|
Blecher, Aubrey
|
|
|
96-97 |
C |
p. 130-137
|
artikel
|
| 213 |
Alternating kernels
|
Delgado-Escalante, Pietra
|
|
2018
|
96-97 |
C |
p. 153-164
|
artikel
|
| 214 |
Alternating
L
-functions of finite digraphs
|
Wu, Yongjiang
|
|
|
96-97 |
C |
p. 34-49
|
artikel
|
| 215 |
Alternative formulations for the obnoxious p-median problem
|
Lin, Chang-Chun
|
|
|
96-97 |
C |
p. 366-373
|
artikel
|
| 216 |
A magic rectangle set on Abelian groups and its application
|
Cichacz, Sylwia
|
|
|
96-97 |
C |
p. 201-210
|
artikel
|
| 217 |
A map of the
P
-positions in ‘Nim With a Pass’ played on heap sizes of at most four
|
Chan, W.H.
|
|
2018
|
96-97 |
C |
p. 44-55
|
artikel
|
| 218 |
A Markov chain on the solution space of edge colorings of bipartite graphs
|
Hong, Letong
|
|
|
96-97 |
C |
p. 7-22
|
artikel
|
| 219 |
A matheuristic for the asymmetric capacitated vehicle routing problem
|
Leggieri, Valeria
|
|
2018
|
96-97 |
C |
p. 139-150
|
artikel
|
| 220 |
A maximizing characteristic for critical configurations of chip-firing games on digraphs
|
Nguyen, Hoang Thach
|
|
2018
|
96-97 |
C |
p. 38-46
|
artikel
|
| 221 |
Ambiguity and deficiency for differentially
4
-uniform monomial permutations on
F
2
n
|
Yan, Yang
|
|
2018
|
96-97 |
C |
p. 175-183
|
artikel
|
| 222 |
A measure for a balanced workload and its extremal values
|
Govorčin, Jelena
|
|
2016
|
96-97 |
C |
p. 59-66
8 p.
|
artikel
|
| 223 |
Ameso optimization: A relaxation of discrete midpoint convexity
|
Chen, Wen
|
|
|
96-97 |
C |
p. 177-192
|
artikel
|
| 224 |
A method for computing local contributions to graph energy based on Estrada–Benzi approach
|
Safaei, F.
|
|
2019
|
96-97 |
C |
p. 214-226
|
artikel
|
| 225 |
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
|
Kozak, Adam
|
|
2019
|
96-97 |
C |
p. 127-144
|
artikel
|
| 226 |
A method for enumerating pairwise compatibility graphs with a given number of vertices
|
Azam, Naveed Ahmed
|
|
|
96-97 |
C |
p. 171-185
|
artikel
|
| 227 |
A minimax result for perfect matchings of a polyomino graph
|
Zhou, Xiangqian
|
|
2016
|
96-97 |
C |
p. 165-171
7 p.
|
artikel
|
| 228 |
A
min
–
max
relation in flowgraphs and some applications
|
Ferreira, Carlos Eduardo
|
|
2018
|
96-97 |
C |
p. 65-76
|
artikel
|
| 229 |
A model for finding transition-minors
|
Klocker, Benedikt
|
|
|
96-97 |
C |
p. 242-264
|
artikel
|
| 230 |
A modified bootstrap percolation on a random graph coupled with a lattice
|
Janson, Svante
|
|
2019
|
96-97 |
C |
p. 152-165
|
artikel
|
| 231 |
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
|
Pai, Kung-Jui
|
|
2019
|
96-97 |
C |
p. 223-236
|
artikel
|
| 232 |
A multiobjective optimization algorithm for the weighted LCS
|
Becerra, David
|
|
2016
|
96-97 |
C |
p. 37-47
11 p.
|
artikel
|
| 233 |
An
A
B
C
-Problem for location and consensus functions on graphs
|
McMorris, F.R.
|
|
2016
|
96-97 |
C |
p. 15-28
14 p.
|
artikel
|
| 234 |
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services
|
Bruglieri, Maurizio
|
|
2019
|
96-97 |
C |
p. 185-200
|
artikel
|
| 235 |
An algebraic algorithm for solving parametric integer programs
|
Fu, Norie
|
|
2018
|
96-97 |
C |
p. 253-264
|
artikel
|
| 236 |
An algebraic approach to lifts of digraphs
|
Dalfó, C.
|
|
2019
|
96-97 |
C |
p. 68-76
|
artikel
|
| 237 |
An algebraic expression of the number partitioning problem
|
Kubo, Susumu
|
|
|
96-97 |
C |
p. 283-296
|
artikel
|
| 238 |
An algorithm computing combinatorial specifications of permutation classes
|
Bassino, Frédérique
|
|
2017
|
96-97 |
C |
p. 16-44
29 p.
|
artikel
|
| 239 |
An algorithm for delta–wye reduction of almost-planar graphs
|
Gitler, Isidoro
|
|
|
96-97 |
C |
p. 631-641
|
artikel
|
| 240 |
An algorithm for identifying cycle-plus-triangles graphs
|
Bérczi, Kristóf
|
|
2017
|
96-97 |
C |
p. 10-16
7 p.
|
artikel
|
| 241 |
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
|
Bordewich, M.
|
|
2016
|
96-97 |
C |
p. 47-59
13 p.
|
artikel
|
| 242 |
An algorithm for the class of pure implicational formulas
|
Franco, John
|
|
1999
|
96-97 |
C |
p. 89-106
18 p.
|
artikel
|
| 243 |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
|
Komusiewicz, Christian
|
|
2015
|
96-97 |
C |
p. 145-161
17 p.
|
artikel
|
| 244 |
An algorithmic metatheorem for directed treewidth
|
de Oliveira Oliveira, Mateus
|
|
2016
|
96-97 |
C |
p. 49-76
28 p.
|
artikel
|
| 245 |
An algorithmic separating hyperplane theorem and its applications
|
Kalantari, Bahman
|
|
2019
|
96-97 |
C |
p. 59-82
|
artikel
|
| 246 |
An algorithmic toolbox for periodic partial words
|
Manea, Florin
|
|
2014
|
96-97 |
C |
p. 174-192
19 p.
|
artikel
|
| 247 |
An algorithm to find maximum area polygons circumscribed about a convex polygon
|
Ausserhofer, Markus
|
|
2019
|
96-97 |
C |
p. 98-108
|
artikel
|
| 248 |
An algorithm which outputs a graph with a specified chromatic factor
|
Delbourgo, Daniel
|
|
2019
|
96-97 |
C |
p. 128-150
|
artikel
|
| 249 |
An alternative approach to distance geometry using
L
∞
distances
|
Crippen, Gordon M.
|
|
2015
|
96-97 |
C |
p. 20-26
7 p.
|
artikel
|
| 250 |
Analysis of a generalized Linear Ordering Problem via integer programming
|
Méndez-Díaz, Isabel
|
|
2019
|
96-97 |
C |
p. 93-107
|
artikel
|
| 251 |
Analysis of minimal path routing schemes in the presence of faults
|
M. Gordon, Jesse
|
|
1992
|
96-97 |
C |
p. 245-263
19 p.
|
artikel
|
| 252 |
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
|
Gu, Mei-Mei
|
|
|
96-97 |
C |
p. 80-91
|
artikel
|
| 253 |
Analysis on Yu et al.’s dynamic algorithm for canonic DBC
|
Eom, Sookyung
|
|
|
96-97 |
C |
p. 31-40
|
artikel
|
| 254 |
An analysis of root functions—A subclass of the Impossible Class of Faulty Functions (ICFF)
|
Pasalic, E.
|
|
2017
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 255 |
An 8-approximation algorithm for
L
(
2
,
1
)
-labeling of unit disk graphs
|
Ono, Hirotaka
|
|
|
96-97 |
C |
p. 93-101
|
artikel
|
| 256 |
An approximation algorithm for the longest cycle problem in solid grid graphs
|
Asgharian Sardroud, Asghar
|
|
2016
|
96-97 |
C |
p. 6-12
7 p.
|
artikel
|
| 257 |
An approximation algorithm for the partial covering 0–1 integer program
|
Takazawa, Yotaro
|
|
|
96-97 |
C |
p. 126-133
|
artikel
|
| 258 |
An asymptotic upper bound for graph embeddings
|
Bartzos, Evangelos
|
|
|
96-97 |
C |
p. 157-177
|
artikel
|
| 259 |
An easy counting lemma
|
Engelhardt, Matthias R.
|
|
2019
|
96-97 |
C |
p. 175-185
|
artikel
|
| 260 |
A necessary condition for the equality of the clique number and the convexity number of a graph
|
Moscarini, Marina
|
|
|
96-97 |
C |
p. 191-196
|
artikel
|
| 261 |
An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
|
Li, Jianxi
|
|
2014
|
96-97 |
C |
p. 104-115
12 p.
|
artikel
|
| 262 |
An efficient algorithm for group testing with runlength constraints
|
Dalai, Marco
|
|
|
96-97 |
C |
p. 181-187
|
artikel
|
| 263 |
An efficient algorithm to determine all shortest paths in Sierpiński graphs
|
Hinz, Andreas M.
|
|
2014
|
96-97 |
C |
p. 111-120
10 p.
|
artikel
|
| 264 |
An efficient lattice reduction using reuse technique blockwisely on NTRU
|
Chung, Kyungmi
|
|
2016
|
96-97 |
C |
p. 88-98
11 p.
|
artikel
|
| 265 |
An efficient RSA-based certificateless public key encryption scheme
|
Lin, Xi-Jun
|
|
2018
|
96-97 |
C |
p. 39-47
|
artikel
|
| 266 |
A neighborhood union condition for fractional
(
a
,
b
,
k
)
-critical covered graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 343-348
|
artikel
|
| 267 |
An embedding technique in the study of word-representability of graphs
|
Huang, Sumin
|
|
|
96-97 |
C |
p. 170-182
|
artikel
|
| 268 |
A new algorithm for Boolean matrix factorization which admits overcovering
|
Belohlavek, Radim
|
|
2018
|
96-97 |
C |
p. 36-52
|
artikel
|
| 269 |
A new approach on locally checkable problems
|
Bonomo-Braberman, Flavia
|
|
|
96-97 |
C |
p. 53-80
|
artikel
|
| 270 |
A new approach to finding the extra connectivity of graphs
|
Zhu, Qiang
|
|
|
96-97 |
C |
p. 265-271
|
artikel
|
| 271 |
A new approach to gross error detection for GPS networks
|
Dalfó, C.
|
|
2019
|
96-97 |
C |
p. 193-199
|
artikel
|
| 272 |
A new class of optimal linear codes with flexible parameters
|
Luo, Gaojun
|
|
2018
|
96-97 |
C |
p. 126-131
|
artikel
|
| 273 |
A new condition on dominated pair degree sum for a digraph to be supereulerian
|
Dong, Changchang
|
|
|
96-97 |
C |
p. 124-130
|
artikel
|
| 274 |
A new construction of broadcast graphs
|
Harutyunyan, Hovhannes A.
|
|
|
96-97 |
C |
p. 144-155
|
artikel
|
| 275 |
A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
|
Zhang, Hui
|
|
2019
|
96-97 |
C |
p. 13-28
|
artikel
|
| 276 |
A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities
|
Murthy, Ishwar
|
|
2019
|
96-97 |
C |
p. 119-143
|
artikel
|
| 277 |
A new general family of mixed graphs
|
Dalfó, C.
|
|
2019
|
96-97 |
C |
p. 99-106
|
artikel
|
| 278 |
A new locally
t
-diagnosable structure under the PMC model with an application to matching composition networks
|
Chen, Meirun
|
|
|
96-97 |
C |
p. 1-15
|
artikel
|
| 279 |
A new look at the de Bruijn graph
|
Fredricksen, Harold
|
|
1992
|
96-97 |
C |
p. 193-203
11 p.
|
artikel
|
| 280 |
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture
|
Henning, Michael A.
|
|
2014
|
96-97 |
C |
p. 45-52
8 p.
|
artikel
|
| 281 |
A new lower bound on graph gonality
|
Harp, Michael
|
|
|
96-97 |
C |
p. 172-179
|
artikel
|
| 282 |
A new lower bound on the double domination number of a graph
|
Hajian, Majid
|
|
2019
|
96-97 |
C |
p. 280-282
|
artikel
|
| 283 |
A new measure for comparing biomedical regions of interest in segmentation of digital images
|
Conci, Aura
|
|
2015
|
96-97 |
C |
p. 103-113
11 p.
|
artikel
|
| 284 |
A new model and algorithms in firefighting theory
|
Klein, Rolf
|
|
|
96-97 |
C |
p. 296-309
|
artikel
|
| 285 |
A new note on 1-planar graphs with minimum degree 7
|
Huang, Yuanqiu
|
|
|
96-97 |
C |
p. 165-183
|
artikel
|
| 286 |
A new perspective from hypertournaments to tournaments
|
Ai, Jiangdong
|
|
|
96-97 |
C |
p. 136-142
|
artikel
|
| 287 |
A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space
|
Prosanov, Roman
|
|
|
96-97 |
C |
p. 115-120
|
artikel
|
| 288 |
A new sufficient condition for pancyclability of graphs
|
Cai, Junqing
|
|
2014
|
96-97 |
C |
p. 142-148
7 p.
|
artikel
|
| 289 |
A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
|
Contreras-Balbuena, Alejandro
|
|
2017
|
96-97 |
C |
p. 55-63
9 p.
|
artikel
|
| 290 |
A new upper bound on the total domination number in graphs with minimum degree six
|
Henning, Michael A.
|
|
|
96-97 |
C |
p. 1-7
|
artikel
|
| 291 |
An exact algorithm for a class of geometric set-cover problems
|
Contardo, Claudio
|
|
|
96-97 |
C |
p. 25-35
|
artikel
|
| 292 |
An exact algorithm for maximum independent set in degree-5 graphs
|
Xiao, Mingyu
|
|
2016
|
96-97 |
C |
p. 137-155
19 p.
|
artikel
|
| 293 |
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
|
Curcio, Brian
|
|
|
96-97 |
C |
p. 80-98
|
artikel
|
| 294 |
An exact algorithm for the bottleneck 2-connected
k
-Steiner network problem in
L
p
planes
|
Brazil, M.
|
|
2016
|
96-97 |
C |
p. 47-69
23 p.
|
artikel
|
| 295 |
An extension of Lehman’s theorem and ideal set functions
|
Király, Tamás
|
|
2016
|
96-97 |
C |
p. 251-263
13 p.
|
artikel
|
| 296 |
An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications
|
Peng, Yuejian
|
|
2016
|
96-97 |
C |
p. 170-175
6 p.
|
artikel
|
| 297 |
An
(
F
3
,
F
4
)
-partition of planar graphs without 4- and 6-cycles
|
Hu, Kaiyang
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 298 |
An FPT algorithm for the vertex cover
P
4
problem
|
Tu, Jianhua
|
|
2016
|
96-97 |
C |
p. 186-190
5 p.
|
artikel
|
| 299 |
An impossible combinatorial counting method in distance geometry
|
Abud, Germano
|
|
|
96-97 |
C |
p. 83-93
|
artikel
|
| 300 |
An improved algorithm for finding maximum outerplanar subgraphs
|
Călinescu, Gruia
|
|
|
96-97 |
C |
p. 207-217
|
artikel
|
| 301 |
An improved algorithm to construct edge-independent spanning trees in augmented cubes
|
Cheng, Baolei
|
|
|
96-97 |
C |
p. 55-70
|
artikel
|
| 302 |
An improved approximation for Maximum
k
-dependent Set on bipartite graphs
|
Hosseinian, Seyedmohammadhossein
|
|
|
96-97 |
C |
p. 95-101
|
artikel
|
| 303 |
An improved bound for 2-distance coloring of planar graphs with girth six
|
Deniz, Zakir
|
|
|
96-97 |
C |
p. 121-135
|
artikel
|
| 304 |
An improved lower bound for the Seidel energy of trees
|
Einollahzadeh, M.
|
|
|
96-97 |
C |
p. 381-386
|
artikel
|
| 305 |
An improved lower bound on the independence number of a graph
|
Henning, Michael A.
|
|
2014
|
96-97 |
C |
p. 120-128
9 p.
|
artikel
|
| 306 |
An improved upper bound for neighbor sum distinguishing edge colorings of graphs
|
Yu, Xiaowei
|
|
|
96-97 |
C |
p. 104-109
|
artikel
|
| 307 |
An improved upper bound for planar Turán number of double star
S
2
,
5
|
Xu, Xin
|
|
|
96-97 |
C |
p. 326-332
|
artikel
|
| 308 |
An improved upper bound for the acyclic chromatic number of 1-planar graphs
|
Yang, Wanshun
|
|
|
96-97 |
C |
p. 275-291
|
artikel
|
| 309 |
An improved upper bound for the neighbor sum distinguishing index of graphs
|
Wang, Guanghui
|
|
2014
|
96-97 |
C |
p. 126-128
3 p.
|
artikel
|
| 310 |
An improved upper bound for the subarray partial concentrators
|
Hu, X.D.
|
|
1992
|
96-97 |
C |
p. 341-346
6 p.
|
artikel
|
| 311 |
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
|
Zhang, Lianzhu
|
|
2014
|
96-97 |
C |
p. 348-354
7 p.
|
artikel
|
| 312 |
An improved upper bound on the domination number of a tree
|
Cabrera-Martínez, Abel
|
|
|
96-97 |
C |
p. 44-48
|
artikel
|
| 313 |
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
|
Khoeilar, Rana
|
|
2019
|
96-97 |
C |
p. 159-167
|
artikel
|
| 314 |
An improvement of sufficient condition for
k
-leaf-connected graphs
|
Ma, Tingyan
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 315 |
An improvement on the number of simplices in
F
q
d
|
Pham, Duc Hiep
|
|
2017
|
96-97 |
C |
p. 95-105
11 p.
|
artikel
|
| 316 |
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
|
Babu, Jasine
|
|
|
96-97 |
C |
p. 432-440
|
artikel
|
| 317 |
An incremental SAT-based approach for solving the real-time taxi-sharing service problem
|
Zha, Aolong
|
|
|
96-97 |
C |
p. 131-145
|
artikel
|
| 318 |
An inductive proof of Dirac’s theorem on Hamilton cycles
|
Ning, Bo
|
|
|
96-97 |
C |
p. 160-162
|
artikel
|
| 319 |
An inequality on global alliances for trees
|
Yu, Alexandria
|
|
2015
|
96-97 |
C |
p. 227-229
3 p.
|
artikel
|
| 320 |
An infinite family of 2-connected graphs that have reliability factorisations
|
Morgan, Kerri
|
|
2017
|
96-97 |
C |
p. 123-127
5 p.
|
artikel
|
| 321 |
An infinite family of graphs with a facile count of perfect matchings
|
Rosenfeld, Vladimir R.
|
|
2014
|
96-97 |
C |
p. 210-214
5 p.
|
artikel
|
| 322 |
An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method
|
Taghavi Afshord, Saeid
|
|
2015
|
96-97 |
C |
p. 208-219
12 p.
|
artikel
|
| 323 |
An integer programming approach for solving a generalized version of the Grundy domination number
|
Campêlo, Manoel
|
|
|
96-97 |
C |
p. 26-48
|
artikel
|
| 324 |
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
|
Marenco, Javier
|
|
|
96-97 |
C |
p. 180-195
|
artikel
|
| 325 |
An integer programming model for protein structure prediction using the 3D-HP side chain model
|
Nunes, Luiz Fernando
|
|
2016
|
96-97 |
C |
p. 206-214
9 p.
|
artikel
|
| 326 |
An interleaved method for constructing de Bruijn sequences
|
Zhao, Xiao-Xin
|
|
2019
|
96-97 |
C |
p. 234-245
|
artikel
|
| 327 |
An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
|
Bertrand, Patrice
|
|
|
96-97 |
C |
p. 38-63
|
artikel
|
| 328 |
An introduction to the deduction number
|
Burgess, Andrea
|
|
|
96-97 |
C |
p. 20-27
|
artikel
|
| 329 |
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
|
Iamphongsai, Athipatana
|
|
|
96-97 |
C |
p. 1-12
|
artikel
|
| 330 |
An
O
∗
(
2
.
61
9
k
)
algorithm for 4-Path Vertex Cover
|
Tsur, Dekel
|
|
|
96-97 |
C |
p. 1-14
|
artikel
|
| 331 |
An old problem of Erdős: A graph without two cycles of the same length
|
Lai, Chunhui
|
|
|
96-97 |
C |
p. 42-45
|
artikel
|
| 332 |
An
O
(
n
2
)
time algorithm for the minimal permutation completion problem
|
Crespelle, Christophe
|
|
2019
|
96-97 |
C |
p. 80-95
|
artikel
|
| 333 |
An ordering theorem on the
Q
-spectral radius of graphs with given size and its applications
|
Guo, Shu-Guang
|
|
|
96-97 |
C |
p. 91-98
|
artikel
|
| 334 |
A note about online nonrepetitive coloring
k
-trees
|
Keszegh, Balázs
|
|
|
96-97 |
C |
p. 108-112
|
artikel
|
| 335 |
A note on a conjecture of Wu, Xu and Xu
|
Lan, Kaiyang
|
|
|
96-97 |
C |
p. 33-36
|
artikel
|
| 336 |
A note on additive choice number of planar graphs
|
Lai, Hsin-Hao
|
|
|
96-97 |
C |
p. 357-359
|
artikel
|
| 337 |
A note on a directed version of the 1-2-3 Conjecture
|
Horňák, Mirko
|
|
2018
|
96-97 |
C |
p. 472-476
|
artikel
|
| 338 |
A note on adjacent vertex distinguishing colorings of graphs
|
Axenovich, M.
|
|
2016
|
96-97 |
C |
p. 1-7
7 p.
|
artikel
|
| 339 |
A note on Alon–Tarsi number of Halin graphs
|
Lin, Dazhi
|
|
|
96-97 |
C |
p. 297-299
|
artikel
|
| 340 |
A note on an alternating upper bound for random walks on semigroups
|
Chung, Fan
|
|
|
96-97 |
C |
p. 24-29
|
artikel
|
| 341 |
A note on antimagic orientations of even regular graphs
|
Yang, Donglei
|
|
2019
|
96-97 |
C |
p. 224-228
|
artikel
|
| 342 |
A note on b-coloring of Kneser graphs
|
Shaebani, Saeed
|
|
2019
|
96-97 |
C |
p. 368-369
|
artikel
|
| 343 |
A note on 3-bisections in subcubic graphs
|
Cui, Qing
|
|
|
96-97 |
C |
p. 147-152
|
artikel
|
| 344 |
A note on 2-bisections of claw-free cubic graphs
|
Abreu, Marién
|
|
2018
|
96-97 |
C |
p. 214-217
|
artikel
|
| 345 |
A note on bounds for the broadcast domination number of graphs
|
Sen, Jishnu
|
|
|
96-97 |
C |
p. 162-169
|
artikel
|
| 346 |
A note on breaking small automorphisms in graphs
|
Kalinowski, Rafał
|
|
2017
|
96-97 |
C |
p. 221-225
|
artikel
|
| 347 |
A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
|
Feng, Yong-De
|
|
|
96-97 |
C |
p. 84-89
|
artikel
|
| 348 |
A note on coloring digraphs of large girth
|
Steiner, Raphael
|
|
|
96-97 |
C |
p. 62-64
|
artikel
|
| 349 |
A note on connected greedy edge colouring
|
Bonamy, Marthe
|
|
|
96-97 |
C |
p. 129-136
|
artikel
|
| 350 |
A note on deterministic zombies
|
Bartier, Valentin
|
|
|
96-97 |
C |
p. 65-68
|
artikel
|
| 351 |
A note on domination number in maximal outerplanar graphs
|
Liu, Chanjuan
|
|
|
96-97 |
C |
p. 90-94
|
artikel
|
| 352 |
A note on double domination in graphs
|
Cabrera-Martínez, Abel
|
|
|
96-97 |
C |
p. 107-111
|
artikel
|
| 353 |
A note on easy and efficient computation of full abelian periods of a word
|
Fici, Gabriele
|
|
2016
|
96-97 |
C |
p. 88-95
8 p.
|
artikel
|
| 354 |
A note on eigenvalue bounds for independence numbers of non-regular graphs
|
Li, Yusheng
|
|
2014
|
96-97 |
C |
p. 146-149
4 p.
|
artikel
|
| 355 |
A note on eigenvalue, spectral radius and energy of extended adjacency matrix
|
Ghorbani, Modjtaba
|
|
|
96-97 |
C |
p. 102-116
|
artikel
|
| 356 |
A note on equidistant subspace codes
|
Bartoli, Daniele
|
|
2016
|
96-97 |
C |
p. 291-296
6 p.
|
artikel
|
| 357 |
A note on equitable Hamiltonian cycles
|
Ophelders, Tim
|
|
|
96-97 |
C |
p. 127-136
|
artikel
|
| 358 |
A note on extremal trees for a bound on the double domination number
|
Kalaiyarasi, Ravi
|
|
|
96-97 |
C |
p. 71-75
|
artikel
|
| 359 |
A note on fractional ID-
[
a
,
b
]
-factor-critical covered graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 511-516
|
artikel
|
| 360 |
A note on generalized semitotal point graphs
|
Cheuk, Danny
|
|
|
96-97 |
C |
p. 114-127
|
artikel
|
| 361 |
A note on generic rigidity of graphs in higher dimension
|
Jordán, Tibor
|
|
|
96-97 |
C |
p. 97-101
|
artikel
|
| 362 |
A note on geometric duality in matroid theory and knot theory
|
Traldi, Lorenzo
|
|
|
96-97 |
C |
p. 184-190
|
artikel
|
| 363 |
A note on Hamilton
ℓ
-cycle decomposition of complete
k
-partite hypergraphs
|
Jiang, Taijiang
|
|
|
96-97 |
C |
p. 214-219
|
artikel
|
| 364 |
A note on
k
-metric dimensional graphs
|
Corregidor, Samuel G.
|
|
|
96-97 |
C |
p. 523-533
|
artikel
|
| 365 |
A note on many-to-many matchings and stable allocations
|
Baïou, Mourad
|
|
2016
|
96-97 |
C |
p. 181-184
4 p.
|
artikel
|
| 366 |
A note on M-convex functions on jump systems
|
Murota, Kazuo
|
|
|
96-97 |
C |
p. 492-502
|
artikel
|
| 367 |
A note on median eigenvalues of subcubic graphs
|
Wang, Yuzhenni
|
|
|
96-97 |
C |
p. 138-141
|
artikel
|
| 368 |
A note on odd colorings of 1-planar graphs
|
Cranston, Daniel W.
|
|
|
96-97 |
C |
p. 112-117
|
artikel
|
| 369 |
A note on partitions of graphs under degree constraints
|
Zu, Chunlei
|
|
|
96-97 |
C |
p. 631-633
|
artikel
|
| 370 |
A note on 1-planar graphs
|
Ackerman, Eyal
|
|
2014
|
96-97 |
C |
p. 104-108
5 p.
|
artikel
|
| 371 |
A note on 1-planar graphs with minimum degree 7
|
Biedl, Therese
|
|
|
96-97 |
C |
p. 230-232
|
artikel
|
| 372 |
A note on prime distance graphs with chromatic number 3 or 4
|
George Barnabas, J.
|
|
|
96-97 |
C |
p. 38-44
|
artikel
|
| 373 |
A note on rainbow-free colorings of uniform hypergraphs
|
Gu, Ran
|
|
|
96-97 |
C |
p. 161-169
|
artikel
|
| 374 |
A note on secure domination in
C
5
-free graphs
|
Degawa, Shingo
|
|
|
96-97 |
C |
p. 82-83
|
artikel
|
| 375 |
A note on Seymour’s second neighborhood conjecture
|
Chen, Bin
|
|
|
96-97 |
C |
p. 272-277
|
artikel
|
| 376 |
A note on
S
-packing colorings of lattices
|
Goddard, Wayne
|
|
2014
|
96-97 |
C |
p. 255-262
8 p.
|
artikel
|
| 377 |
A note on stability results for Berge-
K
s
,
t
hypergraphs
|
Zhou, Junpeng
|
|
|
96-97 |
C |
p. 131-138
|
artikel
|
| 378 |
A note on “Tenacity of a graph with maximum connectivity”
|
Shirdel, G.H.
|
|
2014
|
96-97 |
C |
p. 273-275
3 p.
|
artikel
|
| 379 |
A note on the computation of the fraction of smallest denominator in between two irreducible fractions
|
Sivignon, Isabelle
|
|
2016
|
96-97 |
C |
p. 197-201
5 p.
|
artikel
|
| 380 |
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
|
Li, Pingshan
|
|
|
96-97 |
C |
p. 152-158
|
artikel
|
| 381 |
A note on the connected game coloring number
|
Bradshaw, Peter
|
|
|
96-97 |
C |
p. 13-19
|
artikel
|
| 382 |
A note on the convexity number of the complementary prisms of trees
|
P.K., Neethu
|
|
|
96-97 |
C |
p. 480-486
|
artikel
|
| 383 |
A note on the diameter of convex polytope
|
Yang, Yaguang
|
|
|
96-97 |
C |
p. 534-538
|
artikel
|
| 384 |
A note on the dispersion of admissible lattices
|
Ullrich, Mario
|
|
2019
|
96-97 |
C |
p. 385-387
|
artikel
|
| 385 |
A note on the global offensive alliances in graphs
|
Rad, Nader Jafari
|
|
2018
|
96-97 |
C |
p. 373-376
|
artikel
|
| 386 |
A note on the Grundy number and graph products
|
Clarke, Nancy E.
|
|
2016
|
96-97 |
C |
p. 1-7
7 p.
|
artikel
|
| 387 |
A note on the independence number, connectivity and
k
-ended tree
|
Ha, Pham Hoang
|
|
|
96-97 |
C |
p. 142-144
|
artikel
|
| 388 |
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
|
Fuchs, Michael
|
|
|
96-97 |
C |
p. 64-71
|
artikel
|
| 389 |
A note on the integrity of grids
|
Żak, Andrzej
|
|
|
96-97 |
C |
p. 55-59
|
artikel
|
| 390 |
A note on the
L
(
2
,
1
)
-labelling problem of
G
(
k
,
m
)
|
Ye, Qingjie
|
|
|
96-97 |
C |
p. 273-275
|
artikel
|
| 391 |
A note on the localization number of random graphs: Diameter two case
|
Dudek, Andrzej
|
|
2019
|
96-97 |
C |
p. 107-112
|
artikel
|
| 392 |
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines
|
Yan, Yujie
|
|
2015
|
96-97 |
C |
p. 295-300
6 p.
|
artikel
|
| 393 |
A note on the metric and edge metric dimensions of 2-connected graphs
|
Knor, Martin
|
|
|
96-97 |
C |
p. 454-460
|
artikel
|
| 394 |
A note on the middle levels problem
|
Gusmão, Andréia C.S.
|
|
2016
|
96-97 |
C |
p. 290-296
|
artikel
|
| 395 |
A note on the minimum inverse sum indeg index of cacti
|
Jiang, Yisheng
|
|
|
96-97 |
C |
p. 123-128
|
artikel
|
| 396 |
A note on the minimum size of matching-saturated graphs
|
Zhang, Xuechun
|
|
|
96-97 |
C |
p. 1-5
|
artikel
|
| 397 |
A note on the multiple-recursive matrix method for generating pseudorandom vectors
|
Bishoi, Susil Kumar
|
|
2017
|
96-97 |
C |
p. 67-75
9 p.
|
artikel
|
| 398 |
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
|
Buchheim, Christoph
|
|
|
96-97 |
C |
p. 591-593
|
artikel
|
| 399 |
A note on the orientation covering number
|
Janzer, Barnabás
|
|
|
96-97 |
C |
p. 349-351
|
artikel
|
| 400 |
A note on the packing chromatic number of lexicographic products
|
Božović, Dragana
|
|
|
96-97 |
C |
p. 34-37
|
artikel
|
| 401 |
A note on the polytope of bipartite TSP
|
Kovács, Gergely
|
|
2018
|
96-97 |
C |
p. 92-100
|
artikel
|
| 402 |
A note on the set union knapsack problem
|
Arulselvan, Ashwin
|
|
2014
|
96-97 |
C |
p. 214-218
5 p.
|
artikel
|
| 403 |
A note on the stability results of the number of cliques in graphs with given matching number
|
Yang, Jia-Bao
|
|
|
96-97 |
C |
p. 343-349
|
artikel
|
| 404 |
A note on the Steiner
k
-radius and Steiner
k
-diameter
|
Reiswig, Josiah
|
|
|
96-97 |
C |
p. 13-20
|
artikel
|
| 405 |
A note on the triameter of graphs
|
Hak, Artem
|
|
|
96-97 |
C |
p. 278-284
|
artikel
|
| 406 |
A note on Topological indices and coindices of disjunction and symmetric difference of graphs
|
Alameri, Abdu
|
|
|
96-97 |
C |
p. 230-235
|
artikel
|
| 407 |
A note on total domination and 2-rainbow domination in graphs
|
Furuya, Michitaka
|
|
2015
|
96-97 |
C |
p. 229-230
2 p.
|
artikel
|
| 408 |
A note on universal graphs for spanning trees
|
Győri, Ervin
|
|
|
96-97 |
C |
p. 146-147
|
artikel
|
| 409 |
A note on visibility-constrained Voronoi diagrams
|
Aurenhammer, F.
|
|
2014
|
96-97 |
C |
p. 52-56
5 p.
|
artikel
|
| 410 |
A notion of vertex equitability for proper labellings
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 228-247
|
artikel
|
| 411 |
An outer-approximation algorithm for maximum-entropy sampling
|
Fampa, Marcia
|
|
|
96-97 |
C |
p. 271-284
|
artikel
|
| 412 |
An overview of
(
κ
,
τ
)
-regular sets and their applications
|
Cardoso, Domingos M.
|
|
2019
|
96-97 |
C |
p. 2-10
|
artikel
|
| 413 |
Anticoloring of the rook’s graph
|
Berend, Daniel
|
|
2015
|
96-97 |
C |
p. 1-15
15 p.
|
artikel
|
| 414 |
Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
|
Jiménez, Andrea
|
|
2014
|
96-97 |
C |
p. 45-61
17 p.
|
artikel
|
| 415 |
Anti-forcing numbers of perfect matchings of graphs
|
Lei, Hongchuan
|
|
2016
|
96-97 |
C |
p. 95-105
11 p.
|
artikel
|
| 416 |
Anti-forcing polynomials for benzenoid systems with forcing edges
|
Zhao, Shuang
|
|
2018
|
96-97 |
C |
p. 342-356
|
artikel
|
| 417 |
Antimagic labeling for subdivisions of graphs
|
Li, Wei-Tian
|
|
|
96-97 |
C |
p. 215-223
|
artikel
|
| 418 |
Antimagic labeling of biregular bipartite graphs
|
Yu, Xiaowei
|
|
|
96-97 |
C |
p. 47-59
|
artikel
|
| 419 |
Antimagic labeling of forests with sets of consecutive integers
|
Dhananjaya, Eranda
|
|
|
96-97 |
C |
p. 75-84
|
artikel
|
| 420 |
Antimagic orientation of lobsters
|
Gao, Yuping
|
|
|
96-97 |
C |
p. 21-26
|
artikel
|
| 421 |
Antimagic orientation of subdivided caterpillars
|
Ferraro, Jessica
|
|
|
96-97 |
C |
p. 45-52
|
artikel
|
| 422 |
Antimagic orientations of graphs with given independence number
|
Song, Zi-Xia
|
|
|
96-97 |
C |
p. 163-170
|
artikel
|
| 423 |
Antimatroids induced by matchings
|
Kawase, Yasushi
|
|
2019
|
96-97 |
C |
p. 342-349
|
artikel
|
| 424 |
Anti-Ramsey number of matchings in outerplanar graphs
|
Jin, Zemin
|
|
|
96-97 |
C |
p. 125-135
|
artikel
|
| 425 |
Anti-Ramsey numbers for cycles in
n
-prisms
|
Li, Yibo
|
|
|
96-97 |
C |
p. 1-8
|
artikel
|
| 426 |
Anti-Ramsey threshold of cycles
|
Barros, Gabriel Ferreira
|
|
|
96-97 |
C |
p. 228-235
|
artikel
|
| 427 |
An upper bound of
Δ
(
E
)
<
3
∕
2
for skiving stock instances of the divisible case
|
Martinovic, J.
|
|
2017
|
96-97 |
C |
p. 161-167
7 p.
|
artikel
|
| 428 |
An upper bound on the extremal version of Hajnal’s triangle-free game
|
Biró, Csaba
|
|
2016
|
96-97 |
C |
p. 20-28
9 p.
|
artikel
|
| 429 |
An upper bound on the sum of powers of the degrees of simple 1-planar graphs
|
Czap, Július
|
|
2014
|
96-97 |
C |
p. 146-151
6 p.
|
artikel
|
| 430 |
An upper bound on Wiener Indices of maximal planar graphs
|
Che, Zhongyuan
|
|
2019
|
96-97 |
C |
p. 76-86
|
artikel
|
| 431 |
A parallel algorithm for constructing independent spanning trees in twisted cubes
|
Chang, Jou-Ming
|
|
2017
|
96-97 |
C |
p. 74-82
9 p.
|
artikel
|
| 432 |
A parameterization for a class of complete games with abstention
|
Freixas, Josep
|
|
2019
|
96-97 |
C |
p. 21-39
|
artikel
|
| 433 |
A parity theorem about trees with specified degrees
|
Cameron, Kathie
|
|
|
96-97 |
C |
p. 48-55
|
artikel
|
| 434 |
A
P
3
⃗
-decomposition of tournaments and bipartite digraphs
|
Wang, Fangxia
|
|
2017
|
96-97 |
C |
p. 158-165
8 p.
|
artikel
|
| 435 |
A permutation code preserving a double Eulerian bistatistic
|
Baril, Jean-Luc
|
|
2017
|
96-97 |
C |
p. 9-15
7 p.
|
artikel
|
| 436 |
A point–plane incidence theorem in matrix rings
|
Nguyen, The
|
|
|
96-97 |
C |
p. 166-170
|
artikel
|
| 437 |
A polyhedral investigation of star colorings
|
Hojny, Christopher
|
|
2016
|
96-97 |
C |
p. 59-78
20 p.
|
artikel
|
| 438 |
A polyhedral model for enumeration and optimization over the set of circuits
|
Borgwardt, Steffen
|
|
|
96-97 |
C |
p. 68-83
|
artikel
|
| 439 |
A polyhedral study of the diameter constrained minimum spanning tree problem
|
Gouveia, Luis
|
|
|
96-97 |
C |
p. 364-379
|
artikel
|
| 440 |
A polyhedral study of the maximum-impact coloring problem on hypergraphs
|
Singer, Jessica
|
|
|
96-97 |
C |
p. 105-121
|
artikel
|
| 441 |
A polyhedral study of the maximum stable set problem with weights on vertex-subsets
|
Campêlo, Manoel
|
|
2016
|
96-97 |
C |
p. 223-234
|
artikel
|
| 442 |
A polyhedral view to a generalization of multiple domination
|
Neto, José
|
|
|
96-97 |
C |
p. 1-17
|
artikel
|
| 443 |
A polynomial algorithm for convex quadratic optimization subject to linear inequalities
|
Chubanov, Sergei
|
|
|
96-97 |
C |
p. 19-28
|
artikel
|
| 444 |
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
|
Veselov, S.I.
|
|
|
96-97 |
C |
p. 11-19
|
artikel
|
| 445 |
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
|
Chrétienne, Philippe
|
|
2018
|
96-97 |
C |
p. 132-139
|
artikel
|
| 446 |
A polynomial algorithm for weighted scattering number in interval graphs
|
Li, Fengwei
|
|
2019
|
96-97 |
C |
p. 118-124
|
artikel
|
| 447 |
A polynomial recognition of unit forms using graph-based strategies
|
Alves, Jesmmer
|
|
2019
|
96-97 |
C |
p. 61-72
|
artikel
|
| 448 |
A polynomial time algorithm for the triangle packing problem on interval graphs
|
Myung, Young-Soo
|
|
|
96-97 |
C |
p. 180-183
|
artikel
|
| 449 |
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph
|
Mescoff, Guillaume
|
|
|
96-97 |
C |
p. 72-85
|
artikel
|
| 450 |
A PPA parity theorem about trees in a bipartite graph
|
Cameron, Kathie
|
|
|
96-97 |
C |
p. 107-110
|
artikel
|
| 451 |
Application of coding theory to interconnection networks
|
Zémor, Gilles
|
|
1992
|
96-97 |
C |
p. 553-562
10 p.
|
artikel
|
| 452 |
Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs
|
Felisiak, Mariusz
|
|
2015
|
96-97 |
C |
p. 49-64
16 p.
|
artikel
|
| 453 |
Applications of max-plus algebra to flow shop scheduling problems
|
Kubo, Susumu
|
|
|
96-97 |
C |
p. 278-293
|
artikel
|
| 454 |
Approximability of guarding weak visibility polygons
|
Bhattacharya, Pritam
|
|
2017
|
96-97 |
C |
p. 109-129
21 p.
|
artikel
|
| 455 |
Approximability of the dispersed
p
→
-neighbor
k
-supplier problem
|
van Ee, Martijn
|
|
|
96-97 |
C |
p. 219-229
|
artikel
|
| 456 |
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
|
Kosuch, Stefanie
|
|
2014
|
96-97 |
C |
p. 192-204
13 p.
|
artikel
|
| 457 |
Approximate association via dissociation
|
You, Jie
|
|
2017
|
96-97 |
C |
p. 202-209
8 p.
|
artikel
|
| 458 |
Approximate envy-freeness in graphical cake cutting
|
Yuen, Sheung Man
|
|
|
96-97 |
C |
p. 112-131
|
artikel
|
| 459 |
Approximate robust optimization for the Connected Facility Location problem
|
Bardossy, M. Gisela
|
|
2016
|
96-97 |
C |
p. 246-260
|
artikel
|
| 460 |
Approximate tradeoffs on weighted labeled matroids
|
Gourvès, Laurent
|
|
2015
|
96-97 |
C |
p. 154-166
13 p.
|
artikel
|
| 461 |
Approximating 2-cliques in unit disk graphs
|
Pattillo, Jeffrey
|
|
2014
|
96-97 |
C |
p. 178-187
10 p.
|
artikel
|
| 462 |
Approximating connected safe sets in weighted trees
|
Ehard, Stefan
|
|
|
96-97 |
C |
p. 216-223
|
artikel
|
| 463 |
Approximating Graphic Min-Max and Minimum Cycle/Path/Tree Cover Problems
|
Yu, Wei
|
|
|
96-97 |
C |
p. 314-323
|
artikel
|
| 464 |
Approximating maximum uniquely restricted matchings in bipartite graphs
|
Baste, Julien
|
|
2019
|
96-97 |
C |
p. 30-40
|
artikel
|
| 465 |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
|
Otachi, Yota
|
|
2014
|
96-97 |
C |
p. 69-77
9 p.
|
artikel
|
| 466 |
Approximating weighted induced matchings
|
Lin, Min Chih
|
|
2018
|
96-97 |
C |
p. 304-310
|
artikel
|
| 467 |
Approximation algorithm for (connected) Italian dominating function
|
Li, Ke
|
|
|
96-97 |
C |
p. 169-179
|
artikel
|
| 468 |
Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
|
Jiang, Hongyi
|
|
|
96-97 |
C |
p. 383-399
|
artikel
|
| 469 |
Approximation algorithm for minimum connected 3-path vertex cover
|
Liu, Pengcheng
|
|
|
96-97 |
C |
p. 77-84
|
artikel
|
| 470 |
Approximation algorithm for prize-collecting weighted set cover with fairness constraints
|
Zhou, Mingchao
|
|
|
96-97 |
C |
p. 301-315
|
artikel
|
| 471 |
Approximation algorithm for squared metric facility location problem with nonuniform capacities
|
Xu, Yicheng
|
|
2019
|
96-97 |
C |
p. 208-217
|
artikel
|
| 472 |
1.5-approximation algorithm for the
2
-Convex Recoloring problem
|
Bar-Yehuda, Reuven
|
|
2018
|
96-97 |
C |
p. 2-11
|
artikel
|
| 473 |
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
|
Lai, Xiaoyan
|
|
|
96-97 |
C |
p. 48-68
|
artikel
|
| 474 |
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
|
Elbassioni, Khaled
|
|
2017
|
96-97 |
C |
p. 56-70
15 p.
|
artikel
|
| 475 |
Approximation algorithms for minimum (weight) connected
k
-path vertex cover
|
Li, Xiaosong
|
|
2016
|
96-97 |
C |
p. 101-108
8 p.
|
artikel
|
| 476 |
Approximation algorithms for orthogonal line centers
|
Das, Arun Kumar
|
|
|
96-97 |
C |
p. 69-76
|
artikel
|
| 477 |
Approximation algorithms for some Minimum Postmen Cover Problems
|
Mao, Yuying
|
|
|
96-97 |
C |
p. 382-393
|
artikel
|
| 478 |
Approximation algorithms for some position-dependent scheduling problems
|
Yang, Liya
|
|
|
96-97 |
C |
p. 22-31
|
artikel
|
| 479 |
Approximation algorithms for the fault-tolerant facility location problem with penalties
|
Ji, Sai
|
|
2019
|
96-97 |
C |
p. 62-75
|
artikel
|
| 480 |
Approximation of the parallel machine scheduling problem with additional unit resources
|
Hebrard, Emmanuel
|
|
2016
|
96-97 |
C |
p. 126-135
10 p.
|
artikel
|
| 481 |
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
|
Chaplick, Steven
|
|
|
96-97 |
C |
p. 275-281
|
artikel
|
| 482 |
A primal–dual approximation algorithm for Minsat
|
Arif, Umair
|
|
|
96-97 |
C |
p. 372-381
|
artikel
|
| 483 |
A priori TSP in the scenario model
|
van Ee, Martijn
|
|
2018
|
96-97 |
C |
p. 331-341
|
artikel
|
| 484 |
A probabilistic algorithm for bounding the total restrained domination number of a
K
1
,
ℓ
-free graph
|
Joubert, Ernst J.
|
|
|
96-97 |
C |
p. 429-439
|
artikel
|
| 485 |
A procedural egalitarian solution for NTU-games
|
Dietzenbacher, Bas
|
|
|
96-97 |
C |
p. 20-27
|
artikel
|
| 486 |
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
|
Figueroa González, José Luis
|
|
|
96-97 |
C |
p. 350-368
|
artikel
|
| 487 |
A proof for a conjecture of Gorgol
|
Campos, V.
|
|
2018
|
96-97 |
C |
p. 202-207
|
artikel
|
| 488 |
A proof of a conjecture on the differential of a subcubic graph
|
Khoeilar, R.
|
|
|
96-97 |
C |
p. 27-39
|
artikel
|
| 489 |
A proof of the conjecture regarding the sum of domination number and average eccentricity
|
Du, Zhibin
|
|
2016
|
96-97 |
C |
p. 105-113
9 p.
|
artikel
|
| 490 |
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
|
Shabtay, Dvir
|
|
2015
|
96-97 |
C |
p. 115-121
7 p.
|
artikel
|
| 491 |
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
|
Ravelo, S.V.
|
|
2017
|
96-97 |
C |
p. 158-175
18 p.
|
artikel
|
| 492 |
A quadratic algorithm for road coloring
|
Béal, Marie-Pierre
|
|
2014
|
96-97 |
C |
p. 15-29
15 p.
|
artikel
|
| 493 |
A quadratic simplex algorithm for primal optimization over zero-one polytopes
|
Mallach, Sven
|
|
|
96-97 |
C |
p. 285-296
|
artikel
|
| 494 |
A quasi-quadratic vertex-kernel for Cograph Edge Editing
|
Crespelle, Christophe
|
|
|
96-97 |
C |
p. 282-296
|
artikel
|
| 495 |
A quick way to verify if a graph is 3-colorable
|
Cordero-Michel, Narda
|
|
|
96-97 |
C |
p. 176-185
|
artikel
|
| 496 |
A random model of publication activity
|
Backhausz, Ágnes
|
|
2014
|
96-97 |
C |
p. 78-89
12 p.
|
artikel
|
| 497 |
Arbitrarily edge-partitionable graphs
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 428-442
|
artikel
|
| 498 |
Arc-disjoint in- and out-branchings in semicomplete split digraphs
|
Ai, Jiangdong
|
|
|
96-97 |
C |
p. 259-268
|
artikel
|
| 499 |
Are all pairs of hypomorphic digraphs S-isomorphic?
|
Ramachandran, S.
|
|
|
96-97 |
C |
p. 556-563
|
artikel
|
| 500 |
A recognition algorithm for adjusted interval digraphs
|
Takaoka, Asahi
|
|
|
96-97 |
C |
p. 253-256
|
artikel
|
| 501 |
A recognition algorithm for simple-triangle graphs
|
Takaoka, Asahi
|
|
|
96-97 |
C |
p. 196-207
|
artikel
|
| 502 |
A reduction algorithm for the weighted stable set problem in claw-free graphs
|
Nobili, Paolo
|
|
2014
|
96-97 |
C |
p. 245-262
18 p.
|
artikel
|
| 503 |
A refined result on cross-intersecting families
|
Wu, Biao
|
|
|
96-97 |
C |
p. 149-153
|
artikel
|
| 504 |
Are hitting formulas hard for resolution?
|
Peitl, Tomáš
|
|
|
96-97 |
C |
p. 173-184
|
artikel
|
| 505 |
A relation between proximity and the third largest distance eigenvalue of a graph
|
Mojallal, Seyed Ahmad
|
|
|
96-97 |
C |
p. 50-58
|
artikel
|
| 506 |
A remark on random 2-SAT
|
Goerdt, Andreas
|
|
1999
|
96-97 |
C |
p. 107-110
4 p.
|
artikel
|
| 507 |
A resource-frugal probabilistic dictionary and applications in bioinformatics
|
Marchet, Camille
|
|
|
96-97 |
C |
p. 92-102
|
artikel
|
| 508 |
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
|
Bensmail, Julien
|
|
2019
|
96-97 |
C |
p. 31-39
|
artikel
|
| 509 |
A robber locating strategy for trees
|
Brandt, A.
|
|
2017
|
96-97 |
C |
p. 99-106
|
artikel
|
| 510 |
A rounding theorem for unique binary tomographic reconstruction
|
Dulio, Paolo
|
|
2019
|
96-97 |
C |
p. 54-69
|
artikel
|
| 511 |
Arrival time dependent routing policies in public transport
|
Bérczi, Kristóf
|
|
2018
|
96-97 |
C |
p. 93-102
|
artikel
|
| 512 |
A sharp lower bound of the spectral radius with application to the energy of a graph
|
Guo, Ji-Ming
|
|
|
96-97 |
C |
p. 59-63
|
artikel
|
| 513 |
A sharp lower bound on the number of non-equivalent colorings of graphs of order
n
and maximum degree
n
−
3
|
Absil, Romain
|
|
2018
|
96-97 |
C |
p. 3-11
|
artikel
|
| 514 |
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
|
Choi, Ilkyoo
|
|
|
96-97 |
C |
p. 178-182
|
artikel
|
| 515 |
A short note on supersaturation for oddtown and eventown
|
O’Neill, Jason
|
|
|
96-97 |
C |
p. 63-67
|
artikel
|
| 516 |
A short note on the existence of infinite sequences of
γ
-graphs of graphs
|
Finbow, Stephen
|
|
|
96-97 |
C |
p. 182-187
|
artikel
|
| 517 |
A short note on: There is no graph
G
with
G
S
R
≅
K
r
,
s
,
r
,
s
≥
2
|
Lenin, R.
|
|
2019
|
96-97 |
C |
p. 204-205
|
artikel
|
| 518 |
A short note on the sum of
k
largest distance eigenvalues of bipartite graphs
|
Lu, Junying
|
|
|
96-97 |
C |
p. 249-251
|
artikel
|
| 519 |
A simple algorithm and min–max formula for the inverse arborescence problem
|
Frank, András
|
|
|
96-97 |
C |
p. 85-93
|
artikel
|
| 520 |
A simple algorithm for secure domination in proper interval graphs
|
Zou, Y.H.
|
|
2019
|
96-97 |
C |
p. 289-293
|
artikel
|
| 521 |
A simplified algorithm computing all
s
-
t
bridges and articulation points
|
Cairo, Massimo
|
|
|
96-97 |
C |
p. 103-108
|
artikel
|
| 522 |
A simplified graph parameter and its relationship to the modified Randić index
|
Lin, Dazhi
|
|
|
96-97 |
C |
p. 60-64
|
artikel
|
| 523 |
A single axiom for Boolean algebras
|
Kwuida, Léonard
|
|
2018
|
96-97 |
C |
p. 85-90
|
artikel
|
| 524 |
A single machine scheduling with generalized and periodic due dates to minimize total deviation
|
Choi, Byung-Cheon
|
|
|
96-97 |
C |
p. 31-52
|
artikel
|
| 525 |
A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty
|
Brauner, Nadia
|
|
|
96-97 |
C |
p. 106-112
|
artikel
|
| 526 |
A single shuffle is enough for secure card-based computation of any Boolean circuit
|
Shinagawa, Kazumasa
|
|
|
96-97 |
C |
p. 248-261
|
artikel
|
| 527 |
A smaller extended formulation for the odd cycle inequalities of the stable set polytope
|
de Vries, Sven
|
|
|
96-97 |
C |
p. 14-21
|
artikel
|
| 528 |
A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers
R
(
3
,
k
)
|
Zhu, Rujie
|
|
2016
|
96-97 |
C |
p. 216-221
6 p.
|
artikel
|
| 529 |
A spectral condition for a graph to have strong parity factors
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 188-195
|
artikel
|
| 530 |
Aspects of upper defensive alliances
|
Bazgan, Cristina
|
|
2019
|
96-97 |
C |
p. 111-120
|
artikel
|
| 531 |
Assessing the effect of multiple cost changes using reverse set tolerances
|
Jäger, Gerold
|
|
|
96-97 |
C |
p. 279-300
|
artikel
|
| 532 |
Assistance and interdiction problems on interval graphs
|
Hoang, Hung P.
|
|
|
96-97 |
C |
p. 153-170
|
artikel
|
| 533 |
A stability result for Berge-
K
3
,
t
r
-graphs and its applications
|
Zhou, Junpeng
|
|
|
96-97 |
C |
p. 331-342
|
artikel
|
| 534 |
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
|
Błażewicz, Jacek
|
|
2015
|
96-97 |
C |
p. 72-82
11 p.
|
artikel
|
| 535 |
A study on load-balanced variants of the bin packing problem
|
Castro-Silva, D.
|
|
2019
|
96-97 |
C |
p. 4-14
|
artikel
|
| 536 |
A subexponential-time algorithm for the Maximum Independent Set Problem in
P
t
-free graphs
|
Brause, Christoph
|
|
2017
|
96-97 |
C |
p. 113-118
6 p.
|
artikel
|
| 537 |
A sufficient condition for a planar graph to be
4
-choosable
|
Xu, Renyu
|
|
2017
|
96-97 |
C |
p. 120-122
3 p.
|
artikel
|
| 538 |
A sufficient condition for a planar graph to be
(
F
,
F
2
)
-partitionable
|
Liu, Runrun
|
|
|
96-97 |
C |
p. 61-68
|
artikel
|
| 539 |
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
|
Lu, Zhengrong
|
|
|
96-97 |
C |
p. 67-70
|
artikel
|
| 540 |
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
|
Zhu, Enqiang
|
|
2017
|
96-97 |
C |
p. 148-153
6 p.
|
artikel
|
| 541 |
A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in
R
2
|
Guler, Hakan
|
|
|
96-97 |
C |
p. 37-46
|
artikel
|
| 542 |
A sufficient
Q
-spectral condition for a graph to be
β
-deficient involving minimum degree
|
Liu, Weijun
|
|
2019
|
96-97 |
C |
p. 158-167
|
artikel
|
| 543 |
A survey-based approach for designing the lines of a rapid transit network
|
Escudero, L.F.
|
|
2016
|
96-97 |
C |
p. 14-34
|
artikel
|
| 544 |
A survey of integrity
|
Bagga, K.S.
|
|
1992
|
96-97 |
C |
p. 13-28
16 p.
|
artikel
|
| 545 |
A survey on conflict-free connection coloring of graphs
|
Chang, Hong
|
|
|
96-97 |
C |
p. 88-104
|
artikel
|
| 546 |
A survey on flows in graphs and matroids
|
Guenin, Bertrand
|
|
2016
|
96-97 |
C |
p. 122-132
11 p.
|
artikel
|
| 547 |
A survey on rainbow (vertex-)index of graphs
|
Zhao, Yan
|
|
|
96-97 |
C |
p. 96-105
|
artikel
|
| 548 |
Asymmetric colorings of products of graphs and digraphs
|
Broere, Izak
|
|
2019
|
96-97 |
C |
p. 56-64
|
artikel
|
| 549 |
A symmetry-free polynomial formulation of the capacitated vehicle routing problem
|
Gadegaard, S.L.
|
|
|
96-97 |
C |
p. 179-192
|
artikel
|
| 550 |
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
|
Maurer, Ueli M.
|
|
1992
|
96-97 |
C |
p. 421-436
16 p.
|
artikel
|
| 551 |
Asymptotic enumeration of perfect matchings in
m
-barrel fullerene graphs
|
Behmaram, Afshin
|
|
2019
|
96-97 |
C |
p. 153-162
|
artikel
|
| 552 |
Asymptotic results on weakly increasing subsequences in random words
|
Işlak, Ümi̇t
|
|
2018
|
96-97 |
C |
p. 171-189
|
artikel
|
| 553 |
Asymptotic surviving rate of trees with multiple fire sources
|
Costa, Vitor
|
|
2015
|
96-97 |
C |
p. 14-19
6 p.
|
artikel
|
| 554 |
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
|
Zhu, Linya
|
|
|
96-97 |
C |
p. 181-190
|
artikel
|
| 555 |
A ternary search problem on two disjoint sets
|
Li, Shengjia
|
|
2018
|
96-97 |
C |
p. 221-235
|
artikel
|
| 556 |
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
|
Vernet, Mathilde
|
|
|
96-97 |
C |
p. 203-216
|
artikel
|
| 557 |
A theoretical investigation on the distinguishers of Salsa and ChaCha
|
Dey, Sabyasachi
|
|
|
96-97 |
C |
p. 147-162
|
artikel
|
| 558 |
A three-person deterministic graphical game without Nash equilibria
|
Boros, Endre
|
|
2018
|
96-97 |
C |
p. 21-38
|
artikel
|
| 559 |
A tie-break model for graph search
|
Corneil, Derek G.
|
|
2016
|
96-97 |
C |
p. 89-100
12 p.
|
artikel
|
| 560 |
A tight analysis of the Submodular–Supermodular Procedure
|
Byrnes, Kevin M.
|
|
2015
|
96-97 |
C |
p. 275-282
8 p.
|
artikel
|
| 561 |
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
|
Pilipczuk, Marcin
|
|
2017
|
96-97 |
C |
p. 211-216
6 p.
|
artikel
|
| 562 |
A tight lower bound on non-adaptive group testing estimation
|
Bshouty, Nader H.
|
|
|
96-97 |
C |
p. 1-15
|
artikel
|
| 563 |
A tree distinguishing polynomial
|
Liu, Pengyu
|
|
|
96-97 |
C |
p. 1-8
|
artikel
|
| 564 |
A Triangle-free, 4-chromatic
Q
3
Euclidean distance graph Scavenger hunt!
|
Joe, Jonathan
|
|
|
96-97 |
C |
p. 216-226
|
artikel
|
| 565 |
A two-commodity flow formulation for the capacitated truck-and-trailer routing problem
|
Bartolini, E.
|
|
|
96-97 |
C |
p. 3-18
|
artikel
|
| 566 |
A type of generalized mesh-star transformation and applications in electrical networks
|
Cheng, Sujing
|
|
|
96-97 |
C |
p. 259-269
|
artikel
|
| 567 |
Augmenting the algebraic connectivity for certain families of graphs
|
Justel, Claudia
|
|
2019
|
96-97 |
C |
p. 51-60
|
artikel
|
| 568 |
A unified construction of weightwise perfectly balanced Boolean functions
|
Zhao, Qinglan
|
|
|
96-97 |
C |
p. 190-201
|
artikel
|
| 569 |
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
|
Warwicker, John Alasdair
|
|
|
96-97 |
C |
p. 15-36
|
artikel
|
| 570 |
A universal tree-based network with the minimum number of reticulations
|
Bordewich, Magnus
|
|
2018
|
96-97 |
C |
p. 357-362
|
artikel
|
| 571 |
Automated generation of conjectures on forbidden subgraph characterization
|
Desrosiers, Christian
|
|
2014
|
96-97 |
C |
p. 177-194
18 p.
|
artikel
|
| 572 |
Automatic complexity of Fibonacci and Tribonacci words
|
Kjos-Hanssen, Bjørn
|
|
|
96-97 |
C |
p. 446-454
|
artikel
|
| 573 |
Automating weight function generation in graph pebbling
|
Flocco, Dominic
|
|
|
96-97 |
C |
p. 155-174
|
artikel
|
| 574 |
Automorphism group of a graph related to zero-divisor graphs
|
Xu, Songnian
|
|
|
96-97 |
C |
p. 35-43
|
artikel
|
| 575 |
Autotopism stabilized colouring games on rook’s graphs
|
Falcón, Raúl M.
|
|
2019
|
96-97 |
C |
p. 200-212
|
artikel
|
| 576 |
A value for cooperative games on simplicial complexes with a filtration
|
Rodríguez-Gómez, J.C.
|
|
|
96-97 |
C |
p. 1-14
|
artikel
|
| 577 |
A variant of
k
-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing
|
Foulds, Leslie R.
|
|
2015
|
96-97 |
C |
p. 123-144
22 p.
|
artikel
|
| 578 |
A variation on bisecting the binomial coefficients
|
Ionaşcu, Eugen J.
|
|
2018
|
96-97 |
C |
p. 276-284
|
artikel
|
| 579 |
AVD-total-colouring of complete equipartite graphs
|
Luiz, Atílio G.
|
|
2015
|
96-97 |
C |
p. 189-195
7 p.
|
artikel
|
| 580 |
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set
|
Denat, Tom
|
|
|
96-97 |
C |
p. 4-8
|
artikel
|
| 581 |
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
|
Casablanca, Rocío M.
|
|
|
96-97 |
C |
p. 233-247
|
artikel
|
| 582 |
Averaging 2-rainbow domination and Roman domination
|
Alvarado, José D.
|
|
2016
|
96-97 |
C |
p. 202-207
6 p.
|
artikel
|
| 583 |
A Vizing-like theorem for union vertex-distinguishing edge coloring
|
Bousquet, Nicolas
|
|
2017
|
96-97 |
C |
p. 88-98
|
artikel
|
| 584 |
A Vizing-type result for semi-total domination
|
Asplund, John
|
|
2019
|
96-97 |
C |
p. 8-12
|
artikel
|
| 585 |
Avoidable vertices and edges in graphs: Existence, characterization, and applications
|
Beisegel, Jesse
|
|
|
96-97 |
C |
p. 285-300
|
artikel
|
| 586 |
A weak DP-coloring of planar graphs without 4- and 9-cycles
|
Xiao, Yang
|
|
|
96-97 |
C |
p. 391-397
|
artikel
|
| 587 |
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
|
Das, Sandip
|
|
|
96-97 |
C |
p. 44-61
|
artikel
|
| 588 |
Axiomatic characterization of the center function. The case of non-universal axioms
|
Changat, Manoj
|
|
2018
|
96-97 |
C |
p. 56-69
|
artikel
|
| 589 |
Axiomatic characterization of the center function. The case of universal axioms
|
Changat, Manoj
|
|
2017
|
96-97 |
C |
p. 44-57
|
artikel
|
| 590 |
Axiomatic characterization of the interval function of a bipartite graph
|
Changat, Manoj
|
|
|
96-97 |
C |
p. 19-28
|
artikel
|
| 591 |
Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
|
Changat, Manoj
|
|
2017
|
96-97 |
C |
p. 50-59
10 p.
|
artikel
|
| 592 |
Axiomatizing the Public Good Index via merging and new arrival properties
|
Safokem, Adin
|
|
|
96-97 |
C |
p. 86-102
|
artikel
|
| 593 |
Backbone coloring of graphs with galaxy backbones
|
Araújo, C.S.
|
|
|
96-97 |
C |
p. 2-13
|
artikel
|
| 594 |
Badly-covered graphs
|
Cappelle, Márcia R.
|
|
2015
|
96-97 |
C |
p. 99-103
5 p.
|
artikel
|
| 595 |
Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
|
Wang, Qichun
|
|
2014
|
96-97 |
C |
p. 25-32
8 p.
|
artikel
|
| 596 |
Balanced compact clustering for efficient range queries in metric spaces
|
Ceselli, Alberto
|
|
2014
|
96-97 |
C |
p. 43-67
25 p.
|
artikel
|
| 597 |
Balanced flows for transshipment problems
|
Gurvich, Vladimir
|
|
|
96-97 |
C |
p. 214-220
|
artikel
|
| 598 |
Balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
|
Guo, Fei
|
|
|
96-97 |
C |
p. 18-28
|
artikel
|
| 599 |
Balanced partitions of 3-colored geometric sets in the plane
|
Bereg, Sergey
|
|
2015
|
96-97 |
C |
p. 21-32
12 p.
|
artikel
|
| 600 |
Balanced
2
p
-variable rotation symmetric Boolean functions with optimal algebraic immunity
|
Sun, Lei
|
|
2016
|
96-97 |
C |
p. 20-30
11 p.
|
artikel
|
| 601 |
Bandwidth allocation in cellular networks with multiple interferences
|
Bar-Yehuda, Reuven
|
|
2015
|
96-97 |
C |
p. 23-36
14 p.
|
artikel
|
| 602 |
Base graph–connection graph: Dissection and construction
|
Potočnik, Primož
|
|
|
96-97 |
C |
p. 116-128
|
artikel
|
| 603 |
Best monotone degree conditions for binding number and cycle structure
|
Bauer, D.
|
|
2015
|
96-97 |
C |
p. 8-17
10 p.
|
artikel
|
| 604 |
Best second order bounds for two-terminal network reliability with dependent edge failures
|
Hansen, Pierre
|
|
1999
|
96-97 |
C |
p. 375-393
19 p.
|
artikel
|
| 605 |
Betweenness structures of small linear co-size
|
Szabó, Péter G.N.
|
|
|
96-97 |
C |
p. 404-424
|
artikel
|
| 606 |
Bichain graphs: Geometric model and universal graphs
|
Brignall, Robert
|
|
2016
|
96-97 |
C |
p. 16-29
14 p.
|
artikel
|
| 607 |
Biclique-colouring verification complexity and biclique-colouring power graphs
|
Macêdo Filho, H.B.
|
|
2015
|
96-97 |
C |
p. 65-76
12 p.
|
artikel
|
| 608 |
Biclique graphs of interval bigraphs
|
Cruz, E.P.
|
|
|
96-97 |
C |
p. 134-143
|
artikel
|
| 609 |
Biclique graphs of split graphs
|
Groshaus, M.
|
|
|
96-97 |
C |
p. 252-267
|
artikel
|
| 610 |
Bicritical graphs without removable edges
|
Zhang, Yipei
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 611 |
Bicrucial
k
-power-free permutations
|
Akhmejanova, Margarita
|
|
|
96-97 |
C |
p. 232-239
|
artikel
|
| 612 |
Bicyclic graphs with maximal edge revised Szeged index
|
Liu, Mengmeng
|
|
2016
|
96-97 |
C |
p. 225-230
6 p.
|
artikel
|
| 613 |
Bicyclic signed graphs with at most one odd cycle and maximal energy
|
Wang, Dijian
|
|
2019
|
96-97 |
C |
p. 244-255
|
artikel
|
| 614 |
Bidirectional adaptive compression
|
Fruchtman, Aharon
|
|
|
96-97 |
C |
p. 40-50
|
artikel
|
| 615 |
Bidual Horn functions and extensions
|
Eiter, Thomas
|
|
1999
|
96-97 |
C |
p. 55-88
34 p.
|
artikel
|
| 616 |
Bigraphic pairs with an
A
-connected realization
|
Guan, Jing-Xin
|
|
2018
|
96-97 |
C |
p. 75-81
|
artikel
|
| 617 |
Bijective counting of humps and peaks in
(
k
,
a
)
-paths
|
Yan, Sherry H.F.
|
|
2015
|
96-97 |
C |
p. 208-212
5 p.
|
artikel
|
| 618 |
Bilinear maps and graphs
|
Martín, Antonio J. Calderón
|
|
2019
|
96-97 |
C |
p. 69-78
|
artikel
|
| 619 |
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
|
Goubko, Mikhail
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 620 |
Binary action games: Deviation properties, semi-strict equilibria and potentials
|
Iimura, Takuya
|
|
2018
|
96-97 |
C |
p. 57-68
|
artikel
|
| 621 |
Binary linear programming models for robust broadcasting in communication networks
|
McGarvey, Ronald G.
|
|
2016
|
96-97 |
C |
p. 173-184
12 p.
|
artikel
|
| 622 |
Binary linear programming solutions and non-approximability for control problems in voting systems
|
Gurski, Frank
|
|
2014
|
96-97 |
C |
p. 391-398
8 p.
|
artikel
|
| 623 |
Binary set systems and totally balanced hypergraphs
|
Châtel, Célia
|
|
|
96-97 |
C |
p. 120-133
|
artikel
|
| 624 |
Binding number, odd
[
1
,
b
]
-factors and the distance spectral radius
|
Hu, Yanling
|
|
|
96-97 |
C |
p. 406-413
|
artikel
|
| 625 |
Binding numbers and restricted fractional
(
g
,
f
)
-factors in graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 350-356
|
artikel
|
| 626 |
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
|
Eschen, Elaine M.
|
|
|
96-97 |
C |
p. 97-112
|
artikel
|
| 627 |
Bipartite finite Toeplitz graphs
|
Nicoloso, Sara
|
|
2014
|
96-97 |
C |
p. 233-244
12 p.
|
artikel
|
| 628 |
Bipartite Ramsey numbers of paths for random graphs
|
Liu, Meng
|
|
2019
|
96-97 |
C |
p. 171-174
|
artikel
|
| 629 |
Bisecting and
D
-secting families for set systems
|
Balachandran, Niranjan
|
|
|
96-97 |
C |
p. 2-13
|
artikel
|
| 630 |
Bisecting binomial coefficients
|
Ionaşcu, Eugen J.
|
|
2017
|
96-97 |
C |
p. 70-83
|
artikel
|
| 631 |
2-bisections in claw-free cubic multigraphs
|
Cui, Qing
|
|
2019
|
96-97 |
C |
p. 325-330
|
artikel
|
| 632 |
Bisections of graphs without
K
2
,
l
|
Jin, Jing
|
|
2019
|
96-97 |
C |
p. 112-118
|
artikel
|
| 633 |
Block-indifference graphs: Characterization, structural and spectral properties
|
Abreu, Nair Maria Maia de
|
|
2019
|
96-97 |
C |
p. 60-67
|
artikel
|
| 634 |
Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3)
|
De Bruyn, Bart
|
|
2019
|
96-97 |
C |
p. 121-129
|
artikel
|
| 635 |
Blocking zero forcing processes in Cartesian products of graphs
|
Karst, Nathaniel
|
|
|
96-97 |
C |
p. 380-396
|
artikel
|
| 636 |
Bondage number of grid graphs
|
Dettlaff, Magda
|
|
2014
|
96-97 |
C |
p. 94-99
6 p.
|
artikel
|
| 637 |
Bondage number of the strong product of two trees
|
Zhao, Weisheng
|
|
2017
|
96-97 |
C |
p. 133-145
13 p.
|
artikel
|
| 638 |
Book drawings of complete bipartite graphs
|
de Klerk, Etienne
|
|
2014
|
96-97 |
C |
p. 80-93
14 p.
|
artikel
|
| 639 |
Boomerang uniformity of some classes of functions over finite fields
|
Garg, Kirpa
|
|
|
96-97 |
C |
p. 166-179
|
artikel
|
| 640 |
Borodin–Kostochka conjecture holds for
K
1
,
3
¯
-free graphs
|
Lan, Kaiyang
|
|
|
96-97 |
C |
p. 263-268
|
artikel
|
| 641 |
Boundary enumerator polynomial of hypercubes in Fibonacci cubes
|
Saygı, Elif
|
|
2019
|
96-97 |
C |
p. 191-199
|
artikel
|
| 642 |
Boundary-type sets in maximal outerplanar graphs
|
Allgeier, Benjamin
|
|
2019
|
96-97 |
C |
p. 163-170
|
artikel
|
| 643 |
Bounded-degree light approximate shortest-path trees in doubling metrics
|
Gudmundsson, Joachim
|
|
|
96-97 |
C |
p. 199-204
|
artikel
|
| 644 |
χ
-boundedness and related problems on graphs without long induced paths: A survey
|
Char, Arnab
|
|
|
96-97 |
C |
p. 99-119
|
artikel
|
| 645 |
Bounded quantifier depth spectrum for random uniform hypergraphs
|
Popova, S.N.
|
|
|
96-97 |
C |
p. 215-225
|
artikel
|
| 646 |
Bounding
ℓ
-edge-connectivity in edge-connectivity
|
Lin, Xiaoxia
|
|
|
96-97 |
C |
p. 350-356
|
artikel
|
| 647 |
Bounding the clique-width of
H
-free split graphs
|
Brandstädt, Andreas
|
|
2016
|
96-97 |
C |
p. 30-39
10 p.
|
artikel
|
| 648 |
Bounding the sum of the largest Laplacian eigenvalues of graphs
|
Rocha, I.
|
|
2014
|
96-97 |
C |
p. 95-103
9 p.
|
artikel
|
| 649 |
Bounding the sum of the largest signless Laplacian eigenvalues of a graph
|
Abiad, Aida
|
|
|
96-97 |
C |
p. 315-326
|
artikel
|
| 650 |
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
|
Foucaud, Florent
|
|
|
96-97 |
C |
p. 106-119
|
artikel
|
| 651 |
Bounds for boxicity of circular clique graphs and zero-divisor graphs
|
Kavaskar, T.
|
|
|
96-97 |
C |
p. 260-269
|
artikel
|
| 652 |
Bounds for eccentricity-based parameters of graphs
|
Tang, Yunfang
|
|
|
96-97 |
C |
p. 109-123
|
artikel
|
| 653 |
Bounds for the chromatic index of signed multigraphs
|
Steffen, Eckhard
|
|
|
96-97 |
C |
p. 185-189
|
artikel
|
| 654 |
Bounds for the chromatic number of some
p
K
2
-free graphs
|
Prashant, Athmakoori
|
|
|
96-97 |
C |
p. 99-108
|
artikel
|
| 655 |
Bounds for the connected domination number of maximal outerplanar graphs
|
Chen, Shao-Liang
|
|
|
96-97 |
C |
p. 235-244
|
artikel
|
| 656 |
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
|
Yang, Xiuwen
|
|
|
96-97 |
C |
p. 241-257
|
artikel
|
| 657 |
Bounds for the energy of weighted graphs
|
Ganie, Hilal A.
|
|
2019
|
96-97 |
C |
p. 91-101
|
artikel
|
| 658 |
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
|
Wang, Long
|
|
2014
|
96-97 |
C |
p. 276-281
6 p.
|
artikel
|
| 659 |
Bounds for the probability of union of events following monotonic distribution
|
Kumaran, V.
|
|
2017
|
96-97 |
C |
p. 98-119
22 p.
|
artikel
|
| 660 |
Bounds on Graceful
k
-colorings of graphs
|
Pantoja, Paola T.
|
|
|
96-97 |
C |
p. 218-231
|
artikel
|
| 661 |
Bounds on independent isolation in graphs
|
Boyer, Geoffrey
|
|
|
96-97 |
C |
p. 143-149
|
artikel
|
| 662 |
Bounds on Kemeny’s constant of trees with a prescribed matching number
|
Wang, Junming
|
|
|
96-97 |
C |
p. 121-131
|
artikel
|
| 663 |
Bounds on the
A
α
-spectral radius of uniform hypergraphs with some vertices deleted
|
Zhang, Peng-Li
|
|
|
96-97 |
C |
p. 1-16
|
artikel
|
| 664 |
Bounds on the average and minimum attendance in preference-based activity scheduling
|
Aronshtam, Lior
|
|
|
96-97 |
C |
p. 114-119
|
artikel
|
| 665 |
Bounds on the burning number
|
Bessy, Stéphane
|
|
2018
|
96-97 |
C |
p. 16-22
|
artikel
|
| 666 |
Bounds on the defect of an octahedron in a rational lattice
|
Fadin, Mikhail
|
|
|
96-97 |
C |
p. 102-105
|
artikel
|
| 667 |
Bounds on the differentiating-total domination number of a tree
|
Ning, Wenjie
|
|
2016
|
96-97 |
C |
p. 153-160
8 p.
|
artikel
|
| 668 |
Bounds on the disparity and separation of tournament solutions
|
Brandt, Felix
|
|
2015
|
96-97 |
C |
p. 41-49
9 p.
|
artikel
|
| 669 |
Bounds on the
2
-domination number
|
Bujtás, Csilla
|
|
2018
|
96-97 |
C |
p. 4-15
|
artikel
|
| 670 |
Bounds on the modified second Zagreb index
|
Ali, Akbar
|
|
|
96-97 |
C |
p. 385-390
|
artikel
|
| 671 |
Bounds on the
P
I
index of unicyclic and bicyclic graphs with given girth
|
Ma, Gang
|
|
2017
|
96-97 |
C |
p. 156-161
6 p.
|
artikel
|
| 672 |
Bounds on the spectral radius of uniform hypergraphs
|
Liu, Lele
|
|
2019
|
96-97 |
C |
p. 160-169
|
artikel
|
| 673 |
Bounds on weak roman and 2-rainbow domination numbers
|
Chellali, Mustapha
|
|
2014
|
96-97 |
C |
p. 27-32
6 p.
|
artikel
|
| 674 |
Branch-and-cut approaches for
p
-Cluster Editing
|
Bulhões, Teobaldo
|
|
2017
|
96-97 |
C |
p. 51-64
14 p.
|
artikel
|
| 675 |
Branchwidth is
(
1
,
g
)
-self-dual
|
Kontogeorgiou, Georgios
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 676 |
Broadcast domination and multipacking in strongly chordal graphs
|
Brewster, Richard C.
|
|
2019
|
96-97 |
C |
p. 108-118
|
artikel
|
| 677 |
Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
|
Harutyunyan, Hovhannes A.
|
|
|
96-97 |
C |
p. 56-67
|
artikel
|
| 678 |
Broadcasting and spanning trees in de Bruijn and Kautz networks
|
Heydemann, M.C.
|
|
1992
|
96-97 |
C |
p. 297-317
21 p.
|
artikel
|
| 679 |
Broadcasting in DMA-bound bounded degree graphs
|
Lazard, E.
|
|
1992
|
96-97 |
C |
p. 387-400
14 p.
|
artikel
|
| 680 |
Broadcasts on paths and cycles
|
Bouchouika, Sabrina
|
|
|
96-97 |
C |
p. 375-395
|
artikel
|
| 681 |
Brooks-type theorem for
r
-hued coloring of graphs
|
Jendrol’, Stanislav
|
|
|
96-97 |
C |
p. 129-134
|
artikel
|
| 682 |
Brushing without capacity restrictions
|
Bryant, Darryn
|
|
2014
|
96-97 |
C |
p. 33-45
13 p.
|
artikel
|
| 683 |
Brush your trees!
|
Penso, L.D.
|
|
2015
|
96-97 |
C |
p. 167-170
4 p.
|
artikel
|
| 684 |
Bubblesort, stacksort and their duals
|
Ferrari, Luca S.
|
|
2014
|
96-97 |
C |
p. 64-71
8 p.
|
artikel
|
| 685 |
Bumblebee visitation problem
|
Das, Sandip
|
|
|
96-97 |
C |
p. 27-41
|
artikel
|
| 686 |
Bundling all shortest paths
|
Dębski, Michał
|
|
|
96-97 |
C |
p. 82-91
|
artikel
|
| 687 |
Buneman graphs, partial splits and subtree distances
|
Bryant, David
|
|
|
96-97 |
C |
p. 28-44
|
artikel
|
| 688 |
Burning a graph is hard
|
Bessy, Stéphane
|
|
2017
|
96-97 |
C |
p. 73-87
|
artikel
|
| 689 |
Burning and
w
-burning of geometric graphs
|
Gorain, Barun
|
|
|
96-97 |
C |
p. 83-98
|
artikel
|
| 690 |
Burning number of caterpillars
|
Liu, Huiqing
|
|
|
96-97 |
C |
p. 332-340
|
artikel
|
| 691 |
Cacti with maximum eccentricity resistance-distance sum
|
He, Fangguo
|
|
2017
|
96-97 |
C |
p. 117-125
9 p.
|
artikel
|
| 692 |
Cacti with
n
-vertices and
t
cycles having extremal Wiener index
|
Gutman, Ivan
|
|
2017
|
96-97 |
C |
p. 189-200
|
artikel
|
| 693 |
Cactus graphs with minimum edge revised Szeged index
|
Liu, Mengmeng
|
|
|
96-97 |
C |
p. 90-96
|
artikel
|
| 694 |
Capacitated discrete unit disk cover
|
Mishra, Pawan K.
|
|
|
96-97 |
C |
p. 242-251
|
artikel
|
| 695 |
Capacity restricted optimal pebbling in graphs
|
Shiue, Chin-Lin
|
|
2019
|
96-97 |
C |
p. 284-288
|
artikel
|
| 696 |
Capture times in the bridge-burning cops and robbers game
|
Herrman, Rebekah
|
|
|
96-97 |
C |
p. 10-17
|
artikel
|
| 697 |
Car-sharing between two locations: Online scheduling with flexible advance bookings
|
Luo, Kelin
|
|
|
96-97 |
C |
p. 53-66
|
artikel
|
| 698 |
Catching an infinitely fast robber on a grid
|
Kinnersley, William B.
|
|
|
96-97 |
C |
p. 446-461
|
artikel
|
| 699 |
Cayley graphs of diameter two and any degree with order half of the Moore bound
|
Abas, Marcel
|
|
2014
|
96-97 |
C |
p. 1-7
7 p.
|
artikel
|
| 700 |
C
-differential bent functions and perfect nonlinearity
|
Stănică, Pantelimon
|
|
|
96-97 |
C |
p. 160-171
|
artikel
|
| 701 |
Certifying coloring algorithms for graphs without long induced paths
|
Kamiński, Marcin
|
|
2019
|
96-97 |
C |
p. 258-267
|
artikel
|
| 702 |
Chain method for panchromatic colorings of hypergraphs
|
Akhmejanova, Margarita
|
|
|
96-97 |
C |
p. 72-81
|
artikel
|
| 703 |
Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue
|
Johnson, Charles R.
|
|
2017
|
96-97 |
C |
p. 33-51
19 p.
|
artikel
|
| 704 |
Changing and unchanging the diameter of a hypercube
|
Graham, Niali
|
|
1992
|
96-97 |
C |
p. 265-274
10 p.
|
artikel
|
| 705 |
Channel assignment problem and relaxed 2-distant coloring of graphs
|
Lin, Wensong
|
|
|
96-97 |
C |
p. 231-244
|
artikel
|
| 706 |
Characterising circular-arc contact
B
0
–VPG graphs
|
Bonomo-Braberman, Flavia
|
|
|
96-97 |
C |
p. 435-443
|
artikel
|
| 707 |
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
|
Cooper, Martin C.
|
|
2015
|
96-97 |
C |
p. 89-113
25 p.
|
artikel
|
| 708 |
Characterization of classical graph classes by weighted clique graphs
|
Bonomo, Flavia
|
|
2014
|
96-97 |
C |
p. 83-95
13 p.
|
artikel
|
| 709 |
Characterization of color patterns by dynamic
H
-paths
|
Benítez-Bobadilla, Germán
|
|
2019
|
96-97 |
C |
p. 41-51
|
artikel
|
| 710 |
Characterization of component diagnosability of regular networks
|
Zhang, Hong
|
|
|
96-97 |
C |
p. 253-267
|
artikel
|
| 711 |
Characterization of expansion-related properties of modular graphs
|
Shang, Yilun
|
|
|
96-97 |
C |
p. 135-144
|
artikel
|
| 712 |
Characterization of facets of the hop constrained chain polytope via dynamic programming
|
Grötschel, Martin
|
|
2014
|
96-97 |
C |
p. 229-246
18 p.
|
artikel
|
| 713 |
Characterization of forbidden subgraphs for the existence of even factors in a graph
|
Xiong, Liming
|
|
2017
|
96-97 |
C |
p. 135-139
5 p.
|
artikel
|
| 714 |
Characterization of graphs with the limited normalized algebraic connectivity
|
Sun, Shaowei
|
|
|
96-97 |
C |
p. 61-70
|
artikel
|
| 715 |
Characterization of minimum cycle basis in weighted partial 2-trees
|
Narayanaswamy, N.S.
|
|
2015
|
96-97 |
C |
p. 77-81
5 p.
|
artikel
|
| 716 |
Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
|
Artamonov, V.A.
|
|
2016
|
96-97 |
C |
p. 5-17
13 p.
|
artikel
|
| 717 |
Characterization of random walks on space of unordered trees using efficient metric simulation
|
Ben Naoum, Farah
|
|
|
96-97 |
C |
p. 290-307
|
artikel
|
| 718 |
Characterization of rotation words generated by homeomorphisms on a circle
|
Ma, Guanzhong
|
|
2015
|
96-97 |
C |
p. 244-248
5 p.
|
artikel
|
| 719 |
Characterization of split graphs with at most four distinct eigenvalues
|
Ghorbani, Modjtaba
|
|
2015
|
96-97 |
C |
p. 231-236
6 p.
|
artikel
|
| 720 |
Characterization of the deletion of
(
26
,
6
)
-simple points as multivalued
(
N
,
26
)
-retractions
|
Escribano, Carmen
|
|
2015
|
96-97 |
C |
p. 31-41
11 p.
|
artikel
|
| 721 |
Characterization of the Jaccard dissimilarity metric and a generalization
|
Gerasimou, Georgios
|
|
|
96-97 |
C |
p. 57-61
|
artikel
|
| 722 |
Characterization of trees with second minimum eccentricity energy
|
Mahato, Iswar
|
|
|
96-97 |
C |
p. 78-87
|
artikel
|
| 723 |
Characterizations and enumerations of patterns of signed shifts
|
Elizalde, Sergi
|
|
|
96-97 |
C |
p. 92-114
|
artikel
|
| 724 |
Characterizations of cographs as intersection graphs of paths on a grid
|
Cohen, Elad
|
|
2014
|
96-97 |
C |
p. 46-57
12 p.
|
artikel
|
| 725 |
Characterizations of graph classes via convex geometries: A survey
|
Dourado, Mitre C.
|
|
|
96-97 |
C |
p. 246-257
|
artikel
|
| 726 |
Characterizations of (
4
K
1
,
C
4
,
C
5
)-free graphs
|
Fraser, Dallas J.
|
|
2017
|
96-97 |
C |
p. 166-174
9 p.
|
artikel
|
| 727 |
Characterizations, probe and sandwich problems on
(
k
,
ℓ
)
-cographs
|
Couto, Fernanda
|
|
|
96-97 |
C |
p. 118-133
|
artikel
|
| 728 |
Characterize all
C
5
-free diameter-2-critical graphs with at least
⌊
(
n
−
1
)
2
4
⌋
+
1
edges
|
Lin, Qiao
|
|
|
96-97 |
C |
p. 332-337
|
artikel
|
| 729 |
Characterizing and computing the structure of clique intersections in strongly chordal graphs
|
Nevries, Ragnar
|
|
2015
|
96-97 |
C |
p. 221-234
14 p.
|
artikel
|
| 730 |
Characterizing and recognizing LR-visibility polygons
|
Tan, Xuehou
|
|
2014
|
96-97 |
C |
p. 303-311
9 p.
|
artikel
|
| 731 |
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
|
Baixeries, Jaume
|
|
2018
|
96-97 |
C |
p. 18-27
|
artikel
|
| 732 |
Characterizing extremal graphs for open neighbourhood location-domination
|
Foucaud, Florent
|
|
|
96-97 |
C |
p. 76-79
|
artikel
|
| 733 |
Characterizing graphs of maximum matching width at most
2
|
Jeong, Jisu
|
|
2018
|
96-97 |
C |
p. 102-113
|
artikel
|
| 734 |
Characterizing interval graphs which are probe unit interval graphs
|
Grippo, Luciano N.
|
|
2019
|
96-97 |
C |
p. 83-95
|
artikel
|
| 735 |
Characterizing 5-map graphs by 2-fan-crossing graphs
|
Brandenburg, Franz J.
|
|
2019
|
96-97 |
C |
p. 10-20
|
artikel
|
| 736 |
Characterizing minimally flat symmetric hypergraphs
|
Kaszanitzky, Viktória E.
|
|
2018
|
96-97 |
C |
p. 256-269
|
artikel
|
| 737 |
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
|
Miao, Shujing
|
|
|
96-97 |
C |
p. 17-32
|
artikel
|
| 738 |
Characterizing the fullerene graphs with the minimum forcing number 3
|
Shi, Lingjuan
|
|
|
96-97 |
C |
p. 181-204
|
artikel
|
| 739 |
Characterizing upper bounds of
Z
-spectral radius of uniform hypergraphs
|
Xin, Quanfeng
|
|
|
96-97 |
C |
p. 100-108
|
artikel
|
| 740 |
Charging station optimization for balanced electric car sharing
|
Deza, Antoine
|
|
|
96-97 |
C |
p. 187-197
|
artikel
|
| 741 |
Charm bracelets and their application to the construction of periodic Golay pairs
|
Đoković, Dragomir Ž.
|
|
2015
|
96-97 |
C |
p. 32-40
9 p.
|
artikel
|
| 742 |
Chasing robbers on random geometric graphs—An alternative approach
|
Alon, Noga
|
|
2014
|
96-97 |
C |
p. 149-152
4 p.
|
artikel
|
| 743 |
Checking the admissibility of odd-vertex pairings is hard
|
Hörsch, Florian
|
|
|
96-97 |
C |
p. 42-48
|
artikel
|
| 744 |
Chip-firing games on Eulerian digraphs and
NP
-hardness of computing the rank of a divisor on a graph
|
Kiss, Viktor
|
|
2015
|
96-97 |
C |
p. 48-56
9 p.
|
artikel
|
| 745 |
Choice identification of a graph
|
Chang, Ting-Pang
|
|
2014
|
96-97 |
C |
p. 61-71
11 p.
|
artikel
|
| 746 |
Choosability and paintability of the lexicographic product of graphs
|
Keszegh, Balázs
|
|
2017
|
96-97 |
C |
p. 84-90
7 p.
|
artikel
|
| 747 |
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles
|
Jing, Yubo
|
|
2015
|
96-97 |
C |
p. 243-247
5 p.
|
artikel
|
| 748 |
Chordal rings as fault-tolerant loops
|
Zimmerman, Guy W
|
|
1992
|
96-97 |
C |
p. 563-573
11 p.
|
artikel
|
| 749 |
Chosen IV cryptanalysis on reduced round ChaCha and Salsa
|
Maitra, Subhamoy
|
|
2016
|
96-97 |
C |
p. 88-97
10 p.
|
artikel
|
| 750 |
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
|
Brimkov, Boris
|
|
2016
|
96-97 |
C |
p. 13-21
9 p.
|
artikel
|
| 751 |
Chromatic-choosability of the power of graphs
|
Kim, Seog-Jin
|
|
2015
|
96-97 |
C |
p. 120-125
6 p.
|
artikel
|
| 752 |
Chromatic numbers for facet colouring of some generalised associahedra
|
Baralić, Dj.
|
|
|
96-97 |
C |
p. 272-284
|
artikel
|
| 753 |
Chronological rectangle digraphs which are two-terminal series–parallel
|
Huang, Jing
|
|
2019
|
96-97 |
C |
p. 246-257
|
artikel
|
| 754 |
Chvátal–Gomory cuts for the Steiner tree problem
|
Gaul, Daniela
|
|
|
96-97 |
C |
p. 188-200
|
artikel
|
| 755 |
Circuit
k
-covers of signed graphs
|
Chen, Jing
|
|
|
96-97 |
C |
p. 41-54
|
artikel
|
| 756 |
Circular backbone colorings: On matching and tree backbones of planar graphs
|
Araujo, J.
|
|
2018
|
96-97 |
C |
p. 69-82
|
artikel
|
| 757 |
(Circular) backbone colouring: Forest backbones in planar graphs
|
Havet, Frédéric
|
|
2014
|
96-97 |
C |
p. 119-134
16 p.
|
artikel
|
| 758 |
Classes of uniformly most reliable graphs for all-terminal reliability
|
Archer, Kassie
|
|
2019
|
96-97 |
C |
p. 12-29
|
artikel
|
| 759 |
Classification of de Bruijn-based labeled digraphs
|
Kasprzak, Marta
|
|
2018
|
96-97 |
C |
p. 86-92
|
artikel
|
| 760 |
Classification of digital
n
-manifolds
|
Evako, Alexander V.
|
|
2015
|
96-97 |
C |
p. 289-296
8 p.
|
artikel
|
| 761 |
Classification of rings with crosscap two class of graphs
|
Asir, T.
|
|
2019
|
96-97 |
C |
p. 13-21
|
artikel
|
| 762 |
Classifying negative and positive points by optimal box clustering
|
Serafini, Paolo
|
|
2014
|
96-97 |
C |
p. 270-282
13 p.
|
artikel
|
| 763 |
Classifying the clique-width of
H
-free bipartite graphs
|
Dabrowski, Konrad K.
|
|
2016
|
96-97 |
C |
p. 43-51
9 p.
|
artikel
|
| 764 |
Claw-free minimal matching covered graphs
|
Zhang, Yipei
|
|
|
96-97 |
C |
p. 11-21
|
artikel
|
| 765 |
Clique Cover on L-EPG representations of graphs
|
Silva, Kedson Alves
|
|
|
96-97 |
C |
p. 145-156
|
artikel
|
| 766 |
Clique cover products and unimodality of independence polynomials
|
Zhu, Bao-Xuan
|
|
2016
|
96-97 |
C |
p. 172-180
9 p.
|
artikel
|
| 767 |
Clique cycle-transversals in distance-hereditary graphs
|
Brandstädt, Andreas
|
|
2016
|
96-97 |
C |
p. 38-44
|
artikel
|
| 768 |
Clique-partitioned graphs
|
Erskine, Grahame
|
|
|
96-97 |
C |
p. 238-248
|
artikel
|
| 769 |
Clique-perfectness of complements of line graphs
|
Bonomo, Flavia
|
|
2015
|
96-97 |
C |
p. 19-44
26 p.
|
artikel
|
| 770 |
Clique-width of full bubble model graphs
|
Meister, Daniel
|
|
2015
|
96-97 |
C |
p. 138-167
30 p.
|
artikel
|
| 771 |
Clique-width of path powers
|
Heggernes, Pinar
|
|
2016
|
96-97 |
C |
p. 62-72
11 p.
|
artikel
|
| 772 |
Closed factorization
|
Badkobeh, Golnaz
|
|
2016
|
96-97 |
C |
p. 23-29
7 p.
|
artikel
|
| 773 |
Closed-form formulas for the Zhang–Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations
|
Chou, Chien-Pin
|
|
2016
|
96-97 |
C |
p. 101-108
8 p.
|
artikel
|
| 774 |
Closures and heavy pairs for hamiltonicity
|
Shang, Wangyi
|
|
|
96-97 |
C |
p. 25-37
|
artikel
|
| 775 |
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
|
Kung, Tzu-Liang
|
|
|
96-97 |
C |
p. 143-156
|
artikel
|
| 776 |
(1,1)-Cluster Editing is polynomial-time solvable
|
Gutin, Gregory
|
|
|
96-97 |
C |
p. 259-271
|
artikel
|
| 777 |
Cluster Editing with Vertex Splitting
|
Abu-Khzam, Faisal N.
|
|
|
96-97 |
C |
p. 185-195
|
artikel
|
| 778 |
Clustering on
k
-edge-colored graphs
|
Angel, E.
|
|
2016
|
96-97 |
C |
p. 15-22
8 p.
|
artikel
|
| 779 |
Codes for distributed storage from 3-regular graphs
|
Gao, Shuhong
|
|
2017
|
96-97 |
C |
p. 82-89
8 p.
|
artikel
|
| 780 |
Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices
|
Makuracki, Bartosz
|
|
|
96-97 |
C |
p. 108-121
|
artikel
|
| 781 |
Coherent domains and improved lower bounds for the maximum size of Condorcet domains
|
Karpov, Alexander
|
|
|
96-97 |
C |
p. 57-70
|
artikel
|
| 782 |
Coherent network partitions
|
Angeleska, Angela
|
|
2019
|
96-97 |
C |
p. 283-290
|
artikel
|
| 783 |
Collapsible graphs and Hamilton cycles of line graphs
|
Li, Xiangwen
|
|
2015
|
96-97 |
C |
p. 132-142
11 p.
|
artikel
|
| 784 |
Collapsible subgraphs of a 4-edge-connected graph
|
Gu, Ran
|
|
2019
|
96-97 |
C |
p. 272-277
|
artikel
|
| 785 |
Collision-free routing problem with restricted L-path
|
Ajay, Jammigumpula
|
|
|
96-97 |
C |
p. 71-80
|
artikel
|
| 786 |
Color-avoiding connected spanning subgraphs with minimum number of edges
|
Pintér, József
|
|
|
96-97 |
C |
p. 25-43
|
artikel
|
| 787 |
Color-blind index in graphs of very low degree
|
Diemunsch, Jennifer
|
|
2017
|
96-97 |
C |
p. 122-129
8 p.
|
artikel
|
| 788 |
Colorful edge decomposition of graphs: Some polynomial cases
|
Dehghan, Ali
|
|
2017
|
96-97 |
C |
p. 155-165
11 p.
|
artikel
|
| 789 |
Colorful linear programming, Nash equilibrium, and pivots
|
Meunier, Frédéric
|
|
2018
|
96-97 |
C |
p. 78-91
|
artikel
|
| 790 |
Coloring graphs characterized by a forbidden subgraph
|
Golovach, Petr A.
|
|
2015
|
96-97 |
C |
p. 101-110
10 p.
|
artikel
|
| 791 |
Coloring graphs without short cycles and long induced paths
|
Golovach, Petr A.
|
|
2014
|
96-97 |
C |
p. 107-120
14 p.
|
artikel
|
| 792 |
Coloring
k
-partite sparse digraphs
|
Harutyunyan, Ararat
|
|
|
96-97 |
C |
p. 1-3
|
artikel
|
| 793 |
Coloring of (
P
6
,
d
a
r
t
,
K
4
)-free graphs
|
Hong, Xia
|
|
|
96-97 |
C |
p. 223-230
|
artikel
|
| 794 |
4-coloring
(
P
6
,
bull
)
-free graphs
|
Maffray, Frédéric
|
|
2017
|
96-97 |
C |
p. 198-210
13 p.
|
artikel
|
| 795 |
Coloring (
P
5
, kite)-free graphs with small cliques
|
Huang, Shenwei
|
|
|
96-97 |
C |
p. 129-139
|
artikel
|
| 796 |
Coloring
{
P
2
∪
P
3
,
house
}
-free graphs with
Δ
−
1
colors
|
Chen, Rong
|
|
|
96-97 |
C |
p. 12-18
|
artikel
|
| 797 |
Colorings of oriented planar graphs avoiding a monochromatic subgraph
|
Bergold, Helena
|
|
|
96-97 |
C |
p. 81-94
|
artikel
|
| 798 |
Coloring squares of graphs with mad constraints
|
Hocquard, Hervé
|
|
2019
|
96-97 |
C |
p. 64-73
|
artikel
|
| 799 |
Colorings with neighborhood parity condition
|
Petruševski, Mirko
|
|
|
96-97 |
C |
p. 385-391
|
artikel
|
| 800 |
Coloring the square of a sparse graph
G
with almost
Δ
(
G
)
colors
|
Yancey, Matthew P.
|
|
2016
|
96-97 |
C |
p. 211-215
5 p.
|
artikel
|
| 801 |
Color-line and proper color-line graphs
|
Le, Van Bang
|
|
|
96-97 |
C |
p. 73-82
|
artikel
|
| 802 |
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
|
Wu, Fangfang
|
|
|
96-97 |
C |
p. 145-152
|
artikel
|
| 803 |
3-color Schur numbers
|
Boza, L.
|
|
2019
|
96-97 |
C |
p. 59-68
|
artikel
|
| 804 |
Color spanning objects: Algorithms and hardness results
|
Banerjee, Sandip
|
|
|
96-97 |
C |
p. 14-22
|
artikel
|
| 805 |
Colour degree matrices of graphs with at most one cycle
|
Hillebrand, A.
|
|
2016
|
96-97 |
C |
p. 144-152
9 p.
|
artikel
|
| 806 |
Colouring graphs of bounded diameter in the absence of small cycles
|
Martin, Barnaby
|
|
|
96-97 |
C |
p. 150-161
|
artikel
|
| 807 |
(
2
,
2
)
-colourings and clique-free
σ
-hypergraphs
|
Caro, Yair
|
|
2015
|
96-97 |
C |
p. 38-43
6 p.
|
artikel
|
| 808 |
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
|
Gimadi, E.Kh.
|
|
2015
|
96-97 |
C |
p. 54-61
8 p.
|
artikel
|
| 809 |
Combinatorial and asymptotic results on the neighborhood grid
|
McDonough, Alex
|
|
|
96-97 |
C |
p. 48-64
|
artikel
|
| 810 |
Combinatorial approach of unified Apostol-type polynomials using
α
-distanced words
|
Bényi, Beáta
|
|
|
96-97 |
C |
p. 23-31
|
artikel
|
| 811 |
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
|
Bley, Andreas
|
|
2016
|
96-97 |
C |
p. 34-46
13 p.
|
artikel
|
| 812 |
Combinatorial inversion in edge-weighted unicyclic graphs
|
Jaume, Daniel A.
|
|
|
96-97 |
C |
p. 113-129
|
artikel
|
| 813 |
Combinatorial Optimization: Between Practice and Theory
|
Brodnik, Andrej
|
|
2019
|
96-97 |
C |
p. 1-3
|
artikel
|
| 814 |
Combinatorial optimization problems with balanced regret
|
Goerigk, Marc
|
|
|
96-97 |
C |
p. 40-59
|
artikel
|
| 815 |
Combinatorial optimization with one quadratic term: Spanning trees and forests
|
Buchheim, Christoph
|
|
2014
|
96-97 |
C |
p. 34-52
19 p.
|
artikel
|
| 816 |
Combined location and routing problems for drug distribution
|
Ceselli, Alberto
|
|
2014
|
96-97 |
C |
p. 130-145
16 p.
|
artikel
|
| 817 |
Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
|
Alkaya, Ali Fuat
|
|
2015
|
96-97 |
C |
p. 2-16
15 p.
|
artikel
|
| 818 |
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
|
Qin, Xiao-Wen
|
|
|
96-97 |
C |
p. 730-733
|
artikel
|
| 819 |
Common domination perfect graphs
|
Dettlaff, Magda
|
|
|
96-97 |
C |
p. 253-259
|
artikel
|
| 820 |
Community detection in networks via a spectral heuristic based on the clustering coefficient
|
Nascimento, Mariá C.V.
|
|
|
96-97 |
C |
p. 89-99
|
artikel
|
| 821 |
Commuting Eulerian operators
|
Ma, Shi-Mei
|
|
|
96-97 |
C |
p. 355-361
|
artikel
|
| 822 |
Compact cactus representations of all non-trivial min-cuts
|
Lo, On-Hei S.
|
|
|
96-97 |
C |
p. 296-304
|
artikel
|
| 823 |
Comparative results and bounds for the eccentric-adjacency index
|
Hua, Hongbo
|
|
|
96-97 |
C |
p. 188-196
|
artikel
|
| 824 |
Comparing the metric and strong dimensions of graphs
|
Moravcik, Gaia
|
|
2017
|
96-97 |
C |
p. 68-79
12 p.
|
artikel
|
| 825 |
Comparing the
p
-independence number of regular graphs to the
q
-independence number of their line graphs
|
Caro, Yair
|
|
|
96-97 |
C |
p. 316-326
|
artikel
|
| 826 |
Comparing the power of cops to zombies in pursuit-evasion games
|
Offner, David
|
|
2019
|
96-97 |
C |
p. 144-151
|
artikel
|
| 827 |
Comparing Wiener complexity with eccentric complexity
|
Xu, Kexiang
|
|
|
96-97 |
C |
p. 7-16
|
artikel
|
| 828 |
Comparison between the Szeged index and the eccentric connectivity index
|
Das, Kinkar Ch.
|
|
2015
|
96-97 |
C |
p. 74-86
13 p.
|
artikel
|
| 829 |
Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
|
Das, Kinkar Ch.
|
|
2014
|
96-97 |
C |
p. 35-41
7 p.
|
artikel
|
| 830 |
Comparison of mean hitting times for a degree-biased random walk
|
Gerbaud, Antoine
|
|
2014
|
96-97 |
C |
p. 104-109
6 p.
|
artikel
|
| 831 |
Comparison theorems on resistance distances and Kirchhoff indices of
S
,
T
-isomers
|
Yang, Yujun
|
|
2014
|
96-97 |
C |
p. 87-93
7 p.
|
artikel
|
| 832 |
Compatibility of partitions with trees, hierarchies, and split systems
|
Hellmuth, Marc
|
|
|
96-97 |
C |
p. 265-283
|
artikel
|
| 833 |
Compatible recurrent identities of the sandpile group and maximal stable configurations
|
Gao, Yibo
|
|
|
96-97 |
C |
p. 123-137
|
artikel
|
| 834 |
Competition graphs of degree bounded digraphs
|
Chu, Hojin
|
|
|
96-97 |
C |
p. 106-114
|
artikel
|
| 835 |
Complementary Riordan arrays
|
Luzón, Ana
|
|
2014
|
96-97 |
C |
p. 75-87
13 p.
|
artikel
|
| 836 |
Complete bipartite graphs without small rainbow stars
|
Chen, Weizhen
|
|
|
96-97 |
C |
p. 14-20
|
artikel
|
| 837 |
Complete bipartite graphs without small rainbow subgraphs
|
Ma, Zhiqiang
|
|
|
96-97 |
C |
p. 248-262
|
artikel
|
| 838 |
Complete characterization of bicyclic graphs with minimal Kirchhoff index
|
Liu, Jia-Bao
|
|
2016
|
96-97 |
C |
p. 95-107
13 p.
|
artikel
|
| 839 |
Complete characterization of graphs for direct comparing Zagreb indices
|
Horoldagva, Batmend
|
|
2016
|
96-97 |
C |
p. 146-154
9 p.
|
artikel
|
| 840 |
Complete characterization of the minimal-ABC trees
|
Dimitrov, Darko
|
|
|
96-97 |
C |
p. 148-194
|
artikel
|
| 841 |
Complete characterizations of the 2-domination and
P
3
-hull number polytopes
|
Blaum, Manuela
|
|
|
96-97 |
C |
p. 30-45
|
artikel
|
| 842 |
Complete colorings of planar graphs
|
Araujo-Pardo, G.
|
|
2019
|
96-97 |
C |
p. 86-97
|
artikel
|
| 843 |
Complete forcing numbers of (4,6)-fullerenes
|
He, Xin
|
|
|
96-97 |
C |
p. 385-398
|
artikel
|
| 844 |
Completely independent spanning trees in
k
th power of 2-connected graphs
|
Hong, Xia
|
|
|
96-97 |
C |
p. 268-273
|
artikel
|
| 845 |
Complete oriented colourings and the oriented achromatic number
|
Sopena, Éric
|
|
2014
|
96-97 |
C |
p. 102-112
11 p.
|
artikel
|
| 846 |
Complete solution of equation
W
(
L
3
(
T
)
)
=
W
(
T
)
for the Wiener index of iterated line graphs of trees
|
Knor, M.
|
|
2014
|
96-97 |
C |
p. 90-103
14 p.
|
artikel
|
| 847 |
Complete split graph determined by its (signless) Laplacian spectrum
|
Das, Kinkar Ch.
|
|
2016
|
96-97 |
C |
p. 45-51
7 p.
|
artikel
|
| 848 |
Complete subgraphs in connected graphs and its application to spectral moment
|
Fang, Longfei
|
|
|
96-97 |
C |
p. 36-42
|
artikel
|
| 849 |
Complete weight enumerators of some irreducible cyclic codes
|
Shi, Zexia
|
|
2017
|
96-97 |
C |
p. 182-192
11 p.
|
artikel
|
| 850 |
Completing colored graphs to meet a target property
|
Cook, Kathryn
|
|
2017
|
96-97 |
C |
p. 39-51
13 p.
|
artikel
|
| 851 |
Complexity analysis of propositional resolution with autarky pruning
|
Van Gelder, Allen
|
|
1999
|
96-97 |
C |
p. 195-221
27 p.
|
artikel
|
| 852 |
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
|
Hochbaum, Dorit S.
|
|
2018
|
96-97 |
C |
p. 252-261
|
artikel
|
| 853 |
Complexity and computation of connected zero forcing
|
Brimkov, Boris
|
|
2017
|
96-97 |
C |
p. 31-45
15 p.
|
artikel
|
| 854 |
Complexity aspects of
ℓ
-chord convexities
|
Dourado, Mitre C.
|
|
|
96-97 |
C |
p. 585-591
|
artikel
|
| 855 |
Complexity aspects of the triangle path convexity
|
Dourado, Mitre C.
|
|
2016
|
96-97 |
C |
p. 39-47
9 p.
|
artikel
|
| 856 |
Complexity of correspondence
H
-colourings
|
Feder, Tomás
|
|
|
96-97 |
C |
p. 235-245
|
artikel
|
| 857 |
Complexity of edge monitoring on some graph classes
|
Bagan, Guillaume
|
|
|
96-97 |
C |
p. 49-63
|
artikel
|
| 858 |
Complexity of Grundy coloring and its variants
|
Bonnet, Édouard
|
|
2018
|
96-97 |
C |
p. 99-114
|
artikel
|
| 859 |
Complexity of independency and cliquy trees
|
Casel, Katrin
|
|
|
96-97 |
C |
p. 2-15
|
artikel
|
| 860 |
Complexity of Maker–Breaker games on edge sets of graphs
|
Duchêne, Eric
|
|
|
96-97 |
C |
p. 502-522
|
artikel
|
| 861 |
Complexity of minimum irreducible infeasible subsystem covers for flow networks
|
Joormann, Imke
|
|
2018
|
96-97 |
C |
p. 124-142
|
artikel
|
| 862 |
Complexity of planar signed graph homomorphisms to cycles
|
Dross, François
|
|
|
96-97 |
C |
p. 166-178
|
artikel
|
| 863 |
Complexity of rainbow vertex connectivity problems for restricted graph classes
|
Lauri, Juho
|
|
2017
|
96-97 |
C |
p. 132-146
15 p.
|
artikel
|
| 864 |
Complexity of some graph-based bounds on the probability of a union of events
|
Scozzari, Andrea
|
|
2018
|
96-97 |
C |
p. 186-197
|
artikel
|
| 865 |
Complexity of splits reconstruction for low-degree trees
|
Gaspers, Serge
|
|
2015
|
96-97 |
C |
p. 89-100
12 p.
|
artikel
|
| 866 |
Complexity of total outer-connected domination problem in graphs
|
Panda, B.S.
|
|
2016
|
96-97 |
C |
p. 110-122
13 p.
|
artikel
|
| 867 |
Complexity results for common due date scheduling problems with interval data and minmax regret criterion
|
Kacem, Imed
|
|
2019
|
96-97 |
C |
p. 76-89
|
artikel
|
| 868 |
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
|
Cappelle, Márcia R.
|
|
|
96-97 |
C |
p. 124-133
|
artikel
|
| 869 |
Complexity-separating graph classes for vertex, edge and total colouring
|
de Figueiredo, Celina M.H.
|
|
|
96-97 |
C |
p. 162-171
|
artikel
|
| 870 |
Component-cardinality-constrained critical node problem in graphs
|
Lalou, M.
|
|
2016
|
96-97 |
C |
p. 150-163
|
artikel
|
| 871 |
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
|
Zorzi, A.
|
|
|
96-97 |
C |
p. 349-363
|
artikel
|
| 872 |
Compositions of digraphs: a survey
|
Sun, Yuefang
|
|
|
96-97 |
C |
p. 137-153
|
artikel
|
| 873 |
Computational advances in combinatorial optimization
|
Jordán, Tibor
|
|
2018
|
96-97 |
C |
p. 1-3
|
artikel
|
| 874 |
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
|
S.V., Ullas Chandran
|
|
|
96-97 |
C |
p. 499-510
|
artikel
|
| 875 |
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
|
Chandran S.V., Ullas
|
|
|
96-97 |
C |
p. 50-61
|
artikel
|
| 876 |
Computational complexity aspects of point visibility graphs
|
Himmel, Anne-Sophie
|
|
2019
|
96-97 |
C |
p. 283-290
|
artikel
|
| 877 |
Computational complexity of covering disconnected multigraphs
|
Bok, Jan
|
|
|
96-97 |
C |
p. 229-243
|
artikel
|
| 878 |
Computational complexity of distance edge labeling
|
Knop, Dušan
|
|
2018
|
96-97 |
C |
p. 80-98
|
artikel
|
| 879 |
Computational complexity of minimum
P
4
vertex cover problem for regular and
K
1
,
4
-free graphs
|
Safina Devi, N.
|
|
2015
|
96-97 |
C |
p. 114-121
8 p.
|
artikel
|
| 880 |
Computational complexity of the recoverable robust shortest path problem with discrete recourse
|
Jackiewicz, Marcel
|
|
|
96-97 |
C |
p. 103-110
|
artikel
|
| 881 |
Computational determination of the largest lattice polytope diameter
|
Chadder, Nathan
|
|
|
96-97 |
C |
p. 106-110
|
artikel
|
| 882 |
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
|
Jiménez, Andrea
|
|
2016
|
96-97 |
C |
p. 45-60
|
artikel
|
| 883 |
Computing a minimum paired-dominating set in strongly orderable graphs
|
Pradhan, D.
|
|
2019
|
96-97 |
C |
p. 37-50
|
artikel
|
| 884 |
Computing covers using prefix tables
|
Alatabbi, Ali
|
|
2016
|
96-97 |
C |
p. 2-9
8 p.
|
artikel
|
| 885 |
Computing distance moments on graphs with transitive Djoković–Winkler relation
|
Klavžar, Sandi
|
|
2014
|
96-97 |
C |
p. 269-272
4 p.
|
artikel
|
| 886 |
Computing graph gonality is hard
|
Gijswijt, Dion
|
|
|
96-97 |
C |
p. 134-149
|
artikel
|
| 887 |
Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
|
Murakami, Masahiko
|
|
2014
|
96-97 |
C |
p. 271-284
14 p.
|
artikel
|
| 888 |
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
|
Gurvich, Vladimir
|
|
|
96-97 |
C |
p. 53-68
|
artikel
|
| 889 |
Computing longest common extensions in partial words
|
Blanchet-Sadri, F.
|
|
2018
|
96-97 |
C |
p. 119-139
|
artikel
|
| 890 |
Computing maximum non-crossing matching in convex bipartite graphs
|
Chen, Danny Z.
|
|
2015
|
96-97 |
C |
p. 50-60
11 p.
|
artikel
|
| 891 |
Computing partial hypergraphs of bounded width
|
Adrar, Nabil
|
|
|
96-97 |
C |
p. 1-22
|
artikel
|
| 892 |
Computing similarity distances between rankings
|
Farnoud (Hassanzadeh), Farzad
|
|
2017
|
96-97 |
C |
p. 157-175
|
artikel
|
| 893 |
Computing simple paths from given points inside a polygon
|
Tan, Xuehou
|
|
2019
|
96-97 |
C |
p. 67-76
|
artikel
|
| 894 |
Computing solutions to the congruence
1
n
+
2
n
+
⋯
+
n
n
≡
p
(
mod
n
)
|
Alekseyev, Max A.
|
|
|
96-97 |
C |
p. 3-9
|
artikel
|
| 895 |
Computing square roots of graphs with low maximum degree
|
Cochefert, Manfred
|
|
2018
|
96-97 |
C |
p. 93-101
|
artikel
|
| 896 |
Computing the blocks of a quasi-median graph
|
Herrmann, Sven
|
|
2014
|
96-97 |
C |
p. 129-138
10 p.
|
artikel
|
| 897 |
Computing the coarseness with strips or boxes
|
Díaz-Báñez, J.M.
|
|
2017
|
96-97 |
C |
p. 80-90
11 p.
|
artikel
|
| 898 |
Computing the differential of a graph: Hardness, approximability and exact algorithms
|
Bermudo, S.
|
|
2014
|
96-97 |
C |
p. 69-82
14 p.
|
artikel
|
| 899 |
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
|
Yang, Yu
|
|
|
96-97 |
C |
p. 184-201
|
artikel
|
| 900 |
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains
|
Ahmad, Yasir
|
|
|
96-97 |
C |
p. 111-120
|
artikel
|
| 901 |
Computing the matching and independence polynomials of double hexagonal chains
|
Chen, Hanlin
|
|
|
96-97 |
C |
p. 139-157
|
artikel
|
| 902 |
Computing the minimal perimeter polygon for digital objects in the triangular tiling
|
Wiederhold, Petra
|
|
|
96-97 |
C |
p. 27-44
|
artikel
|
| 903 |
Computing the
P
3
-hull number of a graph, a polyhedral approach
|
Blaum, Manuela
|
|
2019
|
96-97 |
C |
p. 155-166
|
artikel
|
| 904 |
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
|
Speakman, Emily
|
|
|
96-97 |
C |
p. 36-45
|
artikel
|
| 905 |
Computing the zig-zag number of directed graphs
|
Dourado, Mitre C.
|
|
|
96-97 |
C |
p. 86-105
|
artikel
|
| 906 |
Computing with an algebraic-perturbation variant of Barvinok’s algorithm
|
Lee, Jon
|
|
2018
|
96-97 |
C |
p. 63-77
|
artikel
|
| 907 |
Concerning a conjecture on matching Kneser graphs
|
Shaebani, Saeed
|
|
|
96-97 |
C |
p. 87-90
|
artikel
|
| 908 |
Conditional connectivity of folded hypercubes
|
Zhao, Shuli
|
|
2019
|
96-97 |
C |
p. 388-392
|
artikel
|
| 909 |
Conditional diagnosability of bubble-sort star graphs
|
Guo, Jia
|
|
2016
|
96-97 |
C |
p. 141-149
9 p.
|
artikel
|
| 910 |
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
|
Gu, Mei-Mei
|
|
|
96-97 |
C |
p. 137-152
|
artikel
|
| 911 |
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
|
Xu, Liqiong
|
|
|
96-97 |
C |
p. 367-379
|
artikel
|
| 912 |
Conditional edge-fault-tolerant Hamiltonicity of the data center network
|
Qin, Xiao-Wen
|
|
|
96-97 |
C |
p. 165-179
|
artikel
|
| 913 |
Conditional fractional matching preclusion of
n
-dimensional torus networks
|
Hu, Xiaomin
|
|
|
96-97 |
C |
p. 157-165
|
artikel
|
| 914 |
Conditional
k
-matching preclusion for
n
-dimensional torus networks
|
Hu, Xiaomin
|
|
|
96-97 |
C |
p. 181-190
|
artikel
|
| 915 |
Conditional matching preclusion for regular bipartite graphs and their Cartesian product
|
Lin, Ruizhi
|
|
|
96-97 |
C |
p. 17-25
|
artikel
|
| 916 |
Conditional matroidal edge connectivity of Cayley graphs
|
Wang, Li
|
|
|
96-97 |
C |
p. 271-278
|
artikel
|
| 917 |
Conflict-free connection number of random graphs
|
Gu, Ran
|
|
|
96-97 |
C |
p. 522-532
|
artikel
|
| 918 |
Conic relaxation approaches for equal deployment problems
|
Safarina, Sena
|
|
|
96-97 |
C |
p. 111-125
|
artikel
|
| 919 |
1-2-3 Conjecture in digraphs: More results and directions
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 124-137
|
artikel
|
| 920 |
Connected domination in maximal outerplanar graphs
|
Zhuang, Wei
|
|
|
96-97 |
C |
p. 533-541
|
artikel
|
| 921 |
Connected graph
G
with
σ
2
(
G
)
≥
2
3
n
and
K
1
,
4
-free contains a Hamiltonian path
|
Momège, Benjamin
|
|
|
96-97 |
C |
p. 37-42
|
artikel
|
| 922 |
2-Connected graphs with minimum general sum-connectivity index
|
Tomescu, Ioan
|
|
2014
|
96-97 |
C |
p. 135-141
7 p.
|
artikel
|
| 923 |
Connected greedy coloring of
H
-free graphs
|
Mota, Esdras
|
|
|
96-97 |
C |
p. 572-584
|
artikel
|
| 924 |
Connected positive influence dominating set in k-regular graph
|
Yao, Xiaopeng
|
|
|
96-97 |
C |
p. 65-76
|
artikel
|
| 925 |
Connected realizations of joint-degree matrices
|
Amanatidis, Georgios
|
|
2018
|
96-97 |
C |
p. 65-74
|
artikel
|
| 926 |
Connections between two cycles — a new design of dense processor interconnection networks
|
Bar-Yehuda, Reuven
|
|
1992
|
96-97 |
C |
p. 29-43
15 p.
|
artikel
|
| 927 |
Connectivity and diagnosability of center
k
-ary
n
-cubes
|
Wang, Mujiangshan
|
|
|
96-97 |
C |
p. 98-107
|
artikel
|
| 928 |
Connectivity and stochastic robustness of synchronized multi-drone systems
|
Bereg, Sergey
|
|
|
96-97 |
C |
p. 170-181
|
artikel
|
| 929 |
Connectivity and super connectivity of enhanced folded hypercube-like networks
|
Guo, Litao
|
|
|
96-97 |
C |
p. 14-19
|
artikel
|
| 930 |
Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
|
Chen, Shuya
|
|
|
96-97 |
C |
p. 135-146
|
artikel
|
| 931 |
Connectivity of consecutive-d digraphs
|
Du, D.-Z
|
|
1992
|
96-97 |
C |
p. 169-177
9 p.
|
artikel
|
| 932 |
Connectivity of random hypergraphs with a given hyperedge size distribution
|
Bergman, Elmer
|
|
|
96-97 |
C |
p. 1-13
|
artikel
|
| 933 |
Connectivity, persistence and fault diagnosis of interconnection networks based on O
k
and 2O
k
graphs
|
Ghafoor, Arif
|
|
1992
|
96-97 |
C |
p. 205-226
22 p.
|
artikel
|
| 934 |
Constant delay lattice train schedules
|
De Carufel, Jean-Lou
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 935 |
Constant threshold intersection graphs of orthodox paths in trees
|
Bornstein, Claudson Ferreira
|
|
|
96-97 |
C |
p. 61-68
|
artikel
|
| 936 |
Constant time enumeration of weighted trees
|
Qian, Mengze
|
|
|
96-97 |
C |
p. 129-138
|
artikel
|
| 937 |
Constant work-space algorithms for facility location problems
|
Bhattacharya, Binay K.
|
|
|
96-97 |
C |
p. 456-472
|
artikel
|
| 938 |
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
|
Čibej, Uroš
|
|
|
96-97 |
C |
p. 47-61
|
artikel
|
| 939 |
Constructing completely independent spanning trees in crossed cubes
|
Cheng, Baolei
|
|
2017
|
96-97 |
C |
p. 100-109
10 p.
|
artikel
|
| 940 |
Constructing cospectral graphs by unfolding non-bipartite graphs
|
Kannan, M. Rajesh
|
|
|
96-97 |
C |
p. 264-273
|
artikel
|
| 941 |
Constructing day-balanced round-robin tournaments with partitions
|
Erzurumluoğlu, Aras
|
|
2018
|
96-97 |
C |
p. 81-91
|
artikel
|
| 942 |
Constructing depth-optimum circuits for adders and And-Or paths
|
Brenner, Ulrich
|
|
|
96-97 |
C |
p. 10-31
|
artikel
|
| 943 |
Constructing error-correcting binary codes using transitive permutation groups
|
Laaksonen, Antti
|
|
2017
|
96-97 |
C |
p. 65-70
6 p.
|
artikel
|
| 944 |
Constructing formally self-dual codes over
R
k
|
Karadeniz, Suat
|
|
2014
|
96-97 |
C |
p. 188-196
9 p.
|
artikel
|
| 945 |
Constructing new families of transmission irregular graphs
|
Xu, Kexiang
|
|
|
96-97 |
C |
p. 383-391
|
artikel
|
| 946 |
Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
|
Chen, Yindong
|
|
2019
|
96-97 |
C |
p. 1-12
|
artikel
|
| 947 |
Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables
|
Hu, Xuewei
|
|
|
96-97 |
C |
p. 110-128
|
artikel
|
| 948 |
Construction and enumeration of balanced rotation symmetric Boolean functions
|
A.U., Zeenath
|
|
|
96-97 |
C |
p. 197-208
|
artikel
|
| 949 |
Construction methods for generalized bent functions
|
Hodžić, S.
|
|
2018
|
96-97 |
C |
p. 14-23
|
artikel
|
| 950 |
Construction of all tournament matrices with prescribed row sum vector
|
Hacioglu, Ilhan
|
|
2014
|
96-97 |
C |
p. 147-152
6 p.
|
artikel
|
| 951 |
Construction of extremal mixed graphs of diameter two
|
López, Nacho
|
|
2019
|
96-97 |
C |
p. 204-211
|
artikel
|
| 952 |
Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
|
Guo, Xiaoqi
|
|
|
96-97 |
C |
p. 102-114
|
artikel
|
| 953 |
Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity
|
Li, Jingjing
|
|
|
96-97 |
C |
p. 218-227
|
artikel
|
| 954 |
Constructions of
k
-critical
P
5
-free graphs
|
Hoàng, Chính T.
|
|
2015
|
96-97 |
C |
p. 91-98
8 p.
|
artikel
|
| 955 |
Constructions of 2-rotation symmetric bent functions based on Maiorana–McFarland’s bent function
|
Guan, Yu
|
|
|
96-97 |
C |
p. 139-153
|
artikel
|
| 956 |
Constructions of rotation symmetric bent functions with high algebraic degree
|
Zhao, Qinglan
|
|
2018
|
96-97 |
C |
p. 15-29
|
artikel
|
| 957 |
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class
|
Bapić, A.
|
|
|
96-97 |
C |
p. 197-212
|
artikel
|
| 958 |
Constructive characterizations concerning weak Roman domination in trees
|
Cabrera-Martínez, Abel
|
|
|
96-97 |
C |
p. 384-390
|
artikel
|
| 959 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 960 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 961 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 962 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 963 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 964 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 965 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 966 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 967 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 968 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 969 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 970 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 971 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 972 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 973 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 974 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 975 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 976 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 977 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 978 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 979 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 980 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 981 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 982 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 983 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 984 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 985 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 986 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 987 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 988 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 989 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 990 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 991 |
Contents
|
|
|
2014
|
96-97 |
C |
p. v-vii
nvt p.
|
artikel
|
| 992 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 993 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 994 |
Contents
|
|
|
2015
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 995 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 996 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
nvt p.
|
artikel
|
| 997 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-
1 p.
|
artikel
|
| 998 |
Contents
|
|
|
2018
|
96-97 |
C |
p. v-vi
|
artikel
|
| 999 |
Contents
|
|
|
2017
|
96-97 |
C |
p. v-vi
|
artikel
|
| 1000 |
Contents
|
|
|
2016
|
96-97 |
C |
p. v-vi
|
artikel
|
Tijdschrift beschrijving