Ivan Rival
Canadian mathematician and computer scientist
Ivan Rival's AcademicInfluence.com Rankings

Download Badge
Computer Science Mathematics
Why Is Ivan Rival Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ivan Rival was a Canadian mathematician and computer scientist, a professor of mathematics at the University of Calgary and of computer science at the University of Ottawa. Rival's Ph.D. thesis concerned lattice theory. After moving to Calgary he began to work more generally with partially ordered sets, and to study fixed point theorems for partially ordered structures. He was a frequent organizer of conferences in order theory, and in 1984 he founded the journal Order. As a computer scientist at Ottawa, he shifted research topics, applying his expertise in order theory to the study of data structures, computational geometry, and graph drawing.
Ivan Rival's Published Works
Published Works
- Algorithms and Order (1988) (111)
- A structure theory for ordered sets (1981) (108)
- Planar Lattices (1975) (100)
- Graphs and Order (1985) (100)
- A Fixed Point Theorem for Finite Partially Ordered Sets (1976) (97)
- Fixed-edge theorem for graphs with loops (1979) (94)
- Optimal linear extensions by interchanging chains (1983) (71)
- Lattice varieties covering the smallest nonmodular variety. (1979) (70)
- The smallest graph variety containing all paths (1983) (66)
- Crowns, Fences, and Dismantlable Lattices (1974) (63)
- Bipartite Graphs, Upward Drawings, and Planarity (1990) (61)
- Minimizing setups for cycle-free ordered sets (1982) (59)
- Absolute Retracts and Varieties of Reflexive Graphs (1987) (54)
- Lattices with Doubly Irreducible Elements (1974) (49)
- The rank of a distributive lattice (1979) (48)
- Graphs and order : the role of graphs in the theory of ordered sets and its applications (1985) (47)
- Retracts and the Fixed Point Problem for Finite Partially Ordered Sets (1980) (45)
- Chains, antichains, and fibres (1987) (42)
- Path length in the covering graph of a lattice (1977) (37)
- Representing orders on the plane by translating convex figures (1988) (35)
- Graphs orientable as distributive lattices (1983) (33)
- A characterization of semi-distributivity (1975) (32)
- Spanning retracts of a partially ordered set (1980) (31)
- Graphical Data Structures for Ordered Sets (1989) (29)
- Drawing orders with few slopes (1990) (29)
- Reading, Drawing, and Order (1993) (29)
- Structure Results for Function Lattices (1978) (29)
- Light sources, obstructions and spherical orders (1988) (28)
- The Problem of Fixed Points in Ordered Sets (1980) (26)
- Retracts of partially ordered sets (1979) (25)
- Holes in ordered sets (1985) (24)
- Greedy linear extensions to minimize jumps (1985) (23)
- Series-Parallel Planar Ordered Sets Have Pagenumber Two (1996) (22)
- Constructing greedy linear extensions by interchanging chains (1986) (22)
- A Logarithmic Property for Exponents of Partially Ordered Sets (1978) (22)
- Antichains and Finite Sets that Meet all Maximal Chains (1986) (22)
- The Retract Construction (1982) (21)
- Combinatorial inequalities for semimodular lattices of breadth two (1976) (21)
- A CORRECTION TO SMALL REPRESENTATIONS OF FINITE DISTRIBUTIVE LATTICES AS CONGRUENCE LATTICES (1995) (21)
- Galleries, Light Matchings and Visibility Graphs (1989) (20)
- Every countable lattice is a retract of a direct product of chains (1984) (20)
- Order, order, order ... (1984) (20)
- The smallest order variety containing all chains (1981) (19)
- On a class of isometric subgraphs of a graph (1982) (19)
- A Ramsey-type theorem for traceable graphs☆ (1982) (18)
- Maximal sublattices of finite distributive lattices (1973) (18)
- EXPONENTS OF FINITE SIMPLE LATTICES (1978) (17)
- Exponents of lattice-ordered algebras (1982) (17)
- Linear Ectensions of Finite Ordered Sets (1984) (17)
- Dimension two, fixed points and dismantlable ordered sets (1996) (17)
- Crooked diagrams with few slopes (1990) (17)
- Perpendicular orders (1995) (16)
- The Complexity of Upward Drawings on Spheres (1997) (16)
- Retract rigid cartesian products of graphs (1988) (16)
- PICTURE PUZZLING: Mathematicians Are Rediscovering the Power of Pictorial Reasoning (1987) (15)
- A generalized permutahedron (1995) (15)
- Finite sublattices of three-generated lattices (1976) (15)
- Complete ordered sets with no infinite antichains (1981) (15)
- The diagram invariant problem for planar lattices (1987) (14)
- A Classification of Reflexive Graphs: The use of “Holes” (1986) (14)
- Upward Drawings to Fit Surfaces (1994) (14)
- Certain Partially Ordered Sets of Dimension Three (1975) (14)
- MAXIMAL SUBLATTICES OF FINITE DISTRIBUTIVE LATTICES. II (1973) (14)
- Ordered sets : proceedings of the NATO Advanced Study Institute held at Banff, Canada, August 28 to September 12, 1981 (1982) (13)
- A note on Whitman's property for free lattices (1974) (13)
- The maximal size of the covering graph of a lattice (1979) (13)
- Planar Sublattices of a Free Lattice. I (1978) (13)
- Lattices freely generated by partially ordered sets: which can be "drawn"? (1979) (13)
- A note on fixed points in semimodular lattices (1980) (12)
- Examples of Jump-Critical Ordered Sets (1985) (12)
- Orders with Level Diagrams (1991) (11)
- Which Ordered Sets have a Complete Linear Extension? (1981) (11)
- Greedy linear extensions with constraints (1987) (11)
- Dilworth’s covering theorem for modular lattices: A simple proof (1973) (10)
- A note on the congruence lattice of a finitely generated algebra (1978) (10)
- Combinatorics and ordered sets (1986) (10)
- Order, genus, and diagram invariance (1991) (9)
- On the ubiquity of herringbones in finitely generated lattices (1981) (8)
- Critical edges in subdirectly irreducible lattices (1977) (8)
- Finite sublattices generated by order-isomorphic subsets (1974) (8)
- Automorphisms, isotone self-maps and cycle-free orders (1995) (8)
- Representing orders on the plane by translating points and lines (1990) (8)
- Is there a diagram invariant? (1989) (8)
- Approximating the Number of Linear Extensions (1997) (8)
- On the Adjacency of Vertices to the Vertices of an Infinite Subgraph (1980) (8)
- Planar ordered sets of width two (1990) (8)
- Lattices contained in planar orders are planar (1992) (7)
- The endomorphism spectrum of an ordered set (1995) (7)
- Weak embeddings and embeddings of finite distributive lattices (1975) (7)
- Representing orders by moving figures in space (1992) (6)
- Matroid Applications: Algebraic Aspects of Partition Lattices (1992) (6)
- Every triangle-free planar graph has a planar upward drawing (1993) (6)
- Finite four-generated simple lattices contain all finite lattices (1976) (6)
- The pagenumber of spherical lattices is unbounded (2001) (6)
- Inversions, cuts, and orientations (1991) (6)
- Enumerating orientations of ordered sets (1991) (5)
- Permutation Schedules for Flow Shops with Precedence Constraints (1990) (5)
- Separable Subsets of a Finite Lattice (1978) (5)
- Problems About Planar Orders (1993) (5)
- Diagrams, orientations, and varieties (1989) (5)
- A note on linear extensions of irreducible elements in a finite lattice (1976) (5)
- An exchange property for modular lattices (1978) (5)
- Genus of Order and Lattices (1990) (4)
- Pictures in Lattice Theory (1982) (4)
- Images of simple lattice polynomials (1995) (4)
- Quotients of complete ordered sets (1983) (4)
- Projective images of modular (distributive, complemented) lattices are modular (distributive, complemented) (1972) (4)
- Antichain cutsets (1985) (4)
- GALLERIES AND LIGHT MATCHINGS: FAT COOPERATIVE GUARDS (1991) (4)
- Motion Planning, Two-Directional Point Representations, and Ordered Sets (1991) (4)
- Subdiagrams equal in number to their duals (1986) (3)
- A note on weak embeddings of distributive lattices (1980) (3)
- Distributive cover-preserving sublattices of modular lattices (1978) (3)
- Upward Drawings on Planes and Speres (1995) (3)
- Continuous, Slope-Preserving Maps of Simple Closed Curves (1980) (3)
- Upward Drawing on the Plane Grid Using Less Ink (1994) (3)
- The Did Intelligencer (1980) (3)
- How many four-generated simple lattices (1982) (3)
- An arithmetical theorem for modular lattices (1975) (2)
- The Spectrum of a Finite Lattice: Breadth and Length Techniques (1977) (2)
- Dilworth’s Covering Theorem for Modular Lattices (1990) (2)
- A THEOREM ON FINITE SUBLATTICES OF FREE LATTICES (1977) (2)
- Planar Sublattices of a Free Lattice. II (1979) (2)
- Sublattices of Modular Lattices of Finite Length (1975) (2)
- Unsolved problems (1984) (2)
- Unfolding Weighted Consensus Orders into Consistent Numerical Scales (1990) (2)
- Collecting Information in Graded Ordered Sets (1993) (2)
- Unsolved problems (1985) (1)
- Dimension invariance of subdivisions (2001) (1)
- Linear Extensions with Backtracking (1991) (0)
- Fundamental units for orders in certain cubic number fields. (1979) (0)
- Graphs and Enumeration (1982) (0)
- Social Science and Operations Research (1982) (0)
- Discrete Mathematics 35 (1981) 39-X North-Holland Publishing Company (2001) (0)
- Unsolved problems (1985) (0)
- Recursion and Game Theory (1982) (0)
- Order’s Problem List (1989) (0)
- DIMENSION INVAB1ANCE OF SUBDIVISIONS (2008) (0)
- Combinatorics and ordered sets : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, held August 11-17, 1985, with support from the National Science Foundation (1986) (0)
- Note Separable Subsets of a Finite Lattice DWIGHT DUFFUS AND (0)
- Order-Preserving Maps (1982) (0)
- Degree Navigator™: The Journey of a Visualization Software (2003) (0)
- System Synthesis with Generalized Morphological Clique Problem (0)
- Scheduling and Sorting (1982) (0)
- Discrete Mathematics 35 (1981) 39-X North-Holland Publishing Company (2001) (0)
This paper list is powered by the following services:
Other Resources About Ivan Rival
What Schools Are Affiliated With Ivan Rival?
Ivan Rival is affiliated with the following schools: