Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at… Expand

2018

2018

We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that… Expand

Highly Cited

2016

Highly Cited

2016

Abstract We give new results about the relationship between 1-planar graphs and RAC graphs. A graph is 1-planar if it has a… Expand

2013

2013

In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set… Expand

Highly Cited

2011

Highly Cited

2011

Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as… Expand

2011

2011

A 2-layer drawing represents a bipartite graph so that the vertices of each partition set are points of a distinct horizontal… Expand

2011

2011

Note: Special Issue on Selected Papers from GD '09. Accepted, subject to minor revisions Reference EPFL-ARTICLE-158708 Record… Expand

2010

2010

We study how much better a right-angled crossing (RAC) drawing of a planar graph can be than any planar drawing of the same… Expand

2010

2010

In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum… Expand

2009

2009

Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as… Expand