Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
   volgende >>
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             2904 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A 9 7 -approximation algorithm for Graphic TSP in cubic bipartite graphs Karp, Jeremy A.
2016
81-90 Index 1 p. 164-216
53 p.
artikel
2 A 2-approximation algorithm for the minimum weight edge dominating set problem Fujito, Toshihiro
2002
81-90 Index 1 p. 199-207
9 p.
artikel
3 ( a , b ) -codes in Z / n Z Gravier, Sylvain
2013
81-90 Index 1 p. 612-617
6 p.
artikel
4 A better step-off algorithm for the knapsack problem Greenberg, Harold
1980
81-90 Index 1 p. 21-25
5 p.
artikel
5 A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times Nowicki, Eugeniusz
1995
81-90 Index 1 p. 237-256
20 p.
artikel
6 A bijection between permutations and floorplans, and its applications Ackerman, Eyal
2006
81-90 Index 1 p. 1674-1684
11 p.
artikel
7 A bound for judicious k -partitions of graphs Fan, Genghua
2014
81-90 Index 1 p. 86-99
14 p.
artikel
8 About equivalent interval colorings of weighted graphs Bouchard, Mathieu
2009
81-90 Index 1 p. 3615-3624
10 p.
artikel
9 A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments Charon, Irène
2006
81-90 Index 1 p. 2097-2116
20 p.
artikel
10 A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Hernández-Pérez, Hipólito
2004
81-90 Index 1 p. 126-139
14 p.
artikel
11 A branch-and-price algorithm for the robust graph coloring problem Archetti, Claudia
2014
81-90 Index 1 p. 49-59
11 p.
artikel
12 ( a , b ) -rectangle patterns in permutations and words Kitaev, Sergey
2015
81-90 Index 1 p. 128-146
19 p.
artikel
13 A brief survey of perfect Mendelsohn packing and covering designs Bennett, F.E.
1999
81-90 Index 1 p. 73-81
9 p.
artikel
14 A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs Klavžar, Sandi
2012
81-90 Index 1 p. 1277-1280
4 p.
artikel
15 A characterization of dissimilarity families of trees Baldisserri, Agnese
2017
81-90 Index 1 p. 35-45
11 p.
artikel
16 A characterization of double Roman trees Henning, Michael A.
2019
81-90 Index 1 p. 100-111
artikel
17 A characterization of perfect Roman trees Sheikholeslami, S.M.

81-90 Index 1 p. 501-508
artikel
18 A characterization of PQI interval orders Tsoukiàs, A.
2003
81-90 Index 1 p. 387-397
11 p.
artikel
19 A characterization of uniquely representable interval graphs Fishburn, Peter C.
1985
81-90 Index 1 p. 191-194
4 p.
artikel
20 Achievable sets, brambles, and sparse treewidth obstructions Lucena, Brian
2007
81-90 Index 1 p. 1055-1065
11 p.
artikel
21 A ( 3 , 1 ) ∗ -choosable theorem on toroidal graphs Zhang, Li
2012
81-90 Index 1 p. 332-338
7 p.
artikel
22 A classification result on weighted { δ v μ + 1 , δ v μ ; N , p 3 } -minihypers Ferret, S.
2006
81-90 Index 1 p. 277-293
17 p.
artikel
23 A class of asymptotically optimal group screening strategies with limited item participation Cheng, Yongxi
2019
81-90 Index 1 p. 83-95
artikel
24 A class of asymptotically optimal group testing strategies to identify good items Cheng, Yongxi
2019
81-90 Index 1 p. 109-116
artikel
25 A class of functions with low-valued Walsh spectrum Li, Fengwei

81-90 Index 1 p. 92-105
artikel
26 A closed-form solution for the optimal release times for the F 2 | deteriorating jobs | ∑ w j C j problem Wagneur, Edouard
2011
81-90 Index 1 p. 1367-1376
10 p.
artikel
27 A coloring algorithm for 4 K 1 -free line graphs Fraser, Dallas J.
2018
81-90 Index 1 p. 76-85
artikel
28 A combinatorial approach to a general two-term recurrence Mansour, Toufik
2013
81-90 Index 1 p. 2084-2094
11 p.
artikel
29 A combinatorial formula for the Schur coefficients of chromatic symmetric functions Wang, David G.L.

81-90 Index 1 p. 621-630
artikel
30 A combinatorial problem in database security Horak, Peter
1999
81-90 Index 1 p. 119-126
8 p.
artikel
31 A comment to: Two classes of edge domination in graphs Jahanbekam, S.
2009
81-90 Index 1 p. 400-401
2 p.
artikel
32 A comparison of integer programming models for the partial directed weighted improper coloring problem Hertz, Alain
2019
81-90 Index 1 p. 229-245
artikel
33 A comparison of lower bounds for the symmetric circulant traveling salesman problem de Klerk, Etienne
2011
81-90 Index 1 p. 1815-1826
12 p.
artikel
34 A competitive algorithm in searching for many edges in a hypergraph Chen, Ting
2007
81-90 Index 1 p. 566-571
6 p.
artikel
35 A competitive algorithm to find all defective edges in a graph Hwang, Frank K.
2005
81-90 Index 1 p. 273-277
5 p.
artikel
36 A complete characterization of paths that are m -step competition graphs Belmont, Eva
2011
81-90 Index 1 p. 1381-1390
10 p.
artikel
37 A computational study of f -reversible processes on graphs Lima, Carlos V.G.C.
2018
81-90 Index 1 p. 77-93
artikel
38 A computational substantiation of the d -step approach to the number of distinct squares problem Deza, Antoine
2016
81-90 Index 1 p. 81-87
7 p.
artikel
39 A concentration bound for the longest increasing subsequence of a randomly chosen involution Kiwi, Marcos
2006
81-90 Index 1 p. 1816-1823
8 p.
artikel
40 A concise characterization of strong knapsack facets Chopra, Sunil
2019
81-90 Index 1 p. 136-152
artikel
41 A connection between circular colorings and periodic schedules Yeh, Hong-Gwa
2009
81-90 Index 1 p. 1663-1668
6 p.
artikel
42 A constant factor approximation algorithm for boxicity of circular arc graphs Adiga, Abhijin
2014
81-90 Index 1 p. 1-18
18 p.
artikel
43 A continuous approach for the concave cost supply problem via DC programming and DCA Le Thi, Hoai An
2008
81-90 Index 1 p. 325-338
14 p.
artikel
44 A correction to a result in linear programming Murty, Katta G.
1988
81-90 Index 1 p. 177-180
4 p.
artikel
45 A correspondence between scene analysis and motions of frameworks Whiteley, Walter
1984
81-90 Index 1 p. 269-295
27 p.
artikel
46 A cost-scaling algorithm for 0–1 submodular flows Shigeno, Maiko
1997
81-90 Index 1 p. 261-273
13 p.
artikel
47 Acquisition-extremal graphs LeSaulnier, Timothy D.
2013
81-90 Index 1 p. 1521-1529
9 p.
artikel
48 A cycle augmentation algorithm for minimum cost multicommodity flows on a ring Shepherd, Bruce
2001
81-90 Index 1 p. 301-315
15 p.
artikel
49 Acyclic and star colorings of cographs Lyons, Andrew
2011
81-90 Index 1 p. 1842-1850
9 p.
artikel
50 Acyclic colouring of 1-planar graphs Borodin, O.V.
2001
81-90 Index 1 p. 29-41
13 p.
artikel
51 Acyclic edge coloring of planar graphs with girth at least 5 Hou, Jianfeng
2013
81-90 Index 1 p. 2958-2967
10 p.
artikel
52 Acyclic 4-edge colouring of non-regular subcubic graphs in linear time Lukot’ka, Robert
2014
81-90 Index 1 p. 110-112
3 p.
artikel
53 Adaptive majority problems for restricted query graphs and for weighted sets Damásdi, Gábor

81-90 Index 1 p. 235-245
artikel
54 Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56] Aguilera, Néstor E.
2018
81-90 Index 1 p. 311-315
artikel
55 Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform Dress, A.
2005
81-90 Index 1 p. 51-73
23 p.
artikel
56 A decomposability index in logical analysis of data Ono, Hirotaka
2004
81-90 Index 1 p. 165-180
16 p.
artikel
57 A decomposition of the matroids with the max-flow min-cut property Tseng, F.T.
1986
81-90 Index 1 p. 329-364
36 p.
artikel
58 A distance approximating trees Bálint, Vojtech
2008
81-90 Index 1 p. 2740-2752
13 p.
artikel
59 A distance-labelling problem for hypercubes Zhou, Sanming
2008
81-90 Index 1 p. 2846-2854
artikel
60 Adjacency on combinatorial polyhedra Matsuia, Tomomi
1995
81-90 Index 1 p. 311-321
11 p.
artikel
61 Adjacency on the constrained assignment problem Alfakih, Abdo Y.
1998
81-90 Index 1 p. 269-274
6 p.
artikel
62 Adjacency polynomials of digraph transformations Deng, Aiping
2016
81-90 Index 1 p. 15-38
24 p.
artikel
63 Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs Tian, Shuangliang
2015
81-90 Index 1 p. 220-226
7 p.
artikel
64 Adjoining to ( s , t ) -Wythoff’s game its P -positions as moves Liu, Wen An
2014
81-90 Index 1 p. 28-43
16 p.
artikel
65 A doubly cyclic channel assignment problem McDiarmid, Colin
1997
81-90 Index 1 p. 263-268
6 p.
artikel
66 A doubly nonnegative relaxation for modularity density maximization Izunaga, Yoichi

81-90 Index 1 p. 69-78
artikel
67 A duality theorem for linear congruences Williams, H.P.
1984
81-90 Index 1 p. 93-103
11 p.
artikel
68 A family of efficient six-regular circulants representable as a Kronecker product Jha, Pranava K.
2016
81-90 Index 1 p. 72-84
13 p.
artikel
69 A family of mixed graphs with large order and diameter 2 Araujo-Pardo, G.
2017
81-90 Index 1 p. 57-63
7 p.
artikel
70 A fast algorithm for multiplying min-sum permutations Sakai, Yoshifumi
2011
81-90 Index 1 p. 2175-2183
9 p.
artikel
71 A fast algorithm for strongly correlated knapsack problems Pisinger, David
1998
81-90 Index 1 p. 197-212
16 p.
artikel
72 A fast approximation algorithm for the multicovering problem Hall, Nicholas G.
1986
81-90 Index 1 p. 35-40
6 p.
artikel
73 A faster algorithm for packing branchings in digraphs Lee, Orlando
2015
81-90 Index 1 p. 121-131
11 p.
artikel
74 A faster parameterized algorithm for Pseudoforest Deletion Bodlaender, Hans L.
2018
81-90 Index 1 p. 42-56
artikel
75 A fast parallel algorithm to recognize P4-sparse graphs Lin, Rong
1998
81-90 Index 1 p. 191-215
25 p.
artikel
76 A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows Alix, Munier Kordon

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

81-90 Index 1 p. 141-151
artikel
78 A generalization of Fibonacci and Lucas matrices Stanimirović, Predrag
2008
81-90 Index 1 p. 2606-2619
14 p.
artikel
79 A generalization of Hungarian method and Hall’s theorem with applications in wireless sensor networks Bokal, Drago
2012
81-90 Index 1 p. 460-470
11 p.
artikel
80 A generalization of interval edge-colorings of graphs Petrosyan, P.A.
2010
81-90 Index 1 p. 1827-1837
11 p.
artikel
81 A generalization of Lucas polynomial sequence Cheon, Gi-Sang
2009
81-90 Index 1 p. 920-927
8 p.
artikel
82 A generalization of Opsut’s result on the competition numbers of line graphs Kim, Suh-Ryung
2015
81-90 Index 1 p. 152-159
8 p.
artikel
83 A generalization of Sperner’s theorem and an application to graph orientations Qian, Jianguo
2009
81-90 Index 1 p. 2170-2176
7 p.
artikel
84 A generalization of the binary Preparata code Kuzmin, A.S.
2006
81-90 Index 1 p. 337-345
9 p.
artikel
85 A generalization of the Haemers–Mathon bound for near hexagons De Bruyn, Bart
2019
81-90 Index 1 p. 272-282
artikel
86 Agent-based randomized broadcasting in large networks Elsässer, Robert
2007
81-90 Index 1 p. 150-160
11 p.
artikel
87 A genuinely polynomial primal simplex algorithm for the assignment problem Akgül, Mustafa
1993
81-90 Index 1 p. 93-115
23 p.
artikel
88 Aggregation of nonnegative integer-valued equations Babayev, Djangir A.
1984
81-90 Index 1 p. 125-130
6 p.
artikel
89 A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm Makuracki, Bartosz
2019
81-90 Index 1 p. 25-36
artikel
90 A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints Giaro, K.
2009
81-90 Index 1 p. 3625-3630
6 p.
artikel
91 A graph-theoretic generalization of the Sauer-Shelah lemma Cesa-Bianchi, Nicolò
1998
81-90 Index 1 p. 27-35
9 p.
artikel
92 A graph-theoretic result for a model of neural computation Gerbessiotis, Alexandros V.
1998
81-90 Index 1 p. 257-262
6 p.
artikel
93 A greedy approximation algorithm for the group Steiner problem Chekuri, Chandra
2006
81-90 Index 1 p. 15-34
20 p.
artikel
94 A Hamilton sufficient condition for completely independent spanning tree Hong, Xia

81-90 Index 1 p. 183-187
artikel
95 A heuristic approach for searching ( d , n ) -packing colorings of infinite lattices Korže, Danilo
2019
81-90 Index 1 p. 353-358
artikel
96 A heuristic approach to hard constrained shortest path problems Ribeiro, Celso C.
1985
81-90 Index 1 p. 125-137
13 p.
artikel
97 A heuristic for the p-center problems in graphs Plesník, J.
1987
81-90 Index 1 p. 263-268
6 p.
artikel
98 A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree Averbakh, Igor
1996
81-90 Index 1 p. 17-32
16 p.
artikel
99 A homomorphic characterization of regular languages Culik II, Karel
1982
81-90 Index 1 p. 149-152
4 p.
artikel
100 A hypocoloring model for batch scheduling de Werra, D.
2005
81-90 Index 1 p. 3-26
24 p.
artikel
101 A kind of conditional connectivity of transposition networks generated by k -trees Yang, Weihua
2018
81-90 Index 1 p. 132-138
artikel
102 A large set of non-Hamiltonian graphs Katona, Gyula Y.
2001
81-90 Index 1 p. 99-115
17 p.
artikel
103 Algebraic and topological closure conditions for classes of pseudo-Boolean functions Foldes, Stephan
2009
81-90 Index 1 p. 2818-2827
10 p.
artikel
104 Algebraic structure of quasicyclic codes Lally, Kristine
2001
81-90 Index 1 p. 157-175
19 p.
artikel
105 Algorithmic aspects of open neighborhood location–domination in graphs Panda, B.S.
2017
81-90 Index 1 p. 290-306
17 p.
artikel
106 Algorithmic aspects of the generalized clique-transversal problem on chordal graphs Maw-Shang, Chang
1996
81-90 Index 1 p. 189-203
15 p.
artikel
107 Algorithmic complexity of list colorings Kratochvíl, Jan
1994
81-90 Index 1 p. 297-302
6 p.
artikel
108 Algorithms for finding a Kth best valued assignment Matsui, Tomomi
1994
81-90 Index 1 p. 283-296
14 p.
artikel
109 Algorithms for finding a rooted ( k , 1 ) -edge-connected orientation Király, Csaba
2014
81-90 Index 1 p. 263-268
6 p.
artikel
110 Algorithms for finding K-best perfect matchings Chegireddy, Chandra R.
1987
81-90 Index 1 p. 155-165
11 p.
artikel
111 Algorithms for graphs with small octopus Fomin, Fedor V.
2004
81-90 Index 1 p. 105-128
24 p.
artikel
112 Algorithms for interval catch digraphs Prisner, Erich
1994
81-90 Index 1 p. 147-157
11 p.
artikel
113 Algorithms for the fixed linear crossing number problem Cimikowski, Robert
2002
81-90 Index 1 p. 93-115
23 p.
artikel
114 Algorithms for unipolar and generalized split graphs Eschen, Elaine M.
2014
81-90 Index 1 p. 195-201
7 p.
artikel
115 A linear algorithm for minimum 1-identifying codes in oriented trees Charon, Irène
2006
81-90 Index 1 p. 1246-1253
8 p.
artikel
116 A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs Pandit, Parthe
2018
81-90 Index 1 p. 155-169
artikel
117 A linearization framework for unconstrained quadratic (0-1) problems Gueye, Serigne
2009
81-90 Index 1 p. 1255-1266
12 p.
artikel
118 A linear-programming approach to the generalized Randić index Fischermann, Miranca
2003
81-90 Index 1 p. 375-385
11 p.
artikel
119 A linear-time algorithm for computing the intersection of all odd cycles in a graph Cai, Leizhen
1997
81-90 Index 1 p. 27-34
8 p.
artikel
120 A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph Ihm, Insung
2017
81-90 Index 1 p. 98-112
15 p.
artikel
121 A linear-time algorithm for testing full outer-2-planarity Hong, Seok-Hee
2019
81-90 Index 1 p. 234-257
artikel
122 A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib) Hamiez, Jean-Philippe
2004
81-90 Index 1 p. 252-265
14 p.
artikel
123 Alliance free sets in Cartesian product graphs Yero, Ismael G.
2013
81-90 Index 1 p. 1618-1625
8 p.
artikel
124 Allowable processing orders in the accelerated cascade algorithm Goldman, A.J
1986
81-90 Index 1 p. 213-221
9 p.
artikel
125 Almost empty monochromatic triangles in planar point sets Basu, Deepan
2016
81-90 Index 1 p. 207-213
artikel
126 Almost Hadamard matrices: The case of arbitrary exponents Banica, Teodor
2013
81-90 Index 1 p. 2367-2379
13 p.
artikel
127 A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs Witkowski, Rafał
2014
81-90 Index 1 p. 349-355
7 p.
artikel
128 A lower bound for a constrained quadratic 0–1 minimization problem Billionnet, Alain
1997
81-90 Index 1 p. 135-146
12 p.
artikel
129 A lower bound for radio k -chromatic number Saha, Laxman
2015
81-90 Index 1 p. 87-100
14 p.
artikel
130 A lower-bound for the number of productions required for a certain class of languages Alspach, Brian
1983
81-90 Index 1 p. 109-115
7 p.
artikel
131 A lower bound for the shortness coefficient of a class of graphs Harant, J.
1994
81-90 Index 1 p. 103-105
3 p.
artikel
132 A lower bound of the expected maximum number of edge-disjoint s-t paths on probabilistic graphs Cheng, Peng
1995
81-90 Index 1 p. 137-155
19 p.
artikel
133 A lower bound on the crossing number of uniform hypergraphs Anshu, Anurag
2016
81-90 Index 1 p. 11-15
5 p.
artikel
134 A lower bound on the independence number of a graph in terms of degrees and local clique sizes Brause, C.
2016
81-90 Index 1 p. 59-67
9 p.
artikel
135 Alternative formulations for the obnoxious p-median problem Lin, Chang-Chun

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

81-90 Index 1 p. 201-210
artikel
137 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
81-90 Index 1 p. 357-369
13 p.
artikel
138 A map from the lower-half of the n-cube onto the (n−1)-cube which preserves intersecting antichains Miyakawa, Masahiro
1999
81-90 Index 1 p. 223-228
6 p.
artikel
139 A maxmin problem on finite automata Champarnaud, J.-M.
1989
81-90 Index 1 p. 91-96
6 p.
artikel
140 Amenable colorings Mahadev, N.V.R.
1997
81-90 Index 1 p. 225-238
14 p.
artikel
141 A method for efficiently computing the number of codewords of fixed weights in linear codes Bouyukliev, Iliya
2008
81-90 Index 1 p. 2986-3004
artikel
142 A min-max relation for K 3-covers in graphs noncontractible to K 5 e Mahjoub, Ali Ridha
1995
81-90 Index 1 p. 209-219
11 p.
artikel
143 A min – max relation in flowgraphs and some applications Ferreira, Carlos Eduardo
2018
81-90 Index 1 p. 65-76
artikel
144 A modified greedy algorithm for dispersively weighted 3-set cover Fujito, Toshihiro
2006
81-90 Index 1 p. 1392-1400
9 p.
artikel
145 A Monge property for the d-dimensional transportation problem Bein, Wolfgang W.
1995
81-90 Index 1 p. 97-109
13 p.
artikel
146 A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem Boussier, Sylvain
2010
81-90 Index 1 p. 97-109
13 p.
artikel
147 An adaptive memory algorithm for the k-coloring problem Galinier, Philippe
2008
81-90 Index 1 p. 267-279
13 p.
artikel
148 An algebraic analysis of the connectivity of DeBruijn and shuffle-exchange digraphs Baumslag, Marc
1995
81-90 Index 1 p. 213-227
15 p.
artikel
149 An algebraic and combinatorial approach to the analysis of line drawings of polyhedra Sugihara, Kōkichi
1984
81-90 Index 1 p. 77-104
28 p.
artikel
150 An algorithm for an Eulerian trail traversing specified edges in given order Cai, Mao-Cheng
1994
81-90 Index 1 p. 233-239
7 p.
artikel
151 An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid Morgana, Aurora
2004
81-90 Index 1 p. 225-241
17 p.
artikel
152 An algorithm for finding homogeneous pairs Everett, Hazel
1997
81-90 Index 1 p. 209-218
10 p.
artikel
153 An algorithm for fractional assignment problems Shigeno, Maiko
1995
81-90 Index 1 p. 333-343
11 p.
artikel
154 An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems Komusiewicz, Christian
2015
81-90 Index 1 p. 145-161
17 p.
artikel
155 An algorithmic separating hyperplane theorem and its applications Kalantari, Bahman
2019
81-90 Index 1 p. 59-82
artikel
156 An algorithm to find two distance domination parameters in a graph Fricke, Gerd H.
1996
81-90 Index 1 p. 85-91
7 p.
artikel
157 Analysis of a linear programming heuristic for scheduling unrelated parallel machines Potts, C.N.
1985
81-90 Index 1 p. 155-164
10 p.
artikel
158 Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences Gawiejnowicz, Stanisław
2006
81-90 Index 1 p. 2150-2166
17 p.
artikel
159 Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs Gu, Mei-Mei

81-90 Index 1 p. 80-91
artikel
160 Analyzing quadratic unconstrained binary optimization problems via multicommodity flows Wang, Di
2009
81-90 Index 1 p. 3746-3753
8 p.
artikel
161 An analysis of root functions—A subclass of the Impossible Class of Faulty Functions (ICFF) Pasalic, E.
2017
81-90 Index 1 p. 1-13
13 p.
artikel
162 An analysis of the redundancy of graph invariants used in chemoinformatics Hollas, Boris
2006
81-90 Index 1 p. 2484-2498
15 p.
artikel
163 An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne–Goodman–Hedetniemi algorithm Cooper, Colin
2009
81-90 Index 1 p. 2010-2014
5 p.
artikel
164 An application of the Turán theorem to domination in graphs Shan, Erfang
2008
81-90 Index 1 p. 2712-2718
7 p.
artikel
165 An approximation algorithm for dissecting a rectangle into rectangles with specified areas Nagamochi, Hiroshi
2007
81-90 Index 1 p. 523-537
15 p.
artikel
166 An approximation algorithm for maximum triangle packing Hassin, Refael
2006
81-90 Index 1 p. 971-979
9 p.
artikel
167 An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors Kuroki, Yusuke
2009
81-90 Index 1 p. 2124-2135
12 p.
artikel
168 An approximation algorithm for the Generalized k -Multicut problem Zhang, Peng
2012
81-90 Index 1 p. 1240-1247
8 p.
artikel
169 An approximation algorithm for the longest cycle problem in solid grid graphs Asgharian Sardroud, Asghar
2016
81-90 Index 1 p. 6-12
7 p.
artikel
170 An approximation algorithm for the partial covering 0–1 integer program Takazawa, Yotaro

81-90 Index 1 p. 126-133
artikel
171 An 0.828-approximation algorithm for the uncapacitated facility location problem Ageev, A.A.
1999
81-90 Index 1 p. 149-156
8 p.
artikel
172 An approximation scheme for strip packing of rectangles with bounded dimensions de La Vega, W.Fernandez
1998
81-90 Index 1 p. 93-101
9 p.
artikel
173 An assignment algorithm with applications to integrated circuit layout Atallah, Mikhail J
1986
81-90 Index 1 p. 9-22
14 p.
artikel
174 An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order Sauerhoff, Martin
2010
81-90 Index 1 p. 1195-1204
10 p.
artikel
175 An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications Li, Jianxi
2014
81-90 Index 1 p. 104-115
12 p.
artikel
176 An effective formula for the number of solutions of a system of two 0, 1-equations Buzytsky, P.L.
1983
81-90 Index 1 p. 127-133
7 p.
artikel
177 An efficient algorithm for the parametric resource allocation problem Katoh, Naoki
1985
81-90 Index 1 p. 261-274
14 p.
artikel
178 An efficient condition for a graph to be Hamiltonian Li, Shengjia
2007
81-90 Index 1 p. 1842-1845
4 p.
artikel
179 An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study Gusfield, Dan
2007
81-90 Index 1 p. 806-830
25 p.
artikel
180 An efficient matching algorithm applied in statistical physics Bendisch, J.
1994
81-90 Index 1 p. 139-153
15 p.
artikel
181 An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem Freville, Arnaud
1994
81-90 Index 1 p. 189-212
24 p.
artikel
182 An enumerative algorithm for the frequency assignment problem Mannino, Carlo
2003
81-90 Index 1 p. 155-169
15 p.
artikel
183 A network approach for specially structured linear programs arising in 0–1 quadratic optimization Adams, Warren P.
2008
81-90 Index 1 p. 2142-2165
24 p.
artikel
184 A new algorithmic framework for basic problems on binary images Asano, T.
2017
81-90 Index 1 p. 376-392
17 p.
artikel
185 A new approach to finding the extra connectivity of graphs Zhu, Qiang

81-90 Index 1 p. 265-271
artikel
186 A new characterization of dual bases in finite fields and its applications Cao, Wei
2007
81-90 Index 1 p. 2236-2241
6 p.
artikel
187 A new characterization of matrices with the consecutive ones property Narayanaswamy, N.S.
2009
81-90 Index 1 p. 3721-3727
7 p.
artikel
188 A new class of facets for the Latin square polytope Appa, G.
2006
81-90 Index 1 p. 900-911
12 p.
artikel
189 A new class of nonbinary codes meeting the Griesmer bound Hamada, Noboru
1993
81-90 Index 1 p. 219-226
8 p.
artikel
190 A new construction of broadcast graphs Harutyunyan, Hovhannes A.

81-90 Index 1 p. 144-155
artikel
191 A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs Barth, Dominique
1997
81-90 Index 1 p. 99-118
20 p.
artikel
192 A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities Murthy, Ishwar
2019
81-90 Index 1 p. 119-143
artikel
193 A new family of expansive graphs Matamala, Martín
2008
81-90 Index 1 p. 1125-1131
7 p.
artikel
194 A new generalization of kernels in digraphs Ramoul, Amina
2017
81-90 Index 1 p. 673-684
12 p.
artikel
195 A new Greedoid: the family of local maximum stable sets of a forest Levit, Vadim E.
2002
81-90 Index 1 p. 91-101
11 p.
artikel
196 A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L 1 Seneta, Eugene
1984
81-90 Index 1 p. 79-91
13 p.
artikel
197 A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture Henning, Michael A.
2014
81-90 Index 1 p. 45-52
8 p.
artikel
198 A new measure for comparing biomedical regions of interest in segmentation of digital images Conci, Aura
2015
81-90 Index 1 p. 103-113
11 p.
artikel
199 A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space Prosanov, Roman

81-90 Index 1 p. 115-120
artikel
200 A new proof of Wojcicka's conjecture Chen, Yaojun
2003
81-90 Index 1 p. 545-554
10 p.
artikel
201 A new reduction method in integer programming Greenberg, Harold
1988
81-90 Index 1 p. 169-172
4 p.
artikel
202 A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs Contreras-Balbuena, Alejandro
2017
81-90 Index 1 p. 55-63
9 p.
artikel
203 An exact algorithm for maximum independent set in degree-5 graphs Xiao, Mingyu
2016
81-90 Index 1 p. 137-155
19 p.
artikel
204 An exact algorithm for the bottleneck 2-connected k -Steiner network problem in L p planes Brazil, M.
2016
81-90 Index 1 p. 47-69
23 p.
artikel
205 An exact algorithm for the channel assignment problem Král', Daniel
2005
81-90 Index 1 p. 326-331
6 p.
artikel
206 An exact algorithm for the 0–1 collapsing knapsack problem Fayard, Didier
1994
81-90 Index 1 p. 175-187
13 p.
artikel
207 An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system Boufflet, J.P.
1999
81-90 Index 1 p. 51-76
26 p.
artikel
208 An explicit construction of ( 3 , t ) -existentially closed graphs Vinh, Le Anh
2013
81-90 Index 1 p. 1651-1654
4 p.
artikel
209 An extended abstract of an indepth algorithmic and computational study for maximum flow problems Glover, Fred
1980
81-90 Index 1 p. 251-254
4 p.
artikel
210 An extended result of Kleitman and Saks concerning binary trees Chu Yung-ching,
1985
81-90 Index 1 p. 255-259
5 p.
artikel
211 An extension of A.R. Rao’s characterization of potentially K m + 1 -graphic sequences Yin, Jian-Hua
2013
81-90 Index 1 p. 1118-1127
10 p.
artikel
212 An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications Peng, Yuejian
2016
81-90 Index 1 p. 170-175
6 p.
artikel
213 An extension of the periodicity lemma to longer periods Fraenkel, Aviezri S.
2005
81-90 Index 1 p. 146-155
10 p.
artikel
214 An external memory data structure for shortest path queries Hutchinson, David
2003
81-90 Index 1 p. 55-82
28 p.
artikel
215 An extremal problem on non-full colorable graphs Lu, Changhong
2007
81-90 Index 1 p. 2165-2173
9 p.
artikel
216 An implicit representation of chordal comparability graphs in linear time Curtis, Andrew R.
2010
81-90 Index 1 p. 869-875
7 p.
artikel
217 An improved algorithm to construct edge-independent spanning trees in augmented cubes Cheng, Baolei

81-90 Index 1 p. 55-70
artikel
218 An improved bound for the stepping-up lemma Conlon, David
2013
81-90 Index 1 p. 1191-1196
6 p.
artikel
219 An improved lower bound on the independence number of a graph Henning, Michael A.
2014
81-90 Index 1 p. 120-128
9 p.
artikel
220 An improved on-line algorithm for single parallel-batch machine scheduling with delivery times Tian, Ji
2012
81-90 Index 1 p. 1191-1210
20 p.
artikel
221 An improved randomized approximation algorithm for maximum triangle packing Chen, Zhi-Zhong
2009
81-90 Index 1 p. 1640-1646
7 p.
artikel
222 An improved upper bound for the acyclic chromatic number of 1-planar graphs Yang, Wanshun

81-90 Index 1 p. 275-291
artikel
223 An improved upper bound for the neighbor sum distinguishing index of graphs Wang, Guanghui
2014
81-90 Index 1 p. 126-128
3 p.
artikel
224 An improved upper bound on the double Roman domination number of graphs with minimum degree at least two Khoeilar, Rana
2019
81-90 Index 1 p. 159-167
artikel
225 An improvement on the number of simplices in F q d Pham, Duc Hiep
2017
81-90 Index 1 p. 95-105
11 p.
artikel
226 An inequality for polymatroid functions and its applications Boros, E.
2003
81-90 Index 1 p. 255-281
27 p.
artikel
227 An inequality on global alliances for trees Yu, Alexandria
2015
81-90 Index 1 p. 227-229
3 p.
artikel
228 An infinite class of Z-cyclic whist tournaments on v players, v ≡ 1 (mod 4) Finizio, Norman J.
1996
81-90 Index 1 p. 135-146
12 p.
artikel
229 An infinite family of 2-connected graphs that have reliability factorisations Morgan, Kerri
2017
81-90 Index 1 p. 123-127
5 p.
artikel
230 An infinite family of graphs with a facile count of perfect matchings Rosenfeld, Vladimir R.
2014
81-90 Index 1 p. 210-214
5 p.
artikel
231 An intersection theorem for systems of finite sets Bey, Christian
2017
81-90 Index 1 p. 524-528
5 p.
artikel
232 An O ∗ ( 2 . 61 9 k ) algorithm for 4-Path Vertex Cover Tsur, Dekel

81-90 Index 1 p. 1-14
artikel
233 Anomalous behavior in bin packing algorithms Murgolo, Frank D.
1988
81-90 Index 1 p. 229-243
15 p.
artikel
234 An O(n 2) algorithm for maximum cycle mean of Monge matrices in max-algebra Gavalec, Martin
2003
81-90 Index 1 p. 651-656
6 p.
artikel
235 An O(n 2) algorithm for the maximum cycle mean of an n×n bivalent matrix Butkovic, P.
1992
81-90 Index 1 p. 157-162
6 p.
artikel
236 A nonfactorial algorithm for testing isomorphism of two graphs Goldberg, Mark.K.
1983
81-90 Index 1 p. 229-236
8 p.
artikel
237 An O(nm)-time algorithm for computing the dual of a regular Boolean function Peled, Uri N.
1994
81-90 Index 1 p. 309-323
15 p.
artikel
238 An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees Masuzawa, Toshimitsu
1987
81-90 Index 1 p. 67-105
39 p.
artikel
239 A note on a directed version of the 1-2-3 Conjecture Horňák, Mirko
2018
81-90 Index 1 p. 472-476
artikel
240 A note on adjacent vertex distinguishing colorings of graphs Axenovich, M.
2016
81-90 Index 1 p. 1-7
7 p.
artikel
241 A note on approximating the b -chromatic number Galčík, František
2013
81-90 Index 1 p. 1137-1140
4 p.
artikel
242 A note on 3-bisections in subcubic graphs Cui, Qing

