Parameterized approaches to orthogonal compaction

DOI10.1016/J.JCSS.2025.103692MaRDI QIDQ6924410zbMATH OpenFDO

Authors Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi

Publication date 29 September 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103692

zbMATH Keywords

compactionorthogonal graph drawingorthogonal representationparameterized complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Algorithms for plane representations of acyclic digraphs
• Algorithms for Reporting and Counting Geometric Intersections
• An improved fixed-parameter algorithm for one-page crossing minimization
• Bounding and computing obstacle numbers of graphs
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• Drawing graphs on few lines and few planes
• Fixed parameter algorithms for one-sided crossing minimization revisited
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 7788610 (Why is no real title available?)
• Inapproximability of orthogonal compaction
• Kernelization. Theory of parameterized preprocessing
• Minimum rectilinear polygons for given angle sequences
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the complexity of orthogonal compaction
• On the parameterized complexity of layered graph drawing
• Orthogonal planarity testing of bounded treewidth graphs
• Parameterized algorithms
• Parameterized algorithms for book embedding problems
• Parameterized algorithms for queue layouts
• Parameterized algorithms for upward planarity
• Parameterized complexity of 1-planarity
• Parameterized complexity of graph planarity with restricted cyclic orders
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Subexponential-time and FPT algorithms for embedded flat clustered planarity
• The Complexity of Drawing Graphs on Few Lines and Few Planes
• The math book. From Pythagoras to the 57th dimension. 250 milestones in the history of mathematics
• The parametrized complexity of the segment number
• Turn-regularity and optimal area drawings of orthogonal representations
• Upward book embeddings of st-graphs
• Upward drawings of triconnected digraphs.

This page was built for publication: Parameterized approaches to orthogonal compaction

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