Pages that link to "Item:Q4727445"
From MaRDI portal
The following pages link to Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445):
Displayed 50 items.
- Embedding generalized Petersen graph in books (Q295940) (← links)
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- On the pagenumber of the cube-connected cycles (Q626969) (← links)
- The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
- Routing with critical paths (Q910228) (← links)
- Ordered sets, pagenumbers and planarity (Q913833) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Embedding connected double-loop networks with even cardinality in books (Q1033043) (← links)
- Embedding the incomplete hypercube in books (Q1044693) (← links)
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks (Q1100131) (← links)
- A trade-off between page number and page width of book embeddings of graphs (Q1120583) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- On the approximation of protein threading (Q1274599) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books (Q1377659) (← links)
- The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- A \((2k + 1)\)-regular graph with page-number \(k\) (Q2092439) (← links)
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- The book thickness of nilpotent graphs (Q2136363) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- The outerplanar crossing number of the complete bipartite graph (Q2172421) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Local and union page numbers (Q2206876) (← links)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- The pagewidth of trivalent planar graphs (Q2276971) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- The bipartite-cylindrical crossing number of the complete bipartite graph (Q2308490) (← links)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)