Ivan Rival

According to our database1, Ivan Rival authored at least 39 papers between 1975 and 2003.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2003
Degree Navigator™: The Journey of a Visualization Software.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

1997
Approximating the Number of Linear Extensions.
Theor. Comput. Sci., 1997

1996
Series-Parallel Planar Ordered Sets Have Pagenumber Two.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
Perpendicular orders.
Discret. Math., 1995

Automorphisms, isotone self-maps and cycle-free orders.
Discret. Math., 1995

Upward Drawings on Planes and Speres.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994
Upward Drawings to Fit Surfaces.
Proceedings of the Orders, 1994

Upward Drawing on the Plane Grid Using Less Ink.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Collecting Information in Graded Ordered Sets.
Parallel Process. Lett., 1993

1992
Representing orders by moving figures in space.
Discret. Math., 1992

Light sources, obstructions and spherical orders.
Discret. Math., 1992

1991
Motion Planning, Two-Directional Point Representations, and Ordered Sets.
SIAM J. Discret. Math., 1991

Orders with Level Diagrams.
Eur. J. Comb., 1991

Enumerating orientations of ordered sets.
Discret. Math., 1991

Inversions, cuts, and orientations.
Discret. Math., 1991

Linear Extensions with Backtracking.
Proceedings of the Advances in Computing and Information, 1991

1990
Bipartite Graphs, Upward Drawings, and Planarity.
Inf. Process. Lett., 1990

Permutation Schedules for Flow Shops with Precedence Constraints.
Oper. Res., 1990

Drawing orders with few slopes.
Discret. Math., 1990

Representing orders on the plane by translating points and lines.
Discret. Appl. Math., 1990

Genus of Order and Lattices.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989
Is there a diagram invariant?
Discret. Math., 1989

Galleries, Light Matchings and Visibility Graphs.
Proceedings of the Algorithms and Data Structures, 1989

1988
Retract rigid cartesian products of graphs.
Discret. Math., 1988

1987
Chains, antichains, and fibres.
J. Comb. Theory, Ser. A, 1987

Greedy linear extensions with constraints.
Discret. Math., 1987

1985
Holes in ordered sets.
Graphs Comb., 1985

1983
The smallest graph variety containing all paths.
Discret. Math., 1983

1982
On a class of isometric subgraphs of a graph.
Comb., 1982

1981
The smallest order variety containing all chains.
Discret. Math., 1981

A structure theory for ordered sets.
Discret. Math., 1981

Complete ordered sets with no infinite antichains.
Discret. Math., 1981

1980
Spanning retracts of a partially ordered set.
Discret. Math., 1980

A note on fixed points in semimodular lattices.
Discret. Math., 1980

1979
Fixed-edge theorem for graphs with loops.
J. Graph Theory, 1979

1978
Separable Subsets of a Finite Lattice.
J. Comb. Theory, Ser. A, 1978

1977
Path length in the covering graph of a lattice.
Discret. Math., 1977

1976
A Fixed Point Theorem for Finite Partially Ordered Sets.
J. Comb. Theory, Ser. A, 1976

1975
Certain Partially Ordered Sets of Dimension Three.
J. Comb. Theory, Ser. A, 1975


  Loading...