Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is… Expand

Is this relevant?

2018

2018

The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the… Expand

Is this relevant?

2018

2018

We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is… Expand

Is this relevant?

2018

2018

NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter… Expand

Is this relevant?

Review

2018

Review

2018

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences… Expand

Is this relevant?

2011

2011

We discuss recent developments in the literature that studies how the dynamics of earnings and wages affect consumption choices… Expand

Is this relevant?

2007

2007

We present several polynomial-time algorithms for c-planarity testing for clustered graphs with clusters of size at most three… Expand

Is this relevant?

2002

2002

We derive conditions for decomposition and collapsibility of graphical interaction models for multivariate time series. These… Expand

Is this relevant?

2001

2001

The guidelines for geometry teaching demand training in spatial abilities to be a principal aim of geometry teaching… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

We introduce two new notions of planarity for hypergraphs based on dual generalizations of the standard Venn diagram. These… Expand

Is this relevant?