Jean-Xavier Rampon

According to our database1, Jean-Xavier Rampon authored at least 24 papers between 1990 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Faithful extension on finite order classes.
Australas. J Comb., 2017

2009
Inductive Characterizations of Finite Interval Orders and Semiorders.
Order, 2009

2007
St-serie decomposition of orders.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Chain Dominated Orders.
Order, 2006

A Counting of the minimal realizations of the posets of dimension two.
Ars Comb., 2006

2005
Faithful extensions on finite orders classes.
Electron. Notes Discret. Math., 2005

What is reconstruction for ordered sets?
Discret. Math., 2005

Graph Invariants as Necessary Conditions for Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2002
Reconstruction of Finite Truncated Semi-Modular Lattices.
J. Comb. Theory, Ser. B, 2002

2000
Partial Orders on Weak Orders Convex Subsets.
Order, 2000

Split Orders.
Electron. Notes Discret. Math., 2000

1998
Reconstruction of Posets with the Same Comparability Graph.
J. Comb. Theory, Ser. B, 1998

Tree-visibility orders.
Discret. Math., 1998

1997
On-Line Algorithms for Orders.
Theor. Comput. Sci., 1997

Partial orders and their convex subsets.
Discret. Math., 1997

1996
Width two posets are reconstructible.
Discret. Math., 1996

1995
On-Line Computations of the Ideal Lattice of Posets.
RAIRO Theor. Informatics Appl., 1995

Contiguity Orders.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Constructing Colorings for Diagrams.
Discret. Appl. Math., 1994

On the Directionality of Interval Orders.
Discret. Appl. Math., 1994

A General Approach to Trace-Checking in Distributed Computing Systems.
Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

1993
On the calculation of transitive reduction - closure of orders.
Discret. Math., 1993

Reachability Analysis on Distributed Executions.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1990
Remarks on Some Concurrency Measures.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990


  Loading...