Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Journal of Graph Algorithms and Applications
Tome 17 (2013)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Orthogonal-Ordering Constraints are Tough
Ulrik Brandes
;
Barbara Pampel
p. 1-10
Geometric RAC Simultaneous Drawings of Graphs
Evmorfia Argyriou
;
Michael Bekos
;
Michael Kaufmann
;
Antonios Symvonis
p. 11-34
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing
David Eppstein
p. 35-55
Sommaire du
Fascicule no. 2
Guest Editor's Foreword
Shin-ichi Nakano
p. 57-58
Universal Line-Sets for Drawing Planar 3-Trees
Md. Iqbal Hossain
;
Debajyoti Mondal
;
Md. Saidur Rahman
;
Sammi Abida Salma
p. 59-79
Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
Sammi Abida Salma
;
Md. Saidur Rahman
;
Md. Iqbal Hossain
p. 81-102
Drawing Unordered Trees on k-Grids
Christian Bachmaier
;
Marco Matzeder
p. 103-128
Parameterized Algorithms for (r,l)-Partization
R. Krithika
;
N. Narayanaswamy
p. 129-146
Sommaire du
Fascicule no. 3
Testing Simultaneous Planarity when the Common Graph is 2-Connected
Bernhard Haeupler
;
Krishnam Raju Jampani
;
Anna Lubiw
p. 147-171
Optimal 3D Angular Resolution for Low-Degree Graphs
David Eppstein
;
Maarten Löffler
;
Elena Mumford
;
Martin Nöllenburg
p. 173-200
Flows in One-Crossing-Minor-Free Graphs
Erin Wolf Chambers
;
David Eppstein
p. 201-220
On the Page Number of Upward Planar Directed Acyclic Graphs
Fabrizio Frati
;
Radoslav Fulek
;
Andres Ruiz-Vargas
p. 221-244
Maximal Neighborhood Search and Rigid Interval Graphs
Peng Li
;
Yaokun Wu
p. 245-264
On the Complexity of Partitioning Graphs for Arc-Flags
Reinhard Bauer
;
Moritz Baum
;
Ignaz Rutter
;
Dorothea Wagner
p. 265-299
A Note on Minimum-Segment Drawings of Planar Graphs
Stephane Durocher
;
Debajyoti Mondal
;
Rahnuma Islam Nishat
;
Sue Whitesides
p. 301-328
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme
Markus Chimani
;
Philipp Hungerländer
p. 329-362
Sommaire du
Fascicule no. 4
Guest Editors' Foreword
Walter Didimo
;
Maurizio Patrignani
p. 363-365
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
Marcus Schaefer
p. 367-440
Edge-weighted contact representations of planar graphs
Martin Nöllenburg
;
Prutkin Roman
;
Ignaz Rutter
p. 441-473
Planar Graphs as VPG-Graphs
Steven Chaplick
;
Torsten Ueckerdt
p. 475-494
Graph Drawing in TikZ
Till Tantau
p. 495-513
Interactive Visualization of Streaming Text Data with Dynamic Maps
Emden Gansner
;
Yifan Hu
;
Stephen North
p. 515-540
Optical Graph Recognition
Christopher Auer
;
Christian Bachmaier
;
Franz Brandenburg
;
Andreas Gleißner
;
Josef Reislhuber
p. 541-565
Sommaire du
Fascicule no. 5
An Approximate Restatement of the Four-Color Theorem
Atish Das Sarma
;
Amita Gajewar
;
Richard Lipton
;
Danupon Nanongkai
p. 567-573
Smooth Orthogonal Layouts
Michael Bekos
;
Michael Kaufmann
;
Stephen Kobourov
;
Antonios Symvonis
p. 575-595
Sommaire du
Fascicule no. 6
Guest Editor's Foreword
Subir Kumar Ghosh
p. 597-598
On Alliance Partitions and Bisection Width for Planar Graphs
Martin Olsen
;
Morten Revsbaek
p. 599-614
An FPT algorithm for Tree Deletion Set
Venkatesh Raman
;
Saket Saurabh
;
Ondřej Suchý
p. 615-628
Box-Rectangular Drawings of Planar Graphs
Md. Manzurul Hasan
;
Md. Saidur Rahman
;
Md. Rezaul Karim
p. 629-646
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
Tobias Brunsch
;
Kamiel Cornelissen
;
Bodo Manthey
;
Heiko Röglin
p. 647-670
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
Tapas Kumar Mishra
;
Sudebkumar Prasant Pal
p. 671-688
Sommaire du
Fascicule no. 7
Confluent Hasse Diagrams
David Eppstein
;
Joseph Simons
p. 689-710