D.I.E.I. - Università degli Studi di Perugia h-quasi planar drawings of bounded treewidth graphs in linear area Emilio Di Giacomo, Walter Didimo, Giuseppe.
Battista 2015
Data and networks GIACS Conference Palermo 9-4-08.
On the complexity of orthogonal compaction maurizio patrignani univ. rome III.
Something We Always Wanted to Know about ASs: Relationships and Taxonomy Dmitri Krioukov [email protected] X. Dimitropoulos, M. Fomenkov, B. Huffaker, Y.
Progress in inferring business relationships between ASs Dmitri Krioukov [email protected] 4 th CAIDA-WIDE Workshop.
CSE 6405 Graph Drawing 1 2 3 4 6 8 5 7. Text Books T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004. G. Di Battista,
The complexity of the matching-cut problem Maurizio Patrignani & Maurizio Pizzonia Third University of Rome.
Data and networks GIACS Conference Palermo 9-4-08
The complexity of the matching-cut problem
on the complexity of orthogonal compaction
