On the public citation graph
A linear algorithm to find a rectangular dual of a planar triangulated graph
0 signed · 96 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230170306openalex-snapshot
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
inferredcites →https://doi.org/10.1109/dac.1982.1585509openalex-snapshot
The Planar Package Planner for System Designers
inferredcites →https://doi.org/10.1109/dac.1982.1585567openalex-snapshot
On finding Most Optimal Rectangular Package Plans
inferredcites →https://doi.org/10.1109/dac.1984.1585872openalex-snapshot
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
inferredcites →https://doi.org/10.5555/800033.800872openalex-snapshot
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.4430720304openalex-snapshot
An algorithm to enumerate all rectangular dual graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1105openalex-snapshot
Box-Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1161openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_23openalex-snapshot
Rectangular Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_24openalex-snapshot
Extended Rectangular Drawings of Plane Graphs with Designated Corners
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_22openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_9openalex-snapshot
Rectangular Drawings of Plane Graphs Without Designated Corners
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_29openalex-snapshot
Floor-Planning via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_73openalex-snapshot
Inherent nonslicibility of rectangular duals in VLSI floorplanning
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_360openalex-snapshot
Regular edge labelings and drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_142openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_12openalex-snapshot
Rectangle and Square Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_38openalex-snapshot
Realization and Connectivity of the Graphs of Origami Flat Foldings
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_17openalex-snapshot
Planar L-Drawings of Bimodal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_9openalex-snapshot
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44989-0_27openalex-snapshot
Automated Best Connected Rectangular Floorplans
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_60openalex-snapshot
Inner Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_14openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_23openalex-snapshot
On Touching Triangle Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-5269-0_27openalex-snapshot
Construction of Non-rectangular Floor Plans for Properly Triangulated Planar Graphs
inferred← citeshttps://doi.org/10.1007/bf01189069openalex-snapshot
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
inferred← citeshttps://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferred← citeshttps://doi.org/10.1007/bf01891831openalex-snapshot
Floorplanning by graph dualization: L-shaped modules
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/s00004-024-00807-7openalex-snapshot
Non-trivial Self-organised Floor Plans: An Optimisation Strategy
inferred← citeshttps://doi.org/10.1007/s10878-010-9324-8openalex-snapshot
Improved floor-planning of graphs via adjacency-preserving transformations
inferred← citeshttps://doi.org/10.1007/s10878-024-01217-8openalex-snapshot
Construction of floorplans for plane graphs over polygonal boundaries
inferred← citeshttps://doi.org/10.1007/s10878-025-01287-2openalex-snapshot
Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/j.autcon.2020.103187openalex-snapshot
Addressing adjacency constraints in rectangular floor plans using Monte-Carlo Tree Search
inferred← citeshttps://doi.org/10.1016/j.autcon.2021.103718openalex-snapshot
A tool for computer-generated dimensioned floorplans based on given adjacencies
inferred← citeshttps://doi.org/10.1016/j.cag.2025.104506openalex-snapshot
Automated generation of housing layouts using graph-rules
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.09.002openalex-snapshot
Drawings of planar graphs with few slopes and segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.06.001openalex-snapshot
Rectangular-radial drawings of cubic plane graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102242openalex-snapshot
Rectangular drawing of cubic graphs on an annulus and a Möbius band
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.016openalex-snapshot
Efficient enumeration of transversal edge-partitions
inferred← citeshttps://doi.org/10.1016/j.foar.2023.04.003openalex-snapshot
An interactive approach for generating spatial architecture layout based on graph theory
inferred← citeshttps://doi.org/10.1016/j.gmod.2023.101175openalex-snapshot
Automated generation of floorplans with non-rectangular rooms
inferred← citeshttps://doi.org/10.1016/j.jobe.2024.110835openalex-snapshot
Architectural spatial layout design for hospitals: A review
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.014openalex-snapshot
A transformation algorithm to construct a rectangular floorplan
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.025openalex-snapshot
A theory of L-shaped floor-plans
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114722openalex-snapshot
A graph theoretic approach for generating T-shaped floor plans
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115209openalex-snapshot
Existence and construction of a C-shaped module within a floorplan
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00490-8openalex-snapshot
Simple and efficient floor-planning
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00057-9openalex-snapshot
Compact floor-planning via orderly spanning trees
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00126-3openalex-snapshot
Rectangular drawings of planar graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(95)00257-xopenalex-snapshot
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00061-xopenalex-snapshot
Rectangular drawings of plane graphs without designated corners
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00003-0openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1017/s0890060421000275openalex-snapshot
Graph-based approach for enumerating floorplans based on users specifications
inferred← citeshttps://doi.org/10.1017/s0890060424000179openalex-snapshot
Automated generation of floor plans with minimum bends
inferred← citeshttps://doi.org/10.1017/s0890060425000022openalex-snapshot
Automated generation of circulations within a floorplan
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218459openalex-snapshot
An annotated review on graph drawing and its applications
inferred← citeshttps://doi.org/10.1109/43.251149openalex-snapshot
A unified approach to floorplan sizing and enumeration
inferred← citeshttps://doi.org/10.1109/43.752923openalex-snapshot
Nostradamus: a floorplanner of uncertain designs
inferred← citeshttps://doi.org/10.1109/92.924056openalex-snapshot
Fast floorplanning for effective prediction and construction
inferred← citeshttps://doi.org/10.1109/apvis.2007.329276openalex-snapshot
Directed graphs and rectangular layouts
inferred← citeshttps://doi.org/10.1109/aspdac.2009.4796508openalex-snapshot
Exploring adjacency in floorplanning
inferred← citeshttps://doi.org/10.1109/glsv.1996.497593openalex-snapshot
A minimum-area floorplanning algorithm for MBC designs
inferred← citeshttps://doi.org/10.1109/iscas.1990.112025openalex-snapshot
Planar orthogonal drawings of graphs
inferred← citeshttps://doi.org/10.1109/iscas.1990.112029openalex-snapshot
Linear time optimization of partially solved floorplans
inferred← citeshttps://doi.org/10.1109/iscas.1990.112603openalex-snapshot
Floorplanning by graph dualization: L-shaped modules
inferred← citeshttps://doi.org/10.1109/iscc.2006.167openalex-snapshot
Visualizing and Managing Network Topologies via Rectangular Dualization
inferred← citeshttps://doi.org/10.1109/isscs.2007.4292672openalex-snapshot
An Investigation of Complex Triangle Elimination Problem of VLSI Floor Planning Employing Genetic Algorithmic Scheme
inferred← citeshttps://doi.org/10.1109/iv.2005.45openalex-snapshot
Embedding Plane Graphs in the Grids
inferred← citeshttps://doi.org/10.1109/mwscas.1992.271116openalex-snapshot
Floorplanning via graph dualization with subsets of rectangular and L-shaped modules
inferred← citeshttps://doi.org/10.1109/tcsi.2003.809442openalex-snapshot
The quarter-state-sequence floorplan representation
inferred← citeshttps://doi.org/10.1137/0222035openalex-snapshot
Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
inferred← citeshttps://doi.org/10.1137/0222072openalex-snapshot
On Finding the Rectangular Duals of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1137/s0097539796308874openalex-snapshot
On Floor-Plan of Plane Graphs
inferred← citeshttps://doi.org/10.1137/s0895480191266700openalex-snapshot
Sliceable Floorplanning by Graph Dualization
inferred← citeshttps://doi.org/10.1142/s0218195906002026openalex-snapshot
INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
inferred← citeshttps://doi.org/10.1145/123186.123255openalex-snapshot
An analytical approach to floorplan design and optimization
inferred← citeshttps://doi.org/10.1145/1328911.1328919openalex-snapshot
Rectangular layouts and contact graphs
inferred← citeshttps://doi.org/10.1145/267665.267706openalex-snapshot
Slicibility of rectangular graphs and floorplan optimization
inferred← citeshttps://doi.org/10.1145/3564982.3564994openalex-snapshot
Characterization of Graphs Based on Number of Bends in Corresponding Floor plans
inferred← citeshttps://doi.org/10.11606/d.45.2012.tde-07052012-164622openalex-snapshot
Representações retangulares de grafos planares
inferred← citeshttps://doi.org/10.21236/ada201173openalex-snapshot
Dynamic Data Structures for Two-Dimensional Searching
inferred← citeshttps://doi.org/10.3390/app12010165openalex-snapshot
Residential Buildings Complex Boundaries Generation Based on Spatial Grid System
inferred← citeshttps://doi.org/10.48550/arxiv.2006.14182openalex-snapshot
A linear time algorithm for constructing orthogonal floor plans with minimum number of bends
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01803openalex-snapshot
GPLAN: Computer-Generated Dimensioned Floorplans for given Adjacencies
inferred← citeshttps://doi.org/10.48550/arxiv.2101.03505openalex-snapshot
Transformations of Rectangular Dualizable Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05304openalex-snapshot
A Theory of Rectangularly Dualizable Graphs
inferred← citeshttps://doi.org/10.6100/ir636963openalex-snapshot
Drawing graphs for cartographic applications
inferred← citeshttps://doi.org/10.7155/jgaa.00596openalex-snapshot
Planar L-Drawings of Bimodal Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.