|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
53 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Algorithm for Recognizing Cartesian Graph Bundles |
Zmazek, Blaẑ |
1999 |
3 | C |
p. 217-221 5 p. |
artikel |
|
| 2 | Alternating TSP and Printed Circuit Board Assembly |
Srivastav, Anand |
1999 |
3 | C |
p. 179-183 5 p. |
artikel |
|
| 3 | A New Algorithm for the Maximum-Weight Clique Problem |
Östergård, Patric R.J. |
1999 |
3 | C |
p. 153-156 4 p. |
artikel |
|
| 4 | An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs |
Lakhal, J. |
1999 |
3 | C |
p. 114-117 4 p. |
artikel |
|
| 5 | A note on distance approximating trees in graphs |
Chepoi, V. |
1999 |
3 | C |
p. 39- 1 p. |
artikel |
|
| 6 | Approximating Bandwidth by Mixing Layouts of Interval Graphs |
Kratsch, Dieter |
1999 |
3 | C |
p. 106-109 4 p. |
artikel |
|
| 7 | A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs |
Arbib, Claudio |
1999 |
3 | C |
p. 2-6 5 p. |
artikel |
|
| 8 | Bipartite-Perfect Graphs |
Bang Le, Van |
1999 |
3 | C |
p. 7-12 6 p. |
artikel |
|
| 9 | Bipartite sandwiches: semide?nite relaxations for maximum biclique |
Pasechnik, Dmitrii V. |
1999 |
3 | C |
p. 157-161 5 p. |
artikel |
|
| 10 | Chromatic spectrum is broken |
Jiang, Tao |
1999 |
3 | C |
p. 86-89 4 p. |
artikel |
|
| 11 | 3-colored Ramsey Numbers of Odd Cycles |
Schelten, Annette |
1999 |
3 | C |
p. 176-178 3 p. |
artikel |
|
| 12 | Coloring permutation graphs in parallel |
Nikolopoulos, Stavros D. |
1999 |
3 | C |
p. 146-152 7 p. |
artikel |
|
| 13 | Discrete tomography in four directions |
Tijdeman, by R. |
1999 |
3 | C |
p. 195-198 4 p. |
artikel |
|
| 14 | Edge-Dominating Trails in AT-free Graphs (Extended Abstract) |
Köhler, Ekkehard |
1999 |
3 | C |
p. 95-101 7 p. |
artikel |
|
| 15 | Equilateral Drawing of 2-Connected Planar Chordal Graphs |
Markenzon, L. |
1999 |
3 | C |
p. 128-132 5 p. |
artikel |
|
| 16 | Erdös-type condition for a graph to contain k independent edges |
Pawel Wojda, A. |
1999 |
3 | C |
p. 214-216 3 p. |
artikel |
|
| 17 | Fast generation of nanotube caps |
Brinkmann, G. |
1999 |
3 | C |
p. 32- 1 p. |
artikel |
|
| 18 | Fast generation of some classes of planar graphs |
Brinkmann, G. |
1999 |
3 | C |
p. 28-31 4 p. |
artikel |
|
| 19 | Graphs having distance-n domination number half their order |
Fischermann and, Miranca |
1999 |
3 | C |
p. 51-54 4 p. |
artikel |
|
| 20 | Integral Trees With Diameter 6 or 8 |
Wang, Ligong |
1999 |
3 | C |
p. 208-213 6 p. |
artikel |
|
| 21 | Intersection graphs on trees with a tolerance |
Mulder, H.M. |
1999 |
3 | C |
p. 140- 1 p. |
artikel |
|
| 22 | Introducing Directed Tree Width |
Reed, B. |
1999 |
3 | C |
p. 222-229 8 p. |
artikel |
|
| 23 | Lifting and reduction of antimatroids |
Nakamura, M. |
1999 |
3 | C |
p. 141- 1 p. |
artikel |
|
| 24 | Linear-time Algorithms for Maximum Sets of Sources and sinks |
de Figueiredo, Celina M.H. |
1999 |
3 | C |
p. 230-234 5 p. |
artikel |
|
| 25 | Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity |
Kriesell, Matthias |
1999 |
3 | C |
p. 110-113 4 p. |
artikel |
|
| 26 | Maximal Sets of 2-Factors in Complete Equipartite Graphs |
Hoffmann, Arne |
1999 |
3 | C |
p. 82-85 4 p. |
artikel |
|
| 27 | Maxregularity and Maximal Outerplanar Graphs |
Rodrigues, R.M.N.D. |
1999 |
3 | C |
p. 171-175 5 p. |
artikel |
|
| 28 | Monotonicity and inert fugitive search games |
Stamatiou, Y.C. |
1999 |
3 | C |
p. 184- 1 p. |
artikel |
|
| 29 | Non-preemptive Profile Scheduling and Quasi Interval Orders |
Moukrim, Aziz |
1999 |
3 | C |
p. 133-139 7 p. |
artikel |
|
| 30 | On bounds for the rotation distance between binary coupling trees |
Fack, V. |
1999 |
3 | C |
p. 40-44 5 p. |
artikel |
|
| 31 | On canonical decomposition of bipartite graphs |
Vanherpe, J.M. |
1999 |
3 | C |
p. 199-204 6 p. |
artikel |
|
| 32 | On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract) |
Klavžar, Sandi |
1999 |
3 | C |
p. 90-93 4 p. |
artikel |
|
| 33 | On the structure of graphs with bounded asteroidal number |
Kloks, T. |
1999 |
3 | C |
p. 94- 1 p. |
artikel |
|
| 34 | On triple systems, in particular those with 13 elements |
Gropp, Harald |
1999 |
3 | C |
p. 60-64 5 p. |
artikel |
|
| 35 | Pancyclic orderings of in-tournaments |
Tewes, Meike |
1999 |
3 | C |
p. 185-188 4 p. |
artikel |
|
| 36 | Patches with minimal boundary length |
Greinus, J. |
1999 |
3 | C |
p. 55-59 5 p. |
artikel |
|
| 37 | Polyhedral Graphs with Extreme Numbers of Types of Faces |
Walther, Hansjoachim |
1999 |
3 | C |
p. 205-207 3 p. |
artikel |
|
| 38 | Polyhedral Sets and Integer Rounding |
Niessen, Thomas |
1999 |
3 | C |
p. 142-145 4 p. |
artikel |
|
| 39 | Preface |
1999 |
3 | C |
p. 1- 1 p. |
artikel |
||
| 40 | Provably Good Global Routing of Integrated Circuits |
Lugering, Martin |
1999 |
3 | C |
p. 118-127 10 p. |
artikel |
|
| 41 | Quickly Excluding K 2,r from Planar Graphs |
Thilikos, Dimitrios M. |
1999 |
3 | C |
p. 189-194 6 p. |
artikel |
|
| 42 | SIMPLE MAX-CUT for unit interval graphs and graphs with few P 4s |
Bodlaender, Hans L. |
1999 |
3 | C |
p. 19-26 8 p. |
artikel |
|
| 43 | Solving Frequency Assignment Problems via Tree-Decomposition1 |
Koster, Arie M.C.A. |
1999 |
3 | C |
p. 102-105 4 p. |
artikel |
|
| 44 | Solving the Traveling Circus Problem by Branch & Cut |
Hartmann, Mark |
1999 |
3 | C |
p. 72-76 5 p. |
artikel |
|
| 45 | STEINER-Diagrams |
Blasum, Ulrich |
1999 |
3 | C |
p. 13-18 6 p. |
artikel |
|
| 46 | Test Sets for Vertex Cover Problems |
Hayer, M. |
1999 |
3 | C |
p. 77-81 5 p. |
artikel |
|
| 47 | The cycle structure of regular multipartite tournaments |
Guo, Yubao |
1999 |
3 | C |
p. 65-68 4 p. |
artikel |
|
| 48 | The enumeration of cubic maps with given genus and given face degrees |
Harmuth, Thomas |
1999 |
3 | C |
p. 69-71 3 p. |
artikel |
|
| 49 | The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut |
Corinne, Feremans |
1999 |
3 | C |
p. 45-50 6 p. |
artikel |
|
| 50 | The incidentor coloring of multigraphs and its application in data networks |
Pyatkin, A.V. |
1999 |
3 | C |
p. 162-165 4 p. |
artikel |
|
| 51 | The structure of obstructions to treewidth and pathwidth |
Chlebíková, Janka |
1999 |
3 | C |
p. 33-38 6 p. |
artikel |
|
| 52 | Triangle-free graphs without forbidden subgraphs |
Brandt, S. |
1999 |
3 | C |
p. 27- 1 p. |
artikel |
|
| 53 | Vertex Pancyclic Graphs |
Randerath, Bert |
1999 |
3 | C |
p. 166-170 5 p. |
artikel |
53 gevonden resultaten