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
 
                             59 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives Bahiense, Laura
 2009
 35 C p. 347-352
6 p.
 artikel
2 A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem Hoshino, Edna Ayako
 2009
 35 C p. 103-108
6 p.
 artikel
3 A branch&cut algorithm for the maximum common edge subgraph problem Manić, G.
 2009
 35 C p. 47-52
6 p.
 artikel
4 A Characterization of Graphs with Fractional Total Chromatic Number Equal to Δ + 2 Ito, Takehiro
 2009
 35 C p. 235-240
6 p.
 artikel
5 A Concurrent Implementation of Skip Graphs Mendes, Hammurabi
 2009
 35 C p. 263-268
6 p.
 artikel
6 Acyclic Vertex Coloring of Graphs of Maximum Degree Six Varagani, Satish
 2009
 35 C p. 177-182
6 p.
 artikel
7 Almost spanning subgraphs of random graphs after adversarial edge removal Böttcher, Julia
 2009
 35 C p. 335-340
6 p.
 artikel
8 A note on permutation regularity Hoppen, C.
 2009
 35 C p. 183-188
6 p.
 artikel
9 A polyhedral study of the acyclic coloring problem Braga, Mónica
 2009
 35 C p. 35-40
6 p.
 artikel
10 A polyhedral study of the maximum edge subgraph problem Bonomo, Flavia
 2009
 35 C p. 197-202
6 p.
 artikel
11 A Set Partitioning Approach to Shunting Cardonha, Carlos
 2009
 35 C p. 359-364
6 p.
 artikel
12 b-chromatic number of cacti Campos, Victor
 2009
 35 C p. 281-286
6 p.
 artikel
13 b-coloring of m-tight graphs Linhares Sales, Cláudia
 2009
 35 C p. 209-214
6 p.
 artikel
14 Boltzmann sampling of ordered structures Roussel, Olivier
 2009
 35 C p. 305-310
6 p.
 artikel
15 Clique-Coloring Circular-Arc Graphs Cerioli, Márcia R.
 2009
 35 C p. 287-292
6 p.
 artikel
16 Convergence Time to Nash Equilibrium in Selfish Bin Packing Miyazawa, Flávio K.
 2009
 35 C p. 151-156
6 p.
 artikel
17 Cycle transversals in bounded degree graphs Groshaus, M.
 2009
 35 C p. 189-195
7 p.
 artikel
18 Degree Sequence of Tight Distance Graphs Matamala, M.
 2009
 35 C p. 329-334
6 p.
 artikel
19 Distance-Hereditary Comparability Graphs Di Stefano, Gabriele
 2009
 35 C p. 227-233
7 p.
 artikel
20 Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized Valle, Cristiano Arbex
 2009
 35 C p. 133-138
6 p.
 artikel
21 Gaps in discrete random samples: extended abstract Grübel, Rudolf
 2009
 35 C p. 97-102
6 p.
 artikel
22 Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals Dourado, Mitre Costa
 2009
 35 C p. 323-328
6 p.
 artikel
23 Good edge-labelling of graphs Araújo, Júlio
 2009
 35 C p. 275-280
6 p.
 artikel
24 Graph transformations preserving the stability number Lévêque, Benjamin
 2009
 35 C p. 3-8
6 p.
 artikel
25 Grundy number on P 4 -classes Araújo, Júlio César Silva
 2009
 35 C p. 21-27
7 p.
 artikel
26 Impact of a varying capacity on the all pairs 2-route network flows Diallo, Madiagne
 2009
 35 C p. 59-64
6 p.
 artikel
27 Impartial Solitaire Clobber played on Powers of Paths Pará, Telma
 2009
 35 C p. 257-262
6 p.
 artikel
28 Intersection Dimension and Maximum Degree Aravind, N.R.
 2009
 35 C p. 353-358
6 p.
 artikel
29 Invariant sets under permutation, extremal graphs, and covering codes Monte Carmelo, E.L.
 2009
 35 C p. 77-82
6 p.
 artikel
30 Maximizing the algebraic connectivity for a subclass of caterpillars Rojo, Oscar
 2009
 35 C p. 65-70
6 p.
 artikel
31 Minimal separators in P 4 -tidy graphs Pedrotti, Vagner
 2009
 35 C p. 71-76
6 p.
 artikel
32 Minimal vertex separators and new characterizations for dually chordal graphs De Caria, Pablo
 2009
 35 C p. 127-132
6 p.
 artikel
33 Minimum Sum Coloring of P 4-sparse graphs Bonomo, Flavia
 2009
 35 C p. 293-298
6 p.
 artikel
34 Note on strong refutation algorithms for random k-SAT formulas Hàn, Hiệp
 2009
 35 C p. 157-162
6 p.
 artikel
35 On coloring problems with local constraints Bonomo, Flavia
 2009
 35 C p. 215-220
6 p.
 artikel
36 On λ-coloring split, chordal bipartite and weakly chordal graphs Cerioli, Márcia R.
 2009
 35 C p. 299-304
6 p.
 artikel
37 On minimal forbidden subgraph characterizations of balanced graphs Bonomo, Flavia
 2009
 35 C p. 41-46
6 p.
 artikel
38 On Q-spectral integral variation de Freitas, Maria Aguieiras A.
 2009
 35 C p. 203-208
6 p.
 artikel
39 On s-t paths and trails in edge-colored graphs Gourvès, Laurent
 2009
 35 C p. 221-226
6 p.
 artikel
40 On the basis graph of a bicolored matroid Figueroa, Ana Paulina
 2009
 35 C p. 269-273
5 p.
 artikel
41 On the clique behavior of circulants with three small jumps Larrión, F.
 2009
 35 C p. 341-346
6 p.
 artikel
42 On the dominating set polytope of web graphs Bianchi, S.
 2009
 35 C p. 121-126
6 p.
 artikel
43 On the Metric Dimension of Infinite Graphs Cáceres, J.
 2009
 35 C p. 15-20
6 p.
 artikel
44 On the Pfaffian Number of Graphs Miranda, Alberto Alexandre Assis
 2009
 35 C p. 145-150
6 p.
 artikel
45 On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs Pêcher, Arnaud
 2009
 35 C p. 53-58
6 p.
 artikel
46 Optimizing the throughput, service rate, and buffer allocation in finite queueing networks Cruz, F.R.B.
 2009
 35 C p. 163-168
6 p.
 artikel
47 Polynomial Time Recognition of Uniform Cocircuit Graphs Aiza, Ricardo Gómez
 2009
 35 C p. 29-34
6 p.
 artikel
48 Preface Liebling, Thomas M.
 2009
 35 C p. 1-2
2 p.
 artikel
49 Properties of an Approximability-related Parameter on Circular Complete Graphs Engström, Robert
 2009
 35 C p. 115-120
6 p.
 artikel
50 Short Models for Unit Interval Graphs Lin, Min Chih
 2009
 35 C p. 247-255
9 p.
 artikel
51 Skew partition sandwich problem is NP-complete Teixeira, R.B.
 2009
 35 C p. 9-14
6 p.
 artikel
52 Strength of facets for the set covering and set packing polyhedra on circulant matrices Bianchi, S.
 2009
 35 C p. 109-114
6 p.
 artikel
53 The chromatic number of random lifts of K 5 \ e Farzad, Babak
 2009
 35 C p. 311-316
6 p.
 artikel
54 The Chvátal closure of generalized stable sets in bidirected graphs Campelo, Manoel
 2009
 35 C p. 89-95
7 p.
 artikel
55 The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes Milanič, Martin
 2009
 35 C p. 317-322
6 p.
 artikel
56 The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks Bechelane, Carla
 2009
 35 C p. 139-144
6 p.
 artikel
57 The Mixed Binary Euclid Algorithm Sedjelmaci, Sidi Mohamed
 2009
 35 C p. 169-176
8 p.
 artikel
58 The number of convergent graphs under the biclique operator with no twin vertices is finite Groshaus, Marina E.
 2009
 35 C p. 241-246
6 p.
 artikel
59 Upper and lower bounding procedures for the minimum caterpillar spanning problem Simonetti, L.
 2009
 35 C p. 83-88
6 p.
 artikel
                             59 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland