Bundled Crossings Revisited (Q5141645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the degenerate crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bundled Crossing Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic and geometric methods in enumerative combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6059956 / 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: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Outerplanarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundled crossings revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of arrangements of pseudolines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundled Crossings in Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering Metro Lines by Block Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a canonical polygonal schema of an orientable triangulated surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The genus crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degenerate crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge routing with ordered bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph crossing number and its variants: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degenerate Crossing Number and Higher-Genus Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Crossings in Storyline Visualizations / rank
 
Normal rank

Revision as of 05:39, 24 July 2024

scientific article; zbMATH DE number 7288645
Language Label Description Also known as
English
Bundled Crossings Revisited
scientific article; zbMATH DE number 7288645

    Statements

    Bundled Crossings Revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2020
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers