Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

A linear algorithm to decompose inheritance graphs into modules

M. Habib, M. Huchard and J. Spinrad
Algorithmica 13 (6) 573 (1995)
DOI: 10.1007/BF01189070
See this article

N-free posets as generalizations of series-parallel posets

M. Habib and R. Jegou
Discrete Applied Mathematics 12 (3) 279 (1985)
DOI: 10.1016/0166-218X(85)90030-7
See this article

Substitution and atomic extension on greedy posets

Jonathan Elbaz
Order 3 (3) 235 (1986)
DOI: 10.1007/BF00400287
See this article

Minimizing completion time for a class of scheduling problems

Ulrich Faigle and Rainer Schrader
Information Processing Letters 19 (1) 27 (1984)
DOI: 10.1016/0020-0190(84)90124-8
See this article

Algorithmic Approaches to Setup Minimization

Ulrich Faigle, Gerhard Gierz and Rainer Schrader
SIAM Journal on Computing 14 (4) 954 (1985)
DOI: 10.1137/0214068
See this article

Minimizing the jump number for partially ordered sets: A graph-theoretic approach

Maciej M. Sysło
Order 1 (1) 7 (1984)
DOI: 10.1007/BF00396269
See this article

Greedy linear extensions to minimize jumps

M.H. El-Zahar and I. Rival
Discrete Applied Mathematics 11 (2) 143 (1985)
DOI: 10.1016/S0166-218X(85)80005-6
See this article

Greedy linear extensions with constraints

Ivan Rival and Nejib Zaguia
Discrete Mathematics 63 (2-3) 249 (1987)
DOI: 10.1016/0012-365X(87)90014-8
See this article

A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders

George Steiner and Lorna K. Stewart
Order 3 (4) 359 (1987)
DOI: 10.1007/BF00340778
See this article

Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

Gerhard Gierz and Werner Poguntke
SIAM Journal on Algebraic Discrete Methods 4 (1) 132 (1983)
DOI: 10.1137/0604016
See this article

The jump number of Z-free ordered sets

Ahmad Sharary
Order 8 (3) 267 (1991)
DOI: 10.1007/BF00383447
See this article

Minimizing setups for cycle-free ordered sets

D. Duffus, I. Rival and P. Winkler
Proceedings of the American Mathematical Society 85 (4) 509 (1982)
DOI: 10.1090/S0002-9939-1982-0660592-3
See this article

V. Bouchitte and M. Habib
231 (1989)
DOI: 10.1007/978-94-009-2639-4_6
See this article

Minimizing the sum cost in linear extensions of a poset

Longcheng Liu, Biao Wu and Enyu Yao
Journal of Combinatorial Optimization 21 (2) 247 (2011)
DOI: 10.1007/s10878-009-9237-6
See this article

Greedy balanced pairs in N-free ordered sets

Imed Zaguia
Discrete Applied Mathematics 289 539 (2021)
DOI: 10.1016/j.dam.2020.10.026
See this article

On the greedy dimension of a partial order

V. Bouchitte, M. Habib and R. Jegou
Order 1 (3) 219 (1985)
DOI: 10.1007/BF00383597
See this article

The Arboreal Jump Number of an Order

Adriana P. Figueiredo, Michel Habib, Sulamita Klein and Jayme Luiz Szwarcfiter
Order 30 (1) 339 (2013)
DOI: 10.1007/s11083-012-9246-4
See this article

NP-completeness properties about linear extensions

Vincent Bouchitte and Michel Habib
Order 4 (2) 143 (1987)
DOI: 10.1007/BF00337693
See this article

Optimal linear extensions by interchanging chains

Ivan Rival
Proceedings of the American Mathematical Society 89 (3) 387 (1983)
DOI: 10.1090/S0002-9939-1983-0715851-3
See this article

Tamara Mchedlidze and Antonios Symvonis
5431 250 (2009)
DOI: 10.1007/978-3-642-00202-1_22
See this article

The setup polyhedron of series-parallel posets

Rainer Schrader and Georg Wambach
Discrete Applied Mathematics 79 (1-3) 213 (1997)
DOI: 10.1016/S0166-218X(97)00044-9
See this article

On minimizing jumps for ordered sets

Ahmad H. Sharary and Nejib Zaguia
Order 7 (4) 353 (1991)
DOI: 10.1007/BF00383200
See this article

Jump number problem: The role of matroids

Mirosław Truszczyński
Order 2 (1) 1 (1985)
DOI: 10.1007/BF00337919
See this article

A setup heuristic for interval orders

Ulrich Faigle and Rainer Schrader
Operations Research Letters 4 (4) 185 (1985)
DOI: 10.1016/0167-6377(85)90027-6
See this article

Jump number of dags having Dilworth number 2

M. Chein and M. Habib
Discrete Applied Mathematics 7 (3) 243 (1984)
DOI: 10.1016/0166-218X(84)90002-7
See this article

On finding the jump number of a partial orber by substitution decomposition

George Steiner
Order 2 (1) 9 (1985)
DOI: 10.1007/BF00337920
See this article

Ulrich Faigle and Gerhard Gierz
226 307 (1984)
DOI: 10.1007/978-3-642-45567-4_23
See this article

Lucio Bianco, Paolo Dell’Olmo and Stefano Giordani
1994 145 (1995)
DOI: 10.1007/978-3-642-79459-9_27
See this article

On the size of jump-critical ordered sets

M. H. El-Zahar and J. H. Schmerl
Order 1 (1) 3 (1984)
DOI: 10.1007/BF00396268
See this article

R. Ducournau and M. Habib
276 243 (1987)
DOI: 10.1007/3-540-47891-4_23
See this article

An algorithm for minimizing setups in precedence constrained scheduling

George Steiner
Journal of Computational and Applied Mathematics 12-13 579 (1985)
DOI: 10.1016/0377-0427(85)90050-0
See this article

Greedy posets for the bump-minimizing problem

Nejib Zaguia
Order 4 (3) 257 (1987)
DOI: 10.1007/BF00337888
See this article

Interval orders without odd crowns are defect optimal

U. Faigle and R. Schrader
Computing 38 (1) 59 (1987)
DOI: 10.1007/BF02253744
See this article