Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 13
Volume 13, Number 1, 2009
- Md. Saidur Rahman
:
Guest Editor's Foreword. 3-4 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. 5-18 - Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates. 19-53 - Hiro Ito, Mike Paterson, Kenya Sugihara:
The Multi-Commodity Source Location Problems and the Price of Greed. 55-73
Volume 13, Number 2, 2009
- Falk Hüffner:
Algorithm Engineering for Optimal Graph Bipartization. 77-98 - Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
Degree-constrained edge partitioning in graphs arising from discrete tomography. 99-118 - Ulrik Brandes, Daniel Fleischer:
Vertex Bisection is Hard, too. 119-131 - Daniel Berend, Shira Zucker:
The Black-and-White Coloring Problem on Trees. 133-152 - Muhammad Rezaul Karim, Md. Saidur Rahman:
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area. 153-177 - Seok-Hee Hong, Hiroshi Nagamochi:
New Approximation to the One-sided Radial Crossing Minimization. 179-196 - David Eppstein:
Finding Large Clique Minors is Hard. 197-204 - Michael Jünger, Michael Schulz:
Intersection Graphs in Simultaneous Embedding with Fixed Edges. 205-218 - Ovidiu Daescu, Anastasia Kurdia:
Towards an optimal algorithm for recognizing Laman graphs. 219-232 - Ulrich Pferschy, Joachim Schauer:
The Knapsack Problem with Conflict Graphs. 233-249 - Ângela Mestre:
Generating connected and 2-edge connected graphs. 251-281
Volume 13, Number 3, 2009
- Seok-Hee Hong, Takao Nishizeki:
Guest Editors' Foreword. 285-287 - Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-Criteria Boundary Labeling. 289-317 - Vassilis Tsiaras, Sofia Triantafilou, Ioannis G. Tollis:
DAGmaps: Space Filling Visualization of Directed Acyclic Graphs. 319-347 - Giuseppe Di Battista, Fabrizio Frati:
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. 349-378 - Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. 379-422 - Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. 423-445 - Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov:
Constrained Simultaneous and Near-Simultaneous Embeddings. 447-465
a service of 
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 2024-04-22 20:03 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:
