Planar Bus Graphs (original) (raw)

On the Characterization of Plane Bus Graphs

Till Bruckdorfer

Lecture Notes in Computer Science, 2013

View PDFchevron_right

On a Graph Partition Problem with Application to VLSI Layout

Sumanta Guha

Information Processing Letters, 1992

View PDFchevron_right

On a graph partitioning problem with applications to VLSI layout

Hirendra Deora

1992

View PDFchevron_right

A plane graph representation of triconnected graphs

Ehab Morsy

Theoretical Computer Science, 2010

View PDFchevron_right

A Note on Minimum-Segment Drawings of Planar Graphs

Walter Didimo

Journal of Graph Algorithms and Applications, 2013

View PDFchevron_right

Partitioning planar graphs: a fast combinatorial approach for max-cut

Frauke Liers

Computational Optimization and Applications, 2012

View PDFchevron_right

A linear algorithm for embedding planar graphs using PQ-trees

Takao Nishizeki

Journal of Computer and System Sciences, 1985

View PDFchevron_right

Recognizing and Drawing IC-Planar Graphs

Walter Didimo

Lecture Notes in Computer Science, 2015

View PDFchevron_right

On the Complexity of Covering Vertices by Faces in a Planar Graph

Clyde Monma

SIAM Journal on Computing, 1988

View PDFchevron_right

Methods for the graph realization problem

Zoltán Kása

Acta Universitatis Sapientiae: Informatica, 2023

View PDFchevron_right

Optimal Polygonal Representation of Planar Graphs

Michael Kaufmann

Algorithmica, 2012

View PDFchevron_right

Testing Planarity of Partially Embedded Graphs

Maurizio Patrignani

ACM Transactions on Algorithms, 2015

View PDFchevron_right

An efficient parallel algorithm for planarity

John Reif

Journal of Computer and System Sciences, 1988

View PDFchevron_right

The complexity of the matching-cut problem for planar graphs and other graph classes

Hans Bodlaender

Journal of Graph Theory, 2009

View PDFchevron_right

On Planar Supports for Hypergraphs

Marc Van Kreveld

Journal of Graph Algorithms and Applications, 2011

View PDFchevron_right

A linear-time algorithm for four-partitioning four-connected planar graphs

Shinichi Nakano

Information Processing Letters, 1997

View PDFchevron_right

O(n/sup 2/) algorithms for graph planarization

M.N.S. Swamy

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989

View PDFchevron_right

Box-Rectangular Drawings of Planar Graphs

S.M. Rezaul Karim

Journal of Graph Algorithms and Applications, 2013

View PDFchevron_right

BiPart: a parallel and deterministic hypergraph partitioner

Sepideh Maleki

Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

View PDFchevron_right

Rectangular Dualization of Biconnected Planar Graphs in Linear Time and Related Applications

Massimo Ancona

Applied and Industrial Mathematics in Italy II - Selected Contributions from the 8th SIMAI Conference, 2007

View PDFchevron_right

On Embeddability of Buses in Point Sets

Till Bruckdorfer

Lecture Notes in Computer Science, 2015

View PDFchevron_right

Geometric bipartitioning problem and its applications to VLSI

Anup Sen

Proceedings of 9th International Conference on VLSI Design

View PDFchevron_right

Computing �Drawings of 2-Outerplane Graphs (Extended Abstract)

saidur rahman

2007

View PDFchevron_right

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs

Maurizio Patrignani

Computational Geometry, 2015

View PDFchevron_right

The reconstruction of maximal planar graphs. I. Recognition

Stanley Fiorini

Journal of Combinatorial Theory, Series B, 1981

View PDFchevron_right

Fan-Planar Graphs: Combinatorial Properties and Complexity Results

C. Binucci

Lecture Notes in Computer Science, 2014

View PDFchevron_right

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Hans Bodlaender

Algorithmica, 2010

View PDFchevron_right

On Triangulating Planar Graphs under the Four-Connectivity Constraint

Michael Kaufmann

Algorithmica, 1997

View PDFchevron_right

A general method for efficient embeddings of graphs into optimal hypercubes

Ernst W Mayr

Lecture Notes in Computer Science, 1996

View PDFchevron_right

Constructing compact rectiliner planar layouts using canonical representation of planar graphs

Jyrki Nummenmaa

Theoretical Computer Science, 1992

View PDFchevron_right

Planar stage graphs: Characterizations and applications

JORGE URRUTIA

Theoretical Computer Science, 1997

View PDFchevron_right