From dmanet@math.utwente.nl Sat Jul 3 20:46:39 1999 Date: Wed, 30 Jun 1999 12:13:32 +0200 From: Discrete Mathematics and Algorithms Network Reply-To: nourine@lirmm.fr To: DMA-LIST@NIC.SURFNET.NL Subject: List of accepted papers to Ordal'99 List of accepted papers to Ordal'99 Third Conference on Orders, Algorithms and Applications August 25-28 1999, Montpellier, France for more information see: http://www.lirmm.fr/ordal99 Accepted long papers _________________ 1. Brett McElwee, Minimal Embeddings of ordered sets into semilattices 2. Karell Bertet, Nathalie Caspard, Doubling convex sets in lattices: characterization and recognition algorithm 3. Deok Rak Bae, Characterization for the dimension of product of ordered sets except the unbounded ordered set 4. Francois Bertault, Paul Zimmermann, Unranking of unalbeled decomposable structures 5. George Steiner, Paul Stephenson Dominance orders for scheduling problems 6. Stephan Ceroi, A polynomial algorithm to find the jump number of 2-dimensional orders of fixed height 7. Eric Remila, The lattice structure of the set of domino tilings of a polygon 8. Paolo Boldi, Languages associated to circular-arc schedulings 9. Stefan Felsner, Vijay Raghavan, Jeremy Spinrad Recognition algorithms for orders of small width and graphs of small dilworth number. 10. Matthieu Latapy and Ha Duong Phan, The lattice of integer partitions and its infinite extension 11. Housni Djellab, Michel Gourgand Particular Hypergraph representation for scheduling problems _________________________________________________ Accepted as free contributions (short abstracts) __________________________________________________ 1 M. Huchard, H. Leblanc >From Java classes to Java Interfaces through Galois lattices 2 Karell Bertet, Computing the sublattice of a lattice generated by a set of elements 3 Pascal Ferraro and C. Godin, An algorithm for comparing unordered tree graphs based on a minimum cost mapping with a minimal connectvity 4 Luca Forlizzi, Enrico Nardelli, An on-line ALgorithm for the Mac-Neille completion of a poset 5 Jiri Klimes, Vaclav Snasel Congruences in ordered sets and LU compatible equivalences 6 Samuel Fiorini Adjacency on weak order polytopes 7 Avy Sharell Sampling ideals of some posets in polynomial time 8 Michael Naatz The graph of linear extensions 9 G.H. Bordalo, B. Monjardet The lattice of strict completions of a poset 10 F. Havet, S. Thomassé Using median orders in tournaments 11 L. Nourine, O. Raynaud A fast algorithm for building lattices 12 J.D. Farley Cover Functions of Distributive Lattices: a 1975 conjecture of Richard P. Stanley 13 M. Morvan Discrete dynamical systems and partial orders, 14 M. Serfaty, Post's algebras and lattices of ordered partitions +--------------------------+--------------------------+ | Lhouari NOURINE | | | L.I.R.M.M. | email : nourine@lirmm.fr | | 161 rue ADA | tel : (33)4 67 41 85 49| | 34392 Montpellier | fax : (33)4 67 41 85 00| | France | | +--------------------------+--------------------------+ ****************************************************** Contributions to be spread via DMANET are submitted to DMANET@math.utwente.nl Replies to a message carried on DMANET should NOT be addressed to DMANET but to the original sender. The original sender, however, is invited to prepare an update of the replies received and to communicate it via DMANET. DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) http://www.math.utwente.nl/stor/OR/dmanet.html