Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             71 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Cryptographic Code Based on Digraphs Strauss, S.
 2001
 10 C p. 268-271
4 p.
 artikel
2 A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs Guitart, P.
 2001
 10 C p. 133-136
4 p.
 artikel
3 A Kuratowski Theorem for some Pseudosurfaces Boza, L.
 2001
 10 C p. 42-46
5 p.
 artikel
4 A note on Random Homomorphism from ArbitraryGraphs to Z Loebl, M.
 2001
 10 C p. 176-180
5 p.
 artikel
5 Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis Louchard, Guy
 2001
 10 C p. 181-186
6 p.
 artikel
6 Assymptotically efficient triangulations of the d-cube∗ Orden, David
 2001
 10 C p. 212-215
4 p.
 artikel
7 Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products Suzuki, Susumu
 2001
 10 C p. 272-276
5 p.
 artikel
8 Bounds on the rank and kernel of perfect codes Phelps, Kevin T.
 2001
 10 C p. 235-237
3 p.
 artikel
9 Bull-Reducible Berge Graphs are Perfect Everett, Hazel
 2001
 10 C p. 93-95
3 p.
 artikel
10 Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs McDiarmid, Colin
 2001
 10 C p. 198-201
4 p.
 artikel
11 Combinatorial designs and perfect codes Phelps, Kevin T.
 2001
 10 C p. 220-234
15 p.
 artikel
12 Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability Sans, Oda
 2001
 10 C p. 250-254
5 p.
 artikel
13 Construction of symmetric block designs using normal subgroups of automorphism groups Cepulic, Vladimir
 2001
 10 C p. 77-79
3 p.
 artikel
14 COUNTING PRIMITIVE ELEMENTS IN FREE GROUPS Burillo, J.
 2001
 10 C p. 50-53
4 p.
 artikel
15 Cubes polynomial and its derivatives Brešar, Boštjan
 2001
 10 C p. 47-49
3 p.
 artikel
16 Delta-systems and qualitative (in)dependence Körner, János
 2001
 10 C p. 160-163
4 p.
 artikel
17 Equilibrium Measures on Finite Networks: Effective Resistance and Hitting Time Carmona, Angeles
 2001
 10 C p. 68-71
4 p.
 artikel
18 Every Cubic Cage is quasi 4-connected Marcote,
 2001
 10 C p. 216-219
4 p.
 artikel
19 Every Z2k-Code is a Binary Propelinear Code Fernández, C.
 2001
 10 C p. 100-102
3 p.
 artikel
20 Extremal k-edge-hamiltonian Hypergraphs Prankl, Péter
 2001
 10 C p. 109-112
4 p.
 artikel
21 Extremal problems under dimension constraints Ahlswede, R.
 2001
 10 C p. 154-156
3 p.
 artikel
22 Fast approximation schemes for K 3, 3-minor-free or K 5-minor-free graphs Hajiaghayi, Mohammadtaghi
 2001
 10 C p. 137-142
6 p.
 artikel
23 Geometric Thickness in a Grid of Linear Area Wood, David R.
 2001
 10 C p. 291-296
6 p.
 artikel
24 Graphs, intersections of subgroups of free groups and corank Weil, Pascal
 2001
 10 C p. 286-290
5 p.
 artikel
25 Hadamard 2-(47,23,11) Designs havingFrob55 as an Automorphism Group Crnkovic, Dean
 2001
 10 C p. 88-89
2 p.
 artikel
26 Incidence geometries for the finite symmetric groups Cara, Philippe
 2001
 10 C p. 64-67
4 p.
 artikel
27 Infinite graph embeddings on tubular surfaces Boza, L.
 2001
 10 C p. 39-41
3 p.
 artikel
28 Isometry classes of codes arising from sets of points in the projective plane Martí, Ricard
 2001
 10 C p. 192-193
2 p.
 artikel
29 Iterating Through Labelled Combinatorial Structures Molinero, Xavier
 2001
 10 C p. 208-211
4 p.
 artikel
30 Kalai's squeezed 3-spheres are polytopal Pfeifle, Julian
 2001
 10 C p. 238-241
4 p.
 artikel
31 Local and Mean Ramsey Numbers for Some Graphs Bielak, Halina
 2001
 10 C p. 23-26
4 p.
 artikel
32 Matching as the Intersection of Matroids Fekete, Sándor P.
 2001
 10 C p. 96-99
4 p.
 artikel
33 Multi-index axial assignment problem on single-cyclic permutations Gimadi, Edward
 2001
 10 C p. 125-128
4 p.
 artikel
34 Neighborhood Communications in Networks Fertin, Guillaume
 2001
 10 C p. 103-108
6 p.
 artikel
35 Non-Separable Detachments of Graphs Jackson, Bill
 2001
 10 C p. 151-153
3 p.
 artikel
36 On completely regular binary codes and t-designs∗ Borges, J.
 2001
 10 C p. 30-33
4 p.
 artikel
37 On Dense Triple-Loop Networks F., Aguiló, F.
 2001
 10 C p. 261-264
4 p.
 artikel
38 On Finding The Limit Shape Of Optimal Convex Lattice Polygons Stojaković, Miloš
 2001
 10 C p. 265-267
3 p.
 artikel
39 On Optimum Cycle Bases Galbiati, Giulia
 2001
 10 C p. 113-116
4 p.
 artikel
40 On regular-stable graphs Barbosa, Rommel
 2001
 10 C p. 20-22
3 p.
 artikel
41 On some new 2-(56, 12, 3) designs Rukavina, Sanja
 2001
 10 C p. 245-246
2 p.
 artikel
42 On the average Cartier-Foata height of traces Krob, Daniel
 2001
 10 C p. 164-171
8 p.
 artikel
43 On the connectedness property of service areas for the Network Facility Location Problem Gimadi, E.Kh.
 2001
 10 C p. 121-124
4 p.
 artikel
44 On the growth of components with non-fixed excesses Baert, Anne-Elisabeth
 2001
 10 C p. 7-12
6 p.
 artikel
45 On the Maximum Size of (p, Q)—free Families Föredi, Zoltan
 2001
 10 C p. 247-249
3 p.
 artikel
46 On the orthogonal product of simplices and products of truncated Boolean lattices Leek, Uwe
 2001
 10 C p. 172-175
4 p.
 artikel
47 On the packing of trees into their power Kheddouci, Hamamache
 2001
 10 C p. 157-159
3 p.
 artikel
48 On the Pebbling Threshold Spectrum Hurlbert, Glenn
 2001
 10 C p. 146-150
5 p.
 artikel
49 On the Spectrum of a Weakly Distance-Regular Digraph Comellas, F.
 2001
 10 C p. 80-83
4 p.
 artikel
50 On the Universality of Small-World Graphs Comelas, Francesc
 2001
 10 C p. 84-87
4 p.
 artikel
51 Optical Routing of Uniform Instances in Cayley Graphs Togni, Olivier
 2001
 10 C p. 281-285
5 p.
 artikel
52 Optimal partition of a bipartite graph into non-crossing matchings Malucelli, Federico
 2001
 10 C p. 187-191
5 p.
 artikel
53 Orthogonal directed covers by flowers Hartmann, Sven
 2001
 10 C p. 143-145
3 p.
 artikel
54 Preface Nesetril, Jaroslav
 2001
 10 C p. 1-
1 p.
 artikel
55 Random Generation of Directed Acyclic Graphs Melançon, G.
 2001
 10 C p. 202-207
6 p.
 artikel
56 Random strongly regular graphs? Cameron, Peter J.
 2001
 10 C p. 54-63
10 p.
 artikel
57 Size Ramsey Numbers and Integer Programming Pikhurko, Oleg
 2001
 10 C p. 242-244
3 p.
 artikel
58 Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs Gavoille, Cyril
 2001
 10 C p. 117-120
4 p.
 artikel
59 2-star-coloring of graphs Barát, János
 2001
 10 C p. 17-19
3 p.
 artikel
60 STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp) Cera, M.
 2001
 10 C p. 72-74
3 p.
 artikel
61 Tiling a Manhattan Polyomino with Bars Bodini, Olivier
 2001
 10 C p. 27-29
3 p.
 artikel
62 Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) Shastri, Aditya
 2001
 10 C p. 255-260
6 p.
 artikel
63 Transversals of hypergraphs with geometric flavor Matousek, Jiri
 2001
 10 C p. 194-197
4 p.
 artikel
64 Tree-decompositions of small pathwidth Arne Telle, Jan
 2001
 10 C p. 277-280
4 p.
 artikel
65 Treewidth of planar graphs: connections with duality Bouchitté, Vincent
 2001
 10 C p. 34-38
5 p.
 artikel
66 Triangles n-Connectivity in Simplicial 2-Complexes CHáVEZ de DIEGO, M.J.
 2001
 10 C p. 75-76
2 p.
 artikel
67 Two Models of Random Intersection Graphs and their Applications Godehardt, Erhard
 2001
 10 C p. 129-132
4 p.
 artikel
68 Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence Balbuena, C.
 2001
 10 C p. 13-16
4 p.
 artikel
69 Vector Balancing Games with Aging Doerr, Benjamin
 2001
 10 C p. 90-92
3 p.
 artikel
70 Vertices of degree 6 in a 6-contraction critical graph Ando, Kiyoshi
 2001
 10 C p. 2-6
5 p.
 artikel
71 Weak k-reconstruction of cartesian product graphs Imrich, Wilfried
 2001
 10 C p. 297-300
4 p.
 artikel
                             71 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland