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
 
                             52 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 ADD/DROP PROCEDURES FOR THE CAPACITATED PLANT LOCATION PROBLEM Campêlo, Manoel
 2001
 7 C p. 102-105
4 p.
 artikel
2 A distributed algorithm for k-dominating sets Penso, Lucia Draque
 2001
 7 C p. 130-133
4 p.
 artikel
3 A Graph Partitioning Scheme and Applications to Fault Tolerant Computing Cohen, Jaime
 2001
 7 C p. 82-85
4 p.
 artikel
4 A Minimal Spanning Tree Algorithm Applied to Spatial Cluster Analysis Lage, Juliano Palmieri
 2001
 7 C p. 162-165
4 p.
 artikel
5 An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid Morgana, Aurora
 2001
 7 C p. 38-41
4 p.
 artikel
6 An O(n2) Algorithm for the Characteristic Polynomial of a Tree Jacobs, David P.
 2001
 7 C p. 86-89
4 p.
 artikel
7 A Polyhedral Approach for Graph Coloring1 Méndez Díaz -, Isabel
 2001
 7 C p. 178-181
4 p.
 artikel
8 A sufficient condition for self-clique graphs Bondy, Adrian
 2001
 7 C p. 174-177
4 p.
 artikel
9 Asymptotic enumeration of cographs Ravelomanana, Vlady
 2001
 7 C p. 58-61
4 p.
 artikel
10 Bilateral Orientations and Domination Fomin, Fedor V.
 2001
 7 C p. 26-29
4 p.
 artikel
11 Bounds for Optimal Coverings de A. Moreira, Carlos Gustavo T.
 2001
 7 C p. 62-65
4 p.
 artikel
12 Clique Divergent Clockwork Graphs and Partial Orders Larrión, F.
 2001
 7 C p. 10-13
4 p.
 artikel
13 Clique Planar Graphs Alcón, Liliana
 2001
 7 C p. 126-129
4 p.
 artikel
14 Color quantization by pairwise clustering using a reduced graph Medeiros e Sé, Asla
 2001
 7 C p. 138-141
4 p.
 artikel
15 Constructive Upper Bounds for Intersecting Set Systems Grolmusz, Vince
 2001
 7 C p. 54-57
4 p.
 artikel
16 Containment Properties of Product and Power Graphs Fernéndez, Antonio
 2001
 7 C p. 46-49
4 p.
 artikel
17 Distances and Diameters on Iterated Clique Graphs Pizaña, Miguel A.
 2001
 7 C p. 2-5
4 p.
 artikel
18 DNA Fragments Assembly Programs: a comparative study Adi, Said Sadique
 2001
 7 C p. 158-161
4 p.
 artikel
19 Dual Heuristics on the Exact Solution of Large Steiner Problems de Aragão, Marcus Poggi
 2001
 7 C p. 150-153
4 p.
 artikel
20 Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels Uchôa-Filho, Bartolomeu F.
 2001
 7 C p. 118-121
4 p.
 artikel
21 Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem Müller, Felipe Martins
 2001
 7 C p. 122-125
4 p.
 artikel
22 Exact Enumeration of Rooted 3-connected Triangular Maps on the Projective Plane (Extended Abstract) Gao, Zhicheng
 2001
 7 C p. 30-33
4 p.
 artikel
23 Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum Dantas, Simone
 2001
 7 C p. 22-25
4 p.
 artikel
24 Fast Searching in Trees Laber, Eduardo
 2001
 7 C p. 90-93
4 p.
 artikel
25 Generating lower bounds for the prize collecting Steiner problem in graphs Lucena, Abilio
 2001
 7 C p. 70-73
4 p.
 artikel
26 ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors Campêlo, Manoel
 2001
 7 C p. 166-169
4 p.
 artikel
27 Independent spanning cycle-rooted trees in the cartesian product of digraphs Hasunuma, Toru
 2001
 7 C p. 106-109
4 p.
 artikel
28 Maximum flow problems under special nonnegative lower bounds on arc flows Bornstein, Claudio
 2001
 7 C p. 66-69
4 p.
 artikel
29 Multi-Color Discrepancies – Extended Abstract – Doerr, Benjamin
 2001
 7 C p. 78-81
4 p.
 artikel
30 Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width Cǎlinescu, Gruia
 2001
 7 C p. 194-197
4 p.
 artikel
31 Multidimensional Cube Packing Kohayakawa, Y.
 2001
 7 C p. 110-113
4 p.
 artikel
32 Nearly Optimal Partial Steiner Systems Kim, Jeong Han
 2001
 7 C p. 74-77
4 p.
 artikel
33 On asymmetric communication protocols Laber, Eduardo Sany
 2001
 7 C p. 6-9
4 p.
 artikel
34 On generalized split graphs Hell, Pavol
 2001
 7 C p. 98-101
4 p.
 artikel
35 On the complexity of finding even pairs in planar perfect graphs Sampaio, Rudini M.
 2001
 7 C p. 186-189
4 p.
 artikel
36 On the Complexity of Inferring Rooted Evolutionary Trees Jansson, Jesper
 2001
 7 C p. 50-53
4 p.
 artikel
37 On the complexity of the approximation of nonplanarity parameters for cubic graphs Faria, Luerbio
 2001
 7 C p. 18-21
4 p.
 artikel
38 Perfectly Orderable P 4 Composition Hayward, Ryan B.
 2001
 7 C p. 190-193
4 p.
 artikel
39 Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract) Baltz, Andreas
 2001
 7 C p. 42-45
4 p.
 artikel
40 Preface Szwarcfiter, Jayme
 2001
 7 C p. 1-
1 p.
 artikel
41 Reduction Rules for the Covering Tour Problem Motta, Luciene C.S.
 2001
 7 C p. 142-145
4 p.
 artikel
42 Revisiting Tucker's Algorithm to Color Circular-Arc Graphs Valencia-Pabon, Mario E.
 2001
 7 C p. 198-201
4 p.
 artikel
43 Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms Dawande, Milind
 2001
 7 C p. 134-137
4 p.
 artikel
44 Scheduling with Duplication on m Processors with Small Communication Delays Goldman, A.
 2001
 7 C p. 182-185
4 p.
 artikel
45 Some recent results on list coloring Vu, Van H.
 2001
 7 C p. 170-173
4 p.
 artikel
46 Stable marriages with restricted pairs Dias, Vânia M.F.
 2001
 7 C p. 14-17
4 p.
 artikel
47 Symmetry Robust Memory Management of Multidimensional Arrays Lins, Lauro
 2001
 7 C p. 34-37
4 p.
 artikel
48 The Clique Operator, Set Families, and Their Properties Gutierrez, Marisa
 2001
 7 C p. 94-97
4 p.
 artikel
49 The effect of deletions on different insertion disciplines for hash tables (Extended Abstract) Poblete, Patricio V.
 2001
 7 C p. 146-149
4 p.
 artikel
50 Trees with three leaves are (n + l)-unavoidable Céroi, Stéphan
 2001
 7 C p. 202-205
4 p.
 artikel
51 Tutte's 3-flow Conjecture and Matchings in Bipartite Graphs da Silva, C a ̧ ndida Nunes
 2001
 7 C p. 114-117
4 p.
 artikel
52 Variable Sized Bin Packing With Color Constraints Dawande, Milind
 2001
 7 C p. 154-157
4 p.
 artikel
                             52 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland