The design and analysis of computer algorithms, 1974. ,
On Finding Lowest Common Ancestors in Trees, SIAM Journal on Computing, vol.5, issue.1, pp.115-132, 1976. ,
DOI : 10.1137/0205011
Data structures and algorithms, 1983. ,
Partially ordered sets and their comparability graphs, their dimension and their adjacency, Problèmes combinatoires et théorie des graphes, pp.5-8, 1976. ,
Lattice Theory, American Math. Pub. Colloquium, vol.25, 1979. ,
DOI : 10.1090/coll/025
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes, Discrete Applied Mathematics, vol.12, issue.3, pp.215-231, 1985. ,
DOI : 10.1016/0166-218X(85)90026-5
URL : http://doi.org/10.1016/0166-218x(85)90026-5
Chordal bipartite graphs and crowns, pp.119-122, 1985. ,
Sur les parcours en profondeur dans les graphes, 1985. ,
On the greedy dimension of a partial order, pp.219-224, 1985. ,
Depth-first search and linear extensions, 1985. ,
Sorne NP-completeness properties about linear extensions, 1986. ,
DOI : 10.1007/bf00337693
The Jump Number of Dags and Posets: An Introduction, Annals of Discrete Math, vol.9, pp.189-194, 1980. ,
DOI : 10.1016/S0167-5060(08)70060-8
Sur le nombre de sauts d'une forêt, C.R.A.S. Paris, t. Série A, vol.275, pp.159-161, 1972. ,
Nombre de sauts et graphes s??rie-parall??les, RAIRO. Informatique th??orique, vol.13, issue.1, pp.3-18, 1979. ,
DOI : 10.1051/ita/1979130100031
Minimizing setups in ordered sets of flxed width, pp.225-229, 1985. ,
The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971. ,
DOI : 10.1145/800157.805047
A Decomposition Theorem for Partially Ordered Sets, The Annals of Mathematics, vol.51, issue.1, pp.161-166, 1950. ,
DOI : 10.2307/1969503
Comparability invariance of the flxed point property, pp.269-274, 1985. ,
Partially Ordered Sets, American Journal of Mathematics, vol.63, issue.3, pp.600-641, 1941. ,
DOI : 10.2307/2371374
Minimizing setups for cycle-free ordered sets, Proceedings of the American Mathematical Society, vol.85, issue.4 ,
DOI : 10.1090/S0002-9939-1982-0660592-3
Substitution and atomic extension on greedy posets, Order, vol.2, issue.3, 1986. ,
DOI : 10.1007/BF00400287
Greedy linear extensions to minimize jumps, Discrete Applied Mathematics, vol.11, issue.2, pp.509-512, 1985. ,
DOI : 10.1016/S0166-218X(85)80005-6
Connectivité des graphes et automorphismes des cartes : propriétés et algorithmes, Thèse d'état, 1979. ,
A Construction for Strongly Greedy Ordered Sets, Selected Tapies in Operation Research and Mathematical Economies, pp.307-314, 1984. ,
DOI : 10.1007/978-3-642-45567-4_23
On simplicial eHmination in combinatorial structures, Institut für Okonometrie und Operations Research, p.84349, 1985. ,
The left-right algorithm for planarity testing and embedding, 1982. ,
Computers and Intractability : a guide to the them-y of NP-completeness, Freeman, 1979. ,
Minimizing Setups for Ordered Sets: A Linear Algebraic Approach, SIAM Journal on Algebraic Discrete Methods, vol.4, issue.1, pp.132-144, 1983. ,
DOI : 10.1137/0604016
Algorithmic graph theory and perfect graphs, 1980. ,
Perfect Elimination and Chordal Bipartite Graphs, Journal of Graph Theory, vol.5, issue.2, pp.155-163, 1978. ,
DOI : 10.1002/jgt.3190020209
Comparability Invariants, Ordres : Description et rôles, pp.371-386, 1984. ,
DOI : 10.1016/S0304-0208(08)73832-5
N-free posets as generalizations of series-parallel posets, Discrete Applied Mathematics, vol.12, issue.3, pp.279-291, 1985. ,
DOI : 10.1016/0166-218X(85)90030-7
Sur quelques applications du parcours en profondeur dans les graphes, Thèse de 3e cycle, Université des Sciences et Techniques du Languedoc, 1985. ,
Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984. ,
DOI : 10.1137/0213024
On the dimension of orders, Sei. Rep. Kanazawa Univ, vol.4, pp.1-20, 1955. ,
Isomorphism of planar graphs, Complexity of computer computations, pp.131-152, 1972. ,
Dividing a Graph into Triconnected Components, SIAM Journal on Computing, vol.2, issue.3 ,
DOI : 10.1137/0202012
Efficient algorithms for graph manipulation, Comm. ACM, vol.1, issue.6, pp.372-378, 1973. ,
Efficient Planarity Testing, Journal of the ACM, vol.21, issue.4, pp.549-568, 1974. ,
DOI : 10.1145/321850.321852
On the dimension of partially ordered sets, Discrete Mathematics, vol.35, issue.1-3, pp.135-156, 1981. ,
DOI : 10.1016/0012-365X(81)90203-X
Comparability Graphs, pp.3-40, 1985. ,
DOI : 10.1007/978-94-009-5315-4_1
Planar lattices, Journal canadien de math??matiques, vol.27, issue.3, pp.636-675, 1975. ,
DOI : 10.4153/CJM-1975-074-0
Dimension Theory for Ordered Sets, Ordered Sets, 1. RIVAL. (ed), Nato Advanced Studies, pp.171-211, 1982. ,
DOI : 10.1007/978-94-009-7798-3_5
NP-Completeness results concerning greedy and super greedy linear extensions, Order, vol.3, issue.1, pp.123-134, 1986. ,
DOI : 10.1007/BF00390103
lnequalities for the greedy dimension of ordered sets, pp.145-164, 1985. ,
Big Omicron and big Omega and big Theta, ACM SIGACT News, vol.8, issue.2, pp.18-24, 1976. ,
DOI : 10.1145/1008328.1008329
A structured program to generate all topological sorting arrangements, Information Processing Letters, vol.2, issue.6, pp.153-157 ,
DOI : 10.1016/0020-0190(74)90001-5
récréations mathématiques, Gauthiers-Villars, pp.1882-1894 ,
Arbres, piles et compilation, pp.199-216, 1964. ,
Généralisation d'une construction de Dushnik et Miller, pp.877-879, 1969. ,
On minimizing setups in precedence constrained scheduling, Discrete Applied Math, 1981. ,
Combinatorial algorithms, theory and practice, 1977. ,
Sur l'algorithme gauche-droite de planéarité des graphes, de MM. H. de FRAYSSEIX et P. ROSENSTIEHL, Thèse de 3e cycle, 1981. ,
Constructing N-free jump critical posets, 1985. ,
Constructing greedy linear extensions by interchanging chains, pp.107-121, 1986. ,
Greedy linear extensions with constraints, 1985. ,
Les mots du labyrinthe, pp.245-252, 1973. ,
Les réseaux (graphes), Mémorial des Sciences Mathématiques, fasc, 1926. ,
A strong-connectivity algorithm and its applications in data flow analysis, Computers & Mathematics with Applications, vol.7, issue.1, pp.67-72, 1981. ,
DOI : 10.1016/0898-1221(81)90008-0
Two-dimensional partial orders, 1982. ,
A labeling algorithm to recognize a line digraph and output its root graph, Information Processing Letters, vol.15, issue.1, pp.28-30, 1982. ,
DOI : 10.1016/0020-0190(82)90080-1
Minimizing the jump number for ordered sets : a graph theoritic approach, pp.7-19, 1984. ,
A graph theoritic approach to the jump number problem, Graphs and Order, pp.185-215, 1985. ,
Problème 2, p.532, 1985. ,
Remarks on Dilworth partially ordered sets, Proceedings of the WG'85, pp.335-362, 1985. ,
Sur l'extension de l'ordre partiel, Fund. Math, vol.16, pp.386-389, 1930. ,
Depth-first search and linear graph algorithms, SIAM J. Comput, vol.2, pp.146-169, 1972. ,
Finding Dominators in Directed Graphs, SIAM Journal on Computing, vol.3, issue.1, pp.62-69, 1974. ,
DOI : 10.1137/0203006
Testing flow graph reducibility, J. Comput. Sys. Sei, vol.9, pp.335-365, 1974. ,
Efficiency of a good but non linear set union algorithm, J. Assoc. Comput ,
Applications of Path Compression on Balanced Trees, Journal of the ACM, vol.26, issue.4 ,
DOI : 10.1145/322154.322161
Space-Efficient Implementations of Graph Search Methods, ACM Transactions on Mathematical Software, vol.9, issue.3, pp.326-339, 1983. ,
DOI : 10.1145/356044.356048
Parcours dans un labyrinthe entrant Association Française pour l'avancement des Sciences, pp.49-53 ,
Le problème des labyrinthes, Nouvelles Annales de Mathématiques, pp.187-190 ,
Inequalities in dimension the01y for posets, Proc. Amer, pp.311-316, 1975. ,
Jump number problem: The role ofmatroid, pp.1-8, 1985. ,
The complexity of the partial arder dimension problem, SIAM J. Alg ,
Ordered sets and applications, 1985. ,