Skip to main content

Theory of Computing Systems

Ausgabe 3/2011

Inhalt (7 Artikel)

Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer

A Property Tester for Tree-Likeness of Quartet Topologies

Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith

The Hub Number of Sierpiński-Like Graphs

Chien-Hung Lin, Jia-Jie Liu, Yue-Li Wang, William Chung-Kung Yen

Dimension, Halfspaces, and the Density of Hard Sets

Ryan C. Harkins, John M. Hitchcock

Approximating the Metric TSP in Linear Time

Davide Bilò, Luca Forlizzi, Guido Proietti