On the public citation graph

On Rectilinear Duals for Vertex-Weighted Plane Graphs

0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230150202openalex-snapshot
Rectangular duals of planar graphs
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.1007/978-3-540-30140-0_64openalex-snapshot
On Rectangular Cartograms
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_27openalex-snapshot
Octagonal Drawings of Plane Graphs with Prescribed Face Areas
inferredcites →https://doi.org/10.1016/0020-0190(92)90210-mopenalex-snapshot
On the optimal binary plane partition for sets of isothetic rectangles
inferredcites →https://doi.org/10.1016/j.comgeo.2006.06.002openalex-snapshot
On rectangular cartograms
inferredcites →https://doi.org/10.1016/j.comgeo.2008.09.002openalex-snapshot
Octagonal drawings of plane graphs with prescribed face areas
inferredcites →https://doi.org/10.1016/s0196-6774(03)00057-9openalex-snapshot
Compact floor-planning via orderly spanning trees
inferredcites →https://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
inferredcites →https://doi.org/10.1017/s0963548300000407openalex-snapshot
Plane Cubic Graphs with Prescribed Face Areas
inferredcites →https://doi.org/10.1080/136588100403290openalex-snapshot
Book reviews
inferredcites →https://doi.org/10.1109/infvis.2004.57openalex-snapshot
RecMap: Rectangular Map Approximations
inferredcites →https://doi.org/10.1111/j.0033-0124.1985.00075.xopenalex-snapshot
AN ALGORITHM TO CONSTRUCT CONTINUOUS AREA CARTOGRAMS∗
inferredcites →https://doi.org/10.1137/s0895480191266700openalex-snapshot
Sliceable Floorplanning by Graph Dualization
inferredcites →https://doi.org/10.1145/1183471.1183476openalex-snapshot
Optimal BSPs and rectilinear cartograms
inferredcites →https://doi.org/10.2307/208794openalex-snapshot
The Rectangular Statistical Cartogram

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-35589-8_34openalex-snapshot
A Linear Programming Approach to Rectangular Cartograms
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_53openalex-snapshot
Orthogonal Drawings for Plane Graphs with Specified Face Areas
inferred← citeshttps://doi.org/10.1007/978-3-540-77974-2_12openalex-snapshot
Binary Space Partitions
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_30openalex-snapshot
Drawing Planar 3-Trees with Given Face-Areas
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_9openalex-snapshot
Orthogonal Cartograms with Few Corners Per Face
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.06.002openalex-snapshot
On rectangular cartograms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.002openalex-snapshot
Octagonal drawings of plane graphs with prescribed face areas
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.005openalex-snapshot
Orthogonal cartograms with at most 12 corners per face
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.038openalex-snapshot
Drawing slicing graphs with face areas
inferred← citeshttps://doi.org/10.1145/1183471.1183476openalex-snapshot
Optimal BSPs and rectilinear cartograms
inferred← citeshttps://doi.org/10.48550/arxiv.math/0602163openalex-snapshot
Transversal structures on triangulations: a combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.6100/ir636963openalex-snapshot
Drawing graphs for cartographic applications
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.