Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrder, Volume 18
Volume 18, Number 1, March 2001
- Harold Bennett, Robert E. Byerly, David Lutzer:
Cleavability in Ordered Spaces. 1-17 - Stefan Felsner:
Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. 19-37 - Csaba Szabó, László Zádori:
Idempotent Totally Symmetric Operations on Finite Posets. 39-47 - Rozália Sz. Madarász, Boza Tasic:
On the Partially Ordered Semigroup Generated by the Class Operators I, R, H, S, P. 49-60 - Bernd S. W. Schröder
:
Reconstruction of N-free Ordered Sets. 61-68 - Philippe Baldy, Michel Morvan:
Height Preserving Minimal Interval Extensions. 69-77 - Gábor Kun, Csaba Szabó:
Order Varieties and Monotone Retractions of Finite Posets. 79-88 - Florent Domenach, Bruno Leclerc:
Biclosed Binary Relations and Galois Connections. 89-104
Volume 18, Number 2, June 2001
- Bernhard Banaschewski:
f-Rings and the Stone-Weierstrass Theorem. 105-117 - Peter C. Fishburn, James A. Reeds:
Counting Split Semiorders. 119-128 - James A. Reeds, Peter C. Fishburn:
Counting Split Interval Orders. 129-135 - Brett McElwee:
Maximal and Minimal Semilattices on Ordered Sets. 137-149 - Andrei A. Krokhin:
Congruences of Clone Lattices, II. 151-159 - Josef Niederle:
On Pseudocomplemented and Stone Ordered Sets. 161-170 - Gianni Bosi, Juan Carlos Candeal, Esteban Induráin, Esteban Olóriz, Margarita Zudaire:
Numerical Representations of Interval Orders. 171-190 - Gerhard Herden, Andreas Pallack:
Interrelations between the Length, the Structure and the Cardinality of a Chain. 191-200
Volume 18, Number 3, September 2001
- Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn:
Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets. 201-225 - Richard Ehrenborg:
k-Eulerian Posets. 227-236 - Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk:
Linear Discrepancy and Bandwidth. 237-245 - David Linnan Li, Shahriar Shahriari:
Games of Chains and Cutsets in the Boolean Lattice II. 247-267 - Frantisek Machala:
Join-Independent and Meet-Independent Sets in Complete Lattices. 269-274 - Reinhard Diestel:
Relating Subsets of a Poset, and a Partition Theorem for WQOs. 275-279 - Kenneth P. Bogart, Joshua D. Laison, Garth Isaak, Ann N. Trenk:
Comparability Invariance Results for Tolerance Orders. 281-294
Volume 18, Number 4, December 2001
- Christopher Doble, Jean-Paul Doignon, Jean-Claude Falmagne, Peter C. Fishburn:
Almost Connected Orders. 295-311 - Sergei O. Kuznetsov:
On Computing the Size of a Lattice and Related Decision Problems. 313-321 - Khaled Al-Agha, Richard Greechie:
The Involutory Dimension of Involution Posets. 323-337 - Alberto Marcone:
Fine Analysis of the Quasi-Orderings on the Power Set. 339-347 - Jirí Rachunek:
Groups of Automorphisms of Tournaments. 349-357 - John Kenneth Truss:
Elementary Properties of Cycle-free Partial Orders and their Automorphism Groups. 359-379 - Jonathan David Farley, Bernd S. W. Schröder:
Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné. 381-385
a service of 
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-04-18 20:20 CEST 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:
