Pages that link to "Item:Q4625114"

The following pages link to Experimental Evaluation of Book Drawing Algorithms (Q4625114):

Displaying 11 items.

• A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
• On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
• Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
• Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
• Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
• The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
• (Q5115821) (← links)
• Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
• Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)