Square-Orthogonal Drawing with Few Bends per Edge (Q4925252): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): conf/cocoon/LinP13, #quickstatements; #temporary_batch_1731468600454
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62041780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing orthogonal drawings with the minimum number of bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better heuristic for orthogonal graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-efficient static and incremental graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for area-efficient orthogonal drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orthogonal drawings of high degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs on rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/cocoon/LinP13 / rank
 
Normal rank

Latest revision as of 05:22, 13 November 2024

scientific article; zbMATH DE number 6174169
Language Label Description Also known as
English
Square-Orthogonal Drawing with Few Bends per Edge
scientific article; zbMATH DE number 6174169

    Statements

    Identifiers