


default search action
ORDAL 1994: Lyon, France
- Vincent Bouchitté, Michel Morvan:
Orders, Algorithms, and Applications, International Workshop ORDAL '94, Lyon, France, July 4-8, 1994, Proceedings. Lecture Notes in Computer Science 831, Springer 1994, ISBN 3-540-58274-6
Invited Contributions
- Michel Habib, Lhouari Nourine:
Bit-Vector Encoding for Partially Ordered Sets. 1-12 - Kenneth P. Bogart:
Intervals and Orders: What Comes After Interval Orders? 13-32 - Jeremy P. Spinrad:
Dimension and Algorithms. 33-52 - S. Mehdi Hashemi, Ivan Rival:
Upward Drawings to Fit Surfaces. 53-58
Contributed Papers
- Klaus Simon, Paul Trunz:
A Cleanup on Transitive Orientation. 59-85 - Kevin Cattell, Michael J. Dinneen:
A Characterization of Graphs with Vertex Cover up to Five. 86-99 - Jens Gustedt
, Angelika Steger:
Testing Hereditary Properties Efficiently on Average. 100-116 - Paolo Giulio Franciosa, Maurizio Talamo
:
Orders, k-sets and Fast Halfplane Search on Paged Memory. 117-127 - Yaw-Ling Lin:
Triangle Graphs and Their Coloring. 128-142 - Christian Capelle:
Representation of an Order as Union of Interval Orders. 143-161 - Jutta Mitas:
Minimal Representation of Semiorders with Intervals of Same Length. 162-175 - Elias Dahlhaus:
The Computation of the Jump Number of Convex Graphs. 176-185 - Maurizio Talamo
, Paola Vocca
:
Fast Lattice Browsing on Sparse Representations. 186-204

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.