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
 
                             46 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A combinatorial approach to a general two-term recurrence Mansour, Toufik
2013
161 13-14 p. 2084-2094
11 p.
artikel
2 A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date” Kianfar, K.
2013
161 13-14 p. 2205-2206
2 p.
artikel
3 Approximate strong equilibria in job scheduling games with two uniformly related machines Epstein, Leah
2013
161 13-14 p. 1843-1858
16 p.
artikel
4 Approximations for the Two-Machine Cross-Docking Flow Shop Problem Prot, D.
2013
161 13-14 p. 2107-2119
13 p.
artikel
5 A tight upper bound for 2-rainbow domination in generalized Petersen graphs Wang, Yue-Li
2013
161 13-14 p. 2178-2188
11 p.
artikel
6 Bin covering with cardinality constraints Epstein, Leah
2013
161 13-14 p. 1975-1987
13 p.
artikel
7 Characterizing graphs of small carving-width Belmonte, Rémy
2013
161 13-14 p. 1888-1893
6 p.
artikel
8 2 -clique-bond of stable set polyhedra Galluccio, Anna
2013
161 13-14 p. 1988-2000
13 p.
artikel
9 Closure-based constraints in formal concept analysis Belohlavek, Radim
2013
161 13-14 p. 1894-1911
18 p.
artikel
10 Complementary cycles in almost regular multipartite tournaments, where one cycle has length four Volkmann, Lutz
2013
161 13-14 p. 2169-2177
9 p.
artikel
11 Contents 2013
161 13-14 p. v-vii
nvt p.
artikel
12 Counting humps and peaks in generalized Motzkin paths Mansour, Toufik
2013
161 13-14 p. 2213-2216
4 p.
artikel
13 Determining the L ( 2 , 1 ) -span in polynomial space Junosza-Szaniawski, Konstanty
2013
161 13-14 p. 2052-2061
10 p.
artikel
14 Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems van Zuylen, Anke
2013
161 13-14 p. 2142-2157
16 p.
artikel
15 Discrete tomography for inscribable lattice sets Dulio, P.
2013
161 13-14 p. 1959-1974
16 p.
artikel
16 Dynamic coloring and list dynamic coloring of planar graphs Kim, Seog-Jin
2013
161 13-14 p. 2207-2212
6 p.
artikel
17 Equality in a linear Vizing-like relation that relates the size and total domination number of a graph Henning, Michael A.
2013
161 13-14 p. 2014-2024
11 p.
artikel
18 Equality of domination and transversal numbers in hypergraphs Arumugam, S.
2013
161 13-14 p. 1859-1867
9 p.
artikel
19 Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs Vesel, Aleksander
2013
161 13-14 p. 2158-2168
11 p.
artikel
20 Game matching number of graphs Cranston, Daniel W.
2013
161 13-14 p. 1828-1836
9 p.
artikel
21 Hamiltonicity of large generalized de Bruijn cycles Ducoffe, Guillaume
2013
161 13-14 p. 2200-2204
5 p.
artikel
22 Locating and identifying codes in circulant networks Ghebleh, M.
2013
161 13-14 p. 2001-2007
7 p.
artikel
23 Moplex orderings generated by the LexDFS algorithm Xu, Shou-Jun
2013
161 13-14 p. 2189-2195
7 p.
artikel
24 New bounds and constraint propagation techniques for the clique partitioning problem Jaehn, Florian
2013
161 13-14 p. 2025-2037
13 p.
artikel
25 New lower bound for 2-identifying code in the square grid Junnila, Ville
2013
161 13-14 p. 2042-2051
10 p.
artikel
26 On a generalized model of labeled graphs Kozak, Adam
2013
161 13-14 p. 1818-1827
10 p.
artikel
27 On minimal forbidden subgraph characterizations of balanced graphs Bonomo, Flavia
2013
161 13-14 p. 1925-1942
18 p.
artikel
28 On spanning cycles, paths and trees Mukwembi, Simon
2013
161 13-14 p. 2217-2222
6 p.
artikel
29 On Spieß’s conjecture on harmonic numbers Jin, Hai-Tao
2013
161 13-14 p. 2038-2041
4 p.
artikel
30 On the anti-Kekulé number and odd cycle transversal of regular graphs Ye, Dong
2013
161 13-14 p. 2196-2199
4 p.
artikel
31 On the vertex k -path cover Brešar, Boštjan
2013
161 13-14 p. 1943-1949
7 p.
artikel
32 Partitions of graphs into small and large sets Bojilov, Asen
2013
161 13-14 p. 1912-1924
13 p.
artikel
33 Path covering number and L ( 2 , 1 ) -labeling number of graphs Lu, Changhong
2013
161 13-14 p. 2062-2074
13 p.
artikel
34 Percolation in the secrecy graph Sarkar, Amites
2013
161 13-14 p. 2120-2132
13 p.
artikel
35 Permuting operations on strings and the distribution of their prime numbers Asveld, Peter R.J.
2013
161 13-14 p. 1868-1881
14 p.
artikel
36 Rainbow domination in the lexicographic product of graphs Šumenjak, Tadeja Kraner
2013
161 13-14 p. 2133-2141
9 p.
artikel
37 Resolving the hypercube Beardon, A.F.
2013
161 13-14 p. 1882-1887
6 p.
artikel
38 Restricted arc-connectivity of bipartite tournaments Grüter, Steffen
2013
161 13-14 p. 2008-2013
6 p.
artikel
39 Simplified existence theorems on all fractional [ a , b ] -factors Lu, Hongliang
2013
161 13-14 p. 2075-2078
4 p.
artikel
40 Small ℓ -edge-covers in k -connected graphs Nutov, Zeev
2013
161 13-14 p. 2101-2106
6 p.
artikel
41 The balanced minimum evolution problem under uncertain data Catanzaro, Daniele
2013
161 13-14 p. 1789-1804
16 p.
artikel
42 The energy of q -Kneser graphs and attenuated q -Kneser graphs Lv, Benjian
2013
161 13-14 p. 2079-2083
5 p.
artikel
43 The maximum agreement subtree problem Martin, Daniel M.
2013
161 13-14 p. 1805-1817
13 p.
artikel
44 Three-fast-searchable graphs Dereniowski, Dariusz
2013
161 13-14 p. 1950-1958
9 p.
artikel
45 Two hardness results for core stability in hedonic coalition formation games Deineko, Vladimir G.
2013
161 13-14 p. 1837-1842
6 p.
artikel
46 Which distance-hereditary graphs are cover–incomparability graphs? Maxová, Jana
2013
161 13-14 p. 2095-2100
6 p.
artikel
                             46 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland