On the public citation graph

On edge-intersection graphs of k-bend paths in grids

0 signed · 41 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.20305openalex-snapshot
Edge intersection graphs of single bend paths on a grid
inferredcites →https://doi.org/10.1007/3-540-58950-3_362openalex-snapshot
Regular orientations, arboricity, and augmentation
inferredcites →https://doi.org/10.1007/978-3-540-70904-6_21openalex-snapshot
Chordal Graphs as Intersection Graphs of Pseudosegments
inferredcites →https://doi.org/10.1007/bf00390110openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1016/0095-8956(86)90042-0openalex-snapshot
Intersection graphs of paths in a tree
inferredcites →https://doi.org/10.1016/0095-8956(91)90091-wopenalex-snapshot
String graphs. II. recognizing string graphs is NP-hard
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.v54:3openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_16openalex-snapshot
EPG-representations with Small Grid-Size
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_39openalex-snapshot
On the Bend-Number of Planar and Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_29openalex-snapshot
Approximation Algorithms for B 1-EPG Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_11openalex-snapshot
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_18openalex-snapshot
On Edge Intersection Graphs of Paths with 2 Bends
inferred← citeshttps://doi.org/10.1007/s00373-012-1133-7openalex-snapshot
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.035openalex-snapshot
Edge-intersection graphs of grid paths: The bend-number
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.020openalex-snapshot
Characterizations of cographs as intersection graphs of paths on a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.024openalex-snapshot
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.004openalex-snapshot
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.014openalex-snapshot
Edge-intersection graphs of boundary-generated paths in a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.004openalex-snapshot
Hardness and approximation for L-EPG and B1 -EPG graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.11.018openalex-snapshot
CPG graphs: Some structural and hardness results
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.005openalex-snapshot
Some properties of edge intersection graphs of single-bend paths on a grid
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.025openalex-snapshot
String graphs of k-bend paths on a grid
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.042openalex-snapshot
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.004openalex-snapshot
Graphs of edge-intersecting and non-splitting paths
inferred← citeshttps://doi.org/10.1201/9780429280092-11openalex-snapshot
Edge Intersection Graphs of Paths on a Grid
inferred← citeshttps://doi.org/10.20873/uft.2447-4266.2023v9n1a25ptopenalex-snapshot
K-SUN BELONGS TO HELLY B2-EPG
inferred← citeshttps://doi.org/10.23638/dmtcs-19-1-13openalex-snapshot
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-2openalex-snapshot
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2861openalex-snapshot
Edge-intersection graphs of grid paths: the bend-number
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3353openalex-snapshot
On the bend-number of planar and outerplanar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.2898openalex-snapshot
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05633openalex-snapshot
Approximation Algorithms for Independence and Domination on B$_1$-VPG and B$_1$-EPG Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09749openalex-snapshot
EPG-representations with small grid-size
inferred← citeshttps://doi.org/10.48550/arxiv.1901.06292openalex-snapshot
Edge intersection hypergraphs - a new hypergraph concept
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00396openalex-snapshot
Cycles as edge intersection hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.05639openalex-snapshot
Nearly all cacti are edge intersection hypergraphs of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.05312openalex-snapshot
B1-EPG representations using block-cutpoint trees
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.