On the public citation graph
A Survey on Graph Drawing Beyond Planarity
0 signed · 233 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.21630openalex-snapshot
Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing
inferredcites →https://doi.org/10.1002/jgt.3190120306openalex-snapshot
Rectilinear drawings of graphs
inferredcites →https://doi.org/10.1006/eujc.2002.0582openalex-snapshot
On Line Arrangements in the Hyperbolic Plane
inferredcites →https://doi.org/10.1007/3-540-44969-8openalex-snapshot
Drawing graphs: methods and models
inferredcites →https://doi.org/10.1007/978-3-319-03841-4_8openalex-snapshot
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-319-21840-3_25openalex-snapshot
Straight-Line Drawability of a Planar Graph Plus an Edge
inferredcites →https://doi.org/10.1007/978-3-319-50106-2_22openalex-snapshot
Ortho-Polygon Visibility Representations of Embedded Graphs
inferredcites →https://doi.org/10.1007/978-3-319-50106-2_25openalex-snapshot
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
inferredcites →https://doi.org/10.1007/978-3-319-73915-1_37openalex-snapshot
NodeTrix Planarity Testing with Small Clusters
inferredcites →https://doi.org/10.1007/978-3-642-18469-7_40openalex-snapshot
Large Crossing Angles in Circular Layouts
inferredcites →https://doi.org/10.1007/978-3-642-28076-4_19openalex-snapshot
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
inferredcites →https://doi.org/10.1007/978-3-642-30347-0_7openalex-snapshot
Mad at Edge Crossings? Break the Edges!
inferredcites →https://doi.org/10.1007/978-3-642-32241-9_29openalex-snapshot
Fáry’s Theorem for 1-Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-34191-5_19openalex-snapshot
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
inferredcites →https://doi.org/10.1007/978-3-642-34611-8_12openalex-snapshot
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
inferredcites →https://doi.org/10.1007/978-3-642-36763-2_29openalex-snapshot
On the Density of Maximal 1-Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-36763-2_50openalex-snapshot
On Sparse Maximal 2-Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_12openalex-snapshot
A Turán-type Extremal Theory of Convex Geometric Graphs
inferredcites →https://doi.org/10.1007/978-3-662-53174-7_29openalex-snapshot
Testing Full Outer-2-planarity in Linear Time
inferredcites →https://doi.org/10.1007/bf01187020openalex-snapshot
Edge crossings in drawings of bipartite graphs
inferredcites →https://doi.org/10.1007/bf01202354openalex-snapshot
Hadwiger's conjecture forK 6-free graphs
inferredcites →https://doi.org/10.1007/bf01215922openalex-snapshot
Graphs drawn with few crossings per edge
inferredcites →https://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187731openalex-snapshot
Disjoint edges in geometric graphs
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferredcites →https://doi.org/10.1007/bf02941309openalex-snapshot
Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
inferredcites →https://doi.org/10.1007/pl00007258openalex-snapshot
Embedding Planar Graphs at Fixed Vertex Locations
inferredcites →https://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferredcites →https://doi.org/10.1007/s00224-010-9275-6openalex-snapshot
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
inferredcites →https://doi.org/10.1007/s00373-005-0616-1openalex-snapshot
Topological Graphs with No Large Grids
inferredcites →https://doi.org/10.1007/s00453-004-1106-1openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
inferredcites →https://doi.org/10.1007/s00453-004-1128-8openalex-snapshot
Inserting an Edge into a Planar Graph
inferredcites →https://doi.org/10.1007/s00453-007-0010-xopenalex-snapshot
Algorithms for Graphs Embeddable with Few Crossings per Edge
inferredcites →https://doi.org/10.1007/s00453-012-9706-7openalex-snapshot
2-Layer Right Angle Crossing Drawings
inferredcites →https://doi.org/10.1007/s00453-014-9890-8openalex-snapshot
A Linear-Time Algorithm for Testing Outer-1-Planarity
inferredcites →https://doi.org/10.1007/s00453-014-9935-zopenalex-snapshot
On the Number of Edges of Fan-Crossing Free Graphs
inferredcites →https://doi.org/10.1007/s00453-016-0200-5openalex-snapshot
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
inferredcites →https://doi.org/10.1007/s00453-016-0203-2openalex-snapshot
The Book Thickness of 1-Planar Graphs is Constant
inferredcites →https://doi.org/10.1007/s00453-016-0226-8openalex-snapshot
Recognizing Optimal 1-Planar Graphs in Linear Time
inferredcites →https://doi.org/10.1007/s004530010020openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families
inferredcites →https://doi.org/10.1007/s00454-017-9939-yopenalex-snapshot
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
inferredcites →https://doi.org/10.1007/s00779-011-0473-2openalex-snapshot
Establishing aesthetics based on human graph reading behavior: two eye tracking studies
inferredcites →https://doi.org/10.1007/s10958-014-1690-9openalex-snapshot
An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/0022-0000(89)90032-9openalex-snapshot
Embedding planar graphs in four pages
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/0095-8956(92)90003-gopenalex-snapshot
A turán-type theorem on chords of a convex polygon
inferredcites →https://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferredcites →https://doi.org/10.1016/j.comgeo.2004.06.001openalex-snapshot
Grid drawings of k-colourable graphs
inferredcites →https://doi.org/10.1016/j.comgeo.2006.05.006openalex-snapshot
On simultaneous planar graph embeddings
inferredcites →https://doi.org/10.1016/j.comgeo.2008.05.005openalex-snapshot
Edges and switches, tunnels and bridges
inferredcites →https://doi.org/10.1016/j.comgeo.2011.11.008openalex-snapshot
Graphs that admit right angle crossing drawings
inferredcites →https://doi.org/10.1016/j.comgeo.2013.03.001openalex-snapshot
Area requirement of graph drawings with few crossings per edge
inferredcites →https://doi.org/10.1016/j.comgeo.2014.02.003openalex-snapshot
On grids in topological graphs
inferredcites →https://doi.org/10.1016/j.comgeo.2014.08.001openalex-snapshot
Relaxing the constraints of clustered planarity
inferredcites →https://doi.org/10.1016/j.comgeo.2015.06.001openalex-snapshot
New bounds on the maximum number of edges in k-quasi-planar graphs
inferredcites →https://doi.org/10.1016/j.cosrev.2017.06.002openalex-snapshot
An annotated bibliography on 1-planarity
inferredcites →https://doi.org/10.1016/j.dam.2012.11.019openalex-snapshot
Right angle crossing graphs and 1-planarity
inferredcites →https://doi.org/10.1016/j.disc.2009.07.016openalex-snapshot
Optimal 1-planar graphs which triangulate other surfaces
inferredcites →https://doi.org/10.1016/j.disc.2014.05.001openalex-snapshot
Convex geometric (k+2) -quasiplanar representations of semi-bar k -visibility graphs
inferredcites →https://doi.org/10.1016/j.ejc.2003.09.019openalex-snapshot
Geometric graphs with no self-intersecting path of length three
inferredcites →https://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferredcites →https://doi.org/10.1016/j.ejc.2017.07.009openalex-snapshot
1 -page and 2 -page drawings with bounded number of crossings per edge
inferredcites →https://doi.org/10.1016/j.ins.2008.11.017openalex-snapshot
A layout algorithm for undirected compound graphs
inferredcites →https://doi.org/10.1016/j.ins.2013.09.048openalex-snapshot
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis
inferredcites →https://doi.org/10.1016/j.ipl.2010.05.023openalex-snapshot
A characterization of complete bipartite RAC graphs
inferredcites →https://doi.org/10.1016/j.ipl.2013.01.013openalex-snapshot
Density of straight-line 1-planar graph drawings
inferredcites →https://doi.org/10.1016/j.ipl.2015.11.011openalex-snapshot
L-visibility drawings of IC-planar graphs
inferredcites →https://doi.org/10.1016/j.ipl.2018.06.006openalex-snapshot
On fan-crossing and fan-crossing free graphs
inferredcites →https://doi.org/10.1016/j.jcta.2006.08.002openalex-snapshot
On the maximum number of edges in quasi-planar graphs
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferredcites →https://doi.org/10.1016/j.jvlc.2011.12.002openalex-snapshot
Improving multiple aesthetics produces better graph drawings
inferredcites →https://doi.org/10.1016/j.jvlc.2014.03.001openalex-snapshot
Larger crossing angles make graphs easier to read
inferredcites →https://doi.org/10.1016/j.jvlc.2014.05.001openalex-snapshot
Techniques for Edge Stratification of Complex Graph Drawings
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.025openalex-snapshot
Drawing graphs with right angle crossings
inferredcites →https://doi.org/10.1016/j.tcs.2014.01.015openalex-snapshot
Upward and quasi-upward planarity testing of embedded mixed graphs
inferredcites →https://doi.org/10.1016/j.tcs.2015.04.020openalex-snapshot
Fan-planarity: Properties and complexity
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.026openalex-snapshot
Recognizing and drawing IC-planar graphs
inferredcites →https://doi.org/10.1016/j.tcs.2016.05.017openalex-snapshot
Circular right-angle crossing drawings in linear time
inferredcites →https://doi.org/10.1016/j.tcs.2016.06.045openalex-snapshot
Simultaneous visibility representations of plane st-graphs using L-shapes
inferredcites →https://doi.org/10.1016/j.tcs.2016.12.004openalex-snapshot
On partitioning the edges of 1-plane graphs
inferredcites →https://doi.org/10.1016/j.tcs.2017.05.039openalex-snapshot
On RAC drawings of 1-planar graphs
inferredcites →https://doi.org/10.1016/j.tcs.2017.12.024openalex-snapshot
New results on edge partitions of 1-plane graphs
inferredcites →https://doi.org/10.1016/j.tcs.2018.03.005openalex-snapshot
1-Fan-bundle-planar drawings of graphs
inferredcites →https://doi.org/10.1016/s0304-3975(99)00199-1openalex-snapshot
A generalization of diagonal flips in a convex polygon
inferredcites →https://doi.org/10.1016/s0953-5438(00)00032-1openalex-snapshot
Effective information visualisation: a study of graph drawing aesthetics and algorithms
inferredcites →https://doi.org/10.1023/a:1016344215610openalex-snapshot
Empirical Evaluation of Aesthetics-based Graph Layout
inferredcites →https://doi.org/10.1049/piee.1968.0004openalex-snapshot
Permutation procedure for minimising the number of crossings in a network
inferredcites →https://doi.org/10.1057/palgrave.ivs.9500013openalex-snapshot
Cognitive Measurements of Graph Aesthetics
inferredcites →https://doi.org/10.1093/comjnl/bxs088openalex-snapshot
Maximizing the Total Resolution of Graphs
inferredcites →https://doi.org/10.1093/comjnl/bxu017openalex-snapshot
Heuristics for the Maximum 2-Layer RAC Subgraph Problem
inferredcites →https://doi.org/10.1093/comjnl/bxv048openalex-snapshot
Planar and Quasi-Planar Simultaneous Geometric Embedding
inferredcites →https://doi.org/10.1093/comjnl/bxw075openalex-snapshot
Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs
inferredcites →https://doi.org/10.1109/apvis.2007.329282openalex-snapshot
Using eye tracking to investigate graph layout effects
inferredcites →https://doi.org/10.1109/focs.2009.45openalex-snapshot
Planarity Allowing Few Error Vertices in Linear Time
inferredcites →https://doi.org/10.1109/iisa.2015.7387994openalex-snapshot
A practical approach for 1/4-SHPEDs
inferredcites →https://doi.org/10.1109/iisa.2016.7785427openalex-snapshot
Partial edge drawing: Homogeneity is more important than crossings and ink
inferredcites →https://doi.org/10.1109/iv.2007.65openalex-snapshot
How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm
inferredcites →https://doi.org/10.1109/pacificvis.2008.4475457openalex-snapshot
Effects of Crossing Angles
inferredcites →https://doi.org/10.1109/sfcs.1991.185452openalex-snapshot
Computing planar intertwines
inferredcites →https://doi.org/10.1109/tsmc.1980.4308390openalex-snapshot
Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1109/tst.2013.6509098openalex-snapshot
Edge bundling in information visualization
inferredcites →https://doi.org/10.1109/tvcg.2006.147openalex-snapshot
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
inferredcites →https://doi.org/10.1109/tvcg.2007.70582openalex-snapshot
NodeTrix: a Hybrid Visualization of Social Networks
inferredcites →https://doi.org/10.1109/tvcg.2010.265openalex-snapshot
Visual Analysis of Large Graphs Using (X,Y)-Clustering and Hybrid Visualizations
inferredcites →https://doi.org/10.1111/j.1467-8659.2009.01450.xopenalex-snapshot
Force‐Directed Edge Bundling for Graph Visualization
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22429.xopenalex-snapshot
Disjoint Simplices and Geometric Hypergraphs
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1137/100819564openalex-snapshot
Graphs That Admit Polyline Drawings with Few Crossing Angles
inferredcites →https://doi.org/10.1137/110858586openalex-snapshot
The Number of Edges in $k$-Quasi-planar Graphs
inferredcites →https://doi.org/10.1137/120872310openalex-snapshot
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
inferredcites →https://doi.org/10.1137/16m1062879openalex-snapshot
Structure of Graphs with Locally Restricted Crossings
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferredcites →https://doi.org/10.1137/s1052623498334013openalex-snapshot
An Alternative Method to Crossing Minimization on Hierarchical Graphs
inferredcites →https://doi.org/10.1142/s0218195907002276openalex-snapshot
SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
inferredcites →https://doi.org/10.1142/s021819591250015xopenalex-snapshot
EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
inferredcites →https://doi.org/10.1145/1250790.1250848openalex-snapshot
Computing crossing number in linear time
inferredcites →https://doi.org/10.1145/323233.323253openalex-snapshot
Characterizing bar line-of-sight graphs
inferredcites →https://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferredcites →https://doi.org/10.1145/777792.777807openalex-snapshot
Topological graphs with no self-intersecting cycle of length 4
inferredcites →https://doi.org/10.1145/800249.807437openalex-snapshot
The haloed line effect for hidden line elimination.
inferredcites →https://doi.org/10.2298/fil1702363copenalex-snapshot
Drawing graph joins in the plane with restrictions on crossings
inferredcites →https://doi.org/10.2478/s11533-012-0094-7openalex-snapshot
The structure of plane graphs with independent crossings and its applications to coloring problems
inferredcites →https://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferredcites →https://doi.org/10.5555/10665.10670openalex-snapshot
A Layout algorithm for data flow diagrams
inferredcites →https://doi.org/10.5555/1496770.1496812openalex-snapshot
Inserting a vertex into a planar graph
inferredcites →https://doi.org/10.7155/jgaa.00046openalex-snapshot
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
inferredcites →https://doi.org/10.7155/jgaa.00099openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
inferredcites →https://doi.org/10.7155/jgaa.00217openalex-snapshot
On the Perspectives Opened by Right Angle Crossing Drawings
inferredcites →https://doi.org/10.7155/jgaa.00224openalex-snapshot
A Graph Drawing Application to Web Site Traffic Analysis
inferredcites →https://doi.org/10.7155/jgaa.00250openalex-snapshot
On a Tree and a Path with no Geometric Simultaneous Embedding
inferredcites →https://doi.org/10.7155/jgaa.00274openalex-snapshot
The Straight-Line RAC Drawing Problem is NP-Hard
inferredcites →https://doi.org/10.7155/jgaa.00282openalex-snapshot
Geometric RAC Simultaneous Drawings of Graphs
inferredcites →https://doi.org/10.7155/jgaa.00316openalex-snapshot
1-Bend Orthogonal Partial Edge Drawing
inferredcites →https://doi.org/10.7155/jgaa.00330openalex-snapshot
1-Visibility Representations of 1-Planar Graphs
inferredcites →https://doi.org/10.7155/jgaa.00343openalex-snapshot
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
inferredcites →https://doi.org/10.7155/jgaa.00347openalex-snapshot
1-Planarity of Graphs with a Rotation System
inferredcites →https://doi.org/10.7155/jgaa.00376openalex-snapshot
Drawing Outer 1-planar Graphs with Few Slopes
inferredcites →https://doi.org/10.7155/jgaa.00388openalex-snapshot
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
inferredcites →https://doi.org/10.7155/jgaa.00398openalex-snapshot
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
inferredcites →https://doi.org/10.7155/jgaa.00453openalex-snapshot
On the size of planarly connected crossing graphs
inferredcites →https://doi.org/10.7155/jgaa.00454openalex-snapshot
Stack and Queue Layouts via Layered Separators
inferredcites →https://doi.org/10.7155/jgaa.00455openalex-snapshot
A First Order Logic Definition of Beyond-Planar Graphs
inferredcites →https://doi.org/10.7155/jgaa.00456openalex-snapshot
On the NP-hardness of GRacSim drawing and k-SEFE Problems
inferredcites →https://doi.org/10.7155/jgaa.00457openalex-snapshot
Parameterized Complexity of 1-Planarity
inferredcites →https://doi.org/10.7155/jgaa.00461openalex-snapshot
Computing NodeTrix Representations of Clustered Graphs
inferredcites →https://doi.org/10.7155/jgaa.00466openalex-snapshot
Recognizing IC-Planar and NIC-Planar Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4969841openalex-extracted
On 1-Planar Graphs with Bounded Cop-Number
inferred← citeshttps://doi.org/10.1002/jgt.23097openalex-snapshot
Edge-Minimum Saturated k-Planar Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_11openalex-snapshot
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_20openalex-snapshot
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_6openalex-snapshot
Crossing Numbers of Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_7openalex-snapshot
On the 2-Colored Crossing Number
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_15openalex-snapshot
The Stub Resolution of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_28openalex-snapshot
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_8openalex-snapshot
Packing Trees into 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_15openalex-snapshot
A Tipping Point for the Planarity of Small and Medium Sized Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_21openalex-snapshot
On Morphing 1-Planar Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_21openalex-snapshot
Optimal-Area Visibility Representations of Outer-1-Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_4openalex-snapshot
Simplifying Non-simple Fan-Planar Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_5openalex-snapshot
$$\mathrm {RAC}$$-Drawability is $$\exists \mathbb {R}$$-Complete
inferred← citeshttps://doi.org/10.1007/978-3-031-20650-4_3openalex-snapshot
Minimizing Cross Intersections in Graph Drawing via Linear Splines
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_18openalex-snapshot
The Thickness of Fan-Planar Graphs is At Most Three
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_22openalex-snapshot
On the Complexity of the Storyplan Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_2openalex-snapshot
The Family of Fan-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_7openalex-snapshot
Nonplanar Graph Drawings with k Vertices per Face
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_3openalex-snapshot
Min-k-planar Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_4openalex-snapshot
Weakly and Strongly Fan-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_5openalex-snapshot
On RAC Drawings of Graphs with Two Bends per Edge
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_1openalex-snapshot
Cops and Robbers on 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_5openalex-snapshot
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_11openalex-snapshot
Convex-Geometric k-Planar Graphs Are Convex-Geometric $$(k+1)$$-Quasiplanar
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_1openalex-snapshot
Beyond Planar Graphs: Introduction
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_6openalex-snapshot
Edge Partitions and Visibility Representations of 1-planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_1openalex-snapshot
Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_3openalex-snapshot
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
inferred← citeshttps://doi.org/10.1007/s00521-024-10673-6openalex-snapshot
Robust 3D point clouds classification based on declarative defenders
inferred← citeshttps://doi.org/10.1007/s44267-023-00007-wopenalex-snapshot
Large graph layout optimization based on vision and computational efficiency: a survey
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101900openalex-snapshot
1-planarity testing and embedding: An experimental study
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102255openalex-snapshot
Optimal right angles crossing graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2022.100490openalex-snapshot
Parameterized analysis and crossing minimization problems
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103654openalex-snapshot
Counting cliques in 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106083openalex-snapshot
Testing gap k-planarity is NP-complete
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.006openalex-snapshot
Simple k-planar graphs are simple (k + 1)-quasiplanar
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.029openalex-snapshot
On 3D visibility representations of graphs with few crossings per edge
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.016openalex-snapshot
Polyline drawings with topological constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.018openalex-snapshot
On RAC drawings of graphs with one bend per edge
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.027openalex-snapshot
On the curve complexity of 3-colored point-set embeddings
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.018openalex-snapshot
Ortho-polygon visibility representations of 3-connected 1-plane graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218459openalex-snapshot
An annotated review on graph drawing and its applications
inferred← citeshttps://doi.org/10.1080/09728600.2025.2585816openalex-snapshot
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
inferred← citeshttps://doi.org/10.1093/comjnl/bxad038openalex-snapshot
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
inferred← citeshttps://doi.org/10.1109/access.2024.3401078openalex-snapshot
Graphs Drawn With Some Vertices per Face: Density and Relationships
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00016openalex-snapshot
Towards Better Approximation of Graph Crossing Number
inferred← citeshttps://doi.org/10.1109/mcg.2023.3264244openalex-snapshot
Splitting Vertices in 2-Layer Graph Drawings
inferred← citeshttps://doi.org/10.1109/pacificvis68791.2026.00008openalex-snapshot
Impact Factors for Crossing Perception in Stereoscopic 3D
inferred← citeshttps://doi.org/10.1109/syscon61195.2024.10553494openalex-snapshot
A Many-objective Evolutionary Algorithm Approach for Graph Visualization
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3184967openalex-snapshot
Graph Neural Networks for Graph Drawing
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3114756openalex-snapshot
STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations
inferred← citeshttps://doi.org/10.1109/tvcg.2024.3456394openalex-snapshot
2D Embeddings of Multi-Dimensional Partitionings
inferred← citeshttps://doi.org/10.1109/vis54172.2023.00043openalex-snapshot
A Simple yet Useful Spiral Visualization of Large Graphs
inferred← citeshttps://doi.org/10.1111/cgf.70436openalex-snapshot
Do Graph Drawing Aesthetics Matter for AI? A Replication of Foundational Studies in Graph Readability
inferred← citeshttps://doi.org/10.1515/9783111633909-003openalex-snapshot
51Chapter 3 Computational Foundations of Scalable RL: Reinforcement Learning in the Era of Big Compute and Big Data
inferred← citeshttps://doi.org/10.54337/jovi.v1i1.11236openalex-snapshot
GLaDOS: Graph Layout algorithm Datasets for Open Science
inferred← citeshttps://doi.org/10.5802/igt.4openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
inferred← citeshttps://doi.org/10.7717/peerj-cs.357openalex-snapshot
Survey on graph embeddings and their applications to machine learning problems on 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.