ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
1
views
10
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
394
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
LATIN 2014: Theoretical Informatics
Smooth Orthogonal Drawings of Planar Graphs
other
Author(s):
Muhammad Jawaherul Alam
,
Michael A. Bekos
,
Michael Kaufmann
,
Philipp Kindermann
,
Stephen G. Kobourov
,
Alexander Wolff
Publication date
(Print):
2014
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH title and first author match)
oa repository (via OAI-PMH doi match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
On Embedding a Graph in the Grid with the Minimum Number of Bends
Roberto Tamassia
(1987)
0
comments
Cited
65
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On the Computational Complexity of Upward and Rectilinear Planarity Testing
Ashim Garg
,
Roberto Tamassia
(2001)
0
comments
Cited
37
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Drawing planar graphs using the canonical ordering
G. Kant
(1996)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 144-155
DOI:
10.1007/978-3-642-54423-1_13
SO-VID:
6ff86019-b3d5-410b-8aa3-526d3f6e4b28
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
pp. 13
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3
pp. 24
The Computational Complexity of the Game of Set and Its Theoretical Applications
pp. 35
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
pp. 47
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
pp. 60
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
pp. 72
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
pp. 84
Optimal Algorithms for Constrained 1-Center Problems
pp. 96
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
pp. 108
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
pp. 120
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
pp. 132
The Planar Slope Number of Subcubic Graphs
pp. 144
Smooth Orthogonal Drawings of Planar Graphs
pp. 156
Drawing HV-Restricted Planar Graphs
pp. 168
Periodic Planar Straight-Frame Drawings with Polynomial Resolution
pp. 180
A Characterization of Those Automata That Structurally Generate Finite Groups
pp. 190
Linear Grammars with One-Sided Contexts and Their Automaton Representation
pp. 202
On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions
pp. 214
Computing in the Presence of Concurrent Solo Executions
pp. 226
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
pp. 238
(Total) Vector Domination for Graphs with Bounded Branchwidth
pp. 250
Computing the Degeneracy of Large Graphs
pp. 261
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
pp. 273
An Improved Data Stream Algorithm for Clustering
pp. 285
Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
pp. 294
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
pp. 306
Helly-Type Theorems in Property Testing
pp. 318
New Bounds for Online Packing LPs
pp. 330
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
pp. 342
Collision-Free Network Exploration
pp. 355
Powers of Hamilton Cycles in Pseudorandom Graphs
pp. 367
Local Update Algorithms for Random Graphs
pp. 379
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
pp. 391
Relatively Bridge-Addable Classes of Graphs
pp. 399
O(n) Time Algorithms for Dominating Induced Matching Problems
pp. 409
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
pp. 421
Convexity in Partial Cubes: The Hull Number
pp. 433
Connected Greedy Colourings
pp. 442
On the Number of Prefix and Border Tables
pp. 454
Probabilities of 2-Xor Functions
pp. 466
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
pp. 478
The Flip Diameter of Rectangulations and Convex Subdivisions
pp. 490
Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences
pp. 502
Counting and Generating Permutations Using Timed Languages
pp. 514
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
pp. 526
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
pp. 538
Complexity of Coloring Graphs without Paths and Cycles
pp. 550
Approximating Real-Time Scheduling on Identical Machines
pp. 562
Integrated Supply Chain Management via Randomized Rounding
pp. 574
The Online Connected Facility Location Problem
pp. 586
Multiply Balanced k −Partitioning
pp. 598
On Some Recent Approximation Algorithms for MAX SAT
pp. 610
Packet Forwarding Algorithms in a Line Network
pp. 622
Survivability of Swarms of Bouncing Robots
pp. 634
Emergence of Wave Patterns on Kadanoff Sandpiles
pp. 648
A Divide and Conquer Method to Compute Binomial Ideals
pp. 660
How Fast Can We Multiply Large Integers on an Actual Computer?
pp. 671
Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
pp. 683
Algorithmic and Hardness Results for the Colorful Components Problems
pp. 695
On the Stability of Generalized Second Price Auctions with Budgets
pp. 707
Approximation Algorithms for the Max-Buying Problem with Limited Supply
pp. 719
Budget Feasible Mechanisms for Experimental Design
pp. 731
LZ77-Based Self-indexing with Faster Pattern Matching
pp. 743
Quad-K-d Trees
pp. 755
Biased Predecessor Search
Similar content
394
Nonlinear Stochastic Attitude Filters on the Special Orthogonal Group 3: Ito and Stratonovich
Authors:
Hashim Hashim
,
Lyndon Brown
,
Kenneth McIsaac
On Choosability with Separation of Planar Graphs with Forbidden Cycles
Authors:
,
,
Motor cortical activity during drawing movements: single-unit activity during sinusoid tracing.
Authors:
Martin Schwartz
See all similar
Cited by
3
Lombardi Drawings of Knots and Links
Authors:
Philipp Kindermann
,
Stephen Kobourov
,
Maarten Löffler
…
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Authors:
Evmorfia Argyriou
,
Sabine Cornelsen
,
Henry Förster
…
Discrete Optimization Methods for Group Model Selection in Compressed Sensing
Authors:
Bubacarr Bah
,
Jannis Kurtz
,
Oliver Schaudt
See all cited by