81-90 Index 1 p. 147-152
artikel
243 A note on breaking small automorphisms in graphs Kalinowski, Rafał
2017
81-90 Index 1 p. 221-225
artikel
244 A note on cake cutting Even, S.
1984
81-90 Index 1 p. 285-296
12 p.
artikel
245 A note on collections of graphs with non-surjective lambda labelings Georges, John P.
2005
81-90 Index 1 p. 92-98
7 p.
artikel
246 A note on coloring digraphs of large girth Steiner, Raphael

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

81-90 Index 1 p. 90-94
artikel
248 A note on eigenvalue bounds for independence numbers of non-regular graphs Li, Yusheng
2014
81-90 Index 1 p. 146-149
4 p.
artikel
249 A note on entire choosability of plane graphs Dong, Wei
2012
81-90 Index 1 p. 1257-1261
5 p.
artikel
250 A note on equidistant subspace codes Bartoli, Daniele
2016
81-90 Index 1 p. 291-296
6 p.
artikel
251 A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date” Kianfar, K.
2013
81-90 Index 1 p. 2205-2206
2 p.
artikel
252 A note on generic rigidity of graphs in higher dimension Jordán, Tibor

81-90 Index 1 p. 97-101
artikel
253 A note on graphs with large girth and small minus domination number Lee, Jaeun
1999
81-90 Index 1 p. 299-303
5 p.
artikel
254 A note on list improper coloring of plane graphs Dong, Wei
2009
81-90 Index 1 p. 433-436
4 p.
artikel
255 A note on M-convex functions on jump systems Murota, Kazuo

81-90 Index 1 p. 492-502
artikel
256 A note on orientations of mixed graphs Arkin, Esther M.
2002
81-90 Index 1 p. 271-278
8 p.
artikel
257 A note on partitions of graphs under degree constraints Zu, Chunlei

81-90 Index 1 p. 631-633
artikel
258 A note on perfect Lee-codes over small alphabets Lepistö, Timo
1981
81-90 Index 1 p. 73-74
2 p.
artikel
259 A note on 1-planar graphs Ackerman, Eyal
2014
81-90 Index 1 p. 104-108
5 p.
artikel
260 A note on planar graphs with large width parameters and small grid-minors Grigoriev, Alexander
2012
81-90 Index 1 p. 1262-1269
8 p.
artikel
261 A note on 1-planar graphs with minimum degree 7 Biedl, Therese

81-90 Index 1 p. 230-232
artikel
262 A note on S -packing colorings of lattices Goddard, Wayne
2014
81-90 Index 1 p. 255-262
8 p.
artikel
263 A note on the Clustered Set Covering Problem Alfandari, Laurent
2014
81-90 Index 1 p. 13-19
7 p.
artikel
264 A note on the dispersion of admissible lattices Ullrich, Mario
2019
81-90 Index 1 p. 385-387
artikel
265 A note on the domination dot-critical graphs Chen, Xue-gang
2009
81-90 Index 1 p. 3743-3745
3 p.
artikel
266 A note on the localization number of random graphs: Diameter two case Dudek, Andrzej
2019
81-90 Index 1 p. 107-112
artikel
267 A note on the lower bound of centralized radio broadcasting for planar reachability graphs Galčík, F.
2009
81-90 Index 1 p. 853-857
5 p.
artikel
268 A note on the middle levels problem Gusmão, Andréia C.S.
2016
81-90 Index 1 p. 290-296
artikel
269 A note on the number of perfect matchings of bipartite graphs Fuji, Zhang
1997
81-90 Index 1 p. 275-282
8 p.
artikel
270 A note on the packing chromatic number of lexicographic products Božović, Dragana

81-90 Index 1 p. 34-37
artikel
271 A note on the precedence-constrained class sequencing problem Correa, José R.
2007
81-90 Index 1 p. 257-259
3 p.
artikel
272 A note on the signed edge domination number in graphs Fu, Xueliang
2008
81-90 Index 1 p. 2790-2792
3 p.
artikel
273 A note on the strength and minimum color sum of bipartite graphs Kosowski, Adrian
2009
81-90 Index 1 p. 2552-2554
3 p.
artikel
274 A note on the upper bound and girth pair of ( k ; g ) -cages Balbuena, C.
2013
81-90 Index 1 p. 853-857
5 p.
artikel
275 A note on total domination and 2-rainbow domination in graphs Furuya, Michitaka
2015
81-90 Index 1 p. 229-230
2 p.
artikel
276 A note on α -total domination in cubic graphs Chen, Xue-gang
2017
81-90 Index 1 p. 718-721
4 p.
artikel
277 An out-of-kilter method for the algebraic circulation problem Brucker, P.
1985
81-90 Index 1 p. 1-18
18 p.
artikel
278 An s -strong tournament with s ⩾ 3 has s + 1 vertices whose out-arcs are 4-pancyclic Feng, Jinfeng
2006
81-90 Index 1 p. 2609-2612
4 p.
artikel
279 An s – t connection problem with adaptability Adjiashvili, David
2011
81-90 Index 1 p. 695-705
11 p.
artikel
280 Antibandwidth and cyclic antibandwidth of Hamming graphs Dobrev, Stefan
2013
81-90 Index 1 p. 1402-1408
7 p.
artikel
281 Anticoloring of the rook’s graph Berend, Daniel
2015
81-90 Index 1 p. 1-15
15 p.
artikel
282 Antimagic orientation of lobsters Gao, Yuping

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

81-90 Index 1 p. 163-170
artikel
284 An upper bound for the competition numbers of graphs Kamibeppu, Akira
2010
81-90 Index 1 p. 154-157
4 p.
artikel
285 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
81-90 Index 1 p. 2846-2858
13 p.
artikel
286 An upper bound of Δ ( E ) < 3 ∕ 2 for skiving stock instances of the divisible case Martinovic, J.
2017
81-90 Index 1 p. 161-167
7 p.
artikel
287 An upper bound on the sum of powers of the degrees of simple 1-planar graphs Czap, Július
2014
81-90 Index 1 p. 146-151
6 p.
artikel
288 An upper bound on Wiener Indices of maximal planar graphs Che, Zhongyuan
2019
81-90 Index 1 p. 76-86
artikel
289 A parametric characterization and an ε-approximation scheme for the minimization of a quasiconcave program Katoh, Naoki
1987
81-90 Index 1 p. 39-66
28 p.
artikel
290 A perspective on certain polynomial-time solvable classes of satisfiability Franco, John
2003
81-90 Index 1 p. 177-214
38 p.
artikel
291 APN permutations on Z n and Costas arrays Drakakis, Konstantinos
2009
81-90 Index 1 p. 3320-3326
7 p.
artikel
292 A polyhedral approach for a constrained quadratic 0–1 problem Faye, Alain
2005
81-90 Index 1 p. 87-100
14 p.
artikel
293 A polyhedral study of triplet formulation for single row facility layout problem Sanjeevi, Sujeevraja
2010
81-90 Index 1 p. 1861-1867
7 p.
artikel
294 A polynomial algorithm for minimizing discrete convic functions in fixed dimension Veselov, S.I.

81-90 Index 1 p. 11-19
artikel
295 A polynomial algorithm for weighted scattering number in interval graphs Li, Fengwei
2019
81-90 Index 1 p. 118-124
artikel
296 A polynomial approximation scheme for the subset sum problem Soma, Nei Yoshihiro
1995
81-90 Index 1 p. 243-253
11 p.
artikel
297 A polynomial feasibility test for preemptive periodic scheduling of unrelated processors Bertossi, Alan A.
1985
81-90 Index 1 p. 195-201
7 p.
artikel
298 A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems Ben-Ameur, Walid
2011
81-90 Index 1 p. 1689-1698
10 p.
artikel
299 Approximability of guarding weak visibility polygons Bhattacharya, Pritam
2017
81-90 Index 1 p. 109-129
21 p.
artikel
300 Approximability of the two-stage stochastic knapsack problem with discretely distributed weights Kosuch, Stefanie
2014
81-90 Index 1 p. 192-204
13 p.
artikel
301 Approximate strong equilibria in job scheduling games with two uniformly related machines Epstein, Leah
2013
81-90 Index 1 p. 1843-1858
16 p.
artikel
302 Approximating 2-cliques in unit disk graphs Pattillo, Jeffrey
2014
81-90 Index 1 p. 178-187
10 p.
artikel
303 Approximating maximum uniquely restricted matchings in bipartite graphs Baste, Julien
2019
81-90 Index 1 p. 30-40
artikel
304 Approximating minimum-power edge-covers and 2 , 3 -connectivity Kortsarz, Guy
2009
81-90 Index 1 p. 1840-1847
8 p.
artikel
305 Approximating minimum size {1,2}-connected networks Krysta, Piotr
2003
81-90 Index 1 p. 267-288
22 p.
artikel
306 Approximating reversal distance for strings with bounded number of duplicates Kolman, Petr
2007
81-90 Index 1 p. 327-336
10 p.
artikel
307 Approximating the fixed linear crossing number Cimikowski, Robert
2007
81-90 Index 1 p. 2202-2210
9 p.
artikel
308 Approximating the maximum 2- and 3-edge-colorable subgraph problems Kosowski, Adrian
2009
81-90 Index 1 p. 3593-3600
8 p.
artikel
309 Approximating weighted induced matchings Lin, Min Chih
2018
81-90 Index 1 p. 304-310
artikel
310 Approximation algorithm for minimum connected 3-path vertex cover Liu, Pengcheng

81-90 Index 1 p. 77-84
artikel
311 Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions Elbassioni, Khaled
2017
81-90 Index 1 p. 56-70
15 p.
artikel
312 Approximation algorithms for group prize-collecting and location-routing problems Glicksman, Hagai
2008
81-90 Index 1 p. 3238-3247
10 p.
artikel
313 Approximation algorithms for minimum tree partition Guttmann-Beck, Nili
1998
81-90 Index 1 p. 117-137
21 p.
artikel
314 Approximation algorithms for multi-dimensional assignment problems with decomposable costs Bandelt, Hans-Jürgen
1994
81-90 Index 1 p. 25-50
26 p.
artikel
315 Approximation algorithms for multi-index transportation problems with decomposable costs Queyranne, M.
1997
81-90 Index 1 p. 239-253
15 p.
artikel
316 Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree Ravi, R.
1998
81-90 Index 1 p. 355-366
12 p.
artikel
317 Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 Baburin, A.E.
2009
81-90 Index 1 p. 1988-1992
5 p.
artikel
318 Approximation of the parallel machine scheduling problem with additional unit resources Hebrard, Emmanuel
2016
81-90 Index 1 p. 126-135
10 p.
artikel
319 Approximation schemes for parallel machine scheduling with availability constraints Fu, Bin
2011
81-90 Index 1 p. 1555-1565
11 p.
artikel
320 Approximations of Lovász extensions and their induced interaction index Marichal, Jean-Luc
2008
81-90 Index 1 p. 11-24
14 p.
artikel
321 A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance De Bonis, Annalisa
1998
81-90 Index 1 p. 181-200
20 p.
artikel
322 A primal–dual approximation algorithm for the survivable network design problem in hypergraphs Zhao, Liang
2003
81-90 Index 1 p. 275-289
15 p.
artikel
323 A probabilistic analysis of the multi-period single-sourcing problem Romeijn, H.Edwin
2001
81-90 Index 1 p. 301-328
28 p.
artikel
324 A proof of a conjecture on the Randić index of graphs with given girth Li, Xueliang
2009
81-90 Index 1 p. 3332-3335
4 p.
artikel
325 A proof of Jean de Rumeur's conjecture Perennes, Stéphane
1997
81-90 Index 1 p. 295-299
5 p.
artikel
326 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
81-90 Index 1 p. 608-619
12 p.
artikel
327 A pseudo-Boolean consensus approach to nonlinear 0–1 optimization Simeone, Bruno
2008
81-90 Index 1 p. 2449-2458
10 p.
artikel
328 A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem Ravelo, S.V.
2017
81-90 Index 1 p. 158-175
18 p.
artikel
329 A random polynomial time algorithm for well-rounding convex bodies Faigle, U.
1995
81-90 Index 1 p. 117-144
28 p.
artikel
330 Arboricity: An acyclic hypergraph decomposition problem motivated by database theory Chee, Yeow Meng
2012
81-90 Index 1 p. 100-107
8 p.
artikel
331 Arc-disjoint paths and trees in 2-regular digraphs Bang-Jensen, Jørgen
2013
81-90 Index 1 p. 2724-2730
7 p.
artikel
332 A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions Sherali, Hanif D.
2009
81-90 Index 1 p. 1319-1333
15 p.
artikel
333 A relation between proximity and the third largest distance eigenvalue of a graph Mojallal, Seyed Ahmad

81-90 Index 1 p. 50-58
artikel
334 A representation theorem of the suffixes of characteristic sequences Wai-Fong, Chuan
1998
81-90 Index 1 p. 47-57
11 p.
artikel
335 A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs Bensmail, Julien
2019
81-90 Index 1 p. 31-39
artikel
336 Around the Complete Intersection Theorem Katona, Gyula O.H.
2017
81-90 Index 1 p. 618-621
4 p.
artikel
337 A scheme for the synchronization of variable length codes Perkins, S.
2000
81-90 Index 1 p. 231-245
15 p.
artikel
338 A sharp lower bound of the Randić index of cacti with r pendants Lin, Anhua
2008
81-90 Index 1 p. 1725-1735
11 p.
artikel
339 A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path Choi, Ilkyoo

81-90 Index 1 p. 178-182
artikel
340 A shifting algorithm for constrained min-max partition on trees Agasi, Eliezer
1993
81-90 Index 1 p. 1-28
28 p.
artikel
341 A short constructive proof of A.R. Rao’s characterization of potentially K r + 1 -graphic sequences Yin, Jian-Hua
2012
81-90 Index 1 p. 352-354
3 p.
artikel
342 A simple algorithm to find the steps of double-loop networks Chi-Feng Chan, Robin
2002
81-90 Index 1 p. 61-72
12 p.
artikel
343 A single axiom for Boolean algebras Kwuida, Léonard
2018
81-90 Index 1 p. 85-90
artikel
344 A single-element extension of antimatroids Nakamura, Masataka
2002
81-90 Index 1 p. 159-164
6 p.
artikel
345 A small step forwards on the Erdős–Sós problem concerning the Ramsey numbers R ( 3 , k ) Zhu, Rujie
2016
81-90 Index 1 p. 216-221
6 p.
artikel
346 A solvable case of quadratic 0–1 programming Barahona, Francisco
1986
81-90 Index 1 p. 23-26
4 p.
artikel
347 A solvable class of quadratic 0–1 programming Chakradhar, Srimat T.
1992
81-90 Index 1 p. 233-251
19 p.
artikel
348 A special case for subset interconnection designs Ding-Zhu, Du
1997
81-90 Index 1 p. 51-60
10 p.
artikel
349 A stabilized column generation scheme for the traveling salesman subtour problem Westerlund, Andreas
2006
81-90 Index 1 p. 2212-2238
27 p.
artikel
350 A strongly polynomial algorithm for the inverse shortest arborescence problem Zhiquan, Hu
1998
81-90 Index 1 p. 135-154
20 p.
artikel
351 A structural theorem for planar graphs with some applications Sheng, Huiyu
2011
81-90 Index 1 p. 1183-1187
5 p.
artikel
352 A subspace covering problem in the n -cube Aydinian, Harout
2017
81-90 Index 1 p. 513-517
5 p.
artikel
353 A sufficient condition for all short cycles Brandt, Stephan
1997
81-90 Index 1 p. 63-66
4 p.
artikel
354 A sufficient condition for P k -path graphs being r-connected Balbuena, C.
2007
81-90 Index 1 p. 1745-1751
7 p.
artikel
355 A sufficient condition for polynomial distribution-dependent learnability Anthony, Martin
1997
81-90 Index 1 p. 1-12
12 p.
artikel
356 A sufficient condition to extend polynomial results for the Maximum Independent Set Problem Mosca, Raffaele
2017
81-90 Index 1 p. 281-289
9 p.
artikel
357 A 2 2 3 superstring approximation algorithm Armen, Chris
1998
81-90 Index 1 p. 29-57
29 p.
artikel
358 A survey of very large-scale neighborhood search techniques Ahuja, Ravindra K.
2002
81-90 Index 1 p. 75-102
28 p.
artikel
359 Asymptotically optimal gossiping in radio networks Ravishankar, Krishnamurthi
1995
81-90 Index 1 p. 61-82
22 p.
artikel
360 Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs Maurer, Ueli M.
1992
81-90 Index 1 p. 421-436
16 p.
artikel
361 Asymptotic results on weakly increasing subsequences in random words Işlak, Ümi̇t
2018
81-90 Index 1 p. 171-189
artikel
362 Asymptotic surviving rate of trees with multiple fire sources Costa, Vitor
2015
81-90 Index 1 p. 14-19
6 p.
artikel
363 A ternary search problem on two disjoint sets Li, Shengjia
2018
81-90 Index 1 p. 221-235
artikel
364 A tight analysis of the Submodular–Supermodular Procedure Byrnes, Kevin M.
2015
81-90 Index 1 p. 275-282
8 p.
artikel
365 A tight axiomatization of the median procedure on median graphs Mulder, Henry Martyn
2013
81-90 Index 1 p. 838-846
9 p.
artikel
366 A tight bound for 3-partitioning Kellerer, Hans

