scientific article; zbMATH DE number 1693470

MaRDI QIDQ2764037zbMATH OpenFDO

Authors Oliver Bastert, Christian Matuszewski

Publication date 22 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2025/20250087

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Cited in

(14)

• Track layouts, layered path decompositions, and leveled planarity
• Tabu search for min-max edge crossing in graphs
• Collage of two-dimensional words
• k-level crossing minimization is NP-hard for trees
• A digraph represented by a family of boxes or spheres
• An exact method for the minimum feedback arc set problem
• Two results on layered pathwidth and linear layouts
• Graph Drawing
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
• Weakly leveled planarity with bounded span
• Drawing Reeb graphs
• Weakly leveled planarity with bounded span
• Width notions for ordering-related problems
• Reeb lobsters are 1-planar (poster abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764037)