| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A
9
7
-approximation algorithm for Graphic TSP in cubic bipartite graphs
|
Karp, Jeremy A.
|
|
2016
|
31-40 |
Index 1 |
p. 164-216
53 p.
|
artikel
|
| 2 |
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph
|
Călinescu, Gruia
|
|
|
31-40 |
Index 1 |
p. 241-261
|
artikel
|
| 3 |
A 2-approximation algorithm for the minimum weight edge dominating set problem
|
Fujito, Toshihiro
|
|
2002
|
31-40 |
Index 1 |
p. 199-207
9 p.
|
artikel
|
| 4 |
A 2/3-approximation algorithm for vertex-weighted matching
|
Al-Herz, Ahmed
|
|
|
31-40 |
Index 1 |
p. 46-67
|
artikel
|
| 5 |
A
(
B
+
1
)
-approximation for network flow interdiction with unit costs
|
Boeckmann, Jan
|
|
|
31-40 |
Index 1 |
p. 58-71
|
artikel
|
| 6 |
(
a
,
b
)
-codes in
Z
/
n
Z
|
Gravier, Sylvain
|
|
2013
|
31-40 |
Index 1 |
p. 612-617
6 p.
|
artikel
|
| 7 |
A better step-off algorithm for the knapsack problem
|
Greenberg, Harold
|
|
1980
|
31-40 |
Index 1 |
p. 21-25
5 p.
|
artikel
|
| 8 |
A biased edge coloring game
|
Wang, Runze
|
|
|
31-40 |
Index 1 |
p. 193-200
|
artikel
|
| 9 |
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
|
Nowicki, Eugeniusz
|
|
1995
|
31-40 |
Index 1 |
p. 237-256
20 p.
|
artikel
|
| 10 |
A bijection between permutations and floorplans, and its applications
|
Ackerman, Eyal
|
|
2006
|
31-40 |
Index 1 |
p. 1674-1684
11 p.
|
artikel
|
| 11 |
A bound for judicious
k
-partitions of graphs
|
Fan, Genghua
|
|
2014
|
31-40 |
Index 1 |
p. 86-99
14 p.
|
artikel
|
| 12 |
About equivalent interval colorings of weighted graphs
|
Bouchard, Mathieu
|
|
2009
|
31-40 |
Index 1 |
p. 3615-3624
10 p.
|
artikel
|
| 13 |
About
S
-packing coloring of 3-irregular subcubic graphs
|
Mortada, Maidoun
|
|
|
31-40 |
Index 1 |
p. 16-18
|
artikel
|
| 14 |
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
|
Charon, Irène
|
|
2006
|
31-40 |
Index 1 |
p. 2097-2116
20 p.
|
artikel
|
| 15 |
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
|
Hernández-Pérez, Hipólito
|
|
2004
|
31-40 |
Index 1 |
p. 126-139
14 p.
|
artikel
|
| 16 |
A branch-and-cut algorithm for the routing and spectrum allocation problem
|
Bianchetti, Marcelo
|
|
|
31-40 |
Index 1 |
p. 107-126
|
artikel
|
| 17 |
A branch-and-price algorithm for the robust graph coloring problem
|
Archetti, Claudia
|
|
2014
|
31-40 |
Index 1 |
p. 49-59
11 p.
|
artikel
|
| 18 |
(
a
,
b
)
-rectangle patterns in permutations and words
|
Kitaev, Sergey
|
|
2015
|
31-40 |
Index 1 |
p. 128-146
19 p.
|
artikel
|
| 19 |
A brief survey of perfect Mendelsohn packing and covering designs
|
Bennett, F.E.
|
|
1999
|
31-40 |
Index 1 |
p. 73-81
9 p.
|
artikel
|
| 20 |
A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
|
Klavžar, Sandi
|
|
2012
|
31-40 |
Index 1 |
p. 1277-1280
4 p.
|
artikel
|
| 21 |
A characterization of dissimilarity families of trees
|
Baldisserri, Agnese
|
|
2017
|
31-40 |
Index 1 |
p. 35-45
11 p.
|
artikel
|
| 22 |
A characterization of double Roman trees
|
Henning, Michael A.
|
|
2019
|
31-40 |
Index 1 |
p. 100-111
|
artikel
|
| 23 |
A characterization of graphs with given total coalition numbers
|
Henning, Michael A.
|
|
|
31-40 |
Index 1 |
p. 395-403
|
artikel
|
| 24 |
A characterization of graphs with maximum cycle isolation number
|
Chen, Siyue
|
|
|
31-40 |
Index 1 |
p. 161-175
|
artikel
|
| 25 |
A characterization of graphs with regular distance-2 graphs
|
Gaar, Elisabeth
|
|
|
31-40 |
Index 1 |
p. 181-218
|
artikel
|
| 26 |
A characterization of perfect Roman trees
|
Sheikholeslami, S.M.
|
|
|
31-40 |
Index 1 |
p. 501-508
|
artikel
|
| 27 |
A characterization of PQI interval orders
|
Tsoukiàs, A.
|
|
2003
|
31-40 |
Index 1 |
p. 387-397
11 p.
|
artikel
|
| 28 |
A characterization of 4-
χ
S
-vertex-critical graphs for packing sequences with
s
1
=
1
and
s
2
≥
3
|
Klavžar, Sandi
|
|
|
31-40 |
Index 1 |
p. 46-55
|
artikel
|
| 29 |
A characterization of uniquely representable interval graphs
|
Fishburn, Peter C.
|
|
1985
|
31-40 |
Index 1 |
p. 191-194
4 p.
|
artikel
|
| 30 |
Achievable sets, brambles, and sparse treewidth obstructions
|
Lucena, Brian
|
|
2007
|
31-40 |
Index 1 |
p. 1055-1065
11 p.
|
artikel
|
| 31 |
A
(
3
,
1
)
∗
-choosable theorem on toroidal graphs
|
Zhang, Li
|
|
2012
|
31-40 |
Index 1 |
p. 332-338
7 p.
|
artikel
|
| 32 |
A classification result on weighted
{
δ
v
μ
+
1
,
δ
v
μ
;
N
,
p
3
}
-minihypers
|
Ferret, S.
|
|
2006
|
31-40 |
Index 1 |
p. 277-293
17 p.
|
artikel
|
| 33 |
A class of asymptotically optimal group screening strategies with limited item participation
|
Cheng, Yongxi
|
|
2019
|
31-40 |
Index 1 |
p. 83-95
|
artikel
|
| 34 |
A class of asymptotically optimal group testing strategies to identify good items
|
Cheng, Yongxi
|
|
2019
|
31-40 |
Index 1 |
p. 109-116
|
artikel
|
| 35 |
A class of functions with low-valued Walsh spectrum
|
Li, Fengwei
|
|
|
31-40 |
Index 1 |
p. 92-105
|
artikel
|
| 36 |
A class of graphs that complementation makes infinitely many Cohen–Macaulay members
|
Ashitha, T.
|
|
|
31-40 |
Index 1 |
p. 189-198
|
artikel
|
| 37 |
A closed-form solution for the optimal release times for the
F
2
|
deteriorating jobs
|
∑
w
j
C
j
problem
|
Wagneur, Edouard
|
|
2011
|
31-40 |
Index 1 |
p. 1367-1376
10 p.
|
artikel
|
| 38 |
A coloring algorithm for
4
K
1
-free line graphs
|
Fraser, Dallas J.
|
|
2018
|
31-40 |
Index 1 |
p. 76-85
|
artikel
|
| 39 |
A combinatorial approach to a general two-term recurrence
|
Mansour, Toufik
|
|
2013
|
31-40 |
Index 1 |
p. 2084-2094
11 p.
|
artikel
|
| 40 |
A combinatorial formula for the Schur coefficients of chromatic symmetric functions
|
Wang, David G.L.
|
|
|
31-40 |
Index 1 |
p. 621-630
|
artikel
|
| 41 |
A combinatorial problem in database security
|
Horak, Peter
|
|
1999
|
31-40 |
Index 1 |
p. 119-126
8 p.
|
artikel
|
| 42 |
A comment to: Two classes of edge domination in graphs
|
Jahanbekam, S.
|
|
2009
|
31-40 |
Index 1 |
p. 400-401
2 p.
|
artikel
|
| 43 |
A compact quadratic model and linearizations for the minimum linear arrangement problem
|
de Andrade, Rafael Castro
|
|
|
31-40 |
Index 1 |
p. 134-148
|
artikel
|
| 44 |
A comparison of integer programming models for the partial directed weighted improper coloring problem
|
Hertz, Alain
|
|
2019
|
31-40 |
Index 1 |
p. 229-245
|
artikel
|
| 45 |
A comparison of lower bounds for the symmetric circulant traveling salesman problem
|
de Klerk, Etienne
|
|
2011
|
31-40 |
Index 1 |
p. 1815-1826
12 p.
|
artikel
|
| 46 |
A competitive algorithm in searching for many edges in a hypergraph
|
Chen, Ting
|
|
2007
|
31-40 |
Index 1 |
p. 566-571
6 p.
|
artikel
|
| 47 |
A competitive algorithm to find all defective edges in a graph
|
Hwang, Frank K.
|
|
2005
|
31-40 |
Index 1 |
p. 273-277
5 p.
|
artikel
|
| 48 |
A complete analysis of the convergence of
C
m
(
D
)
m
=
1
∞
for a multipartite tournament
D
|
Jung, Ji-Hwan
|
|
|
31-40 |
Index 1 |
p. 344-357
|
artikel
|
| 49 |
A complete characterization of paths that are
m
-step competition graphs
|
Belmont, Eva
|
|
2011
|
31-40 |
Index 1 |
p. 1381-1390
10 p.
|
artikel
|
| 50 |
A computational study of
f
-reversible processes on graphs
|
Lima, Carlos V.G.C.
|
|
2018
|
31-40 |
Index 1 |
p. 77-93
|
artikel
|
| 51 |
A computational substantiation of the
d
-step approach to the number of distinct squares problem
|
Deza, Antoine
|
|
2016
|
31-40 |
Index 1 |
p. 81-87
7 p.
|
artikel
|
| 52 |
A concentration bound for the longest increasing subsequence of a randomly chosen involution
|
Kiwi, Marcos
|
|
2006
|
31-40 |
Index 1 |
p. 1816-1823
8 p.
|
artikel
|
| 53 |
A concise characterization of strong knapsack facets
|
Chopra, Sunil
|
|
2019
|
31-40 |
Index 1 |
p. 136-152
|
artikel
|
| 54 |
A connection between circular colorings and periodic schedules
|
Yeh, Hong-Gwa
|
|
2009
|
31-40 |
Index 1 |
p. 1663-1668
6 p.
|
artikel
|
| 55 |
A constant factor approximation algorithm for boxicity of circular arc graphs
|
Adiga, Abhijin
|
|
2014
|
31-40 |
Index 1 |
p. 1-18
18 p.
|
artikel
|
| 56 |
A continuous approach for the concave cost supply problem via DC programming and DCA
|
Le Thi, Hoai An
|
|
2008
|
31-40 |
Index 1 |
p. 325-338
14 p.
|
artikel
|
| 57 |
A correction to a result in linear programming
|
Murty, Katta G.
|
|
1988
|
31-40 |
Index 1 |
p. 177-180
4 p.
|
artikel
|
| 58 |
A correspondence between scene analysis and motions of frameworks
|
Whiteley, Walter
|
|
1984
|
31-40 |
Index 1 |
p. 269-295
27 p.
|
artikel
|
| 59 |
A cost-scaling algorithm for 0–1 submodular flows
|
Shigeno, Maiko
|
|
1997
|
31-40 |
Index 1 |
p. 261-273
13 p.
|
artikel
|
| 60 |
Acquisition-extremal graphs
|
LeSaulnier, Timothy D.
|
|
2013
|
31-40 |
Index 1 |
p. 1521-1529
9 p.
|
artikel
|
| 61 |
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
|
Shepherd, Bruce
|
|
2001
|
31-40 |
Index 1 |
p. 301-315
15 p.
|
artikel
|
| 62 |
Acyclic and star colorings of cographs
|
Lyons, Andrew
|
|
2011
|
31-40 |
Index 1 |
p. 1842-1850
9 p.
|
artikel
|
| 63 |
Acyclic coloring of claw-free graphs with small degree
|
Wang, Juan
|
|
|
31-40 |
Index 1 |
p. 272-280
|
artikel
|
| 64 |
Acyclic colouring of 1-planar graphs
|
Borodin, O.V.
|
|
2001
|
31-40 |
Index 1 |
p. 29-41
13 p.
|
artikel
|
| 65 |
Acyclic edge coloring of planar graphs with girth at least 5
|
Hou, Jianfeng
|
|
2013
|
31-40 |
Index 1 |
p. 2958-2967
10 p.
|
artikel
|
| 66 |
Acyclic 4-edge colouring of non-regular subcubic graphs in linear time
|
Lukot’ka, Robert
|
|
2014
|
31-40 |
Index 1 |
p. 110-112
3 p.
|
artikel
|
| 67 |
Adaptive majority problems for restricted query graphs and for weighted sets
|
Damásdi, Gábor
|
|
|
31-40 |
Index 1 |
p. 235-245
|
artikel
|
| 68 |
Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56]
|
Aguilera, Néstor E.
|
|
2018
|
31-40 |
Index 1 |
p. 311-315
|
artikel
|
| 69 |
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
|
Li, Hengzhe
|
|
|
31-40 |
Index 1 |
p. 274-281
|
artikel
|
| 70 |
Δ
additive and
Δ
ultra-additive maps, Gromov's trees, and the Farris transform
|
Dress, A.
|
|
2005
|
31-40 |
Index 1 |
p. 51-73
23 p.
|
artikel
|
| 71 |
A decomposability index in logical analysis of data
|
Ono, Hirotaka
|
|
2004
|
31-40 |
Index 1 |
p. 165-180
16 p.
|
artikel
|
| 72 |
A decomposition of the matroids with the max-flow min-cut property
|
Tseng, F.T.
|
|
1986
|
31-40 |
Index 1 |
p. 329-364
36 p.
|
artikel
|
| 73 |
A distance approximating trees
|
Bálint, Vojtech
|
|
2008
|
31-40 |
Index 1 |
p. 2740-2752
13 p.
|
artikel
|
| 74 |
A distance-labelling problem for hypercubes
|
Zhou, Sanming
|
|
2008
|
31-40 |
Index 1 |
p. 2846-2854
|
artikel
|
| 75 |
Adjacency on combinatorial polyhedra
|
Matsuia, Tomomi
|
|
1995
|
31-40 |
Index 1 |
p. 311-321
11 p.
|
artikel
|
| 76 |
Adjacency on the constrained assignment problem
|
Alfakih, Abdo Y.
|
|
1998
|
31-40 |
Index 1 |
p. 269-274
6 p.
|
artikel
|
| 77 |
Adjacency polynomials of digraph transformations
|
Deng, Aiping
|
|
2016
|
31-40 |
Index 1 |
p. 15-38
24 p.
|
artikel
|
| 78 |
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
|
Sun, Lin
|
|
|
31-40 |
Index 1 |
p. 257-271
|
artikel
|
| 79 |
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
|
Tian, Shuangliang
|
|
2015
|
31-40 |
Index 1 |
p. 220-226
7 p.
|
artikel
|
| 80 |
Adjoining to
(
s
,
t
)
-Wythoff’s game its
P
-positions as moves
|
Liu, Wen An
|
|
2014
|
31-40 |
Index 1 |
p. 28-43
16 p.
|
artikel
|
| 81 |
A doubly cyclic channel assignment problem
|
McDiarmid, Colin
|
|
1997
|
31-40 |
Index 1 |
p. 263-268
6 p.
|
artikel
|
| 82 |
A doubly nonnegative relaxation for modularity density maximization
|
Izunaga, Yoichi
|
|
|
31-40 |
Index 1 |
p. 69-78
|
artikel
|
| 83 |
A duality theorem for linear congruences
|
Williams, H.P.
|
|
1984
|
31-40 |
Index 1 |
p. 93-103
11 p.
|
artikel
|
| 84 |
A family of efficient six-regular circulants representable as a Kronecker product
|
Jha, Pranava K.
|
|
2016
|
31-40 |
Index 1 |
p. 72-84
13 p.
|
artikel
|
| 85 |
A family of mixed graphs with large order and diameter 2
|
Araujo-Pardo, G.
|
|
2017
|
31-40 |
Index 1 |
p. 57-63
7 p.
|
artikel
|
| 86 |
A fast algorithm for multiplying min-sum permutations
|
Sakai, Yoshifumi
|
|
2011
|
31-40 |
Index 1 |
p. 2175-2183
9 p.
|
artikel
|
| 87 |
A fast algorithm for strongly correlated knapsack problems
|
Pisinger, David
|
|
1998
|
31-40 |
Index 1 |
p. 197-212
16 p.
|
artikel
|
| 88 |
A fast approximation algorithm for the multicovering problem
|
Hall, Nicholas G.
|
|
1986
|
31-40 |
Index 1 |
p. 35-40
6 p.
|
artikel
|
| 89 |
A faster algorithm for packing branchings in digraphs
|
Lee, Orlando
|
|
2015
|
31-40 |
Index 1 |
p. 121-131
11 p.
|
artikel
|
| 90 |
A faster FPTAS for knapsack problem with cardinality constraint
|
Li, Wenxin
|
|
|
31-40 |
Index 1 |
p. 71-85
|
artikel
|
| 91 |
A faster parameterized algorithm for Pseudoforest Deletion
|
Bodlaender, Hans L.
|
|
2018
|
31-40 |
Index 1 |
p. 42-56
|
artikel
|
| 92 |
A fast parallel algorithm to recognize P4-sparse graphs
|
Lin, Rong
|
|
1998
|
31-40 |
Index 1 |
p. 191-215
25 p.
|
artikel
|
| 93 |
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
|
Alix, Munier Kordon
|
|
|
31-40 |
Index 1 |
p. 1-6
|
artikel
|
| 94 |
A formal framework for Stringology
|
Soltys, Michael
|
|
|
31-40 |
Index 1 |
p. 141-151
|
artikel
|
| 95 |
A generalization of Fibonacci and Lucas matrices
|
Stanimirović, Predrag
|
|
2008
|
31-40 |
Index 1 |
p. 2606-2619
14 p.
|
artikel
|
| 96 |
A generalization of Hungarian method and Hall’s theorem with applications in wireless sensor networks
|
Bokal, Drago
|
|
2012
|
31-40 |
Index 1 |
p. 460-470
11 p.
|
artikel
|
| 97 |
A generalization of interval edge-colorings of graphs
|
Petrosyan, P.A.
|
|
2010
|
31-40 |
Index 1 |
p. 1827-1837
11 p.
|
artikel
|
| 98 |
A generalization of Lucas polynomial sequence
|
Cheon, Gi-Sang
|
|
2009
|
31-40 |
Index 1 |
p. 920-927
8 p.
|
artikel
|
| 99 |
A generalization of Opsut’s result on the competition numbers of line graphs
|
Kim, Suh-Ryung
|
|
2015
|
31-40 |
Index 1 |
p. 152-159
8 p.
|
artikel
|
| 100 |
A generalization of Sperner’s theorem and an application to graph orientations
|
Qian, Jianguo
|
|
2009
|
31-40 |
Index 1 |
p. 2170-2176
7 p.
|
artikel
|
| 101 |
A generalization of the binary Preparata code
|
Kuzmin, A.S.
|
|
2006
|
31-40 |
Index 1 |
p. 337-345
9 p.
|
artikel
|
| 102 |
A generalization of the Haemers–Mathon bound for near hexagons
|
De Bruyn, Bart
|
|
2019
|
31-40 |
Index 1 |
p. 272-282
|
artikel
|
| 103 |
A generalization of the independence number
|
Katona, Gyula O.H.
|
|
|
31-40 |
Index 1 |
p. 1-3
|
artikel
|
| 104 |
Agent-based randomized broadcasting in large networks
|
Elsässer, Robert
|
|
2007
|
31-40 |
Index 1 |
p. 150-160
11 p.
|
artikel
|
| 105 |
A genuinely polynomial primal simplex algorithm for the assignment problem
|
Akgül, Mustafa
|
|
1993
|
31-40 |
Index 1 |
p. 93-115
23 p.
|
artikel
|
| 106 |
Aggregation of nonnegative integer-valued equations
|
Babayev, Djangir A.
|
|
1984
|
31-40 |
Index 1 |
p. 125-130
6 p.
|
artikel
|
| 107 |
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
|
Makuracki, Bartosz
|
|
2019
|
31-40 |
Index 1 |
p. 25-36
|
artikel
|
| 108 |
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
|
Giaro, K.
|
|
2009
|
31-40 |
Index 1 |
p. 3625-3630
6 p.
|
artikel
|
| 109 |
A graph-theoretic generalization of the Sauer-Shelah lemma
|
Cesa-Bianchi, Nicolò
|
|
1998
|
31-40 |
Index 1 |
p. 27-35
9 p.
|
artikel
|
| 110 |
A graph-theoretic result for a model of neural computation
|
Gerbessiotis, Alexandros V.
|
|
1998
|
31-40 |
Index 1 |
p. 257-262
6 p.
|
artikel
|
| 111 |
A greedy approximation algorithm for the group Steiner problem
|
Chekuri, Chandra
|
|
2006
|
31-40 |
Index 1 |
p. 15-34
20 p.
|
artikel
|
| 112 |
A Hamilton sufficient condition for completely independent spanning tree
|
Hong, Xia
|
|
|
31-40 |
Index 1 |
p. 183-187
|
artikel
|
| 113 |
A heuristic approach for searching
(
d
,
n
)
-packing colorings of infinite lattices
|
Korže, Danilo
|
|
2019
|
31-40 |
Index 1 |
p. 353-358
|
artikel
|
| 114 |
A heuristic approach to hard constrained shortest path problems
|
Ribeiro, Celso C.
|
|
1985
|
31-40 |
Index 1 |
p. 125-137
13 p.
|
artikel
|
| 115 |
A heuristic for the p-center problems in graphs
|
Plesník, J.
|
|
1987
|
31-40 |
Index 1 |
p. 263-268
6 p.
|
artikel
|
| 116 |
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
|
Averbakh, Igor
|
|
1996
|
31-40 |
Index 1 |
p. 17-32
16 p.
|
artikel
|
| 117 |
A homomorphic characterization of regular languages
|
Culik II, Karel
|
|
1982
|
31-40 |
Index 1 |
p. 149-152
4 p.
|
artikel
|
| 118 |
A hypocoloring model for batch scheduling
|
de Werra, D.
|
|
2005
|
31-40 |
Index 1 |
p. 3-26
24 p.
|
artikel
|
| 119 |
A kind of conditional connectivity of transposition networks generated by
k
-trees
|
Yang, Weihua
|
|
2018
|
31-40 |
Index 1 |
p. 132-138
|
artikel
|
| 120 |
A large set of non-Hamiltonian graphs
|
Katona, Gyula Y.
|
|
2001
|
31-40 |
Index 1 |
p. 99-115
17 p.
|
artikel
|
| 121 |
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
|
Foldes, Stephan
|
|
2009
|
31-40 |
Index 1 |
p. 2818-2827
10 p.
|
artikel
|
| 122 |
Algebraic degree of spectra of Cayley hypergraphs
|
Sripaisan, Naparat
|
|
|
31-40 |
Index 1 |
p. 87-94
|
artikel
|
| 123 |
Algebraic structure of quasicyclic codes
|
Lally, Kristine
|
|
2001
|
31-40 |
Index 1 |
p. 157-175
19 p.
|
artikel
|
| 124 |
Algorithmic aspects of open neighborhood location–domination in graphs
|
Panda, B.S.
|
|
2017
|
31-40 |
Index 1 |
p. 290-306
17 p.
|
artikel
|
| 125 |
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
|
Maw-Shang, Chang
|
|
1996
|
31-40 |
Index 1 |
p. 189-203
15 p.
|
artikel
|
| 126 |
Algorithmic complexity of list colorings
|
Kratochvíl, Jan
|
|
1994
|
31-40 |
Index 1 |
p. 297-302
6 p.
|
artikel
|
| 127 |
Algorithmic results for weak Roman domination problem in graphs
|
Paul, Kaustav
|
|
|
31-40 |
Index 1 |
p. 278-289
|
artikel
|
| 128 |
Algorithmic results on locating-total domination in graphs
|
Poureidi, Abolfazl
|
|
|
31-40 |
Index 1 |
p. 36-44
|
artikel
|
| 129 |
Algorithmic study on 2-transitivity of graphs
|
Paul, Subhabrata
|
|
|
31-40 |
Index 1 |
p. 57-75
|
artikel
|
| 130 |
Algorithms for finding a Kth best valued assignment
|
Matsui, Tomomi
|
|
1994
|
31-40 |
Index 1 |
p. 283-296
14 p.
|
artikel
|
| 131 |
Algorithms for finding a rooted
(
k
,
1
)
-edge-connected orientation
|
Király, Csaba
|
|
2014
|
31-40 |
Index 1 |
p. 263-268
6 p.
|
artikel
|
| 132 |
Algorithms for finding K-best perfect matchings
|
Chegireddy, Chandra R.
|
|
1987
|
31-40 |
Index 1 |
p. 155-165
11 p.
|
artikel
|
| 133 |
Algorithms for graphs with small octopus
|
Fomin, Fedor V.
|
|
2004
|
31-40 |
Index 1 |
p. 105-128
24 p.
|
artikel
|
| 134 |
Algorithms for interval catch digraphs
|
Prisner, Erich
|
|
1994
|
31-40 |
Index 1 |
p. 147-157
11 p.
|
artikel
|
| 135 |
Algorithms for maximum social welfare of online random trading
|
Chen, Xujin
|
|
|
31-40 |
Index 1 |
p. 229-240
|
artikel
|
| 136 |
Algorithms for Radon partitions with tolerance
|
Bereg, Sergey
|
|
|
31-40 |
Index 1 |
p. 207-215
|
artikel
|
| 137 |
Algorithms for the fixed linear crossing number problem
|
Cimikowski, Robert
|
|
2002
|
31-40 |
Index 1 |
p. 93-115
23 p.
|
artikel
|
| 138 |
Algorithms for unipolar and generalized split graphs
|
Eschen, Elaine M.
|
|
2014
|
31-40 |
Index 1 |
p. 195-201
7 p.
|
artikel
|
| 139 |
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
|
Djeumou Fomeni, Franklin
|
|
|
31-40 |
Index 1 |
p. 52-68
|
artikel
|
| 140 |
A linear algorithm for minimum 1-identifying codes in oriented trees
|
Charon, Irène
|
|
2006
|
31-40 |
Index 1 |
p. 1246-1253
8 p.
|
artikel
|
| 141 |
A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
|
Pandit, Parthe
|
|
2018
|
31-40 |
Index 1 |
p. 155-169
|
artikel
|
| 142 |
A linearization framework for unconstrained quadratic (0-1) problems
|
Gueye, Serigne
|
|
2009
|
31-40 |
Index 1 |
p. 1255-1266
12 p.
|
artikel
|
| 143 |
A linear-programming approach to the generalized Randić index
|
Fischermann, Miranca
|
|
2003
|
31-40 |
Index 1 |
p. 375-385
11 p.
|
artikel
|
| 144 |
A linear-time algorithm for computing the intersection of all odd cycles in a graph
|
Cai, Leizhen
|
|
1997
|
31-40 |
Index 1 |
p. 27-34
8 p.
|
artikel
|
| 145 |
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
|
Ihm, Insung
|
|
2017
|
31-40 |
Index 1 |
p. 98-112
15 p.
|
artikel
|
| 146 |
A linear-time algorithm for minimum
k
-hop dominating set of a cactus graph
|
Abu-Affash, A. Karim
|
|
|
31-40 |
Index 1 |
p. 488-499
|
artikel
|
| 147 |
A linear-time algorithm for testing full outer-2-planarity
|
Hong, Seok-Hee
|
|
2019
|
31-40 |
Index 1 |
p. 234-257
|
artikel
|
| 148 |
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)
|
Hamiez, Jean-Philippe
|
|
2004
|
31-40 |
Index 1 |
p. 252-265
14 p.
|
artikel
|
| 149 |
Alliance free sets in Cartesian product graphs
|
Yero, Ismael G.
|
|
2013
|
31-40 |
Index 1 |
p. 1618-1625
8 p.
|
artikel
|
| 150 |
Allowable processing orders in the accelerated cascade algorithm
|
Goldman, A.J
|
|
1986
|
31-40 |
Index 1 |
p. 213-221
9 p.
|
artikel
|
| 151 |
Almost empty monochromatic triangles in planar point sets
|
Basu, Deepan
|
|
2016
|
31-40 |
Index 1 |
p. 207-213
|
artikel
|
| 152 |
Almost Hadamard matrices: The case of arbitrary exponents
|
Banica, Teodor
|
|
2013
|
31-40 |
Index 1 |
p. 2367-2379
13 p.
|
artikel
|
| 153 |
A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
|
Witkowski, Rafał
|
|
2014
|
31-40 |
Index 1 |
p. 349-355
7 p.
|
artikel
|
| 154 |
A lower bound for a constrained quadratic 0–1 minimization problem
|
Billionnet, Alain
|
|
1997
|
31-40 |
Index 1 |
p. 135-146
12 p.
|
artikel
|
| 155 |
A lower bound for radio
k
-chromatic number
|
Saha, Laxman
|
|
2015
|
31-40 |
Index 1 |
p. 87-100
14 p.
|
artikel
|
| 156 |
A lower-bound for the number of productions required for a certain class of languages
|
Alspach, Brian
|
|
1983
|
31-40 |
Index 1 |
p. 109-115
7 p.
|
artikel
|
| 157 |
A lower bound for the shortness coefficient of a class of graphs
|
Harant, J.
|
|
1994
|
31-40 |
Index 1 |
p. 103-105
3 p.
|
artikel
|
| 158 |
A lower bound of the expected maximum number of edge-disjoint s-t paths on probabilistic graphs
|
Cheng, Peng
|
|
1995
|
31-40 |
Index 1 |
p. 137-155
19 p.
|
artikel
|
| 159 |
A lower bound on the crossing number of uniform hypergraphs
|
Anshu, Anurag
|
|
2016
|
31-40 |
Index 1 |
p. 11-15
5 p.
|
artikel
|
| 160 |
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
|
Brause, C.
|
|
2016
|
31-40 |
Index 1 |
p. 59-67
9 p.
|
artikel
|
| 161 |
A lower bound on the modified Randić index of line graphs
|
Zou, Zitao
|
|
|
31-40 |
Index 1 |
p. 136-140
|
artikel
|
| 162 |
Alphabetic points in restricted growth functions
|
Blecher, Aubrey
|
|
|
31-40 |
Index 1 |
p. 130-137
|
artikel
|
| 163 |
Alternative formulations for the obnoxious p-median problem
|
Lin, Chang-Chun
|
|
|
31-40 |
Index 1 |
p. 366-373
|
artikel
|
| 164 |
A magic rectangle set on Abelian groups and its application
|
Cichacz, Sylwia
|
|
|
31-40 |
Index 1 |
p. 201-210
|
artikel
|
| 165 |
A Maiorana–McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity
>
2
n
-
1
-
2
n
/
2
+
2
n
/
2
-
2
|
Maitra, Subhamoy
|
|
2006
|
31-40 |
Index 1 |
p. 357-369
13 p.
|
artikel
|
| 166 |
A map from the lower-half of the n-cube onto the (n−1)-cube which preserves intersecting antichains
|
Miyakawa, Masahiro
|
|
1999
|
31-40 |
Index 1 |
p. 223-228
6 p.
|
artikel
|
| 167 |
A maxmin problem on finite automata
|
Champarnaud, J.-M.
|
|
1989
|
31-40 |
Index 1 |
p. 91-96
6 p.
|
artikel
|
| 168 |
Amenable colorings
|
Mahadev, N.V.R.
|
|
1997
|
31-40 |
Index 1 |
p. 225-238
14 p.
|
artikel
|
| 169 |
A method for efficiently computing the number of codewords of fixed weights in linear codes
|
Bouyukliev, Iliya
|
|
2008
|
31-40 |
Index 1 |
p. 2986-3004
|
artikel
|
| 170 |
A min-max relation for K
3-covers in graphs noncontractible to K
5
e
|
Mahjoub, Ali Ridha
|
|
1995
|
31-40 |
Index 1 |
p. 209-219
11 p.
|
artikel
|
| 171 |
A
min
–
max
relation in flowgraphs and some applications
|
Ferreira, Carlos Eduardo
|
|
2018
|
31-40 |
Index 1 |
p. 65-76
|
artikel
|
| 172 |
A modified greedy algorithm for dispersively weighted 3-set cover
|
Fujito, Toshihiro
|
|
2006
|
31-40 |
Index 1 |
p. 1392-1400
9 p.
|
artikel
|
| 173 |
A Monge property for the d-dimensional transportation problem
|
Bein, Wolfgang W.
|
|
1995
|
31-40 |
Index 1 |
p. 97-109
13 p.
|
artikel
|
| 174 |
A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem
|
Boussier, Sylvain
|
|
2010
|
31-40 |
Index 1 |
p. 97-109
13 p.
|
artikel
|
| 175 |
An adaptive memory algorithm for the k-coloring problem
|
Galinier, Philippe
|
|
2008
|
31-40 |
Index 1 |
p. 267-279
13 p.
|
artikel
|
| 176 |
An algebraic analysis of the connectivity of DeBruijn and shuffle-exchange digraphs
|
Baumslag, Marc
|
|
1995
|
31-40 |
Index 1 |
p. 213-227
15 p.
|
artikel
|
| 177 |
An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
|
Sugihara, Kōkichi
|
|
1984
|
31-40 |
Index 1 |
p. 77-104
28 p.
|
artikel
|
| 178 |
An algorithm for an Eulerian trail traversing specified edges in given order
|
Cai, Mao-Cheng
|
|
1994
|
31-40 |
Index 1 |
p. 233-239
7 p.
|
artikel
|
| 179 |
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
|
Morgana, Aurora
|
|
2004
|
31-40 |
Index 1 |
p. 225-241
17 p.
|
artikel
|
| 180 |
An algorithm for finding homogeneous pairs
|
Everett, Hazel
|
|
1997
|
31-40 |
Index 1 |
p. 209-218
10 p.
|
artikel
|
| 181 |
An algorithm for fractional assignment problems
|
Shigeno, Maiko
|
|
1995
|
31-40 |
Index 1 |
p. 333-343
11 p.
|
artikel
|
| 182 |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
|
Komusiewicz, Christian
|
|
2015
|
31-40 |
Index 1 |
p. 145-161
17 p.
|
artikel
|
| 183 |
An algorithmic separating hyperplane theorem and its applications
|
Kalantari, Bahman
|
|
2019
|
31-40 |
Index 1 |
p. 59-82
|
artikel
|
| 184 |
An algorithm to find two distance domination parameters in a graph
|
Fricke, Gerd H.
|
|
1996
|
31-40 |
Index 1 |
p. 85-91
7 p.
|
artikel
|
| 185 |
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
|
Potts, C.N.
|
|
1985
|
31-40 |
Index 1 |
p. 155-164
10 p.
|
artikel
|
| 186 |
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
|
Gawiejnowicz, Stanisław
|
|
2006
|
31-40 |
Index 1 |
p. 2150-2166
17 p.
|
artikel
|
| 187 |
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
|
Gu, Mei-Mei
|
|
|
31-40 |
Index 1 |
p. 80-91
|
artikel
|
| 188 |
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
|
Wang, Di
|
|
2009
|
31-40 |
Index 1 |
p. 3746-3753
8 p.
|
artikel
|
| 189 |
An analysis of root functions—A subclass of the Impossible Class of Faulty Functions (ICFF)
|
Pasalic, E.
|
|
2017
|
31-40 |
Index 1 |
p. 1-13
13 p.
|
artikel
|
| 190 |
An analysis of the redundancy of graph invariants used in chemoinformatics
|
Hollas, Boris
|
|
2006
|
31-40 |
Index 1 |
p. 2484-2498
15 p.
|
artikel
|
| 191 |
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne–Goodman–Hedetniemi algorithm
|
Cooper, Colin
|
|
2009
|
31-40 |
Index 1 |
p. 2010-2014
5 p.
|
artikel
|
| 192 |
An application of the Turán theorem to domination in graphs
|
Shan, Erfang
|
|
2008
|
31-40 |
Index 1 |
p. 2712-2718
7 p.
|
artikel
|
| 193 |
An approximation algorithm for dissecting a rectangle into rectangles with specified areas
|
Nagamochi, Hiroshi
|
|
2007
|
31-40 |
Index 1 |
p. 523-537
15 p.
|
artikel
|
| 194 |
An 8-approximation algorithm for
L
(
2
,
1
)
-labeling of unit disk graphs
|
Ono, Hirotaka
|
|
|
31-40 |
Index 1 |
p. 93-101
|
artikel
|
| 195 |
An approximation algorithm for maximum triangle packing
|
Hassin, Refael
|
|
2006
|
31-40 |
Index 1 |
p. 971-979
9 p.
|
artikel
|
| 196 |
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
|
Kuroki, Yusuke
|
|
2009
|
31-40 |
Index 1 |
p. 2124-2135
12 p.
|
artikel
|
| 197 |
An approximation algorithm for the Generalized
k
-Multicut problem
|
Zhang, Peng
|
|
2012
|
31-40 |
Index 1 |
p. 1240-1247
8 p.
|
artikel
|
| 198 |
An approximation algorithm for the longest cycle problem in solid grid graphs
|
Asgharian Sardroud, Asghar
|
|
2016
|
31-40 |
Index 1 |
p. 6-12
7 p.
|
artikel
|
| 199 |
An approximation algorithm for the partial covering 0–1 integer program
|
Takazawa, Yotaro
|
|
|
31-40 |
Index 1 |
p. 126-133
|
artikel
|
| 200 |
An 0.828-approximation algorithm for the uncapacitated facility location problem
|
Ageev, A.A.
|
|
1999
|
31-40 |
Index 1 |
p. 149-156
8 p.
|
artikel
|
| 201 |
An approximation scheme for strip packing of rectangles with bounded dimensions
|
de La Vega, W.Fernandez
|
|
1998
|
31-40 |
Index 1 |
p. 93-101
9 p.
|
artikel
|
| 202 |
An assignment algorithm with applications to integrated circuit layout
|
Atallah, Mikhail J
|
|
1986
|
31-40 |
Index 1 |
p. 9-22
14 p.
|
artikel
|
| 203 |
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
|
Sauerhoff, Martin
|
|
2010
|
31-40 |
Index 1 |
p. 1195-1204
10 p.
|
artikel
|
| 204 |
A near-optimal kernel for a coloring problem
|
Haviv, Ishay
|
|
|
31-40 |
Index 1 |
p. 66-73
|
artikel
|
| 205 |
An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
|
Li, Jianxi
|
|
2014
|
31-40 |
Index 1 |
p. 104-115
12 p.
|
artikel
|
| 206 |
An effective formula for the number of solutions of a system of two 0, 1-equations
|
Buzytsky, P.L.
|
|
1983
|
31-40 |
Index 1 |
p. 127-133
7 p.
|
artikel
|
| 207 |
An efficient algorithm for group testing with runlength constraints
|
Dalai, Marco
|
|
|
31-40 |
Index 1 |
p. 181-187
|
artikel
|
| 208 |
An efficient algorithm for the parametric resource allocation problem
|
Katoh, Naoki
|
|
1985
|
31-40 |
Index 1 |
p. 261-274
14 p.
|
artikel
|
| 209 |
An efficient condition for a graph to be Hamiltonian
|
Li, Shengjia
|
|
2007
|
31-40 |
Index 1 |
p. 1842-1845
4 p.
|
artikel
|
| 210 |
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
|
Gusfield, Dan
|
|
2007
|
31-40 |
Index 1 |
p. 806-830
25 p.
|
artikel
|
| 211 |
An efficient matching algorithm applied in statistical physics
|
Bendisch, J.
|
|
1994
|
31-40 |
Index 1 |
p. 139-153
15 p.
|
artikel
|
| 212 |
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
|
Freville, Arnaud
|
|
1994
|
31-40 |
Index 1 |
p. 189-212
24 p.
|
artikel
|
| 213 |
A neighborhood union condition for fractional
(
a
,
b
,
k
)
-critical covered graphs
|
Zhou, Sizhong
|
|
|
31-40 |
Index 1 |
p. 343-348
|
artikel
|
| 214 |
An enumerative algorithm for the frequency assignment problem
|
Mannino, Carlo
|
|
2003
|
31-40 |
Index 1 |
p. 155-169
15 p.
|
artikel
|
| 215 |
A network approach for specially structured linear programs arising in 0–1 quadratic optimization
|
Adams, Warren P.
|
|
2008
|
31-40 |
Index 1 |
p. 2142-2165
24 p.
|
artikel
|
| 216 |
A new algorithmic framework for basic problems on binary images
|
Asano, T.
|
|
2017
|
31-40 |
Index 1 |
p. 376-392
17 p.
|
artikel
|
| 217 |
A new approach to finding the extra connectivity of graphs
|
Zhu, Qiang
|
|
|
31-40 |
Index 1 |
p. 265-271
|
artikel
|
| 218 |
A new characterization of dual bases in finite fields and its applications
|
Cao, Wei
|
|
2007
|
31-40 |
Index 1 |
p. 2236-2241
6 p.
|
artikel
|
| 219 |
A new characterization of matrices with the consecutive ones property
|
Narayanaswamy, N.S.
|
|
2009
|
31-40 |
Index 1 |
p. 3721-3727
7 p.
|
artikel
|
| 220 |
A new class of facets for the Latin square polytope
|
Appa, G.
|
|
2006
|
31-40 |
Index 1 |
p. 900-911
12 p.
|
artikel
|
| 221 |
A new class of nonbinary codes meeting the Griesmer bound
|
Hamada, Noboru
|
|
1993
|
31-40 |
Index 1 |
p. 219-226
8 p.
|
artikel
|
| 222 |
A new construction of broadcast graphs
|
Harutyunyan, Hovhannes A.
|
|
|
31-40 |
Index 1 |
p. 144-155
|
artikel
|
| 223 |
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
|
Barth, Dominique
|
|
1997
|
31-40 |
Index 1 |
p. 99-118
20 p.
|
artikel
|
| 224 |
A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities
|
Murthy, Ishwar
|
|
2019
|
31-40 |
Index 1 |
p. 119-143
|
artikel
|
| 225 |
A new family of expansive graphs
|
Matamala, Martín
|
|
2008
|
31-40 |
Index 1 |
p. 1125-1131
7 p.
|
artikel
|
| 226 |
A new generalization of kernels in digraphs
|
Ramoul, Amina
|
|
2017
|
31-40 |
Index 1 |
p. 673-684
12 p.
|
artikel
|
| 227 |
A new Greedoid: the family of local maximum stable sets of a forest
|
Levit, Vadim E.
|
|
2002
|
31-40 |
Index 1 |
p. 91-101
11 p.
|
artikel
|
| 228 |
A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L
1
|
Seneta, Eugene
|
|
1984
|
31-40 |
Index 1 |
p. 79-91
13 p.
|
artikel
|
| 229 |
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture
|
Henning, Michael A.
|
|
2014
|
31-40 |
Index 1 |
p. 45-52
8 p.
|
artikel
|
| 230 |
A new measure for comparing biomedical regions of interest in segmentation of digital images
|
Conci, Aura
|
|
2015
|
31-40 |
Index 1 |
p. 103-113
11 p.
|
artikel
|
| 231 |
A new note on 1-planar graphs with minimum degree 7
|
Huang, Yuanqiu
|
|
|
31-40 |
Index 1 |
p. 165-183
|
artikel
|
| 232 |
A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space
|
Prosanov, Roman
|
|
|
31-40 |
Index 1 |
p. 115-120
|
artikel
|
| 233 |
A new proof of Wojcicka's conjecture
|
Chen, Yaojun
|
|
2003
|
31-40 |
Index 1 |
p. 545-554
10 p.
|
artikel
|
| 234 |
A new reduction method in integer programming
|
Greenberg, Harold
|
|
1988
|
31-40 |
Index 1 |
p. 169-172
4 p.
|
artikel
|
| 235 |
A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
|
Contreras-Balbuena, Alejandro
|
|
2017
|
31-40 |
Index 1 |
p. 55-63
9 p.
|
artikel
|
| 236 |
A new upper bound on the total domination number in graphs with minimum degree six
|
Henning, Michael A.
|
|
|
31-40 |
Index 1 |
p. 1-7
|
artikel
|
| 237 |
An exact algorithm for maximum independent set in degree-5 graphs
|
Xiao, Mingyu
|
|
2016
|
31-40 |
Index 1 |
p. 137-155
19 p.
|
artikel
|
| 238 |
An exact algorithm for the bottleneck 2-connected
k
-Steiner network problem in
L
p
planes
|
Brazil, M.
|
|
2016
|
31-40 |
Index 1 |
p. 47-69
23 p.
|
artikel
|
| 239 |
An exact algorithm for the channel assignment problem
|
Král', Daniel
|
|
2005
|
31-40 |
Index 1 |
p. 326-331
6 p.
|
artikel
|
| 240 |
An exact algorithm for the 0–1 collapsing knapsack problem
|
Fayard, Didier
|
|
1994
|
31-40 |
Index 1 |
p. 175-187
13 p.
|
artikel
|
| 241 |
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
|
Boufflet, J.P.
|
|
1999
|
31-40 |
Index 1 |
p. 51-76
26 p.
|
artikel
|
| 242 |
An explicit construction of
(
3
,
t
)
-existentially closed graphs
|
Vinh, Le Anh
|
|
2013
|
31-40 |
Index 1 |
p. 1651-1654
4 p.
|
artikel
|
| 243 |
An extended abstract of an indepth algorithmic and computational study for maximum flow problems
|
Glover, Fred
|
|
1980
|
31-40 |
Index 1 |
p. 251-254
4 p.
|
artikel
|
| 244 |
An extended result of Kleitman and Saks concerning binary trees
|
Chu Yung-ching,
|
|
1985
|
31-40 |
Index 1 |
p. 255-259
5 p.
|
artikel
|
| 245 |
An extension of A.R. Rao’s characterization of potentially
K
m
+
1
-graphic sequences
|
Yin, Jian-Hua
|
|
2013
|
31-40 |
Index 1 |
p. 1118-1127
10 p.
|
artikel
|
| 246 |
An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications
|
Peng, Yuejian
|
|
2016
|
31-40 |
Index 1 |
p. 170-175
6 p.
|
artikel
|
| 247 |
An extension of the periodicity lemma to longer periods
|
Fraenkel, Aviezri S.
|
|
2005
|
31-40 |
Index 1 |
p. 146-155
10 p.
|
artikel
|
| 248 |
An external memory data structure for shortest path queries
|
Hutchinson, David
|
|
2003
|
31-40 |
Index 1 |
p. 55-82
28 p.
|
artikel
|
| 249 |
An extremal problem on non-full colorable graphs
|
Lu, Changhong
|
|
2007
|
31-40 |
Index 1 |
p. 2165-2173
9 p.
|
artikel
|
| 250 |
An
(
F
3
,
F
4
)
-partition of planar graphs without 4- and 6-cycles
|
Hu, Kaiyang
|
|
|
31-40 |
Index 1 |
p. 1-9
|
artikel
|
| 251 |
An implicit representation of chordal comparability graphs in linear time
|
Curtis, Andrew R.
|
|
2010
|
31-40 |
Index 1 |
p. 869-875
7 p.
|
artikel
|
| 252 |
An improved algorithm to construct edge-independent spanning trees in augmented cubes
|
Cheng, Baolei
|
|
|
31-40 |
Index 1 |
p. 55-70
|
artikel
|
| 253 |
An improved approximation for Maximum
k
-dependent Set on bipartite graphs
|
Hosseinian, Seyedmohammadhossein
|
|
|
31-40 |
Index 1 |
p. 95-101
|
artikel
|
| 254 |
An improved bound for the stepping-up lemma
|
Conlon, David
|
|
2013
|
31-40 |
Index 1 |
p. 1191-1196
6 p.
|
artikel
|
| 255 |
An improved lower bound for the Seidel energy of trees
|
Einollahzadeh, M.
|
|
|
31-40 |
Index 1 |
p. 381-386
|
artikel
|
| 256 |
An improved lower bound on the independence number of a graph
|
Henning, Michael A.
|
|
2014
|
31-40 |
Index 1 |
p. 120-128
9 p.
|
artikel
|
| 257 |
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
|
Tian, Ji
|
|
2012
|
31-40 |
Index 1 |
p. 1191-1210
20 p.
|
artikel
|
| 258 |
An improved randomized approximation algorithm for maximum triangle packing
|
Chen, Zhi-Zhong
|
|
2009
|
31-40 |
Index 1 |
p. 1640-1646
7 p.
|
artikel
|
| 259 |
An improved upper bound for neighbor sum distinguishing edge colorings of graphs
|
Yu, Xiaowei
|
|
|
31-40 |
Index 1 |
p. 104-109
|
artikel
|
| 260 |
An improved upper bound for planar Turán number of double star
S
2
,
5
|
Xu, Xin
|
|
|
31-40 |
Index 1 |
p. 326-332
|
artikel
|
| 261 |
An improved upper bound for the acyclic chromatic number of 1-planar graphs
|
Yang, Wanshun
|
|
|
31-40 |
Index 1 |
p. 275-291
|
artikel
|
| 262 |
An improved upper bound for the neighbor sum distinguishing index of graphs
|
Wang, Guanghui
|
|
2014
|
31-40 |
Index 1 |
p. 126-128
3 p.
|
artikel
|
| 263 |
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
|
Khoeilar, Rana
|
|
2019
|
31-40 |
Index 1 |
p. 159-167
|
artikel
|
| 264 |
An improvement of sufficient condition for
k
-leaf-connected graphs
|
Ma, Tingyan
|
|
|
31-40 |
Index 1 |
p. 1-10
|
artikel
|
| 265 |
An improvement on the number of simplices in
F
q
d
|
Pham, Duc Hiep
|
|
2017
|
31-40 |
Index 1 |
p. 95-105
11 p.
|
artikel
|
| 266 |
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
|
Babu, Jasine
|
|
|
31-40 |
Index 1 |
p. 432-440
|
artikel
|
| 267 |
An inequality for polymatroid functions and its applications
|
Boros, E.
|
|
2003
|
31-40 |
Index 1 |
p. 255-281
27 p.
|
artikel
|
| 268 |
An inequality on global alliances for trees
|
Yu, Alexandria
|
|
2015
|
31-40 |
Index 1 |
p. 227-229
3 p.
|
artikel
|
| 269 |
An infinite class of Z-cyclic whist tournaments on v players, v ≡ 1 (mod 4)
|
Finizio, Norman J.
|
|
1996
|
31-40 |
Index 1 |
p. 135-146
12 p.
|
artikel
|
| 270 |
An infinite family of 2-connected graphs that have reliability factorisations
|
Morgan, Kerri
|
|
2017
|
31-40 |
Index 1 |
p. 123-127
5 p.
|
artikel
|
| 271 |
An infinite family of graphs with a facile count of perfect matchings
|
Rosenfeld, Vladimir R.
|
|
2014
|
31-40 |
Index 1 |
p. 210-214
5 p.
|
artikel
|
| 272 |
An intersection theorem for systems of finite sets
|
Bey, Christian
|
|
2017
|
31-40 |
Index 1 |
p. 524-528
5 p.
|
artikel
|
| 273 |
An
O
∗
(
2
.
61
9
k
)
algorithm for 4-Path Vertex Cover
|
Tsur, Dekel
|
|
|
31-40 |
Index 1 |
p. 1-14
|
artikel
|
| 274 |
Anomalous behavior in bin packing algorithms
|
Murgolo, Frank D.
|
|
1988
|
31-40 |
Index 1 |
p. 229-243
15 p.
|
artikel
|
| 275 |
An O(n
2) algorithm for maximum cycle mean of Monge matrices in max-algebra
|
Gavalec, Martin
|
|
2003
|
31-40 |
Index 1 |
p. 651-656
6 p.
|
artikel
|
| 276 |
An O(n
2) algorithm for the maximum cycle mean of an n×n bivalent matrix
|
Butkovic, P.
|
|
1992
|
31-40 |
Index 1 |
p. 157-162
6 p.
|
artikel
|
| 277 |
A nonfactorial algorithm for testing isomorphism of two graphs
|
Goldberg, Mark.K.
|
|
1983
|
31-40 |
Index 1 |
p. 229-236
8 p.
|
artikel
|
| 278 |
An O(nm)-time algorithm for computing the dual of a regular Boolean function
|
Peled, Uri N.
|
|
1994
|
31-40 |
Index 1 |
p. 309-323
15 p.
|
artikel
|
| 279 |
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
|
Masuzawa, Toshimitsu
|
|
1987
|
31-40 |
Index 1 |
p. 67-105
39 p.
|
artikel
|
| 280 |
An ordering theorem on the
Q
-spectral radius of graphs with given size and its applications
|
Guo, Shu-Guang
|
|
|
31-40 |
Index 1 |
p. 91-98
|
artikel
|
| 281 |
A note on a conjecture of Wu, Xu and Xu
|
Lan, Kaiyang
|
|
|
31-40 |
Index 1 |
p. 33-36
|
artikel
|
| 282 |
A note on a directed version of the 1-2-3 Conjecture
|
Horňák, Mirko
|
|
2018
|
31-40 |
Index 1 |
p. 472-476
|
artikel
|
| 283 |
A note on adjacent vertex distinguishing colorings of graphs
|
Axenovich, M.
|
|
2016
|
31-40 |
Index 1 |
p. 1-7
7 p.
|
artikel
|
| 284 |
A note on approximating the
b
-chromatic number
|
Galčík, František
|
|
2013
|
31-40 |
Index 1 |
p. 1137-1140
4 p.
|
artikel
|
| 285 |
A note on 3-bisections in subcubic graphs
|
Cui, Qing
|
|
|
31-40 |
Index 1 |
p. 147-152
|
artikel
|
| 286 |
A note on bounds for the broadcast domination number of graphs
|
Sen, Jishnu
|
|
|
31-40 |
Index 1 |
p. 162-169
|
artikel
|
| 287 |
A note on breaking small automorphisms in graphs
|
Kalinowski, Rafał
|
|
2017
|
31-40 |
Index 1 |
p. 221-225
|
artikel
|
| 288 |
A note on cake cutting
|
Even, S.
|
|
1984
|
31-40 |
Index 1 |
p. 285-296
12 p.
|
artikel
|
| 289 |
A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
|
Feng, Yong-De
|
|
|
31-40 |
Index 1 |
p. 84-89
|
artikel
|
| 290 |
A note on collections of graphs with non-surjective lambda labelings
|
Georges, John P.
|
|
2005
|
31-40 |
Index 1 |
p. 92-98
7 p.
|
artikel
|
| 291 |
A note on coloring digraphs of large girth
|
Steiner, Raphael
|
|
|
31-40 |
Index 1 |
p. 62-64
|
artikel
|
| 292 |
A note on domination number in maximal outerplanar graphs
|
Liu, Chanjuan
|
|
|
31-40 |
Index 1 |
p. 90-94
|
artikel
|
| 293 |
A note on eigenvalue bounds for independence numbers of non-regular graphs
|
Li, Yusheng
|
|
2014
|
31-40 |
Index 1 |
p. 146-149
4 p.
|
artikel
|
| 294 |
A note on entire choosability of plane graphs
|
Dong, Wei
|
|
2012
|
31-40 |
Index 1 |
p. 1257-1261
5 p.
|
artikel
|
| 295 |
A note on equidistant subspace codes
|
Bartoli, Daniele
|
|
2016
|
31-40 |
Index 1 |
p. 291-296
6 p.
|
artikel
|
| 296 |
A note on extremal trees for a bound on the double domination number
|
Kalaiyarasi, Ravi
|
|
|
31-40 |
Index 1 |
p. 71-75
|
artikel
|
| 297 |
A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date”
|
Kianfar, K.
|
|
2013
|
31-40 |
Index 1 |
p. 2205-2206
2 p.
|
artikel
|
| 298 |
A note on generic rigidity of graphs in higher dimension
|
Jordán, Tibor
|
|
|
31-40 |
Index 1 |
p. 97-101
|
artikel
|
| 299 |
A note on graphs with large girth and small minus domination number
|
Lee, Jaeun
|
|
1999
|
31-40 |
Index 1 |
p. 299-303
5 p.
|
artikel
|
| 300 |
A note on Hamilton
ℓ
-cycle decomposition of complete
k
-partite hypergraphs
|
Jiang, Taijiang
|
|
|
31-40 |
Index 1 |
p. 214-219
|
artikel
|
| 301 |
A note on list improper coloring of plane graphs
|
Dong, Wei
|
|
2009
|
31-40 |
Index 1 |
p. 433-436
4 p.
|
artikel
|
| 302 |
A note on M-convex functions on jump systems
|
Murota, Kazuo
|
|
|
31-40 |
Index 1 |
p. 492-502
|
artikel
|
| 303 |
A note on median eigenvalues of subcubic graphs
|
Wang, Yuzhenni
|
|
|
31-40 |
Index 1 |
p. 138-141
|
artikel
|
| 304 |
A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
|
Sarkar, Ushnish
|
|
|
31-40 |
Index 1 |
p. 350-355
|
artikel
|
| 305 |
A note on odd colorings of 1-planar graphs
|
Cranston, Daniel W.
|
|
|
31-40 |
Index 1 |
p. 112-117
|
artikel
|
| 306 |
A note on orientations of mixed graphs
|
Arkin, Esther M.
|
|
2002
|
31-40 |
Index 1 |
p. 271-278
8 p.
|
artikel
|
| 307 |
A note on partitions of graphs under degree constraints
|
Zu, Chunlei
|
|
|
31-40 |
Index 1 |
p. 631-633
|
artikel
|
| 308 |
A note on perfect Lee-codes over small alphabets
|
Lepistö, Timo
|
|
1981
|
31-40 |
Index 1 |
p. 73-74
2 p.
|
artikel
|
| 309 |
A note on 1-planar graphs
|
Ackerman, Eyal
|
|
2014
|
31-40 |
Index 1 |
p. 104-108
5 p.
|
artikel
|
| 310 |
A note on planar graphs with large width parameters and small grid-minors
|
Grigoriev, Alexander
|
|
2012
|
31-40 |
Index 1 |
p. 1262-1269
8 p.
|
artikel
|
| 311 |
A note on 1-planar graphs with minimum degree 7
|
Biedl, Therese
|
|
|
31-40 |
Index 1 |
p. 230-232
|
artikel
|
| 312 |
A note on prime distance graphs with chromatic number 3 or 4
|
George Barnabas, J.
|
|
|
31-40 |
Index 1 |
p. 38-44
|
artikel
|
| 313 |
A note on rainbow-free colorings of uniform hypergraphs
|
Gu, Ran
|
|
|
31-40 |
Index 1 |
p. 161-169
|
artikel
|
| 314 |
A note on
S
-packing colorings of lattices
|
Goddard, Wayne
|
|
2014
|
31-40 |
Index 1 |
p. 255-262
8 p.
|
artikel
|
| 315 |
A note on the Clustered Set Covering Problem
|
Alfandari, Laurent
|
|
2014
|
31-40 |
Index 1 |
p. 13-19
7 p.
|
artikel
|
| 316 |
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
|
Li, Pingshan
|
|
|
31-40 |
Index 1 |
p. 152-158
|
artikel
|
| 317 |
A note on the dispersion of admissible lattices
|
Ullrich, Mario
|
|
2019
|
31-40 |
Index 1 |
p. 385-387
|
artikel
|
| 318 |
A note on the domination dot-critical graphs
|
Chen, Xue-gang
|
|
2009
|
31-40 |
Index 1 |
p. 3743-3745
3 p.
|
artikel
|
| 319 |
A note on the independence number, connectivity and
k
-ended tree
|
Ha, Pham Hoang
|
|
|
31-40 |
Index 1 |
p. 142-144
|
artikel
|
| 320 |
A note on the integrity of grids
|
Żak, Andrzej
|
|
|
31-40 |
Index 1 |
p. 55-59
|
artikel
|
| 321 |
A note on the
L
(
2
,
1
)
-labelling problem of
G
(
k
,
m
)
|
Ye, Qingjie
|
|
|
31-40 |
Index 1 |
p. 273-275
|
artikel
|
| 322 |
A note on the localization number of random graphs: Diameter two case
|
Dudek, Andrzej
|
|
2019
|
31-40 |
Index 1 |
p. 107-112
|
artikel
|
| 323 |
A note on the lower bound of centralized radio broadcasting for planar reachability graphs
|
Galčík, F.
|
|
2009
|
31-40 |
Index 1 |
p. 853-857
5 p.
|
artikel
|
| 324 |
A note on the middle levels problem
|
Gusmão, Andréia C.S.
|
|
2016
|
31-40 |
Index 1 |
p. 290-296
|
artikel
|
| 325 |
A note on the number of perfect matchings of bipartite graphs
|
Fuji, Zhang
|
|
1997
|
31-40 |
Index 1 |
p. 275-282
8 p.
|
artikel
|
| 326 |
A note on the packing chromatic number of lexicographic products
|
Božović, Dragana
|
|
|
31-40 |
Index 1 |
p. 34-37
|
artikel
|
| 327 |
A note on the precedence-constrained class sequencing problem
|
Correa, José R.
|
|
2007
|
31-40 |
Index 1 |
p. 257-259
3 p.
|
artikel
|
| 328 |
A note on the signed edge domination number in graphs
|
Fu, Xueliang
|
|
2008
|
31-40 |
Index 1 |
p. 2790-2792
3 p.
|
artikel
|
| 329 |
A note on the Steiner
k
-radius and Steiner
k
-diameter
|
Reiswig, Josiah
|
|
|
31-40 |
Index 1 |
p. 13-20
|
artikel
|
| 330 |
A note on the strength and minimum color sum of bipartite graphs
|
Kosowski, Adrian
|
|
2009
|
31-40 |
Index 1 |
p. 2552-2554
3 p.
|
artikel
|
| 331 |
A note on the upper bound and girth pair of
(
k
;
g
)
-cages
|
Balbuena, C.
|
|
2013
|
31-40 |
Index 1 |
p. 853-857
5 p.
|
artikel
|
| 332 |
A note on total domination and 2-rainbow domination in graphs
|
Furuya, Michitaka
|
|
2015
|
31-40 |
Index 1 |
p. 229-230
2 p.
|
artikel
|
| 333 |
A note on
α
-total domination in cubic graphs
|
Chen, Xue-gang
|
|
2017
|
31-40 |
Index 1 |
p. 718-721
4 p.
|
artikel
|
| 334 |
A note on universal graphs for spanning trees
|
Győri, Ervin
|
|
|
31-40 |
Index 1 |
p. 146-147
|
artikel
|
| 335 |
A notion of vertex equitability for proper labellings
|
Bensmail, Julien
|
|
|
31-40 |
Index 1 |
p. 228-247
|
artikel
|
| 336 |
An out-of-kilter method for the algebraic circulation problem
|
Brucker, P.
|
|
1985
|
31-40 |
Index 1 |
p. 1-18
18 p.
|
artikel
|
| 337 |
An
s
-strong tournament with
s
⩾
3
has
s
+
1
vertices whose out-arcs are 4-pancyclic
|
Feng, Jinfeng
|
|
2006
|
31-40 |
Index 1 |
p. 2609-2612
4 p.
|
artikel
|
| 338 |
An
s
–
t
connection problem with adaptability
|
Adjiashvili, David
|
|
2011
|
31-40 |
Index 1 |
p. 695-705
11 p.
|
artikel
|
| 339 |
Antibandwidth and cyclic antibandwidth of Hamming graphs
|
Dobrev, Stefan
|
|
2013
|
31-40 |
Index 1 |
p. 1402-1408
7 p.
|
artikel
|
| 340 |
Anticoloring of the rook’s graph
|
Berend, Daniel
|
|
2015
|
31-40 |
Index 1 |
p. 1-15
15 p.
|
artikel
|
| 341 |
Antimagic labeling for subdivisions of graphs
|
Li, Wei-Tian
|
|
|
31-40 |
Index 1 |
p. 215-223
|
artikel
|
| 342 |
Antimagic labeling of biregular bipartite graphs
|
Yu, Xiaowei
|
|
|
31-40 |
Index 1 |
p. 47-59
|
artikel
|
| 343 |
Antimagic labeling of forests with sets of consecutive integers
|
Dhananjaya, Eranda
|
|
|
31-40 |
Index 1 |
p. 75-84
|
artikel
|
| 344 |
Antimagic orientation of lobsters
|
Gao, Yuping
|
|
|
31-40 |
Index 1 |
p. 21-26
|
artikel
|
| 345 |
Antimagic orientation of subdivided caterpillars
|
Ferraro, Jessica
|
|
|
31-40 |
Index 1 |
p. 45-52
|
artikel
|
| 346 |
Antimagic orientations of graphs with given independence number
|
Song, Zi-Xia
|
|
|
31-40 |
Index 1 |
p. 163-170
|
artikel
|
| 347 |
An upper bound for the competition numbers of graphs
|
Kamibeppu, Akira
|
|
2010
|
31-40 |
Index 1 |
p. 154-157
4 p.
|
artikel
|
| 348 |
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
|
Hattingh, Johannes H.
|
|
2009
|
31-40 |
Index 1 |
p. 2846-2858
13 p.
|
artikel
|
| 349 |
An upper bound of
Δ
(
E
)
<
3
∕
2
for skiving stock instances of the divisible case
|
Martinovic, J.
|
|
2017
|
31-40 |
Index 1 |
p. 161-167
7 p.
|
artikel
|
| 350 |
An upper bound on the sum of powers of the degrees of simple 1-planar graphs
|
Czap, Július
|
|
2014
|
31-40 |
Index 1 |
p. 146-151
6 p.
|
artikel
|
| 351 |
An upper bound on Wiener Indices of maximal planar graphs
|
Che, Zhongyuan
|
|
2019
|
31-40 |
Index 1 |
p. 76-86
|
artikel
|
| 352 |
A parametric characterization and an ε-approximation scheme for the minimization of a quasiconcave program
|
Katoh, Naoki
|
|
1987
|
31-40 |
Index 1 |
p. 39-66
28 p.
|
artikel
|
| 353 |
A perspective on certain polynomial-time solvable classes of satisfiability
|
Franco, John
|
|
2003
|
31-40 |
Index 1 |
p. 177-214
38 p.
|
artikel
|
| 354 |
APN permutations on
Z
n
and Costas arrays
|
Drakakis, Konstantinos
|
|
2009
|
31-40 |
Index 1 |
p. 3320-3326
7 p.
|
artikel
|
| 355 |
A polyhedral approach for a constrained quadratic 0–1 problem
|
Faye, Alain
|
|
2005
|
31-40 |
Index 1 |
p. 87-100
14 p.
|
artikel
|
| 356 |
A polyhedral study of triplet formulation for single row facility layout problem
|
Sanjeevi, Sujeevraja
|
|
2010
|
31-40 |
Index 1 |
p. 1861-1867
7 p.
|
artikel
|
| 357 |
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
|
Veselov, S.I.
|
|
|
31-40 |
Index 1 |
p. 11-19
|
artikel
|
| 358 |
A polynomial algorithm for weighted scattering number in interval graphs
|
Li, Fengwei
|
|
2019
|
31-40 |
Index 1 |
p. 118-124
|
artikel
|
| 359 |
A polynomial approximation scheme for the subset sum problem
|
Soma, Nei Yoshihiro
|
|
1995
|
31-40 |
Index 1 |
p. 243-253
11 p.
|
artikel
|
| 360 |
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
|
Bertossi, Alan A.
|
|
1985
|
31-40 |
Index 1 |
p. 195-201
7 p.
|
artikel
|
| 361 |
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
|
Ben-Ameur, Walid
|
|
2011
|
31-40 |
Index 1 |
p. 1689-1698
10 p.
|
artikel
|
| 362 |
Approximability of guarding weak visibility polygons
|
Bhattacharya, Pritam
|
|
2017
|
31-40 |
Index 1 |
p. 109-129
21 p.
|
artikel
|
| 363 |
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
|
Kosuch, Stefanie
|
|
2014
|
31-40 |
Index 1 |
p. 192-204
13 p.
|
artikel
|
| 364 |
Approximate envy-freeness in graphical cake cutting
|
Yuen, Sheung Man
|
|
|
31-40 |
Index 1 |
p. 112-131
|
artikel
|
| 365 |
Approximate strong equilibria in job scheduling games with two uniformly related machines
|
Epstein, Leah
|
|
2013
|
31-40 |
Index 1 |
p. 1843-1858
16 p.
|
artikel
|
| 366 |
Approximating 2-cliques in unit disk graphs
|
Pattillo, Jeffrey
|
|
2014
|
31-40 |
Index 1 |
p. 178-187
10 p.
|
artikel
|
| 367 |
Approximating maximum uniquely restricted matchings in bipartite graphs
|
Baste, Julien
|
|
2019
|
31-40 |
Index 1 |
p. 30-40
|
artikel
|
| 368 |
Approximating minimum-power edge-covers and
2
,
3
-connectivity
|
Kortsarz, Guy
|
|
2009
|
31-40 |
Index 1 |
p. 1840-1847
8 p.
|
artikel
|
| 369 |
Approximating minimum size {1,2}-connected networks
|
Krysta, Piotr
|
|
2003
|
31-40 |
Index 1 |
p. 267-288
22 p.
|
artikel
|
| 370 |
Approximating reversal distance for strings with bounded number of duplicates
|
Kolman, Petr
|
|
2007
|
31-40 |
Index 1 |
p. 327-336
10 p.
|
artikel
|
| 371 |
Approximating the fixed linear crossing number
|
Cimikowski, Robert
|
|
2007
|
31-40 |
Index 1 |
p. 2202-2210
9 p.
|
artikel
|
| 372 |
Approximating the maximum 2- and 3-edge-colorable subgraph problems
|
Kosowski, Adrian
|
|
2009
|
31-40 |
Index 1 |
p. 3593-3600
8 p.
|
artikel
|
| 373 |
Approximating weighted induced matchings
|
Lin, Min Chih
|
|
2018
|
31-40 |
Index 1 |
p. 304-310
|
artikel
|
| 374 |
Approximation algorithm for (connected) Italian dominating function
|
Li, Ke
|
|
|
31-40 |
Index 1 |
p. 169-179
|
artikel
|
| 375 |
Approximation algorithm for minimum connected 3-path vertex cover
|
Liu, Pengcheng
|
|
|
31-40 |
Index 1 |
p. 77-84
|
artikel
|
| 376 |
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
|
Elbassioni, Khaled
|
|
2017
|
31-40 |
Index 1 |
p. 56-70
15 p.
|
artikel
|
| 377 |
Approximation algorithms for group prize-collecting and location-routing problems
|
Glicksman, Hagai
|
|
2008
|
31-40 |
Index 1 |
p. 3238-3247
10 p.
|
artikel
|
| 378 |
Approximation algorithms for minimum tree partition
|
Guttmann-Beck, Nili
|
|
1998
|
31-40 |
Index 1 |
p. 117-137
21 p.
|
artikel
|
| 379 |
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
|
Bandelt, Hans-Jürgen
|
|
1994
|
31-40 |
Index 1 |
p. 25-50
26 p.
|
artikel
|
| 380 |
Approximation algorithms for multi-index transportation problems with decomposable costs
|
Queyranne, M.
|
|
1997
|
31-40 |
Index 1 |
p. 239-253
15 p.
|
artikel
|
| 381 |
Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
|
Ravi, R.
|
|
1998
|
31-40 |
Index 1 |
p. 355-366
12 p.
|
artikel
|
| 382 |
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
|
Baburin, A.E.
|
|
2009
|
31-40 |
Index 1 |
p. 1988-1992
5 p.
|
artikel
|
| 383 |
Approximation of the parallel machine scheduling problem with additional unit resources
|
Hebrard, Emmanuel
|
|
2016
|
31-40 |
Index 1 |
p. 126-135
10 p.
|
artikel
|
| 384 |
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
|
Chaplick, Steven
|
|
|
31-40 |
Index 1 |
p. 275-281
|
artikel
|
| 385 |
Approximation schemes for parallel machine scheduling with availability constraints
|
Fu, Bin
|
|
2011
|
31-40 |
Index 1 |
p. 1555-1565
11 p.
|
artikel
|
| 386 |
Approximations of Lovász extensions and their induced interaction index
|
Marichal, Jean-Luc
|
|
2008
|
31-40 |
Index 1 |
p. 11-24
14 p.
|
artikel
|
| 387 |
A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
|
De Bonis, Annalisa
|
|
1998
|
31-40 |
Index 1 |
p. 181-200
20 p.
|
artikel
|
| 388 |
A primal–dual approximation algorithm for Minsat
|
Arif, Umair
|
|
|
31-40 |
Index 1 |
p. 372-381
|
artikel
|
| 389 |
A primal–dual approximation algorithm for the survivable network design problem in hypergraphs
|
Zhao, Liang
|
|
2003
|
31-40 |
Index 1 |
p. 275-289
15 p.
|
artikel
|
| 390 |
A probabilistic algorithm for bounding the total restrained domination number of a
K
1
,
ℓ
-free graph
|
Joubert, Ernst J.
|
|
|
31-40 |
Index 1 |
p. 429-439
|
artikel
|
| 391 |
A probabilistic analysis of the multi-period single-sourcing problem
|
Romeijn, H.Edwin
|
|
2001
|
31-40 |
Index 1 |
p. 301-328
28 p.
|
artikel
|
| 392 |
A proof of a conjecture on the Randić index of graphs with given girth
|
Li, Xueliang
|
|
2009
|
31-40 |
Index 1 |
p. 3332-3335
4 p.
|
artikel
|
| 393 |
A proof of Jean de Rumeur's conjecture
|
Perennes, Stéphane
|
|
1997
|
31-40 |
Index 1 |
p. 295-299
5 p.
|
artikel
|
| 394 |
A proof of unimodality on the numbers of connected spanning subgraphs in an
n
-vertex graph with at least
⌈
(
3
−
2
2
)
n
2
+
n
−
7
−
2
2
2
2
⌉
edges
|
Cheng, Peng
|
|
2010
|
31-40 |
Index 1 |
p. 608-619
12 p.
|
artikel
|
| 395 |
A pseudo-Boolean consensus approach to nonlinear 0–1 optimization
|
Simeone, Bruno
|
|
2008
|
31-40 |
Index 1 |
p. 2449-2458
10 p.
|
artikel
|
| 396 |
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
|
Ravelo, S.V.
|
|
2017
|
31-40 |
Index 1 |
p. 158-175
18 p.
|
artikel
|
| 397 |
A quadratic simplex algorithm for primal optimization over zero-one polytopes
|
Mallach, Sven
|
|
|
31-40 |
Index 1 |
p. 285-296
|
artikel
|
| 398 |
A quick way to verify if a graph is 3-colorable
|
Cordero-Michel, Narda
|
|
|
31-40 |
Index 1 |
p. 176-185
|
artikel
|
| 399 |
A random polynomial time algorithm for well-rounding convex bodies
|
Faigle, U.
|
|
1995
|
31-40 |
Index 1 |
p. 117-144
28 p.
|
artikel
|
| 400 |
Arbitrarily edge-partitionable graphs
|
Bensmail, Julien
|
|
|
31-40 |
Index 1 |
p. 428-442
|
artikel
|
| 401 |
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
|
Chee, Yeow Meng
|
|
2012
|
31-40 |
Index 1 |
p. 100-107
8 p.
|
artikel
|
| 402 |
Arc-disjoint in- and out-branchings in semicomplete split digraphs
|
Ai, Jiangdong
|
|
|
31-40 |
Index 1 |
p. 259-268
|
artikel
|
| 403 |
Arc-disjoint paths and trees in 2-regular digraphs
|
Bang-Jensen, Jørgen
|
|
2013
|
31-40 |
Index 1 |
p. 2724-2730
7 p.
|
artikel
|
| 404 |
A refined result on cross-intersecting families
|
Wu, Biao
|
|
|
31-40 |
Index 1 |
p. 149-153
|
artikel
|
| 405 |
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
|
Sherali, Hanif D.
|
|
2009
|
31-40 |
Index 1 |
p. 1319-1333
15 p.
|
artikel
|
| 406 |
A relation between proximity and the third largest distance eigenvalue of a graph
|
Mojallal, Seyed Ahmad
|
|
|
31-40 |
Index 1 |
p. 50-58
|
artikel
|
| 407 |
A representation theorem of the suffixes of characteristic sequences
|
Wai-Fong, Chuan
|
|
1998
|
31-40 |
Index 1 |
p. 47-57
11 p.
|
artikel
|
| 408 |
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
|
Bensmail, Julien
|
|
2019
|
31-40 |
Index 1 |
p. 31-39
|
artikel
|
| 409 |
Around the Complete Intersection Theorem
|
Katona, Gyula O.H.
|
|
2017
|
31-40 |
Index 1 |
p. 618-621
4 p.
|
artikel
|
| 410 |
A scheme for the synchronization of variable length codes
|
Perkins, S.
|
|
2000
|
31-40 |
Index 1 |
p. 231-245
15 p.
|
artikel
|
| 411 |
A sharp lower bound of the Randić index of cacti with r pendants
|
Lin, Anhua
|
|
2008
|
31-40 |
Index 1 |
p. 1725-1735
11 p.
|
artikel
|
| 412 |
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
|
Choi, Ilkyoo
|
|
|
31-40 |
Index 1 |
p. 178-182
|
artikel
|
| 413 |
A shifting algorithm for constrained min-max partition on trees
|
Agasi, Eliezer
|
|
1993
|
31-40 |
Index 1 |
p. 1-28
28 p.
|
artikel
|
| 414 |
A short constructive proof of A.R. Rao’s characterization of potentially
K
r
+
1
-graphic sequences
|
Yin, Jian-Hua
|
|
2012
|
31-40 |
Index 1 |
p. 352-354
3 p.
|
artikel
|
| 415 |
A short note on supersaturation for oddtown and eventown
|
O’Neill, Jason
|
|
|
31-40 |
Index 1 |
p. 63-67
|
artikel
|
| 416 |
A short note on the sum of
k
largest distance eigenvalues of bipartite graphs
|
Lu, Junying
|
|
|
31-40 |
Index 1 |
p. 249-251
|
artikel
|
| 417 |
A simple algorithm to find the steps of double-loop networks
|
Chi-Feng Chan, Robin
|
|
2002
|
31-40 |
Index 1 |
p. 61-72
12 p.
|
artikel
|
| 418 |
A single axiom for Boolean algebras
|
Kwuida, Léonard
|
|
2018
|
31-40 |
Index 1 |
p. 85-90
|
artikel
|
| 419 |
A single-element extension of antimatroids
|
Nakamura, Masataka
|
|
2002
|
31-40 |
Index 1 |
p. 159-164
6 p.
|
artikel
|
| 420 |
A single machine scheduling with generalized and periodic due dates to minimize total deviation
|
Choi, Byung-Cheon
|
|
|
31-40 |
Index 1 |
p. 31-52
|
artikel
|
| 421 |
A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers
R
(
3
,
k
)
|
Zhu, Rujie
|
|
2016
|
31-40 |
Index 1 |
p. 216-221
6 p.
|
artikel
|
| 422 |
A solvable case of quadratic 0–1 programming
|
Barahona, Francisco
|
|
1986
|
31-40 |
Index 1 |
p. 23-26
4 p.
|
artikel
|
| 423 |
A solvable class of quadratic 0–1 programming
|
Chakradhar, Srimat T.
|
|
1992
|
31-40 |
Index 1 |
p. 233-251
19 p.
|
artikel
|
| 424 |
A special case for subset interconnection designs
|
Ding-Zhu, Du
|
|
1997
|
31-40 |
Index 1 |
p. 51-60
10 p.
|
artikel
|
| 425 |
A spectral condition for a graph to have strong parity factors
|
Zhou, Sizhong
|
|
|
31-40 |
Index 1 |
p. 188-195
|
artikel
|
| 426 |
A spectral condition for the existence of component factors in graphs
|
Zhou, Sizhong
|
|
|
31-40 |
Index 1 |
p. 141-150
|
artikel
|
| 427 |
A stabilized column generation scheme for the traveling salesman subtour problem
|
Westerlund, Andreas
|
|
2006
|
31-40 |
Index 1 |
p. 2212-2238
27 p.
|
artikel
|
| 428 |
A strongly polynomial algorithm for the inverse shortest arborescence problem
|
Zhiquan, Hu
|
|
1998
|
31-40 |
Index 1 |
p. 135-154
20 p.
|
artikel
|
| 429 |
A structural theorem for planar graphs with some applications
|
Sheng, Huiyu
|
|
2011
|
31-40 |
Index 1 |
p. 1183-1187
5 p.
|
artikel
|
| 430 |
A subspace covering problem in the
n
-cube
|
Aydinian, Harout
|
|
2017
|
31-40 |
Index 1 |
p. 513-517
5 p.
|
artikel
|
| 431 |
A sufficient condition for all short cycles
|
Brandt, Stephan
|
|
1997
|
31-40 |
Index 1 |
p. 63-66
4 p.
|
artikel
|
| 432 |
A sufficient condition for a planar graph to be
(
F
,
F
2
)
-partitionable
|
Liu, Runrun
|
|
|
31-40 |
Index 1 |
p. 61-68
|
artikel
|
| 433 |
A sufficient condition for
P
k
-path graphs being r-connected
|
Balbuena, C.
|
|
2007
|
31-40 |
Index 1 |
p. 1745-1751
7 p.
|
artikel
|
| 434 |
A sufficient condition for polynomial distribution-dependent learnability
|
Anthony, Martin
|
|
1997
|
31-40 |
Index 1 |
p. 1-12
12 p.
|
artikel
|
| 435 |
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem
|
Mosca, Raffaele
|
|
2017
|
31-40 |
Index 1 |
p. 281-289
9 p.
|
artikel
|
| 436 |
A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in
R
2
|
Guler, Hakan
|
|
|
31-40 |
Index 1 |
p. 37-46
|
artikel
|
| 437 |
A 2
2
3
superstring approximation algorithm
|
Armen, Chris
|
|
1998
|
31-40 |
Index 1 |
p. 29-57
29 p.
|
artikel
|
| 438 |
A survey of very large-scale neighborhood search techniques
|
Ahuja, Ravindra K.
|
|
2002
|
31-40 |
Index 1 |
p. 75-102
28 p.
|
artikel
|
| 439 |
Asymptotically optimal gossiping in radio networks
|
Ravishankar, Krishnamurthi
|
|
1995
|
31-40 |
Index 1 |
p. 61-82
22 p.
|
artikel
|
| 440 |
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
|
Maurer, Ueli M.
|
|
1992
|
31-40 |
Index 1 |
p. 421-436
16 p.
|
artikel
|
| 441 |
Asymptotic results on weakly increasing subsequences in random words
|
Işlak, Ümi̇t
|
|
2018
|
31-40 |
Index 1 |
p. 171-189
|
artikel
|
| 442 |
Asymptotic surviving rate of trees with multiple fire sources
|
Costa, Vitor
|
|
2015
|
31-40 |
Index 1 |
p. 14-19
6 p.
|
artikel
|
| 443 |
A ternary search problem on two disjoint sets
|
Li, Shengjia
|
|
2018
|
31-40 |
Index 1 |
p. 221-235
|
artikel
|
| 444 |
A tight analysis of the Submodular–Supermodular Procedure
|
Byrnes, Kevin M.
|
|
2015
|
31-40 |
Index 1 |
p. 275-282
8 p.
|
artikel
|
| 445 |
A tight axiomatization of the median procedure on median graphs
|
Mulder, Henry Martyn
|
|
2013
|
31-40 |
Index 1 |
p. 838-846
9 p.
|
artikel
|
| 446 |
A tight bound for 3-partitioning
|
Kellerer, Hans
|
|
|
31-40 |
Index 1 |
p. 249-259
|
artikel
|
| 447 |
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
|
Fujita, Satoshi
|
|
2010
|
31-40 |
Index 1 |
p. 913-920
8 p.
|
artikel
|
| 448 |
A tight upper bound for group testing in graphs
|
Damaschke, Peter
|
|
1994
|
31-40 |
Index 1 |
p. 101-109
9 p.
|
artikel
|
| 449 |
A tight upper bound for 2-rainbow domination in generalized Petersen graphs
|
Wang, Yue-Li
|
|
2013
|
31-40 |
Index 1 |
p. 2178-2188
11 p.
|
artikel
|
| 450 |
Atom-bond connectivity index of graphs
|
Das, Kinkar Ch.
|
|
2010
|
31-40 |
Index 1 |
p. 1181-1188
8 p.
|
artikel
|
| 451 |
Atom divisor graph of a poset
|
Khairnar, Anil
|
|
|
31-40 |
Index 1 |
p. 167-177
|
artikel
|
| 452 |
A type-B Tamari poset
|
Sandman, Nirit
|
|
2004
|
31-40 |
Index 1 |
p. 110-122
13 p.
|
artikel
|
| 453 |
A unified approach to polynomially solvable cases of integer “non-separable” quadratic optimization
|
Baldick, Ross
|
|
1995
|
31-40 |
Index 1 |
p. 195-212
18 p.
|
artikel
|
| 454 |
A unified construction of weightwise perfectly balanced Boolean functions
|
Zhao, Qinglan
|
|
|
31-40 |
Index 1 |
p. 190-201
|
artikel
|
| 455 |
Author index
|
|
|
1988
|
31-40 |
Index 1 |
p. 269-
1 p.
|
artikel
|
| 456 |
Author index
|
|
|
2003
|
31-40 |
Index 1 |
p. I-II
nvt p.
|
artikel
|
| 457 |
Author index
|
|
|
1994
|
31-40 |
Index 1 |
p. 305-306
2 p.
|
artikel
|
| 458 |
Author index
|
|
|
1998
|
31-40 |
Index 1 |
p. 397-398
2 p.
|
artikel
|
| 459 |
Author index
|
|
|
1997
|
31-40 |
Index 1 |
p. 255-
1 p.
|
artikel
|
| 460 |
Author index
|
|
|
1999
|
31-40 |
Index 1 |
p. 257-
1 p.
|
artikel
|
| 461 |
Author index
|
|
|
1984
|
31-40 |
Index 1 |
p. 307-308
2 p.
|
artikel
|
| 462 |
Author index (last vol./issue)
|
|
|
2003
|
31-40 |
Index 1 |
p. 691-693
3 p.
|
artikel
|
| 463 |
Author index to volume
|
|
|
2003
|
31-40 |
Index 1 |
p. 691-693
3 p.
|
artikel
|
| 464 |
Author Index to Volume 113 (2001)
|
|
|
2001
|
31-40 |
Index 1 |
p. 343-344
2 p.
|
artikel
|
| 465 |
Automatic complexity of Fibonacci and Tribonacci words
|
Kjos-Hanssen, Bjørn
|
|
|
31-40 |
Index 1 |
p. 446-454
|
artikel
|
| 466 |
Autotopism stabilized colouring games on rook’s graphs
|
Falcón, Raúl M.
|
|
2019
|
31-40 |
Index 1 |
p. 200-212
|
artikel
|
| 467 |
AVD-total-chromatic number of some families of graphs with
Δ
(
G
)
=
3
|
Luiz, Atílio G.
|
|
2017
|
31-40 |
Index 1 |
p. 628-638
11 p.
|
artikel
|
| 468 |
A vector exchange property of submodular systems
|
Faigle, Ulrich
|
|
1984
|
31-40 |
Index 1 |
p. 209-211
3 p.
|
artikel
|
| 469 |
Average case complexity for finite Boolean functions
|
Chashkin, A.V.
|
|
2001
|
31-40 |
Index 1 |
p. 43-59
17 p.
|
artikel
|
| 470 |
Average distances and distance domination numbers
|
Tian, Fang
|
|
2009
|
31-40 |
Index 1 |
p. 1113-1127
15 p.
|
artikel
|
| 471 |
Average stretch analysis of compact routing schemes
|
Eilam, Tamar
|
|
2007
|
31-40 |
Index 1 |
p. 598-610
13 p.
|
artikel
|
| 472 |
A Vizing-type result for semi-total domination
|
Asplund, John
|
|
2019
|
31-40 |
Index 1 |
p. 8-12
|
artikel
|
| 473 |
Avoidable vertices and edges in graphs: Existence, characterization, and applications
|
Beisegel, Jesse
|
|
|
31-40 |
Index 1 |
p. 285-300
|
artikel
|
| 474 |
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
|
Das, Sandip
|
|
|
31-40 |
Index 1 |
p. 44-61
|
artikel
|
| 475 |
b9000A
1
4
approximate algorithm for P2/tree/Cmax
|
Gallo, Giorgio
|
|
1997
|
31-40 |
Index 1 |
p. 85-98
14 p.
|
artikel
|
| 476 |
Backbone coloring of graphs with galaxy backbones
|
Araújo, C.S.
|
|
|
31-40 |
Index 1 |
p. 2-13
|
artikel
|
| 477 |
Backbone colorings of graphs with bounded degree
|
Miškuf, Jozef
|
|
2010
|
31-40 |
Index 1 |
p. 534-542
9 p.
|
artikel
|
| 478 |
Badly-covered graphs
|
Cappelle, Márcia R.
|
|
2015
|
31-40 |
Index 1 |
p. 99-103
5 p.
|
artikel
|
| 479 |
Balanced and 1-balanced graph constructions
|
Hobbs, Arthur M.
|
|
2010
|
31-40 |
Index 1 |
p. 1511-1523
13 p.
|
artikel
|
| 480 |
Balanced decomposition of a vertex-colored graph
|
Fujita, Shinya
|
|
2008
|
31-40 |
Index 1 |
p. 3339-3344
6 p.
|
artikel
|
| 481 |
Balanced
k
-decompositions of graphs
|
Hsu, Hsiang-Chun
|
|
2012
|
31-40 |
Index 1 |
p. 1639-1642
4 p.
|
artikel
|
| 482 |
Balancing signed graphs
|
Akiyama, J.
|
|
1981
|
31-40 |
Index 1 |
p. 227-233
7 p.
|
artikel
|
| 483 |
Bandwidth and distortion revisited
|
Cygan, Marek
|
|
2012
|
31-40 |
Index 1 |
p. 494-504
11 p.
|
artikel
|
| 484 |
Bandwidth of the product of paths of the same length
|
Billera, Louis J.
|
|
2013
|
31-40 |
Index 1 |
p. 3080-3086
7 p.
|
artikel
|
| 485 |
Batch scheduling in a two-machine flow shop with limited buffer
|
Agnetis, A.
|
|
1997
|
31-40 |
Index 1 |
p. 243-260
18 p.
|
artikel
|
| 486 |
b
-chromatic numbers of powers of paths and cycles
|
Lin, Wu-Hsiung
|
|
2013
|
31-40 |
Index 1 |
p. 2532-2536
5 p.
|
artikel
|
| 487 |
b
-coloring of Kneser graphs
|
Balakrishnan, R.
|
|
2012
|
31-40 |
Index 1 |
p. 9-14
6 p.
|
artikel
|
| 488 |
b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture
|
Lin, Wu-Hsiung
|
|
2013
|
31-40 |
Index 1 |
p. 1060-1066
7 p.
|
artikel
|
| 489 |
b
-coloring of tight graphs
|
Havet, Frédéric
|
|
2012
|
31-40 |
Index 1 |
p. 2709-2715
7 p.
|
artikel
|
| 490 |
Bell polynomials and
k
-generalized Dyck paths
|
Mansour, Toufik
|
|
2008
|
31-40 |
Index 1 |
p. 2279-2292
14 p.
|
artikel
|
| 491 |
Bernoulli matrix and its algebraic properties
|
Zhang, Zhizheng
|
|
2006
|
31-40 |
Index 1 |
p. 1622-1632
11 p.
|
artikel
|
| 492 |
Best monotone degree conditions for binding number and cycle structure
|
Bauer, D.
|
|
2015
|
31-40 |
Index 1 |
p. 8-17
10 p.
|
artikel
|
| 493 |
Best reduction of the quadratic semi-assignment problem
|
Billionnet, Alain
|
|
2001
|
31-40 |
Index 1 |
p. 197-213
17 p.
|
artikel
|
| 494 |
Best semi-online algorithms for unbounded parallel batch scheduling
|
Yuan, Jinjiang
|
|
2011
|
31-40 |
Index 1 |
p. 838-847
10 p.
|
artikel
|
| 495 |
Better approximations of non-Hamiltonian graphs
|
Iwama, Kazuo
|
|
1998
|
31-40 |
Index 1 |
p. 239-261
23 p.
|
artikel
|
| 496 |
Better bounds for perpetual gossiping
|
Scott, A.D.
|
|
1997
|
31-40 |
Index 1 |
p. 189-197
9 p.
|
artikel
|
| 497 |
Bichain graphs: Geometric model and universal graphs
|
Brignall, Robert
|
|
2016
|
31-40 |
Index 1 |
p. 16-29
14 p.
|
artikel
|
| 498 |
Bichromatic P
4-composition schemes for perfect orderability
|
Hayward, R.B.
|
|
2004
|
31-40 |
Index 1 |
p. 161-183
23 p.
|
artikel
|
| 499 |
Biclique-colouring verification complexity and biclique-colouring power graphs
|
Macêdo Filho, H.B.
|
|
2015
|
31-40 |
Index 1 |
p. 65-76
12 p.
|
artikel
|
| 500 |
Biclique graphs of interval bigraphs
|
Cruz, E.P.
|
|
|
31-40 |
Index 1 |
p. 134-143
|
artikel
|
| 501 |
Biconvex graphs: ordering and algorithms
|
Abbas, Nesrine
|
|
2000
|
31-40 |
Index 1 |
p. 1-19
19 p.
|
artikel
|
| 502 |
Bicyclic graphs with maximal revised Szeged index
|
Li, Xueliang
|
|
2013
|
31-40 |
Index 1 |
p. 2527-2531
5 p.
|
artikel
|
| 503 |
Bicyclic signed graphs with at most one odd cycle and maximal energy
|
Wang, Dijian
|
|
2019
|
31-40 |
Index 1 |
p. 244-255
|
artikel
|
| 504 |
Bigraphic pairs with an
A
-connected realization
|
Guan, Jing-Xin
|
|
2018
|
31-40 |
Index 1 |
p. 75-81
|
artikel
|
| 505 |
Bijective counting of humps and peaks in
(
k
,
a
)
-paths
|
Yan, Sherry H.F.
|
|
2015
|
31-40 |
Index 1 |
p. 208-212
5 p.
|
artikel
|
| 506 |
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
|
Goubko, Mikhail
|
|
|
31-40 |
Index 1 |
p. 1-9
|
artikel
|
| 507 |
Binary templates for comma-free DNA codes
|
King, Oliver D.
|
|
2007
|
31-40 |
Index 1 |
p. 831-839
9 p.
|
artikel
|
| 508 |
Bin covering with cardinality constraints
|
Epstein, Leah
|
|
2013
|
31-40 |
Index 1 |
p. 1975-1987
13 p.
|
artikel
|
| 509 |
Binding number, odd
[
1
,
b
]
-factors and the distance spectral radius
|
Hu, Yanling
|
|
|
31-40 |
Index 1 |
p. 406-413
|
artikel
|
| 510 |
Binding numbers and restricted fractional
(
g
,
f
)
-factors in graphs
|
Zhou, Sizhong
|
|
|
31-40 |
Index 1 |
p. 350-356
|
artikel
|
| 511 |
Bin-packing and matchings in threshold graphs
|
Tinhofer, G.
|
|
1995
|
31-40 |
Index 1 |
p. 279-289
11 p.
|
artikel
|
| 512 |
Bipartite finite Toeplitz graphs
|
Nicoloso, Sara
|
|
2014
|
31-40 |
Index 1 |
p. 233-244
12 p.
|
artikel
|
| 513 |
Bipartite graphs and digraphs with maximum connectivity
|
Fàbrega, J.
|
|
1996
|
31-40 |
Index 1 |
p. 271-279
9 p.
|
artikel
|
| 514 |
Bipartite permutation graphs with application to the minimum buffer size problem
|
Lai, Ten-Hwang
|
|
1997
|
31-40 |
Index 1 |
p. 33-55
23 p.
|
artikel
|
| 515 |
Bipartite Ramsey numbers of paths for random graphs
|
Liu, Meng
|
|
2019
|
31-40 |
Index 1 |
p. 171-174
|
artikel
|
| 516 |
Bipartition constrained edge-splitting in directed graphs
|
Gabow, Harold N.
|
|
2001
|
31-40 |
Index 1 |
p. 49-62
14 p.
|
artikel
|
| 517 |
Bisecting a 4-connected graph with three resource sets
|
Ishii, Toshimasa
|
|
2007
|
31-40 |
Index 1 |
p. 1441-1450
10 p.
|
artikel
|
| 518 |
Bisecting and
D
-secting families for set systems
|
Balachandran, Niranjan
|
|
|
31-40 |
Index 1 |
p. 2-13
|
artikel
|
| 519 |
2-bisections in claw-free cubic multigraphs
|
Cui, Qing
|
|
2019
|
31-40 |
Index 1 |
p. 325-330
|
artikel
|
| 520 |
Bisections of graphs without
K
2
,
l
|
Jin, Jing
|
|
2019
|
31-40 |
Index 1 |
p. 112-118
|
artikel
|
| 521 |
Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3)
|
De Bruyn, Bart
|
|
2019
|
31-40 |
Index 1 |
p. 121-129
|
artikel
|
| 522 |
Block linear majorants in quadratic 0–1 optimization
|
Boros, Endre
|
|
2004
|
31-40 |
Index 1 |
p. 52-71
20 p.
|
artikel
|
| 523 |
Bondage number of the strong product of two trees
|
Zhao, Weisheng
|
|
2017
|
31-40 |
Index 1 |
p. 133-145
13 p.
|
artikel
|
| 524 |
Bond graphs III: Bond graphs and electrical networks
|
Lamb, J.D.
|
|
1997
|
31-40 |
Index 1 |
p. 211-250
40 p.
|
artikel
|
| 525 |
Book announcement
|
|
|
1980
|
31-40 |
Index 1 |
p. 85-87
3 p.
|
artikel
|
| 526 |
Book announcements
|
|
|
1994
|
31-40 |
Index 1 |
p. 303-305
3 p.
|
artikel
|
| 527 |
Book drawings of complete bipartite graphs
|
de Klerk, Etienne
|
|
2014
|
31-40 |
Index 1 |
p. 80-93
14 p.
|
artikel
|
| 528 |
Boolean functions optimizing most of the cryptographic criteria
|
Tu, Ziran
|
|
2012
|
31-40 |
Index 1 |
p. 427-435
9 p.
|
artikel
|
| 529 |
Borodin–Kostochka conjecture holds for
K
1
,
3
¯
-free graphs
|
Lan, Kaiyang
|
|
|
31-40 |
Index 1 |
p. 263-268
|
artikel
|
| 530 |
Bounded-degree light approximate shortest-path trees in doubling metrics
|
Gudmundsson, Joachim
|
|
|
31-40 |
Index 1 |
p. 199-204
|
artikel
|
| 531 |
Bounded discrete representations of interval orders
|
Isaak, Garth
|
|
1993
|
31-40 |
Index 1 |
p. 157-183
27 p.
|
artikel
|
| 532 |
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
|
Lu, You
|
|
2009
|
31-40 |
Index 1 |
p. 3249-3257
9 p.
|
artikel
|
| 533 |
χ
-boundedness and related problems on graphs without long induced paths: A survey
|
Char, Arnab
|
|
|
31-40 |
Index 1 |
p. 99-119
|
artikel
|
| 534 |
Bounding
ℓ
-edge-connectivity in edge-connectivity
|
Lin, Xiaoxia
|
|
|
31-40 |
Index 1 |
p. 350-356
|
artikel
|
| 535 |
Bounding the number of k-faces in arrangements of hyperplanes
|
Fukuda, Komei
|
|
1991
|
31-40 |
Index 1 |
p. 151-165
15 p.
|
artikel
|
| 536 |
Bounding the size of the subgraph induced by
m
vertices and extra edge-connectivity of hypercubes
|
Li, Hao
|
|
2013
|
31-40 |
Index 1 |
p. 2753-2757
5 p.
|
artikel
|
| 537 |
Bounds for boxicity of circular clique graphs and zero-divisor graphs
|
Kavaskar, T.
|
|
|
31-40 |
Index 1 |
p. 260-269
|
artikel
|
| 538 |
Bounds for eccentricity-based parameters of graphs
|
Tang, Yunfang
|
|
|
31-40 |
Index 1 |
p. 109-123
|
artikel
|
| 539 |
Bounds for the chromatic index of signed multigraphs
|
Steffen, Eckhard
|
|
|
31-40 |
Index 1 |
p. 185-189
|
artikel
|
| 540 |
Bounds for the chromatic number of some
p
K
2
-free graphs
|
Prashant, Athmakoori
|
|
|
31-40 |
Index 1 |
p. 99-108
|
artikel
|
| 541 |
Bounds for the energy of weighted graphs
|
Ganie, Hilal A.
|
|
2019
|
31-40 |
Index 1 |
p. 91-101
|
artikel
|
| 542 |
Bounds for the probability of union of events following monotonic distribution
|
Kumaran, V.
|
|
2017
|
31-40 |
Index 1 |
p. 98-119
22 p.
|
artikel
|
| 543 |
Bounds on certain multiplications of affine combinations
|
Boyar, Joan
|
|
1994
|
31-40 |
Index 1 |
p. 155-167
13 p.
|
artikel
|
| 544 |
Bounds on Graceful
k
-colorings of graphs
|
Pantoja, Paola T.
|
|
|
31-40 |
Index 1 |
p. 218-231
|
artikel
|
| 545 |
Bounds on independent isolation in graphs
|
Boyer, Geoffrey
|
|
|
31-40 |
Index 1 |
p. 143-149
|
artikel
|
| 546 |
Bounds on neighborhood total domination in graphs
|
Henning, Michael A.
|
|
2013
|
31-40 |
Index 1 |
p. 2460-2466
7 p.
|
artikel
|
| 547 |
Bounds on the
A
α
-spectral radius of uniform hypergraphs with some vertices deleted
|
Zhang, Peng-Li
|
|
|
31-40 |
Index 1 |
p. 1-16
|
artikel
|
| 548 |
Bounds on the average and minimum attendance in preference-based activity scheduling
|
Aronshtam, Lior
|
|
|
31-40 |
Index 1 |
p. 114-119
|
artikel
|
| 549 |
Bounds on the burning number
|
Bessy, Stéphane
|
|
2018
|
31-40 |
Index 1 |
p. 16-22
|
artikel
|
| 550 |
Bounds on the defect of an octahedron in a rational lattice
|
Fadin, Mikhail
|
|
|
31-40 |
Index 1 |
p. 102-105
|
artikel
|
| 551 |
Bounds on the differentiating-total domination number of a tree
|
Ning, Wenjie
|
|
2016
|
31-40 |
Index 1 |
p. 153-160
8 p.
|
artikel
|
| 552 |
Bounds on the index of the signless Laplacian of a graph
|
Oliveira, Carla Silva
|
|
2010
|
31-40 |
Index 1 |
p. 355-360
6 p.
|
artikel
|
| 553 |
Bounds on the locating-total domination number of a tree
|
Chen, Xue-gang
|
|
2011
|
31-40 |
Index 1 |
p. 769-773
5 p.
|
artikel
|
| 554 |
Bounds on the maximum modulus of dissociation roots
|
Chen, Guo
|
|
|
31-40 |
Index 1 |
p. 193-207
|
artikel
|
| 555 |
Bounds on the modified second Zagreb index
|
Ali, Akbar
|
|
|
31-40 |
Index 1 |
p. 385-390
|
artikel
|
| 556 |
Bounds on the resistance distance and Kirchhoff index of graphs
|
Bu, Tianyi
|
|
|
31-40 |
Index 1 |
p. 234-241
|
artikel
|
| 557 |
Bounds relating the weakly connected domination number to the total domination number and the matching number
|
Hattingh, Johannes H.
|
|
2009
|
31-40 |
Index 1 |
p. 3086-3093
8 p.
|
artikel
|
| 558 |
Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled
|
Miralles, Cristóbal
|
|
2008
|
31-40 |
Index 1 |
p. 352-367
16 p.
|
artikel
|
| 559 |
Branchwidth is
(
1
,
g
)
-self-dual
|
Kontogeorgiou, Georgios
|
|
|
31-40 |
Index 1 |
p. 1-9
|
artikel
|
| 560 |
Broadcast and gossip in line-communication mode
|
Laforest, C.
|
|
1997
|
31-40 |
Index 1 |
p. 161-176
16 p.
|
artikel
|
| 561 |
Broadcasting and spanning trees in de Bruijn and Kautz networks
|
Heydemann, M.C.
|
|
1992
|
31-40 |
Index 1 |
p. 297-317
21 p.
|
artikel
|
| 562 |
Broadcasting in butterfly and deBruijn networks
|
Klasing, Ralf
|
|
1994
|
31-40 |
Index 1 |
p. 183-197
15 p.
|
artikel
|
| 563 |
Broadcasting in one dimension
|
Hell, Pavol
|
|
1988
|
31-40 |
Index 1 |
p. 101-111
11 p.
|
artikel
|
| 564 |
Broadcasting in random graphs
|
Gerbessiotis, Alexandros V.
|
|
1994
|
31-40 |
Index 1 |
p. 149-170
22 p.
|
artikel
|
| 565 |
Broadcasting multiple messages in simultaneous send/receive systems
|
Bar-Noy, Amotz
|
|
1994
|
31-40 |
Index 1 |
p. 95-105
11 p.
|
artikel
|
| 566 |
Broadcasting on [0, L]
|
Ravishankar, Krishnamurthi
|
|
1994
|
31-40 |
Index 1 |
p. 299-319
21 p.
|
artikel
|
| 567 |
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
|
Yang, Jinn-Shyong
|
|
2011
|
31-40 |
Index 1 |
p. 1254-1263
10 p.
|
artikel
|
| 568 |
Broadcasting with linearly bounded transmission faults
|
Ga̧sieniec, L.
|
|
1998
|
31-40 |
Index 1 |
p. 121-133
13 p.
|
artikel
|
| 569 |
Broadcasts in graphs
|
Dunbar, Jean E.
|
|
2006
|
31-40 |
Index 1 |
p. 59-75
17 p.
|
artikel
|
| 570 |
Brooks-type theorem for
r
-hued coloring of graphs
|
Jendrol’, Stanislav
|
|
|
31-40 |
Index 1 |
p. 129-134
|
artikel
|
| 571 |
Brush your trees!
|
Penso, L.D.
|
|
2015
|
31-40 |
Index 1 |
p. 167-170
4 p.
|
artikel
|
| 572 |
Bumblebee visitation problem
|
Das, Sandip
|
|
|
31-40 |
Index 1 |
p. 27-41
|
artikel
|
| 573 |
Bundling all shortest paths
|
Dębski, Michał
|
|
|
31-40 |
Index 1 |
p. 82-91
|
artikel
|
| 574 |
Burning and
w
-burning of geometric graphs
|
Gorain, Barun
|
|
|
31-40 |
Index 1 |
p. 83-98
|
artikel
|
| 575 |
Calculating the extremal number
ex
(
v
;
{
C
3
,
C
4
,
…
,
C
n
}
)
|
Tang, Jianmin
|
|
2009
|
31-40 |
Index 1 |
p. 2198-2206
9 p.
|
artikel
|
| 576 |
Capacitated discrete unit disk cover
|
Mishra, Pawan K.
|
|
|
31-40 |
Index 1 |
p. 242-251
|
artikel
|
| 577 |
Capacity restricted optimal pebbling in graphs
|
Shiue, Chin-Lin
|
|
2019
|
31-40 |
Index 1 |
p. 284-288
|
artikel
|
| 578 |
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
|
Andreae, Thomas
|
|
1997
|
31-40 |
Index 1 |
p. 3-34
32 p.
|
artikel
|
| 579 |
Cayley graphs of diameter two and any degree with order half of the Moore bound
|
Abas, Marcel
|
|
2014
|
31-40 |
Index 1 |
p. 1-7
7 p.
|
artikel
|
| 580 |
Cellular telephone networks and random maps in hypergraphs
|
Halpert, Ariel
|
|
2000
|
31-40 |
Index 1 |
p. 111-126
16 p.
|
artikel
|
| 581 |
Center location problems on tree graphs with subtree-shaped customers
|
Puerto, J.
|
|
2008
|
31-40 |
Index 1 |
p. 2890-2910
|
artikel
|
| 582 |
Certain Boolean equations
|
Banković, D.
|
|
1992
|
31-40 |
Index 1 |
p. 21-27
7 p.
|
artikel
|
| 583 |
Certifying coloring algorithms for graphs without long induced paths
|
Kamiński, Marcin
|
|
2019
|
31-40 |
Index 1 |
p. 258-267
|
artikel
|
| 584 |
Chain homotopies for object topological representations
|
González-Díaz, R.
|
|
2009
|
31-40 |
Index 1 |
p. 490-499
10 p.
|
artikel
|
| 585 |
Chain method for panchromatic colorings of hypergraphs
|
Akhmejanova, Margarita
|
|
|
31-40 |
Index 1 |
p. 72-81
|
artikel
|
| 586 |
Channel assignment problem and relaxed 2-distant coloring of graphs
|
Lin, Wensong
|
|
|
31-40 |
Index 1 |
p. 231-244
|
artikel
|
| 587 |
Characterising
(
k
,
ℓ
)
-leaf powers
|
Brandstädt, Andreas
|
|
2010
|
31-40 |
Index 1 |
p. 110-122
13 p.
|
artikel
|
| 588 |
Characterization and recognition of generalized clique-Helly graphs
|
Dourado, Mitre C.
|
|
2007
|
31-40 |
Index 1 |
p. 2435-2443
9 p.
|
artikel
|
| 589 |
Characterization of classical graph classes by weighted clique graphs
|
Bonomo, Flavia
|
|
2014
|
31-40 |
Index 1 |
p. 83-95
13 p.
|
artikel
|
| 590 |
Characterization of color patterns by dynamic
H
-paths
|
Benítez-Bobadilla, Germán
|
|
2019
|
31-40 |
Index 1 |
p. 41-51
|
artikel
|
| 591 |
Characterization of common-edge sigraph
|
Sinha, Deepa
|
|
2013
|
31-40 |
Index 1 |
p. 1275-1285
11 p.
|
artikel
|
| 592 |
Characterization of double domination subdivision number of trees
|
Atapour, M.
|
|
2007
|
31-40 |
Index 1 |
p. 1700-1707
8 p.
|
artikel
|
| 593 |
Characterization of facets of the hop constrained chain polytope via dynamic programming
|
Grötschel, Martin
|
|
2014
|
31-40 |
Index 1 |
p. 229-246
18 p.
|
artikel
|
| 594 |
Characterization of forbidden subgraphs for the existence of even factors in a graph
|
Xiong, Liming
|
|
2017
|
31-40 |
Index 1 |
p. 135-139
5 p.
|
artikel
|
| 595 |
Characterization of graphs with the limited normalized algebraic connectivity
|
Sun, Shaowei
|
|
|
31-40 |
Index 1 |
p. 61-70
|
artikel
|
| 596 |
Characterization of minimally
t
-tough,
2
K
2
-free graphs for
1
<
t
≤
2
|
Ma, Hui
|
|
|
31-40 |
Index 1 |
p. 43-50
|
artikel
|
| 597 |
Characterization of random walks on space of unordered trees using efficient metric simulation
|
Ben Naoum, Farah
|
|
|
31-40 |
Index 1 |
p. 290-307
|
artikel
|
| 598 |
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
|
Taranenko, Andrej
|
|
2008
|
31-40 |
Index 1 |
p. 1711-1724
14 p.
|
artikel
|
| 599 |
Characterization of the inverse of a particular circulant matrix by means of a continued fraction
|
Marrazzini, C.
|
|
1980
|
31-40 |
Index 1 |
p. 163-165
3 p.
|
artikel
|
| 600 |
Characterizations and algorithmic applications of chordal graph embeddings
|
Parra, Andreas
|
|
1997
|
31-40 |
Index 1 |
p. 171-188
18 p.
|
artikel
|
| 601 |
Characterizations of cographs as intersection graphs of paths on a grid
|
Cohen, Elad
|
|
2014
|
31-40 |
Index 1 |
p. 46-57
12 p.
|
artikel
|
| 602 |
Characterizations of (
4
K
1
,
C
4
,
C
5
)-free graphs
|
Fraser, Dallas J.
|
|
2017
|
31-40 |
Index 1 |
p. 166-174
9 p.
|
artikel
|
| 603 |
Characterizations of maximum fractional
(
g
,
f
)
-factors of graphs
|
Liu, Guizhen
|
|
2008
|
31-40 |
Index 1 |
p. 2293-2299
7 p.
|
artikel
|
| 604 |
Characterizations, probe and sandwich problems on
(
k
,
ℓ
)
-cographs
|
Couto, Fernanda
|
|
|
31-40 |
Index 1 |
p. 118-133
|
artikel
|
| 605 |
Characterize all
C
5
-free diameter-2-critical graphs with at least
⌊
(
n
−
1
)
2
4
⌋
+
1
edges
|
Lin, Qiao
|
|
|
31-40 |
Index 1 |
p. 332-337
|
artikel
|
| 606 |
Characterizing and computing minimal cograph completions
|
Lokshtanov, Daniel
|
|
2010
|
31-40 |
Index 1 |
p. 755-764
10 p.
|
artikel
|
| 607 |
Characterizing and computing the structure of clique intersections in strongly chordal graphs
|
Nevries, Ragnar
|
|
2015
|
31-40 |
Index 1 |
p. 221-234
14 p.
|
artikel
|
| 608 |
Characterizing graphs of small carving-width
|
Belmonte, Rémy
|
|
2013
|
31-40 |
Index 1 |
p. 1888-1893
6 p.
|
artikel
|
| 609 |
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
|
Gurvich, Vladimir
|
|
2012
|
31-40 |
Index 1 |
p. 1742-1756
15 p.
|
artikel
|
| 610 |
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
|
Miao, Shujing
|
|
|
31-40 |
Index 1 |
p. 17-32
|
artikel
|
| 611 |
Chasing robbers on random geometric graphs—An alternative approach
|
Alon, Noga
|
|
2014
|
31-40 |
Index 1 |
p. 149-152
4 p.
|
artikel
|
| 612 |
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles
|
Jing, Yubo
|
|
2015
|
31-40 |
Index 1 |
p. 243-247
5 p.
|
artikel
|
| 613 |
Chvátal–Gomory cuts for the Steiner tree problem
|
Gaul, Daniela
|
|
|
31-40 |
Index 1 |
p. 188-200
|
artikel
|
| 614 |
Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds
|
Gutekunst, Samuel C.
|
|
|
31-40 |
Index 1 |
p. 208-224
|
artikel
|
| 615 |
Circular backbone colorings: On matching and tree backbones of planar graphs
|
Araujo, J.
|
|
2018
|
31-40 |
Index 1 |
p. 69-82
|
artikel
|
| 616 |
(Circular) backbone colouring: Forest backbones in planar graphs
|
Havet, Frédéric
|
|
2014
|
31-40 |
Index 1 |
p. 119-134
16 p.
|
artikel
|
| 617 |
Circular permutation graph family with applications
|
Lou, R.D.
|
|
1992
|
31-40 |
Index 1 |
p. 433-457
25 p.
|
artikel
|
| 618 |
Classes of uniformly most reliable graphs for all-terminal reliability
|
Archer, Kassie
|
|
2019
|
31-40 |
Index 1 |
p. 12-29
|
artikel
|
| 619 |
Classification and generation of nanocones
|
Brinkmann, Gunnar
|
|
2011
|
31-40 |
Index 1 |
p. 1528-1539
12 p.
|
artikel
|
| 620 |
Classification by polynomial surfaces
|
Anthony, Martin
|
|
1995
|
31-40 |
Index 1 |
p. 91-103
13 p.
|
artikel
|
| 621 |
Classification of normalized cluster methods in an order theoretic model
|
Baulieu, Forrest B.
|
|
1991
|
31-40 |
Index 1 |
p. 1-29
29 p.
|
artikel
|
| 622 |
Classification of P
k2
|
Miyakawa, Masahiro
|
|
1989
|
31-40 |
Index 1 |
p. 179-192
14 p.
|
artikel
|
| 623 |
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
|
Chudnovsky, Maria
|
|
2011
|
31-40 |
Index 1 |
p. 1971-1995
25 p.
|
artikel
|
| 624 |
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
|
Chudnovsky, Maria
|
|
2011
|
31-40 |
Index 1 |
p. 1996-2029
34 p.
|
artikel
|
| 625 |
clever or smart: Strategies for the online target date assignment problem
|
Gassner, Elisabeth
|
|
2010
|
31-40 |
Index 1 |
p. 71-79
9 p.
|
artikel
|
| 626 |
Clin d'oeil on L
1-embeddable planar graphs
|
Chepoi, Victor
|
|
1997
|
31-40 |
Index 1 |
p. 3-19
17 p.
|
artikel
|
| 627 |
2
-clique-bond of stable set polyhedra
|
Galluccio, Anna
|
|
2013
|
31-40 |
Index 1 |
p. 1988-2000
13 p.
|
artikel
|
| 628 |
Clique Cover on L-EPG representations of graphs
|
Silva, Kedson Alves
|
|
|
31-40 |
Index 1 |
p. 145-156
|
artikel
|
| 629 |
Clique cover products and unimodality of independence polynomials
|
Zhu, Bao-Xuan
|
|
2016
|
31-40 |
Index 1 |
p. 172-180
9 p.
|
artikel
|
| 630 |
Clique-critical graphs: Maximum size and recognition
|
Alcón, Liliana
|
|
2006
|
31-40 |
Index 1 |
p. 1799-1802
4 p.
|
artikel
|
| 631 |
Clique family inequalities for the stable set polytope of quasi-line graphs
|
Oriolo, G.
|
|
2003
|
31-40 |
Index 1 |
p. 185-201
17 p.
|
artikel
|
| 632 |
Closed-form formulas for the Zhang–Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations
|
Chou, Chien-Pin
|
|
2016
|
31-40 |
Index 1 |
p. 101-108
8 p.
|
artikel
|
| 633 |
Close-to-optimal and near-optimal broadcasting in random graphs
|
Gerbessiotis, Alexandros V.
|
|
1995
|
31-40 |
Index 1 |
p. 129-150
22 p.
|
artikel
|
| 634 |
Closures and heavy pairs for hamiltonicity
|
Shang, Wangyi
|
|
|
31-40 |
Index 1 |
p. 25-37
|
artikel
|
| 635 |
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
|
Kung, Tzu-Liang
|
|
|
31-40 |
Index 1 |
p. 143-156
|
artikel
|
| 636 |
(1,1)-Cluster Editing is polynomial-time solvable
|
Gutin, Gregory
|
|
|
31-40 |
Index 1 |
p. 259-271
|
artikel
|
| 637 |
Codes from lattice and related graphs, and permutation decoding
|
Key, J.D.
|
|
2010
|
31-40 |
Index 1 |
p. 1807-1815
9 p.
|
artikel
|
| 638 |
Coding for a multiple access OR channel: A survey
|
Győri, Sándor
|
|
2008
|
31-40 |
Index 1 |
p. 1407-1430
24 p.
|
artikel
|
| 639 |
Coding for write-unidirectional memories and conflict resolution
|
Cohen, Gérard
|
|
1989
|
31-40 |
Index 1 |
p. 103-114
12 p.
|
artikel
|
| 640 |
Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices
|
Makuracki, Bartosz
|
|
|
31-40 |
Index 1 |
p. 108-121
|
artikel
|
| 641 |
Collapsible graphs and Hamilton cycles of line graphs
|
Li, Xiangwen
|
|
2015
|
31-40 |
Index 1 |
p. 132-142
11 p.
|
artikel
|
| 642 |
Collapsible graphs and Hamiltonian connectedness of line graphs
|
Yang, Weihua
|
|
2012
|
31-40 |
Index 1 |
p. 1837-1844
8 p.
|
artikel
|
| 643 |
Collision-free routing problem with restricted L-path
|
Ajay, Jammigumpula
|
|
|
31-40 |
Index 1 |
p. 71-80
|
artikel
|
| 644 |
3-Colorability ∈P
for P
6-free graphs
|
Randerath, Bert
|
|
2004
|
31-40 |
Index 1 |
p. 299-313
15 p.
|
artikel
|
| 645 |
Color-blind index in graphs of very low degree
|
Diemunsch, Jennifer
|
|
2017
|
31-40 |
Index 1 |
p. 122-129
8 p.
|
artikel
|
| 646 |
Colorful edge decomposition of graphs: Some polynomial cases
|
Dehghan, Ali
|
|
2017
|
31-40 |
Index 1 |
p. 155-165
11 p.
|
artikel
|
| 647 |
Colorful linear programming, Nash equilibrium, and pivots
|
Meunier, Frédéric
|
|
2018
|
31-40 |
Index 1 |
p. 78-91
|
artikel
|
| 648 |
Coloring copoints of a planar point set
|
Morris, Walter
|
|
2006
|
31-40 |
Index 1 |
p. 1742-1752
11 p.
|
artikel
|
| 649 |
Coloring edges of self-complementary graphs
|
Wojda, A.Paweł
|
|
1997
|
31-40 |
Index 1 |
p. 279-284
6 p.
|
artikel
|
| 650 |
Coloring graphs without short cycles and long induced paths
|
Golovach, Petr A.
|
|
2014
|
31-40 |
Index 1 |
p. 107-120
14 p.
|
artikel
|
| 651 |
Coloring (
P
5
, kite)-free graphs with small cliques
|
Huang, Shenwei
|
|
|
31-40 |
Index 1 |
p. 129-139
|
artikel
|
| 652 |
Coloring
{
P
2
∪
P
3
,
house
}
-free graphs with
Δ
−
1
colors
|
Chen, Rong
|
|
|
31-40 |
Index 1 |
p. 12-18
|
artikel
|
| 653 |
Colorings of oriented planar graphs avoiding a monochromatic subgraph
|
Bergold, Helena
|
|
|
31-40 |
Index 1 |
p. 81-94
|
artikel
|
| 654 |
Coloring squares of graphs with mad constraints
|
Hocquard, Hervé
|
|
2019
|
31-40 |
Index 1 |
p. 64-73
|
artikel
|
| 655 |
Colorings with neighborhood parity condition
|
Petruševski, Mirko
|
|
|
31-40 |
Index 1 |
p. 385-391
|
artikel
|
| 656 |
Coloring the square of a sparse graph
G
with almost
Δ
(
G
)
colors
|
Yancey, Matthew P.
|
|
2016
|
31-40 |
Index 1 |
p. 211-215
5 p.
|
artikel
|
| 657 |
Coloring the square of the Kneser graph
KG
(
2
k
+
1
,
k
)
and the Schrijver graph
SG
(
2
k
+
2
,
k
)
|
Chen, Jun-Yo
|
|
2009
|
31-40 |
Index 1 |
p. 170-176
7 p.
|
artikel
|
| 658 |
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
|
Wu, Fangfang
|
|
|
31-40 |
Index 1 |
p. 145-152
|
artikel
|
| 659 |
3-color Schur numbers
|
Boza, L.
|
|
2019
|
31-40 |
Index 1 |
p. 59-68
|
artikel
|
| 660 |
Color spanning objects: Algorithms and hardness results
|
Banerjee, Sandip
|
|
|
31-40 |
Index 1 |
p. 14-22
|
artikel
|
| 661 |
Colouring graphs of bounded diameter in the absence of small cycles
|
Martin, Barnaby
|
|
|
31-40 |
Index 1 |
p. 150-161
|
artikel
|
| 662 |
Combinatorial algorithms on a class of graphs
|
Korneyenko, N.M.
|
|
1994
|
31-40 |
Index 1 |
p. 215-217
3 p.
|
artikel
|
| 663 |
Combinatorial dynamical system theory: General framework and controllability criteria
|
Murota, Kazuo
|
|
1988
|
31-40 |
Index 1 |
p. 241-265
25 p.
|
artikel
|
| 664 |
Combinatorial problems on series-parallel graphs
|
Takamizawa, K.
|
|
1981
|
31-40 |
Index 1 |
p. 75-76
2 p.
|
artikel
|
| 665 |
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
|
Qin, Xiao-Wen
|
|
|
31-40 |
Index 1 |
p. 730-733
|
artikel
|
| 666 |
Communication complexity of two decision problems
|
Björner, Anders
|
|
1992
|
31-40 |
Index 1 |
p. 161-163
3 p.
|
artikel
|
| 667 |
Communication in m-connected graphs
|
Idzik, Adam
|
|
1990
|
31-40 |
Index 1 |
p. 297-301
5 p.
|
artikel
|
| 668 |
Commuting Eulerian operators
|
Ma, Shi-Mei
|
|
|
31-40 |
Index 1 |
p. 355-361
|
artikel
|
| 669 |
Compact MILP models for optimal and Pareto-optimal LAD patterns
|
Guo, Cui
|
|
2012
|
31-40 |
Index 1 |
p. 2339-2348
10 p.
|
artikel
|
| 670 |
Comparing the
p
-independence number of regular graphs to the
q
-independence number of their line graphs
|
Caro, Yair
|
|
|
31-40 |
Index 1 |
p. 316-326
|
artikel
|
| 671 |
Comparing the power of cops to zombies in pursuit-evasion games
|
Offner, David
|
|
2019
|
31-40 |
Index 1 |
p. 144-151
|
artikel
|
| 672 |
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
|
Sun, Lingli
|
|
2009
|
31-40 |
Index 1 |
p. 1650-1654
5 p.
|
artikel
|
| 673 |
Comparing Zagreb indices for connected graphs
|
Horoldagva, Batmend
|
|
2010
|
31-40 |
Index 1 |
p. 1073-1078
6 p.
|
artikel
|
| 674 |
Comparison between the Szeged index and the eccentric connectivity index
|
Das, Kinkar Ch.
|
|
2015
|
31-40 |
Index 1 |
p. 74-86
13 p.
|
artikel
|
| 675 |
Comparison of column generation models for channel assignment in cellular networks
|
Jaumard, Brigitte
|
|
2001
|
31-40 |
Index 1 |
p. 217-240
24 p.
|
artikel
|
| 676 |
Comparison of permanental bounds of (0, 1)-matrices
|
Hwang, Suk-Geun
|
|
1998
|
31-40 |
Index 1 |
p. 133-144
12 p.
|
artikel
|
| 677 |
Compatible Euler tours of Kn
∗∗
|
Verrall, H.
|
|
1998
|
31-40 |
Index 1 |
p. 237-251
15 p.
|
artikel
|
| 678 |
Competition graphs of degree bounded digraphs
|
Chu, Hojin
|
|
|
31-40 |
Index 1 |
p. 106-114
|
artikel
|
| 679 |
Competition numbers of complete
r
-partite graphs
|
Li, Bo-Jr
|
|
2012
|
31-40 |
Index 1 |
p. 2271-2276
6 p.
|
artikel
|
| 680 |
Competitive algorithms for the bicriteria
k
-server problem
|
Flammini, Michele
|
|
2006
|
31-40 |
Index 1 |
p. 2117-2127
11 p.
|
artikel
|
| 681 |
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
|
Volkmann, Lutz
|
|
2013
|
31-40 |
Index 1 |
p. 2169-2177
9 p.
|
artikel
|
| 682 |
Complete bipartite graphs without small rainbow stars
|
Chen, Weizhen
|
|
|
31-40 |
Index 1 |
p. 14-20
|
artikel
|
| 683 |
Complete characterization of graphs for direct comparing Zagreb indices
|
Horoldagva, Batmend
|
|
2016
|
31-40 |
Index 1 |
p. 146-154
9 p.
|
artikel
|
| 684 |
Complete characterization of the minimal-ABC trees
|
Dimitrov, Darko
|
|
|
31-40 |
Index 1 |
p. 148-194
|
artikel
|
| 685 |
Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6
|
Dür, Arne
|
|
1991
|
31-40 |
Index 1 |
p. 95-107
13 p.
|
artikel
|
| 686 |
Completely independent spanning trees in
k
th power of 2-connected graphs
|
Hong, Xia
|
|
|
31-40 |
Index 1 |
p. 268-273
|
artikel
|
| 687 |
Completely independent spanning trees in some regular graphs
|
Darties, Benoit
|
|
2017
|
31-40 |
Index 1 |
p. 163-174
12 p.
|
artikel
|
| 688 |
Completely unimodal numberings of a simple polytope
|
Williamson Hoke, Kathy
|
|
1988
|
31-40 |
Index 1 |
p. 69-81
13 p.
|
artikel
|
| 689 |
Complete split graph determined by its (signless) Laplacian spectrum
|
Das, Kinkar Ch.
|
|
2016
|
31-40 |
Index 1 |
p. 45-51
7 p.
|
artikel
|
| 690 |
Complete subgraphs in connected graphs and its application to spectral moment
|
Fang, Longfei
|
|
|
31-40 |
Index 1 |
p. 36-42
|
artikel
|
| 691 |
Complexity analysis of job-shop scheduling with deteriorating jobs
|
Mosheiov, Gur
|
|
2002
|
31-40 |
Index 1 |
p. 195-209
15 p.
|
artikel
|
| 692 |
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
|
Hochbaum, Dorit S.
|
|
2018
|
31-40 |
Index 1 |
p. 252-261
|
artikel
|
| 693 |
Complexity aspects of
ℓ
-chord convexities
|
Dourado, Mitre C.
|
|
|
31-40 |
Index 1 |
p. 585-591
|
artikel
|
| 694 |
Complexity aspects of the triangle path convexity
|
Dourado, Mitre C.
|
|
2016
|
31-40 |
Index 1 |
p. 39-47
9 p.
|
artikel
|
| 695 |
Complexity issues for the sandwich homogeneous set problem
|
Durand, Arnaud
|
|
2011
|
31-40 |
Index 1 |
p. 574-580
7 p.
|
artikel
|
| 696 |
Complexity of coloring graphs without paths and cycles
|
Hell, Pavol
|
|
2017
|
31-40 |
Index 1 |
p. 211-232
22 p.
|
artikel
|
| 697 |
Complexity of finding dense subgraphs
|
Asahiro, Yuichi
|
|
2002
|
31-40 |
Index 1 |
p. 15-26
12 p.
|
artikel
|
| 698 |
Complexity of independency and cliquy trees
|
Casel, Katrin
|
|
|
31-40 |
Index 1 |
p. 2-15
|
artikel
|
| 699 |
Complexity of Maker–Breaker games on edge sets of graphs
|
Duchêne, Eric
|
|
|
31-40 |
Index 1 |
p. 502-522
|
artikel
|
| 700 |
Complexity of planar signed graph homomorphisms to cycles
|
Dross, François
|
|
|
31-40 |
Index 1 |
p. 166-178
|
artikel
|
| 701 |
Complexity of
(
p
,
1
)
-total labelling
|
Havet, Frédéric
|
|
2009
|
31-40 |
Index 1 |
p. 2859-2870
12 p.
|
artikel
|
| 702 |
Complexity of total outer-connected domination problem in graphs
|
Panda, B.S.
|
|
2016
|
31-40 |
Index 1 |
p. 110-122
13 p.
|
artikel
|
| 703 |
Complexity of tree homomorphisms
|
Hell, P.
|
|
1996
|
31-40 |
Index 1 |
p. 23-36
14 p.
|
artikel
|
| 704 |
Complexity results in graph reconstruction
|
Hemaspaandra, Edith
|
|
2007
|
31-40 |
Index 1 |
p. 103-118
16 p.
|
artikel
|
| 705 |
Comportement periodique des fonctions a seuil binaires et applications
|
Goles, E.
|
|
1981
|
31-40 |
Index 1 |
p. 93-105
13 p.
|
artikel
|
| 706 |
Compositional complexity of Boolean functions
|
Abelson, Harold
|
|
1982
|
31-40 |
Index 1 |
p. 1-10
10 p.
|
artikel
|
| 707 |
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
|
Zorzi, A.
|
|
|
31-40 |
Index 1 |
p. 349-363
|
artikel
|
| 708 |
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
|
S.V., Ullas Chandran
|
|
|
31-40 |
Index 1 |
p. 499-510
|
artikel
|
| 709 |
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
|
Chandran S.V., Ullas
|
|
|
31-40 |
Index 1 |
p. 50-61
|
artikel
|
| 710 |
Computational complexity of covering disconnected multigraphs
|
Bok, Jan
|
|
|
31-40 |
Index 1 |
p. 229-243
|
artikel
|
| 711 |
Computational complexity of distance edge labeling
|
Knop, Dušan
|
|
2018
|
31-40 |
Index 1 |
p. 80-98
|
artikel
|
| 712 |
Computational complexity of minimum
P
4
vertex cover problem for regular and
K
1
,
4
-free graphs
|
Safina Devi, N.
|
|
2015
|
31-40 |
Index 1 |
p. 114-121
8 p.
|
artikel
|
| 713 |
Computational determination of the largest lattice polytope diameter
|
Chadder, Nathan
|
|
|
31-40 |
Index 1 |
p. 106-110
|
artikel
|
| 714 |
Computation of Boolean functions by randomized programs
|
Chashkin, A.V.
|
|
2004
|
31-40 |
Index 1 |
p. 65-82
18 p.
|
artikel
|
| 715 |
Computing branchwidth via efficient triangulations and blocks
|
Fomin, Fedor V.
|
|
2009
|
31-40 |
Index 1 |
p. 2726-2736
11 p.
|
artikel
|
| 716 |
Computing covers using prefix tables
|
Alatabbi, Ali
|
|
2016
|
31-40 |
Index 1 |
p. 2-9
8 p.
|
artikel
|
| 717 |
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
|
Gurvich, Vladimir
|
|
|
31-40 |
Index 1 |
p. 53-68
|
artikel
|
| 718 |
Computing partial hypergraphs of bounded width
|
Adrar, Nabil
|
|
|
31-40 |
Index 1 |
p. 1-22
|
artikel
|
| 719 |
Computing Prüfer codes efficiently in parallel
|
Greenlaw, Raymond
|
|
2000
|
31-40 |
Index 1 |
p. 205-222
18 p.
|
artikel
|
| 720 |
Computing solutions to the congruence
1
n
+
2
n
+
⋯
+
n
n
≡
p
(
mod
n
)
|
Alekseyev, Max A.
|
|
|
31-40 |
Index 1 |
p. 3-9
|
artikel
|
| 721 |
Computing the boxicity of a graph by covering its complement by cointerval graphs
|
Cozzens, Margaret B.
|
|
1983
|
31-40 |
Index 1 |
p. 217-228
12 p.
|
artikel
|
| 722 |
Computing the coarseness with strips or boxes
|
Díaz-Báñez, J.M.
|
|
2017
|
31-40 |
Index 1 |
p. 80-90
11 p.
|
artikel
|
| 723 |
Computing the minimum DNF representation of Boolean functions defined by intervals
|
Schieber, Baruch
|
|
2005
|
31-40 |
Index 1 |
p. 154-173
20 p.
|
artikel
|
| 724 |
Computing the number of cubic runs in standard Sturmian words
|
Piątkowski, Marcin
|
|
2014
|
31-40 |
Index 1 |
p. 361-372
12 p.
|
artikel
|
| 725 |
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
|
Zhang, Heping
|
|
2012
|
31-40 |
Index 1 |
p. 2069-2074
6 p.
|
artikel
|
| 726 |
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
|
Speakman, Emily
|
|
|
31-40 |
Index 1 |
p. 36-45
|
artikel
|
| 727 |
Concerning a conjecture on matching Kneser graphs
|
Shaebani, Saeed
|
|
|
31-40 |
Index 1 |
p. 87-90
|
artikel
|
| 728 |
Concurrency measure in commutation monoids
|
Saheb, N.
|
|
1989
|
31-40 |
Index 1 |
p. 223-236
14 p.
|
artikel
|
| 729 |
Conditional connectivity of folded hypercubes
|
Zhao, Shuli
|
|
2019
|
31-40 |
Index 1 |
p. 388-392
|
artikel
|
| 730 |
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
|
Gu, Mei-Mei
|
|
|
31-40 |
Index 1 |
p. 137-152
|
artikel
|
| 731 |
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
|
Xu, Liqiong
|
|
|
31-40 |
Index 1 |
p. 367-379
|
artikel
|
| 732 |
Conditional edge-fault-tolerant Hamiltonicity of the data center network
|
Qin, Xiao-Wen
|
|
|
31-40 |
Index 1 |
p. 165-179
|
artikel
|
| 733 |
Conditional matching preclusion for regular bipartite graphs and their Cartesian product
|
Lin, Ruizhi
|
|
|
31-40 |
Index 1 |
p. 17-25
|
artikel
|
| 734 |
Condorcet proportions and Kelly's conjectures
|
Fishburn, Peter C.
|
|
1979
|
31-40 |
Index 1 |
p. 229-252
24 p.
|
artikel
|
| 735 |
Conflict-directed A* and its role in model-based embedded systems
|
Williams, Brian C.
|
|
2007
|
31-40 |
Index 1 |
p. 1562-1595
34 p.
|
artikel
|
| 736 |
Conflict-free coloring of unit disks
|
Lev-Tov, Nissan
|
|
2009
|
31-40 |
Index 1 |
p. 1521-1532
12 p.
|
artikel
|
| 737 |
1-2-3 Conjecture in digraphs: More results and directions
|
Bensmail, Julien
|
|
|
31-40 |
Index 1 |
p. 124-137
|
artikel
|
| 738 |
Conjugated trees with minimum general Randić index
|
Chen, Xiaodan
|
|
2009
|
31-40 |
Index 1 |
p. 1379-1386
8 p.
|
artikel
|
| 739 |
Connected graph
G
with
σ
2
(
G
)
≥
2
3
n
and
K
1
,
4
-free contains a Hamiltonian path
|
Momège, Benjamin
|
|
|
31-40 |
Index 1 |
p. 37-42
|
artikel
|
| 740 |
Connected graph searching in chordal graphs
|
Nisse, Nicolas
|
|
2009
|
31-40 |
Index 1 |
p. 2603-2610
8 p.
|
artikel
|
| 741 |
2-Connected graphs with minimum general sum-connectivity index
|
Tomescu, Ioan
|
|
2014
|
31-40 |
Index 1 |
p. 135-141
7 p.
|
artikel
|
| 742 |
Connected greedy coloring of
H
-free graphs
|
Mota, Esdras
|
|
|
31-40 |
Index 1 |
p. 572-584
|
artikel
|
| 743 |
Connected triangle-free
m
-step competition graphs
|
Helleloid, Geir T.
|
|
2005
|
31-40 |
Index 1 |
p. 376-383
8 p.
|
artikel
|
| 744 |
Connection-graph and iteration-graph of monotone boolean functions
|
Robert, Y.
|
|
1985
|
31-40 |
Index 1 |
p. 245-253
9 p.
|
artikel
|
| 745 |
Connectivity and diagnosability of center
k
-ary
n
-cubes
|
Wang, Mujiangshan
|
|
|
31-40 |
Index 1 |
p. 98-107
|
artikel
|
| 746 |
Connectivity of iterated line graphs
|
Shao, Yehong
|
|
2010
|
31-40 |
Index 1 |
p. 2081-2087
7 p.
|
artikel
|
| 747 |
Connectivity of Kronecker products with complete multipartite graphs
|
Wang, Wei
|
|
2013
|
31-40 |
Index 1 |
p. 1655-1659
5 p.
|
artikel
|
| 748 |
Connectivity preserving transformations for higher dimensional binary images
|
Komuravelli, Anvesh
|
|
2009
|
31-40 |
Index 1 |
p. 3372-3385
14 p.
|
artikel
|
| 749 |
Consecutive edge-coloring of the generalized
θ
-graph
|
Feng, Yongde
|
|
2007
|
31-40 |
Index 1 |
p. 2321-2327
7 p.
|
artikel
|
| 750 |
Constant delay lattice train schedules
|
De Carufel, Jean-Lou
|
|
|
31-40 |
Index 1 |
p. 1-10
|
artikel
|
| 751 |
Constant threshold intersection graphs of orthodox paths in trees
|
Bornstein, Claudson Ferreira
|
|
|
31-40 |
Index 1 |
p. 61-68
|
artikel
|
| 752 |
Constant work-space algorithms for facility location problems
|
Bhattacharya, Binay K.
|
|
|
31-40 |
Index 1 |
p. 456-472
|
artikel
|
| 753 |
Constrained partitioning problems
|
Burkard, Rainer E.
|
|
1990
|
31-40 |
Index 1 |
p. 21-34
14 p.
|
artikel
|
| 754 |
Constrained versions of Sauer’s lemma
|
Ratsaby, Joel
|
|
2008
|
31-40 |
Index 1 |
p. 2753-2767
15 p.
|
artikel
|
| 755 |
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
|
Čibej, Uroš
|
|
|
31-40 |
Index 1 |
p. 47-61
|
artikel
|
| 756 |
Constructing day-balanced round-robin tournaments with partitions
|
Erzurumluoğlu, Aras
|
|
2018
|
31-40 |
Index 1 |
p. 81-91
|
artikel
|
| 757 |
Constructing depth-optimum circuits for adders and And-Or paths
|
Brenner, Ulrich
|
|
|
31-40 |
Index 1 |
p. 10-31
|
artikel
|
| 758 |
Constructing efficient simulated annealing algorithms
|
Duque-Antón, Manuel
|
|
1997
|
31-40 |
Index 1 |
p. 139-159
21 p.
|
artikel
|
| 759 |
Constructing formally self-dual codes over
R
k
|
Karadeniz, Suat
|
|
2014
|
31-40 |
Index 1 |
p. 188-196
9 p.
|
artikel
|
| 760 |
Constructing new families of transmission irregular graphs
|
Xu, Kexiang
|
|
|
31-40 |
Index 1 |
p. 383-391
|
artikel
|
| 761 |
Construction methods for generalized bent functions
|
Hodžić, S.
|
|
2018
|
31-40 |
Index 1 |
p. 14-23
|
artikel
|
| 762 |
Construction of a simple elimination scheme for a chordal comparability graph in linear time
|
Borie, Richard B.
|
|
1999
|
31-40 |
Index 1 |
p. 287-292
6 p.
|
artikel
|
| 763 |
Construction of infinite de Bruijn arrays
|
Iványi, Antal
|
|
1988
|
31-40 |
Index 1 |
p. 289-293
5 p.
|
artikel
|
| 764 |
Construction of universal one-way hash functions: Tree hashing revisited
|
Sarkar, Palash
|
|
2007
|
31-40 |
Index 1 |
p. 2174-2180
7 p.
|
artikel
|
| 765 |
Constructions of
k
-critical
P
5
-free graphs
|
Hoàng, Chính T.
|
|
2015
|
31-40 |
Index 1 |
p. 91-98
8 p.
|
artikel
|
| 766 |
Constructions of optimal GDRP
(
n
,
λ
;
v
)
’s of type
λ
1
μ
m
−
1
|
Yan, Jie
|
|
2008
|
31-40 |
Index 1 |
p. 2666-2678
13 p.
|
artikel
|
| 767 |
Constructions of rotation symmetric bent functions with high algebraic degree
|
Zhao, Qinglan
|
|
2018
|
31-40 |
Index 1 |
p. 15-29
|
artikel
|
| 768 |
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class
|
Bapić, A.
|
|
|
31-40 |
Index 1 |
p. 197-212
|
artikel
|
| 769 |
Constructive dual methods for discrete programming
|
Barcia, Paulo
|
|
1987
|
31-40 |
Index 1 |
p. 107-117
11 p.
|
artikel
|
| 770 |
Containment properties of product and power graphs
|
Fernández, Antonio
|
|
2007
|
31-40 |
Index 1 |
p. 300-311
12 p.
|
artikel
|
| 771 |
Contents
|
|
|
2009
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 772 |
Contents
|
|
|
2009
|
31-40 |
Index 1 |
p. vii-
1 p.
|
artikel
|
| 773 |
Contents
|
|
|
2009
|
31-40 |
Index 1 |
p. vii-ix
nvt p.
|
artikel
|
| 774 |
Contents
|
|
|
2010
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 775 |
Contents
|
|
|
2014
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 776 |
Contents
|
|
|
2017
|
31-40 |
Index 1 |
p. v-
1 p.
|
artikel
|
| 777 |
Contents
|
|
|
2016
|
31-40 |
Index 1 |
p. v-
1 p.
|
artikel
|
| 778 |
Contents
|
|
|
2004
|
31-40 |
Index 1 |
p. ix-x
nvt p.
|
artikel
|
| 779 |
Contents
|
|
|
2004
|
31-40 |
Index 1 |
p. ix-
1 p.
|
artikel
|
| 780 |
Contents
|
|
|
2004
|
31-40 |
Index 1 |
p. vii-viii
nvt p.
|
artikel
|
| 781 |
Contents
|
|
|
2004
|
31-40 |
Index 1 |
p. viii-ix
nvt p.
|
artikel
|
| 782 |
Contents
|
|
|
2006
|
31-40 |
Index 1 |
p. vii-
1 p.
|
artikel
|
| 783 |
Contents
|
|
|
2006
|
31-40 |
Index 1 |
p. vii-viii
nvt p.
|
artikel
|
| 784 |
Contents
|
|
|
2007
|
31-40 |
Index 1 |
p. vii-viii
nvt p.
|
artikel
|
| 785 |
Contents
|
|
|
2008
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 786 |
Contents
|
|
|
2017
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 787 |
Contents
|
|
|
2015
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 788 |
Contents
|
|
|
2013
|
31-40 |
Index 1 |
p. v-vii
nvt p.
|
artikel
|
| 789 |
Contents
|
|
|
2011
|
31-40 |
Index 1 |
p. v-
1 p.
|
artikel
|
| 790 |
Contents
|
|
|
2011
|
31-40 |
Index 1 |
p. v-
1 p.
|
artikel
|
| 791 |
Contents
|
|
|
2011
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 792 |
Contents
|
|
|
2011
|
31-40 |
Index 1 |
p. v-
1 p.
|
artikel
|
| 793 |
Contents
|
|
|
2014
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 794 |
Contents
|
|
|
2012
|
31-40 |
Index 1 |
p. v-vi
nvt p.
|
artikel
|
| 795 |
Contents all nrs. if necessary
|
|
|
2003
|
31-40 |
Index 1 |
p. vii-viii
nvt p.
|
artikel
|
| 796 |
Contents all nrs. if necessary
|
|
|
2003
|
31-40 |
Index 1 |
p. iv-v
nvt p.
|
artikel
|
| 797 |
Continued fractions and explicit solutions of a particular discrete optimization problem
|
Giannessi, F.
|
|
1979
|
31-40 |
Index 1 |
p. 261-275
15 p.
|
artikel
|
| 798 |
Convex hulls of superincreasing knapsacks and lexicographic orderings
|
Gupte, Akshay
|
|
2016
|
31-40 |
Index 1 |
p. 150-163
14 p.
|
artikel
|
| 799 |
Convex
(
0
,
1
)
-matrices and their epitopes
|
Brualdi, Richard A.
|
|
|
31-40 |
Index 1 |
p. 21-34
|
artikel
|
| 800 |
Correction of the paper “Bicyclic graphs with extremal values of PI index”
|
Ma, Gang
|
|
2016
|
31-40 |
Index 1 |
p. 132-133
2 p.
|
artikel
|
| 801 |
Corrections of proofs for Hansen and Mélot's two theorems
|
Li, Xueliang
|
|
2007
|
31-40 |
Index 1 |
p. 2365-2370
6 p.
|
artikel
|
| 802 |
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
|
Franco, John
|
|
1987
|
31-40 |
Index 1 |
p. 295-299
5 p.
|
artikel
|
| 803 |
Correction to the paper: Patterson–Wiedemann construction revisited
|
Kavut, Selçuk
|
|
2016
|
31-40 |
Index 1 |
p. 185-187
3 p.
|
artikel
|
| 804 |
Coulson-type integral formulas for the general (skew) Estrada index of a vertex
|
Qiao, Lu
|
|
|
31-40 |
Index 1 |
p. 288-303
|
artikel
|
| 805 |
Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
|
Bašić, Bojan
|
|
2012
|
31-40 |
Index 1 |
p. 181-186
6 p.
|
artikel
|
| 806 |
Counting and enumerating galled networks
|
Gunawan, Andreas D.M.
|
|
|
31-40 |
Index 1 |
p. 644-654
|
artikel
|
| 807 |
Counting Candy Crush configurations
|
Hamilton, Adam
|
|
|
31-40 |
Index 1 |
p. 47-56
|
artikel
|
| 808 |
Counting disjoint hypercubes in Fibonacci cubes
|
Saygı, Elif
|
|
2016
|
31-40 |
Index 1 |
p. 231-237
7 p.
|
artikel
|
| 809 |
Counting graceful labelings of trees: A theoretical and empirical study
|
Anick, David
|
|
2016
|
31-40 |
Index 1 |
p. 65-81
17 p.
|
artikel
|
| 810 |
Counting humps and peaks in generalized Motzkin paths
|
Mansour, Toufik
|
|
2013
|
31-40 |
Index 1 |
p. 2213-2216
4 p.
|
artikel
|
| 811 |
Counting inequivalent monotone Boolean functions
|
Stephen, Tamon
|
|
2014
|
31-40 |
Index 1 |
p. 15-24
10 p.
|
artikel
|
| 812 |
Counting
4
×
4
matrix partitions of graphs
|
Dyer, Martin
|
|
2016
|
31-40 |
Index 1 |
p. 76-92
17 p.
|
artikel
|
| 813 |
Counting minimal semi-Sturmian words
|
Blanchet-Sadri, F.
|
|
2013
|
31-40 |
Index 1 |
p. 2851-2861
11 p.
|
artikel
|
| 814 |
Counting phylogenetic networks with few reticulation vertices: A second approach
|
Fuchs, Michael
|
|
|
31-40 |
Index 1 |
p. 140-149
|
artikel
|
| 815 |
Counting preimages of TCP reordering patterns
|
Hansson, Anders
|
|
2008
|
31-40 |
Index 1 |
p. 3187-3193
7 p.
|
artikel
|
| 816 |
Counting spanning trees of (1,
N
)-periodic graphs
|
Zhang, Jingyuan
|
|
|
31-40 |
Index 1 |
p. 88-101
|
artikel
|
| 817 |
Counting the number of non-equivalent vertex colorings of a graph
|
Hertz, Alain
|
|
2016
|
31-40 |
Index 1 |
p. 62-71
10 p.
|
artikel
|
| 818 |
Counting the number of p × q integer matrices more concordant than a given matrix
|
Nguyen, Truc T.
|
|
1985
|
31-40 |
Index 1 |
p. 187-205
19 p.
|
artikel
|
| 819 |
Counting truth assignments of formulas of bounded tree-width or clique-width
|
Fischer, E.
|
|
2008
|
31-40 |
Index 1 |
p. 511-529
19 p.
|
artikel
|
| 820 |
Covering and packing of triangles intersecting a straight line
|
Pandit, Supantha
|
|
|
31-40 |
Index 1 |
p. 92-110
|
artikel
|
| 821 |
Covering a rectangle with six and seven circles
|
Melissen, J.B.M.
|
|
2000
|
31-40 |
Index 1 |
p. 149-156
8 p.
|
artikel
|
| 822 |
Covering automorphisms and some eigenvalues of a graph
|
Rosenfeld, Vladimir R.
|
|
|
31-40 |
Index 1 |
p. 25-30
|
artikel
|
| 823 |
Covering Italian domination in graphs
|
Khodkar, Abdollah
|
|
|
31-40 |
Index 1 |
p. 324-331
|
artikel
|
| 824 |
Covering line graphs with equivalence relations
|
Esperet, Louis
|
|
2010
|
31-40 |
Index 1 |
p. 1902-1907
6 p.
|
artikel
|
| 825 |
Covering symmetric semi-monotone functions
|
Grappe, Roland
|
|
2008
|
31-40 |
Index 1 |
p. 138-144
7 p.
|
artikel
|
| 826 |
CPG graphs: Some structural and hardness results
|
Champseix, Nicolas
|
|
|
31-40 |
Index 1 |
p. 17-35
|
artikel
|
| 827 |
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
|
Kolpakov, R.M.
|
|
2004
|
31-40 |
Index 1 |
p. 125-142
18 p.
|
artikel
|
| 828 |
Critical edges in perfect line graphs and some polyhedral consequences
|
Wagler, Annegret
|
|
1999
|
31-40 |
Index 1 |
p. 455-466
12 p.
|
artikel
|
| 829 |
Critically indecomposable graphs
|
Dubey, Chandan K.
|
|
2009
|
31-40 |
Index 1 |
p. 149-163
15 p.
|
artikel
|
| 830 |
Critical
(
P
6
,
b
a
n
n
e
r
)
-free graphs
|
Huang, Shenwei
|
|
2019
|
31-40 |
Index 1 |
p. 143-151
|
artikel
|
| 831 |
Critical (
P
5
, bull)-free graphs
|
Huang, Shenwei
|
|
|
31-40 |
Index 1 |
p. 15-25
|
artikel
|
| 832 |
Critical
(
P
5
,
d
a
r
t
)
-free graphs
|
Xia, Wen
|
|
|
31-40 |
Index 1 |
p. 44-52
|
artikel
|
| 833 |
Crown reductions for the Minimum Weighted Vertex Cover problem
|
Chlebík, Miroslav
|
|
2008
|
31-40 |
Index 1 |
p. 292-312
21 p.
|
artikel
|
| 834 |
Cumulative index volumes 1–92
|
|
|
2000
|
31-40 |
Index 1 |
p. 177-261
85 p.
|
artikel
|
| 835 |
Cutoff phenomenon for random walks on Kneser graphs
|
Pourmiri, Ali
|
|
|
31-40 |
Index 1 |
p. 100-106
|
artikel
|
| 836 |
Cut, paste and filter
|
Sullivan, Peggy
|
|
2003
|
31-40 |
Index 1 |
p. 465-485
21 p.
|
artikel
|
| 837 |
Cutting out polygon collections with a saw
|
Dumitrescu, Adrian
|
|
2017
|
31-40 |
Index 1 |
p. 98-108
11 p.
|
artikel
|
| 838 |
Cutting planes in integer and mixed integer programming
|
Marchand, Hugues
|
|
2002
|
31-40 |
Index 1 |
p. 397-446
50 p.
|
artikel
|
| 839 |
Cycle energy and its size dependence
|
Gutman, Ivan
|
|
|
31-40 |
Index 1 |
p. 534-537
|
artikel
|
| 840 |
Cycles embedding in balanced hypercubes with faulty edges and vertices
|
Cheng, Dongqin
|
|
2018
|
31-40 |
Index 1 |
p. 56-69
|
artikel
|
| 841 |
Cycles embedding in folded hypercubes under the conditional fault model
|
Cheng, Dongqin
|
|
2017
|
31-40 |
Index 1 |
p. 60-68
9 p.
|
artikel
|
| 842 |
Cycles embedding in folded hypercubes with conditionally faulty vertices
|
Kuo, Che-Nan
|
|
2017
|
31-40 |
Index 1 |
p. 55-59
5 p.
|
artikel
|
| 843 |
Cycles embedding on folded hypercubes with faulty nodes
|
Cheng, Dongqin
|
|
2013
|
31-40 |
Index 1 |
p. 2894-2900
7 p.
|
artikel
|
| 844 |
Cycles in cube-connected cycles graphs
|
Hsu, Lih-Hsing
|
|
2014
|
31-40 |
Index 1 |
p. 163-171
9 p.
|
artikel
|
| 845 |
Cycles in the burnt pancake graph
|
Blanco, Saúl A.
|
|
2019
|
31-40 |
Index 1 |
p. 1-14
|
artikel
|
| 846 |
Cycles of length 1 modulo 3 in graph
|
Mei, LU
|
|
2001
|
31-40 |
Index 1 |
p. 329-336
8 p.
|
artikel
|
| 847 |
Cyclic bandwidth with an edge added
|
Chan, W.H.
|
|
2008
|
31-40 |
Index 1 |
p. 131-137
7 p.
|
artikel
|
| 848 |
Cyclic base ordering of certain degenerate graphs
|
Gu, Xiaofeng
|
|
|
31-40 |
Index 1 |
p. 148-156
|
artikel
|
| 849 |
Cyclic codes of length 2
e
over Z
4
|
Abualrub, Taher
|
|
2003
|
31-40 |
Index 1 |
p. 3-9
7 p.
|
artikel
|
| 850 |
Cyclic codes over Z
4 of oddly even length
|
Blackford, Thomas
|
|
2003
|
31-40 |
Index 1 |
p. 27-46
20 p.
|
artikel
|
| 851 |
Cyclic deficiency of graphs
|
Asratian, Armen S.
|
|
2019
|
31-40 |
Index 1 |
p. 171-185
|
artikel
|
| 852 |
Data-independent neighborhood functions and strict local optima
|
Armstrong, Derek E.
|
|
2005
|
31-40 |
Index 1 |
p. 233-243
11 p.
|
artikel
|
| 853 |
Deadlock prevention by acyclic orientations
|
Bermond, Jean-Claude
|
|
2003
|
31-40 |
Index 1 |
p. 31-47
17 p.
|
artikel
|
| 854 |
Decidability of the binary infinite Post Correspondence Problem
|
Halava, Vesa
|
|
2003
|
31-40 |
Index 1 |
p. 521-526
6 p.
|
artikel
|
| 855 |
Decision theory and discrete mathematics
|
Fishburn, Peter C.
|
|
1996
|
31-40 |
Index 1 |
p. 209-221
13 p.
|
artikel
|
| 856 |
Decision trees based on 1-consequences
|
Moshkov, Mikhail
|
|
|
31-40 |
Index 1 |
p. 208-214
|
artikel
|
| 857 |
Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture
|
Bensmail, Julien
|
|
2019
|
31-40 |
Index 1 |
p. 1-9
|
artikel
|
| 858 |
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
|
Huang, Ziwen
|
|
2019
|
31-40 |
Index 1 |
p. 112-118
|
artikel
|
| 859 |
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
|
Gurvich, Vladimir
|
|
2009
|
31-40 |
Index 1 |
p. 3069-3085
17 p.
|
artikel
|
| 860 |
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
|
Asratian, Armen S.
|
|
|
31-40 |
Index 1 |
p. 25-35
|
artikel
|
| 861 |
Decomposing split graphs into locally irregular graphs
|
Lintzmayer, C.N.
|
|
|
31-40 |
Index 1 |
p. 33-44
|
artikel
|
| 862 |
Decomposing the feasibility of Clustered Spanning Tree by Paths
|
Guttmann-Beck, Nili
|
|
|
31-40 |
Index 1 |
p. 160-180
|
artikel
|
| 863 |
Decomposing toroidal graphs into circuits and edges
|
Xu, Baogang
|
|
2005
|
31-40 |
Index 1 |
p. 147-159
13 p.
|
artikel
|
| 864 |
Decomposition of bipartite graphs into special subgraphs
|
Chen, Guantao
|
|
2007
|
31-40 |
Index 1 |
p. 400-404
5 p.
|
artikel
|
| 865 |
Decomposition of circulant digraphs with two jumps into cycles of equal lengths
|
Bogdanowicz, Zbigniew R.
|
|
2015
|
31-40 |
Index 1 |
p. 45-51
7 p.
|
artikel
|
| 866 |
Decomposition of graphs with constraint on minimum degree
|
Qin, Xiang
|
|
|
31-40 |
Index 1 |
p. 64-71
|
artikel
|
| 867 |
Decomposition of planar graphs with forbidden configurations
|
Li, Lingxi
|
|
|
31-40 |
Index 1 |
p. 147-158
|
artikel
|
| 868 |
Decomposition of wheel-and-parachute-free balanced bipartite graphs
|
Conforti, Michele
|
|
1995
|
31-40 |
Index 1 |
p. 103-117
15 p.
|
artikel
|
| 869 |
Decompositions into linear forests and difference labelings of graphs
|
Bloom, Gary S.
|
|
1994
|
31-40 |
Index 1 |
p. 61-75
15 p.
|
artikel
|
| 870 |
Decycling bubble sort graphs
|
Wang, Jian
|
|
2015
|
31-40 |
Index 1 |
p. 178-182
5 p.
|
artikel
|
| 871 |
Dedication
|
Gesù, Vito Di
|
|
2005
|
31-40 |
Index 1 |
p. 1-
1 p.
|
artikel
|
| 872 |
Defect of an octahedron in a rational lattice
|
Fadin, Mikhail
|
|
|
31-40 |
Index 1 |
p. 37-43
|
artikel
|
| 873 |
Defensive alliances in graphs of bounded treewidth
|
Bliem, Bernhard
|
|
2018
|
31-40 |
Index 1 |
p. 334-339
|
artikel
|
| 874 |
Defining binary phylogenetic trees using parsimony: New bounds
|
Wilde, Mirko
|
|
|
31-40 |
Index 1 |
p. 257-269
|
artikel
|
| 875 |
Defining families of trees with E0L grammars
|
Ottmann, Thomas
|
|
1991
|
31-40 |
Index 1 |
p. 195-209
15 p.
|
artikel
|
| 876 |
Degenerate matchings and edge colorings
|
Baste, Julien
|
|
2018
|
31-40 |
Index 1 |
p. 38-44
|
artikel
|
| 877 |
Degree-based function index for graphs with given diameter
|
Vetrík, Tomáš
|
|
|
31-40 |
Index 1 |
p. 59-70
|
artikel
|
| 878 |
Degree conditions on distance 2 vertices that imply
k
-ordered Hamiltonian
|
Li, Ruijuan
|
|
2010
|
31-40 |
Index 1 |
p. 331-339
9 p.
|
artikel
|
| 879 |
Degree-constrained spanners for multidimensional grids
|
Liestman, Arthur L.
|
|
1996
|
31-40 |
Index 1 |
p. 119-144
26 p.
|
artikel
|
| 880 |
Degree distance and vertex-connectivity
|
Ali, P.
|
|
2013
|
31-40 |
Index 1 |
p. 2802-2811
10 p.
|
artikel
|
| 881 |
Degree sequence conditions for a graph to be disjoint path coverable
|
Sabir, Eminjan
|
|
|
31-40 |
Index 1 |
p. 62-69
|
artikel
|
| 882 |
Degree sequence realizations with given packing and covering of spanning trees
|
Liu, Fengxia
|
|
2015
|
31-40 |
Index 1 |
p. 113-118
6 p.
|
artikel
|
| 883 |
Degree sequences and graphs with disjoint spanning trees
|
Lai, Hong-Jian
|
|
2011
|
31-40 |
Index 1 |
p. 1447-1452
6 p.
|
artikel
|
| 884 |
Degree sequences for k-regulable ribbon realizations
|
Guo, Xia
|
|
|
31-40 |
Index 1 |
p. 50-65
|
artikel
|
| 885 |
Degree sum condition for vertex-disjoint triangles and pentagons
|
Wang, Maoqun
|
|
|
31-40 |
Index 1 |
p. 88-95
|
artikel
|
| 886 |
Delay-related secondary objectives for rectilinear Steiner minimum trees
|
Peyer, Sven
|
|
2004
|
31-40 |
Index 1 |
p. 271-298
28 p.
|
artikel
|
| 887 |
Dense bipartite circulants and their routing via rectangular twisted torus
|
Jha, Pranava K.
|
|
2014
|
31-40 |
Index 1 |
p. 141-158
18 p.
|
artikel
|
| 888 |
Dense on-line arbitrarily partitionable graphs
|
Kalinowski, Rafał
|
|
2017
|
31-40 |
Index 1 |
p. 71-77
7 p.
|
artikel
|
| 889 |
Dense subgraphs in random graphs
|
Balister, Paul
|
|
2019
|
31-40 |
Index 1 |
p. 66-74
|
artikel
|
| 890 |
Derived neighborhoods and frontier orders
|
Daragon, Xavier
|
|
2005
|
31-40 |
Index 1 |
p. 227-243
17 p.
|
artikel
|
| 891 |
Descent generating polynomials for (
n
−
3
)- and (
n
−
4
)-stack-sortable (pattern-avoiding) permutations
|
Zhang, Philip B.
|
|
|
31-40 |
Index 1 |
p. 1-14
|
artikel
|
| 892 |
Destroying longest cycles in graphs and digraphs
|
van Aardt, Susan A.
|
|
2015
|
31-40 |
Index 1 |
p. 251-259
9 p.
|
artikel
|
| 893 |
Determining equitable total chromatic number for infinite classes of complete
r
-partite graphs
|
da Silva, A.G.
|
|
|
31-40 |
Index 1 |
p. 56-67
|
artikel
|
| 894 |
Determining some graph joins by the signless Laplacian spectrum
|
Ye, Jiachang
|
|
|
31-40 |
Index 1 |
p. 17-24
|
artikel
|
| 895 |
Determining the
L
(
2
,
1
)
-span in polynomial space
|
Junosza-Szaniawski, Konstanty
|
|
2013
|
31-40 |
Index 1 |
p. 2052-2061
10 p.
|
artikel
|
| 896 |
Deterministic algorithms for multi-criteria Max-TSP
|
Manthey, Bodo
|
|
2012
|
31-40 |
Index 1 |
p. 2277-2285
9 p.
|
artikel
|
| 897 |
Deterministic communication complexity of set intersection
|
Tamm, Ulrich
|
|
1995
|
31-40 |
Index 1 |
p. 271-283
13 p.
|
artikel
|
| 898 |
Deterministic distributed construction of
T
-dominating sets in time
T
|
Miller, Avery
|
|
2017
|
31-40 |
Index 1 |
p. 172-178
7 p.
|
artikel
|
| 899 |
Deterministic inverse zero-patterns
|
Johnson, Charles R.
|
|
2001
|
31-40 |
Index 1 |
p. 211-236
26 p.
|
artikel
|
| 900 |
Deterministic symmetric rendezvous with tokens in a synchronous torus
|
Kranakis, Evangelos
|
|
2011
|
31-40 |
Index 1 |
p. 896-923
28 p.
|
artikel
|
| 901 |
Diagnosis of constant faults in read-once contact networks over finite bases
|
Busbait, Monther
|
|
2015
|
31-40 |
Index 1 |
p. 76-88
13 p.
|
artikel
|
| 902 |
Diameter determination on restricted graph families
|
Corneil, Derek G.
|
|
2001
|
31-40 |
Index 1 |
p. 143-166
24 p.
|
artikel
|
| 903 |
Diameter vulnerability of graphs
|
Peyrat, C.
|
|
1984
|
31-40 |
Index 1 |
p. 245-250
6 p.
|
artikel
|
| 904 |
Diameter-vulnerability of large bipartite digraphs
|
Padró, C.
|
|
1996
|
31-40 |
Index 1 |
p. 239-248
10 p.
|
artikel
|
| 905 |
Dichotomizing
k
-vertex-critical
H
-free graphs for
H
of order four
|
Cameron, Ben
|
|
|
31-40 |
Index 1 |
p. 106-115
|
artikel
|
| 906 |
Diclique digraphs
|
Gutierrez, Marisa
|
|
|
31-40 |
Index 1 |
p. 197-210
|
artikel
|
| 907 |
Difference between
2
-rainbow domination and Roman domination in graphs
|
Fujita, Shinya
|
|
2013
|
31-40 |
Index 1 |
p. 806-812
7 p.
|
artikel
|
| 908 |
Difference graphs
|
Hammer, Peter L.
|
|
1990
|
31-40 |
Index 1 |
p. 35-44
10 p.
|
artikel
|
| 909 |
Diffuse reflection diameter in simple polygons
|
Barequet, Gill
|
|
2016
|
31-40 |
Index 1 |
p. 123-132
|
artikel
|
| 910 |
Digital homotopy with obstacles
|
Ayala, R
|
|
2004
|
31-40 |
Index 1 |
p. 5-30
26 p.
|
artikel
|
| 911 |
Digraphs whose
m
-step competition graphs are trees
|
Choi, Myungho
|
|
|
31-40 |
Index 1 |
p. 234-246
|
artikel
|
| 912 |
Digraphs with real and gaussian spectra
|
Esser, Friedrich
|
|
1980
|
31-40 |
Index 1 |
p. 113-124
12 p.
|
artikel
|
| 913 |
2-dimensional optical orthogonal codes from singer groups
|
Alderson, T.L.
|
|
2009
|
31-40 |
Index 1 |
p. 3008-3019
12 p.
|
artikel
|
| 914 |
[
1
,
2
]
-dimension of graphs
|
Chang, Fei-Huang
|
|
|
31-40 |
Index 1 |
p. 232-245
|
artikel
|
| 915 |
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
|
Wu, Yaokun
|
|
2010
|
31-40 |
Index 1 |
p. 706-717
12 p.
|
artikel
|
| 916 |
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
|
Feigenbaum, Joan
|
|
1986
|
31-40 |
Index 1 |
p. 105-110
6 p.
|
artikel
|
| 917 |
Directed defective asymmetric graph coloring games
|
Andres, Stephan Dominique
|
|
2010
|
31-40 |
Index 1 |
p. 251-260
10 p.
|
artikel
|
| 918 |
Directed Moore hypergraphs
|
Ergincan, Fahir Ö.
|
|
1995
|
31-40 |
Index 1 |
p. 117-127
11 p.
|
artikel
|
| 919 |
Directed rectangle-visibility graphs have unbounded dimension
|
Romanik, Kathleen
|
|
1997
|
31-40 |
Index 1 |
p. 35-39
5 p.
|
artikel
|
| 920 |
Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
|
Fuji, Zhang
|
|
1991
|
31-40 |
Index 1 |
p. 295-302
8 p.
|
artikel
|
| 921 |
Directed weighted improper coloring for cellular channel allocation
|
Archetti, Claudia
|
|
2015
|
31-40 |
Index 1 |
p. 46-60
15 p.
|
artikel
|
| 922 |
Discovering all associations in discrete data using frequent minimally infrequent attribute sets
|
Eisenschmidt, Elke
|
|
2012
|
31-40 |
Index 1 |
p. 1730-1741
12 p.
|
artikel
|
| 923 |
Discrepancy minimizing spectral clustering
|
Bolla, Marianna
|
|
2018
|
31-40 |
Index 1 |
p. 286-289
|
artikel
|
| 924 |
Discrete approximations to real-valued leaf sequencing problems in radiation therapy
|
Gunawardena, Athula
|
|
2008
|
31-40 |
Index 1 |
p. 3178-3186
9 p.
|
artikel
|
| 925 |
Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
|
Józefowska, Joanna
|
|
1999
|
31-40 |
Index 1 |
p. 263-285
23 p.
|
artikel
|
| 926 |
Discrete facility location and routing of obnoxious activities
|
Cappanera, P.
|
|
2003
|
31-40 |
Index 1 |
p. 3-28
26 p.
|
artikel
|
| 927 |
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
|
Lin, Lan
|
|
|
31-40 |
Index 1 |
p. 201-214
|
artikel
|
| 928 |
Discrete Tomography determination of bounded sets in
Z
n
|
Brunetti, S.
|
|
2015
|
31-40 |
Index 1 |
p. 20-30
11 p.
|
artikel
|
| 929 |
Discrete tomography for inscribable lattice sets
|
Dulio, P.
|
|
2013
|
31-40 |
Index 1 |
p. 1959-1974
16 p.
|
artikel
|
| 930 |
Disjoint cycles in graphs with restricted independence number
|
Molla, Theodore
|
|
|
31-40 |
Index 1 |
p. 95-105
|
artikel
|
| 931 |
Disjoint cycles in hypercubes with prescribed vertices in each cycle
|
Lin, Cheng-Kuan
|
|
2013
|
31-40 |
Index 1 |
p. 2992-3004
13 p.
|
artikel
|
| 932 |
Disjoint Hamilton cycles in transposition graphs
|
Hussak, Walter
|
|
2016
|
31-40 |
Index 1 |
p. 56-64
9 p.
|
artikel
|
| 933 |
Disjointness graphs of segments in
R
2
are almost all hamiltonian
|
Leaños, J.
|
|
|
31-40 |
Index 1 |
p. 168-173
|
artikel
|
| 934 |
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
|
Yang, Wei
|
|
|
31-40 |
Index 1 |
p. 99-102
|
artikel
|
| 935 |
Distance and distance signless Laplacian spread of connected graphs
|
You, Lihua
|
|
2017
|
31-40 |
Index 1 |
p. 140-147
8 p.
|
artikel
|
| 936 |
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
|
Casablanca, Rocío M.
|
|
2019
|
31-40 |
Index 1 |
p. 105-117
|
artikel
|
| 937 |
Distance constrained labelings of planar graphs with no short cycles
|
Dvořák, Zdeněk
|
|
2009
|
31-40 |
Index 1 |
p. 2634-2645
12 p.
|
artikel
|
| 938 |
Distance-constrained labellings of Cartesian products of graphs
|
Lladó, Anna
|
|
|
31-40 |
Index 1 |
p. 375-383
|
artikel
|
| 939 |
Distance distributions for graphs modeling computer networks
|
Elenbogen, Bruce
|
|
2007
|
31-40 |
Index 1 |
p. 2612-2624
13 p.
|
artikel
|
| 940 |
Distance
k
-domination, distance
k
-guarding, and distance
k
-vertex cover of maximal outerplanar graphs
|
Alvarado, José D.
|
|
2015
|
31-40 |
Index 1 |
p. 154-159
6 p.
|
artikel
|
| 941 |
Distance magic graphs
G
×
C
n
|
Cichacz, Sylwia
|
|
2014
|
31-40 |
Index 1 |
p. 80-87
8 p.
|
artikel
|
| 942 |
Distance restricted optimal pebbling in cycles
|
Shiue, Chin-Lin
|
|
|
31-40 |
Index 1 |
p. 125-133
|
artikel
|
| 943 |
Distance restricted optimal pebbling in paths
|
Shiue, Chin-Lin
|
|
|
31-40 |
Index 1 |
p. 46-54
|
artikel
|
| 944 |
Distances between sets based on set commonality
|
Horadam, K.J.
|
|
2014
|
31-40 |
Index 1 |
p. 310-314
5 p.
|
artikel
|
| 945 |
Distances in cocomparability graphs and their powers
|
Damaschke, Peter
|
|
1992
|
31-40 |
Index 1 |
p. 67-72
6 p.
|
artikel
|
| 946 |
Distances in graphs of girth 6 and generalised cages
|
Alochukwu, Alex
|
|
|
31-40 |
Index 1 |
p. 125-137
|
artikel
|
| 947 |
Distance spectral radius of trees with given matching number
|
Ilić, Aleksandar
|
|
2010
|
31-40 |
Index 1 |
p. 1799-1806
8 p.
|
artikel
|
| 948 |
Distance spectral spread of a graph
|
Yu, Guanglong
|
|
2012
|
31-40 |
Index 1 |
p. 2474-2478
5 p.
|
artikel
|
| 949 |
Distance three labelings of trees
|
Fiala, Jiří
|
|
2012
|
31-40 |
Index 1 |
p. 764-779
16 p.
|
artikel
|
| 950 |
Distance-two labelings of digraphs
|
Chang, Gerard J.
|
|
2007
|
31-40 |
Index 1 |
p. 1007-1013
7 p.
|
artikel
|
| 951 |
Distance-two labellings of Hamming graphs
|
Chang, Gerard J.
|
|
2009
|
31-40 |
Index 1 |
p. 1896-1904
9 p.
|
artikel
|
| 952 |
Distant irregularity strength of graphs with bounded minimum degree
|
Przybyło, Jakub
|
|
2017
|
31-40 |
Index 1 |
p. 159-165
7 p.
|
artikel
|
| 953 |
Distinct distances and arithmetic progressions
|
Dumitrescu, Adrian
|
|
2019
|
31-40 |
Index 1 |
p. 38-41
|
artikel
|
| 954 |
Distinct spreads in vector spaces over finite fields
|
Lund, Ben
|
|
2018
|
31-40 |
Index 1 |
p. 154-158
|
artikel
|
| 955 |
Distinguishing graphs via cycles
|
Klobas, Nina
|
|
|
31-40 |
Index 1 |
p. 74-98
|
artikel
|
| 956 |
Distinguishing numbers and distinguishing indices of oriented graphs
|
Meslem, Kahina
|
|
|
31-40 |
Index 1 |
p. 330-342
|
artikel
|
| 957 |
Distributed processing of divisible jobs with communication startup costs
|
Błażewicz, Jacek
|
|
1997
|
31-40 |
Index 1 |
p. 21-41
21 p.
|
artikel
|
| 958 |
Divisibility and coloring of some
P
5
-free graphs
|
Song, Jialei
|
|
|
31-40 |
Index 1 |
p. 144-151
|
artikel
|
| 959 |
Divisor generating functions and insertion into a heap
|
Uchimura, Keisuke
|
|
1987
|
31-40 |
Index 1 |
p. 73-81
9 p.
|
artikel
|
| 960 |
d-minimal languages
|
Yu, S.S.
|
|
1998
|
31-40 |
Index 1 |
p. 243-262
20 p.
|
artikel
|
| 961 |
DNA recombination through assembly graphs
|
Angeleska, Angela
|
|
2009
|
31-40 |
Index 1 |
p. 3020-3037
18 p.
|
artikel
|
| 962 |
(
d
,
n
)
-packing colorings of infinite lattices
|
Korže, Danilo
|
|
2018
|
31-40 |
Index 1 |
p. 97-108
|
artikel
|
| 963 |
Dominating and irredundant broadcasts in graphs
|
Mynhardt, C.M.
|
|
2017
|
31-40 |
Index 1 |
p. 80-90
11 p.
|
artikel
|
| 964 |
Dominating Cartesian products of cycles
|
Klavžar, Sandi
|
|
1995
|
31-40 |
Index 1 |
p. 129-136
8 p.
|
artikel
|
| 965 |
Dominating induced matchings in
S
1
,
2
,
4
-free graphs
|
Brandstädt, Andreas
|
|
|
31-40 |
Index 1 |
p. 83-92
|
artikel
|
| 966 |
Dominating maximal outerplane graphs and Hamiltonian plane triangulations
|
Plummer, Michael D.
|
|
|
31-40 |
Index 1 |
p. 162-167
|
artikel
|
| 967 |
Dominating plane triangulations
|
Plummer, Michael D.
|
|
2016
|
31-40 |
Index 1 |
p. 175-182
8 p.
|
artikel
|
| 968 |
Dominating sets reconfiguration under token sliding
|
Bonamy, Marthe
|
|
|
31-40 |
Index 1 |
p. 6-18
|
artikel
|
| 969 |
Domination analysis for minimum multiprocessor scheduling
|
Gutin, Gregory
|
|
2006
|
31-40 |
Index 1 |
p. 2613-2619
7 p.
|
artikel
|
| 970 |
Domination and convexity problems in the target set selection model
|
Araújo, Rafael
|
|
|
31-40 |
Index 1 |
p. 14-23
|
artikel
|
| 971 |
Domination and location in twin-free digraphs
|
Foucaud, Florent
|
|
|
31-40 |
Index 1 |
p. 42-52
|
artikel
|
| 972 |
Domination in a digraph and in its reverse
|
Niepel, L’udovít
|
|
2009
|
31-40 |
Index 1 |
p. 2973-2977
5 p.
|
artikel
|
| 973 |
Domination, independent domination, and duality in strongly chordal graphs
|
Farber, Martin
|
|
1984
|
31-40 |
Index 1 |
p. 115-130
16 p.
|
artikel
|
| 974 |
Domination in direct products of complete graphs
|
Vemuri, Harish
|
|
|
31-40 |
Index 1 |
p. 473-482
|
artikel
|
| 975 |
[
1
,
2
]
-domination in graphs
|
Yang, Xiaojing
|
|
2014
|
31-40 |
Index 1 |
p. 79-86
8 p.
|
artikel
|
| 976 |
Domination in intersecting hypergraphs
|
Dong, Yanxia
|
|
2018
|
31-40 |
Index 1 |
p. 155-159
|
artikel
|
| 977 |
Domination in some subclasses of bipartite graphs
|
Pandey, Arti
|
|
2019
|
31-40 |
Index 1 |
p. 51-66
|
artikel
|
| 978 |
Domination number, independent domination number and
k
-independence number in trees
|
Cui, Qing
|
|
|
31-40 |
Index 1 |
p. 176-184
|
artikel
|
| 979 |
Domination ratio of a family of integer distance digraphs with arbitrary degree
|
Huang, Jia
|
|
|
31-40 |
Index 1 |
p. 1-9
|
artikel
|
| 980 |
Domination versus disjunctive domination in trees
|
Henning, Michael A.
|
|
2015
|
31-40 |
Index 1 |
p. 171-177
7 p.
|
artikel
|
| 981 |
Domination versus edge domination
|
Baste, Julien
|
|
|
31-40 |
Index 1 |
p. 343-349
|
artikel
|
| 982 |
Dot product dimension of unicyclic graphs
|
Bahrami, Mahin
|
|
|
31-40 |
Index 1 |
p. 196-213
|
artikel
|
| 983 |
Dot product dimensions of graphs
|
Li, Bo-Jr
|
|
2014
|
31-40 |
Index 1 |
p. 159-163
5 p.
|
artikel
|
| 984 |
Double Roman domination
|
Beeler, Robert A.
|
|
2016
|
31-40 |
Index 1 |
p. 23-29
7 p.
|
artikel
|
| 985 |
Double Roman domination number
|
V., Anu
|
|
2018
|
31-40 |
Index 1 |
p. 198-204
|
artikel
|
| 986 |
Double Roman domination stability in graphs
|
Zhuang, Wei
|
|
|
31-40 |
Index 1 |
p. 254-263
|
artikel
|
| 987 |
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0–1 MIPs
|
Minoux, M.
|
|
2010
|
31-40 |
Index 1 |
p. 2031-2048
18 p.
|
artikel
|
| 988 |
3D well-composed polyhedral complexes
|
Gonzalez-Diaz, Rocio
|
|
2015
|
31-40 |
Index 1 |
p. 59-77
19 p.
|
artikel
|
| 989 |
Dyck paths of knight moves
|
Labelle, Jacques
|
|
1989
|
31-40 |
Index 1 |
p. 213-221
9 p.
|
artikel
|
| 990 |
Dynamic chromatic number of regular graphs
|
Alishahi, Meysam
|
|
2012
|
31-40 |
Index 1 |
p. 2098-2103
6 p.
|
artikel
|
| 991 |
3-dynamic coloring and list 3-dynamic coloring of
K
1
,
3
-free graphs
|
Li, Hao
|
|
2017
|
31-40 |
Index 1 |
p. 166-171
6 p.
|
artikel
|
| 992 |
Dynamic coloring of IC-planar graphs
|
Hu, Xiaoxue
|
|
|
31-40 |
Index 1 |
p. 45-49
|
artikel
|
| 993 |
Dynamic coloring parameters for graphs with given genus
|
Loeb, Sarah
|
|
2018
|
31-40 |
Index 1 |
p. 129-141
|
artikel
|
| 994 |
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks
|
Khoshkhah, Kaveh
|
|
2014
|
31-40 |
Index 1 |
p. 81-89
9 p.
|
artikel
|
| 995 |
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
|
Akutsu, Tatsuya
|
|
2000
|
31-40 |
Index 1 |
p. 45-62
18 p.
|
artikel
|
| 996 |
Dynamic programming and planarity: Improved tree-decomposition based algorithms
|
Dorn, Frederic
|
|
2010
|
31-40 |
Index 1 |
p. 800-808
9 p.
|
artikel
|
| 997 |
Easy and hard bottleneck location problems
|
Hsu, Wen-Lian
|
|
1979
|
31-40 |
Index 1 |
p. 209-215
7 p.
|
artikel
|
| 998 |
Easy cases of the D0L sequence equivalence problem
|
Honkala, Juha
|
|
2001
|
31-40 |
Index 1 |
p. 285-290
6 p.
|
artikel
|
| 999 |
Eccentricity approximating trees
|
Dragan, Feodor F.
|
|
2017
|
31-40 |
Index 1 |
p. 142-156
|
artikel
|
| 1000 |
Edge and total coloring of interval graphs
|
Bojarshinov, V.A.
|
|
2001
|
31-40 |
Index 1 |
p. 23-28
6 p.
|
artikel
|
Tijdschrift beschrijving