Applications of the crossing number

No abstract is available for this paper.

• Publication year

  1994

• Venue

  SCG '94

• Publication date

  1994-06-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF02086610
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Forcing Disjoint Segments in the Plane

  1996cited by this paper
• Quasi-planar graphs have a linear number of edges

  1995cited by this paper
• Constructing piecewise linear homeomorphisms

  1994cited by this paper
• Some geometric applications of Dilworth's theorem

  1993cited by this paper
• On Compatible Triangulations of Simple Polygons

  1993cited by this paper
• A turán-type theorem on chords of a convex polygon

  1992cited by this paper
• Planar Separators and the Euclidean Norm

  1990cited by this paper
• Notes on Geometric Graph Theory

  1990cited by this paper
• Disjoint edges in geometric graphs

  1989cited by this paper
• Edge Separators for Planar Graphs and Their Applications

  1988cited by this paper
• Joint triangulations and triangulation maps

  1987cited by this paper
• Computational Aspects of VLSI

  1984cited by this paper
• Finding small simple cycle separators for 2-connected planar graphs.

  1984cited by this paper
• Complexity Issues in VLSI

  1983cited by this paper
• Extremal problems in combinatorial geometry

  1979cited by this paper
• A Separator Theorem for Planar Graphs

  1977cited by this paper
• On Sets of Distances of n Points

  1946cited by this paper

• On a conjecture of Pach-Spencer-T\'oth for graph crossing numbers

  2025influential citation
• Generalizations of the Crossing Lemma

  2025cites this paper
• A structure theorem for pseudosegments and its applications

  2025cites this paper
• Minimum Plane Bichromatic Spanning Trees

  2024cites this paper
• 1-Planar Unit Distance Graphs

  2023cites this paper
• Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes

  2023cites this paper
• A structure theorem for pseudo-segments and its applications

  2023cites this paper
• Rectilinear crossing number of the double circular complete bipartite graph

  2023cites this paper
• Pair Crossing Number, Cutwidth, and Good Drawings on Arbitrary Point Sets

  2022cites this paper
