4.2 Article

On the complexity of the storyplan problem

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

Planarity of streamed graphs

Giordano Da Lozzo et al.

THEORETICAL COMPUTER SCIENCE (2019)

Article Computer Science, Software Engineering

Visualizing Dynamic Hierarchies in Graph Sequences

Corinna Vehlow et al.

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS (2016)

Article Computer Science, Theory & Methods

Advancements on SEFE and Partitioned Book Embedding problems

Patrizio Angelini et al.

THEORETICAL COMPUTER SCIENCE (2015)

Article Computer Science, Software Engineering

Techniques for Edge Stratification of Complex Graph Drawings

Emilio Di Giacomo et al.

JOURNAL OF VISUAL LANGUAGES AND COMPUTING (2014)

Article Computer Science, Information Systems

Drawing trees in a streaming model

Carla Binucci et al.

INFORMATION PROCESSING LETTERS (2012)

Article Computer Science, Theory & Methods

Improved upper bounds for vertex cover

Jianer Chen et al.

THEORETICAL COMPUTER SCIENCE (2010)

Article Computer Science, Hardware & Architecture

Which problems have strongly exponential complexity?

R Impagliazzo et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2001)

Article Computer Science, Hardware & Architecture

On the complexity of k-SAT

R Impagliazzo et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2001)