default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan Rival
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[c8]Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia:
Degree Navigator™: The Journey of a Visualization Software. GD 2003: 491-493
1990 – 1999
- 1997
- [j31]Kevin Ewacha, Ivan Rival, Nejib Zaguia:
Approximating the Number of Linear Extensions. Theor. Comput. Sci. 175(2): 271-282 (1997) - 1996
- [c7]Mohammad Alzohairi, Ivan Rival:
Series-Parallel Planar Ordered Sets Have Pagenumber Two. GD 1996: 11-24 - 1995
- [j30]Ivan Rival, Nejib Zaguia:
Perpendicular orders. Discret. Math. 137(1-3): 303-313 (1995) - [j29]Wei-Ping Liu, Ivan Rival, Nejib Zaguia:
Automorphisms, isotone self-maps and cycle-free orders. Discret. Math. 144(1-3): 59-66 (1995) - [c6]S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival:
Upward Drawings on Planes and Speres. GD 1995: 277-286 - 1994
- [c5]Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia:
Upward Drawing on the Plane Grid Using Less Ink. GD 1994: 318-327 - [c4]S. Mehdi Hashemi, Ivan Rival:
Upward Drawings to Fit Surfaces. ORDAL 1994: 53-58 - 1993
- [j28]Dmitry Fon-Der-Flaass, Ivan Rival:
Collecting Information in Graded Ordered Sets. Parallel Process. Lett. 3: 253-260 (1993) - 1992
- [j27]Stephan Foldes
, Ivan Rival, Jorge Urrutia:
Light sources, obstructions and spherical orders. Discret. Math. 102(1): 13-23 (1992) - [j26]Ivan Rival, Jorge Urrutia:
Representing orders by moving figures in space. Discret. Math. 109(1-3): 255-263 (1992) - 1991
- [j25]Wei-Ping Liu, Ivan Rival:
Inversions, cuts, and orientations. Discret. Math. 87(2): 163-174 (1991) - [j24]Wei-Ping Liu, Ivan Rival:
Enumerating orientations of ordered sets. Discret. Math. 88(2-3): 239-247 (1991) - [j23]Andrzej Pelc, Ivan Rival:
Orders with Level Diagrams. Eur. J. Comb. 12(1): 61-68 (1991) - [j22]Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia:
Motion Planning, Two-Directional Point Representations, and Ordered Sets. SIAM J. Discret. Math. 4(2): 151-163 (1991) - [c3]Ivan Rival, Siming Zhan:
Linear Extensions with Backtracking. ICCI 1991: 161-168 - 1990
- [j21]Richard J. Nowakowski, Ivan Rival, Jorge Urrutia:
Representing orders on the plane by translating points and lines. Discret. Appl. Math. 27(1-2): 147-156 (1990) - [j20]Jurek Czyzowicz, Andrzej Pelc, Ivan Rival:
Drawing orders with few slopes. Discret. Math. 82(3): 233-250 (1990) - [j19]Kevin Ewacha, Ivan Rival, George Steiner:
Permutation Schedules for Flow Shops with Precedence Constraints. Oper. Res. 38(6): 1135-1139 (1990) - [j18]Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival:
Bipartite Graphs, Upward Drawings, and Planarity. Inf. Process. Lett. 36(6): 317-322 (1990) - [c2]Klaus Reuter, Ivan Rival:
Genus of Order and Lattices. WG 1990: 260-275
1980 – 1989
- 1989
- [j17]Maurice Pouzet, Ivan Rival:
Is there a diagram invariant? Discret. Math. 73(1-2): 181-188 (1989) - [c1]Jurek Czyzowicz, Ivan Rival, Jorge Urrutia:
Galleries, Light Matchings and Visibility Graphs. WADS 1989: 316-324 - 1988
- [j16]Richard J. Nowakowski, Ivan Rival:
Retract rigid cartesian products of graphs. Discret. Math. 70(2): 169-184 (1988) - 1987
- [j15]Ivan Rival, Nejib Zaguia:
Greedy linear extensions with constraints. Discret. Math. 63(2-3): 249-260 (1987) - [j14]Zbigniew Lonc, Ivan Rival:
Chains, antichains, and fibres. J. Comb. Theory A 44(2): 207-228 (1987) - 1985
- [j13]Peter Nevermann, Ivan Rival:
Holes in ordered sets. Graphs Comb. 1(1): 339-350 (1985) - 1983
- [j12]Richard J. Nowakowski, Ivan Rival:
The smallest graph variety containing all paths. Discret. Math. 43(2-3): 223-234 (1983) - 1982
- [j11]Richard J. Nowakowski, Ivan Rival:
On a class of isometric subgraphs of a graph. Comb. 2(1): 79-90 (1982) - 1981
- [j10]Dwight Duffus, Maurice Pouzet, Ivan Rival:
Complete ordered sets with no infinite antichains. Discret. Math. 35(1-3): 39-52 (1981) - [j9]Dwight Duffus, Ivan Rival:
A structure theory for ordered sets. Discret. Math. 35(1-3): 53-118 (1981) - [j8]Ivan Rival, Rudolf Wille:
The smallest order variety containing all chains. Discret. Math. 35(1-3): 203-212 (1981) - 1980
- [j7]Anders Björner, Ivan Rival:
A note on fixed points in semimodular lattices. Discret. Math. 29(3): 245-250 (1980) - [j6]Dwight Duffus, Ivan Rival, Miklós Simonovits:
Spanning retracts of a partially ordered set. Discret. Math. 32(1): 1-7 (1980)
1970 – 1979
- 1979
- [j5]Richard J. Nowakowski, Ivan Rival:
Fixed-edge theorem for graphs with loops. J. Graph Theory 3(4): 339-350 (1979) - 1978
- [j4]Dwight Duffus, Ivan Rival:
Separable Subsets of a Finite Lattice. J. Comb. Theory A 25(2): 188-192 (1978) - 1977
- [j3]Dwight Duffus, Ivan Rival:
Path length in the covering graph of a lattice. Discret. Math. 19(2): 139-158 (1977) - 1976
- [j2]Ivan Rival:
A Fixed Point Theorem for Finite Partially Ordered Sets. J. Comb. Theory A 21(3): 309-318 (1976) - 1975
- [j1]David Kelly, Ivan Rival:
Certain Partially Ordered Sets of Dimension Three. J. Comb. Theory A 18(2): 239-242 (1975)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET 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:
