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