scientific article; zbMATH DE number 7286695

DOI10.4230/LIPIcs.SEA.2018.22zbMath1493.68262arXiv1804.07143MaRDI QIDQ5140734

Tilo Wiedera, Markus Chimani, Ivo Hedtke

Publication date: 16 December 2020

Full work available at URL: https://arxiv.org/abs/1804.07143

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer linear programminggraph drawingalgorithm engineeringmaximum planar subgraphpseudo-Boolean satisfiability

Mathematics Subject Classification ID

Integer programming (90C10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Unnamed Item, Unnamed Item, Stronger ILPs for the Graph Genus Problem.

Uses Software

• SCIP
• SteinLib
• OGDF
• Potassco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-planar core reduction of graphs
• A characterization of planar graphs by Trémaux orders
• Planar graphs and poset dimension
• Planarity and duality of finite and infinite graphs
• Optimal linear arrangements using betweenness variables
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• A tighter insertion-based approximation of the crossing number
• Another characterisation of planar graphs
• Finding Triangles for Maximum Planar Subgraphs
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• A Better Approximation Algorithm for Finding Planar Subgraphs
• Generating Random Regular Graphs Quickly
• Efficient Extraction of Multiple Kuratowski Subdivisions
• Advances in the Planarization Method: Effective Multiple Edge Insertions