Volume 27, October 2006

ODSA 2006 - Conference on Optimal Discrete Structures and Algorithms, Rostock (Germany), 4-6 September 2006, Edited by M. Grüttmüller and H.-D.O.F. Gronau

• 
  Stephan Dominique Andres: The incidence game chromatic number. 1-2
• 
  Levon Aslanyan, Hasmik Sahakyan: Numerical characterisation of n-cube subset partitioning. 3-4
• 
  Walid Ben-Ameur: New bounds for the maximum cut problem. 5
• 
  Pavel A. Borisovsky, Anton V. Eremeev: A comparative study of some evolutionary algorithms. 7-8
• 
  Isma Bouchemakh, Mohouhand Aouane: Independence set of maximum weight in the order-interval hypergraph of the interval order. 9
• 
  Sadek Bouroubi, Nesrine Benyahia Tani: On the poset of partitions of an integer. 11
• 
  Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: On Modular Decomposition Concepts: the case for Homogeneous Relations. 13-14
• 
  Dietmar Cieslik: Connecting Networks of Minimal Cost. 15
• 
  Charles J. Colbourn, Daniel W. McClary: Detecting and Locating Interaction Faults. 17-18
• 
  Natalia de Ridder, H. N. de Ridder: Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs. 19-20
• 
  H. N. de Ridder, Van Bang Le, Daniel Bayer: On probe classes of graphs. 21
• 
  Konrad Engel: Optimal matrix-segmentation by rectangles. 23-24
• 
  Elaine M. Eschen, Jeremy Spinrad: Finding Triangles in Restricted Classes of Graphs. 25-26
• 
  Stephan Foldes, Navin M. Singhi: On maximal instantaneous codes. 27-28
• 
  Edward Gimadi, Alexey Baburin, Nikolai Glebov, Artem V. Pyatkin: NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. 29-31
• 
  Edward Gimadi: Asymptotically optimal approach for solving some hard discrete optimization problems. 33-34
• 
  Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos: Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. 35-36
• 
  Frank Göring, Christoph Helmberg, Markus Wappler: The rotational Dimension of a graph. 37-38
• 
  Martin Charles Golumbic: Twenty Years of EPT Graphs: From Haifa to Rostock. 39-40
• 
  Georg Gottlob: Second-Order Logic over Finite Structures - Report on a Research Programme. 41-42
• 
  Harald Gropp: Nonisomorphic configurations n_k. 43-44
• 
  Martin Grüttmüller: Enumeration of Super-simple Cyclic Block Designs of Small Order. 45-46
• 
  Horst W. Hamacher: Consecutive Ones Decomposition of Integer Matrices and Applications. 47-48
• 
  Csanád Imreh: On-line scheduling with general machine cost functions. 49-50
• 
  Masaru Iwasa, Hiroo Saito, Tomomi Matsui: Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks. 51-52
• 
  Thomas Kalinowski: Optimization of Multi-Threshold Circuits. 53-54
• 
  Gyula O. H. Katona: Forbidden inclusion patterns in families of subsets. 55-56
• 
  André A. Keller: Matching Theory and Economic Model Building. 57-58
• 
  Alexander A. Kolpakov, A. G. Kolpakov: Design of "Intelligent" Structures as a Discrete Optimal Problem. 59-60
• 
  Alexander G. Kolpakov, A. A. Kolpakov: Optimal Algorithm for Solution of Discrete Convex Combinations Problem. 61-62
• 
  Yusuke Kuroki, Tomomi Matsui: Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem. 63-64
• 
  Sascha Kurz, Axel Kohnert: Integral point sets over I. 65-66
• 
  Reinhard Laue: t-Wise Balanced Designs. 67
• 
  Federico Mancini, Pinar Heggernes: A completely dynamic algorithm for split graphs. 69-70
• 
  Victor Mitrana, Florin Manea, Carlos Martín-Vide: On Some Algorithmic Problems Regarding the Hairpin Completion. 71-72
• 
  Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le: Graph classes related to chordal graphs and chordal bipartite graphs. 73-74
• 
  Patric R. J. Östergård, Petteri Kaski: There are exactly five biplanes with k=11. 75
• 
  Kenneth Oksanen: Searching for Selection Algorithms. 77
• 
  Bhawani Sankar Panda, Anita Das: Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. 79-80
• 
  Florian Pfender: Visibility graphs of point sets in the plane. 81
• 
  Erich Prisner: Generalizing the Wolf-Goat-Cabbage Problem. 83
• 
  Dieter Rautenbach, Andreas Brandstädt, Van Bang Le: Distance-Hereditary 5-Leaf Powers. 85-86
• 
  Olivier Raynaud, Raoul Medina, Caroline Noyer: Twin Vertices in Hypergraphs. 87-89
• 
  Franco Robledo: On the Generalized Steiner Problem with Network Reliability Conditions. 91-92
• 
  Ivan A. Rykov: Polynomial approximation algorithms for solving resource-constrained project scheduling problem. 93-94
• 
  Majid Sarrafzadeh, Foad Dabiri, Ani Nahapetian: General Delay Budgeting on Directed Acyclic Graphs with Applications in CAD. 95-96
• 
  Pavel Skums, Regina Tyshkevich: Reconstruction of graphs with special homogeneous sets. 97-98
• 
  Michal Stern, Ephraim Korach: On the Optimal Stars Clustering Tree Problem. 99-100
• 
  Jianmin Tang, Yuqing Lin, Mirka Miller: Calculating the extremal number ex(v;{C₃, C₄, ..., C_n}). 101-102
• 
  Vadym G. Vizing, Artem V. Pyatkin: Incidentor coloring of weighted multigraphs. 103-104
• 
  Alfred Wassermann, Axel Kohnert: Construction of self-orthogonal linear codes. 105
• 
  Michele Zito, Colin Cooper: Dominating sets of random recursive trees. 107-108
• 
  Vadim E. Zverovich: The Computer System GRAPHOGRAPH. 109-110