Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             30 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A bounded-risk mechanism for the kidney exchange game Esfandiari, Hossein
2018
243 C p. 46-53
artikel
2 Addendum to “Vertex adjacencies in the set covering polyhedron” [Discrete Appl. Math. 218 (2017) 40–56] Aguilera, Néstor E.
2018
243 C p. 311-315
artikel
3 A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines Chrétienne, Philippe
2018
243 C p. 132-139
artikel
4 Approximating weighted induced matchings Lin, Min Chih
2018
243 C p. 304-310
artikel
5 A three-person deterministic graphical game without Nash equilibria Boros, Endre
2018
243 C p. 21-38
artikel
6 Complexity of Grundy coloring and its variants Bonnet, Édouard
2018
243 C p. 99-114
artikel
7 Discrepancy minimizing spectral clustering Bolla, Marianna
2018
243 C p. 286-289
artikel
8 Distribution centers in graphs Desormeaux, Wyatt J.
2018
243 C p. 186-193
artikel
9 Editorial Board 2018
243 C p. ii
artikel
10 Efficient eight-regular circulants based on the Kronecker product Jha, Pranava K.
2018
243 C p. 207-218
artikel
11 Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2 × n rectangles Langner, Johanna
2018
243 C p. 297-303
artikel
12 Extremal graphs with respect to generalized A B C index Chen, Xiaodan
2018
243 C p. 115-124
artikel
13 Fixed points and connections between positive and negative cycles in Boolean networks Richard, Adrien
2018
243 C p. 1-10
artikel
14 Gallai’s question and constructions of almost hypotraceable graphs Wiener, Gábor
2018
243 C p. 270-278
artikel
15 Hart and Mas-Colell consistency in PERT problems Bergantiños, Gustavo
2018
243 C p. 11-20
artikel
16 Investigating results and performance of search and construction algorithms for word-based LFSRs, σ -LFSRs Bishoi, Susil Kumar
2018
243 C p. 90-98
artikel
17 Large-width bounds for learning half-spaces on distance spaces Anthony, Martin
2018
243 C p. 73-89
artikel
18 Matching preclusion for n -grid graphs Ding, Qi
2018
243 C p. 194-206
artikel
19 On a four-parameter generalization of some special sequences da Silva, Robson
2018
243 C p. 154-171
artikel
20 On chordal graph and line graph squares Scheidweiler, Robert
2018
243 C p. 239-247
artikel
21 On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs Das, Kinkar Ch.
2018
243 C p. 172-185
artikel
22 On distance-preserving elimination orderings in graphs: Complexity and algorithms Coudert, David
2018
243 C p. 140-153
artikel
23 On linear algebra of balance-binomial graphs Kar, Kübra
2018
243 C p. 290-296
artikel
24 On tame, pet, domestic, and miserable impartial games Gurvich, Vladimir
2018
243 C p. 54-72
artikel
25 On the chromatic numbers of small-dimensional Euclidean spaces Cherkashin, Danila
2018
243 C p. 125-131
artikel
26 On the complexity of finding and counting solution-free sets of integers Meeks, Kitty
2018
243 C p. 219-238
artikel
27 On the generalized Wiener polarity index of trees with a given diameter Yue, Jun
2018
243 C p. 279-285
artikel
28 Ordinal sums of impartial games Carvalho, Alda
2018
243 C p. 39-45
artikel
29 Rainbow connections in digraphs Sidorowicz, Elżbieta
2018
243 C p. 248-261
artikel
30 Upper bounds of r -hued colorings of planar graphs Song, Huimin
2018
243 C p. 262-269
artikel
                             30 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland