The jump number problem for biconvex graphs and rectangle covers of rectangular regions

This publication has 11 references indexed in Scilit:

• On the restriction of some NP-complete graph problems to permutation graphs
  Published by Springer Nature ,2006
• Bipartite permutation graphs
  Discrete Applied Mathematics, 1987
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
  Order, 1987
• Algorithmic Aspects of Comparability Graphs and Interval Graphs
  Published by Springer Nature ,1985
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
  Order, 1984
• An algorithm for constructing regions with rectangles
  Published by Association for Computing Machinery (ACM) ,1984
• Comparability Invariants
  Published by Elsevier ,1984
• Covering Regions by Rectangles
  SIAM Journal on Algebraic Discrete Methods, 1981
• The Jump Number of Dags and Posets: An Introduction
  Published by Elsevier ,1980
• Permutation Graphs and Transitive Graphs
  Journal of the ACM, 1972