scientific article; zbMATH DE number 2123122
From MaRDI portal
Publication:3154374
zbMATH Open1070.68124MaRDI QIDQ3154374FDOQ3154374
Authors: Md. Saidur Rahman, Takao Nishizeki 
Publication date: 16 December 2004
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)
Cited In (94)
- Polynomial algorithms for open plane graph and subgraph isomorphisms
- Drawing Graphs with Right Angle Crossings
- On the Edge-Length Ratio of 2-Trees
- Star colouring of bounded degree graphs and regular graphs
- The complexity of drawing a graph in a polygonal region
- Untangling planar graphs from a specified vertex position-Hard cases
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
- Orthogonal planarity testing of bounded treewidth graphs
- Small grid drawings of planar graphs with balanced partition
- Algorithms and Computation
- Orthogonal layout with optimal face complexity
- On the obfuscation complexity of planar graphs
- The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
- Force-directed layout of order diagrams using dimensional reduction
- Realizability of Graphs as Triangle Cover Contact Graphs
- Recent developments in floorplan representations
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- HV-planarity: algorithms and complexity
- Matched drawability of graph pairs and of graph triples
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Construction of a topological drawing of the most planar subgraph of the non-planar graph
- Title not available (Why is that?)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
- Planar bus graphs
- Greedy drawings of triangulations
- Title not available (Why is that?)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- Circular right-angle crossing drawings in linear time
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- Drawing graphs with right angle crossings
- Minimum-segment convex drawings of 3-connected cubic plane graphs
- Pointed drawings of planar graphs
- Acyclic colorings of graph subdivisions revisited
- Unit-length rectangular drawings of graphs
- Beyond planar graphs: introduction
- Algorithms for 1-Planar Graphs
- On orthogonally convex drawings of plane graphs
- An algorithm for constructing star-shaped drawings of plane graphs
- Grid drawings of graphs with constant edge-vertex resolution
- On some properties of doughnut graphs
- Drawing slicing graphs with face areas
- Four-Connected Spanning Subgraphs of Doughnut Graphs
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Handbook of graph drawing and visualization
- Minimum Integral Drawings of the Platonic Graphs
- Minimum-layer drawings of trees (extended abstract)
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- An annotated bibliography on 1-planarity
- Geometric graphs in the plane lattice
- Triangulations with Circular Arcs
- Point-set embeddings of trees with given partial drawings
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Matched Drawability of Graph Pairs and of Graph Triples
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- On triangle cover contact graphs
- Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Realizability of graphs as triangle cover contact graphs
- Crossing Layout in Non-planar Graph Drawings
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- Good spanning trees in graph drawing
- The topological drawing of a graph: construction methods
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Orthogonal cartograms with at most 12 corners per face
- \texttt{CelticGraph}: drawing graphs as Celtic knots and links
- Rectilinear Planarity of Partial 2-Trees
- On turn-regular orthogonal representations
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- An annotated review on graph drawing and its applications
- Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
- On edge-length ratios of partial 2-trees
- An application of st-numbering to secret key agreement
- Approximation algorithms for minimizing edge crossings in radial drawings
- Linear-time construction of floor plans for plane triangulations
- Sliding column model for t-unit bar visibility representations of graphs
- Computing upward topological book embeddings of upward planar digraphs
- On Turn-Regular Orthogonal Representations
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Title not available (Why is that?)
- Unit-length rectangular drawings of graphs
- The complexity of drawing a graph in a polygonal region
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Consecutive ones property testing: cut or swap
- Efficient enumeration of transversal edge-partitions
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- Rectilinear planarity of partial 2-trees
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
- \(L\)-shaped point set embeddings of high-degree plane graphs
- Relating planar graph drawings to planar satisfiability problems
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154374)
