Certain Partially Ordered Sets of Dimension Three. - David Kelly; Ivan Rival (J. Comb. Theory A, 1975)

A Fixed Point Theorem for Finite Partially Ordered Sets. - Ivan Rival (J. Comb. Theory A, 1976)

Path length in the covering graph of a lattice. - Dwight Duffus; Ivan Rival (Discret. Math., 1977)

Separable Subsets of a Finite Lattice. - Dwight Duffus; Ivan Rival (J. Comb. Theory A, 1978)

Fixed-edge theorem for graphs with loops. - Richard J. Nowakowski; Ivan Rival (J. Graph Theory, 1979)

A note on fixed points in semimodular lattices. - Anders Björner; Ivan Rival (Discret. Math., 1980)

Spanning retracts of a partially ordered set. - Dwight Duffus; Ivan Rival; Miklós Simonovits (Discret. Math., 1980)

Complete ordered sets with no infinite antichains. - Dwight Duffus; Maurice Pouzet; Ivan Rival (Discret. Math., 1981)

A structure theory for ordered sets. - Dwight Duffus; Ivan Rival (Discret. Math., 1981)

The smallest order variety containing all chains. - Ivan Rival; Rudolf Wille (Discret. Math., 1981)

On a class of isometric subgraphs of a graph. - Richard J. Nowakowski; Ivan Rival (Comb., 1982)

The smallest graph variety containing all paths. - Richard J. Nowakowski; Ivan Rival (Discret. Math., 1983)

Holes in ordered sets. - Peter Nevermann; Ivan Rival (Graphs Comb., 1985)

Greedy linear extensions with constraints. - Ivan Rival; Nejib Zaguia (Discret. Math., 1987)

Chains, antichains, and fibres. - Zbigniew Lonc; Ivan Rival (J. Comb. Theory A, 1987)

Retract rigid cartesian products of graphs. - Richard J. Nowakowski; Ivan Rival (Discret. Math., 1988)

Galleries, Light Matchings and Visibility Graphs. - Jurek Czyzowicz; Ivan Rival; Jorge Urrutia (WADS, 1989)

Is there a diagram invariant? - Maurice Pouzet; Ivan Rival (Discret. Math., 1989)

Genus of Order and Lattices. - Klaus Reuter; Ivan Rival (WG, 1990)

Representing orders on the plane by translating points and lines. - Richard J. Nowakowski; Ivan Rival; Jorge Urrutia (Discret. Appl. Math., 1990)

Drawing orders with few slopes. - Jurek Czyzowicz; Andrzej Pelc; Ivan Rival (Discret. Math., 1990)

Permutation Schedules for Flow Shops with Precedence Constraints. - Kevin Ewacha; Ivan Rival; George Steiner (Oper. Res., 1990)

Bipartite Graphs, Upward Drawings, and Planarity. - Giuseppe Di Battista; Wei-Ping Liu; Ivan Rival (Inf. Process. Lett., 1990)

Linear Extensions with Backtracking. - Ivan Rival; Siming Zhan (ICCI, 1991)

Inversions, cuts, and orientations. - Wei-Ping Liu; Ivan Rival (Discret. Math., 1991)

Enumerating orientations of ordered sets. - Wei-Ping Liu; Ivan Rival (Discret. Math., 1991)

Orders with Level Diagrams. - Andrzej Pelc; Ivan Rival (Eur. J. Comb., 1991)

Motion Planning, Two-Directional Point Representations, and Ordered Sets. - Fawzi Al-Thukair; Andrzej Pelc; Ivan Rival; Jorge Urrutia (SIAM J. Discret. Math., 1991)

Light sources, obstructions and spherical orders. - Stephan Foldes; Ivan Rival; Jorge Urrutia (Discret. Math., 1992)

Representing orders by moving figures in space. - Ivan Rival; Jorge Urrutia (Discret. Math., 1992)

Collecting Information in Graded Ordered Sets. - Dmitry Fon-Der-Flaass; Ivan Rival (Parallel Process. Lett., 1993)

Upward Drawing on the Plane Grid Using Less Ink. - Guy-Vincent Jourdan; Ivan Rival; Nejib Zaguia (GD, 1994)

Upward Drawings to Fit Surfaces. - S. Mehdi Hashemi; Ivan Rival (ORDAL, 1994)

Upward Drawings on Planes and Speres. - S. Mehdi Hashemi; Andrzej Kisielewicz 001; Ivan Rival (GD, 1995)

Automorphisms, isotone self-maps and cycle-free orders. - Wei-Ping Liu; Ivan Rival; Nejib Zaguia (Discret. Math., 1995)

Perpendicular orders. - Ivan Rival; Nejib Zaguia (Discret. Math., 1995)

Series-Parallel Planar Ordered Sets Have Pagenumber Two. - Mohammad Alzohairi; Ivan Rival (GD, 1996)

Approximating the Number of Linear Extensions. - Kevin Ewacha; Ivan Rival; Nejib Zaguia (Theor. Comput. Sci., 1997)

Degree Navigator™: The Journey of a Visualization Software. - Guy-Vincent Jourdan; Ivan Rival; Nejib Zaguia (GD, 2003)