default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 8
Volume 8, May 2001
- Hajo Broersma
, Ulrich Faigle, Johann L. Hurink, Stefan Pickl:
Preface: Volume 8. 1 - Jørgen Bang-Jensen, Anders Yeo:
Making a tournament k-arc-strong by reversing arcs. 2-5 - Anne Berry, Jean Paul Bordat:
Moplex elimination orderings. 6-9 - Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader:
Strongly Connected Components can Predict Protein Structure. 10-13 - A. F. Dumb, Walter Kern:
A simple dual ascent algorithm for the multilevel facility location problem. 14-17 - Tiziana Calamoneri, Rossella Petreschi:
LD-Coloring of Regular Tiling (Extended Abstract). 18-21 - Stéphan Ceroi:
Clique number and ball containment number of unit ball graphs. 22-25 - Carlo Meloni:
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. 26 - Benjamin Doerr, Anand Srivastav:
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. 27-30 - Thomas Epping, Winfried Hochstättler, Peter Oertel:
Some Results on a Paint Shop Problem for Words. 31-33 - Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Extending Partial Suborders. 34-37 - Irene Finocchi, Rossella Petreschi:
Tree partitioning via vertex deletion. 38-41 - Harald Gropp:
Nonsymmetric configurations with line sizek=4. 42-45 - Lars Kaderali, Alexander Schliep:
A new Algorithm for Accelerating Pair-Wise Computations of Melting Temperature. 46-49 - M. Kloock:
Factorization as a SAT problem. 50-53 - Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel:
Treewidth: Computational Experiments. 54-57 - Dmitrii Lozovanu:
Discrete optimal control problems and dynamic games with p players. 58-61 - Michal Malafiejski:
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs. 62 - Sounaka Mishra, Kripasindhu Sikdar:
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract). 63-66 - Stavros D. Nikolopoulos:
Hamiltonian Cycles in Quasi-threshold Graphs. 67 - Gianpaolo Oriolo:
Clique Covers in Claw-Free Berge Graphs. 68-71 - Stefan Pickl:
Combinatorial Structures of Max-Type Functions characterizing the Optimal Solution of the Equivalence Problem. 72-75 - Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. 76-79 - Stefan Porschen:
On Covering Z-Grid Points by Rectangles. 80-83 - Roberto Santana, Carlos Alberto Ochoa Ortíz Zezzatti, Marta Soto:
On the use of Factorized Distribution Algorithms for problems defined on graphs. 84 - Bert Randerath, Ingo Schiermeyer:
3-Colorability element oF P for p6-free Graphs. 85-89 - Jens Schreyer, Hansjoachim Walther:
Edge-Oblique Polyhedral Graphs. 90-93 - Zdzislaw Skupien:
BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically. 94-97 - Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. 98-101 - M. M. Ibrahim Mohamed, B. Tawfik:
A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear Steiner Minimal Tree. 102-105 - V. S. Izhutkin, A. A. Sushenzov:
Study of Methods of Nonlinear Optimization Using Computer Means. 106-110 - Oswaldo Vernet, Lilian Markenzon:
Solving Problems for Maximal Reducible Flowgraphs. 111-114 - Angela Niciilitsa, Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular and uniquely colorable mixed hypergraphs. 115-118 - Ligong Wang, Xueliang Li, Shenggui Zhang:
Some New Families of Integral Trees with Diameters 4 and 6. 119-123 - Gerhard-Wilhelm Weber:
Impulses from Results of Inverse Problems to Discrete Tomography. 124-127 - Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. 128-132 - Blaz Zmazek, Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs (Extended Abstract). 133-136
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-29 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
