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
 
                             52 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A central approach to bound the number of crossings in a generalized configuration Ábrego, Bernardo M.
2008
30 C p. 273-278
6 p.
artikel
2 Algorithmic Aspects of Monophonic Convexity Dourado, Mitre C.
2008
30 C p. 177-182
6 p.
artikel
3 A New Lower Bound for the Minimum Linear Arrangement of a Graph Amaral, André R.S.
2008
30 C p. 87-92
6 p.
artikel
4 A New Neighborhood for the QAP Goldbarg, Elizabeth F.G.
2008
30 C p. 3-8
6 p.
artikel
5 A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs Miranda, Alberto Alexandre Assis
2008
30 C p. 171-176
6 p.
artikel
6 A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models Weintraub, Andres
2008
30 C p. 297-302
6 p.
artikel
7 Arithmetic relations in the set covering polyhedron of circulant clutters Aguilera, Néstor E.
2008
30 C p. 123-128
6 p.
artikel
8 A robust P2P streaming architecture and its application to a high quality live-video service Cancela, Héctor
2008
30 C p. 219-224
6 p.
artikel
9 Bounding the pseudoachromatic index of the complete graph via projective planes Araujo-Pardo, Gabriela
2008
30 C p. 105-110
6 p.
artikel
10 Chromatic Edge Strength of Some Multigraphs Cardinal, Jean
2008
30 C p. 39-44
6 p.
artikel
11 Clique-coloring UE and UEH graphs Cerioli, Márcia R.
2008
30 C p. 201-206
6 p.
artikel
12 Clique trees of chordal graphs: leafage and 3-asteroidals Gutierrez, M.
2008
30 C p. 237-242
6 p.
artikel
13 Colouring clique-hypergraphs of circulant graphs Campos, C.N.
2008
30 C p. 189-194
6 p.
artikel
14 Combinatorial flexibility problems and their computational complexity Aguilera, Néstor E.
2008
30 C p. 303-308
6 p.
artikel
15 Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem Noronha, Thiago F.
2008
30 C p. 93-98
6 p.
artikel
16 4-cycles in mixing digraphs Amini, Omid
2008
30 C p. 63-68
6 p.
artikel
17 Edge Coloring of Split Graphs Almeida, S.M.
2008
30 C p. 21-26
6 p.
artikel
18 Even-hole-free planar graphs have bounded treewidth da Silva, Aline Alves
2008
30 C p. 129-134
6 p.
artikel
19 Finding Folkman Numbers via MAX CUT Problem Dudek, Andrzej
2008
30 C p. 99-104
6 p.
artikel
20 Flow-Critical Graphs da Silva, Cândida Nunes
2008
30 C p. 165-170
6 p.
artikel
21 Flow Hypergraph Reducibility Guedes, A.L.P.
2008
30 C p. 255-260
6 p.
artikel
22 G-Graphs and Algebraic Hypergraphs Bretto, Alain
2008
30 C p. 153-158
6 p.
artikel
23 Homomorphisms of 2-edge-colored graphs Montejano, Amanda
2008
30 C p. 33-38
6 p.
artikel
24 Integer Programming Formulations for the k-Cardinality Tree Problem Quintão, Frederico P.
2008
30 C p. 225-230
6 p.
artikel
25 Iterated Clique Graphs and Contractibility Larrión, F.
2008
30 C p. 267-271
5 p.
artikel
26 2K 2 vertex-set partition into nonempty parts Dantas, Simone
2008
30 C p. 291-296
6 p.
artikel
27 Limited Packings in Graphs Gallant, Robert
2008
30 C p. 15-20
6 p.
artikel
28 Linear-Interval Dimension and PI Orders Cerioli, Márcia R.
2008
30 C p. 111-116
6 p.
artikel
29 List Colouring Constants of Triangle Free Graphs Amini, Omid
2008
30 C p. 135-140
6 p.
artikel
30 Nowhere-zero 5-flows and (1, 2)-factors Matamala, Martín
2008
30 C p. 279-284
6 p.
artikel
31 On a Conjecture of Víctor Neumann-Lara Llano, Bernardo
2008
30 C p. 207-212
6 p.
artikel
32 On cliques of Helly Circular-arc Graphs Lin, Min Chih
2008
30 C p. 117-122
6 p.
artikel
33 Online Bounded Coloring of Permutation and Overlap Graphs Demange, Marc
2008
30 C p. 213-218
6 p.
artikel
34 On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs Alcón, L.
2008
30 C p. 147-152
6 p.
artikel
35 On the complexity of feedback set problems in signed digraphs Montalva, Marco
2008
30 C p. 249-254
6 p.
artikel
36 On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs Rall, Douglas F.
2008
30 C p. 57-61
5 p.
artikel
37 Partial Characterizations of Circular-Arc Graphs Bonomo, F.
2008
30 C p. 45-50
6 p.
artikel
38 Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs Bonomo, Flavia
2008
30 C p. 51-56
6 p.
artikel
39 Preface Liebling, Th.
2008
30 C p. 1-2
2 p.
artikel
40 Random Graphs, Retractions and Clique Graphs Larrión, F.
2008
30 C p. 285-290
6 p.
artikel
41 Repetition-free longest common subsequence Adi, S.S.
2008
30 C p. 243-248
6 p.
artikel
42 Some Inverse Traveling Salesman Problems Chung, Yerim
2008
30 C p. 9-14
6 p.
artikel
43 Stronger upper and lower bounds for a hard batching problem to feed assembly lines da Cunha, Alexandre Salles
2008
30 C p. 159-164
6 p.
artikel
44 Strong oriented chromatic number of planar graphs without cycles of specific lengths Montassier, Mickaël
2008
30 C p. 27-32
6 p.
artikel
45 Sufficient conditions for a graph to be edge-colorable with maximum degree colors Machado, R.C.S.
2008
30 C p. 69-74
6 p.
artikel
46 The Football Pool Polytope Marenco, Javier L.
2008
30 C p. 75-80
6 p.
artikel
47 The Generalized Max-Controlled Set Problem Santos, Ivairton M.
2008
30 C p. 183-188
6 p.
artikel
48 The maximum number of halving lines and the rectilinear crossing number of K n for n ⩽ 27 Ábrego, Bernardo M.
2008
30 C p. 261-266
6 p.
artikel
49 The nonidealness index of circulant matrices Argiroffo, Gabriela R.
2008
30 C p. 195-200
6 p.
artikel
50 The polynomial dichotomy for three nonempty part sandwich problems Teixeira, Rafael B.
2008
30 C p. 81-86
6 p.
artikel
51 The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks Huc, Florian
2008
30 C p. 141-146
6 p.
artikel
52 Totally Multicolored diamonds Montellano-Ballesteros, Juan José
2008
30 C p. 231-236
6 p.
artikel
                             52 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland