# Planarization

## Papers overview

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

2014

2014

- SODA
- 2014

The problem of testing whether a graph is planar has been studied for over half a century, and is known to be solvable in O(nâ€¦Â (More)

Is this relevant?

2013

2013

- Comput. Graph. Forum
- 2013

Constraining 3D meshes to restricted classes is necessary in architectural and industrial design, but it can be very challengingâ€¦Â (More)

Is this relevant?

2010

2010

- IEEE Transactions on Magnetics
- 2010

The planarization of patterned recording media is essential to overcome the Â¿flying height reductionÂ¿ and Â¿flying instabilityÂ¿ ofâ€¦Â (More)

Is this relevant?

2010

2010

- IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

It has been shown by Indyk and Sidiropoulos \cite{indyk_genus} that any graph of genus $g>0$ can be stochastically embedded intoâ€¦Â (More)

Is this relevant?

2009

2009

- J. Graph Algorithms Appl.
- 2009

Recently, we presented a new practical method for upward crossing minimization [6], which clearly outperformed existingâ€¦Â (More)

Is this relevant?

2008

2008

- IEEE INFOCOM - The 27th Conference on Computerâ€¦
- 2008

Wireless sensor networks need very efficient network protocols due to the sensors' limited communication and computationâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- NSDI
- 2006

We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes andâ€¦Â (More)

Is this relevant?

2004

2004

- J. Graph Algorithms Appl.
- 2004

A bipartite graph is biplanar if the vertices can be placed on two parallel lines in the plane such that there are no edgeâ€¦Â (More)

Is this relevant?

1994

1994

- Networks
- 1994

Given a graph G = (V, E ) , the graph planarization problem is to find a largest subset F of E, such that H = (V , F) is planarâ€¦Â (More)

Is this relevant?

1989

1989

- IEEE Trans. on CAD of Integrated Circuits andâ€¦
- 1989

Abstmct-In this paper we present two O ( n * ) planarization algorithms-PLANARIZE and MAXIMAL-PLANARIZE. These algorithms areâ€¦Â (More)

Is this relevant?