81-90 Index 1 p. 249-259
artikel
367 A tight bound on the number of mobile servers to guarantee transferability among dominating configurations Fujita, Satoshi
2010
81-90 Index 1 p. 913-920
8 p.
artikel
368 A tight upper bound for group testing in graphs Damaschke, Peter
1994
81-90 Index 1 p. 101-109
9 p.
artikel
369 A tight upper bound for 2-rainbow domination in generalized Petersen graphs Wang, Yue-Li
2013
81-90 Index 1 p. 2178-2188
11 p.
artikel
370 Atom-bond connectivity index of graphs Das, Kinkar Ch.
2010
81-90 Index 1 p. 1181-1188
8 p.
artikel
371 A type-B Tamari poset Sandman, Nirit
2004
81-90 Index 1 p. 110-122
13 p.
artikel
372 A unified approach to polynomially solvable cases of integer “non-separable” quadratic optimization Baldick, Ross
1995
81-90 Index 1 p. 195-212
18 p.
artikel
373 Author index 2003
81-90 Index 1 p. I-II
nvt p.
artikel
374 Author index 1994
81-90 Index 1 p. 305-306
2 p.
artikel
375 Author index 1998
81-90 Index 1 p. 397-398
2 p.
artikel
376 Author index 1997
81-90 Index 1 p. 255-
1 p.
artikel
377 Author index 1999
81-90 Index 1 p. 257-
1 p.
artikel
378 Author index 1984
81-90 Index 1 p. 307-308
2 p.
artikel
379 Author index 1988
81-90 Index 1 p. 269-
1 p.
artikel
380 Author index (last vol./issue) 2003
81-90 Index 1 p. 691-693
3 p.
artikel
381 Author index to volume 2003
81-90 Index 1 p. 691-693
3 p.
artikel
382 Author Index to Volume 113 (2001) 2001
81-90 Index 1 p. 343-344
2 p.
artikel
383 Automatic complexity of Fibonacci and Tribonacci words Kjos-Hanssen, Bjørn

81-90 Index 1 p. 446-454
artikel
384 Autotopism stabilized colouring games on rook’s graphs Falcón, Raúl M.
2019
81-90 Index 1 p. 200-212
artikel
385 AVD-total-chromatic number of some families of graphs with Δ ( G ) = 3 Luiz, Atílio G.
2017
81-90 Index 1 p. 628-638
11 p.
artikel
386 A vector exchange property of submodular systems Faigle, Ulrich
1984
81-90 Index 1 p. 209-211
3 p.
artikel
387 Average case complexity for finite Boolean functions Chashkin, A.V.
2001
81-90 Index 1 p. 43-59
17 p.
artikel
388 Average distances and distance domination numbers Tian, Fang
2009
81-90 Index 1 p. 1113-1127
15 p.
artikel
389 Average stretch analysis of compact routing schemes Eilam, Tamar
2007
81-90 Index 1 p. 598-610
13 p.
artikel
390 A Vizing-type result for semi-total domination Asplund, John
2019
81-90 Index 1 p. 8-12
artikel
391 b9000A 1 4 approximate algorithm for P2/tree/Cmax Gallo, Giorgio
1997
81-90 Index 1 p. 85-98
14 p.
artikel
392 Backbone colorings of graphs with bounded degree Miškuf, Jozef
2010
81-90 Index 1 p. 534-542
9 p.
artikel
393 Badly-covered graphs Cappelle, Márcia R.
2015
81-90 Index 1 p. 99-103
5 p.
artikel
394 Balanced and 1-balanced graph constructions Hobbs, Arthur M.
2010
81-90 Index 1 p. 1511-1523
13 p.
artikel
395 Balanced decomposition of a vertex-colored graph Fujita, Shinya
2008
81-90 Index 1 p. 3339-3344
6 p.
artikel
396 Balanced k -decompositions of graphs Hsu, Hsiang-Chun
2012
81-90 Index 1 p. 1639-1642
4 p.
artikel
397 Balancing signed graphs Akiyama, J.
1981
81-90 Index 1 p. 227-233
7 p.
artikel
398 Bandwidth and distortion revisited Cygan, Marek
2012
81-90 Index 1 p. 494-504
11 p.
artikel
399 Bandwidth of the product of paths of the same length Billera, Louis J.
2013
81-90 Index 1 p. 3080-3086
7 p.
artikel
400 Batch scheduling in a two-machine flow shop with limited buffer Agnetis, A.
1997
81-90 Index 1 p. 243-260
18 p.
artikel
401 b -chromatic numbers of powers of paths and cycles Lin, Wu-Hsiung
2013
81-90 Index 1 p. 2532-2536
5 p.
artikel
402 b -coloring of Kneser graphs Balakrishnan, R.
2012
81-90 Index 1 p. 9-14
6 p.
artikel
403 b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture Lin, Wu-Hsiung
2013
81-90 Index 1 p. 1060-1066
7 p.
artikel
404 b -coloring of tight graphs Havet, Frédéric
2012
81-90 Index 1 p. 2709-2715
7 p.
artikel
405 Bell polynomials and k -generalized Dyck paths Mansour, Toufik
2008
81-90 Index 1 p. 2279-2292
14 p.
artikel
406 Bernoulli matrix and its algebraic properties Zhang, Zhizheng
2006
81-90 Index 1 p. 1622-1632
11 p.
artikel
407 Best monotone degree conditions for binding number and cycle structure Bauer, D.
2015
81-90 Index 1 p. 8-17
10 p.
artikel
408 Best reduction of the quadratic semi-assignment problem Billionnet, Alain
2001
81-90 Index 1 p. 197-213
17 p.
artikel
409 Best semi-online algorithms for unbounded parallel batch scheduling Yuan, Jinjiang
2011
81-90 Index 1 p. 838-847
10 p.
artikel
410 Better approximations of non-Hamiltonian graphs Iwama, Kazuo
1998
81-90 Index 1 p. 239-261
23 p.
artikel
411 Better bounds for perpetual gossiping Scott, A.D.
1997
81-90 Index 1 p. 189-197
9 p.
artikel
412 Bichain graphs: Geometric model and universal graphs Brignall, Robert
2016
81-90 Index 1 p. 16-29
14 p.
artikel
413 Bichromatic P 4-composition schemes for perfect orderability Hayward, R.B.
2004
81-90 Index 1 p. 161-183
23 p.
artikel
414 Biclique-colouring verification complexity and biclique-colouring power graphs Macêdo Filho, H.B.
2015
81-90 Index 1 p. 65-76
12 p.
artikel
415 Biclique graphs of interval bigraphs Cruz, E.P.

81-90 Index 1 p. 134-143
artikel
416 Biconvex graphs: ordering and algorithms Abbas, Nesrine
2000
81-90 Index 1 p. 1-19
19 p.
artikel
417 Bicyclic graphs with maximal revised Szeged index Li, Xueliang
2013
81-90 Index 1 p. 2527-2531
5 p.
artikel
418 Bicyclic signed graphs with at most one odd cycle and maximal energy Wang, Dijian
2019
81-90 Index 1 p. 244-255
artikel
419 Bigraphic pairs with an A -connected realization Guan, Jing-Xin
2018
81-90 Index 1 p. 75-81
artikel
420 Bijective counting of humps and peaks in ( k , a ) -paths Yan, Sherry H.F.
2015
81-90 Index 1 p. 208-212
5 p.
artikel
421 Binary templates for comma-free DNA codes King, Oliver D.
2007
81-90 Index 1 p. 831-839
9 p.
artikel
422 Bin covering with cardinality constraints Epstein, Leah
2013
81-90 Index 1 p. 1975-1987
13 p.
artikel
423 Bin-packing and matchings in threshold graphs Tinhofer, G.
1995
81-90 Index 1 p. 279-289
11 p.
artikel
424 Bipartite finite Toeplitz graphs Nicoloso, Sara
2014
81-90 Index 1 p. 233-244
12 p.
artikel
425 Bipartite graphs and digraphs with maximum connectivity Fàbrega, J.
1996
81-90 Index 1 p. 271-279
9 p.
artikel
426 Bipartite permutation graphs with application to the minimum buffer size problem Lai, Ten-Hwang
1997
81-90 Index 1 p. 33-55
23 p.
artikel
427 Bipartite Ramsey numbers of paths for random graphs Liu, Meng
2019
81-90 Index 1 p. 171-174
artikel
428 Bipartition constrained edge-splitting in directed graphs Gabow, Harold N.
2001
81-90 Index 1 p. 49-62
14 p.
artikel
429 Bisecting a 4-connected graph with three resource sets Ishii, Toshimasa
2007
81-90 Index 1 p. 1441-1450
10 p.
artikel
430 Bisecting and D -secting families for set systems Balachandran, Niranjan

81-90 Index 1 p. 2-13
artikel
431 2-bisections in claw-free cubic multigraphs Cui, Qing
2019
81-90 Index 1 p. 325-330
artikel
432 Bisections of graphs without K 2 , l Jin, Jing
2019
81-90 Index 1 p. 112-118
artikel
433 Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3) De Bruyn, Bart
2019
81-90 Index 1 p. 121-129
artikel
434 Block linear majorants in quadratic 0–1 optimization Boros, Endre
2004
81-90 Index 1 p. 52-71
20 p.
artikel
435 Bondage number of the strong product of two trees Zhao, Weisheng
2017
81-90 Index 1 p. 133-145
13 p.
artikel
436 Bond graphs III: Bond graphs and electrical networks Lamb, J.D.
1997
81-90 Index 1 p. 211-250
40 p.
artikel
437 Book announcement 1980
81-90 Index 1 p. 85-87
3 p.
artikel
438 Book announcements 1994
81-90 Index 1 p. 303-305
3 p.
artikel
439 Book drawings of complete bipartite graphs de Klerk, Etienne
2014
81-90 Index 1 p. 80-93
14 p.
artikel
440 Boolean functions optimizing most of the cryptographic criteria Tu, Ziran
2012
81-90 Index 1 p. 427-435
9 p.
artikel
441 Bounded discrete representations of interval orders Isaak, Garth
1993
81-90 Index 1 p. 157-183
27 p.
artikel
442 Bounded edge-connectivity and edge-persistence of Cartesian product of graphs Lu, You
2009
81-90 Index 1 p. 3249-3257
9 p.
artikel
443 Bounding the number of k-faces in arrangements of hyperplanes Fukuda, Komei
1991
81-90 Index 1 p. 151-165
15 p.
artikel
444 Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes Li, Hao
2013
81-90 Index 1 p. 2753-2757
5 p.
artikel
445 Bounds for the energy of weighted graphs Ganie, Hilal A.
2019
81-90 Index 1 p. 91-101
artikel
446 Bounds for the probability of union of events following monotonic distribution Kumaran, V.
2017
81-90 Index 1 p. 98-119
22 p.
artikel
447 Bounds on certain multiplications of affine combinations Boyar, Joan
1994
81-90 Index 1 p. 155-167
13 p.
artikel
448 Bounds on neighborhood total domination in graphs Henning, Michael A.
2013
81-90 Index 1 p. 2460-2466
7 p.
artikel
449 Bounds on the burning number Bessy, Stéphane
2018
81-90 Index 1 p. 16-22
artikel
450 Bounds on the differentiating-total domination number of a tree Ning, Wenjie
2016
81-90 Index 1 p. 153-160
8 p.
artikel
451 Bounds on the index of the signless Laplacian of a graph Oliveira, Carla Silva
2010
81-90 Index 1 p. 355-360
6 p.
artikel
452 Bounds on the locating-total domination number of a tree Chen, Xue-gang
2011
81-90 Index 1 p. 769-773
5 p.
artikel
453 Bounds relating the weakly connected domination number to the total domination number and the matching number Hattingh, Johannes H.
2009
81-90 Index 1 p. 3086-3093
8 p.
artikel
454 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
81-90 Index 1 p. 352-367
16 p.
artikel
455 Broadcast and gossip in line-communication mode Laforest, C.
1997
81-90 Index 1 p. 161-176
16 p.
artikel
456 Broadcasting and spanning trees in de Bruijn and Kautz networks Heydemann, M.C.
1992
81-90 Index 1 p. 297-317
21 p.
artikel
457 Broadcasting in butterfly and deBruijn networks Klasing, Ralf
1994
81-90 Index 1 p. 183-197
15 p.
artikel
458 Broadcasting in one dimension Hell, Pavol
1988
81-90 Index 1 p. 101-111
11 p.
artikel
459 Broadcasting in random graphs Gerbessiotis, Alexandros V.
1994
81-90 Index 1 p. 149-170
22 p.
artikel
460 Broadcasting multiple messages in simultaneous send/receive systems Bar-Noy, Amotz
1994
81-90 Index 1 p. 95-105
11 p.
artikel
461 Broadcasting on [0, L] Ravishankar, Krishnamurthi
1994
81-90 Index 1 p. 299-319
21 p.
artikel
462 Broadcasting secure messages via optimal independent spanning trees in folded hypercubes Yang, Jinn-Shyong
2011
81-90 Index 1 p. 1254-1263
10 p.
artikel
463 Broadcasting with linearly bounded transmission faults Ga̧sieniec, L.
1998
81-90 Index 1 p. 121-133
13 p.
artikel
464 Broadcasts in graphs Dunbar, Jean E.
2006
81-90 Index 1 p. 59-75
17 p.
artikel
465 Brush your trees! Penso, L.D.
2015
81-90 Index 1 p. 167-170
4 p.
artikel
466 Bundling all shortest paths Dębski, Michał

81-90 Index 1 p. 82-91
artikel
467 Calculating the extremal number ex ( v ; { C 3 , C 4 , … , C n } ) Tang, Jianmin
2009
81-90 Index 1 p. 2198-2206
9 p.
artikel
468 Capacitated discrete unit disk cover Mishra, Pawan K.

81-90 Index 1 p. 242-251
artikel
469 Capacity restricted optimal pebbling in graphs Shiue, Chin-Lin
2019
81-90 Index 1 p. 284-288
artikel
470 Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three Andreae, Thomas
1997
81-90 Index 1 p. 3-34
32 p.
artikel
471 Cayley graphs of diameter two and any degree with order half of the Moore bound Abas, Marcel
2014
81-90 Index 1 p. 1-7
7 p.
artikel
472 Cellular telephone networks and random maps in hypergraphs Halpert, Ariel
2000
81-90 Index 1 p. 111-126
16 p.
artikel
473 Center location problems on tree graphs with subtree-shaped customers Puerto, J.
2008
81-90 Index 1 p. 2890-2910
artikel
474 Certain Boolean equations Banković, D.
1992
81-90 Index 1 p. 21-27
7 p.
artikel
475 Certifying coloring algorithms for graphs without long induced paths Kamiński, Marcin
2019
81-90 Index 1 p. 258-267
artikel
476 Chain homotopies for object topological representations González-Díaz, R.
2009
81-90 Index 1 p. 490-499
10 p.
artikel
477 Channel assignment problem and relaxed 2-distant coloring of graphs Lin, Wensong

81-90 Index 1 p. 231-244
artikel
478 Characterising ( k , ℓ ) -leaf powers Brandstädt, Andreas
2010
81-90 Index 1 p. 110-122
13 p.
artikel
479 Characterization and recognition of generalized clique-Helly graphs Dourado, Mitre C.
2007
81-90 Index 1 p. 2435-2443
9 p.
artikel
480 Characterization of classical graph classes by weighted clique graphs Bonomo, Flavia
2014
81-90 Index 1 p. 83-95
13 p.
artikel
481 Characterization of color patterns by dynamic H -paths Benítez-Bobadilla, Germán
2019
81-90 Index 1 p. 41-51
artikel
482 Characterization of common-edge sigraph Sinha, Deepa
2013
81-90 Index 1 p. 1275-1285
11 p.
artikel
483 Characterization of double domination subdivision number of trees Atapour, M.
2007
81-90 Index 1 p. 1700-1707
8 p.
artikel
484 Characterization of facets of the hop constrained chain polytope via dynamic programming Grötschel, Martin
2014
81-90 Index 1 p. 229-246
18 p.
artikel
485 Characterization of forbidden subgraphs for the existence of even factors in a graph Xiong, Liming
2017
81-90 Index 1 p. 135-139
5 p.
artikel
486 Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Taranenko, Andrej
2008
81-90 Index 1 p. 1711-1724
14 p.
artikel
487 Characterization of the inverse of a particular circulant matrix by means of a continued fraction Marrazzini, C.
1980
81-90 Index 1 p. 163-165
3 p.
artikel
488 Characterizations and algorithmic applications of chordal graph embeddings Parra, Andreas
1997
81-90 Index 1 p. 171-188
18 p.
artikel
489 Characterizations of cographs as intersection graphs of paths on a grid Cohen, Elad
2014
81-90 Index 1 p. 46-57
12 p.
artikel
490 Characterizations of ( 4 K 1 , C 4 , C 5 )-free graphs Fraser, Dallas J.
2017
81-90 Index 1 p. 166-174
9 p.
artikel
491 Characterizations of maximum fractional ( g , f ) -factors of graphs Liu, Guizhen
2008
81-90 Index 1 p. 2293-2299
7 p.
artikel
492 Characterizations, probe and sandwich problems on ( k , ℓ ) -cographs Couto, Fernanda

81-90 Index 1 p. 118-133
artikel
493 Characterizing and computing minimal cograph completions Lokshtanov, Daniel
2010
81-90 Index 1 p. 755-764
10 p.
artikel
494 Characterizing and computing the structure of clique intersections in strongly chordal graphs Nevries, Ragnar
2015
81-90 Index 1 p. 221-234
14 p.
artikel
495 Characterizing graphs of small carving-width Belmonte, Rémy
2013
81-90 Index 1 p. 1888-1893
6 p.
artikel
496 Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs Gurvich, Vladimir
2012
81-90 Index 1 p. 1742-1756
15 p.
artikel
497 Chasing robbers on random geometric graphs—An alternative approach Alon, Noga
2014
81-90 Index 1 p. 149-152
4 p.
artikel
498 (3, 1)-Choosability of toroidal graphs with some forbidden short cycles Jing, Yubo
2015
81-90 Index 1 p. 243-247
5 p.
artikel
499 Chvátal–Gomory cuts for the Steiner tree problem Gaul, Daniela

81-90 Index 1 p. 188-200
artikel
500 Circular backbone colorings: On matching and tree backbones of planar graphs Araujo, J.
2018
81-90 Index 1 p. 69-82
artikel
501 (Circular) backbone colouring: Forest backbones in planar graphs Havet, Frédéric
2014
81-90 Index 1 p. 119-134
16 p.
artikel
502 Circular permutation graph family with applications Lou, R.D.
1992
81-90 Index 1 p. 433-457
25 p.
artikel
503 Classes of uniformly most reliable graphs for all-terminal reliability Archer, Kassie
2019
81-90 Index 1 p. 12-29
artikel
504 Classification and generation of nanocones Brinkmann, Gunnar
2011
81-90 Index 1 p. 1528-1539
12 p.
artikel
505 Classification by polynomial surfaces Anthony, Martin
1995
81-90 Index 1 p. 91-103
13 p.
artikel
506 Classification of normalized cluster methods in an order theoretic model Baulieu, Forrest B.
1991
81-90 Index 1 p. 1-29
29 p.
artikel
507 Classification of P k2 Miyakawa, Masahiro
1989
81-90 Index 1 p. 179-192
14 p.
artikel
508 Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs Chudnovsky, Maria
2011
81-90 Index 1 p. 1971-1995
25 p.
artikel
509 Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures Chudnovsky, Maria
2011
81-90 Index 1 p. 1996-2029
34 p.
artikel
510 clever or smart: Strategies for the online target date assignment problem Gassner, Elisabeth
2010
81-90 Index 1 p. 71-79
9 p.
artikel
511 Clin d'oeil on L 1-embeddable planar graphs Chepoi, Victor
1997
81-90 Index 1 p. 3-19
17 p.
artikel
512 2 -clique-bond of stable set polyhedra Galluccio, Anna
2013
81-90 Index 1 p. 1988-2000
13 p.
artikel
513 Clique cover products and unimodality of independence polynomials Zhu, Bao-Xuan
2016
81-90 Index 1 p. 172-180
9 p.
artikel
514 Clique-critical graphs: Maximum size and recognition Alcón, Liliana
2006
81-90 Index 1 p. 1799-1802
4 p.
artikel
515 Clique family inequalities for the stable set polytope of quasi-line graphs Oriolo, G.
2003
81-90 Index 1 p. 185-201
17 p.
artikel
516 Closed-form formulas for the Zhang–Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations Chou, Chien-Pin
2016
81-90 Index 1 p. 101-108
8 p.
artikel
517 Close-to-optimal and near-optimal broadcasting in random graphs Gerbessiotis, Alexandros V.
1995
81-90 Index 1 p. 129-150
22 p.
artikel
518 Cluster connectivity of hypercube-based networks under the super fault-tolerance condition Kung, Tzu-Liang

81-90 Index 1 p. 143-156
artikel
519 Codes from lattice and related graphs, and permutation decoding Key, J.D.
2010
81-90 Index 1 p. 1807-1815
9 p.
artikel
520 Coding for a multiple access OR channel: A survey Győri, Sándor
2008
81-90 Index 1 p. 1407-1430
24 p.
artikel
521 Coding for write-unidirectional memories and conflict resolution Cohen, Gérard
1989
81-90 Index 1 p. 103-114
12 p.
artikel
522 Collapsible graphs and Hamilton cycles of line graphs Li, Xiangwen
2015
81-90 Index 1 p. 132-142
11 p.
artikel
523 Collapsible graphs and Hamiltonian connectedness of line graphs Yang, Weihua
2012
81-90 Index 1 p. 1837-1844
8 p.
artikel
524 3-Colorability ∈P for P 6-free graphs Randerath, Bert
2004
81-90 Index 1 p. 299-313
15 p.
artikel
525 Color-blind index in graphs of very low degree Diemunsch, Jennifer
2017
81-90 Index 1 p. 122-129
8 p.
artikel
526 Colorful edge decomposition of graphs: Some polynomial cases Dehghan, Ali
2017
81-90 Index 1 p. 155-165
11 p.
artikel
527 Colorful linear programming, Nash equilibrium, and pivots Meunier, Frédéric
2018
81-90 Index 1 p. 78-91
artikel
528 Coloring copoints of a planar point set Morris, Walter
2006
81-90 Index 1 p. 1742-1752
11 p.
artikel
529 Coloring edges of self-complementary graphs Wojda, A.Paweł
1997
81-90 Index 1 p. 279-284
6 p.
artikel
530 Coloring graphs without short cycles and long induced paths Golovach, Petr A.
2014
81-90 Index 1 p. 107-120
14 p.
artikel
531 Coloring squares of graphs with mad constraints Hocquard, Hervé
2019
81-90 Index 1 p. 64-73
artikel
532 Coloring the square of a sparse graph G with almost Δ ( G ) colors Yancey, Matthew P.
2016
81-90 Index 1 p. 211-215
5 p.
artikel
533 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
81-90 Index 1 p. 170-176
7 p.
artikel
534 3-color Schur numbers Boza, L.
2019
81-90 Index 1 p. 59-68
artikel
535 Color spanning objects: Algorithms and hardness results Banerjee, Sandip

81-90 Index 1 p. 14-22
artikel
536 Combinatorial algorithms on a class of graphs Korneyenko, N.M.
1994
81-90 Index 1 p. 215-217
3 p.
artikel
537 Combinatorial dynamical system theory: General framework and controllability criteria Murota, Kazuo
1988
81-90 Index 1 p. 241-265
25 p.
artikel
538 Combinatorial problems on series-parallel graphs Takamizawa, K.
1981
81-90 Index 1 p. 75-76
2 p.
artikel
539 Comments on “A Hamilton sufficient condition for completely independent spanning tree” Qin, Xiao-Wen

81-90 Index 1 p. 730-733
artikel
540 Communication complexity of two decision problems Björner, Anders
1992
81-90 Index 1 p. 161-163
3 p.
artikel
541 Communication in m-connected graphs Idzik, Adam
1990
81-90 Index 1 p. 297-301
5 p.
artikel
542 Compact MILP models for optimal and Pareto-optimal LAD patterns Guo, Cui
2012
81-90 Index 1 p. 2339-2348
10 p.
artikel
543 Comparing the power of cops to zombies in pursuit-evasion games Offner, David
2019
81-90 Index 1 p. 144-151
artikel
544 Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees Sun, Lingli
2009
81-90 Index 1 p. 1650-1654
5 p.
artikel
545 Comparing Zagreb indices for connected graphs Horoldagva, Batmend
2010
81-90 Index 1 p. 1073-1078
6 p.
artikel
546 Comparison between the Szeged index and the eccentric connectivity index Das, Kinkar Ch.
2015
81-90 Index 1 p. 74-86
13 p.
artikel
547 Comparison of column generation models for channel assignment in cellular networks Jaumard, Brigitte
2001
81-90 Index 1 p. 217-240
24 p.
artikel
548 Comparison of permanental bounds of (0, 1)-matrices Hwang, Suk-Geun
1998
81-90 Index 1 p. 133-144
12 p.
artikel
549 Compatible Euler tours of Kn ∗∗ Verrall, H.
1998
81-90 Index 1 p. 237-251
15 p.
artikel
550 Competition numbers of complete r -partite graphs Li, Bo-Jr
2012
81-90 Index 1 p. 2271-2276
6 p.
artikel
551 Competitive algorithms for the bicriteria k -server problem Flammini, Michele
2006
81-90 Index 1 p. 2117-2127
11 p.
artikel
552 Complementary cycles in almost regular multipartite tournaments, where one cycle has length four Volkmann, Lutz
2013
81-90 Index 1 p. 2169-2177
9 p.
artikel
553 Complete characterization of graphs for direct comparing Zagreb indices Horoldagva, Batmend
2016
81-90 Index 1 p. 146-154
9 p.
artikel
554 Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 Dür, Arne
1991
81-90 Index 1 p. 95-107
13 p.
artikel
555 Completely independent spanning trees in some regular graphs Darties, Benoit
2017
81-90 Index 1 p. 163-174
12 p.
artikel
556 Completely unimodal numberings of a simple polytope Williamson Hoke, Kathy
1988
81-90 Index 1 p. 69-81
13 p.
artikel
557 Complete split graph determined by its (signless) Laplacian spectrum Das, Kinkar Ch.
2016
81-90 Index 1 p. 45-51
7 p.
artikel
558 Complete subgraphs in connected graphs and its application to spectral moment Fang, Longfei

81-90 Index 1 p. 36-42
artikel
559 Complexity analysis of job-shop scheduling with deteriorating jobs Mosheiov, Gur
2002
81-90 Index 1 p. 195-209
15 p.
artikel
560 Complexity and approximations for submodular minimization problems on two variables per inequality constraints Hochbaum, Dorit S.
2018
81-90 Index 1 p. 252-261
artikel
561 Complexity aspects of ℓ -chord convexities Dourado, Mitre C.

81-90 Index 1 p. 585-591
artikel
562 Complexity aspects of the triangle path convexity Dourado, Mitre C.
2016
81-90 Index 1 p. 39-47
9 p.
artikel
563 Complexity issues for the sandwich homogeneous set problem Durand, Arnaud
2011
81-90 Index 1 p. 574-580
7 p.
artikel
564 Complexity of coloring graphs without paths and cycles Hell, Pavol
2017
81-90 Index 1 p. 211-232
22 p.
artikel
565 Complexity of finding dense subgraphs Asahiro, Yuichi
2002
81-90 Index 1 p. 15-26
12 p.
artikel
566 Complexity of independency and cliquy trees Casel, Katrin

81-90 Index 1 p. 2-15
artikel
567 Complexity of planar signed graph homomorphisms to cycles Dross, François

81-90 Index 1 p. 166-178
artikel
568 Complexity of ( p , 1 ) -total labelling Havet, Frédéric
2009
81-90 Index 1 p. 2859-2870
12 p.
artikel
569 Complexity of total outer-connected domination problem in graphs Panda, B.S.
2016
81-90 Index 1 p. 110-122
13 p.
artikel
570 Complexity of tree homomorphisms Hell, P.
1996
81-90 Index 1 p. 23-36
14 p.
artikel
571 Complexity results in graph reconstruction Hemaspaandra, Edith
2007
81-90 Index 1 p. 103-118
16 p.
artikel
572 Comportement periodique des fonctions a seuil binaires et applications Goles, E.
1981
81-90 Index 1 p. 93-105
13 p.
artikel
573 Compositional complexity of Boolean functions Abelson, Harold
1982
81-90 Index 1 p. 1-10
10 p.
artikel
574 Computational complexity of distance edge labeling Knop, Dušan
2018
81-90 Index 1 p. 80-98
artikel
575 Computational complexity of minimum P 4 vertex cover problem for regular and K 1 , 4 -free graphs Safina Devi, N.
2015
81-90 Index 1 p. 114-121
8 p.
artikel
576 Computational determination of the largest lattice polytope diameter Chadder, Nathan

81-90 Index 1 p. 106-110
artikel
577 Computation of Boolean functions by randomized programs Chashkin, A.V.
2004
81-90 Index 1 p. 65-82
18 p.
artikel
578 Computing branchwidth via efficient triangulations and blocks Fomin, Fedor V.
2009
81-90 Index 1 p. 2726-2736
11 p.
artikel
579 Computing covers using prefix tables Alatabbi, Ali
2016
81-90 Index 1 p. 2-9
8 p.
artikel
580 Computing Prüfer codes efficiently in parallel Greenlaw, Raymond
2000
81-90 Index 1 p. 205-222
18 p.
artikel
581 Computing solutions to the congruence 1 n + 2 n + ⋯ + n n ≡ p ( mod n ) Alekseyev, Max A.

81-90 Index 1 p. 3-9
artikel
582 Computing the boxicity of a graph by covering its complement by cointerval graphs Cozzens, Margaret B.
1983
81-90 Index 1 p. 217-228
12 p.
artikel
583 Computing the coarseness with strips or boxes Díaz-Báñez, J.M.
2017
81-90 Index 1 p. 80-90
11 p.
artikel
584 Computing the minimum DNF representation of Boolean functions defined by intervals Schieber, Baruch
2005
81-90 Index 1 p. 154-173
20 p.
artikel
585 Computing the number of cubic runs in standard Sturmian words Piątkowski, Marcin
2014
81-90 Index 1 p. 361-372
12 p.
artikel
586 Computing the permanental polynomials of bipartite graphs by Pfaffian orientation Zhang, Heping
2012
81-90 Index 1 p. 2069-2074
6 p.
artikel
587 Concurrency measure in commutation monoids Saheb, N.
1989
81-90 Index 1 p. 223-236
14 p.
artikel
588 Conditional connectivity of folded hypercubes Zhao, Shuli
2019
81-90 Index 1 p. 388-392
artikel
589 Conditional diagnosability of multiprocessor systems based on complete-transposition graphs Xu, Liqiong

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

81-90 Index 1 p. 165-179
artikel
591 Conditional matching preclusion for regular bipartite graphs and their Cartesian product Lin, Ruizhi

81-90 Index 1 p. 17-25
artikel
592 Condorcet proportions and Kelly's conjectures Fishburn, Peter C.
1979
81-90 Index 1 p. 229-252
24 p.
artikel
593 Conflict-directed A* and its role in model-based embedded systems Williams, Brian C.
2007
81-90 Index 1 p. 1562-1595
34 p.
artikel
594 Conflict-free coloring of unit disks Lev-Tov, Nissan
2009
81-90 Index 1 p. 1521-1532
12 p.
artikel
595 1-2-3 Conjecture in digraphs: More results and directions Bensmail, Julien

81-90 Index 1 p. 124-137
artikel
596 Conjugated trees with minimum general Randić index Chen, Xiaodan
2009
81-90 Index 1 p. 1379-1386
8 p.
artikel
597 Connected graph G with σ 2 ( G ) ≥ 2 3 n and K 1 , 4 -free contains a Hamiltonian path Momège, Benjamin

81-90 Index 1 p. 37-42
artikel
598 Connected graph searching in chordal graphs Nisse, Nicolas
2009
81-90 Index 1 p. 2603-2610
8 p.
artikel
599 2-Connected graphs with minimum general sum-connectivity index Tomescu, Ioan
2014
81-90 Index 1 p. 135-141
7 p.
artikel
600 Connected greedy coloring of H -free graphs Mota, Esdras

81-90 Index 1 p. 572-584
artikel
601 Connected triangle-free m -step competition graphs Helleloid, Geir T.
2005
81-90 Index 1 p. 376-383
8 p.
artikel
602 Connection-graph and iteration-graph of monotone boolean functions Robert, Y.
1985
81-90 Index 1 p. 245-253
9 p.
artikel
603 Connectivity and diagnosability of center k -ary n -cubes Wang, Mujiangshan

81-90 Index 1 p. 98-107
artikel
604 Connectivity of iterated line graphs Shao, Yehong
2010
81-90 Index 1 p. 2081-2087
7 p.
artikel
605 Connectivity of Kronecker products with complete multipartite graphs Wang, Wei
2013
81-90 Index 1 p. 1655-1659
5 p.
artikel
606 Connectivity preserving transformations for higher dimensional binary images Komuravelli, Anvesh
2009
81-90 Index 1 p. 3372-3385
14 p.
artikel
607 Consecutive edge-coloring of the generalized θ -graph Feng, Yongde
2007
81-90 Index 1 p. 2321-2327
7 p.
artikel
608 Constant threshold intersection graphs of orthodox paths in trees Bornstein, Claudson Ferreira

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

81-90 Index 1 p. 456-472
artikel
610 Constrained partitioning problems Burkard, Rainer E.
1990
81-90 Index 1 p. 21-34
14 p.
artikel
611 Constrained versions of Sauer’s lemma Ratsaby, Joel
2008
81-90 Index 1 p. 2753-2767
15 p.
artikel
612 Constructing day-balanced round-robin tournaments with partitions Erzurumluoğlu, Aras
2018
81-90 Index 1 p. 81-91
artikel
613 Constructing efficient simulated annealing algorithms Duque-Antón, Manuel
1997
81-90 Index 1 p. 139-159
21 p.
artikel
614 Constructing formally self-dual codes over R k Karadeniz, Suat
2014
81-90 Index 1 p. 188-196
9 p.
artikel
615 Constructing new families of transmission irregular graphs Xu, Kexiang

81-90 Index 1 p. 383-391
artikel
616 Construction methods for generalized bent functions Hodžić, S.
2018
81-90 Index 1 p. 14-23
artikel
617 Construction of a simple elimination scheme for a chordal comparability graph in linear time Borie, Richard B.
1999
81-90 Index 1 p. 287-292
6 p.
artikel
618 Construction of infinite de Bruijn arrays Iványi, Antal
1988
81-90 Index 1 p. 289-293
5 p.
artikel
619 Construction of universal one-way hash functions: Tree hashing revisited Sarkar, Palash
2007
81-90 Index 1 p. 2174-2180
7 p.
artikel
620 Constructions of k -critical P 5 -free graphs Hoàng, Chính T.
2015
81-90 Index 1 p. 91-98
8 p.
artikel
621 Constructions of optimal GDRP ( n , λ ; v ) ’s of type λ 1 μ m − 1 Yan, Jie
2008
81-90 Index 1 p. 2666-2678
13 p.
artikel
622 Constructions of rotation symmetric bent functions with high algebraic degree Zhao, Qinglan
2018
81-90 Index 1 p. 15-29
artikel
623 Constructive dual methods for discrete programming Barcia, Paulo
1987
81-90 Index 1 p. 107-117
11 p.
artikel
624 Containment properties of product and power graphs Fernández, Antonio
2007
81-90 Index 1 p. 300-311
12 p.
artikel
625 Contents 2009
81-90 Index 1 p. v-vi
nvt p.
artikel
626 Contents 2009
81-90 Index 1 p. vii-
1 p.
artikel
627 Contents 2009
81-90 Index 1 p. vii-ix
nvt p.
artikel
628 Contents 2010
81-90 Index 1 p. v-vi
nvt p.
artikel
629 Contents 2014
81-90 Index 1 p. v-vi
nvt p.
artikel
630 Contents 2015
81-90 Index 1 p. v-vi
nvt p.
artikel
631 Contents 2017
81-90 Index 1 p. v-
1 p.
artikel
632 Contents 2016
81-90 Index 1 p. v-
1 p.
artikel
633 Contents 2013
81-90 Index 1 p. v-vii
nvt p.
artikel
634 Contents 2011
81-90 Index 1 p. v-
1 p.
artikel
635 Contents 2011
81-90 Index 1 p. v-
1 p.
artikel
636 Contents 2011
81-90 Index 1 p. v-vi
nvt p.
artikel
637 Contents 2011
81-90 Index 1 p. v-
1 p.
artikel
638 Contents 2014
81-90 Index 1 p. v-vi
nvt p.
artikel
639 Contents 2012
81-90 Index 1 p. v-vi
nvt p.
artikel
640 Contents 2004
81-90 Index 1 p. ix-x
nvt p.
artikel
641 Contents 2004
81-90 Index 1 p. ix-
1 p.
artikel
642 Contents 2004
81-90 Index 1 p. vii-viii
nvt p.
artikel
643 Contents 2004
81-90 Index 1 p. viii-ix
nvt p.
artikel
644 Contents 2006
81-90 Index 1 p. vii-
1 p.
artikel
645 Contents 2006
81-90 Index 1 p. vii-viii
nvt p.
artikel
646 Contents 2007
81-90 Index 1 p. vii-viii
nvt p.
artikel
647 Contents 2008
81-90 Index 1 p. v-vi
nvt p.
artikel
648 Contents 2017
81-90 Index 1 p. v-vi
nvt p.
artikel
649 Contents all nrs. if necessary 2003
81-90 Index 1 p. vii-viii
nvt p.
artikel
650 Contents all nrs. if necessary 2003
81-90 Index 1 p. iv-v
nvt p.
artikel
651 Continued fractions and explicit solutions of a particular discrete optimization problem Giannessi, F.
1979
81-90 Index 1 p. 261-275
15 p.
artikel
652 Convex hulls of superincreasing knapsacks and lexicographic orderings Gupte, Akshay
2016
81-90 Index 1 p. 150-163
14 p.
artikel
653 Convex ( 0 , 1 ) -matrices and their epitopes Brualdi, Richard A.

81-90 Index 1 p. 21-34
artikel
654 Correction of the paper “Bicyclic graphs with extremal values of PI index” Ma, Gang
2016
81-90 Index 1 p. 132-133
2 p.
artikel
655 Corrections of proofs for Hansen and Mélot's two theorems Li, Xueliang
2007
81-90 Index 1 p. 2365-2370
6 p.
artikel
656 Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem Franco, John
1987
81-90 Index 1 p. 295-299
5 p.
artikel
657 Correction to the paper: Patterson–Wiedemann construction revisited Kavut, Selçuk
2016
81-90 Index 1 p. 185-187
3 p.
artikel
658 Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words Bašić, Bojan
2012
81-90 Index 1 p. 181-186
6 p.
artikel
659 Counting and enumerating galled networks Gunawan, Andreas D.M.

81-90 Index 1 p. 644-654
artikel
660 Counting Candy Crush configurations Hamilton, Adam

81-90 Index 1 p. 47-56
artikel
661 Counting disjoint hypercubes in Fibonacci cubes Saygı, Elif
2016
81-90 Index 1 p. 231-237
7 p.
artikel
662 Counting graceful labelings of trees: A theoretical and empirical study Anick, David
2016
81-90 Index 1 p. 65-81
17 p.
artikel
663 Counting humps and peaks in generalized Motzkin paths Mansour, Toufik
2013
81-90 Index 1 p. 2213-2216
4 p.
artikel
664 Counting inequivalent monotone Boolean functions Stephen, Tamon
2014
81-90 Index 1 p. 15-24
10 p.
artikel
665 Counting 4 × 4 matrix partitions of graphs Dyer, Martin
2016
81-90 Index 1 p. 76-92
17 p.
artikel
666 Counting minimal semi-Sturmian words Blanchet-Sadri, F.
2013
81-90 Index 1 p. 2851-2861
11 p.
artikel
667 Counting preimages of TCP reordering patterns Hansson, Anders
2008
81-90 Index 1 p. 3187-3193
7 p.
artikel
668 Counting the number of non-equivalent vertex colorings of a graph Hertz, Alain
2016
81-90 Index 1 p. 62-71
10 p.
artikel
669 Counting the number of p × q integer matrices more concordant than a given matrix Nguyen, Truc T.
1985
81-90 Index 1 p. 187-205
19 p.
artikel
670 Counting truth assignments of formulas of bounded tree-width or clique-width Fischer, E.
2008
81-90 Index 1 p. 511-529
19 p.
artikel
671 Covering a rectangle with six and seven circles Melissen, J.B.M.
2000
81-90 Index 1 p. 149-156
8 p.
artikel
672 Covering line graphs with equivalence relations Esperet, Louis
2010
81-90 Index 1 p. 1902-1907
6 p.
artikel
673 Covering symmetric semi-monotone functions Grappe, Roland
2008
81-90 Index 1 p. 138-144
7 p.
artikel
674 CPG graphs: Some structural and hardness results Champseix, Nicolas

81-90 Index 1 p. 17-35
artikel
675 Criterion of generativeness of sets of rational probabilities by a class of Boolean functions Kolpakov, R.M.
2004
81-90 Index 1 p. 125-142
18 p.
artikel
676 Critical edges in perfect line graphs and some polyhedral consequences Wagler, Annegret
1999
81-90 Index 1 p. 455-466
12 p.
artikel
677 Critically indecomposable graphs Dubey, Chandan K.
2009
81-90 Index 1 p. 149-163
15 p.
artikel
678 Critical ( P 6 , b a n n e r ) -free graphs Huang, Shenwei
2019
81-90 Index 1 p. 143-151
artikel
679 Crown reductions for the Minimum Weighted Vertex Cover problem Chlebík, Miroslav
2008
81-90 Index 1 p. 292-312
21 p.
artikel
680 Cumulative index volumes 1–92 2000
81-90 Index 1 p. 177-261
85 p.
artikel
681 Cutoff phenomenon for random walks on Kneser graphs Pourmiri, Ali
2014
81-90 Index 1 p. 100-106
7 p.
artikel
682 Cut, paste and filter Sullivan, Peggy
2003
81-90 Index 1 p. 465-485
21 p.
artikel
683 Cutting out polygon collections with a saw Dumitrescu, Adrian
2017
81-90 Index 1 p. 98-108
11 p.
artikel
684 Cutting planes in integer and mixed integer programming Marchand, Hugues
2002
81-90 Index 1 p. 397-446
50 p.
artikel
685 Cycle energy and its size dependence Gutman, Ivan

81-90 Index 1 p. 534-537
artikel
686 Cycles embedding in balanced hypercubes with faulty edges and vertices Cheng, Dongqin
2018
81-90 Index 1 p. 56-69
artikel
687 Cycles embedding in folded hypercubes under the conditional fault model Cheng, Dongqin
2017
81-90 Index 1 p. 60-68
9 p.
artikel
688 Cycles embedding in folded hypercubes with conditionally faulty vertices Kuo, Che-Nan
2017
81-90 Index 1 p. 55-59
5 p.
artikel
689 Cycles embedding on folded hypercubes with faulty nodes Cheng, Dongqin
2013
81-90 Index 1 p. 2894-2900
7 p.
artikel
690 Cycles in cube-connected cycles graphs Hsu, Lih-Hsing
2014
81-90 Index 1 p. 163-171
9 p.
artikel
691 Cycles in the burnt pancake graph Blanco, Saúl A.
2019
81-90 Index 1 p. 1-14
artikel
692 Cycles of length 1 modulo 3 in graph Mei, LU
2001
81-90 Index 1 p. 329-336
8 p.
artikel
693 Cyclic bandwidth with an edge added Chan, W.H.
2008
81-90 Index 1 p. 131-137
7 p.
artikel
694 Cyclic codes of length 2 e over Z 4 Abualrub, Taher
2003
81-90 Index 1 p. 3-9
7 p.
artikel
695 Cyclic codes over Z 4 of oddly even length Blackford, Thomas
2003
81-90 Index 1 p. 27-46
20 p.
artikel
696 Cyclic deficiency of graphs Asratian, Armen S.
2019
81-90 Index 1 p. 171-185
artikel
697 Data-independent neighborhood functions and strict local optima Armstrong, Derek E.
2005
81-90 Index 1 p. 233-243
11 p.
artikel
698 Deadlock prevention by acyclic orientations Bermond, Jean-Claude
2003
81-90 Index 1 p. 31-47
17 p.
artikel
699 Decidability of the binary infinite Post Correspondence Problem Halava, Vesa
2003
81-90 Index 1 p. 521-526
6 p.
artikel
700 Decision theory and discrete mathematics Fishburn, Peter C.
1996
81-90 Index 1 p. 209-221
13 p.
artikel
701 Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture Bensmail, Julien
2019
81-90 Index 1 p. 1-9
artikel
702 Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph Huang, Ziwen
2019
81-90 Index 1 p. 112-118
artikel
703 Decomposing complete edge-chromatic graphs and hypergraphs. Revisited Gurvich, Vladimir
2009
81-90 Index 1 p. 3069-3085
17 p.
artikel
704 Decomposing split graphs into locally irregular graphs Lintzmayer, C.N.

81-90 Index 1 p. 33-44
artikel
705 Decomposing toroidal graphs into circuits and edges Xu, Baogang
2005
81-90 Index 1 p. 147-159
13 p.
artikel
706 Decomposition of bipartite graphs into special subgraphs Chen, Guantao
2007
81-90 Index 1 p. 400-404
5 p.
artikel
707 Decomposition of circulant digraphs with two jumps into cycles of equal lengths Bogdanowicz, Zbigniew R.
2015
81-90 Index 1 p. 45-51
7 p.
artikel
708 Decomposition of wheel-and-parachute-free balanced bipartite graphs Conforti, Michele
1995
81-90 Index 1 p. 103-117
15 p.
artikel
709 Decompositions into linear forests and difference labelings of graphs Bloom, Gary S.
1994
81-90 Index 1 p. 61-75
15 p.
artikel
710 Decycling bubble sort graphs Wang, Jian
2015
81-90 Index 1 p. 178-182
5 p.
artikel
711 Dedication Gesù, Vito Di
2005
81-90 Index 1 p. 1-
1 p.
artikel
712 Defect of an octahedron in a rational lattice Fadin, Mikhail

81-90 Index 1 p. 37-43
artikel
713 Defensive alliances in graphs of bounded treewidth Bliem, Bernhard
2018
81-90 Index 1 p. 334-339
artikel
714 Defining families of trees with E0L grammars Ottmann, Thomas
1991
81-90 Index 1 p. 195-209
15 p.
artikel
715 Degenerate matchings and edge colorings Baste, Julien
2018
81-90 Index 1 p. 38-44
artikel
716 Degree conditions on distance 2 vertices that imply k -ordered Hamiltonian Li, Ruijuan
2010
81-90 Index 1 p. 331-339
9 p.
artikel
717 Degree-constrained spanners for multidimensional grids Liestman, Arthur L.
1996
81-90 Index 1 p. 119-144
26 p.
artikel
718 Degree distance and vertex-connectivity Ali, P.
2013
81-90 Index 1 p. 2802-2811
10 p.
artikel
719 Degree sequence realizations with given packing and covering of spanning trees Liu, Fengxia
2015
81-90 Index 1 p. 113-118
6 p.
artikel
720 Degree sequences and graphs with disjoint spanning trees Lai, Hong-Jian
2011
81-90 Index 1 p. 1447-1452
6 p.
artikel
721 Delay-related secondary objectives for rectilinear Steiner minimum trees Peyer, Sven
2004
81-90 Index 1 p. 271-298
28 p.
artikel
722 Dense bipartite circulants and their routing via rectangular twisted torus Jha, Pranava K.
2014
81-90 Index 1 p. 141-158
18 p.
artikel
723 Dense on-line arbitrarily partitionable graphs Kalinowski, Rafał
2017
81-90 Index 1 p. 71-77
7 p.
artikel
724 Dense subgraphs in random graphs Balister, Paul
2019
81-90 Index 1 p. 66-74
artikel
725 Derived neighborhoods and frontier orders Daragon, Xavier
2005
81-90 Index 1 p. 227-243
17 p.
artikel
726 Destroying longest cycles in graphs and digraphs van Aardt, Susan A.
2015
81-90 Index 1 p. 251-259
9 p.
artikel
727 Determining equitable total chromatic number for infinite classes of complete r -partite graphs da Silva, A.G.

