SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Ivan Rival: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Mohammad Alzohairi, Ivan Rival
Series-Parallel Planar Ordered Sets Have Pagenumber Two. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 1996, pp:11-24 [Conf]
S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival
Upward Drawings on Planes and Speres. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 1995, pp:277-286 [Conf]
Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia
Degree Navigator™: The Journey of a Visualization Software. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 2003, pp:491-493 [Conf]
Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia
Upward Drawing on the Plane Grid Using Less Ink. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 1994, pp:318-327 [Conf]
Ivan Rival, Siming Zhan
Linear Extensions with Backtracking. [Citation Graph (0, 0)][DBLP]
ICCI, 1991, pp:161-168 [Conf]
S. Mehdi Hashemi, Ivan Rival
Upward Drawings to Fit Surfaces. [Citation Graph (0, 0)][DBLP]
ORDAL, 1994, pp:53-58 [Conf]
Jurek Czyzowicz, Ivan Rival, Jorge Urrutia
Galleries, Light Matchings and Visibility Graphs. [Citation Graph (0, 0)][DBLP]
WADS, 1989, pp:316-324 [Conf]
Klaus Reuter, Ivan Rival
Genus of Order and Lattices. [Citation Graph (0, 0)][DBLP]
WG, 1990, pp:260-275 [Conf]
Richard J. Nowakowski, Ivan Rival
On a class of isometric subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1982, v:2, n:1, pp:79-90 [Journal]
Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival
Bipartite Graphs, Upward Drawings, and Planarity. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1990, v:36, n:6, pp:317-322 [Journal]
Dwight Duffus, Ivan Rival
Separable Subsets of a Finite Lattice. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1978, v:25, n:2, pp:188-192 [Journal]
David Kelly, Ivan Rival
Certain Partially Ordered Sets of Dimension Three. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1975, v:18, n:2, pp:239-242 [Journal]
Zbigniew Lonc, Ivan Rival
Chains, antichains, and fibres. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1987, v:44, n:2, pp:207-228 [Journal]
Ivan Rival
A Fixed Point Theorem for Finite Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1976, v:21, n:3, pp:309-318 [Journal]
Dmitry Fon-Der-Flaass, Ivan Rival
Collecting Information in Graded Ordered Sets. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 1993, v:3, n:, pp:253-260 [Journal]
Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia
Motion Planning, Two-Directional Point Representations, and Ordered Sets. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1991, v:4, n:2, pp:151-163 [Journal]
Kevin Ewacha, Ivan Rival, Nejib Zaguia
Approximating the Number of Linear Extensions. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:175, n:2, pp:271-282 [Journal]
Dwight Duffus, Ivan Rival, Miklós Simonovits
Spanning retracts of a partially ordered set. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1980, v:32, n:1, pp:1-7 [Journal]
Dwight Duffus, Ivan Rival
A structure theory for ordered sets. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:35, n:1-3, pp:53-118 [Journal]
Ivan Rival, Rudolf Wille
The smallest order variety containing all chains. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:35, n:1-3, pp:203-212 [Journal]
Dwight Duffus, Maurice Pouzet, Ivan Rival
Complete ordered sets with no infinite antichains. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:35, n:1-3, pp:39-52 [Journal]
Richard J. Nowakowski, Ivan Rival
The smallest graph variety containing all paths. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1983, v:43, n:2-3, pp:223-234 [Journal]
Ivan Rival, Nejib Zaguia
Greedy linear extensions with constraints. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1987, v:63, n:2-3, pp:249-260 [Journal]
Richard J. Nowakowski, Ivan Rival
Retract rigid cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:70, n:2, pp:169-184 [Journal]
Maurice Pouzet, Ivan Rival
Is there a diagram invariant? [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1989, v:73, n:1-2, pp:181-188 [Journal]
Jurek Czyzowicz, Andrzej Pelc, Ivan Rival
Drawing orders with few slopes. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:82, n:3, pp:233-250 [Journal]
Wei-Ping Liu, Ivan Rival
Inversions, cuts, and orientations. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1991, v:87, n:2, pp:163-174 [Journal]
Wei-Ping Liu, Ivan Rival
Enumerating orientations of ordered sets. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1991, v:88, n:2-3, pp:239-247 [Journal]
Stephan Foldes, Ivan Rival, Jorge Urrutia
Light sources, obstructions and spherical orders. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:102, n:1, pp:13-23 [Journal]
Ivan Rival, Jorge Urrutia
Representing orders by moving figures in space. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:109, n:1-3, pp:255-263 [Journal]
Wei-Ping Liu, Ivan Rival, Nejib Zaguia
Automorphisms, isotone self-maps and cycle-free orders. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:144, n:1-3, pp:59-66 [Journal]
Ivan Rival, Nejib Zaguia
Perpendicular orders. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:137, n:1-3, pp:303-313 [Journal]
Representing orders on the plane by translating points and lines. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.342secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP