Universität zu Köln

D

Dahlhaus, Elias (1999). Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. ['eprint_fieldopt_monograph_type_preprint' not defined].

J

Jünger, Michael and Leipert, Sebastian (1999). Level Planar Embedding in linear Time (Extended Abstract). Springer. ['eprint_fieldopt_monograph_type_preprint' not defined].