81-90 Index 1 p. 56-67
artikel
728 Determining the L ( 2 , 1 ) -span in polynomial space Junosza-Szaniawski, Konstanty
2013
81-90 Index 1 p. 2052-2061
10 p.
artikel
729 Deterministic algorithms for multi-criteria Max-TSP Manthey, Bodo
2012
81-90 Index 1 p. 2277-2285
9 p.
artikel
730 Deterministic communication complexity of set intersection Tamm, Ulrich
1995
81-90 Index 1 p. 271-283
13 p.
artikel
731 Deterministic distributed construction of T -dominating sets in time T Miller, Avery
2017
81-90 Index 1 p. 172-178
7 p.
artikel
732 Deterministic inverse zero-patterns Johnson, Charles R.
2001
81-90 Index 1 p. 211-236
26 p.
artikel
733 Deterministic symmetric rendezvous with tokens in a synchronous torus Kranakis, Evangelos
2011
81-90 Index 1 p. 896-923
28 p.
artikel
734 Diagnosis of constant faults in read-once contact networks over finite bases Busbait, Monther
2015
81-90 Index 1 p. 76-88
13 p.
artikel
735 Diameter determination on restricted graph families Corneil, Derek G.
2001
81-90 Index 1 p. 143-166
24 p.
artikel
736 Diameter vulnerability of graphs Peyrat, C.
1984
81-90 Index 1 p. 245-250
6 p.
artikel
737 Diameter-vulnerability of large bipartite digraphs Padró, C.
1996
81-90 Index 1 p. 239-248
10 p.
artikel
738 Difference between 2 -rainbow domination and Roman domination in graphs Fujita, Shinya
2013
81-90 Index 1 p. 806-812
7 p.
artikel
739 Difference graphs Hammer, Peter L.
1990
81-90 Index 1 p. 35-44
10 p.
artikel
740 Diffuse reflection diameter in simple polygons Barequet, Gill
2016
81-90 Index 1 p. 123-132
artikel
741 Digital homotopy with obstacles Ayala, R
2004
81-90 Index 1 p. 5-30
26 p.
artikel
742 Digraphs with real and gaussian spectra Esser, Friedrich
1980
81-90 Index 1 p. 113-124
12 p.
artikel
743 2-dimensional optical orthogonal codes from singer groups Alderson, T.L.
2009
81-90 Index 1 p. 3008-3019
12 p.
artikel
744 Dimension-2 poset competition numbers and dimension-2 poset double competition numbers Wu, Yaokun
2010
81-90 Index 1 p. 706-717
12 p.
artikel
745 Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time Feigenbaum, Joan
1986
81-90 Index 1 p. 105-110
6 p.
artikel
746 Directed defective asymmetric graph coloring games Andres, Stephan Dominique
2010
81-90 Index 1 p. 251-260
10 p.
artikel
747 Directed Moore hypergraphs Ergincan, Fahir Ö.
1995
81-90 Index 1 p. 117-127
11 p.
artikel
748 Directed rectangle-visibility graphs have unbounded dimension Romanik, Kathleen
1997
81-90 Index 1 p. 35-39
5 p.
artikel
749 Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs Fuji, Zhang
1991
81-90 Index 1 p. 295-302
8 p.
artikel
750 Directed weighted improper coloring for cellular channel allocation Archetti, Claudia
2015
81-90 Index 1 p. 46-60
15 p.
artikel
751 Discovering all associations in discrete data using frequent minimally infrequent attribute sets Eisenschmidt, Elke
2012
81-90 Index 1 p. 1730-1741
12 p.
artikel
752 Discrepancy minimizing spectral clustering Bolla, Marianna
2018
81-90 Index 1 p. 286-289
artikel
753 Discrete approximations to real-valued leaf sequencing problems in radiation therapy Gunawardena, Athula
2008
81-90 Index 1 p. 3178-3186
9 p.
artikel
754 Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs Józefowska, Joanna
1999
81-90 Index 1 p. 263-285
23 p.
artikel
755 Discrete facility location and routing of obnoxious activities Cappanera, P.
2003
81-90 Index 1 p. 3-28
26 p.
artikel
756 Discrete Tomography determination of bounded sets in Z n Brunetti, S.
2015
81-90 Index 1 p. 20-30
11 p.
artikel
757 Discrete tomography for inscribable lattice sets Dulio, P.
2013
81-90 Index 1 p. 1959-1974
16 p.
artikel
758 Disjoint cycles in hypercubes with prescribed vertices in each cycle Lin, Cheng-Kuan
2013
81-90 Index 1 p. 2992-3004
13 p.
artikel
759 Disjoint Hamilton cycles in transposition graphs Hussak, Walter
2016
81-90 Index 1 p. 56-64
9 p.
artikel
760 Distance and distance signless Laplacian spread of connected graphs You, Lihua
2017
81-90 Index 1 p. 140-147
8 p.
artikel
761 Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs Casablanca, Rocío M.
2019
81-90 Index 1 p. 105-117
artikel
762 Distance constrained labelings of planar graphs with no short cycles Dvořák, Zdeněk
2009
81-90 Index 1 p. 2634-2645
12 p.
artikel
763 Distance distributions for graphs modeling computer networks Elenbogen, Bruce
2007
81-90 Index 1 p. 2612-2624
13 p.
artikel
764 Distance k -domination, distance k -guarding, and distance k -vertex cover of maximal outerplanar graphs Alvarado, José D.
2015
81-90 Index 1 p. 154-159
6 p.
artikel
765 Distance magic graphs G × C n Cichacz, Sylwia
2014
81-90 Index 1 p. 80-87
8 p.
artikel
766 Distance restricted optimal pebbling in cycles Shiue, Chin-Lin

81-90 Index 1 p. 125-133
artikel
767 Distance restricted optimal pebbling in paths Shiue, Chin-Lin

81-90 Index 1 p. 46-54
artikel
768 Distances between sets based on set commonality Horadam, K.J.
2014
81-90 Index 1 p. 310-314
5 p.
artikel
769 Distances in cocomparability graphs and their powers Damaschke, Peter
1992
81-90 Index 1 p. 67-72
6 p.
artikel
770 Distances in graphs of girth 6 and generalised cages Alochukwu, Alex

81-90 Index 1 p. 125-137
artikel
771 Distance spectral radius of trees with given matching number Ilić, Aleksandar
2010
81-90 Index 1 p. 1799-1806
8 p.
artikel
772 Distance spectral spread of a graph Yu, Guanglong
2012
81-90 Index 1 p. 2474-2478
5 p.
artikel
773 Distance three labelings of trees Fiala, Jiří
2012
81-90 Index 1 p. 764-779
16 p.
artikel
774 Distance-two labelings of digraphs Chang, Gerard J.
2007
81-90 Index 1 p. 1007-1013
7 p.
artikel
775 Distance-two labellings of Hamming graphs Chang, Gerard J.
2009
81-90 Index 1 p. 1896-1904
9 p.
artikel
776 Distant irregularity strength of graphs with bounded minimum degree Przybyło, Jakub
2017
81-90 Index 1 p. 159-165
7 p.
artikel
777 Distinct distances and arithmetic progressions Dumitrescu, Adrian
2019
81-90 Index 1 p. 38-41
artikel
778 Distinct spreads in vector spaces over finite fields Lund, Ben
2018
81-90 Index 1 p. 154-158
artikel
779 Distinguishing numbers and distinguishing indices of oriented graphs Meslem, Kahina

81-90 Index 1 p. 330-342
artikel
780 Distributed processing of divisible jobs with communication startup costs Błażewicz, Jacek
1997
81-90 Index 1 p. 21-41
21 p.
artikel
781 Divisor generating functions and insertion into a heap Uchimura, Keisuke
1987
81-90 Index 1 p. 73-81
9 p.
artikel
782 d-minimal languages Yu, S.S.
1998
81-90 Index 1 p. 243-262
20 p.
artikel
783 DNA recombination through assembly graphs Angeleska, Angela
2009
81-90 Index 1 p. 3020-3037
18 p.
artikel
784 ( d , n ) -packing colorings of infinite lattices Korže, Danilo
2018
81-90 Index 1 p. 97-108
artikel
785 Dominating and irredundant broadcasts in graphs Mynhardt, C.M.
2017
81-90 Index 1 p. 80-90
11 p.
artikel
786 Dominating Cartesian products of cycles Klavžar, Sandi
1995
81-90 Index 1 p. 129-136
8 p.
artikel
787 Dominating induced matchings in S 1 , 2 , 4 -free graphs Brandstädt, Andreas

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

81-90 Index 1 p. 162-167
artikel
789 Dominating plane triangulations Plummer, Michael D.
2016
81-90 Index 1 p. 175-182
8 p.
artikel
790 Dominating sets reconfiguration under token sliding Bonamy, Marthe

81-90 Index 1 p. 6-18
artikel
791 Domination analysis for minimum multiprocessor scheduling Gutin, Gregory
2006
81-90 Index 1 p. 2613-2619
7 p.
artikel
792 Domination and location in twin-free digraphs Foucaud, Florent

81-90 Index 1 p. 42-52
artikel
793 Domination in a digraph and in its reverse Niepel, L’udovít
2009
81-90 Index 1 p. 2973-2977
5 p.
artikel
794 Domination, independent domination, and duality in strongly chordal graphs Farber, Martin
1984
81-90 Index 1 p. 115-130
16 p.
artikel
795 Domination in direct products of complete graphs Vemuri, Harish

81-90 Index 1 p. 473-482
artikel
796 [ 1 , 2 ] -domination in graphs Yang, Xiaojing
2014
81-90 Index 1 p. 79-86
8 p.
artikel
797 Domination in intersecting hypergraphs Dong, Yanxia
2018
81-90 Index 1 p. 155-159
artikel
798 Domination in some subclasses of bipartite graphs Pandey, Arti
2019
81-90 Index 1 p. 51-66
artikel
799 Domination versus disjunctive domination in trees Henning, Michael A.
2015
81-90 Index 1 p. 171-177
7 p.
artikel
800 Domination versus edge domination Baste, Julien

81-90 Index 1 p. 343-349
artikel
801 Dot product dimensions of graphs Li, Bo-Jr
2014
81-90 Index 1 p. 159-163
5 p.
artikel
802 Double Roman domination Beeler, Robert A.
2016
81-90 Index 1 p. 23-29
7 p.
artikel
803 Double Roman domination number V., Anu
2018
81-90 Index 1 p. 198-204
artikel
804 DRL*: A hierarchy of strong block-decomposable linear relaxations for 0–1 MIPs Minoux, M.
2010
81-90 Index 1 p. 2031-2048
18 p.
artikel
805 3D well-composed polyhedral complexes Gonzalez-Diaz, Rocio
2015
81-90 Index 1 p. 59-77
19 p.
artikel
806 Dyck paths of knight moves Labelle, Jacques
1989
81-90 Index 1 p. 213-221
9 p.
artikel
807 Dynamic chromatic number of regular graphs Alishahi, Meysam
2012
81-90 Index 1 p. 2098-2103
6 p.
artikel
808 3-dynamic coloring and list 3-dynamic coloring of K 1 , 3 -free graphs Li, Hao
2017
81-90 Index 1 p. 166-171
6 p.
artikel
809 Dynamic coloring parameters for graphs with given genus Loeb, Sarah
2018
81-90 Index 1 p. 129-141
artikel
810 Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks Khoshkhah, Kaveh
2014
81-90 Index 1 p. 81-89
9 p.
artikel
811 Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots Akutsu, Tatsuya
2000
81-90 Index 1 p. 45-62
18 p.
artikel
812 Dynamic programming and planarity: Improved tree-decomposition based algorithms Dorn, Frederic
2010
81-90 Index 1 p. 800-808
9 p.
artikel
813 Easy and hard bottleneck location problems Hsu, Wen-Lian
1979
81-90 Index 1 p. 209-215
7 p.
artikel
814 Easy cases of the D0L sequence equivalence problem Honkala, Juha
2001
81-90 Index 1 p. 285-290
6 p.
artikel
815 Eccentricity approximating trees Dragan, Feodor F.
2017
81-90 Index 1 p. 142-156
artikel
816 Edge and total coloring of interval graphs Bojarshinov, V.A.
2001
81-90 Index 1 p. 23-28
6 p.
artikel
817 Edge-coloring of plane multigraphs with many colors on facial cycles Czap, Július

81-90 Index 1 p. 80-85
artikel
818 Edge coloring of signed graphs Zhang, Li

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

81-90 Index 1 p. 268-283
artikel
820 Edge-connectivity and edge-superconnectivity in sequence graphs Balbuena, C.
2007
81-90 Index 1 p. 2053-2060
8 p.
artikel
821 Edge consecutive gracefulness of a graph Pereira, Jessica

81-90 Index 1 p. 214-220
artikel
822 Edge deletion preserving the diameter of the hypercube Bouabdallah, A.
1995
81-90 Index 1 p. 91-95
5 p.
artikel
823 Edge-disjoint paths in a grid bounded by two nested rectangles Suzuki, Hitoshi
1990
81-90 Index 1 p. 157-178
22 p.
artikel
824 Edge-disjoint paths in faulty augmented cubes Ma, Meijie

81-90 Index 1 p. 108-114
artikel
825 Edge-disjoint spanning trees and forests of graphs Zhou, Jiang

81-90 Index 1 p. 74-81
artikel
826 Edge dominating set and colorings on graphs with fixed clique-width Kobler, Daniel
2003
81-90 Index 1 p. 197-221
25 p.
artikel
827 Edge fault tolerance of graphs with respect to super edge connectivity Hong, Yanmei
2012
81-90 Index 1 p. 579-587
9 p.
artikel
828 Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs Guo, Jia

81-90 Index 1 p. 109-119
artikel
829 Edge-grafting transformations on the average eccentricity of graphs and their applications He, Chunling
2018
81-90 Index 1 p. 95-105
artikel
830 Edge intersection graphs of L -shaped paths in grids Cameron, Kathie
2016
81-90 Index 1 p. 185-194
artikel
831 Edge intersection graphs of systems of paths on a grid with a bounded number of bends Asinowski, Andrei
2009
81-90 Index 1 p. 3174-3180
7 p.
artikel
832 Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues Belardo, Francesco
2019
81-90 Index 1 p. 130-138
artikel
833 Edge-rooted forests and the α -invariant of cone graphs Kook, W.
2007
81-90 Index 1 p. 1071-1075
5 p.
artikel
834 Edge separators for quasi-binary trees Ramírez Alfonsín, Jorge Luis
2016
81-90 Index 1 p. 284-289
artikel
835 Edge-stable equimatchable graphs Deniz, Zakir
2019
81-90 Index 1 p. 136-147
artikel
836 Edge weights and vertex colours: Minimizing sum count Baudon, Olivier
2019
81-90 Index 1 p. 13-24
artikel
837 Editorial Board 2009
81-90 Index 1 p. v-vi
nvt p.
artikel
838 Editorial Board 2003
81-90 Index 1 p. v-vii
nvt p.
artikel
839 Editorial Board 1994
81-90 Index 1 p. iii-iv
nvt p.
artikel
840 Editorial Board 1997
81-90 Index 1 p. iii-iv
nvt p.
artikel
841 Editorial Board 1997
81-90 Index 1 p. iii-iv
nvt p.
artikel
842 Editorial Board 1998
81-90 Index 1 p. v-vi
nvt p.
artikel
843 Editorial Board 1998
81-90 Index 1 p. IFC-
1 p.
artikel
844 Editorial Board 1999
81-90 Index 1 p. v-
1 p.
artikel
845 Editorial Board 1989
81-90 Index 1 p. ii-
1 p.
artikel
846 Editorial board 1987
81-90 Index 1 p. ii-
1 p.
artikel
847 Editorial Board 2006
81-90 Index 1 p. v-vi
nvt p.
artikel
848 Editorial Board 2006
81-90 Index 1 p. v-vi
nvt p.
artikel
849 Editorial Board 2008
81-90 Index 1 p. v-vi
nvt p.
artikel
850 Editorial Board 2018
81-90 Index 1 p. ii
artikel
851 Editorial Board 2018
81-90 Index 1 p. ii
artikel
852 Editorial Board
81-90 Index 1 p. ii
artikel
853 Editorial Board
81-90 Index 1 p. ii
artikel
854 Editorial Board
81-90 Index 1 p. ii
artikel
855 Editorial Board
81-90 Index 1 p. ii
artikel
856 Editorial Board
81-90 Index 1 p. ii
artikel
857 Editorial Board
81-90 Index 1 p. ii
artikel
858 Editorial Note: DAM Software Section Leonard, C.J
2004
81-90 Index 1 p. ix-x
nvt p.
artikel
859 Editors nr. 1 2003
81-90 Index 1 p. v-vi
nvt p.
artikel
860 Editors nr. 1 2002
81-90 Index 1 p. v-vi
nvt p.
artikel
861 Efficient algorithms for decomposing graphs under degree constraints Bazgan, Cristina
2007
81-90 Index 1 p. 979-988
10 p.
artikel
862 Efficient algorithms for path partitions Williams, Craig
1990
81-90 Index 1 p. 267-276
10 p.
artikel
863 Efficient algorithms for Roman domination on some classes of graphs Liedloff, Mathieu
2008
81-90 Index 1 p. 3400-3415
16 p.
artikel
864 Efficient algorithms for some path partitioning problems Brucker, Peter
1995
81-90 Index 1 p. 77-85
9 p.
artikel
865 Efficient broadcasting with linearly bounded faults Ciebiera, Krzysztof
1998
81-90 Index 1 p. 99-105
7 p.
artikel
866 Efficient construction of broadcast graphs Averbuch, A.
2014
81-90 Index 1 p. 9-14
6 p.
artikel
867 Efficient domination through eigenvalues Cardoso, Domingos M.
2016
81-90 Index 1 p. 54-62
9 p.
artikel
868 Efficient eight-regular circulants based on the Kronecker product Jha, Pranava K.
2018
81-90 Index 1 p. 207-218
artikel
869 Efficient fault-tolerant fixed routings on (k+1)-connected digraphs Wada, Koichi
1992
81-90 Index 1 p. 539-552
14 p.
artikel
870 Efficient generation of rotating workforce schedules Musliu, Nysret
2002
81-90 Index 1 p. 85-98
14 p.
artikel
871 Efficient implementation of a shifting algorithm Perl, Yehoshua
1985
81-90 Index 1 p. 71-80
10 p.
artikel
872 Efficient k -shot broadcasting in radio networks Kantor, Erez
2016
81-90 Index 1 p. 79-94
16 p.
artikel
873 Efficiently solvable special cases of bottleneck travelling salesman problems Burkard, R.E.
1991
81-90 Index 1 p. 61-76
16 p.
artikel
874 Efficient m-ary balanced codes Tallini, L.G.
1999
81-90 Index 1 p. 17-56
40 p.
artikel
875 Efficient minimization of higher order submodular functions using monotonic Boolean functions Ramalingam, Srikumar
2017
81-90 Index 1 p. 1-19
19 p.
artikel
876 Efficient optimal equation formulation in lumped power-conserving systems Lamb, J.D.
1998
81-90 Index 1 p. 239-249
11 p.
artikel
877 Efficient reformulation for 0–1 programs — methods and computational results Dietrich, B.L.
1993
81-90 Index 1 p. 147-175
29 p.
artikel
878 Efficient ( t , r ) broadcast dominating sets of the triangular lattice Harris, Pamela E.

81-90 Index 1 p. 180-192
artikel
879 Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree Johnson, Charles R.
2010
81-90 Index 1 p. 681-691
11 p.
artikel
880 Eigenvalue multiplicity in regular graphs Rowlinson, Peter
2019
81-90 Index 1 p. 11-17
artikel
881 Elementary sequences, sub-Fibonacci sequences Fishburn, Peter C.
1993
81-90 Index 1 p. 261-281
21 p.
artikel
882 Elusiveness of finding degrees Goyal, Dishant

81-90 Index 1 p. 128-139
artikel
883 Embedding de Bruijn, Kautz and shuffle-exchange networks in books Hasunuma, Toru
1997
81-90 Index 1 p. 103-116
14 p.
artikel
884 Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 Opatrny, J
2000
81-90 Index 1 p. 237-254
18 p.
artikel
885 Embeddings of k -connected graphs of pathwidth k Gupta, Arvind
2005
81-90 Index 1 p. 242-265
24 p.
artikel
886 Embedding trees in recursive circulants Lim, Hyeong-Seok
1996
81-90 Index 1 p. 83-99
17 p.
artikel
887 Embedding various cycles with prescribed paths into k -ary n -cubes Yang, Yuxing
2017
81-90 Index 1 p. 161-169
9 p.
artikel
888 Energies of unitary one-matching bi-Cayley graphs over finite commutative rings Liu, Xiaogang
2019
81-90 Index 1 p. 170-179
artikel
889 Energy of weighted digraphs Bhat, Mushtaq A.
2017
81-90 Index 1 p. 1-14
14 p.
artikel
890 Energy ordering of catacondensed hexagonal systems Rada, Juan
2005
81-90 Index 1 p. 437-443
7 p.
artikel
891 Enumerating and categorizing positive Boolean functions separable by a k -additive capacity Uyanık, Eda
2017
81-90 Index 1 p. 17-30
14 p.
artikel
892 Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Khachiyan, Leonid
2007
81-90 Index 1 p. 137-149
13 p.
artikel
893 Enumerating ( 2 + 2 ) -free posets by the number of minimal elements and other statistics Kitaev, Sergey
2011
81-90 Index 1 p. 2098-2108
11 p.
artikel
894 Enumerating lambda terms by weighted length of their De Bruijn representation Bodini, Olivier
2018
81-90 Index 1 p. 45-61
artikel
895 Enumerating near-4-regular maps on the sphere and the torus Ren, Han
2001
81-90 Index 1 p. 273-288
16 p.
artikel
896 Enumeration and maximum number of maximal irredundant sets for chordal graphs Golovach, Petr A.
2019
81-90 Index 1 p. 69-85
artikel
897 Enumeration aspects of maximal cliques and bicliques Gély, Alain
2009
81-90 Index 1 p. 1447-1459
13 p.
artikel
898 Enumeration of balanced ternary designs Kaski, Petteri
2004
81-90 Index 1 p. 133-141
9 p.
artikel
899 Enumeration of factors in the Thue-Morse word Brlek, Srećko
1989
81-90 Index 1 p. 83-96
14 p.
artikel
900 Enumeration of irreducible binary words Kobayashi, Yuji
1988
81-90 Index 1 p. 221-232
12 p.
artikel
901 Enumeration of minimal connected dominating sets for chordal graphs Golovach, Petr A.

81-90 Index 1 p. 3-11
artikel
902 Enumeration of perfect matchings of a type of Cartesian products of graphs Yan, Weigen
2006
81-90 Index 1 p. 145-157
13 p.
artikel
903 Enumeration of 2-regular circulant graphs and directed double networks Mamut, Aygul
2009
81-90 Index 1 p. 1024-1033
10 p.
artikel
904 Enumerations of humps and peaks in ( k , a ) -paths and ( n , m ) -Dyck paths via bijective proofs Du, Rosena R.X.
2015
81-90 Index 1 p. 42-49
8 p.
artikel
905 EP theorems and linear complementarity problems Fukuda, Komei
1998
81-90 Index 1 p. 107-119
13 p.
artikel
906 Equations enforcing repetitions under permutations Day, Joel D.

81-90 Index 1 p. 61-78
artikel
907 Equidistant codes in the Grassmannian Etzion, Tuvi
2015
81-90 Index 1 p. 87-97
11 p.
artikel
908 Equistable chordal graphs Peled, Uri N.
2003
81-90 Index 1 p. 203-210
8 p.
artikel
909 Equistable distance-hereditary graphs Korach, Ephraim
2008
81-90 Index 1 p. 462-477
16 p.
artikel
910 Equistable series–parallel graphs Korach, Ephraim
2003
81-90 Index 1 p. 149-162
14 p.
artikel
911 Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs Yan, Zhidan
2014
81-90 Index 1 p. 328-333
6 p.
artikel
912 Equitable colorings of Cartesian products of graphs Lin, Wu-Hsiung
2012
81-90 Index 1 p. 239-247
9 p.
artikel
913 Equitable colorings of Cartesian products with balanced complete multipartite graphs Yan, Zhidan
2015
81-90 Index 1 p. 200-203
4 p.
artikel
914 Equitable colorings of hypergraphs with few edges Akhmejanova, Margarita B.

81-90 Index 1 p. 2-12
artikel
915 Equitable colorings of Kronecker products of graphs Lin, Wu-Hsiung
2010
81-90 Index 1 p. 1816-1826
11 p.
artikel
916 Equitable neighbour-sum-distinguishing edge and total colourings Baudon, Olivier
2017
81-90 Index 1 p. 40-53
14 p.
artikel
917 Equitable total coloring of complete r -partite p -balanced graphs da Silva, A.G.
2019
81-90 Index 1 p. 123-135
artikel
918 Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 × n rectangles Langner, Johanna
2018
81-90 Index 1 p. 297-303
artikel
919 Equivalence for negabent functions and their relative difference sets Anbar, Nurdagül
2019
81-90 Index 1 p. 1-12
artikel
920 Equivalences and the complete hierarchy of intersection graphs of paths in a tree Golumbic, Martin Charles
2008
81-90 Index 1 p. 3203-3215
13 p.
artikel
921 Equivalent constraints for discrete sets Meyer, R.R
1979
81-90 Index 1 p. 31-50
20 p.
artikel
922 Equivalent realisations of a rigid graph Jackson, Bill
2019
81-90 Index 1 p. 42-58
artikel
923 Equivalent versions of group-connectivity theorems and conjectures Kochol, Martin
2019
81-90 Index 1 p. 350-352
artikel
924 Erdős–Ko–Rado theorems for a family of trees Feghali, Carl
2018
81-90 Index 1 p. 464-471
artikel
925 Erratum to “Comparison of column generation models for channel assignment in cellular networks” Jaumard, Brigitte
2002
81-90 Index 1 p. 299-322
24 p.
artikel
926 Erratum to “Reduction of symmetric configurations n 3 ” [Discrete Appl. Math. 99 (1–3) (2000) 401 –411] Steffen, Eckhard
2006
81-90 Index 1 p. 1645-1646
2 p.
artikel
927 Error-correcting nonadaptive group testing with d e -disjunct matrices Macula, Anthony J.
1997
81-90 Index 1 p. 217-222
6 p.
artikel
928 Essential points of the n -cube subset partitioning characterisation Sahakyan, Hasmik
2014
81-90 Index 1 p. 205-213
9 p.
artikel
929 Essential upper bounds on the total domination number Henning, Michael A.
2018
81-90 Index 1 p. 103-115
artikel
930 Establishing determinantal inequalities for positive-definite matrices Cerdeira, J.Orestes
1995
81-90 Index 1 p. 13-24
12 p.
artikel
931 Estimating satisfiability Boufkhad, Yacine
2012
81-90 Index 1 p. 61-80
20 p.
artikel
932 Estimating the r -colorability threshold for a random hypergraph Shabanov, Dmitry A.

81-90 Index 1 p. 168-183
artikel
933 E -super vertex magic labelings of graphs Marimuthu, G.
2012
81-90 Index 1 p. 1766-1774
9 p.
artikel
934 Eulerian subgraphs and Hamilton-connected line graphs Li, Dengxin
2005
81-90 Index 1 p. 422-428
7 p.
artikel
935 Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices Kuo, Che-Nan

81-90 Index 1 p. 1-9
artikel
936 Every grid has an independent [1, 2]-set Aleid, S.A.
2019
81-90 Index 1 p. 14-21
artikel
937 Every matroid is a submatroid of a uniformly dense matroid Lai, Hong-Jian
1995
81-90 Index 1 p. 151-160
10 p.
artikel
938 Every planar graph is 1-defective ( 9 , 2 ) -paintable Han, Ming

81-90 Index 1 p. 257-264
artikel
939 Every toroidal graph without adjacent triangles is ( 4 , 1 ) * -choosable Xu, Baogang
2007
81-90 Index 1 p. 74-78
5 p.
artikel
940 Every triangle-free induced subgraph of the triangular lattice is ( 5 m , 2 m ) -choosable Aubry, Yves
2014
81-90 Index 1 p. 51-58
8 p.
artikel
941 Exact algorithms for dominating induced matching based on graph partition Xiao, Mingyu
2015
81-90 Index 1 p. 147-162
16 p.
artikel
942 Exact algorithms for weak Roman domination Chapelle, Mathieu
2018
81-90 Index 1 p. 79-92
artikel
943 Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis Boros, Endre
2004
81-90 Index 1 p. 43-58
16 p.
artikel
944 Exact λ -numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips Adams, Sarah Spence
2012
81-90 Index 1 p. 436-447
12 p.
artikel
945 Exact satisfiability of linear CNF formulas Schuh, Bernd R.
2018
81-90 Index 1 p. 1-4
artikel
946 Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs Liu, Xianliang
2016
81-90 Index 1 p. 111-116
6 p.
artikel
947 Exact value of e x ( n ; { C 3 , … , C s } ) for n ≤ ⌊ 25 ( s − 1 ) 8 ⌋ Abajo, E.
2015
81-90 Index 1 p. 1-7
7 p.
artikel
948 Exact values of e x ( ν ; { C 3 , C 4 , … , C n } ) Abajo, E.
2010
81-90 Index 1 p. 1869-1878
10 p.
artikel
949 Examples of products giving large graphs with given degree and diameter Delorme, C.
1992
81-90 Index 1 p. 157-167
11 p.
artikel
950 Excessive factorizations of bipartite multigraphs Cariolaro, David
2010
81-90 Index 1 p. 1760-1766
7 p.
artikel
951 Exchanges procedures for timetabling problems Ferland, Jacques A.
1992
81-90 Index 1 p. 237-253
17 p.
artikel
952 Excluding cycles with a fixed number of chords Aboulker, Pierre
2015
81-90 Index 1 p. 11-24
14 p.
artikel
953 Existence of directed triplewhist tournaments with the three person property 3 P D T W h ( v ) Abel, R.J.R.
2008
81-90 Index 1 p. 2655-2665
11 p.
artikel
954 Existence of directedwhist tournaments with the three person property 3 PDWh ( v ) Bennett, F.E.
2006
81-90 Index 1 p. 1939-1946
8 p.
artikel
955 Existence of resolvable optimal strong partially balanced designs Du, Beiliang
2006
81-90 Index 1 p. 930-941
12 p.
artikel
956 Expansion of layouts of complete binary trees into grids Lin, Y.-B.
2003
81-90 Index 1 p. 611-642
32 p.
artikel
957 Expected complexity of graph partitioning problems Kučera, Luděk
1995
81-90 Index 1 p. 193-212
20 p.
artikel
958 Expected value expansions in rooted graphs Bailey, Alison
2003
81-90 Index 1 p. 555-571
17 p.
artikel
959 Explicit construction of graphs with an arbitrary large girth and of large size Lazebnik, Felix
1995
81-90 Index 1 p. 275-284
10 p.
artikel
960 Explicit expressions for the central characters of the symmetric group Katriel, Jacob
1996
81-90 Index 1 p. 149-156
8 p.
artikel
961 Exploiting partial knowledge of satisfying assignments Iwama, Kazuo
2007
81-90 Index 1 p. 1596-1603
8 p.
artikel
962 Exploring the concept of perfection in 3-hypergraphs García-Colín, Natalia
2016
81-90 Index 1 p. 164-170
artikel
963 Extending shelling orders and a hierarchy of functions of unimodal simple polytopes Hoke, Kathy
1995
81-90 Index 1 p. 211-217
7 p.
artikel
964 Extensions de réseaux de connexité donnée Konig, Jean-Claude
1989
81-90 Index 1 p. 197-211
15 p.
artikel
965 Extremal bipartite graphs of given connectivity with respect to matching energy Chen, Hanlin
2018
81-90 Index 1 p. 200-205
artikel
966 Extremal graphs for blow-ups of stars and paths Kang, Liying

81-90 Index 1 p. 79-85
artikel
967 Extremal graphs for the geometric–arithmetic index with given minimum degree Divnić, Tomica
2014
81-90 Index 1 p. 386-390
5 p.
artikel
968 Extremal graphs for vertex-degree-based invariants with given degree sequences Liu, Muhuo
2019
81-90 Index 1 p. 267-277
artikel
969 Extremal graphs with respect to generalized A B C index Chen, Xiaodan
2018
81-90 Index 1 p. 115-124
artikel
970 Extremal Halin graphs with respect to the signless Laplacian spectra Zhang, Minjie
2016
81-90 Index 1 p. 207-218
12 p.
artikel
971 Extremal hypergraphs for matching number and domination number Shan, Erfang
2018
81-90 Index 1 p. 415-421
artikel
972 Extremal k -generalized quasi unicyclic graphs with respect to first and second Zagreb indices Javaid, Faisal
2019
81-90 Index 1 p. 153-158
artikel
973 Extremal polygonal cacti for bond incident degree indices Ye, Jiachang
2019
81-90 Index 1 p. 289-298
artikel
974 Extremal problems for degree-based topological indices Tang, Yunfang
2016
81-90 Index 1 p. 134-143
10 p.
artikel
975 Extremal problems for trees with given segment sequence Andriantiana, Eric Ould Dadah
2017
81-90 Index 1 p. 20-34
15 p.
artikel
976 Extremal problems on consecutive L ( 2 , 1 ) -labelling Lu, Changhong
2007
81-90 Index 1 p. 1302-1313
12 p.
artikel
977 Extremal problems on distance spectra of graphs Lin, Huiqiu

81-90 Index 1 p. 139-147
artikel
978 Extremal problems on saturation for the family of k -edge-connected graphs Lei, Hui
2019
81-90 Index 1 p. 278-283
artikel
979 Extremal trees of given segment sequence with respect to some eccentricity-based invariants Zhang, Minjie

81-90 Index 1 p. 111-123
artikel
980 Extremal values and bounds for the zero forcing number Gentner, Michael
2016
81-90 Index 1 p. 196-200
5 p.
artikel
981 Extremal values for ratios of distances in trees Barefoot, C.A.
1997
81-90 Index 1 p. 37-56
20 p.
artikel
982 Facets of the k-partition polytope Chopra, Sunil
1995
81-90 Index 1 p. 27-48
22 p.
artikel
983 Facets of the three-index assignment polytope Balas, Egon
1989
81-90 Index 1 p. 201-229
29 p.
artikel
984 Facial anagram-free edge-coloring of plane graphs Czap, Július
2017
81-90 Index 1 p. 151-155
5 p.
artikel
985 ℓ -facial edge colorings of graphs Lužar, Borut
2015
81-90 Index 1 p. 193-200
8 p.
artikel
986 Facial edge ranking of plane graphs Czap, Július
2015
81-90 Index 1 p. 60-64
5 p.
artikel
987 Facial L ( 2 , 1 ) -edge-labelings of trees Czap, Július

81-90 Index 1 p. 357-366
artikel
988 Facial packing edge-coloring of plane graphs Czap, Július
2016
81-90 Index 1 p. 71-75
5 p.
artikel
989 Facial packing vertex-coloring of subdivided plane graphs Czap, Július
2019
81-90 Index 1 p. 95-100
artikel
990 Facility location games with distinct desires Mei, Lili
2019
81-90 Index 1 p. 148-160
artikel
991 1-factor covers of regular graphs belcastro, sarah-marie
2011
81-90 Index 1 p. 281-287
7 p.
artikel
992 Fair division with multiple pieces Nyman, Kathryn

81-90 Index 1 p. 115-122
artikel
993 Fair multi-cake cutting Segal-Halevi, Erel

81-90 Index 1 p. 15-35
artikel
994 Families of finite sets satisfying intersection restrictions Frankl, Peter

81-90 Index 1 p. 44-49
artikel
995 Families of non-IRUP instances of the one-dimensional cutting stock problem Rietz, Jürgen
2002
81-90 Index 1 p. 229-245
17 p.
artikel
996 Fast algorithms for identifying maximal common connected sets of interval graphs Coulon, Fabien
2006
81-90 Index 1 p. 1709-1721
13 p.
artikel
997 Fast algorithms for min independent dominating set Bourgeois, N.
2013
81-90 Index 1 p. 558-572
15 p.
artikel
998 Fast approximation algorithm for job sequencing with deadlines Gens, G.V.
1981
81-90 Index 1 p. 313-318
6 p.
artikel
999 Faster isometric embedding in products of complete graphs Aurenhammer, Franz
1994
81-90 Index 1 p. 17-28
12 p.
artikel
1000 Faster separation of 1-wheel inequalities by graph products de Vries, Sven
2015
81-90 Index 1 p. 74-83
10 p.
artikel
                             2904 gevonden resultaten
 
   volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland