On the public citation graph
Graphs drawn with few crossings per edge
0 signed · 282 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.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1017/s0963548397002976openalex-snapshot
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
inferredcites →https://doi.org/10.1017/s0963548397003192openalex-snapshot
On the Number of Incidences Between Points and Curves
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21665openalex-snapshot
Using block designs in crossing number bounds
inferred← citeshttps://doi.org/10.1002/jgt.20090openalex-snapshot
An improvement of the crossing number bound
inferred← citeshttps://doi.org/10.1002/jgt.20435openalex-snapshot
Crossing numbers of imbalanced graphs
inferred← citeshttps://doi.org/10.1002/jgt.22187openalex-snapshot
Improvements on the density of maximal 1‐planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.22542openalex-snapshot
Long cycles and spanning subgraphs of locally maximal 1‐planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.23097openalex-snapshot
Edge-Minimum Saturated k-Planar Drawings
inferred← citeshttps://doi.org/10.1002/jgt.23273openalex-snapshot
Spanning Plane Subgraphs of 1‐Plane Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1978openalex-snapshot
Which Crossing Number Is It Anyway?
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_8openalex-snapshot
Incidence and Arrangement Problems
inferred← citeshttps://doi.org/10.1007/11537311_33openalex-snapshot
Algorithms for Graphs Embeddable with Few Crossings Per Edge
inferred← citeshttps://doi.org/10.1007/11589440_19openalex-snapshot
Crossing Stars in Topological Graphs
inferred← citeshttps://doi.org/10.1007/11682462_54openalex-snapshot
I/O-Efficient Algorithms on Near-Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_28openalex-snapshot
Geometric Graphs with No Self-intersecting Path of Length Three
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_29openalex-snapshot
Structure Theorems for Systems of Segments
inferred← citeshttps://doi.org/10.1007/978-1-4471-2804-5_7openalex-snapshot
How to Draw a Graph, Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_10openalex-snapshot
The Crossing-Angle Resolution in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_29openalex-snapshot
Construction of Locally Plane Graphs with Many Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_3openalex-snapshot
Edge Partitions of Optimal 2-plane and 3-plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_5openalex-snapshot
Turning Cliques into Paths to Achieve Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_9openalex-snapshot
On RAC Drawings of Graphs with One Bend per Edge
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_12openalex-snapshot
(k, p)-Planarity: A Relaxation of Hybrid Planarity
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-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-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-92931-2_4openalex-snapshot
Simplifying Non-simple Fan-Planar Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_6openalex-snapshot
Recognizing and Embedding Simple Optimal 2-Planar Graphs
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-47417-0_12openalex-snapshot
Treewidth, Circle Graphs and Circular Drawings
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-63021-7_39openalex-snapshot
Efficient Computation of Crossing Components and Shortcut Hulls
inferred← citeshttps://doi.org/10.1007/978-3-031-96118-2_3openalex-snapshot
On the Number of Crossings in a Random Labeled Tree
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_35openalex-snapshot
Improved Bounds on Proper Conflict-Free Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_10openalex-snapshot
Recognizing Outer 1-Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_26openalex-snapshot
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_7openalex-snapshot
A Linear-Time Algorithm for Testing Outer-1-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_8openalex-snapshot
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-04126-1_6openalex-snapshot
Bar 1-Visibility Drawings of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_22openalex-snapshot
On Bar (1,j)-Visibility Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_23openalex-snapshot
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_25openalex-snapshot
Recognizing and Drawing IC-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_24openalex-snapshot
On the Size of Planarly Connected Crossing Graphs
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_26openalex-snapshot
1-Bend RAC Drawings of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_27openalex-snapshot
On the Density of Non-simple 3-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_39openalex-snapshot
Stack and Queue Layouts via Layered Separators
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_3openalex-snapshot
A PTAS for the Cluster Editing Problem on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_5openalex-snapshot
On the Relationship Between k-Planar and k-Quasi-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_39openalex-snapshot
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_40openalex-snapshot
1-Fan-Bundle-Planar Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_9openalex-snapshot
3D Visibility Representations of 1-planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_12openalex-snapshot
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_8openalex-snapshot
Progress on Crossing Number Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_4openalex-snapshot
Biplanar Crossing Numbers I: A Survey of Results and Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_15openalex-snapshot
Right Angle Crossing Graphs and 1-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_7openalex-snapshot
Mad at Edge Crossings? Break the Edges!
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_29openalex-snapshot
Fáry’s Theorem for 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_12openalex-snapshot
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_29openalex-snapshot
On the Density of Maximal 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_30openalex-snapshot
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_7openalex-snapshot
Progress on Partial Edge Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_9openalex-snapshot
Parameterized Complexity of 1-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_16openalex-snapshot
On the Number of Edges of Fan-Crossing Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_4openalex-snapshot
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_15openalex-snapshot
Drawing Outer 1-planar Graphs with Few Slopes
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_16openalex-snapshot
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_17openalex-snapshot
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_19openalex-snapshot
A Crossing Lemma for the Pair-Crossing Number
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_29openalex-snapshot
Testing Full Outer-2-planarity in Linear Time
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_2openalex-snapshot
Quantitative Restrictions on Crossing Patterns
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_5openalex-snapshot
Algorithms for 1-Planar Graphs
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-15-6533-5_7openalex-snapshot
$$\textit{\textbf{k}}$$-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_9openalex-snapshot
Right Angle Crossing Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/pl00009365openalex-snapshot
Extremal Problems for Geometric Hypergraphs
inferred← citeshttps://doi.org/10.1007/pl00009388openalex-snapshot
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
inferred← citeshttps://doi.org/10.1007/s00373-005-0616-1openalex-snapshot
Topological Graphs with No Large Grids
inferred← citeshttps://doi.org/10.1007/s00373-021-02320-xopenalex-snapshot
The Maximal 1-Planarity and Crossing Numbers of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02538-3openalex-snapshot
The Crossing Number of Twisted Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02733-wopenalex-snapshot
Weak-Dynamic Coloring of Graphs Beyond-Planarity
inferred← citeshttps://doi.org/10.1007/s00373-024-02820-6openalex-snapshot
The Vertex Arboricity of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/s003730200063openalex-snapshot
Isosceles Triangles Determined by a Planar Point Set
inferred← citeshttps://doi.org/10.1007/s00453-007-0010-xopenalex-snapshot
Algorithms for Graphs Embeddable with Few Crossings per Edge
inferred← citeshttps://doi.org/10.1007/s00453-014-9890-8openalex-snapshot
A Linear-Time Algorithm for Testing Outer-1-Planarity
inferred← citeshttps://doi.org/10.1007/s00453-014-9935-zopenalex-snapshot
On the Number of Edges of Fan-Crossing Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0200-5openalex-snapshot
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0203-2openalex-snapshot
The Book Thickness of 1-Planar Graphs is Constant
inferred← citeshttps://doi.org/10.1007/s00453-016-0226-8openalex-snapshot
Recognizing Optimal 1-Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-025-01355-3openalex-snapshot
On computing vertex connectivity of 1-planar graphs
inferred← citeshttps://doi.org/10.1007/s00454-002-2896-zopenalex-snapshot
The k Most Frequent Distances in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-006-1264-9openalex-snapshot
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00454-009-9208-9openalex-snapshot
Iterated Point–Line Configurations Grow Doubly-Exponentially
inferred← citeshttps://doi.org/10.1007/s00454-017-9919-2openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1007/s00454-017-9939-yopenalex-snapshot
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-018-9970-7openalex-snapshot
Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences
inferred← citeshttps://doi.org/10.1007/s00493-014-2686-2openalex-snapshot
The Szemerédi-Trotter theorem in the complex plane
inferred← citeshttps://doi.org/10.1007/s00493-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
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/s10958-014-1690-9openalex-snapshot
An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph
inferred← citeshttps://doi.org/10.1007/s10958-014-1693-6openalex-snapshot
A Bound on the Chromatic Number of an Almost Planar Graph
inferred← citeshttps://doi.org/10.1007/s10958-016-2702-8openalex-snapshot
On Graphs, Which Can be Drawn on an Orientable Surface with Small Number of Intersections on an Edge
inferred← citeshttps://doi.org/10.1007/s10958-021-05347-wopenalex-snapshot
On Plane Drawings of 2-Planar Graphs
inferred← citeshttps://doi.org/10.1007/s11401-025-0016-1openalex-snapshot
On the Pagenumber of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/s11464-022-1010-5openalex-snapshot
A survey on book-embedding of planar graphs
inferred← citeshttps://doi.org/10.1007/s40687-025-00552-4openalex-snapshot
Approximate incidence geometry in the plane
inferred← citeshttps://doi.org/10.1007/s40840-016-0389-0openalex-snapshot
Light Edges in 3-Connected 2-Planar Graphs With Prescribed Minimum Degree
inferred← citeshttps://doi.org/10.1016/j.amc.2019.01.002openalex-snapshot
Upper bound on the sum of powers of the degrees of graphs with few crossings per edge
inferred← citeshttps://doi.org/10.1016/j.amc.2019.06.051openalex-snapshot
Remarks on the joins of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.003openalex-snapshot
On crossing numbers of geometric proximity graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.03.001openalex-snapshot
Area requirement of graph drawings with few crossings per edge
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.07.002openalex-snapshot
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.10.002openalex-snapshot
On the edge crossing properties of Euclidean minimum weight Laman graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.015openalex-snapshot
Note on k-planar crossing numbers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101574openalex-snapshot
On topological graphs with at most four crossings per edge
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.2022.101901openalex-snapshot
Crossing lemma for the odd-crossing number
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102009openalex-snapshot
The constant of point–line incidence constructions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102036openalex-snapshot
Straight-line drawings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102255openalex-snapshot
Optimal right angles crossing graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2017.06.002openalex-snapshot
An annotated bibliography on 1-planarity
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.014openalex-snapshot
1-planarity of complete multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.001openalex-snapshot
An upper bound on the sum of powers of the degrees of simple 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.019openalex-snapshot
Right angle crossing graphs and 1-planarity
inferred← citeshttps://doi.org/10.1016/j.dam.2018.07.022openalex-snapshot
On quasi-planar graphs: Clique-width and logical description
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.018openalex-snapshot
A linear-time algorithm for testing full outer-2-planarity
inferred← citeshttps://doi.org/10.1016/j.dam.2019.04.012openalex-snapshot
Characterizing 5-map graphs by 2-fan-crossing graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.011openalex-snapshot
A note on odd colorings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.09.027openalex-snapshot
Nonrepetitive vertex colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.019openalex-snapshot
Proper 1-immersions of graphs triangulating the plane
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.034openalex-snapshot
Facial list colourings of plane graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.005openalex-snapshot
A note on the surviving rate of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.11.020openalex-snapshot
On the k -planar local crossing number
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112333openalex-snapshot
Dynamic list coloring of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112482openalex-snapshot
Planar graphs having no proper 2-immersions in the plane. I
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.006openalex-snapshot
A branch-and-cut approach to the crossing number problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.019openalex-snapshot
Geometric graphs with no self-intersecting path of length three
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.021openalex-snapshot
Cubicity, degeneracy, and crossing number
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104212openalex-snapshot
1-planar unit distance graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.01.013openalex-snapshot
Density of straight-line 1-planar graph drawings
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.08.002openalex-snapshot
On the maximum number of edges in quasi-planar graphs
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.jctb.2022.05.007openalex-snapshot
Crossings between non-homotopic edges
inferred← citeshttps://doi.org/10.1016/j.jvlc.2014.05.001openalex-snapshot
Techniques for Edge Stratification of Complex Graph Drawings
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.029openalex-snapshot
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.020openalex-snapshot
Fan-planarity: Properties and complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.026openalex-snapshot
Recognizing and drawing IC-planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.004openalex-snapshot
On partitioning the edges of 1-plane graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.039openalex-snapshot
On RAC drawings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.005openalex-snapshot
1-Fan-bundle-planar drawings of graphs
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.11.030openalex-snapshot
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.015openalex-snapshot
Re-embedding a 1-plane graph for a straight-line drawing in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.044openalex-snapshot
(k,p)-planarity: A relaxation of hybrid planarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115576openalex-snapshot
Drawing graphs with k vertices per face: Complexity and algorithms
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00317-0openalex-snapshot
A successful concept for measuring non-planarity of graphs: the crossing number
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00037-6openalex-snapshot
Crossing-number critical graphs have bounded path-width
inferred← citeshttps://doi.org/10.1017/s0004972713000063openalex-snapshot
ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS
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.1093/comjnl/bxv048openalex-snapshot
Planar and Quasi-Planar Simultaneous Geometric Embedding
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/iisa.2015.7387994openalex-snapshot
A practical approach for 1/4-SHPEDs
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743512openalex-snapshot
Which crossing number is it, anyway? [computational geometry]
inferred← citeshttps://doi.org/10.1137/050623693openalex-snapshot
Crossing Stars in Topological Graphs
inferred← citeshttps://doi.org/10.1137/050636036openalex-snapshot
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
inferred← citeshttps://doi.org/10.1137/050641375openalex-snapshot
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
inferred← citeshttps://doi.org/10.1137/120897493openalex-snapshot
On the General Position Subset Selection Problem
inferred← citeshttps://doi.org/10.1137/16m1062879openalex-snapshot
Structure of Graphs with Locally Restricted Crossings
inferred← citeshttps://doi.org/10.1137/20m138260xopenalex-snapshot
On Book Crossing Numbers of the Complete Graph
inferred← citeshttps://doi.org/10.1137/21m1459952openalex-snapshot
On the Size of Matchings in 1-Planar Graph with High Minimum Degree
showing the first 200 of 273 · page through all 273
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.