Track layouts, layered path decompositions, and leveled planarity (Q1739109): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Flat foldings of plane graphs with prescribed angles and edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and Geometry of Finite and Infinite Squaregraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Crossing Minimization of Almost-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph layouts via layered separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus, Treewidth, and Local Crossing Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Graphs with Locally Restricted Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of layered graph drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack and Queue Layouts via Layered Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Tree Decompositions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered separators in minor-closed graph classes with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layouts of Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5622228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laying Out Graphs Using Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in Cartesian products of graphs / rank
 
Normal rank

Latest revision as of 02:14, 19 July 2024

scientific article
Language Label Description Also known as
English
Track layouts, layered path decompositions, and leveled planarity
scientific article

    Statements

    Track layouts, layered path decompositions, and leveled planarity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    track layouts
    0 references
    layered path decompositions
    0 references
    track-number
    0 references
    layered pathwidth
    0 references
    leveled planar graphs
    0 references
    outerplanar graphs
    0 references
    Halin graphs
    0 references
    square graphs
    0 references
    unit disc graphs
    0 references
    parameterized complexity
    0 references
    treewidth
    0 references
    almost-tree number
    0 references
    tree-depth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references