Algorithms for graphs embeddable with few crossings per edge
From MaRDI portal
Recommendations
- Fundamentals of Computation Theory
- Algorithms for the edge-width of an embedded graph
- Crossing minimization in linear embeddings of graphs
- An algorithm for the graph crossing number problem
- scientific article; zbMATH DE number 1301962
- Linear-time algorithms for geometric graphs with sublinearly many edge crossings
- Approximation algorithms for intersection graphs
- Approximation algorithms for intersection graphs
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Linear-time algorithms for geometric graphs with sublinearly many crossings
Cited in
(83)- On fan-crossing and fan-crossing free graphs
- Linear-time recognition of map graphs with outerplanar witness
- Recognizing optimal 1-planar graphs in linear time
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- A linear-time algorithm for testing full outer-2-planarity
- Characterizing and recognizing 4-map graphs
- Gap-planar graphs
- Testing gap \(k\)-planarity is NP-complete
- Planar graphs having no proper 2-immersions in the plane. I
- 1-planarity testing and embedding: an experimental study
- Counting cliques in 1-planar graphs
- The density of fan-planar graphs
- A survey on book-embedding of planar graphs
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- Parameterized analysis and crossing minimization problems
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Characterizing 5-map graphs by 2-fan-crossing graphs
- On 3D visibility representations of graphs with few crossings per edge
- Fan-planarity: properties and complexity
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- A fast algorithm for the product structure of planar graphs
- Bundled Crossings in Embedded Graphs
- Testing Full Outer-2-planarity in Linear Time
- A Note on the Minimum H-Subgraph Edge Deletion
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- On the density of non-simple 3-planar graphs
- scientific article; zbMATH DE number 3646924 (Why is no real title available?)
- scientific article; zbMATH DE number 5657421 (Why is no real title available?)
- Recognizing IC-planar and NIC-planar graphs
- 3D Visibility Representations of 1-planar Graphs
- Gap-Planar Graphs
- A linear-time algorithm for testing outer-1-planarity
- Beyond planar graphs: introduction
- Quantitative restrictions on crossing patterns
- 1-Planar Graphs
- Algorithms for 1-Planar Graphs
- Edge Partitions and Visibility Representations of 1-planar Graphs
- \(k\)-planar graphs
- Fan-planar graphs
- On partitioning the edges of 1-plane graphs
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- Structure of graphs with locally restricted crossings
- Approximating the crossing number of graphs embeddable in any orientable surface
- Fundamentals of Computation Theory
- PTAS for Sparse General-valued CSPs
- All 2-planar graphs having the same spanning subgraph
- The family of fan-planar graphs
- Weak-dynamic coloring of graphs beyond-planarity
- Treewidth, Circle Graphs, and Circular Drawings
- Min-\(k\)-planar drawings of graphs
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Min-k-planar drawings of graphs
- Cops and robbers on 1-planar graphs
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Extending partial 1-planar drawings
- On computing vertex connectivity of 1-planar graphs
- Note on min-k-planar drawings of graphs
- Product structure of graph classes with strongly sublinear separators
- True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
- The lower bound of the number of non-crossed edges in local maximal 1-plane graphs
- The matching extendability of 7-connected maximal 1-plane graphs
- Exact and approximate k-planarity testing for maximal graphs of small pathwidth
- On the pagenumber of 1-planar graphs
- Powers of planar graphs, product structure, and blocking partitions
- Pliability and approximating Max-CSPs
- Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
- Clustered independence and bounded treewidth
- Recognizing 2-layer and outer k-planar graphs
- Complexity of (p, q)-bipartition of planar and 1-planar graphs
- A unified FPT framework for crossing number problems
- Heuristics for exact 1-planarity testing
- OOPS: optimized one-planarity solver via SAT
- Structural parameterizations of k-planarity
- Structural parameterizations of \(k\)-planarity
- Heuristics for exact 1-planarity testing
- OOPS: optimized one-planarity solver via SAT
- A dichotomy for 1-planarity with restricted crossing types parameterized by treewidth
- On the edge crossing properties of Euclidean minimum weight Laman graphs
This page was built for publication: Algorithms for graphs embeddable with few crossings per edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461632)
