default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 11
Volume 11, Number 1, 2007
- Patrick Healy, Karol Lynch:
Building Blocks of Upward Planar Digraphs. 3-44 - Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs. 45-59 - David Eppstein:
The Traveling Salesman Problem for Cubic Graphs. 61-81 - Athula Gunawardena, Robert R. Meyer:
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs. 83-98 - Donatello Conte
, Pasquale Foggia, Mario Vento:
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs. 99-143 - Alon Efrat, Cesim Erten, Stephen G. Kobourov:
Fixed-Location Circular Arc Drawing of Planar Graphs. 145-164 - Kerri Morgan, Graham Farr:
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems. 165-193 - Ben Roberts, Dirk P. Kroese:
Estimating the Number of s-t Paths in a Graph. 195-214 - Xiaodong Wu, Michael B. Merickel:
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images. 215-237 - Mauro Mezzini:
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time. 239-257 - Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. 259-276 - Marios Poulos, George Bokos, Nikolaos Kanellopoulos, Sozon Papavlasopoulos, Markos Avlonitis:
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes. 277-307 - Louigi Addario-Berry, Neil Olver, Adrian Vetta:
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. 309-319
Volume 11, Number 2, 2007
- Peter Eades, Patrick Healy:
Guest Editor's Foreword. 323-324 - Ulrik Brandes, Daniel Fleischer, Thomas Puppe:
Dynamic Spectral Layout with an Application to Small Worlds. 325-343 - Stefan Hachul, Michael Jünger:
Large-Graph Layout Algorithms at Work: An Experimental Study. 345-369 - Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarassov:
A 2.5D Hierarchical Drawing of Directed Graphs. 371-396 - Weidong Huang, Seok-Hee Hong, Peter Eades:
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. 397-429 - Chun-Cheng Lin, Hsu-Chun Yen:
On Balloon Drawings of Rooted Trees. 431-452 - Andreas Noack:
Energy Models for Graph Clustering. 453-480 - Charis Papadopoulos, Constantinos Voglis:
Drawing graphs using modular decomposition. 481-511
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-24 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
