On the public citation graph
On Triangulating Planar Graphs under the Four-Connectivity Constraint
0 signed · 63 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/jgt.3190140105openalex-snapshot
Hamiltonian cycles in planar triangulations with no separating triangles
inferredcites →https://doi.org/10.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferredcites →https://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/s0925-7721(96)00003-xopenalex-snapshot
Triangulating with high connectivity
inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferredcites →https://doi.org/10.1109/sfcs.1991.185418openalex-snapshot
A linear time algorithm for triconnectivity augmentation
inferredcites →https://doi.org/10.1109/sfcs.1991.185451openalex-snapshot
On-line maintenance of the four-connected components of a graph
inferredcites →https://doi.org/10.1109/sfcs.1992.267817openalex-snapshot
On four-connecting a triconnected graph
inferredcites →https://doi.org/10.1109/tct.1969.1083004openalex-snapshot
The Design of Minimum-Cost Survivable Networks
inferredcites →https://doi.org/10.1109/tct.1970.1083185openalex-snapshot
Connectivity considerations in the design of survivable networks
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/0222056openalex-snapshot
Finding a Smallest Augmentation to Biconnect a Graph
inferredcites →https://doi.org/10.5555/313651.313830openalex-snapshot
Subgraph isomorphism in planar graphs and related problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11604686_24openalex-snapshot
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
inferred← citeshttps://doi.org/10.1007/11618058_17openalex-snapshot
Transversal Structures on Triangulations, with Application to Straight-Line Drawing
inferred← citeshttps://doi.org/10.1007/11880561_24openalex-snapshot
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_4openalex-snapshot
The SPQR-Tree Data Structure in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_37openalex-snapshot
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_27openalex-snapshot
All Separating Triangles in a Plane Graph Can Be Optimally “Broken” in Poly nomial Time
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_37openalex-snapshot
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_21openalex-snapshot
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_15openalex-snapshot
Reaching 3-Connectivity via Edge-Edge Additions
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_36openalex-snapshot
Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_11openalex-snapshot
Non-aligned Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_15openalex-snapshot
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73731-5_10openalex-snapshot
Comparing RNA Structures: Towards an Intermediate Model Between the Edit and the Lapcs Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_13openalex-snapshot
Extending the Hardness of RNA Secondary Structure Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_33openalex-snapshot
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_26openalex-snapshot
Simultaneous Embeddings with Vertices Mapping to Pre-specified Points
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_10openalex-snapshot
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_30openalex-snapshot
Triangulating Planar Graphs While Keeping the Pathwidth Small
inferred← citeshttps://doi.org/10.1007/s00453-018-0433-6openalex-snapshot
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
inferred← citeshttps://doi.org/10.1007/s00453-025-01350-8openalex-snapshot
Recognition Complexity of Subgraphs of $${\textbf {k}}$$-Connected Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s00454-008-9098-2openalex-snapshot
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
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.comgeo.2010.07.001openalex-snapshot
Closed rectangle-of-influence drawings for irreducible triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.11.001openalex-snapshot
Flip distance between two triangulations of a point set is NP-complete
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.017openalex-snapshot
On triangulating k -outerplanar graphs
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.jda.2008.03.004openalex-snapshot
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.010openalex-snapshot
Compact visibility representation of 4-connected plane graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00004-1openalex-snapshot
The longest common subsequence problem for sequences with nested arc annotations
inferred← citeshttps://doi.org/10.1109/iscc.2006.167openalex-snapshot
Visualizing and Managing Network Topologies via Rectangular Dualization
inferred← citeshttps://doi.org/10.1142/9789812709394_0004openalex-snapshot
RECTANGULAR DUALIZATION OF BICONNECTED PLANAR GRAPHS IN LINEAR TIME AND RELATED APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218195911003627openalex-snapshot
RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS
inferred← citeshttps://doi.org/10.1145/1133265.1133356openalex-snapshot
Euclidean representation of 3D electronic institutions
inferred← citeshttps://doi.org/10.1145/1328911.1328919openalex-snapshot
Rectangular layouts and contact graphs
inferred← citeshttps://doi.org/10.20535/2411-2976.22023.40-52openalex-snapshot
PRUNING MINIMUM SPANNING TREES AND CUTTING LONGEST EDGES TO CONNECT A GIVEN NUMBER OF NODES BY MINIMIZING TOTAL EDGE LENGTH
inferred← citeshttps://doi.org/10.46298/dmtcs.2085openalex-snapshot
On the number of regular edge labelings
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04235openalex-snapshot
Triangulating planar graphs while keeping the pathwidth small
inferred← citeshttps://doi.org/10.48550/arxiv.1606.02220openalex-snapshot
Non-aligned drawings of planar graphs
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.math/0602163openalex-snapshot
Transversal structures on triangulations: a combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.70675/915790c9z1594z4e9czab64zab385caa09d0openalex-snapshot
Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations
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.