Titre : Weak Dominance and Overloaded Orthogonal Drawings Exposant : Ioannis (Yanni) G. Tollis, University of Crete, and the Institute of Computer Science at FORTH (ICS-FORTH) Résumé : In this talk we introduce the problem of Weak Dominance Drawing by extending the concept of dominance to general directed acyclic graphs. We show the connection of weak dominance drawings and the linear extension diameter of a partial order P. We also present complexity results and bounds. We use weak dominance to present a technique called Overloaded Orthogonal Drawing of graphs. We first place the vertices on grid points following the weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these drawings we use an overloading technique. All algorithms are simple and easy to implement and can be applied to directed acyclic graphs, planar, non-planar and also undirected graphs. We also present bounds on the number of bends and the area. Overloaded Orthogonal drawings have several interesting properties such as efficient visual edge confirmation as well as simplicity and clarity of the drawing of a graph.