Dieter Kratsch, Jean-xavier Rampon
We introduce a new class of partially ordered sets, called tree-visibility orders, containing interval orders, duals of generalized interval orders and height one orders. We give a characterization...
Constructing Colorings for Diagrams (2007)
Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-xavier Rampon
Introduction and Overview An undirected graph G = (V; E) is a (Hasse--) diagram if there is a poset P = (V; !) and an orientation ~ E of E such that (x; y) 2 ~ E iff x ! y in P and there is no z with...
Nicolas Beldiceanu, Mats Carlsson, Jean-xavier Rampon, Charlotte Truchet, Sophie Demassey, Thierry Petit, ...
Conclusion
Global Constraint Catalog (2005)
Beldiceanu, Nicolas, Carlsson, Mats, Rampon, Jean-Xavier
This report presents a catalog of global constraints where each constraint is explicitly described in terms of graph properties and/or automata. When available, it also presents some typical usage as...
Graph Invariants as Necessary Conditions for Global Constraints (2005)
Beldiceanu, Nicolas, Carlsson, Mats, Rampon, Jean-Xavier, Truchet, Charlotte
This report presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is...
Global Constraint Catalog (2005)
Beldiceanu, Nicolas, Carlsson, Mats, Rampon, Jean-Xavier
This report presents a catalog of global constraints where each constraint is explicitly described in terms of graph properties and/or automata. When available, it also presents some typical usage as...
Graph Invariants as Necessary Conditions for Global Constraints (2005)
Beldiceanu, Nicolas, Carlsson, Mats, Rampon, Jean-Xavier, Truchet, Charlotte
This report presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is...
Graph invariants as necessary conditions for global constraints (2005)
Beldiceanu, Nicolas, Carlsson, Mats, Rampon, Jean-Xavier, Truchet, Charlotte
This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is...
Graph Invariants as Necessary Conditions for Global Constraints (2005)
Nicolas Beldiceanu, Mats Carlsson, Jean-xavier Rampon, Charlotte Truchet
ISRN: SICS-T–2005/07-SE Abstract. This report presents a database of about ¨�©� © graph invariants for deriving systematically necessary conditions from the graph properties based...
A Counting of the minimal realizations of the posets of dimension two (2003)
Pierre Ille, Jean-xavier Rampon, Posets Realization
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gallai's...
Kratsch, Dieter, Rampon, Jean-Xavier
In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to...
Kratsch, Dieter, Rampon, Jean-Xavier
In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to...
Kratsch, Dieter, Rampon, Jean-Xavier
In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to...
Jean-xavier Rampon, Dieter Kratsch, Dieter Kratsch, Projet Pampa
: In this paper we introduce a new class of partially ordered sets, called treevisibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to...
Computing on-line the lattice of maximal antichains of posets (1994)
Jourdan, Guy-Vincent, Rampon, Jean-Xavier, Jard, Claude
Disponible dans les fichiers attachés à ce document
A General approach to trace-checking in distributed computing systems (1994)
Jard, Claude, Jéron, Thierry, Jourdan, Guy-Vincent, Rampon, Jean-Xavier
Disponible dans les fichiers attachés à ce document
Computing on-line the lattice of maximal antichains of posets (1994)
Jourdan, Guy-Vincent, Rampon, Jean-Xavier, Jard, Claude
Disponible dans les fichiers attachés à ce document
A General approach to trace-checking in distributed computing systems (1994)
Jard, Claude, Jéron, Thierry, Jourdan, Guy-Vincent, Rampon, Jean-Xavier
Disponible dans les fichiers attachés à ce document
Computing On-Line the Lattice of Maximal Antichains of Posets (1994)
Antichains Of Posets, Antichains Of Posets, Guy-Vincent Jourdan, Jean-Xavier Rampon, ...
: This paper is dedicated to the on--line computation of the lattice of maximal antichains, say g MA(P ) = (MA(P ); MA(P ) ), of a finite poset e P = (P; P ). This on--line computation fulfills what...
A General Approach to Trace-Checking in Distributed Computing Systems (1994)
Thierry Jeron, Claude Jard, Claude Jard, Guy-vincent Jourdan, Guy-vincent Jourdan, Jean-xavier Rampon, ...
: The problem of checking the correctness of distributed computations arises when debugging distributed algorithms, and more generally when testing protocols or distributed applications. For that...
On-line recognition of interval orders (1993)
Bouchitte, V., Jegou, R., Rampon, Jean-Xavier
The first one is optimal in time and space and recognizes the transitive closure of an interval order under the suborder hypothesis which means that we add a new element to the transitive closure of...
Bouchitte, V., Hilali, A., Jegou, R., Rampon, Jean-Xavier
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict...
On-line recognition of interval orders (1993)
Bouchitté, Vincent, Jégou, Roland, Rampon, Jean-Xavier
The first one is optimal in time and space and recognizes the transitive closure of an interval order under the suborder hypothesis which means that we add a new element to the transitive closure of...
Bouchitté, Vincent, Hilali, Abdelmajid, Jégou, Roland, Rampon, Jean-Xavier
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict...
Computing on-line the covering graph of the ideal lattice of posets (1993)
Diehl, Claire, Jard, Claude, Rampon, Jean-Xavier
Disponible dans les fichiers attachés à ce document
On-line recognition of interval orders (1993)
Bouchitté, Vincent, Jégou, Roland, Rampon, Jean-Xavier
The first one is optimal in time and space and recognizes the transitive closure of an interval order under the suborder hypothesis which means that we add a new element to the transitive closure of...
Bouchitté, Vincent, Hilali, Abdelmajid, Jégou, Roland, Rampon, Jean-Xavier
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension extension L such that all upper (or lower) cover sets are intervals of L. This new class is a strict...
Computing on-line the covering graph of the ideal lattice of posets (1993)
Diehl, Claire, Jard, Claude, Rampon, Jean-Xavier
Disponible dans les fichiers attachés à ce document
Ordres representables par des translations de segments dans le plan (1992)
Bouchitte, V., Jegou, R., Rampon, Jean-Xavier
Certains ensembles ordonnes peuvent etre representes par des translations de figures convexes du plan. Il est prouve, dans cette note, que les ordres sans N et les ordres d'intervalles admettent une...
Reachability analysis on distributed executions (1992)
Diehl, C., Jard, Claude, Rampon, Jean-Xavier
The work described in this paper belongs to the general context of distributed program debugging. For the goal of verification, the expected behaviour or the suspected errors of the system under test...
Towards the reconstruction of poset (1992)
Kratsch, Dieter, Rampon, Jean-Xavier
The reconstruction conjecture for posets is the following : every finite poset P of more than three elements is uniquely determined - up to isomorphism - by its collection of (unlabelled)...
Ordres représentables par des translations de segments dans le plan (1992)
Bouchitté, Vincent, Jégou, Roland, Rampon, Jean-Xavier
Certains ensembles ordonnes peuvent être représentés par des translations de figures convexes du plan. Il est prouvé, dans cette note, que les ordres sans N et les ordres d'intervalles admettent...
Reachability analysis on distributed executions (1992)
Diehl, Claire, Jard, Claude, Rampon, Jean-Xavier
The work described in this paper belongs to the general context of distributed program debugging. For the goal of verification, the expected behaviour or the suspected errors of the system under test...
Towards the reconstruction of poset (1992)
Kratsch, Dieter, Rampon, Jean-Xavier
The reconstruction conjecture for posets is the following : every finite poset P of more than three elements is uniquely determined - up to isomorphism - by its collection of (unlabelled)...
Ordres représentables par des translations de segments dans le plan (1992)
Bouchitté, Vincent, Jégou, Roland, Rampon, Jean-Xavier
Certains ensembles ordonnes peuvent être représentés par des translations de figures convexes du plan. Il est prouvé, dans cette note, que les ordres sans N et les ordres d'intervalles admettent...
Reachability analysis on distributed executions (1992)
Diehl, Claire, Jard, Claude, Rampon, Jean-Xavier
The work described in this paper belongs to the general context of distributed program debugging. For the goal of verification, the expected behaviour or the suspected errors of the system under test...
Towards the reconstruction of poset (1992)
Kratsch, Dieter, Rampon, Jean-Xavier
The reconstruction conjecture for posets is the following : every finite poset P of more than three elements is uniquely determined - up to isomorphism - by its collection of (unlabelled)...