default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 138
Volume 138, Number 1-2, 29 March 2004
- Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn:
Preface: ODSA. 1 - M. Cemil Azizoglu, Ömer Eeciolu:
The bisection width and the isoperimetric number of arrays. 3-12 - Andreas Brandstädt:
(P5, diamond)-free graphs revisited: structure and linear time optimization. 13-27 - Dietmar Cieslik:
The Steiner ratio of high-dimensional Banach-Minkowski spaces. 29-34 - Myra B. Cohen, Charles J. Colbourn:
Ladder orderings of pairs and RAID performance. 35-46 - Ramadan A. El-Shanawany, Hans-Dietrich O. F. Gronau, Martin Grüttmüller:
Orthogonal double covers of Kn, n by small graphs. 47-63 - Hans-Dietrich O. F. Gronau, Donald L. Kreher
, Alan C. H. Ling:
Super-simple (v, 5, 2)-designs. 65-77 - Harald Gropp:
Configurations between geometry and combinatorics. 79-88 - Martin Grüttmüller:
Completing partial latin squares with prescribed diagonals. 89-97 - Harri Haanpää, Antti Huima, Patric R. J. Östergård:
Sets in Z nwith distinct sums of pairs. 99-106 - Sven Hartmann, Ulrike Schumacher:
Orthogonal double covers of general graphs. 107-116 - Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev:
On simplicial and co-simplicial vertices in graphs. 117-132 - Petteri Kaski, Patric R. J. Östergård:
Enumeration of balanced ternary designs. 133-141 - Kari J. Nurmela:
Upper bounds for covering arrays by tabu search. 143-152 - Philippe Pitteloud:
On the log-concavity of sequences arising from integer bases. 153-175 - Alexander Pott:
Nonlinear functions in abelian groups and relative difference sets. 177-193 - Michael Sampels:
Vertex-symmetric generalized Moore graphs. 195-202 - Jeremy P. Spinrad:
Recognizing quasi-triangulated graphs. 203-213 - Csaba D. Tóth:
Illuminating labyrinths. 215-228 - Ingo Wegener:
BDDs--design, analysis, complexity, and applications. 229-251
Volume 138, Number 3, 15 April 2004
- Uri Keich, Ming Li, Bin Ma, John Tromp:
On spaced seeds for similarity search. 253-263 - Gennian Ge, Clement W. H. Lam:
Whist tournaments with the three person property. 265-276 - Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
Fixed points and maximal independent sets in AND-OR networks. 277-288 - Igor Averbakh, Vasilij Lebedev:
Interval data minmax regret network optimization problems. 289-301 - Eduardo A. Canale, José Gómez:
Superfluous edges and exponential expansions of De Bruijn and Kautz graphs. 303-331 - Katarína Cechlárová, Jana Hajduková:
Stable partitions with W -preferences. 333-347 - Yoshio Okamoto:
Traveling salesman games with the Monge property. 349-369 - Derek G. Corneil:
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. 371-379
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 2024-10-31 20:16 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:
