Interval orders: combinatorial structure and algorithms

@inproceedings{Felsner1992IntervalOC,
  title={Interval orders: combinatorial structure and algorithms},
  author={Stefan Felsner},
  year={1992}
}
(D 83) 2 Preface This thesis is based on my research on partially ordered sets and specially interval orders, that began when I came to Berlin in 1988. Professor R.H. MM ohring introduced me to the eld, I like to thank him for stimulations and guidance over the years. Beside the introduction, the thesis combines ve chapters that have in common the central role played by interval orders. On the other hand, they are only loosely connected and so I decided to make the chapters self-contained. To… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

A recognition algorithm for II-graph

  • F Ch, Cheah
  • Technical Report
  • 1990

About minimal interval extensions

  • Hmr M Habib, M Morvan, J.-X Rampon
  • About minimal interval extensions
  • 1990

Algorithms on special classes of graphs and partial orders

  • Ms, T Ma
  • Algorithms on special classes of graphs and…
  • 1990

More bounds for the dimension of interval orders

  • Fm, S Felsner, M Morvan
  • Preprint
  • 1990

On the interplay of interval dimension and dimension

  • Fhm S Felsner, M Habib, R H Ohring
  • Preprint
  • 1990

On the linear structure of graphs, COST Workshop held at Rutgers Univ

  • Cos D G Coneil, S Olariu, L Stewart
  • On the linear structure of graphs, COST Workshop…
  • 1990

Recognition of partial orders with interval dimension two via transitive orientation with side constraints

  • Hm, M Habib, R H Ohring
  • Preprint
  • 1990

Edge subdivision and dimension

  • J Sp, Spinrad
  • Order
  • 1989

Similar Papers

Loading similar papers…