• -planar graphs simple ( k +

  2022cites this paper
• A note on the width of sparse random graphs

  2022influential citation
• Calculating Crossing Numbers of Graphs Using Combinatorial Principles

  2022cites this paper
• On the number of edges of separated multigraphs

  2021cites this paper
• On Compatible Matchings

  2021cites this paper
• Quasi-planar Graphs

  2020cites this paper
• Beyond Planar Graphs: Communications of NII Shonan Meetings

  2020cites this paper
• 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth

  2020cites this paper
• Quantitative Restrictions on Crossing Patterns

  2020cites this paper
• Compatible Paths on Labelled Point Sets

  2020cites this paper
• Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

  2019cites this paper
• Open Problems from CCCG 2017

  2018cites this paper
• Coloring Curves that Cross a Fixed Curve

  2018cites this paper
• A Survey on Graph Drawing Beyond Planarity

  2018cites this paper
• Tight Upper Bounds on the Crossing Number in a Minor-Closed Class

  2018cites this paper
• A Crossing Lemma for Multigraphs

  2018cites this paper
• Two-Planar Graphs Are Quasiplanar

  2017cites this paper
• On the Relationship between k-Planar and k-Quasi Planar Graphs

  2017cites this paper
• Orthogonal Tree Decompositions of Graphs

  2017cites this paper
• 10 GEOMETRIC GRAPH THEORY

  2017cites this paper
• K-planar Crossing Number of Random Graphs and Random Regular Graphs

  2017cites this paper
• On Compatible Triangulations with a Minimum Number of Steiner Points

  2017cites this paper
• Beyond-Planar Graphs : Algorithmics and Combinatorics

  2017cites this paper
• Beyond Outerplanarity

  2017cites this paper
• Edge complexity of geometric graphs on convex independent point sets

  2016cites this paper
• 10 GEOMETRIC GRAPH THEORY János Pach

  2016cites this paper
• On the Total Power Capacity of Regular-LDPC Codes With Iterative Message-Passing Decoders

  2015cites this paper
• Coloring Curves that Cross a Fixed Curve

  2015cites this paper
• Lecture Notes Geometric Graph Theory

  2015influential citation
• Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls

  2014cites this paper
• Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls

  2014cites this paper
• On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations

  2014cites this paper
• Geometric Intersection Patterns and the Theory of Topological Graphs 3 Using similar ideas

  2014cites this paper
• Bar 1-Visibility Graphs vs. other Nearly Planar Graphs

  2014cites this paper
• Triangle-Free Geometric Intersection Graphs with No Large Independent Sets

  2014cites this paper
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs

  2013cites this paper
• On the Number of Edges of Fan-Crossing Free Graphs

  2013cites this paper
• Outerstring graphs are χ-bounded

  2013cites this paper
• The Beginnings of Geometric Graph Theory

  2013cites this paper
• Crossings and Planarization

  2013cites this paper
• New bounds on the maximum number of edges in k-quasi-planar graphs

  2013cites this paper
• Drawings of Non-planar Graphs with Crossing-free Subgraphs

  2013cites this paper
• Improved Bounds on the Crossing Number of Butterfly Network

  2013cites this paper
• Improved Bounds on the Crossing Number of Butter y Network

  2013cites this paper
• 2 Crossings and Planarization

  2013cites this paper
• Geometric graphs on convex point sets

  2013cites this paper
• Planar Crossing Numbers of Graphs of Bounded Genus

  2012cites this paper
• On the light side of geometric graphs

  2012cites this paper
• The Number of Edges in k-Quasi-planar Graphs

  2011cites this paper
• Space crossing numbers

  2011cites this paper
• BiCross : A Biclustering Technique for Gene Expression Data using One Layer Fixed Weighted Bipartite Graph Crossing Minimization

  2011cites this paper
• BiFree : An Efficient Biclustering Technique for Gene Expression Data Using Two Layer Free Weighted Bipartite Graph Crossing Minimization

  2011cites this paper
• $k$-quasi Planar Graphs

  2011cites this paper
• VIRTUAL CROSSING NUMBERS FOR VIRTUAL KNOTS

  2011cites this paper
• On disjoint crossing families in geometric graphs

  2010cites this paper
• Simultaneously Embedding Planar Graphs at Fixed Vertex Locations

  2010cites this paper
• General Lower Bounds for the Minor Crossing Number of Graphs

  2010cites this paper
• On grids in topological graphs

  2009cites this paper
• A Separator Theorem for String Graphs and its Applications

  2009cites this paper
• Parameterized algorithmics for linear arrangement problems

  2008cites this paper
• Crossing numbers

  2008cites this paper
• Overlapping Matrix Pattern Visualization: A Hypergraph Approach

  2008cites this paper
• Improved upper bounds on the crossing number

  2008cites this paper
• Coloring kk-free intersection graphs of geometric objects in the plane

  2008cites this paper
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

  2008cites this paper
• Mathematisches Forschungsinstitut Oberwolfach Discrete Geometry

  2008influential citation
• Eigenvalues of Euclidean random matrices

  2008cites this paper
• Covering Planar Graphs with a Fixed Number of Balls

  2007cites this paper
• A bipartite strengthening of the Crossing Lemma

  2007cites this paper
• Moments of graphs in monotone families

  2006influential citation
• On the decay of crossing numbers

  2006cites this paper
• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

  2006cites this paper
• The Minor Crossing Number of Graphs with an Excluded Minor

  2006cites this paper
• Biplanar Crossing Numbers I: A Survey of Results and Problems

  2006cites this paper
• Planar Crossing Numbers of Genus g Graphs

  2006cites this paper
• On the Crossing Number of Complete Graphs: Growing Minimal Kn From Minimal Kn 1

  2006cites this paper
• Ramsey unsaturated and saturated graphs

  2006cites this paper
• Multilayer Grid Embeddings of Iterated Line Digraphs

  2006cites this paper
• Degenerate Crossing Numbers

  2006cites this paper
• Solving the Minimum Crossing Number Problem Using an Improved Artificial Neural Network

  2005cites this paper
• Author Proof A Moments of Graphs in Monotone Families

  2005cites this paper
• A Hybrid Genetic Algorithm for the Minimum Linear Arrangement Problem A Master ’ s Paper in Computer Science

  2005cites this paper
• Crossing Stars in Topological Graphs

  2004cites this paper
• 2 Crossings and Planarization

  2004cites this paper
• Crossing number, pair-crossing number, and expansion

  2004cites this paper
• Selected Open Problems in Graph Drawing

  2003cites this paper
• Experiments on the minimum linear arrangement problem

  2003cites this paper
• Crossing Numbers and Cutwidths

  2003cites this paper
• Disjoint Edges in Topological Graphs

  2003cites this paper
• Improved Bounds for the Crossing Number of the Mesh of Trees

  2003cites this paper
• Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas

  2002cites this paper