| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 3001 |
On the generating functions and special functions associated with superoscillations
|
Colombo, F.
|
|
|
96-97 |
C |
p. 215-227
|
artikel
|
| 3002 |
On the generation of convex polyominoes
|
Massazza, Paolo
|
|
2015
|
96-97 |
C |
p. 78-89
12 p.
|
artikel
|
| 3003 |
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
|
Moscarini, Marina
|
|
|
96-97 |
C |
p. 142-152
|
artikel
|
| 3004 |
On the geodetic iteration number of the contour of a graph
|
Mezzini, Mauro
|
|
2016
|
96-97 |
C |
p. 211-214
4 p.
|
artikel
|
| 3005 |
On the geodeticity of the contour of a graph
|
Mezzini, Mauro
|
|
2015
|
96-97 |
C |
p. 209-220
12 p.
|
artikel
|
| 3006 |
On the geometric–arithmetic index of a graph
|
Chen, Yin
|
|
2019
|
96-97 |
C |
p. 268-273
|
artikel
|
| 3007 |
On the geometry of graph spaces
|
Jain, Brijnesh J.
|
|
2016
|
96-97 |
C |
p. 126-144
19 p.
|
artikel
|
| 3008 |
On the global forcing number of hexagonal systems
|
Zhang, Heping
|
|
2014
|
96-97 |
C |
p. 334-347
14 p.
|
artikel
|
| 3009 |
On the global rigidity of tensegrity graphs
|
Garamvölgyi, Dániel
|
|
|
96-97 |
C |
p. 114-122
|
artikel
|
| 3010 |
On the global total
k
-domination number of graphs
|
Bermudo, Sergio
|
|
2019
|
96-97 |
C |
p. 42-50
|
artikel
|
| 3011 |
On the Gowers
U
2
and
U
3
norms of Boolean functions and their restriction to hyperplanes
|
Kumar, Vikas
|
|
|
96-97 |
C |
p. 4-8
|
artikel
|
| 3012 |
On the Grace–Danielsson inequality for tetrahedra
|
László, Lajos
|
|
2019
|
96-97 |
C |
p. 83-90
|
artikel
|
| 3013 |
On the Gutman index and minimum degree
|
Mazorodze, Jaya Percival
|
|
2014
|
96-97 |
C |
p. 77-82
6 p.
|
artikel
|
| 3014 |
On the hardness of problems around
s
-clubs on split graphs
|
Bazgan, Cristina
|
|
|
96-97 |
C |
p. 247-254
|
artikel
|
| 3015 |
On the hydra number of disconnected graphs
|
Nicgorska-Miśkiewicz, Angelika
|
|
2019
|
96-97 |
C |
p. 201-208
|
artikel
|
| 3016 |
On the hyperbolicity constant of circular-arc graphs
|
Reyes, Rosalío
|
|
2019
|
96-97 |
C |
p. 244-256
|
artikel
|
| 3017 |
On the hyperbolicity of bipartite graphs and intersection graphs
|
Coudert, David
|
|
2016
|
96-97 |
C |
p. 187-195
9 p.
|
artikel
|
| 3018 |
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
|
Zhang, Yin
|
|
2014
|
96-97 |
C |
p. 17-27
11 p.
|
artikel
|
| 3019 |
On the independence number and the chromatic number of generalized preferential attachment models
|
Kovalenko, Kirill
|
|
|
96-97 |
C |
p. 301-306
|
artikel
|
| 3020 |
On the independence polynomial of the corona of graphs
|
Levit, Vadim E.
|
|
2016
|
96-97 |
C |
p. 85-93
9 p.
|
artikel
|
| 3021 |
On the independence transversal total domination number of graphs
|
Cabrera Martínez, Abel
|
|
2017
|
96-97 |
C |
p. 65-73
9 p.
|
artikel
|
| 3022 |
On the independent domination polynomial of a graph
|
Jahari, Somayeh
|
|
|
96-97 |
C |
p. 416-426
|
artikel
|
| 3023 |
On the
α
-index of minimally 2-connected graphs with given order or size
|
Lou, Jiayu
|
|
|
96-97 |
C |
p. 281-291
|
artikel
|
| 3024 |
On the information ratio of graphs without high-degree neighbors
|
Gyarmati, Máté
|
|
|
96-97 |
C |
p. 55-62
|
artikel
|
| 3025 |
On the in–out–proper orientations of graphs
|
Dehghan, Ali
|
|
|
96-97 |
C |
p. 129-138
|
artikel
|
| 3026 |
On the integer max-linear programming problem
|
Butkovič, Peter
|
|
2014
|
96-97 |
C |
p. 128-141
14 p.
|
artikel
|
| 3027 |
On the intersection of all critical sets of a unicyclic graph
|
Levit, Vadim E.
|
|
2014
|
96-97 |
C |
p. 409-414
6 p.
|
artikel
|
| 3028 |
On the intersection of tolerance and cocomparability graphs
|
Mertzios, George B.
|
|
2016
|
96-97 |
C |
p. 46-88
43 p.
|
artikel
|
| 3029 |
On the
Δ
-interval and the
Δ
-convexity numbers of graphs and graph products
|
Anand, Bijo S.
|
|
|
96-97 |
C |
p. 487-498
|
artikel
|
| 3030 |
On the inverse sum indeg index
|
Sedlar, Jelena
|
|
2015
|
96-97 |
C |
p. 202-212
11 p.
|
artikel
|
| 3031 |
On the kernelization of ranking
r
-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments
|
Perez, Anthony
|
|
2015
|
96-97 |
C |
p. 214-225
12 p.
|
artikel
|
| 3032 |
On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain
|
Abdus Sahir, Md.
|
|
|
96-97 |
C |
p. 47-61
|
artikel
|
| 3033 |
On the Kirchhoff index of a graph and the matchings of the subdivision
|
Que, Linfeng
|
|
|
96-97 |
C |
p. 91-96
|
artikel
|
| 3034 |
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
|
Chen, Yulan
|
|
|
96-97 |
C |
p. 19-24
|
artikel
|
| 3035 |
On the Kirchhoff index of bipartite graphs with given diameters
|
Jiang, Xiaojing
|
|
|
96-97 |
C |
p. 512-521
|
artikel
|
| 3036 |
On the Kirchhoff index of graphs with diameter 2
|
Palacios, José Luis
|
|
2015
|
96-97 |
C |
p. 196-201
6 p.
|
artikel
|
| 3037 |
On the
k
-Strong Roman Domination Problem
|
Liu, Zeyu
|
|
|
96-97 |
C |
p. 227-241
|
artikel
|
| 3038 |
On the Laplacian spectral radius of bipartite graphs with fixed order and size
|
Zhang, Huihui
|
|
2017
|
96-97 |
C |
p. 139-147
9 p.
|
artikel
|
| 3039 |
On the largest matching roots of graphs with a given number of pendent vertices
|
Zhang, Hailiang
|
|
2019
|
96-97 |
C |
p. 339-344
|
artikel
|
| 3040 |
On the least eccentricity eigenvalue of graphs
|
Li, Jianping
|
|
|
96-97 |
C |
p. 47-55
|
artikel
|
| 3041 |
On the limit of the sequence
{
C
m
(
D
)
}
m
=
1
∞
for a multipartite tournament
D
|
Jung, Ji-Hwan
|
|
|
96-97 |
C |
p. 1-13
|
artikel
|
| 3042 |
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
|
Cámara, M.
|
|
|
96-97 |
C |
p. 12-18
|
artikel
|
| 3043 |
On the longest path of a randomly weighted tournament
|
Yuster, Raphael
|
|
2017
|
96-97 |
C |
p. 121-132
12 p.
|
artikel
|
| 3044 |
On the Lovász–Schrijver PSD-operator on graph classes defined by clique cutsets
|
Wagler, Annegret K.
|
|
|
96-97 |
C |
p. 209-219
|
artikel
|
| 3045 |
On the matching and permanental polynomials of graphs
|
Li, Wei
|
|
|
96-97 |
C |
p. 16-23
|
artikel
|
| 3046 |
On the maximal augmented Zagreb index of unicyclic graphs with given girth
|
Li, Yibo
|
|
|
96-97 |
C |
p. 238-246
|
artikel
|
| 3047 |
On the maximum diversity of hypergraphs with fixed matching number
|
Frankl, Peter
|
|
|
96-97 |
C |
p. 120-135
|
artikel
|
| 3048 |
On the maximum forcing and anti-forcing numbers of
(
4
,
6
)
-fullerenes
|
Shi, Lingjuan
|
|
2017
|
96-97 |
C |
p. 187-194
8 p.
|
artikel
|
| 3049 |
On the maximum length of coil-in-the-box codes in dimension 8
|
Östergård, Patric R.J.
|
|
2014
|
96-97 |
C |
p. 193-200
8 p.
|
artikel
|
| 3050 |
On the maximum sigma index of
k
-cyclic graphs
|
Ali, Akbar
|
|
|
96-97 |
C |
p. 58-62
|
artikel
|
| 3051 |
On the maximum weight of a planar graph of given order and size
|
Gajdoš, Andrej
|
|
2014
|
96-97 |
C |
p. 101-110
10 p.
|
artikel
|
| 3052 |
On the max min vertex cover problem
|
Boria, Nicolas
|
|
2015
|
96-97 |
C |
p. 62-71
10 p.
|
artikel
|
| 3053 |
On the Merrifield–Simmons index of tricyclic graphs
|
Das, Kinkar Chandra
|
|
|
96-97 |
C |
p. 342-354
|
artikel
|
| 3054 |
On the minimal alphabet size in multidimensional unrepetitive configurations
|
Kenkireth, Benny George
|
|
2019
|
96-97 |
C |
p. 258-266
|
artikel
|
| 3055 |
On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
|
Zhang, Minjie
|
|
2019
|
96-97 |
C |
p. 242-253
|
artikel
|
| 3056 |
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
|
Ma, Hongping
|
|
2015
|
96-97 |
C |
p. 186-198
13 p.
|
artikel
|
| 3057 |
On the minimal matching energies of unicyclic graphs
|
Zhu, Jianming
|
|
2019
|
96-97 |
C |
p. 246-255
|
artikel
|
| 3058 |
On the minimum and maximum selective graph coloring problems in some graph classes
|
Demange, Marc
|
|
2016
|
96-97 |
C |
p. 77-89
13 p.
|
artikel
|
| 3059 |
On the minimum Harary index of graphs with a given diameter or independence number
|
Borovićanin, Bojana
|
|
|
96-97 |
C |
p. 331-345
|
artikel
|
| 3060 |
On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
|
Nikseresht, Ashkan
|
|
2016
|
96-97 |
C |
p. 99-105
7 p.
|
artikel
|
| 3061 |
On the minimum Kirchhoff index of graphs with a given number of cut vertices
|
Huang, Junlin
|
|
|
96-97 |
C |
p. 27-38
|
artikel
|
| 3062 |
On the minimum number of bond-edge types and tile types: An approach by edge-colorings of graphs
|
Bonvicini, Simona
|
|
|
96-97 |
C |
p. 1-13
|
artikel
|
| 3063 |
On the minimum size of graphs with given generalized connectivity
|
Zhao, Shu-Li
|
|
|
96-97 |
C |
p. 88-95
|
artikel
|
| 3064 |
On the minimum spectral radius of graphs with given order and dissociation number
|
Zhao, Jing
|
|
|
96-97 |
C |
p. 487-501
|
artikel
|
| 3065 |
On the minimum vertex cover of generalized Petersen graphs
|
Jin, Dannielle D.D.
|
|
2019
|
96-97 |
C |
p. 309-318
|
artikel
|
| 3066 |
On the monophonic convexity in complementary prisms
|
P.K., Neethu
|
|
|
96-97 |
C |
p. 224-230
|
artikel
|
| 3067 |
On the monotonicity of process number
|
Nisse, Nicolas
|
|
2016
|
96-97 |
C |
p. 103-111
|
artikel
|
| 3068 |
On the Nash number and the diminishing Grundy number of a graph
|
Havet, Frédéric
|
|
|
96-97 |
C |
p. 1-16
|
artikel
|
| 3069 |
On the nearest neighbor rule for the metric traveling salesman problem
|
Hougardy, Stefan
|
|
2015
|
96-97 |
C |
p. 101-103
3 p.
|
artikel
|
| 3070 |
On the non-unit count of interval graphs
|
Apke, A.
|
|
2015
|
96-97 |
C |
p. 2-7
6 p.
|
artikel
|
| 3071 |
On the
N
th 2-adic complexity of binary sequences identified with algebraic 2-adic integers
|
Chen, Zhixiong
|
|
|
96-97 |
C |
p. 279-289
|
artikel
|
| 3072 |
On the number of almost envy-free allocations
|
Suksompong, Warut
|
|
|
96-97 |
C |
p. 606-610
|
artikel
|
| 3073 |
On the number of alternating paths in random graphs
|
Bennett, Patrick
|
|
|
96-97 |
C |
p. 84-97
|
artikel
|
| 3074 |
On the number of edges in a graph with many two-hop disjoint paths
|
Takayama, Koki
|
|
|
96-97 |
C |
p. 718-723
|
artikel
|
| 3075 |
On the number of edges in some graphs
|
Lai, Chunhui
|
|
|
96-97 |
C |
p. 751-755
|
artikel
|
| 3076 |
On the number of maximal independent sets in minimum colorings of split graphs
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 352-356
|
artikel
|
| 3077 |
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
|
Kurz, Sascha
|
|
|
96-97 |
C |
p. 221-228
|
artikel
|
| 3078 |
On the number of optimal identifying codes in a twin-free graph
|
Honkala, Iiro
|
|
2015
|
96-97 |
C |
p. 111-119
9 p.
|
artikel
|
| 3079 |
On the number of perfect matchings in the line graph of a traceable graph
|
Chen, Haiyan
|
|
|
96-97 |
C |
p. 110-118
|
artikel
|
| 3080 |
On the number of perfect matchings of middle graphs
|
Lai, Jingchao
|
|
|
96-97 |
C |
p. 86-91
|
artikel
|
| 3081 |
On the number of points with pairwise integral distances on a circle
|
Bat-Ochir, Ganbileg
|
|
2019
|
96-97 |
C |
p. 17-32
|
artikel
|
| 3082 |
On the number of realizations of certain Henneberg graphs arising in protein conformation
|
Liberti, Leo
|
|
2014
|
96-97 |
C |
p. 213-232
20 p.
|
artikel
|
| 3083 |
On the number of transversals in a class of Latin squares
|
Donovan, Diane M.
|
|
2018
|
96-97 |
C |
p. 202-205
|
artikel
|
| 3084 |
On the number of transversals in latin squares
|
Potapov, Vladimir N.
|
|
2016
|
96-97 |
C |
p. 194-196
3 p.
|
artikel
|
| 3085 |
On the OBDD representation of some graph classes
|
Bollig, Beate
|
|
2016
|
96-97 |
C |
p. 34-53
20 p.
|
artikel
|
| 3086 |
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
|
Arockiaraj, Micheal
|
|
|
96-97 |
C |
p. 50-65
|
artikel
|
| 3087 |
On the oriented achromatic number of graphs
|
P.D., Pavan
|
|
|
96-97 |
C |
p. 48-61
|
artikel
|
| 3088 |
On the outdegree zeroth-order general Randić index of digraphs
|
Yang, Jiaxiang
|
|
|
96-97 |
C |
p. 76-86
|
artikel
|
| 3089 |
On the packing chromatic number of Moore graphs
|
Fresán-Figueroa, J.
|
|
|
96-97 |
C |
p. 185-193
|
artikel
|
| 3090 |
On the packing chromatic number of subcubic outerplanar graphs
|
Gastineau, Nicolas
|
|
2019
|
96-97 |
C |
p. 209-221
|
artikel
|
| 3091 |
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems
|
Javadi, Ramin
|
|
|
96-97 |
C |
p. 1-12
|
artikel
|
| 3092 |
On the partial order competition dimensions of chordal graphs
|
Choi, Jihoon
|
|
2017
|
96-97 |
C |
p. 89-96
8 p.
|
artikel
|
| 3093 |
On the partition dimension of trees
|
Rodríguez-Velázquez, Juan A.
|
|
2014
|
96-97 |
C |
p. 204-209
6 p.
|
artikel
|
| 3094 |
On the path separation number of graphs
|
Balogh, József
|
|
2016
|
96-97 |
C |
p. 26-33
8 p.
|
artikel
|
| 3095 |
On the pebbling numbers of Flower, Blanuša and Watkins snarks
|
Adauto, Matheus
|
|
|
96-97 |
C |
p. 336-346
|
artikel
|
| 3096 |
On the peripheral Wiener index of graphs
|
Hua, Hongbo
|
|
2019
|
96-97 |
C |
p. 135-142
|
artikel
|
| 3097 |
On the
P
3
-hull number of Hamming graphs
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 48-52
|
artikel
|
| 3098 |
On the
P
3
-hull number of some products of graphs
|
Coelho, Erika M.M.
|
|
2019
|
96-97 |
C |
p. 2-13
|
artikel
|
| 3099 |
On the phylogeny graphs of degree-bounded digraphs
|
Lee, Seung Chul
|
|
2017
|
96-97 |
C |
p. 83-93
11 p.
|
artikel
|
| 3100 |
On the polyhedral structure of uniform cut polytopes
|
Neto, José
|
|
2014
|
96-97 |
C |
p. 62-70
9 p.
|
artikel
|
| 3101 |
On the polynomiality of finding
K
DMDGP re-orders
|
Lavor, Carlile
|
|
2019
|
96-97 |
C |
p. 190-194
|
artikel
|
| 3102 |
On the potential function
σ
(
H
,
m
,
n
)
of an arbitrary bipartite graph
H
|
Yin, Jian-Hua
|
|
|
96-97 |
C |
p. 189-194
|
artikel
|
| 3103 |
On the precise value of the strong chromatic index of a planar graph with a large girth
|
Chang, Gerard Jennhwa
|
|
|
96-97 |
C |
p. 389-397
|
artikel
|
| 3104 |
On the pushable chromatic number of various types of grids
|
Bensmail, Julien
|
|
|
96-97 |
C |
p. 140-154
|
artikel
|
| 3105 |
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
|
Hua, Hongbo
|
|
|
96-97 |
C |
p. 297-300
|
artikel
|
| 3106 |
On the radius of nonsplit graphs and information dissemination in dynamic networks
|
Függer, Matthias
|
|
|
96-97 |
C |
p. 257-264
|
artikel
|
| 3107 |
On the rainbow planar Turán number of double stars
|
He, Shunhai
|
|
|
96-97 |
C |
p. 167-175
|
artikel
|
| 3108 |
On the random version of the Erdős matching conjecture
|
Alishahi, Meysam
|
|
2019
|
96-97 |
C |
p. 1-9
|
artikel
|
| 3109 |
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
|
da Fonseca, Guilherme D.
|
|
2016
|
96-97 |
C |
p. 45-55
11 p.
|
artikel
|
| 3110 |
On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching
|
Mazzuoccolo, Giuseppe
|
|
|
96-97 |
C |
p. 19-25
|
artikel
|
| 3111 |
On the ratio of prefix codes to all uniquely decodable codes with a given length distribution
|
Woryna, Adam
|
|
2018
|
96-97 |
C |
p. 205-213
|
artikel
|
| 3112 |
On the ratio of the domination number and the independent domination number in graphs
|
Furuya, Michitaka
|
|
2014
|
96-97 |
C |
p. 157-159
3 p.
|
artikel
|
| 3113 |
On the readability of overlap digraphs
|
Chikhi, Rayan
|
|
2016
|
96-97 |
C |
p. 35-44
10 p.
|
artikel
|
| 3114 |
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges
|
da Fonseca, Guilherme Dias
|
|
2015
|
96-97 |
C |
p. 3-19
17 p.
|
artikel
|
| 3115 |
On the reformulated reciprocal sum-degree distance of graph transformations
|
Li, Shuchao
|
|
2015
|
96-97 |
C |
p. 162-173
12 p.
|
artikel
|
| 3116 |
On the regularization of a cooperative solution in a multistage game with random time horizon
|
Gromova, E.V.
|
|
2019
|
96-97 |
C |
p. 40-55
|
artikel
|
| 3117 |
On the reliability of generalized Petersen graphs
|
Boruzanlı Ekinci, Gülnaz
|
|
2019
|
96-97 |
C |
p. 2-9
|
artikel
|
| 3118 |
On the representation number of a crown graph
|
Glen, Marc
|
|
2018
|
96-97 |
C |
p. 89-93
|
artikel
|
| 3119 |
On the resilience of canonical reducible permutation graphs
|
Bento, Lucila M.S.
|
|
2018
|
96-97 |
C |
p. 32-46
|
artikel
|
| 3120 |
On the resistance diameters of graphs and their line graphs
|
Xu, Si-Ao
|
|
|
96-97 |
C |
p. 174-185
|
artikel
|
| 3121 |
On the robustness of the metric dimension of grid graphs to adding a single edge
|
Mashkaria, Satvik
|
|
|
96-97 |
C |
p. 1-27
|
artikel
|
| 3122 |
On the roots of domination polynomial of graphs
|
Oboudi, Mohammad Reza
|
|
2016
|
96-97 |
C |
p. 126-131
6 p.
|
artikel
|
| 3123 |
On the scramble number of graphs
|
Echavarria, Marino
|
|
|
96-97 |
C |
p. 43-59
|
artikel
|
| 3124 |
On the second-order nonlinearity of the hidden weighted bit function
|
Wang, Qichun
|
|
2016
|
96-97 |
C |
p. 197-202
6 p.
|
artikel
|
| 3125 |
On the secure domination numbers of maximal outerplanar graphs
|
Araki, Toru
|
|
2018
|
96-97 |
C |
p. 23-29
|
artikel
|
| 3126 |
On the security number of the Cartesian product of graphs
|
Jakovac, Marko
|
|
|
96-97 |
C |
p. 119-128
|
artikel
|
| 3127 |
On the semi-proper orientations of graphs
|
Dehghan, Ali
|
|
|
96-97 |
C |
p. 9-25
|
artikel
|
| 3128 |
On the semitotal domination number of line graphs
|
Zhu, Enqiang
|
|
2019
|
96-97 |
C |
p. 295-298
|
artikel
|
| 3129 |
On the signed Roman
k
-domination: Complexity and thin torus graphs
|
Shao, Zehui
|
|
2017
|
96-97 |
C |
p. 175-186
12 p.
|
artikel
|
| 3130 |
On the signed total Roman domination and domatic numbers of graphs
|
Volkmann, Lutz
|
|
2016
|
96-97 |
C |
p. 179-186
8 p.
|
artikel
|
| 3131 |
On the signless Laplacian Estrada index of bicyclic graphs
|
Wang, Kun
|
|
2018
|
96-97 |
C |
p. 169-174
|
artikel
|
| 3132 |
On the signless Laplacian Estrada index of cacti
|
Wang, Kun
|
|
2019
|
96-97 |
C |
p. 189-195
|
artikel
|
| 3133 |
On the (signless Laplacian) spectral radius of minimally
k
-(edge)-connected graphs for small
k
|
Fan, Dandan
|
|
|
96-97 |
C |
p. 154-163
|
artikel
|
| 3134 |
On the size of graphs without repeated cycle lengths
|
Lai, Chunhui
|
|
2017
|
96-97 |
C |
p. 226-229
|
artikel
|
| 3135 |
On the size of immune sets in the
k
-PULL infection model
|
Fàbrega, Josep
|
|
|
96-97 |
C |
p. 166-177
|
artikel
|
| 3136 |
On the size of minimal separators for treedepth decomposition
|
Xu, Zijian
|
|
|
96-97 |
C |
p. 262-270
|
artikel
|
| 3137 |
On the size of the largest empty box amidst a point set
|
Aistleitner, Christoph
|
|
2017
|
96-97 |
C |
p. 146-150
5 p.
|
artikel
|
| 3138 |
On the sizes of generalized cactus graphs
|
Zhang, Licheng
|
|
|
96-97 |
C |
p. 184-191
|
artikel
|
| 3139 |
On the skewness of Cartesian products with trees
|
Ouyang, Zhangdong
|
|
2019
|
96-97 |
C |
p. 131-141
|
artikel
|
| 3140 |
On the skewness of products of graphs
|
Chia, Gek L.
|
|
|
96-97 |
C |
p. 295-303
|
artikel
|
| 3141 |
On the skew-permanental polynomials of orientation graphs
|
Li, Wei
|
|
2016
|
96-97 |
C |
p. 79-87
9 p.
|
artikel
|
| 3142 |
On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching
|
Barik, Sasmita
|
|
|
96-97 |
C |
p. 311-318
|
artikel
|
| 3143 |
On the spanning connectivity of tournaments
|
Zhang, Bo
|
|
2018
|
96-97 |
C |
p. 218-222
|
artikel
|
| 3144 |
On the 2-spanning cyclability of honeycomb toroidal graphs
|
Alspach, Brian
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 3145 |
On the Sprague–Grundyfunction of Exact
k
-Nim
|
Boros, Endre
|
|
2018
|
96-97 |
C |
p. 1-14
|
artikel
|
| 3146 |
On the star decomposition of a graph: Hardness results and approximation for the max–min optimization problem
|
Cicalese, Ferdinando
|
|
|
96-97 |
C |
p. 503-515
|
artikel
|
| 3147 |
On the star of the family of independent sets in a graph
|
Zhang, Huihui
|
|
|
96-97 |
C |
p. 170-178
|
artikel
|
| 3148 |
On the strong Roman domination number of graphs
|
Álvarez-Ruiz, M.P.
|
|
2017
|
96-97 |
C |
p. 44-59
16 p.
|
artikel
|
| 3149 |
On the structure and deficiency of
k
-trees with bounded degree
|
Borowiecka-Olszewska, Marta
|
|
2016
|
96-97 |
C |
p. 24-37
14 p.
|
artikel
|
| 3150 |
On the structure and the number of prime implicants of 2-
CNF
s
|
Talebanfard, Navid
|
|
2016
|
96-97 |
C |
p. 1-4
4 p.
|
artikel
|
| 3151 |
On the structure of arbitrarily partitionable graphs with given connectivity
|
Baudon, Olivier
|
|
2014
|
96-97 |
C |
p. 381-385
5 p.
|
artikel
|
| 3152 |
On the structure of essentially-highly-connected polyhedral graphs
|
Čekanová, K.
|
|
|
96-97 |
C |
p. 308-315
|
artikel
|
| 3153 |
On the structure of Laplacian characteristic polynomial for circulant foliation
|
Kwon, Y.S.
|
|
|
96-97 |
C |
p. 338-349
|
artikel
|
| 3154 |
On the structure of linear programs with overlapping cardinality constraints
|
Fischer, Tobias
|
|
|
96-97 |
C |
p. 42-68
|
artikel
|
| 3155 |
On the structure of 4-regular planar well-covered graphs
|
Finbow, Arthur S.
|
|
|
96-97 |
C |
p. 655-688
|
artikel
|
| 3156 |
On the structure of the inverse of non-singular unicyclic graphs
|
Jaume, Daniel A.
|
|
|
96-97 |
C |
p. 316-332
|
artikel
|
| 3157 |
On the subgraph epimorphism problem
|
Gay, Steven
|
|
2014
|
96-97 |
C |
p. 214-228
15 p.
|
artikel
|
| 3158 |
On the submodularity of multi-depot traveling salesman games
|
Platz, Trine Tornøe
|
|
2019
|
96-97 |
C |
p. 75-85
|
artikel
|
| 3159 |
On the sum of all distances in bipartite graphs
|
Li, Shuchao
|
|
2014
|
96-97 |
C |
p. 176-185
10 p.
|
artikel
|
| 3160 |
On the sum of
k
largest distance eigenvalues of graphs
|
Lin, Huiqiu
|
|
2019
|
96-97 |
C |
p. 153-159
|
artikel
|
| 3161 |
On the sum of the squares of all distances in bipartite graphs with given connectivity
|
Geng, Xianya
|
|
2018
|
96-97 |
C |
p. 206-212
|
artikel
|
| 3162 |
On the super domination number of lexicographic product graphs
|
Dettlaff, M.
|
|
2019
|
96-97 |
C |
p. 118-129
|
artikel
|
| 3163 |
On the Szeged index of unicyclic graphs with given diameter
|
Liu, Yan
|
|
2017
|
96-97 |
C |
p. 118-130
13 p.
|
artikel
|
| 3164 |
On the termination of some biclique operators on multipartite graphs
|
Crespelle, Christophe
|
|
2015
|
96-97 |
C |
p. 59-73
15 p.
|
artikel
|
| 3165 |
On the thinness and proper thinness of a graph
|
Bonomo, Flavia
|
|
2019
|
96-97 |
C |
p. 78-92
|
artikel
|
| 3166 |
On the thinness of trees
|
Bonomo-Braberman, Flavia
|
|
|
96-97 |
C |
p. 39-60
|
artikel
|
| 3167 |
On the third largest eigenvalue of eccentricity matrices of graphs
|
Song, Yuanfen
|
|
|
96-97 |
C |
p. 237-259
|
artikel
|
| 3168 |
On the toll number of a graph
|
Dravec, Tanja
|
|
|
96-97 |
C |
p. 250-257
|
artikel
|
| 3169 |
On the total forcing number of a graph
|
Davila, Randy
|
|
2019
|
96-97 |
C |
p. 115-127
|
artikel
|
| 3170 |
On the total version of the covering Italian domination problem
|
M., Alfred Raju
|
|
|
96-97 |
C |
p. 333-343
|
artikel
|
| 3171 |
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs
|
Davoodi, Akbar
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 3172 |
On the tractability of
(
k
,
i
)
-coloring
|
Bhyravarapu, Sriram
|
|
|
96-97 |
C |
p. 329-339
|
artikel
|
| 3173 |
On the tractability of some natural packing, covering and partitioning problems
|
Bernáth, Attila
|
|
2015
|
96-97 |
C |
p. 25-35
11 p.
|
artikel
|
| 3174 |
On the transportation problem with market choice
|
Damcı-Kurt, Pelin
|
|
2015
|
96-97 |
C |
p. 54-77
24 p.
|
artikel
|
| 3175 |
On the tree-depth of random graphs
|
Perarnau, G.
|
|
2014
|
96-97 |
C |
p. 119-126
8 p.
|
artikel
|
| 3176 |
On the treewidth of toroidal grids
|
Kiyomi, Masashi
|
|
2016
|
96-97 |
C |
p. 303-306
4 p.
|
artikel
|
| 3177 |
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
|
Hakanen, Anni
|
|
|
96-97 |
C |
p. 191-207
|
artikel
|
| 3178 |
On the unimodality of Zhang-Zhang polynomials of parallelogram chains
|
Li, Guanru
|
|
|
96-97 |
C |
p. 224-230
|
artikel
|
| 3179 |
On the uniqueness of some girth eight algebraically defined graphs
|
Kronenthal, Brian G.
|
|
2016
|
96-97 |
C |
p. 188-194
7 p.
|
artikel
|
| 3180 |
On the uniqueness of some girth eight algebraically defined graphs, Part II
|
Kronenthal, Brian G.
|
|
2019
|
96-97 |
C |
p. 161-170
|
artikel
|
| 3181 |
On the van der Waerden numbers
w
(
2
;
3
,
t
)
|
Ahmed, Tanbir
|
|
2014
|
96-97 |
C |
p. 27-51
25 p.
|
artikel
|
| 3182 |
On the variable Wiener–Szeged inequality
|
Vukićević, Žana Kovijanić
|
|
|
96-97 |
C |
p. 15-18
|
artikel
|
| 3183 |
On the vertex stability numbers of graphs
|
Kemnitz, Arnfried
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 3184 |
On the vertices belonging to all, some, none minimum dominating set
|
Bouquet, Valentin
|
|
|
96-97 |
C |
p. 9-19
|
artikel
|
| 3185 |
On the von Neumann entropy of a graph
|
Lin, Hongying
|
|
|
96-97 |
C |
p. 448-455
|
artikel
|
| 3186 |
On the WalkerMaker–WalkerBreaker games
|
Forcan, Jovana
|
|
|
96-97 |
C |
p. 69-79
|
artikel
|
| 3187 |
On the weak chromatic number of random hypergraphs
|
Semenov, Alexander
|
|
|
96-97 |
C |
p. 134-154
|
artikel
|
| 3188 |
On the weak Roman domination number of lexicographic product graphs
|
Valveny, Magdalena
|
|
2019
|
96-97 |
C |
p. 257-270
|
artikel
|
| 3189 |
On the weighted
k
-path vertex cover problem
|
Brešar, B.
|
|
2014
|
96-97 |
C |
p. 14-18
5 p.
|
artikel
|
| 3190 |
On the weightwise nonlinearity of weightwise perfectly balanced functions
|
Gini, Agnese
|
|
|
96-97 |
C |
p. 320-341
|
artikel
|
| 3191 |
On the Wiener index, distance cospectrality and transmission-regular graphs
|
Abiad, Aida
|
|
2017
|
96-97 |
C |
p. 1-10
10 p.
|
artikel
|
| 3192 |
On the Wiener index of generalized Fibonacci cubes and Lucas cubes
|
Klavžar, Sandi
|
|
2015
|
96-97 |
C |
p. 155-160
6 p.
|
artikel
|
| 3193 |
On the Wiener index of orientations of graphs
|
Dankelmann, Peter
|
|
|
96-97 |
C |
p. 125-131
|
artikel
|
| 3194 |
On the zero blocking number of rectangular, cylindrical, and Möbius grids
|
Beaudouin-Lafon, Matthew
|
|
|
96-97 |
C |
p. 35-47
|
artikel
|
| 3195 |
On three blocks paths
P
(
k
,
l
,
r
)
|
El Joubbeh, Mouhamad
|
|
|
96-97 |
C |
p. 237-239
|
artikel
|
| 3196 |
On three outer-independent domination related parameters in graphs
|
Mojdeh, Doost Ali
|
|
|
96-97 |
C |
p. 115-124
|
artikel
|
| 3197 |
On three polynomial kernels of sequences for arbitrarily partitionable graphs
|
Bensmail, Julien
|
|
2016
|
96-97 |
C |
p. 19-29
11 p.
|
artikel
|
| 3198 |
On total
f
-domination: Polyhedral and algorithmic results
|
Dell’Amico, Mauro
|
|
2019
|
96-97 |
C |
p. 97-104
|
artikel
|
| 3199 |
On
(
t
,
r
)
broadcast domination numbers of grids
|
Blessing, David
|
|
2015
|
96-97 |
C |
p. 19-40
22 p.
|
artikel
|
| 3200 |
On triangulating
k
-outerplanar graphs
|
Biedl, Therese
|
|
2015
|
96-97 |
C |
p. 275-279
5 p.
|
artikel
|
| 3201 |
On two conjectures concerning spanning tree edge dependences of graphs
|
Yang, Yujun
|
|
|
96-97 |
C |
p. 32-42
|
artikel
|
| 3202 |
On two eccentricity-based topological indices of graphs
|
Xu, Kexiang
|
|
2017
|
96-97 |
C |
p. 240-251
12 p.
|
artikel
|
| 3203 |
On two open problems on the normality of bent functions
|
Polujan, Alexandr
|
|
|
96-97 |
C |
p. 115-118
|
artikel
|
| 3204 |
On two problems related to anti-adjacency (eccentricity) matrix
|
Sorgun, Sezer
|
|
|
96-97 |
C |
p. 1-9
|
artikel
|
| 3205 |
On two-sided Max-Linear equations
|
Jones, Daniel
|
|
2019
|
96-97 |
C |
p. 146-160
|
artikel
|
| 3206 |
On unimodular graphs with a unique perfect matching
|
Basumatary, Parameswar
|
|
|
96-97 |
C |
p. 49-61
|
artikel
|
| 3207 |
On upper bounds for the independent transversal domination number
|
Brause, Christoph
|
|
2018
|
96-97 |
C |
p. 66-72
|
artikel
|
| 3208 |
On variants of conflict-free-coloring for hypergraphs
|
Cui, Zhen
|
|
2017
|
96-97 |
C |
p. 46-54
9 p.
|
artikel
|
| 3209 |
On variants of Vertex Geography on undirected graphs
|
Monti, A.
|
|
2018
|
96-97 |
C |
p. 268-275
|
artikel
|
| 3210 |
On vertices contained in all or in no metric basis
|
Hakanen, Anni
|
|
|
96-97 |
C |
p. 407-423
|
artikel
|
| 3211 |
On vertices of outdegree
k
in minimally
k
-arc-connected digraphs
|
Fan, Jun
|
|
|
96-97 |
C |
p. 465-472
|
artikel
|
| 3212 |
On weakly and strongly popular rankings
|
Kraiczy, Sonja
|
|
|
96-97 |
C |
p. 134-152
|
artikel
|
| 3213 |
On well-covered pentagonalizations of the plane
|
Finbow, Arthur S.
|
|
2017
|
96-97 |
C |
p. 91-105
15 p.
|
artikel
|
| 3214 |
On Wiener and multiplicative Wiener indices of graphs
|
Das, Kinkar Ch.
|
|
2016
|
96-97 |
C |
p. 9-14
6 p.
|
artikel
|
| 3215 |
On Wiener index and average eccentricity of graphs of girth at least 6 and
(
C
4
,
C
5
)
-free graphs
|
Alochukwu, Alex
|
|
|
96-97 |
C |
p. 98-111
|
artikel
|
| 3216 |
On zero-sum free sequences contained in random subsets of finite cyclic groups
|
Lee, Sang June
|
|
|
96-97 |
C |
p. 118-127
|
artikel
|
| 3217 |
Open-end bin packing: New and old analysis approaches
|
Epstein, Leah
|
|
|
96-97 |
C |
p. 220-239
|
artikel
|
| 3218 |
Open problems on the exponential vertex-degree-based topological indices of graphs
|
Das, Kinkar Chandra
|
|
|
96-97 |
C |
p. 38-49
|
artikel
|
| 3219 |
Open shop scheduling problems with conflict graphs
|
Tellache, Nour El Houda
|
|
2017
|
96-97 |
C |
p. 103-120
|
artikel
|
| 3220 |
Opinion forming in Erdős–Rényi random graph and expanders
|
Zehmakan, Ahad N.
|
|
|
96-97 |
C |
p. 280-290
|
artikel
|
| 3221 |
Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
|
Lin, Ran
|
|
|
96-97 |
C |
p. 71-83
|
artikel
|
| 3222 |
Optimal binary codes from trace codes over a non-chain ring
|
Shi, Minjia
|
|
2017
|
96-97 |
C |
p. 176-181
6 p.
|
artikel
|
| 3223 |
Optimal constraints aggregation method for ILP
|
Poirion, Pierre-Louis
|
|
2019
|
96-97 |
C |
p. 148-157
|
artikel
|
| 3224 |
Optimal covering of the equidistant square grid network
|
Letnik, Tomislav
|
|
|
96-97 |
C |
p. 85-89
|
artikel
|
| 3225 |
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol
|
Fortz, Bernard
|
|
2018
|
96-97 |
C |
p. 114-130
|
artikel
|
| 3226 |
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
|
Jha, Pranava K.
|
|
|
96-97 |
C |
p. 218-231
|
artikel
|
| 3227 |
Optimal FHSs and DSSs via near zero-difference balanced functions
|
Xu, Shanding
|
|
|
96-97 |
C |
p. 433-447
|
artikel
|
| 3228 |
Optimal identifying codes of two families of Cayley graphs
|
Feng, Min
|
|
|
96-97 |
C |
p. 199-210
|
artikel
|
| 3229 |
Optimal
L
(
3
,
2
,
1
)
-labeling of triangular lattice
|
Das, Sandip
|
|
2017
|
96-97 |
C |
p. 32-40
9 p.
|
artikel
|
| 3230 |
Optimal non-projective linear codes constructed from down-sets
|
Hyun, Jong Yoon
|
|
2019
|
96-97 |
C |
p. 135-145
|
artikel
|
| 3231 |
Optimal odd gossiping
|
Fertin, Guillaume
|
|
|
96-97 |
C |
p. 53-69
|
artikel
|
| 3232 |
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
|
Czyzowicz, J.
|
|
|
96-97 |
C |
p. 650-662
|
artikel
|
| 3233 |
Optimal open-locating-dominating sets in infinite triangular grids
|
Kincaid, Rex
|
|
2015
|
96-97 |
C |
p. 139-144
6 p.
|
artikel
|
| 3234 |
Optimal ordering of independent tests with precedence constraints
|
Berend, D.
|
|
2014
|
96-97 |
C |
p. 115-127
13 p.
|
artikel
|
| 3235 |
Optimal ordering of statistically dependent tests
|
Berend, Daniel
|
|
2017
|
96-97 |
C |
p. 17-31
15 p.
|
artikel
|
| 3236 |
Optimal partitioning of data chunks in deduplication systems
|
Hirsch, M.
|
|
2016
|
96-97 |
C |
p. 104-114
11 p.
|
artikel
|
| 3237 |
Optimal pathway reconstruction on 3D NMR maps
|
Szachniuk, Marta
|
|
2015
|
96-97 |
C |
p. 134-149
16 p.
|
artikel
|
| 3238 |
Optimal pebbling and rubbling of graphs with given diameter
|
Győri, Ervin
|
|
2019
|
96-97 |
C |
p. 340-345
|
artikel
|
| 3239 |
Optimal pebbling number of graphs with given minimum degree
|
Czygrinow, A.
|
|
2019
|
96-97 |
C |
p. 117-130
|
artikel
|
| 3240 |
Optimal realizations and the block decomposition of a finite metric space
|
Huber, Katharina T.
|
|
|
96-97 |
C |
p. 103-113
|
artikel
|
| 3241 |
Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
|
Chiu, Steve Y
|
|
1999
|
96-97 |
C |
p. 327-336
10 p.
|
artikel
|
| 3242 |
Optimal strategies for selecting coordinators
|
Zeiner, Martin
|
|
|
96-97 |
C |
p. 392-415
|
artikel
|
| 3243 |
Optimal transport and integer partitions
|
Hohloch, Sonja
|
|
2015
|
96-97 |
C |
p. 75-85
11 p.
|
artikel
|
| 3244 |
Optimal transport for some symmetric, multidimensional integer partitions
|
Adu, Daniel Owusu
|
|
|
96-97 |
C |
p. 159-165
|
artikel
|
| 3245 |
Optimal
(
t
,
r
)
broadcasts on the infinite grid
|
Drews, Benjamin F.
|
|
2019
|
96-97 |
C |
p. 183-197
|
artikel
|
| 3246 |
Optimization over degree sequences of graphs
|
Deza, Gabriel
|
|
|
96-97 |
C |
p. 2-8
|
artikel
|
| 3247 |
Optimization problems in dotted interval graphs
|
Hermelin, Danny
|
|
2014
|
96-97 |
C |
p. 66-72
7 p.
|
artikel
|
| 3248 |
Optimization tools for computing colorings of
[
1
,
…
,
n
]
with few monochromatic solutions on 3-variable linear equations
|
De Loera, Jesús A.
|
|
|
96-97 |
C |
p. 159-178
|
artikel
|
| 3249 |
Optimizing movement in convex and non-convex path-networks to establish connectivity
|
Das, Sandip
|
|
|
96-97 |
C |
p. 62-77
|
artikel
|
| 3250 |
Optimum basis of finite convex geometry
|
Adaricheva, K.
|
|
2017
|
96-97 |
C |
p. 11-20
10 p.
|
artikel
|
| 3251 |
Orbital shrinking: Theory and applications
|
Fischetti, Matteo
|
|
2017
|
96-97 |
C |
p. 109-123
15 p.
|
artikel
|
| 3252 |
Ordered biclique partitions and communication complexity problems
|
Shigeta, Manami
|
|
2015
|
96-97 |
C |
p. 248-252
5 p.
|
artikel
|
| 3253 |
Ordered size Ramsey number of paths
|
Balogh, József
|
|
|
96-97 |
C |
p. 13-18
|
artikel
|
| 3254 |
Ordered weighted average combinatorial optimization: Formulations and their properties
|
Fernández, Elena
|
|
2014
|
96-97 |
C |
p. 97-118
22 p.
|
artikel
|
| 3255 |
Ordering trees by their distance spectral radii
|
Lin, Wenshui
|
|
2016
|
96-97 |
C |
p. 106-110
5 p.
|
artikel
|
| 3256 |
Ordinal sums of impartial games
|
Carvalho, Alda
|
|
2018
|
96-97 |
C |
p. 39-45
|
artikel
|
| 3257 |
Ore’s condition for completely independent spanning trees
|
Fan, Genghua
|
|
2014
|
96-97 |
C |
p. 95-100
6 p.
|
artikel
|
| 3258 |
Ore-type condition for Hamilton
ℓ
-cycle in
k
-uniform hypergraphs
|
Jiang, Taijiang
|
|
|
96-97 |
C |
p. 270-275
|
artikel
|
| 3259 |
Organizing the atoms of the clique separator decomposition into an atom tree
|
Berry, Anne
|
|
2014
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 3260 |
Orientable domination in product-like graphs
|
Anderson, Sarah
|
|
|
96-97 |
C |
p. 62-69
|
artikel
|
| 3261 |
Orientations of graphs with maximum Wiener index
|
Knor, Martin
|
|
2016
|
96-97 |
C |
p. 121-129
9 p.
|
artikel
|
| 3262 |
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
|
Coelho, H.
|
|
2016
|
96-97 |
C |
p. 109-117
9 p.
|
artikel
|
| 3263 |
Oriented diameter of star graphs
|
Kumar, K.S. Ajish
|
|
|
96-97 |
C |
p. 362-371
|
artikel
|
| 3264 |
Oriented Hamiltonian paths in digraphs with arbitrary chromatic number
|
El Zein, Ayman
|
|
|
96-97 |
C |
p. 295-297
|
artikel
|
| 3265 |
Outer-independent total Roman domination in graphs
|
Cabrera Martínez, Abel
|
|
2019
|
96-97 |
C |
p. 107-119
|
artikel
|
| 3266 |
Outerplane bipartite graphs with isomorphic resonance graphs
|
Brezovnik, Simon
|
|
|
96-97 |
C |
p. 340-349
|
artikel
|
| 3267 |
Output-sensitive enumeration of maximal cliques in temporal graphs
|
Brunelli, Filippo
|
|
|
96-97 |
C |
p. 66-77
|
artikel
|
| 3268 |
Overlaid species forests
|
Huber, K.T.
|
|
|
96-97 |
C |
p. 110-122
|
artikel
|
| 3269 |
Overlaying a hypergraph with a graph with bounded maximum degree
|
Havet, Frédéric
|
|
|
96-97 |
C |
p. 394-406
|
artikel
|
| 3270 |
Packing and domination parameters in digraphs
|
Mojdeh, Doost Ali
|
|
2019
|
96-97 |
C |
p. 184-192
|
artikel
|
| 3271 |
Packing 2- and 3-stars into
(
2
,
3
)
-regular graphs
|
Xi, Wenying
|
|
|
96-97 |
C |
p. 440-452
|
artikel
|
| 3272 |
Packing a number of copies of a
(
p
,
q
)
-graph
|
Wang, Yun
|
|
|
96-97 |
C |
p. 302-312
|
artikel
|
| 3273 |
Packing bipartite graphs with covers of complete bipartite graphs
|
Chalopin, Jérémie
|
|
2014
|
96-97 |
C |
p. 40-50
11 p.
|
artikel
|
| 3274 |
Packing coloring of hypercubes with extended Hamming codes
|
Gregor, Petr
|
|
|
96-97 |
C |
p. 269-277
|
artikel
|
| 3275 |
Packing
(
1
,
1
,
2
,
2
)
-coloring of some subcubic graphs
|
Liu, Runrun
|
|
|
96-97 |
C |
p. 626-630
|
artikel
|
| 3276 |
Packing
(
1
,
1
,
2
,
4
)
-coloring of subcubic outerplanar graphs
|
Kostochka, Alexandr
|
|
|
96-97 |
C |
p. 8-15
|
artikel
|
| 3277 |
Packing
K
r
s in bounded degree graphs
|
McKay, Michael
|
|
|
96-97 |
C |
p. 20-32
|
artikel
|
| 3278 |
Packing non-zero
A
-paths via matroid matching
|
Tanigawa, Shin-ichi
|
|
2016
|
96-97 |
C |
p. 169-178
10 p.
|
artikel
|
| 3279 |
Packing of maximal independent mixed arborescences
|
Gao, Hui
|
|
|
96-97 |
C |
p. 313-319
|
artikel
|
| 3280 |
Packing of permutations into Latin squares
|
Foldes, Stephan
|
|
|
96-97 |
C |
p. 102-108
|
artikel
|
| 3281 |
Packing, partitioning, and covering symresacks
|
Hojny, Christopher
|
|
|
96-97 |
C |
p. 689-717
|
artikel
|
| 3282 |
Packing two copies of a tree into a bipartite graph with restrained maximum degree
|
Li, Hui
|
|
|
96-97 |
C |
p. 23-34
|
artikel
|
| 3283 |
PageRank optimization by edge selection
|
Csáji, Balázs Csanád
|
|
2014
|
96-97 |
C |
p. 73-87
15 p.
|
artikel
|
| 3284 |
Pagoda functions for peg solitaire on graphs
|
Kreh, Martin
|
|
|
96-97 |
C |
p. 184-202
|
artikel
|
| 3285 |
Paintability of complete bipartite graphs
|
Kashima, Masaki
|
|
|
96-97 |
C |
p. 279-289
|
artikel
|
| 3286 |
Paired-domination game played on cycles
|
Gray, Aaron D.
|
|
|
96-97 |
C |
p. 132-140
|
artikel
|
| 3287 |
Paired-domination in claw-free graphs with minimum degree at least three
|
Lu, Changhong
|
|
2019
|
96-97 |
C |
p. 250-259
|
artikel
|
| 3288 |
Paired many-to-many disjoint path covers of hypertori
|
Kronenthal, Brian G.
|
|
2017
|
96-97 |
C |
p. 14-20
7 p.
|
artikel
|
| 3289 |
Paired threshold graphs
|
Ravanmehr, Vida
|
|
2018
|
96-97 |
C |
p. 291-308
|
artikel
|
| 3290 |
Palindromic factorization of rich words
|
Rukavicka, Josef
|
|
|
96-97 |
C |
p. 95-102
|
artikel
|
| 3291 |
Panconnectivity and edge-pancyclicity of multidimensional torus networks
|
Chen, Xie-Bin
|
|
2014
|
96-97 |
C |
p. 33-45
13 p.
|
artikel
|
| 3292 |
Parallel algorithms for enumerating closed patterns from multi-relational data
|
Seki, Hirohisa
|
|
2018
|
96-97 |
C |
p. 120-134
|
artikel
|
| 3293 |
Parallelograms and the VC-dimension of the distance sets
|
Pham, Thang
|
|
|
96-97 |
C |
p. 195-200
|
artikel
|
| 3294 |
Parameterized algorithms for Module Map problems
|
Sommer, Frank
|
|
|
96-97 |
C |
p. 396-416
|
artikel
|
| 3295 |
Parameterized algorithms for the Happy Set problem
|
Asahiro, Yuichi
|
|
|
96-97 |
C |
p. 32-44
|
artikel
|
| 3296 |
Parameterized and exact algorithms for class domination coloring
|
Krithika, R.
|
|
|
96-97 |
C |
p. 286-299
|
artikel
|
| 3297 |
Parameterized clique on inhomogeneous random graphs
|
Friedrich, Tobias
|
|
2015
|
96-97 |
C |
p. 130-138
9 p.
|
artikel
|
| 3298 |
Parameterized complexity for iterated type partitions and modular-width
|
Cordasco, Gennaro
|
|
|
96-97 |
C |
p. 100-122
|
artikel
|
| 3299 |
Parameterized complexity of distance labeling and uniform channel assignment problems
|
Fiala, Jiří
|
|
2018
|
96-97 |
C |
p. 46-55
|
artikel
|
| 3300 |
Parameterized complexity of fair deletion problems
|
Masařík, Tomáš
|
|
|
96-97 |
C |
p. 51-61
|
artikel
|
| 3301 |
Parameterized complexity of independent set reconfiguration problems
|
Ito, Takehiro
|
|
|
96-97 |
C |
p. 336-345
|
artikel
|
| 3302 |
Parameterized complexity of locally minimal defensive alliances
|
Gaikwad, Ajinkya
|
|
|
96-97 |
C |
p. 324-340
|
artikel
|
| 3303 |
Parameterized Edge Hamiltonicity
|
Lampis, Michael
|
|
2018
|
96-97 |
C |
p. 68-78
|
artikel
|
| 3304 |
Parameterized extension complexity of independent set and related problems
|
Gajarský, Jakub
|
|
2018
|
96-97 |
C |
p. 56-67
|
artikel
|
| 3305 |
Parametric bisubmodular function minimization and its associated signed ring family
|
Fujishige, Satoru
|
|
2017
|
96-97 |
C |
p. 142-148
|
artikel
|
| 3306 |
Pareto-scheduling of two competing agents with total weighted tardiness being one criterion
|
Sun, Jinwen
|
|
|
96-97 |
C |
p. 137-148
|
artikel
|
| 3307 |
Parikh word representability of bipartite permutation graphs
|
Teh, Wen Chean
|
|
|
96-97 |
C |
p. 208-221
|
artikel
|
| 3308 |
Parity polytopes and binarization
|
Ermel, Dominik
|
|
|
96-97 |
C |
p. 24-30
|
artikel
|
| 3309 |
Partial domination of maximal outerplanar graphs
|
Borg, Peter
|
|
|
96-97 |
C |
p. 306-314
|
artikel
|
| 3310 |
Partially directed snake polyominoes
|
Goupil, Alain
|
|
2018
|
96-97 |
C |
p. 223-234
|
artikel
|
| 3311 |
Partially unate Boolean functions: Properties of their sum-of-products representations
|
Damiani, Maurizio
|
|
|
96-97 |
C |
p. 278-292
|
artikel
|
| 3312 |
Partial Petrial polynomials for complete graphs and paths
|
Yan, Qi
|
|
|
96-97 |
C |
p. 281-289
|
artikel
|
| 3313 |
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
|
Jabali, Ola
|
|
2014
|
96-97 |
C |
p. 121-136
16 p.
|
artikel
|
| 3314 |
Partition dimension of rooted product graphs
|
Monica, Mohan Chris
|
|
2019
|
96-97 |
C |
p. 138-147
|
artikel
|
| 3315 |
Partition games
|
Dailly, Antoine
|
|
|
96-97 |
C |
p. 509-525
|
artikel
|
| 3316 |
Partitioning a graph into disjoint cliques and a triangle-free graph
|
Abu-Khzam, Faisal N.
|
|
2015
|
96-97 |
C |
p. 1-12
12 p.
|
artikel
|
| 3317 |
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
|
Grubman, Tony
|
|
2016
|
96-97 |
C |
p. 101-113
13 p.
|
artikel
|
| 3318 |
Partitioning graphs into induced subgraphs
|
Knop, Dušan
|
|
|
96-97 |
C |
p. 31-42
|
artikel
|
| 3319 |
Partitioning of a graph into induced subgraphs not containing prescribed cliques
|
Rowshan, Yaser
|
|
|
96-97 |
C |
p. 68-80
|
artikel
|
| 3320 |
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
|
Tangjai, Wipawee
|
|
|
96-97 |
C |
p. 347-354
|
artikel
|
| 3321 |
Partitioning
P
4
-tidy graphs into a stable set and a forest
|
Bravo, Raquel
|
|
|
96-97 |
C |
p. 22-29
|
artikel
|
| 3322 |
Partitioning the vertices of a cubic graph into two total dominating sets
|
Desormeaux, Wyatt J.
|
|
2017
|
96-97 |
C |
p. 52-63
12 p.
|
artikel
|
| 3323 |
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
|
Chiba, Shuya
|
|
|
96-97 |
C |
p. 1-13
|
artikel
|
| 3324 |
Partitioning vertices into in- and out-dominating sets in digraphs
|
Nakamura, Kosuke
|
|
|
96-97 |
C |
p. 43-54
|
artikel
|
| 3325 |
Partitioning vertices of graphs into paths of the same length
|
Duginov, Oleg
|
|
|
96-97 |
C |
p. 179-195
|
artikel
|
| 3326 |
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
|
Lv, Jian-Bo
|
|
|
96-97 |
C |
p. 44-48
|
artikel
|
| 3327 |
Partitions, diophantine equations, and control systems
|
Carriegos, Miguel V.
|
|
2019
|
96-97 |
C |
p. 96-104
|
artikel
|
| 3328 |
Partitions of graphs and multigraphs under degree constraints
|
Song, Jialei
|
|
|
96-97 |
C |
p. 134-145
|
artikel
|
| 3329 |
Partitions of multigraphs under minimum degree constraints
|
Schweser, Thomas
|
|
2019
|
96-97 |
C |
p. 269-275
|
artikel
|
| 3330 |
Partitions of
Z
m
with identical representation functions
|
Sun, Cui-Fang
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 3331 |
Partnership formation and multinomial values
|
Giménez, José Miguel
|
|
2014
|
96-97 |
C |
p. 7-20
14 p.
|
artikel
|
| 3332 |
Pasting gauges II: Balls in pasted halfplanes
|
Plastria, Frank
|
|
2019
|
96-97 |
C |
p. 138-156
|
artikel
|
| 3333 |
Pasting gauges I: Shortest paths across a hyperplane
|
Plastria, Frank
|
|
2019
|
96-97 |
C |
p. 105-137
|
artikel
|
| 3334 |
3-path-connectivity of Cayley graphs generated by transposition trees
|
Jin, Qihui
|
|
|
96-97 |
C |
p. 292-299
|
artikel
|
| 3335 |
Path-driven orientation of mixed graphs
|
Fertin, Guillaume
|
|
2015
|
96-97 |
C |
p. 98-108
11 p.
|
artikel
|
| 3336 |
Path eccentricity of graphs
|
Gómez, Renzo
|
|
|
96-97 |
C |
p. 1-13
|
artikel
|
| 3337 |
Path 3-(edge-)connectivity of lexicographic product graphs
|
Ma, Tianlong
|
|
|
96-97 |
C |
p. 152-161
|
artikel
|
| 3338 |
Path factors in subgraphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 183-191
|
artikel
|
| 3339 |
Paths and animals in infinite graphs with tempered degree growth
|
Kȩpa-Maksymowicz, Dorota
|
|
2014
|
96-97 |
C |
p. 137-145
9 p.
|
artikel
|
| 3340 |
Pattern-avoiding alternating words
|
Gao, Alice L.L.
|
|
2016
|
96-97 |
C |
p. 56-66
11 p.
|
artikel
|
| 3341 |
Pattern-avoiding
(
0
,
1
)
-matrices and bases of permutation matrices
|
Brualdi, Richard A.
|
|
|
96-97 |
C |
p. 196-211
|
artikel
|
| 3342 |
Pattern restricted Stirling
k
-ary words, the plateau statistic and the kernel method
|
Ma, Shi-Mei
|
|
2016
|
96-97 |
C |
p. 100-108
9 p.
|
artikel
|
| 3343 |
P
3
-convexity on graphs with diameter two: Computing hull and interval numbers
|
Cappelle, Márcia R.
|
|
|
96-97 |
C |
p. 368-378
|
artikel
|
| 3344 |
P
3
→
-decomposition of directed graphs
|
Diwan, Ajit A.
|
|
2017
|
96-97 |
C |
p. 73-79
7 p.
|
artikel
|
| 3345 |
Pebble exchange on graphs
|
Fujita, Shinya
|
|
2015
|
96-97 |
C |
p. 139-145
7 p.
|
artikel
|
| 3346 |
Percolation centrality via Rademacher Complexity
|
de Lima, Alane M.
|
|
|
96-97 |
C |
p. 201-216
|
artikel
|
| 3347 |
Perfect codes in
m
-Cayley hypergraphs
|
Wannatong, Kantapong
|
|
|
96-97 |
C |
p. 105-111
|
artikel
|
| 3348 |
Perfect codes in 2-valent Cayley digraphs on abelian groups
|
Yu, Shilong
|
|
|
96-97 |
C |
p. 236-240
|
artikel
|
| 3349 |
Perfect domination sets in Cayley graphs
|
Kwon, Young Soo
|
|
2014
|
96-97 |
C |
p. 259-263
5 p.
|
artikel
|
| 3350 |
Perfect double Roman domination of trees
|
Egunjobi, Ayotunde T.
|
|
|
96-97 |
C |
p. 71-85
|
artikel
|
| 3351 |
Perfect graphs with polynomially computable kernels
|
Pass-Lanneau, Adèle
|
|
|
96-97 |
C |
p. 69-74
|
artikel
|
| 3352 |
Perfect Italian domination in graphs: Complexity and algorithms
|
Pradhan, D.
|
|
|
96-97 |
C |
p. 271-295
|
artikel
|
| 3353 |
Perfect Italian domination in trees
|
Haynes, Teresa W.
|
|
2019
|
96-97 |
C |
p. 164-177
|
artikel
|
| 3354 |
Perfect Italian domination on planar and regular graphs
|
Lauri, Juho
|
|
|
96-97 |
C |
p. 676-687
|
artikel
|
| 3355 |
Perfect latin squares
|
Heinrich, Katherine
|
|
1992
|
96-97 |
C |
p. 281-286
6 p.
|
artikel
|
| 3356 |
1
-perfectly orientable
K
4
-minor-free and outerplanar graphs
|
Brešar, Boštjan
|
|
2018
|
96-97 |
C |
p. 33-45
|
artikel
|
| 3357 |
Perfect matching and distance spectral radius in graphs and bipartite graphs
|
Zhang, Yuke
|
|
|
96-97 |
C |
p. 315-322
|
artikel
|
| 3358 |
Perfect matching covering, the Berge–Fulkerson conjecture, and the Fan–Raspaud conjecture
|
Zhu, Qiang
|
|
2014
|
96-97 |
C |
p. 282-286
5 p.
|
artikel
|
| 3359 |
Perfect matchings of
(
4
,
6
)
-fullerenes with largest forcing number
|
Zhang, Yaxian
|
|
|
96-97 |
C |
p. 10-25
|
artikel
|
| 3360 |
Perfect out-forest problem and directed Steiner cycle packing problem
|
Sun, Yuefang
|
|
|
96-97 |
C |
p. 201-209
|
artikel
|
| 3361 |
Perfect Roman domination in trees
|
Henning, Michael A.
|
|
2018
|
96-97 |
C |
p. 235-245
|
artikel
|
| 3362 |
Perfect state transfer in NEPS of complete graphs
|
Li, Yipeng
|
|
|
96-97 |
C |
p. 98-114
|
artikel
|
| 3363 |
Performance guarantees for scheduling algorithms under perturbed machine speeds
|
Etscheid, Michael
|
|
2015
|
96-97 |
C |
p. 84-100
17 p.
|
artikel
|
| 3364 |
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem
|
Manthey, Bodo
|
|
|
96-97 |
C |
p. 7-16
|
artikel
|
| 3365 |
Periodic template tests: A family of statistical randomness tests for a collection of binary sequences
|
Sulak, Fatih
|
|
2019
|
96-97 |
C |
p. 191-204
|
artikel
|
| 3366 |
Peripheral Wiener index of trees and related questions
|
Chen, Ya-Hong
|
|
2018
|
96-97 |
C |
p. 135-145
|
artikel
|
| 3367 |
Permutation bigraphs and interval containments
|
Saha, Pranab K.
|
|
2014
|
96-97 |
C |
p. 71-78
8 p.
|
artikel
|
| 3368 |
Permutation patterns in genome rearrangement problems: The reversal model
|
Cerbai, Giulio
|
|
|
96-97 |
C |
p. 34-48
|
artikel
|
| 3369 |
Permutation reconstruction from
MinMax
-Betweenness constraints
|
Rusu, Irena
|
|
2016
|
96-97 |
C |
p. 106-119
14 p.
|
artikel
|
| 3370 |
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
|
Wu, Tingzeng
|
|
2016
|
96-97 |
C |
p. 158-170
13 p.
|
artikel
|
| 3371 |
Piece selection algorithms for layered video streaming in P2P networks
|
Szkaliczki, Tibor
|
|
2014
|
96-97 |
C |
p. 269-279
11 p.
|
artikel
|
| 3372 |
P
5
-isolation in graphs
|
Chen, Jie
|
|
|
96-97 |
C |
p. 331-349
|
artikel
|
| 3373 |
Pivotal decompositions of functions
|
Marichal, Jean-Luc
|
|
2014
|
96-97 |
C |
p. 102-112
11 p.
|
artikel
|
| 3374 |
Planar graphs with girth 20 are additively 3-choosable
|
Brandt, Axel
|
|
|
96-97 |
C |
p. 14-21
|
artikel
|
| 3375 |
Planar graphs without 4- and 6-cycles are
(
3
,
4
)
-colorable
|
Nakprasit, Kittikorn
|
|
|
96-97 |
C |
p. 44-51
|
artikel
|
| 3376 |
Planar graphs without chordal 6-cycles are 4-choosable
|
Hu, Dai-Qiang
|
|
2018
|
96-97 |
C |
p. 116-123
|
artikel
|
| 3377 |
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
|
Liu, Zhengjiao
|
|
|
96-97 |
C |
p. 158-166
|
artikel
|
| 3378 |
Planar graphs without 4-cycles and intersecting triangles are
(
1
,
1
,
0
)
-colorable
|
Li, Xiangwen
|
|
|
96-97 |
C |
p. 236-247
|
artikel
|
| 3379 |
Planar graphs without short even cycles are near-bipartite
|
Liu, Runrun
|
|
|
96-97 |
C |
p. 626-630
|
artikel
|
| 3380 |
Planar median graphs and cubesquare-graphs
|
Seemann, Carsten R.
|
|
|
96-97 |
C |
p. 38-58
|
artikel
|
| 3381 |
Planar projections of graphs
|
Aravind, N.R.
|
|
|
96-97 |
C |
p. 216-222
|
artikel
|
| 3382 |
Planar Turán number of the disjoint union of cycles
|
Li, Ping
|
|
|
96-97 |
C |
p. 260-274
|
artikel
|
| 3383 |
Polyhedra associated with identifying codes in graphs
|
Argiroffo, Gabriela R.
|
|
2018
|
96-97 |
C |
p. 16-27
|
artikel
|
| 3384 |
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
|
Argiroffo, Gabriela
|
|
|
96-97 |
C |
p. 465-480
|
artikel
|
| 3385 |
Polyhedral approach to weighted connected matchings in general graphs
|
Samer, Phillippe
|
|
|
96-97 |
C |
p. 143-152
|
artikel
|
| 3386 |
Polyhedral combinatorics of the
K
-partitioning problem with representative variables
|
Ales, Zacharie
|
|
2016
|
96-97 |
C |
p. 1-14
14 p.
|
artikel
|
| 3387 |
Polyhedral properties of the induced cluster subgraphs
|
Hosseinian, Seyedmohammadhossein
|
|
|
96-97 |
C |
p. 80-96
|
artikel
|
| 3388 |
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
|
Nattaf, Margaux
|
|
2019
|
96-97 |
C |
p. 188-203
|
artikel
|
| 3389 |
Polymatroid-based capacitated packing of branchings
|
Matsuoka, Tatsuya
|
|
2019
|
96-97 |
C |
p. 190-203
|
artikel
|
| 3390 |
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
|
Aringhieri, Roberto
|
|
2019
|
96-97 |
C |
p. 103-121
|
artikel
|
| 3391 |
Polynomial-delay generation of functional digraphs up to isomorphism
|
Defrain, Oscar
|
|
|
96-97 |
C |
p. 24-33
|
artikel
|
| 3392 |
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
|
Ennaoui, Karima
|
|
|
96-97 |
C |
p. 443-450
|
artikel
|
| 3393 |
Polynomially determining spanning connectivity of locally connected line graphs
|
Xiong, Wei
|
|
|
96-97 |
C |
p. 102-111
|
artikel
|
| 3394 |
Polynomial size linear programs for problems in P
|
Avis, David
|
|
2019
|
96-97 |
C |
p. 22-39
|
artikel
|
| 3395 |
Polynomial-time algorithms for minimum weighted colorings of (
P
5
,
P
¯
5
)-free graphs and similar graph classes
|
Hoàng, Chính T.
|
|
2015
|
96-97 |
C |
p. 106-111
6 p.
|
artikel
|
| 3396 |
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
|
Wojciechowski, Piotr
|
|
|
96-97 |
C |
p. 272-294
|
artikel
|
| 3397 |
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
|
Konagaya, Matsuo
|
|
2016
|
96-97 |
C |
p. 37-45
9 p.
|
artikel
|
| 3398 |
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
|
Papadopoulos, Charis
|
|
2019
|
96-97 |
C |
p. 204-221
|
artikel
|
| 3399 |
Polynomial-time approximation algorithms for weighted LCS problem
|
Cygan, M.
|
|
2016
|
96-97 |
C |
p. 38-48
11 p.
|
artikel
|
| 3400 |
Polynomial-time data reduction for weighted problems beyond additive goal functions
|
Bentert, Matthias
|
|
|
96-97 |
C |
p. 117-133
|
artikel
|
| 3401 |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
|
Asahiro, Yuichi
|
|
|
96-97 |
C |
p. 44-64
|
artikel
|
| 3402 |
Poonen’s conjecture and Ramsey numbers
|
Eliahou, Shalom
|
|
2016
|
96-97 |
C |
p. 102-106
5 p.
|
artikel
|
| 3403 |
Popular ranking
|
van Zuylen, Anke
|
|
2014
|
96-97 |
C |
p. 312-316
5 p.
|
artikel
|
| 3404 |
Positive existential definability in finite structures
|
Romov, Boris A.
|
|
|
96-97 |
C |
p. 210-215
|
artikel
|
| 3405 |
Positive matching decompositions of graphs
|
Farrokhi D.G., Mohammad
|
|
|
96-97 |
C |
p. 311-323
|
artikel
|
| 3406 |
Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
|
Taranenko, A.A.
|
|
|
96-97 |
C |
p. 161-165
|
artikel
|
| 3407 |
Positive semidefiniteness of
A
α
(
G
)
on some families of graphs
|
Brondani, A.E.
|
|
|
96-97 |
C |
p. 113-123
|
artikel
|
| 3408 |
Positive semidefinite propagation time
|
Warnberg, Nathan
|
|
2016
|
96-97 |
C |
p. 274-290
17 p.
|
artikel
|
| 3409 |
Power domination in regular claw-free graphs
|
Lu, Changhong
|
|
|
96-97 |
C |
p. 401-415
|
artikel
|
| 3410 |
Power domination on permutation graphs
|
Wilson, S.
|
|
2019
|
96-97 |
C |
p. 169-178
|
artikel
|
| 3411 |
Practical algorithms for branch-decompositions of planar graphs
|
Bian, Zhengbing
|
|
2016
|
96-97 |
C |
p. 156-171
16 p.
|
artikel
|
| 3412 |
Practical and efficient algorithms for the geometric hitting set problem
|
Bus, Norbert
|
|
2018
|
96-97 |
C |
p. 25-32
|
artikel
|
| 3413 |
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
|
Barbero, Stefano
|
|
|
96-97 |
C |
p. 13-31
|
artikel
|
| 3414 |
Practical KMP/BM style pattern-matching on indeterminate strings
|
Dehghani, Hossein
|
|
|
96-97 |
C |
p. 22-33
|
artikel
|
| 3415 |
Precedence thinness in graphs
|
Bonomo-Braberman, Flavia
|
|
|
96-97 |
C |
p. 76-95
|
artikel
|
| 3416 |
Precoloring extension involving pairs of vertices of small distance
|
Ojima, Chihoko
|
|
2014
|
96-97 |
C |
p. 170-177
8 p.
|
artikel
|
| 3417 |
Preface
|
Lipták, Zsuzsanna
|
|
2018
|
96-97 |
C |
p. 1
|
artikel
|
| 3418 |
Preface
|
Mucherino, Antonio
|
|
2015
|
96-97 |
C |
p. 1-2
2 p.
|
artikel
|
| 3419 |
Preface
|
Faigle, Ulrich
|
|
2015
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 3420 |
Preface
|
Coeurjolly, David
|
|
2015
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 3421 |
Preface
|
Alizadeh, Farid
|
|
2019
|
96-97 |
C |
p. 1-4
|
artikel
|
| 3422 |
Preface
|
Comellas, Francesc
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3423 |
Preface: Algorithmic Graph Theory on the Adriatic Coast
|
Brešar, Boštjan
|
|
2017
|
96-97 |
C |
p. 1-3
3 p.
|
artikel
|
| 3424 |
Preface: CALDAM 2019
|
Swami, Sarvottamananda
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3425 |
Preface: CALDAM 2020
|
Changat, Manoj
|
|
|
96-97 |
C |
p. 192-193
|
artikel
|
| 3426 |
Preface: CALDAM 2015
|
Ganguly, Sumit
|
|
2017
|
96-97 |
C |
p. 1-2
2 p.
|
artikel
|
| 3427 |
Preface: CALDAM 2018
|
Panda, Bhawani Sankar
|
|
|
96-97 |
C |
p. 260
|
artikel
|
| 3428 |
Preface: CALDAM 2017
|
Gaur, Daya Ram
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3429 |
Preface: CALDAM 2016
|
Govindarajan, Sathish
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3430 |
Preface: Combinatorial Optimization ISCO 2018
|
Lee, Jon
|
|
|
96-97 |
C |
p. 1-3
|
artikel
|
| 3431 |
Preface: Concept Lattices and Applications: Recent Advances and New Opportunities
|
Bertet, Karell
|
|
2018
|
96-97 |
C |
p. 1
|
artikel
|
| 3432 |
Preface: CTW 2018
|
Furini, Fabio
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3433 |
Preface: Graph theory and combinatorics
|
Sebő, András
|
|
2016
|
96-97 |
C |
p. 1-
1 p.
|
artikel
|
| 3434 |
Preface: LAGOS’15 — Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil — 2015
|
Campêlo, Manoel
|
|
2018
|
96-97 |
C |
p. 1-3
|
artikel
|
| 3435 |
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. – Marseille, France, 2017
|
Bassino, Frédérique
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3436 |
Preface: LAGOS’13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México — 2013
|
Correa, José
|
|
2016
|
96-97 |
C |
p. 1-3
|
artikel
|
| 3437 |
Preface: LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil
|
Ferreira, Carlos Eduardo
|
|
|
96-97 |
C |
p. 393
|
artikel
|
| 3438 |
Preface: LAGOS’19 – X Latin and American Algorithms, Graphs, and Optimization Symposium – Belo Horizonte, Minas Gerais, Brazil
|
dos Santos, Vinicius
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3439 |
Preface: Linear optimization
|
Deza, Antoine
|
|
2018
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3440 |
Preface: 2nd Russian–Hungarian Combinatorial Workshop
|
Katona, Gyula O.H.
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3441 |
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
|
Ganian, Robert
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3442 |
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015
|
Corneil, Derek
|
|
2018
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3443 |
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014
|
Archetti, Claudia
|
|
2018
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3444 |
Preface: Stringology Algorithms
|
Holub, Jan
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3445 |
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016
|
Crama, Yves
|
|
2019
|
96-97 |
C |
p. 1
|
artikel
|
| 3446 |
Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015)
|
Duman, Ekrem
|
|
2019
|
96-97 |
C |
p. 1
|
artikel
|
| 3447 |
Preface: 15th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017)
|
Peis, Britta
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3448 |
Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)
|
Manthey, Bodo
|
|
|
96-97 |
C |
p. 1
|
artikel
|
| 3449 |
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020)
|
Gentile, Claudio
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3450 |
Preface: The Second Malta Conference in Graph Theory and Combinatorics
|
Sciriha, Irene
|
|
2019
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3451 |
Preface: WEPA 2018
|
Uno, Takeaki
|
|
|
96-97 |
C |
p. 160
|
artikel
|
| 3452 |
Preface: Workshop on Advances in Optimization
|
Deza, Antoine
|
|
|
96-97 |
C |
p. 1-2
|
artikel
|
| 3453 |
Prefix and suffix reversals on strings
|
Fertin, Guillaume
|
|
2018
|
96-97 |
C |
p. 140-153
|
artikel
|
| 3454 |
Preprocessing complexity for some graph problems parameterized by structural parameters
|
Lafond, Manuel
|
|
|
96-97 |
C |
p. 46-59
|
artikel
|
| 3455 |
Primal and dual combinatorial dimensions
|
Kleer, Pieter
|
|
|
96-97 |
C |
p. 185-196
|
artikel
|
| 3456 |
Prime power and prime product distance graphs
|
Kaneda, Yumi
|
|
2019
|
96-97 |
C |
p. 334-338
|
artikel
|
| 3457 |
Priority Arbiter PUF: Analysis
|
Kansal, Meenakshi
|
|
|
96-97 |
C |
p. 71-95
|
artikel
|
| 3458 |
Priority-based bin packing with subset constraints
|
Wojciechowski, Piotr
|
|
|
96-97 |
C |
p. 64-75
|
artikel
|
| 3459 |
Privileged factors in the Thue–Morse word—A comparison of privileged words and palindromes
|
Peltomäki, Jarkko
|
|
2015
|
96-97 |
C |
p. 187-199
13 p.
|
artikel
|
| 3460 |
Probabilistic chip-collecting games with modulo winning conditions
|
Harrington, Joshua
|
|
|
96-97 |
C |
p. 93-98
|
artikel
|
| 3461 |
Probabilistic properties of highly connected random geometric graphs
|
Manthey, Bodo
|
|
|
96-97 |
C |
p. 366-376
|
artikel
|
| 3462 |
Probability distributions for the Linux entropy estimator
|
Yeom, Yongjin
|
|
2018
|
96-97 |
C |
p. 87-99
|
artikel
|
| 3463 |
Product-shuffle networks: toward reconciling shuffles and butterflies
|
Rosenberg, Arnold L
|
|
1992
|
96-97 |
C |
p. 465-488
24 p.
|
artikel
|
| 3464 |
Progress towards the 1/2-Conjecture for the domination game
|
Portier, Julien
|
|
|
96-97 |
C |
p. 36-43
|
artikel
|
| 3465 |
Projection and convolution operations for integrally convex functions
|
Moriguchi, Satoko
|
|
2019
|
96-97 |
C |
p. 283-298
|
artikel
|
| 3466 |
Prokaryotic evolutionary mechanisms accelerate learning
|
Snir, Sagi
|
|
2019
|
96-97 |
C |
p. 222-234
|
artikel
|
| 3467 |
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
|
Chen, Min-Jen
|
|
|
96-97 |
C |
p. 19-23
|
artikel
|
| 3468 |
Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
|
Wang, Qichun
|
|
2016
|
96-97 |
C |
p. 217-221
5 p.
|
artikel
|
| 3469 |
Proof of a conjecture concerning maximum general sum-connectivity index
χ
α
of graphs with given cyclomatic number when
1
<
α
<
2
|
Tomescu, Ioan
|
|
2019
|
96-97 |
C |
p. 219-223
|
artikel
|
| 3470 |
Proof of a conjecture on isolation of graphs dominated by a vertex
|
Borg, Peter
|
|
|
96-97 |
C |
p. 247-253
|
artikel
|
| 3471 |
Proof of a conjecture on the strong chromatic index of Halin graphs
|
Yang, Wei
|
|
|
96-97 |
C |
p. 92-102
|
artikel
|
| 3472 |
Proof of a conjecture on the Wiener index of Eulerian graphs
|
Dankelmann, Peter
|
|
|
96-97 |
C |
p. 99-108
|
artikel
|
| 3473 |
Proof of a conjecture on the zero forcing number of a graph
|
Lu, Leihao
|
|
2016
|
96-97 |
C |
p. 233-237
5 p.
|
artikel
|
| 3474 |
Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction
|
Das, Joyentanuj
|
|
|
96-97 |
C |
p. 19-21
|
artikel
|
| 3475 |
Proof of Berge’s path partition conjecture for
k
≥
λ
−
3
|
Herskovics, Dávid
|
|
2016
|
96-97 |
C |
p. 137-143
7 p.
|
artikel
|
| 3476 |
Proof of conjectures on remoteness and proximity in graphs
|
Hua, Hongbo
|
|
2014
|
96-97 |
C |
p. 72-80
9 p.
|
artikel
|
| 3477 |
Proof of Stahl’s conjecture in some new cases
|
Osztényi, József
|
|
|
96-97 |
C |
p. 113-118
|
artikel
|
| 3478 |
Proofs of conjectures on the Randić index and average eccentricity
|
Liang, Meili
|
|
2016
|
96-97 |
C |
p. 188-193
6 p.
|
artikel
|
| 3479 |
Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
|
Pei, Lidan
|
|
|
96-97 |
C |
p. 292-301
|
artikel
|
| 3480 |
Proper circular arc graphs as intersection graphs of pathson a grid
|
Galby, Esther
|
|
2019
|
96-97 |
C |
p. 195-202
|
artikel
|
| 3481 |
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
|
Fabrici, Igor
|
|
|
96-97 |
C |
p. 80-92
|
artikel
|
| 3482 |
Proper conflict-free coloring of sparse graphs
|
Cho, Eun-Kyung
|
|
|
96-97 |
C |
p. 34-42
|
artikel
|
| 3483 |
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
|
Guo, Shanshan
|
|
|
96-97 |
C |
p. 141-146
|
artikel
|
| 3484 |
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
|
Noguchi, Kenta
|
|
|
96-97 |
C |
p. 195-197
|
artikel
|
| 3485 |
Properties of m-bonacci-sum graphs
|
Mahalingam, Kalpana
|
|
|
96-97 |
C |
p. 149-158
|
artikel
|
| 3486 |
Properties of the
d
-dimensional earth mover’s problem
|
Kline, Jeffery
|
|
2019
|
96-97 |
C |
p. 128-141
|
artikel
|
| 3487 |
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
|
Chen, Xiaozheng
|
|
|
96-97 |
C |
p. 167-180
|
artikel
|
| 3488 |
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
|
Chen, Xiaozheng
|
|
2019
|
96-97 |
C |
p. 199-203
|
artikel
|
| 3489 |
Proportional and maxmin fairness for the sensor location problem with chance constraints
|
Santos, Marcio C.
|
|
2019
|
96-97 |
C |
p. 316-331
|
artikel
|
| 3490 |
Proportionally dense subgraph of maximum size: Complexity and approximation
|
Bazgan, Cristina
|
|
2019
|
96-97 |
C |
p. 25-36
|
artikel
|
| 3491 |
Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing
|
Zhou, Yanwei
|
|
2016
|
96-97 |
C |
p. 185-202
18 p.
|
artikel
|
| 3492 |
Proving a conjecture on prime double square tiles
|
Ascolese, Michela
|
|
|
96-97 |
C |
p. 71-83
|
artikel
|
| 3493 |
Proving the conjecture of O’Donnell in certain cases and disproving its general validity
|
Kudin, S.
|
|
|
96-97 |
C |
p. 345-353
|
artikel
|
| 3494 |
Proving the infeasibility of Horn formulas through read-once resolution
|
Wojciechowski, Piotr
|
|
|
96-97 |
C |
p. 131-145
|
artikel
|
| 3495 |
Proximity and remoteness in graphs: A survey
|
Aouchiche, Mustapha
|
|
|
96-97 |
C |
p. 94-120
|
artikel
|
| 3496 |
Proximity, remoteness and distance eigenvalues of a graph
|
Aouchiche, Mustapha
|
|
2016
|
96-97 |
C |
p. 17-25
9 p.
|
artikel
|
| 3497 |
Proximity, remoteness and girth in graphs
|
Aouchiche, M.
|
|
2017
|
96-97 |
C |
p. 31-39
9 p.
|
artikel
|
| 3498 |
Proximity, remoteness and minimum degree
|
Dankelmann, Peter
|
|
2015
|
96-97 |
C |
p. 223-228
6 p.
|
artikel
|
| 3499 |
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph
|
Araujo-Pardo, M. Gabriela
|
|
2017
|
96-97 |
C |
p. 60-66
7 p.
|
artikel
|
| 3500 |
PTAS for
H
-free node deletion problems in disk graphs
|
Li, Xiaosong
|
|
2018
|
96-97 |
C |
p. 119-124
|
artikel
|
| 3501 |
PTASs for secure dominating set in planar graphs and growth-bounded graphs
|
Li, Ke
|
|
|
96-97 |
C |
p. 343-351
|
artikel
|
| 3502 |
Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
|
Takazawa, Kenjiro
|
|
|
96-97 |
C |
p. 226-235
|
artikel
|
| 3503 |
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
|
Sukenari, Yuki
|
|
2016
|
96-97 |
C |
p. 31-40
10 p.
|
artikel
|
| 3504 |
Pure-strategy Nash equilibria on competitive diffusion games
|
Enomoto, Hikoe
|
|
2018
|
96-97 |
C |
p. 1-19
|
artikel
|
| 3505 |
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions
|
Romanuke, Vadim V.
|
|
|
96-97 |
C |
p. 215-232
|
artikel
|
| 3506 |
Pushable chromatic number of graphs with maximum average degree at most
14
5
|
Das, Tapas
|
|
|
96-97 |
C |
p. 163-171
|
artikel
|
| 3507 |
q
-cube enumerator polynomial of Fibonacci cubes
|
Saygı, Elif
|
|
2017
|
96-97 |
C |
p. 127-137
11 p.
|
artikel
|
| 3508 |
q
-derivative operator proof for a conjecture of Melham
|
Li, Nadia N.
|
|
2014
|
96-97 |
C |
p. 158-164
7 p.
|
artikel
|
| 3509 |
Quadratic almost bent functions—Their partial characterization and design in the spectral domain
|
Bapić, A.
|
|
|
96-97 |
C |
p. 217-236
|
artikel
|
| 3510 |
Quadratic rotation symmetric Boolean functions
|
Chirvasitu, Alexandru
|
|
|
96-97 |
C |
p. 91-105
|
artikel
|
| 3511 |
Quadratization of symmetric pseudo-Boolean functions
|
Anthony, Martin
|
|
2016
|
96-97 |
C |
p. 1-12
12 p.
|
artikel
|
| 3512 |
Quality bounds for binary tomography with arbitrary projection matrices
|
Fortes, W.
|
|
2015
|
96-97 |
C |
p. 42-58
17 p.
|
artikel
|
| 3513 |
Quantum fractional revival on graphs
|
Chan, Ada
|
|
2019
|
96-97 |
C |
p. 86-98
|
artikel
|
| 3514 |
Quasi-best match graphs
|
Korchmaros, Annachiara
|
|
|
96-97 |
C |
p. 104-125
|
artikel
|
| 3515 |
Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs
|
Lichiardopol, Nicolas
|
|
2016
|
96-97 |
C |
p. 106-110
5 p.
|
artikel
|
| 3516 |
Quasi-
λ
-distance-balanced graphs
|
Abedi, Amirabbas
|
|
2017
|
96-97 |
C |
p. 21-28
|
artikel
|
| 3517 |
Quasi-Hamiltonian cycles in
k
-strong multipartite tournaments
|
Surmacs, Michel
|
|
2015
|
96-97 |
C |
p. 253-257
5 p.
|
artikel
|
| 3518 |
Quasi-kernels in split graphs
|
Langlois, Hélène
|
|
|
96-97 |
C |
p. 236-243
|
artikel
|
| 3519 |
Quasimonotone graphs
|
Dyer, Martin
|
|
2019
|
96-97 |
C |
p. 25-48
|
artikel
|
| 3520 |
Query complexity of Boolean functions on the middle slice of the cube
|
Gerbner, Dániel
|
|
|
96-97 |
C |
p. 43-49
|
artikel
|
| 3521 |
Querying relational event graphs using colored range searching data structures
|
Chanchary, Farah
|
|
|
96-97 |
C |
p. 51-61
|
artikel
|
| 3522 |
Query learning algorithm for ordered multi-terminal binary decision diagrams
|
Nakamura, Atsuyoshi
|
|
|
96-97 |
C |
p. 69-87
|
artikel
|
| 3523 |
Queue layouts on folded hypercubes
|
Geng, Xin
|
|
|
96-97 |
C |
p. 154-158
|
artikel
|
| 3524 |
Radio-
k
-labeling of cycles for large
k
|
Bloomfield, Colin
|
|
|
96-97 |
C |
p. 60-70
|
artikel
|
| 3525 |
Radio number for the Cartesian product of two trees
|
Bantva, Devsi
|
|
|
96-97 |
C |
p. 304-316
|
artikel
|
| 3526 |
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
|
Das, Sandip
|
|
|
96-97 |
C |
p. 311-328
|
artikel
|
| 3527 |
Rainbow connection in oriented graphs
|
Dorbec, Paul
|
|
2014
|
96-97 |
C |
p. 69-78
10 p.
|
artikel
|
| 3528 |
Rainbow connection number and graph operations
|
Li, Hengzhe
|
|
2017
|
96-97 |
C |
p. 91-99
9 p.
|
artikel
|
| 3529 |
Rainbow connections in digraphs
|
Sidorowicz, Elżbieta
|
|
2018
|
96-97 |
C |
p. 248-261
|
artikel
|
| 3530 |
Rainbow connectivity and rainbow criticality on graph classes
|
Rocha, Aleffer
|
|
|
96-97 |
C |
p. 311-323
|
artikel
|
| 3531 |
Rainbow connectivity of Moore cages of girth 6
|
Balbuena, C.
|
|
2018
|
96-97 |
C |
p. 104-109
|
artikel
|
| 3532 |
Rainbow copies of
C
4
in edge-colored hypercubes
|
Balogh, József
|
|
2016
|
96-97 |
C |
p. 35-37
|
artikel
|
| 3533 |
2-Rainbow domination number of
C
n
□
C
5
|
Stȩpień, Zofia
|
|
2014
|
96-97 |
C |
p. 113-116
4 p.
|
artikel
|
| 3534 |
Rainbow domination numbers on graphs with given radius
|
Fujita, Shinya
|
|
2014
|
96-97 |
C |
p. 115-122
8 p.
|
artikel
|
| 3535 |
Rainbow domination regular graphs that are not vertex transitive
|
Žerovnik, Janez
|
|
|
96-97 |
C |
p. 144-147
|
artikel
|
| 3536 |
Rainbow independent sets in graphs with maximum degree two
|
Ma, Yue
|
|
|
96-97 |
C |
p. 101-108
|
artikel
|
| 3537 |
Rainbow independent sets on dense graph classes
|
Kim, Jinha
|
|
|
96-97 |
C |
p. 45-51
|
artikel
|
| 3538 |
Rainbow short linear forests in edge-colored complete graph
|
He, Menglu
|
|
|
96-97 |
C |
p. 523-536
|
artikel
|
| 3539 |
Rainbow spanning trees in properly coloured complete graphs
|
Balogh, József
|
|
|
96-97 |
C |
p. 97-101
|
artikel
|
| 3540 |
Rainbow transitive triangles in arc-colored digraphs
|
Duan, Mengyu
|
|
|
96-97 |
C |
p. 175-184
|
artikel
|
| 3541 |
Rainbow triangles in arc-colored digraphs
|
Li, Wei
|
|
|
96-97 |
C |
p. 169-180
|
artikel
|
| 3542 |
Ramsey and Gallai–Ramsey numbers for comb and sun graphs
|
Xu, Xiao
|
|
|
96-97 |
C |
p. 131-145
|
artikel
|
| 3543 |
Ramsey and Gallai–Ramsey numbers for stars with extra independent edges
|
Mao, Yaping
|
|
|
96-97 |
C |
p. 153-172
|
artikel
|
| 3544 |
Ramsey and Gallai–Ramsey numbers for the union of paths and stars
|
Zhou, Jiannan
|
|
|
96-97 |
C |
p. 297-308
|
artikel
|
| 3545 |
Ramsey number of
K
3
versus
F
3
,
n
|
Hao, Yiyuan
|
|
2018
|
96-97 |
C |
p. 345-348
|
artikel
|
| 3546 |
Ramsey numbers of
4
-uniform loose cycles
|
Omidi, G.R.
|
|
2017
|
96-97 |
C |
p. 112-120
9 p.
|
artikel
|
| 3547 |
Randić index and coloring number of a graph
|
Wu, Baoyindureng
|
|
2014
|
96-97 |
C |
p. 163-165
3 p.
|
artikel
|
| 3548 |
Random access to Fibonacci encoded files
|
Klein, Shmuel T.
|
|
2016
|
96-97 |
C |
p. 115-128
14 p.
|
artikel
|
| 3549 |
Random bipartite Ramsey numbers of long cycles
|
Liu, Meng
|
|
|
96-97 |
C |
p. 39-47
|
artikel
|
| 3550 |
Randomized algorithms for finding the shortest negative cost cycle in networks
|
Orlin, James B.
|
|
2018
|
96-97 |
C |
p. 387-394
|
artikel
|
| 3551 |
Random walks and Laplacians on hypergraphs: When do they match?
|
Mulas, Raffaella
|
|
|
96-97 |
C |
p. 26-41
|
artikel
|
| 3552 |
Rank aggregation: New bounds for MCx
|
Freund, Daniel
|
|
2019
|
96-97 |
C |
p. 28-36
|
artikel
|
| 3553 |
Ranking and unranking restricted permutations
|
Kagey, Peter
|
|
|
96-97 |
C |
p. 247-261
|
artikel
|
| 3554 |
Ranking trees based on global centrality measures
|
Barghi, Amir
|
|
|
96-97 |
C |
p. 231-257
|
artikel
|
| 3555 |
Rank-width: Algorithmic and structural results
|
Oum, Sang-il
|
|
2017
|
96-97 |
C |
p. 15-24
10 p.
|
artikel
|
| 3556 |
R
3
-connectivity of folded hypercubes
|
Lee, Chia-Wei
|
|
|
96-97 |
C |
p. 261-273
|
artikel
|
| 3557 |
r
-dynamic colorings and the spectral radius in graphs
|
Ai, Jiangdong
|
|
|
96-97 |
C |
p. 249-255
|
artikel
|
| 3558 |
Reachability in arborescence packings
|
Hörsch, Florian
|
|
|
96-97 |
C |
p. 170-183
|
artikel
|
| 3559 |
Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)
|
Battiti, Roberto
|
|
1999
|
96-97 |
C |
p. 3-27
25 p.
|
artikel
|
| 3560 |
Realizing Euclidean distance matrices by sphere intersection
|
Alencar, Jorge
|
|
2019
|
96-97 |
C |
p. 5-10
|
artikel
|
| 3561 |
Recent results on containment graphs of paths in a tree
|
Alcón, Liliana
|
|
2018
|
96-97 |
C |
p. 139-147
|
artikel
|
| 3562 |
Recent techniques and results on the Erdős–Pósa property
|
Raymond, Jean-Florent
|
|
2017
|
96-97 |
C |
p. 25-43
19 p.
|
artikel
|
| 3563 |
Reciprocal degree distance and graph properties
|
An, Mingqiang
|
|
2019
|
96-97 |
C |
p. 1-7
|
artikel
|
| 3564 |
Reciprocal degree distance of product graphs
|
Pattabiraman, K.
|
|
2014
|
96-97 |
C |
p. 201-213
13 p.
|
artikel
|
| 3565 |
Recognition and characterization of unit interval graphs with integer endpoints
|
Durán, G.
|
|
2018
|
96-97 |
C |
p. 168-176
|
artikel
|
| 3566 |
Recognition of probe proper interval graphs
|
Nussbaum, Yahav
|
|
2014
|
96-97 |
C |
p. 228-238
11 p.
|
artikel
|
| 3567 |
Recognizing generalized Petersen graphs in linear time
|
Krnc, Matjaž
|
|
|
96-97 |
C |
p. 756-761
|
artikel
|
| 3568 |
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
|
Tankus, David
|
|
|
96-97 |
C |
p. 189-198
|
artikel
|
| 3569 |
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
|
Takaoka, Asahi
|
|
|
96-97 |
C |
p. 154-167
|
artikel
|
| 3570 |
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms
|
Escoffier, Bruno
|
|
|
96-97 |
C |
p. 301-319
|
artikel
|
| 3571 |
Recognizing unit multiple interval graphs is hard
|
Ardévol Martínez, Virginia
|
|
|
96-97 |
C |
p. 258-274
|
artikel
|
| 3572 |
Recognizing vertex intersection graphs of paths on bounded degree trees
|
Alcón, L.
|
|
2014
|
96-97 |
C |
p. 70-77
8 p.
|
artikel
|
| 3573 |
Recoloring some hereditary graph classes
|
Belavadi, Manoj
|
|
|
96-97 |
C |
p. 389-401
|
artikel
|
| 3574 |
Reconfiguration graphs of zero forcing sets
|
Geneson, Jesse
|
|
|
96-97 |
C |
p. 126-139
|
artikel
|
| 3575 |
Reconfiguration of cliques in a graph
|
Ito, Takehiro
|
|
|
96-97 |
C |
p. 43-58
|
artikel
|
| 3576 |
Reconstructing Markov processes from independent and anonymous experiments
|
Micali, Silvio
|
|
2016
|
96-97 |
C |
p. 108-122
15 p.
|
artikel
|
| 3577 |
Reconstruction number of graphs with unique pendant vertex
|
Monikandan, S.
|
|
|
96-97 |
C |
p. 357-365
|
artikel
|
| 3578 |
Reconstruction of domino tilings—Combinatorial and probabilistic questions
|
Bar-Sinai, Yoav
|
|
2016
|
96-97 |
C |
p. 1-19
19 p.
|
artikel
|
| 3579 |
Rectilinear path problems in restricted memory setup
|
Bhattacharya, Binay K.
|
|
2017
|
96-97 |
C |
p. 80-87
8 p.
|
artikel
|
| 3580 |
Recursion orders for weights of Boolean cubic rotation symmetric functions
|
Cusick, Thomas W.
|
|
2015
|
96-97 |
C |
p. 1-6
6 p.
|
artikel
|
| 3581 |
Recursive MDS matrices over finite commutative rings
|
Kesarwani, Abhishek
|
|
|
96-97 |
C |
p. 384-396
|
artikel
|
| 3582 |
Redicolouring digraphs: Directed treewidth and cycle-degeneracy
|
Nisse, Nicolas
|
|
|
96-97 |
C |
p. 191-208
|
artikel
|
| 3583 |
Reducing hypergraph coloring to clique search
|
Szabo, Sandor
|
|
2019
|
96-97 |
C |
p. 196-207
|
artikel
|
| 3584 |
Reducing the domination number of
(
P
3
+
k
P
2
)
-free graphs via one edge contraction
|
Galby, E.
|
|
|
96-97 |
C |
p. 205-210
|
artikel
|
| 3585 |
Redundant cumulative constraints to compute preemptive bounds
|
Baptiste, Philippe
|
|
2018
|
96-97 |
C |
p. 168-177
|
artikel
|
| 3586 |
Re-1-embeddings of optimal 1-embedded graphs on the projective plane
|
Suzuki, Yusuke
|
|
|
96-97 |
C |
p. 487-496
|
artikel
|
| 3587 |
Refining the complexity of the sports elimination problem
|
Cechlárová, Katarína
|
|
2016
|
96-97 |
C |
p. 172-186
15 p.
|
artikel
|
| 3588 |
Reformulations and complexity of the clique interdiction problem by graph mapping
|
Mattia, Sara
|
|
|
96-97 |
C |
p. 48-57
|
artikel
|
| 3589 |
Regular coronoids and 4-tilings
|
Vesel, Aleksander
|
|
2017
|
96-97 |
C |
p. 217-227
11 p.
|
artikel
|
| 3590 |
Regular graphs with equal matching number and independence number
|
Yang, Zixuan
|
|
|
96-97 |
C |
p. 86-90
|
artikel
|
| 3591 |
Regular homogeneously traceable nonhamiltonian graphs
|
Hu, Yanan
|
|
|
96-97 |
C |
p. 60-64
|
artikel
|
| 3592 |
Regular independent sets
|
Caro, Yair
|
|
2016
|
96-97 |
C |
p. 35-46
12 p.
|
artikel
|
| 3593 |
Regular intersecting families
|
Ihringer, Ferdinand
|
|
2019
|
96-97 |
C |
p. 142-152
|
artikel
|
| 3594 |
Regular pattern-free coloring
|
Escamocher, Guillaume
|
|
|
96-97 |
C |
p. 109-125
|
artikel
|
| 3595 |
Regular sets in circulant graphs with degree 3
|
Hao, Yu-Xia
|
|
|
96-97 |
C |
p. 51-55
|
artikel
|
| 3596 |
Relating dissociation, independence, and matchings
|
Bock, Felix
|
|
|
96-97 |
C |
p. 160-165
|
artikel
|
| 3597 |
Relating multiway discrepancy and singular values of nonnegative rectangular matrices
|
Bolla, Marianna
|
|
2016
|
96-97 |
C |
p. 26-34
9 p.
|
artikel
|
| 3598 |
Relating the annihilation number and the 2-domination number of block graphs
|
Jakovac, Marko
|
|
2019
|
96-97 |
C |
p. 178-187
|
artikel
|
| 3599 |
Relating the annihilation number and the total domination number for some graphs
|
Hua, Xinying
|
|
|
96-97 |
C |
p. 41-46
|
artikel
|
| 3600 |
Relating the total
{
2
}
-domination number with the total domination number of graphs
|
Ríos Villamar, I.
|
|
|
96-97 |
C |
p. 90-95
|
artikel
|
| 3601 |
Relation between the H-rank of a mixed graph and the girth of its underlying graph
|
Khan, Suliman
|
|
|
96-97 |
C |
p. 239-248
|
artikel
|
| 3602 |
Relation between the nullity of a graph and its matching number
|
Zhou, Qi
|
|
|
96-97 |
C |
p. 93-98
|
artikel
|
| 3603 |
Relation between the skew energy of an oriented graph and its matching number
|
Tian, Fenglei
|
|
2017
|
96-97 |
C |
p. 179-184
6 p.
|
artikel
|
| 3604 |
Relations between degree-based graph invariants
|
Hua, Hongbo
|
|
|
96-97 |
C |
p. 60-67
|
artikel
|
| 3605 |
Relations between edge removing and edge subdivision concerning domination number of a graph
|
Lemańska, Magdalena
|
|
2019
|
96-97 |
C |
p. 212-219
|
artikel
|
| 3606 |
Relations between global forcing number and maximum anti-forcing number of a graph
|
Zhang, Yaxian
|
|
|
96-97 |
C |
p. 85-96
|
artikel
|
| 3607 |
Relationship between superstring and compression measures: New insights on the greedy conjecture
|
Cazaux, Bastien
|
|
2018
|
96-97 |
C |
p. 59-64
|
artikel
|
| 3608 |
Relationship between the edge-Wiener index and the Gutman index of a graph
|
Knor, Martin
|
|
2014
|
96-97 |
C |
p. 197-201
5 p.
|
artikel
|
| 3609 |
Relations of three classes of disconnected coloring
|
Li, Ping
|
|
|
96-97 |
C |
p. 263-271
|
artikel
|
| 3610 |
Relative clique number of planar signed graphs
|
Das, Sandip
|
|
|
96-97 |
C |
p. 86-92
|
artikel
|
| 3611 |
Relaxation of Wegner’s planar graph conjecture for maximum degree 4
|
Cho, Eun-Kyung
|
|
|
96-97 |
C |
p. 254-261
|
artikel
|
| 3612 |
Reliability analyses of regular graphs based on edge-structure connectivity
|
Wang, Na
|
|
|
96-97 |
C |
p. 329-342
|
artikel
|
| 3613 |
Reliability analysis of 3-ary
n
-cube in terms of average degree edge-connectivity
|
Zhang, Qifan
|
|
|
96-97 |
C |
p. 31-39
|
artikel
|
| 3614 |
Reliability analysis of Cayley graphs generated by transpositions
|
Gu, Mei-Mei
|
|
2018
|
96-97 |
C |
p. 94-102
|
artikel
|
| 3615 |
Reliability analysis of exchanged hypercubes based on the path connectivity
|
Zhu, Wen-Han
|
|
|
96-97 |
C |
p. 404-416
|
artikel
|
| 3616 |
Reliability analysis of godan graphs
|
Ren, Yunxia
|
|
|
96-97 |
C |
p. 180-190
|
artikel
|
| 3617 |
Reliability analysis of godan graphs in terms of generalized 4-connectivity
|
Wang, Jing
|
|
|
96-97 |
C |
p. 210-223
|
artikel
|
| 3618 |
Reliability assessment for modified bubble-sort networks
|
Chen, Ling
|
|
|
96-97 |
C |
p. 88-94
|
artikel
|
| 3619 |
Reliability assessment of the Cayley graph generated by trees
|
Zhao, Shu-Li
|
|
|
96-97 |
C |
p. 10-14
|
artikel
|
| 3620 |
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
|
Zhang, Hong
|
|
|
96-97 |
C |
p. 179-190
|
artikel
|
| 3621 |
Reliability measure of multiprocessor system based on enhanced hypercubes
|
Xu, Liqiong
|
|
|
96-97 |
C |
p. 125-138
|
artikel
|
| 3622 |
Reliability of
m
-ary
n
-dimensional hypercubes under embedded restriction
|
Zhao, Ying-Ze
|
|
|
96-97 |
C |
p. 182-189
|
artikel
|
| 3623 |
Remainder approach for the computation of digital straight line subsegment characteristics
|
Ouattara, Jean Serge Dimitri
|
|
2015
|
96-97 |
C |
p. 90-101
12 p.
|
artikel
|
| 3624 |
Remarks on maximum atom-bond connectivity index with given graph parameters
|
Dimitrov, Darko
|
|
2017
|
96-97 |
C |
p. 222-226
5 p.
|
artikel
|
| 3625 |
Remarks on odd colorings of graphs
|
Caro, Yair
|
|
|
96-97 |
C |
p. 392-401
|
artikel
|
| 3626 |
Remarks on planar edge-chromatic critical graphs
|
Jin, Ligang
|
|
2016
|
96-97 |
C |
p. 200-202
3 p.
|
artikel
|
| 3627 |
Remarks on restricted fractional
(
g
,
f
)
-factors in graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 271-278
|
artikel
|
| 3628 |
Remarks on the upper bound for the Randić energy of bipartite graphs
|
Glogić, Edin
|
|
2017
|
96-97 |
C |
p. 67-70
4 p.
|
artikel
|
| 3629 |
Remoteness and distance eigenvalues of a graph
|
Lin, Huiqiu
|
|
2016
|
96-97 |
C |
p. 218-224
7 p.
|
artikel
|
| 3630 |
Removable and forced subgraphs of graphs
|
Chen, Wuxian
|
|
|
96-97 |
C |
p. 23-35
|
artikel
|
| 3631 |
Removable edges in Halin graphs
|
Wang, Yan
|
|
|
96-97 |
C |
p. 1-7
|
artikel
|
| 3632 |
Renting servers in the cloud: The case of equal duration jobs
|
Masoori, Mahtab
|
|
|
96-97 |
C |
p. 82-99
|
artikel
|
| 3633 |
Repeated-root constacyclic codes of length
ℓ
p
s
and their duals
|
Chen, Bocong
|
|
2014
|
96-97 |
C |
p. 60-70
11 p.
|
artikel
|
| 3634 |
Repetition-free longest common subsequence of random sequences
|
Fernandes, Cristina G.
|
|
2016
|
96-97 |
C |
p. 75-87
|
artikel
|
| 3635 |
Representation learning for temporal networks using temporal random walk and deep autoencoder
|
Mohan, Anuraj
|
|
|
96-97 |
C |
p. 595-605
|
artikel
|
| 3636 |
Representation of graphs by means of generalized metrics
|
Pavlík, Jan
|
|
|
96-97 |
C |
p. 234-247
|
artikel
|
| 3637 |
Representation of lattices via set-colored posets
|
Habib, Michel
|
|
2018
|
96-97 |
C |
p. 64-73
|
artikel
|
| 3638 |
Representative families for matroid intersections, with applications to location, packing, and covering problems
|
van Bevern, René
|
|
|
96-97 |
C |
p. 110-128
|
artikel
|
| 3639 |
Reputation games for undirected graphs
|
Avis, David
|
|
2014
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 3640 |
Rerouting shortest paths in planar graphs
|
Bonsma, Paul
|
|
2017
|
96-97 |
C |
p. 95-112
18 p.
|
artikel
|
| 3641 |
Research problems from the 1st Chinese–Southeasteuropean conference on discrete mathematics and applications
|
Krčadinac, Vedran
|
|
|
96-97 |
C |
p. 99-104
|
artikel
|
| 3642 |
Resistance between two vertices of almost complete bipartite graphs
|
Ye, Luzh
|
|
2019
|
96-97 |
C |
p. 299-305
|
artikel
|
| 3643 |
Resistance distance and Kirchhoff index in dihedral Cayley graphs
|
Huang, Jing
|
|
|
96-97 |
C |
p. 125-134
|
artikel
|
| 3644 |
Resistance distance and Kirchhoff index of
R
-vertex join and
R
-edge join of two graphs
|
Liu, Xiaogang
|
|
2015
|
96-97 |
C |
p. 130-139
10 p.
|
artikel
|
| 3645 |
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
|
Yang, Yujun
|
|
2015
|
96-97 |
C |
p. 260-274
15 p.
|
artikel
|
| 3646 |
Resistance distance in complete
n
-partite graphs
|
Gervacio, Severino V.
|
|
2016
|
96-97 |
C |
p. 53-61
9 p.
|
artikel
|
| 3647 |
Resistance distance in connected balanced digraphs
|
Balakrishnan, R.
|
|
|
96-97 |
C |
p. 46-53
|
artikel
|
| 3648 |
Resistance distance in generalized core–satellite graphs
|
Ni, Qi
|
|
|
96-97 |
C |
p. 100-108
|
artikel
|
| 3649 |
Resistance distance in straight linear 2-trees
|
Barrett, Wayne
|
|
2019
|
96-97 |
C |
p. 13-34
|
artikel
|
| 3650 |
Resistance distances and Kirchhoff index of graphs with an involution
|
Shi, Liyuan
|
|
2016
|
96-97 |
C |
p. 185-196
12 p.
|
artikel
|
| 3651 |
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
|
Ge, Jun
|
|
|
96-97 |
C |
p. 10-15
|
artikel
|
| 3652 |
Resistance distances in Cayley graphs on symmetric groups
|
Vaskouski, Maksim
|
|
2017
|
96-97 |
C |
p. 121-135
|
artikel
|
| 3653 |
Resistance distances in generalized join graphs
|
Xu, Shaohan
|
|
|
96-97 |
C |
p. 18-33
|
artikel
|
| 3654 |
Resistance values under transformations in regular triangular grids
|
Evans, Emily J.
|
|
|
96-97 |
C |
p. 129-141
|
artikel
|
| 3655 |
Resolution remains hard under equivalence
|
Büning, Hans Kleine
|
|
1999
|
96-97 |
C |
p. 139-148
10 p.
|
artikel
|
| 3656 |
Resolvable configurations
|
Gévay, Gábor
|
|
2019
|
96-97 |
C |
p. 319-330
|
artikel
|
| 3657 |
Resolving dominating partitions in graphs
|
Hernando, Carmen
|
|
2019
|
96-97 |
C |
p. 237-251
|
artikel
|
| 3658 |
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs
|
Hellmuth, Marc
|
|
|
96-97 |
C |
p. 25-43
|
artikel
|
| 3659 |
Resonance graphs of plane bipartite graphs as daisy cubes
|
Brezovnik, Simon
|
|
|
96-97 |
C |
p. 75-85
|
artikel
|
| 3660 |
Restrained Roman and restrained Italian domatic numbers of graphs
|
Volkmann, Lutz
|
|
|
96-97 |
C |
p. 153-159
|
artikel
|
| 3661 |
Restraints permitting the largest number of colourings
|
Brown, Jason
|
|
2017
|
96-97 |
C |
p. 76-88
13 p.
|
artikel
|
| 3662 |
Restricted arc-connectivity of unidirectional star graphs
|
Zhao, Xiaojun
|
|
|
96-97 |
C |
p. 207-214
|
artikel
|
| 3663 |
Restricted connectivity of Cayley graph generated by transposition trees
|
Zhang, Hong
|
|
|
96-97 |
C |
p. 87-95
|
artikel
|
| 3664 |
Restricted cycle factors and arc-decompositions of digraphs
|
Bang-Jensen, Jørgen
|
|
2015
|
96-97 |
C |
p. 80-93
14 p.
|
artikel
|
| 3665 |
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
|
López-Ortiz, Marco Antonio
|
|
|
96-97 |
C |
p. 352-364
|
artikel
|
| 3666 |
Restricted 2-extendability of (3,6)-fullerenes
|
Došlić, Tomislav
|
|
|
96-97 |
C |
p. 1-6
|
artikel
|
| 3667 |
Restricted matching in plane triangulations and near triangulations
|
Aldred, R.E.L.
|
|
|
96-97 |
C |
p. 251-261
|
artikel
|
| 3668 |
Restricted optimal pebbling and domination in graphs
|
Chellali, Mustapha
|
|
2017
|
96-97 |
C |
p. 46-53
8 p.
|
artikel
|
| 3669 |
Restricted optimal pebbling is NP-hard
|
Papp, László F.
|
|
|
96-97 |
C |
p. 258-263
|
artikel
|
| 3670 |
Results about the total chromatic number and the conformability of some families of circulant graphs
|
Faria, Luerbio
|
|
|
96-97 |
C |
p. 123-133
|
artikel
|
| 3671 |
Rethinking structural balance in signed social networks
|
Estrada, Ernesto
|
|
2019
|
96-97 |
C |
p. 70-90
|
artikel
|
| 3672 |
Reversible complement cyclic codes over Galois rings with application to DNA codes
|
Kaur, Jasbir
|
|
|
96-97 |
C |
p. 162-170
|
artikel
|
| 3673 |
Revising Johnson’s table for the 21st century
|
de Figueiredo, Celina M.H.
|
|
|
96-97 |
C |
p. 184-200
|
artikel
|
| 3674 |
Revisiting Lagrangian relaxation for network design
|
Gendron, Bernard
|
|
2019
|
96-97 |
C |
p. 203-218
|
artikel
|
| 3675 |
Revisiting Prime Power RSA
|
Sarkar, Santanu
|
|
2016
|
96-97 |
C |
p. 127-133
7 p.
|
artikel
|
| 3676 |
r
-hued coloring of sparse graphs
|
Cheng, Jian
|
|
2018
|
96-97 |
C |
p. 75-81
|
artikel
|
| 3677 |
Richardson’s Theorem for
k
-colored kernels in strongly connected digraphs
|
Galeana-Sánchez, Hortensia
|
|
2016
|
96-97 |
C |
p. 47-52
6 p.
|
artikel
|
| 3678 |
Rich words in the block reversal of a word
|
Mahalingam, Kalpana
|
|
|
96-97 |
C |
p. 127-138
|
artikel
|
| 3679 |
Rigidity of symmetric linearly constrained frameworks in the plane
|
Nixon, Anthony
|
|
|
96-97 |
C |
p. 370-388
|
artikel
|
| 3680 |
Rényi–Berlekamp–Ulam searching game with bi-interval queries and two lies
|
Xing, Shu Min
|
|
2016
|
96-97 |
C |
p. 8-18
11 p.
|
artikel
|
| 3681 |
Robust cycle bases do not exist for
K
n
,
n
if
n
≥
8
|
Hammack, Richard H.
|
|
2018
|
96-97 |
C |
p. 206-211
|
artikel
|
| 3682 |
Robust recoverable and two-stage selection problems
|
Kasperski, Adam
|
|
2017
|
96-97 |
C |
p. 52-64
13 p.
|
artikel
|
| 3683 |
Robust scheduling with budgeted uncertainty
|
Bougeret, Marin
|
|
2019
|
96-97 |
C |
p. 93-107
|
artikel
|
| 3684 |
Robust similarity between hypergraphs based on valuations and mathematical morphology operators
|
Bloch, Isabelle
|
|
2015
|
96-97 |
C |
p. 2-19
18 p.
|
artikel
|
| 3685 |
Robust two-dose vaccination schemes and the directed
b
-matching problem
|
Segschneider, Jenny
|
|
|
96-97 |
C |
p. 369-392
|
artikel
|
| 3686 |
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
|
Büsing, Christina
|
|
|
96-97 |
C |
p. 187-213
|
artikel
|
| 3687 |
Role coloring bipartite graphs
|
Pandey, Sukanya
|
|
|
96-97 |
C |
p. 276-285
|
artikel
|
| 3688 |
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches
|
Homsi, Gabriel
|
|
|
96-97 |
C |
p. 191-207
|
artikel
|
| 3689 |
Roman
{
2
}
-domination
|
Chellali, Mustapha
|
|
2016
|
96-97 |
C |
p. 22-28
7 p.
|
artikel
|
| 3690 |
Roman domination and independent Roman domination on graphs with maximum degree three
|
Luiz, Atílio G.
|
|
|
96-97 |
C |
p. 260-278
|
artikel
|
| 3691 |
Roman
{
3
}
-domination (double Italian domination)
|
Mojdeh, Doost Ali
|
|
|
96-97 |
C |
p. 555-564
|
artikel
|
| 3692 |
Roman {3}-domination in graphs: Complexity and algorithms
|
Chaudhary, Juhi
|
|
|
96-97 |
C |
p. 301-325
|
artikel
|
| 3693 |
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
|
Erdős, Péter L.
|
|
|
96-97 |
C |
p. 205-213
|
artikel
|
| 3694 |
Rotational circulant graphs
|
Thomson, Alison
|
|
2014
|
96-97 |
C |
p. 296-305
10 p.
|
artikel
|
| 3695 |
Rough analysis of computation trees
|
Moshkov, Mikhail
|
|
|
96-97 |
C |
p. 90-108
|
artikel
|
| 3696 |
Rounds in a combinatorial search problem
|
Gerbner, Dániel
|
|
|
96-97 |
C |
p. 60-68
|
artikel
|
| 3697 |
Safe number and integrity of graphs
|
Fujita, Shinya
|
|
|
96-97 |
C |
p. 398-406
|
artikel
|
| 3698 |
Safe set problem on graphs
|
Fujita, Shinya
|
|
2016
|
96-97 |
C |
p. 106-111
6 p.
|
artikel
|
| 3699 |
Safe sets and in-dominating sets in digraphs
|
Bai, Yandong
|
|
|
96-97 |
C |
p. 215-227
|
artikel
|
| 3700 |
Sandwich and probe problems for excluding paths
|
de Figueiredo, Celina M.H.
|
|
2018
|
96-97 |
C |
p. 146-154
|
artikel
|
| 3701 |
Sandwiching the (generalized) Randić index
|
Knor, Martin
|
|
2015
|
96-97 |
C |
p. 160-166
7 p.
|
artikel
|
| 3702 |
Satisfiability threshold for random XOR-CNF formulas
|
Creignou, Nadia
|
|
1999
|
96-97 |
C |
p. 41-53
13 p.
|
artikel
|
| 3703 |
Saturated boundary
k
-alliances in graphs
|
Slimani, Hachem
|
|
2015
|
96-97 |
C |
p. 192-207
16 p.
|
artikel
|
| 3704 |
Saturation numbers for
t
P
k
with
k
less than 6
|
Cao, Shujuan
|
|
|
96-97 |
C |
p. 108-119
|
artikel
|
| 3705 |
Saturation numbers of joins of graphs
|
Hu, Sinan
|
|
|
96-97 |
C |
p. 300-309
|
artikel
|
| 3706 |
Scaling matrices and counting the perfect matchings in graphs
|
Dufossé, Fanny
|
|
|
96-97 |
C |
p. 130-146
|
artikel
|
| 3707 |
Schedules with a single preemption on uniform parallel machines
|
Soper, Alan J.
|
|
2019
|
96-97 |
C |
p. 332-343
|
artikel
|
| 3708 |
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
|
He, Cheng
|
|
2016
|
96-97 |
C |
p. 150-163
14 p.
|
artikel
|
| 3709 |
Scheduling co-operating stacking cranes with predetermined container sequences
|
Briskorn, Dirk
|
|
2016
|
96-97 |
C |
p. 70-85
16 p.
|
artikel
|
| 3710 |
Scheduling cooperative gantry cranes with seaside and landside jobs
|
Jaehn, Florian
|
|
2018
|
96-97 |
C |
p. 53-68
|
artikel
|
| 3711 |
Scheduling jobs with equal processing times and a single server on parallel identical machines
|
Zhang, An
|
|
2016
|
96-97 |
C |
p. 196-206
11 p.
|
artikel
|
| 3712 |
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
|
Furmańczyk, Hanna
|
|
2018
|
96-97 |
C |
p. 210-217
|
artikel
|
| 3713 |
Scheduling under a non-reversible energy source: An application of piecewise linear bounding of non-linear demand/cost functions
|
Ngueveu, Sandra Ulrich
|
|
2016
|
96-97 |
C |
p. 98-113
16 p.
|
artikel
|
| 3714 |
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
|
Dürr, Christoph
|
|
2015
|
96-97 |
C |
p. 20-27
8 p.
|
artikel
|
| 3715 |
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs
|
Chakraborty, Dibyayan
|
|
|
96-97 |
C |
p. 170-189
|
artikel
|
| 3716 |
Screw discrete dynamical systems and their applications to exact slow NIM
|
Gurvich, Vladimir
|
|
|
96-97 |
C |
p. 382-394
|
artikel
|
| 3717 |
Second neighborhood via probabilistic argument
|
Xia, Weihao
|
|
|
96-97 |
C |
p. 49-54
|
artikel
|
| 3718 |
Second-order moments of the size of randomly induced subgraphs of given order
|
Apollonio, Nicola
|
|
|
96-97 |
C |
p. 46-56
|
artikel
|
| 3719 |
Second-order productivity, second-order payoffs, and the Shapley value
|
Casajus, André
|
|
|
96-97 |
C |
p. 212-219
|
artikel
|
| 3720 |
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
|
Fernández-Duque, David
|
|
2016
|
96-97 |
C |
p. 118-135
18 p.
|
artikel
|
| 3721 |
Secure domination in cographs
|
Araki, Toru
|
|
2019
|
96-97 |
C |
p. 179-184
|
artikel
|
| 3722 |
Secure domination in proper interval graphs
|
Araki, Toru
|
|
|
96-97 |
C |
p. 70-76
|
artikel
|
| 3723 |
Secure GCM implementation on AVR
|
Liu, Zhe
|
|
2018
|
96-97 |
C |
p. 58-66
|
artikel
|
| 3724 |
Secure total domination in graphs: Bounds and complexity
|
Duginov, Oleg
|
|
2017
|
96-97 |
C |
p. 97-108
12 p.
|
artikel
|
| 3725 |
Secure total domination number in maximal outerplanar graphs
|
Aita, Yasufumi
|
|
|
96-97 |
C |
p. 65-70
|
artikel
|
| 3726 |
Security in Sierpiński graphs
|
Menon, Manju K.
|
|
|
96-97 |
C |
p. 10-15
|
artikel
|
| 3727 |
Selecting and covering colored points
|
Arkin, Esther M.
|
|
2018
|
96-97 |
C |
p. 75-86
|
artikel
|
| 3728 |
Selective dynamic compression
|
Klein, Shmuel T.
|
|
|
96-97 |
C |
p. 13-22
|
artikel
|
| 3729 |
Self-adhesivity in lattices of abstract conditional independence models
|
Boege, Tobias
|
|
|
96-97 |
C |
p. 196-225
|
artikel
|
| 3730 |
Semidefinite programming relaxations for the graph partitioning problem
|
Wolkowicz, Henry
|
|
1999
|
96-97 |
C |
p. 461-479
19 p.
|
artikel
|
| 3731 |
Semi-online scheduling on two identical machines with a common due date to maximize total early work
|
Chen, Xin
|
|
|
96-97 |
C |
p. 71-78
|
artikel
|
| 3732 |
Semi-proper interval graphs
|
Scheffler, Robert
|
|
|
96-97 |
C |
p. 22-41
|
artikel
|
| 3733 |
Semi-proper orientations of dense graphs
|
Araújo, Júlio
|
|
|
96-97 |
C |
p. 196-217
|
artikel
|
| 3734 |
Semi-transitive orientations and word-representable graphs
|
Halldórsson, Magnús M.
|
|
2016
|
96-97 |
C |
p. 164-171
8 p.
|
artikel
|
| 3735 |
Separable and equatable hypergraphs
|
Deza, Daniel
|
|
|
96-97 |
C |
p. 170-179
|
artikel
|
| 3736 |
Separating signatures in signed planar graphs
|
Naserasr, Reza
|
|
|
96-97 |
C |
p. 302-310
|
artikel
|
| 3737 |
Separator-based graph embedding into multidimensional grids with small edge-congestion
|
Matsubayashi, Akira
|
|
2015
|
96-97 |
C |
p. 119-137
19 p.
|
artikel
|
| 3738 |
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
|
Denzumi, Shuhei
|
|
2016
|
96-97 |
C |
p. 61-80
20 p.
|
artikel
|
| 3739 |
Sequence mixed graphs
|
Dalfó, C.
|
|
2017
|
96-97 |
C |
p. 110-116
7 p.
|
artikel
|
| 3740 |
Sequence saturation
|
Anand,
|
|
|
96-97 |
C |
p. 382-393
|
artikel
|
| 3741 |
Sequences of radius
k
for complete bipartite graphs
|
Dębski, Michał
|
|
2017
|
96-97 |
C |
p. 51-63
13 p.
|
artikel
|
| 3742 |
Serial exchanges in random bases
|
McGuinness, Sean
|
|
|
96-97 |
C |
p. 103-110
|
artikel
|
| 3743 |
Service chain placement in SDNs
|
Kutiel, Gilad
|
|
2019
|
96-97 |
C |
p. 168-180
|
artikel
|
| 3744 |
Set and size multipartite Ramsey numbers for stars
|
Perondi, Pablo H.
|
|
2018
|
96-97 |
C |
p. 368-372
|
artikel
|
| 3745 |
Set graphs. IV. Further connections with claw-freeness
|
Milanič, Martin
|
|
2014
|
96-97 |
C |
p. 113-121
9 p.
|
artikel
|
| 3746 |
Set-reconstructibility of Post classes
|
Couceiro, Miguel
|
|
2015
|
96-97 |
C |
p. 12-18
7 p.
|
artikel
|
| 3747 |
[
1
,
2
]
-sets and
[
1
,
2
]
-total sets in trees with algorithms
|
Goharshady, A.K.
|
|
2016
|
96-97 |
C |
p. 136-146
11 p.
|
artikel
|
| 3748 |
Sets of even type on
H
(
5
,
q
2
)
,
q
even
|
Cossidente, Antonio
|
|
2015
|
96-97 |
C |
p. 280-282
3 p.
|
artikel
|
| 3749 |
Settlement fund circulation problem
|
Hayakawa, Hitoshi
|
|
2019
|
96-97 |
C |
p. 86-103
|
artikel
|
| 3750 |
Set-valued games and mixed-strategy equilibria in discounted supergames
|
Berg, Kimmo
|
|
2019
|
96-97 |
C |
p. 1-14
|
artikel
|
| 3751 |
Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
|
Jin, Wengang
|
|
|
96-97 |
C |
p. 53-76
|
artikel
|
| 3752 |
Several classes of PcN power functions over finite fields
|
Wang, Xiaoqiang
|
|
|
96-97 |
C |
p. 171-182
|
artikel
|
| 3753 |
Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
|
Hernández, Verónica
|
|
2019
|
96-97 |
C |
p. 177-194
|
artikel
|
| 3754 |
Several families with incomparability and complementarity conditions
|
Goldwasser, John
|
|
2019
|
96-97 |
C |
p. 103-110
|
artikel
|
| 3755 |
Seymour’s Second Neighborhood Conjecture for 6-antitransitive digraphs
|
Hassan, Zohair R.
|
|
|
96-97 |
C |
p. 59-63
|
artikel
|
| 3756 |
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs
|
Daamouch, Moussa
|
|
|
96-97 |
C |
p. 454-457
|
artikel
|
| 3757 |
Seymour’s second neighborhood conjecture for
m
-free,
k
-transitive,
k
-anti-transitive digraphs and some approaches
|
Daamouch, Moussa
|
|
|
96-97 |
C |
p. 332-341
|
artikel
|
| 3758 |
Shapley–Folkman-type theorem for integrally convex sets
|
Murota, Kazuo
|
|
|
96-97 |
C |
p. 42-50
|
artikel
|
| 3759 |
Sharing the losses of a hierarchical venture
|
Zhang, Li
|
|
|
96-97 |
C |
p. 308-315
|
artikel
|
| 3760 |
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
|
O, Suil
|
|
2015
|
96-97 |
C |
p. 163-168
6 p.
|
artikel
|
| 3761 |
Sharp bounds for the Randić index of graphs with given minimum and maximum degree
|
O, Suil
|
|
|
96-97 |
C |
p. 111-115
|
artikel
|
| 3762 |
Sharp bounds on the Arithmetic–geometric index of graphs and line graphs
|
Li, Guohui
|
|
|
96-97 |
C |
p. 47-60
|
artikel
|
| 3763 |
Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
|
He, Xiaocong
|
|
2019
|
96-97 |
C |
p. 49-63
|
artikel
|
| 3764 |
Sharp lower bounds on the fractional matching number
|
Behrend, Roger E.
|
|
2015
|
96-97 |
C |
p. 272-274
3 p.
|
artikel
|
| 3765 |
Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
|
Wang, Chunxiang
|
|
2017
|
96-97 |
C |
p. 156-165
|
artikel
|
| 3766 |
Sharp upper bounds on the
Q
-index of (minimally) 2-connected graphs with given size
|
Guo, Shu-Guang
|
|
|
96-97 |
C |
p. 408-415
|
artikel
|
| 3767 |
Shattering-extremal set systems from Sperner families
|
Kusch, Christopher
|
|
|
96-97 |
C |
p. 92-101
|
artikel
|
| 3768 |
Shortcutting directed and undirected networks with a degree constraint
|
Tan, Richard B.
|
|
2017
|
96-97 |
C |
p. 91-117
27 p.
|
artikel
|
| 3769 |
Shortened universal cycles for permutations
|
Kirsch, Rachel
|
|
|
96-97 |
C |
p. 219-228
|
artikel
|
| 3770 |
Shortest distances as enumeration problem
|
Casel, Katrin
|
|
|
96-97 |
C |
p. 89-103
|
artikel
|
| 3771 |
Shortest odd paths in undirected graphs with conservative weight functions
|
Jüttner, Alpár
|
|
|
96-97 |
C |
p. 34-50
|
artikel
|
| 3772 |
Shortest paths in Sierpiński graphs
|
Xue, Bing
|
|
2014
|
96-97 |
C |
p. 314-321
8 p.
|
artikel
|
| 3773 |
Shortest paths with a cost constraint: A probabilistic analysis
|
Frieze, Alan
|
|
|
96-97 |
C |
p. 46-53
|
artikel
|
| 3774 |
Short
k
-rotation symmetric Boolean functions
|
Calderón-Gómez, José E.
|
|
|
96-97 |
C |
p. 49-64
|
artikel
|
| 3775 |
Short proofs on the structure of general partition, equistable and triangle graphs
|
Cerioli, Márcia R.
|
|
|
96-97 |
C |
p. 8-13
|
artikel
|
| 3776 |
Short signed circuit covers of signed graphs
|
Chen, Jing
|
|
2018
|
96-97 |
C |
p. 51-58
|
artikel
|
| 3777 |
Shrinking generators based on
σ
-LFSRs
|
Bishoi, Susil Kumar
|
|
|
96-97 |
C |
p. 493-500
|
artikel
|
| 3778 |
Shuffling matrices, Kronecker product and Discrete Fourier Transform
|
D’Angeli, Daniele
|
|
2017
|
96-97 |
C |
p. 1-18
18 p.
|
artikel
|
| 3779 |
Signed analogue of general Kotzig–Lovász decomposition
|
Kita, Nanao
|
|
|
96-97 |
C |
p. 61-70
|
artikel
|
| 3780 |
Signed double Roman domination in graphs
|
Ahangar, Hossein Abdollahzadeh
|
|
2019
|
96-97 |
C |
p. 1-11
|
artikel
|
| 3781 |
Signed line graphs with least eigenvalue
−
2
: The star complement technique
|
Belardo, Francesco
|
|
2016
|
96-97 |
C |
p. 29-38
10 p.
|
artikel
|
| 3782 |
Signed Roman
k
-domination in trees
|
Henning, Michael A.
|
|
2015
|
96-97 |
C |
p. 98-105
8 p.
|
artikel
|
| 3783 |
Similarity based deduplication with small data chunks
|
Aronovich, L.
|
|
2016
|
96-97 |
C |
p. 10-22
13 p.
|
artikel
|
| 3784 |
Simple cubic graphs with no short traveling salesman tour
|
Lukoťka, Robert
|
|
2018
|
96-97 |
C |
p. 218-222
|
artikel
|
| 3785 |
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
|
Lin, Min-Sheng
|
|
2018
|
96-97 |
C |
p. 144-153
|
artikel
|
| 3786 |
Simple PTAS’s for families of graphs excluding a minor
|
Cabello, Sergio
|
|
2015
|
96-97 |
C |
p. 41-48
8 p.
|
artikel
|
| 3787 |
Simpler proof for nonlinearity of majority function
|
Cusick, Thomas W.
|
|
|
96-97 |
C |
p. 55-59
|
artikel
|
| 3788 |
Simplifying optimal strategies in limsup and liminf stochastic games
|
Flesch, János
|
|
2018
|
96-97 |
C |
p. 40-56
|
artikel
|
| 3789 |
Simultaneous selection
|
Olszewski, Wojciech
|
|
2016
|
96-97 |
C |
p. 161-169
9 p.
|
artikel
|
| 3790 |
Single coronoid systems with an anti-forcing edge
|
Liang, Xiaodong
|
|
2017
|
96-97 |
C |
p. 94-103
10 p.
|
artikel
|
| 3791 |
Single-peaked preferences over multidimensional binary alternatives
|
Brown, Lindsey
|
|
2014
|
96-97 |
C |
p. 14-25
12 p.
|
artikel
|
| 3792 |
Singularities in Negami’s splitting formula for the Tutte polynomial
|
Burgos, J.M.
|
|
2018
|
96-97 |
C |
p. 65-74
|
artikel
|
| 3793 |
Skeletal configurations of ribbon trees
|
Cheng, Howard
|
|
2014
|
96-97 |
C |
p. 46-54
9 p.
|
artikel
|
| 3794 |
Skeleton matching polytope: Realization and isomorphism
|
Abreu, Nair
|
|
2019
|
96-97 |
C |
p. 27-31
|
artikel
|
| 3795 |
Slack matrices,
k
-products, and 2-level polytopes
|
Aprile, Manuel
|
|
|
96-97 |
C |
p. 199-213
|
artikel
|
| 3796 |
Slash and burn on graphs — Firefighting with general weights
|
Costa, Vitor
|
|
2016
|
96-97 |
C |
p. 4-13
|
artikel
|
| 3797 |
Slow coloring of
3
k
-connected graphs
|
Morris, Joan M.
|
|
|
96-97 |
C |
p. 226-230
|
artikel
|
| 3798 |
Smallest
C
2
ℓ
+
1
-critical graphs of odd-girth
2
k
+
1
|
Beaudou, Laurent
|
|
|
96-97 |
C |
p. 564-575
|
artikel
|
| 3799 |
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
|
Wang, Fan
|
|
|
96-97 |
C |
p. 16-26
|
artikel
|
| 3800 |
Snarks from a Kászonyi perspective: A survey
|
Bradley, Richard C.
|
|
2015
|
96-97 |
C |
p. 8-29
22 p.
|
artikel
|
| 3801 |
Solitaire Clobber played on Cartesian product of graphs
|
Dantas, Simone
|
|
2015
|
96-97 |
C |
p. 84-90
7 p.
|
artikel
|
| 3802 |
Solution to a conjecture on resistance diameter of lexicographic product of paths
|
Sun, Wensheng
|
|
|
96-97 |
C |
p. 139-148
|
artikel
|
| 3803 |
Solution to a conjecture on the maximum
A
B
C
index of graphs with given chromatic number
|
Chen, Xiaodan
|
|
2018
|
96-97 |
C |
p. 126-134
|
artikel
|
| 3804 |
Solution to a general version of a degree sequence variant of the Erdős–Sós conjecture
|
Zeng, De-Yan
|
|
|
96-97 |
C |
p. 161-170
|
artikel
|
| 3805 |
Solution to a problem of Katona on counting cliques of weighted graphs
|
Borg, Peter
|
|
|
96-97 |
C |
p. 147-155
|
artikel
|
| 3806 |
Solving all-pairs shortest path by single-source computations: Theory and practice
|
Brodnik, Andrej
|
|
2017
|
96-97 |
C |
p. 119-130
12 p.
|
artikel
|
| 3807 |
Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
|
Różycki, Rafał
|
|
2015
|
96-97 |
C |
p. 150-161
12 p.
|
artikel
|
| 3808 |
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
|
Liedloff, Mathieu
|
|
2014
|
96-97 |
C |
p. 60-68
9 p.
|
artikel
|
| 3809 |
Solving discrete logarithm problems faster with the aid of pre-computation
|
Hong, Jin
|
|
2019
|
96-97 |
C |
p. 93-119
|
artikel
|
| 3810 |
Solving energy issues for sweep coverage in wireless sensor networks
|
Gorain, Barun
|
|
2017
|
96-97 |
C |
p. 130-139
10 p.
|
artikel
|
| 3811 |
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter
|
Sæther, Sigve Hortemo
|
|
2017
|
96-97 |
C |
p. 88-97
10 p.
|
artikel
|
| 3812 |
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
|
Marandi, Ahmadreza
|
|
|
96-97 |
C |
p. 95-110
|
artikel
|
| 3813 |
Solving the clique cover problem on (bull,
C
4
)-free graphs
|
Cameron, Kathie
|
|
2019
|
96-97 |
C |
p. 119-122
|
artikel
|
| 3814 |
Solving the integrated shipment routing problem of a less-than-truckload carrier
|
Özener, Okan Örsan
|
|
2019
|
96-97 |
C |
p. 37-50
|
artikel
|
| 3815 |
Solving the search-LWE problem over projected lattices
|
Nakamura, Satoshi
|
|
|
96-97 |
C |
p. 69-81
|
artikel
|
| 3816 |
Solving the single crane scheduling problem at rail transshipment yards
|
Li, Xiyu
|
|
2019
|
96-97 |
C |
p. 134-147
|
artikel
|
| 3817 |
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model
|
Korbacher, Laura
|
|
|
96-97 |
C |
p. 145-162
|
artikel
|
| 3818 |
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
|
Gambette, Philippe
|
|
2018
|
96-97 |
C |
p. 62-79
|
artikel
|
| 3819 |
Sombor index of maximal outerplanar graphs
|
Li, Yunping
|
|
|
96-97 |
C |
p. 96-103
|
artikel
|
| 3820 |
Some advances on the set covering polyhedron of circulant matrices
|
Bianchi, S.
|
|
2014
|
96-97 |
C |
p. 59-70
12 p.
|
artikel
|
| 3821 |
Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph
|
Gao, Jing
|
|
|
96-97 |
C |
p. 21-31
|
artikel
|
| 3822 |
Some bounds on the zero forcing number of a graph
|
Gentner, Michael
|
|
2018
|
96-97 |
C |
p. 203-213
|
artikel
|
| 3823 |
Some comparative results concerning the Grundy and b-chromatic number of graphs
|
Masih, Zoya
|
|
|
96-97 |
C |
p. 1-6
|
artikel
|
| 3824 |
Some completion problems for graphs without chordless cycles of prescribed lengths
|
Busch, Arthur
|
|
2019
|
96-97 |
C |
p. 21-34
|
artikel
|
| 3825 |
Some degree and distance-based invariants of wreath products of graphs
|
Cavaleri, Matteo
|
|
|
96-97 |
C |
p. 22-43
|
artikel
|
| 3826 |
Some digraph classes that meet the directed path partition conjecture
|
Bo, Jiawen
|
|
|
96-97 |
C |
p. 260-267
|
artikel
|
| 3827 |
Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
|
Li, Shuchao
|
|
2016
|
96-97 |
C |
p. 130-142
13 p.
|
artikel
|
| 3828 |
Some efficiently solvable problems over integer partition polytopes
|
Onn, Shmuel
|
|
2015
|
96-97 |
C |
p. 135-140
6 p.
|
artikel
|
| 3829 |
Some extremal graphs with respect to inverse degree
|
Xu, Kexiang
|
|
2016
|
96-97 |
C |
p. 171-183
13 p.
|
artikel
|
| 3830 |
Some extremal problems on
A
α
-spectral radius of graphs with given size
|
Ye, Aiyun
|
|
|
96-97 |
C |
p. 286-294
|
artikel
|
| 3831 |
Some extremal problems on the distance involving peripheral vertices of trees with given matching number
|
Li, Shuchao
|
|
|
96-97 |
C |
p. 119-133
|
artikel
|
| 3832 |
Some forbidden combinations of branches in minimal-ABC trees
|
Dimitrov, Darko
|
|
2018
|
96-97 |
C |
p. 165-182
|
artikel
|
| 3833 |
Some further results on the maximal hitting times of trees with some given parameters
|
Li, Shuchao
|
|
|
96-97 |
C |
p. 115-134
|
artikel
|
| 3834 |
Some graphs determined by their
A
α
-spectra
|
Chen, Yuanyuan
|
|
|
96-97 |
C |
p. 46-55
|
artikel
|
| 3835 |
Some improved bounds on communication complexity via new decomposition of cliques
|
Amano, Kazuyuki
|
|
2014
|
96-97 |
C |
p. 249-254
6 p.
|
artikel
|
| 3836 |
Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
|
Li, Xueliang
|
|
|
96-97 |
C |
p. 110-120
|
artikel
|
| 3837 |
Some large trivalent graphs having small diameters
|
Kantor, William M.
|
|
1992
|
96-97 |
C |
p. 353-357
5 p.
|
artikel
|
| 3838 |
Some local–global phenomena in locally finite graphs
|
Asratian, Armen S.
|
|
|
96-97 |
C |
p. 166-176
|
artikel
|
| 3839 |
Some new bounds for the energy of graphs
|
Dong, Jiuying
|
|
|
96-97 |
C |
p. 73-79
|
artikel
|
| 3840 |
Some new characterizations of Hamiltonian cycles in triangular grid graphs
|
Bodroža-Pantić, Olga
|
|
2016
|
96-97 |
C |
p. 1-13
13 p.
|
artikel
|
| 3841 |
Some new results concerning power graphs and enhanced power graphs of groups
|
Bošnjak, Ivica
|
|
|
96-97 |
C |
p. 86-93
|
artikel
|
| 3842 |
Some new results on bar visibility of digraphs
|
Feng, Yuanrui
|
|
|
96-97 |
C |
p. 342-352
|
artikel
|
| 3843 |
Some notes on disjunctive short sum: polychromatic nim
|
Carvalho, Alda
|
|
|
96-97 |
C |
p. 113-125
|
artikel
|
| 3844 |
Some notes on the extremal
k
-generalized quasi-unicyclic graphs with respect to Zagreb indices
|
Liu, Muhuo
|
|
|
96-97 |
C |
p. 616-621
|
artikel
|
| 3845 |
Some novel minimax results for perfect matchings of hexagonal systems
|
Zhou, Xiangqian
|
|
|
96-97 |
C |
p. 435-445
|
artikel
|
| 3846 |
Some optimal combinatorial batch codes with
k
=
5
|
Jia, Dongdong
|
|
2019
|
96-97 |
C |
p. 127-137
|
artikel
|
| 3847 |
Some problems on induced subgraphs
|
Sivaraman, Vaidy
|
|
2018
|
96-97 |
C |
p. 422-427
|
artikel
|
| 3848 |
Some properties and applications of odd-colorable
r
-hypergraphs
|
Yuan, Xiying
|
|
2018
|
96-97 |
C |
p. 446-452
|
artikel
|
| 3849 |
Some properties on eccentricity matrices of uniform hypertrees
|
Zhou, Junpeng
|
|
|
96-97 |
C |
p. 86-95
|
artikel
|
| 3850 |
Some relations between the irreducible polynomials over a finite field and its quadratic extension
|
Kim, Ryul
|
|
|
96-97 |
C |
p. 106-111
|
artikel
|
| 3851 |
Some remarks on graphs with no induced subdivision of
K
4
|
Lan, Kaiyang
|
|
|
96-97 |
C |
p. 227-233
|
artikel
|
| 3852 |
Some remarks on interval colorings of complete tripartite and biregular graphs
|
Jing, Puning
|
|
|
96-97 |
C |
p. 193-197
|
artikel
|
| 3853 |
Some results about the inset edge and average distance of trees
|
Khalifeh, M.H.
|
|
|
96-97 |
C |
p. 186-199
|
artikel
|
| 3854 |
Some results on chemical energy of graphs
|
Zhang, Jianbin
|
|
2014
|
96-97 |
C |
p. 94-103
10 p.
|
artikel
|
| 3855 |
Some results on
{
K
2
,
C
2
i
+
1
:
i
≥
1
}
-factor in a graph
|
Lv, Xiaoyun
|
|
|
96-97 |
C |
p. 81-92
|
artikel
|
| 3856 |
Some results on
k
-critical
P
5
-free graphs
|
Cai, Qingqiong
|
|
|
96-97 |
C |
p. 91-100
|
artikel
|
| 3857 |
Some results on Lagrangians of hypergraphs
|
Tang, Qingsong
|
|
2014
|
96-97 |
C |
p. 222-238
17 p.
|
artikel
|
| 3858 |
Some results on
(
1
,
2
)
-rainbow connection number
|
Ma, Yingbin
|
|
|
96-97 |
C |
p. 231-238
|
artikel
|
| 3859 |
Some results on (strong) total proper connection number of some digraphs
|
Ma, Yingbin
|
|
|
96-97 |
C |
p. 44-56
|
artikel
|
| 3860 |
Some results on the avoidance of vincular patterns by multisets
|
Mansour, Toufik
|
|
2015
|
96-97 |
C |
p. 201-208
8 p.
|
artikel
|
| 3861 |
Some results on the saturation number of graphs
|
Hu, Jinze
|
|
|
96-97 |
C |
p. 188-196
|
artikel
|
| 3862 |
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
|
Galeana-Sánchez, Hortensia
|
|
2016
|
96-97 |
C |
p. 235-245
|
artikel
|
| 3863 |
Some results on the Wiener index related to the Šoltés problem of graphs
|
Dobrynin, Andrey A.
|
|
|
96-97 |
C |
p. 154-160
|
artikel
|
| 3864 |
Some results on vulnerability parameters and Wiener-type indices
|
Hua, Hongbo
|
|
|
96-97 |
C |
p. 262-271
|
artikel
|
| 3865 |
Some spectral conditions for star-factors in bipartite graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 124-130
|
artikel
|
| 3866 |
Some spectral inequalities for connected bipartite graphs with maximum
A
α
-index
|
Li, Shuchao
|
|
|
96-97 |
C |
p. 97-109
|
artikel
|
| 3867 |
Some spectral invariants of the neighborhood corona of graphs
|
Yang, Yujun
|
|
|
96-97 |
C |
p. 300-308
|
artikel
|
| 3868 |
Some star-critical Ramsey numbers
|
Li, Zhen
|
|
2015
|
96-97 |
C |
p. 301-305
5 p.
|
artikel
|
| 3869 |
Some sufficient conditions for a graph with minimum degree to be
k
-factor-critical
|
Zheng, Lin
|
|
|
96-97 |
C |
p. 279-291
|
artikel
|
| 3870 |
Some sufficient conditions for graphs being
k
-leaf-connected
|
Wu, Jiadong
|
|
|
96-97 |
C |
p. 11-20
|
artikel
|
| 3871 |
Some sufficient conditions for graphs to be
k
-leaf-connected
|
Liu, Hechao
|
|
|
96-97 |
C |
p. 1-8
|
artikel
|
| 3872 |
Some sum–product type estimates for two-variables over prime fields
|
Tran, Phuc D.
|
|
|
96-97 |
C |
p. 1-11
|
artikel
|
| 3873 |
Some tight bounds on the minimum and maximum forcing numbers of graphs
|
Liu, Qianqian
|
|
|
96-97 |
C |
p. 126-135
|
artikel
|
| 3874 |
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
|
Bermudo, Sergio
|
|
|
96-97 |
C |
p. 153-163
|
artikel
|
| 3875 |
Sorting by Prefix Reversals and Prefix Transpositions
|
Dias, Zanoni
|
|
2015
|
96-97 |
C |
p. 78-89
12 p.
|
artikel
|
| 3876 |
Sorting with forbidden intermediates
|
Comin, Carlo
|
|
|
96-97 |
C |
p. 49-68
|
artikel
|
| 3877 |
Space reduction constraints for the median of permutations problem
|
Milosz, Robin
|
|
|
96-97 |
C |
p. 201-213
|
artikel
|
| 3878 |
S
-packing chromatic vertex-critical graphs
|
Holub, Přemysl
|
|
|
96-97 |
C |
p. 119-127
|
artikel
|
| 3879 |
S
-packing coloring of cubic Halin graphs
|
Tarhini, Batoul
|
|
|
96-97 |
C |
p. 53-58
|
artikel
|
| 3880 |
S
-packing colorings of distance graphs
G
(
Z
,
{
2
,
t
}
)
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 143-154
|
artikel
|
| 3881 |
Spanners in randomly weighted graphs: Independent edge lengths
|
Frieze, Alan
|
|
|
96-97 |
C |
p. 68-74
|
artikel
|
| 3882 |
Spanning acyclic subdigraphs and strong
t
-panconnectivity of tournaments
|
Xiao, Lan
|
|
|
96-97 |
C |
p. 9-19
|
artikel
|
| 3883 |
Spanning cactus: Complexity and extensions
|
Datta, Alak Kumar
|
|
2017
|
96-97 |
C |
p. 19-28
10 p.
|
artikel
|
| 3884 |
Spanning caterpillar in biconvex bipartite graphs
|
Antony, Dhanyamol
|
|
|
96-97 |
C |
p. 32-36
|
artikel
|
| 3885 |
Spanning connectivity of
K
1
,
r
-free split graphs
|
Xiong, Wei
|
|
|
96-97 |
C |
p. 176-183
|
artikel
|
| 3886 |
Spanning 2-forests and resistance distance in 2-connected graphs
|
Barrett, Wayne
|
|
|
96-97 |
C |
p. 341-352
|
artikel
|
| 3887 |
Spanning
k
-trees and distance signless Laplacian spectral radius of graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 358-365
|
artikel
|
| 3888 |
Spanning paths in graphs
|
Mafuta, Phillip
|
|
2019
|
96-97 |
C |
p. 278-282
|
artikel
|
| 3889 |
Spanning trails in essentially 4-edge-connected graphs
|
Xu, Jinquan
|
|
2014
|
96-97 |
C |
p. 306-313
8 p.
|
artikel
|
| 3890 |
Spanning tree enumeration and nearly triangular graph Laplacians
|
Go, Christian
|
|
|
96-97 |
C |
p. 356-369
|
artikel
|
| 3891 |
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
|
Ge, Jun
|
|
|
96-97 |
C |
p. 542-554
|
artikel
|
| 3892 |
Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
|
Huang, Xinyu
|
|
|
96-97 |
C |
p. 105-109
|
artikel
|
| 3893 |
Spanning tree with lower bound on the degrees
|
Király, Zoltán
|
|
2018
|
96-97 |
C |
p. 82-88
|
artikel
|
| 3894 |
Sparse hypergraphs with applications in combinatorial rigidity
|
Jordán, Tibor
|
|
2015
|
96-97 |
C |
p. 93-101
9 p.
|
artikel
|
| 3895 |
Sparse obstructions for minor-covering parameters
|
Chatzidimitriou, Dimitris
|
|
|
96-97 |
C |
p. 28-50
|
artikel
|
| 3896 |
Sparse recovery with integrality constraints
|
Lange, Jan-Hendrik
|
|
|
96-97 |
C |
p. 346-366
|
artikel
|
| 3897 |
Special Issue dedicated to Workshop on Graph Spectra, Combinatorics and Optimization (WGSCO2018), Aveiro, Portugal, January 2018
|
Carvalho, Paula
|
|
2019
|
96-97 |
C |
p. 1
|
artikel
|
| 3898 |
Special structures in
Q
(
4
,
q
)
, projective planes and its application in
L
(
h
,
k
)
−
colorings of their Moore Graphs
|
Fresán-Figueroa, J.
|
|
|
96-97 |
C |
p. 31-37
|
artikel
|
| 3899 |
Spectral bounds for graph partitioning with prescribed partition sizes
|
Anjos, Miguel F.
|
|
2019
|
96-97 |
C |
p. 200-210
|
artikel
|
| 3900 |
Spectral characterization of the complete graph removing a path
|
Liu, Muhuo
|
|
|
96-97 |
C |
p. 499-512
|
artikel
|
| 3901 |
Spectral characterization of the complete graph removing a path of small length
|
Mao, Lihuan
|
|
2019
|
96-97 |
C |
p. 260-268
|
artikel
|
| 3902 |
Spectral characterizations of almost complete graphs
|
Cámara, Marc
|
|
|
96-97 |
C |
p. 19-23
|
artikel
|
| 3903 |
Spectral conditions for component factors in graphs involving minimum degree
|
Sun, Zhiren
|
|
|
96-97 |
C |
p. 180-187
|
artikel
|
| 3904 |
Spectral conditions of pancyclicity for
t
-tough graphs
|
Benediktovich, Vladimir I.
|
|
|
96-97 |
C |
p. 130-137
|
artikel
|
| 3905 |
Spectral distances on graphs
|
Gu, Jiao
|
|
2015
|
96-97 |
C |
p. 56-74
19 p.
|
artikel
|
| 3906 |
Spectral extrema of
F
2
-free graphs with given size revisited
|
Chen, Yuan
|
|
|
96-97 |
C |
p. 294-307
|
artikel
|
| 3907 |
Spectral properties of the eccentricity matrix of graphs
|
Wang, Jianfeng
|
|
|
96-97 |
C |
p. 168-177
|
artikel
|
| 3908 |
Spectral spread and trace norm of eccentricity matrix of graphs
|
Rather, Bilal Ahmad
|
|
|
96-97 |
C |
p. 9-19
|
artikel
|
| 3909 |
Spectra of eccentricity matrices of graphs
|
Mahato, Iswar
|
|
|
96-97 |
C |
p. 252-260
|
artikel
|
| 3910 |
Spectra of the Mycielskian of a signed graph and related products
|
Ul Rashid, Mir Riyaz
|
|
|
96-97 |
C |
p. 124-144
|
artikel
|
| 3911 |
Spectra of total graphs
|
Bu, Tianyi
|
|
|
96-97 |
C |
p. 75-82
|
artikel
|
| 3912 |
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
|
Orden, David
|
|
2019
|
96-97 |
C |
p. 234-243
|
artikel
|
| 3913 |
Spiders everywhere
|
Wiener, Gábor
|
|
|
96-97 |
C |
p. 516-522
|
artikel
|
| 3914 |
Sports scheduling search space connectivity: A riffle shuffle driven approach
|
Januario, Tiago
|
|
2016
|
96-97 |
C |
p. 113-120
8 p.
|
artikel
|
| 3915 |
Sprague–Grundy values and complexity for LCTR
|
Gottlieb, Eric
|
|
|
96-97 |
C |
p. 154-169
|
artikel
|
| 3916 |
Spreading in graphs
|
Brešar, Boštjan
|
|
|
96-97 |
C |
p. 139-150
|
artikel
|
| 3917 |
Square coloring of planar graphs with maximum degree at most five
|
Zou, Jiani
|
|
|
96-97 |
C |
p. 4-11
|
artikel
|
| 3918 |
Square roots of minor closed graph classes
|
Nestoridis, Nestor V.
|
|
2014
|
96-97 |
C |
p. 34-39
6 p.
|
artikel
|
| 3919 |
Squares and primitivity in partial words
|
Blanchet-Sadri, F.
|
|
2015
|
96-97 |
C |
p. 26-37
12 p.
|
artikel
|
| 3920 |
Squares of graphs are optimally
(
s
,
t
)
-supereulerian
|
Yan, Yue
|
|
|
96-97 |
C |
p. 331-342
|
artikel
|
| 3921 |
Stability factor for robust balancing of simple assembly lines under uncertainty
|
Gurevsky, Evgeny
|
|
|
96-97 |
C |
p. 113-132
|
artikel
|
| 3922 |
Stable-
Π
partitions of graphs
|
Dabrowski, Konrad K.
|
|
2015
|
96-97 |
C |
p. 104-114
11 p.
|
artikel
|
| 3923 |
Stack words and a bound for 3-stack sortable permutations
|
Bóna, Miklós
|
|
|
96-97 |
C |
p. 602-605
|
artikel
|
| 3924 |
2-stage robust MILP with continuous recourse variables
|
Billionnet, Alain
|
|
2014
|
96-97 |
C |
p. 21-32
12 p.
|
artikel
|
| 3925 |
Star-critical Ramsey numbers involving large books
|
Li, Yan
|
|
|
96-97 |
C |
p. 68-76
|
artikel
|
| 3926 |
Star-factors with large components, fractional
k
-extendability and spectral radius in graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 402-411
|
artikel
|
| 3927 |
Starting time minimization for the maximum job variant
|
Epstein, Leah
|
|
|
96-97 |
C |
p. 79-87
|
artikel
|
| 3928 |
State transfer and star complements in graphs
|
Zhou, Jiang
|
|
|
96-97 |
C |
p. 130-134
|
artikel
|
| 3929 |
State transfers in vertex complemented coronas
|
Wang, Jing
|
|
|
96-97 |
C |
p. 165-178
|
artikel
|
| 3930 |
Statistics on bargraphs viewed as cornerless Motzkin paths
|
Deutsch, Emeric
|
|
2017
|
96-97 |
C |
p. 54-66
13 p.
|
artikel
|
| 3931 |
Statistics on trapezoidal words and
k
-inversion sequences
|
Liu, Shao-Hua
|
|
|
96-97 |
C |
p. 1-8
|
artikel
|
| 3932 |
Steady state analysis of timed event graphs with time window constraints
|
Lee, Tae-Eog
|
|
2014
|
96-97 |
C |
p. 202-216
15 p.
|
artikel
|
| 3933 |
Steinberg-like theorems for backbone colouring
|
Araujo, J.
|
|
2018
|
96-97 |
C |
p. 155-167
|
artikel
|
| 3934 |
Steiner diameter of 3, 4 and 5-connected maximal planar graphs
|
Ali, Patrick
|
|
2014
|
96-97 |
C |
p. 222-228
7 p.
|
artikel
|
| 3935 |
Stirling networks: a versatile combinatorial topology for multiprocessor systems
|
Das, Sajal K.
|
|
1992
|
96-97 |
C |
p. 119-146
28 p.
|
artikel
|
| 3936 |
Storing four elements in the two query bitprobe model
|
Baig, Mirza Galib Anwarul Husain
|
|
|
96-97 |
C |
p. 121-131
|
artikel
|
| 3937 |
Streaming algorithms for multitasking scheduling with shared processing
|
Fu, Bin
|
|
|
96-97 |
C |
p. 346-355
|
artikel
|
| 3938 |
Streaming algorithms for robust submodular maximization
|
Yang, Ruiqi
|
|
|
96-97 |
C |
p. 112-122
|
artikel
|
| 3939 |
Strengthened bounds for the probability of
k
-out-of-
n
events
|
Qiu, Feng
|
|
2016
|
96-97 |
C |
p. 232-240
9 p.
|
artikel
|
| 3940 |
Strengthened Ore conditions for
(
s
,
t
)
-supereulerian graphs
|
Lei, Lan
|
|
|
96-97 |
C |
p. 68-80
|
artikel
|
| 3941 |
Strengthening Brooks’ chromatic bound on
P
6
-free graphs
|
Gupta, Uttam K.
|
|
|
96-97 |
C |
p. 334-346
|
artikel
|
| 3942 |
Strict chordal digraphs viewed as graphs with distinguished edges
|
McKee, Terry A.
|
|
|
96-97 |
C |
p. 122-126
|
artikel
|
| 3943 |
Strictly unimodality of the probability that the binomial distribution is more than its expectation
|
Sun, Ping
|
|
|
96-97 |
C |
p. 1-5
|
artikel
|
| 3944 |
Strict neighbor-distinguishing index of
K
4
-minor-free graphs
|
Gu, Jing
|
|
|
96-97 |
C |
p. 87-95
|
artikel
|
| 3945 |
Strict neighbor-distinguishing index of outerplanar graphs
|
Wang, Weifan
|
|
|
96-97 |
C |
p. 1-10
|
artikel
|
| 3946 |
Strict optimal rubbling of graphs
|
Murphy, Kyle
|
|
|
96-97 |
C |
p. 349-361
|
artikel
|
| 3947 |
Strong chromatic index of
K
1
,
t
-free graphs
|
Dębski, Michał
|
|
|
96-97 |
C |
p. 53-60
|
artikel
|
| 3948 |
Strong cliques and equistability of EPT graphs
|
Alcón, Liliana
|
|
2016
|
96-97 |
C |
p. 13-25
13 p.
|
artikel
|
| 3949 |
Strong cuts from compatibility relations for the Dial-a-Ride Problem
|
Morapitiye, Sunil
|
|
|
96-97 |
C |
p. 240-257
|
artikel
|
| 3950 |
Strong edge-coloring of cubic bipartite graphs: A counterexample
|
Cranston, Daniel W.
|
|
|
96-97 |
C |
p. 258-260
|
artikel
|
| 3951 |
Strong edge-coloring of 2-degenerate graphs
|
Yu, Gexin
|
|
|
96-97 |
C |
p. 11-14
|
artikel
|
| 3952 |
Strong edge-colouring of sparse planar graphs
|
Bensmail, Julien
|
|
2014
|
96-97 |
C |
p. 229-234
6 p.
|
artikel
|
| 3953 |
Strong equality of Roman and weak Roman domination in trees
|
Alvarado, José D.
|
|
2016
|
96-97 |
C |
p. 19-26
8 p.
|
artikel
|
| 3954 |
Strong incidence coloring of outerplanar graphs
|
Mousavi, Fatemeh Sadat
|
|
|
96-97 |
C |
p. 293-301
|
artikel
|
| 3955 |
Strong intractability results for generalized convex recoloring problems
|
Moura, Phablo F.S.
|
|
|
96-97 |
C |
p. 252-260
|
artikel
|
| 3956 |
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
|
Illés, Tibor
|
|
2016
|
96-97 |
C |
p. 201-210
10 p.
|
artikel
|
| 3957 |
Strongly restricted permutations and tiling with fences
|
Edwards, Kenneth
|
|
2015
|
96-97 |
C |
p. 82-90
9 p.
|
artikel
|
| 3958 |
Strongly self-centered orientation of complete
k
-partite graphs
|
Miao, Huifang
|
|
2014
|
96-97 |
C |
p. 119-125
7 p.
|
artikel
|
| 3959 |
Strongly separable matrices for nonadaptive combinatorial group testing
|
Fan, Jinping
|
|
|
96-97 |
C |
p. 180-187
|
artikel
|
| 3960 |
Strong products of hypergraphs: Unique prime factorization theorems and algorithms
|
Hellmuth, Marc
|
|
2014
|
96-97 |
C |
p. 60-71
12 p.
|
artikel
|
| 3961 |
Strong rainbow connection in digraphs
|
Sidorowicz, Elżbieta
|
|
2018
|
96-97 |
C |
p. 133-143
|
artikel
|
| 3962 |
Strong resolving graphs: The realization and the characterization problems
|
Kuziak, Dorota
|
|
2018
|
96-97 |
C |
p. 270-287
|
artikel
|
| 3963 |
Strong resolving partitions for strong product graphs and Cartesian product graphs
|
González Yero, Ismael
|
|
2016
|
96-97 |
C |
p. 70-78
9 p.
|
artikel
|
| 3964 |
Structural and spectral properties of corona graphs
|
Sharma, Rohan
|
|
2017
|
96-97 |
C |
p. 14-31
18 p.
|
artikel
|
| 3965 |
Structural insights about avoiding transfers in the patient-to-room assignment problem
|
Brandt, Tabea
|
|
|
96-97 |
C |
p. 231-248
|
artikel
|
| 3966 |
Structurally parameterized
d
-scattered set
|
Katsikarelis, Ioannis
|
|
|
96-97 |
C |
p. 168-186
|
artikel
|
| 3967 |
Structural parameterization for minimum conflict-free colouring
|
Ashok, Pradeesha
|
|
|
96-97 |
C |
p. 239-253
|
artikel
|
| 3968 |
Structural parameters, tight bounds, and approximation for
(
k
,
r
)
-center
|
Katsikarelis, Ioannis
|
|
2019
|
96-97 |
C |
p. 90-117
|
artikel
|
| 3969 |
Structural properties of resonance graphs of plane elementary bipartite graphs
|
Che, Zhongyuan
|
|
|
96-97 |
C |
p. 102-110
|
artikel
|
| 3970 |
Structural properties of the minimum cut of partially-supplied graphs
|
Griffing, Alexander R.
|
|
2014
|
96-97 |
C |
p. 152-157
6 p.
|
artikel
|
| 3971 |
Structure and coloring of (
P
7
,
C
5
, diamond)-free graphs
|
Chen, Ran
|
|
|
96-97 |
C |
p. 298-307
|
artikel
|
| 3972 |
Structure and enumeration results of matchable Lucas cubes
|
Wang, Xu
|
|
|
96-97 |
C |
p. 263-279
|
artikel
|
| 3973 |
Structure connectivity and substructure connectivity of split-star networks
|
Zhao, Lina
|
|
|
96-97 |
C |
p. 359-371
|
artikel
|
| 3974 |
Structure connectivity and substructure connectivity of star graphs
|
Li, Chunfang
|
|
|
96-97 |
C |
p. 472-480
|
artikel
|
| 3975 |
Structure of cycles in minimal strong digraphs
|
Arcos-Argudo, Miguel
|
|
2019
|
96-97 |
C |
p. 35-41
|
artikel
|
| 3976 |
Structure of some (
P
7
,
C
4
)-free graphs with application to colorings
|
Chen, Ran
|
|
|
96-97 |
C |
p. 14-23
|
artikel
|
| 3977 |
Student-project allocation with preferences over projects: Algorithmic and experimental results
|
Manlove, David
|
|
|
96-97 |
C |
p. 220-234
|
artikel
|
| 3978 |
Study on geometric–arithmetic, arithmetic–geometric and Randić indices of graphs
|
Das, Kinkar Chandra
|
|
|
96-97 |
C |
p. 229-245
|
artikel
|
| 3979 |
Subdivisions of four blocks cycles in digraphs with large chromatic number
|
Al-Mniny, Darine
|
|
|
96-97 |
C |
p. 71-75
|
artikel
|
| 3980 |
Subgraphs with orthogonal factorizations in graphs
|
Zhou, Sizhong
|
|
|
96-97 |
C |
p. 29-34
|
artikel
|
| 3981 |
Sublinear approximation algorithms for boxicity and related problems
|
Adiga, Abhijin
|
|
2018
|
96-97 |
C |
p. 7-22
|
artikel
|
| 3982 |
Submodular goal value of Boolean functions
|
Bach, Eric
|
|
2018
|
96-97 |
C |
p. 1-13
|
artikel
|
| 3983 |
Subnetwork reliability analysis in
k
-ary
n
-cubes
|
Feng, Kai
|
|
2019
|
96-97 |
C |
p. 85-92
|
artikel
|
| 3984 |
Subnetwork reliability analysis of star networks
|
Hu, Xiaomin
|
|
|
96-97 |
C |
p. 180-188
|
artikel
|
| 3985 |
Substitutable choice functions and convex geometry
|
Fuji, Jugo
|
|
2015
|
96-97 |
C |
p. 283-285
3 p.
|
artikel
|
| 3986 |
Sub-trees of a random tree
|
Kamiński, Bogumił
|
|
2019
|
96-97 |
C |
p. 119-129
|
artikel
|
| 3987 |
Succinct data structures for bounded clique-width graphs
|
Chakraborty, Sankardeep
|
|
|
96-97 |
C |
p. 55-68
|
artikel
|
| 3988 |
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
|
Darbinyan, Samvel Kh.
|
|
2018
|
96-97 |
C |
p. 70-76
|
artikel
|
| 3989 |
Sufficient conditions for graphs with girth
g
to be maximally
k
-restricted edge connected
|
Zhang, Lei
|
|
2019
|
96-97 |
C |
p. 320-325
|
artikel
|
| 3990 |
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
|
Darbinyan, Samvel Kh.
|
|
2019
|
96-97 |
C |
p. 87-96
|
artikel
|
| 3991 |
Sufficient conditions for
k
-factors and spanning trees of graphs
|
Ao, Guoyan
|
|
|
96-97 |
C |
p. 124-135
|
artikel
|
| 3992 |
Sufficient conditions for
k
-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
|
An, Mingqiang
|
|
|
96-97 |
C |
p. 74-80
|
artikel
|
| 3993 |
Sufficient conditions for properly colored
C
3
’s and
C
4
’s in edge-colored complete graphs
|
Han, Tingting
|
|
|
96-97 |
C |
p. 101-109
|
artikel
|
| 3994 |
Sufficient conditions for 2-rainbow connected graphs
|
Kemnitz, Arnfried
|
|
2016
|
96-97 |
C |
p. 247-250
4 p.
|
artikel
|
| 3995 |
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
|
Chen, Zhibing
|
|
2017
|
96-97 |
C |
p. 64-70
7 p.
|
artikel
|
| 3996 |
Sufficient sparseness conditions for
G
2
to be
(
Δ
+
1
)
-choosable, when
Δ
≥
5
|
Cranston, Daniel W.
|
|
2014
|
96-97 |
C |
p. 167-176
10 p.
|
artikel
|
| 3997 |
Sum-free cyclic multi-bases and constructions of Ramsey algebras
|
Alm, Jeremy F.
|
|
2015
|
96-97 |
C |
p. 204-212
9 p.
|
artikel
|
| 3998 |
Sum index and difference index of graphs
|
Harrington, Joshua
|
|
|
96-97 |
C |
p. 262-283
|
artikel
|
| 3999 |
Sum of weighted distances in trees
|
Cai, Qingqiong
|
|
2019
|
96-97 |
C |
p. 67-84
|
artikel
|
| 4000 |
Sum-perfect graphs
|
Litjens, Bart
|
|
2019
|
96-97 |
C |
p. 232-239
|
artikel
|
Tijdschrift beschrijving