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 21 (2017)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Guest Editors' Foreword
Emilio Di Giacomo
;
Anna Lubiw
p. 1-3
OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs
Björn Zimmer
;
Andreas Kerren
p. 5-27
Shape-Based Quality Metrics for Large Graph Visualization
Peter Eades
;
Seok-Hee Hong
;
An Nguyen
;
Karsten Klein
p. 29-53
An Incremental Layout Method for Visualizing Online Dynamic Graphs
Tarik Crnovrsanin
;
Jacqueline Chu
;
Kwan-Liu Ma
p. 55-80
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
Carla Binucci
;
Markus Chimani
;
Walter Didimo
;
Martin Gronemann
;
Karsten Klein
;
Jan Kratochvíl
;
Fabrizio Montecchiani
;
Ioannis Tollis
p. 81-102
Rook-drawings of Plane Graphs
David Auber
;
Nicolas Bonichon
;
Paul Dorbec
;
Claire Pennarun
p. 103-120
The Utility of Untangling
Vida Dujmović
p. 121-134
Hanani-Tutte for Radial Planarity
Radoslav Fulek
;
Michael Pelsmajer
;
Marcus Schaefer
p. 135-154
Sommaire du
Fascicule no. 2
Star-Shaped and L-Shaped Orthogonal Drawings
Xin He
;
Dayu He
p. 155-175
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
Pavlos Eirinakis
;
Matthew Williamson
;
K. Subramani
p. 177-181
On the Complexity of the Planar Slope Number Problem
Udo Hoffmann
p. 183-193
Symmetry Breaking Constraints for the Minimum Deficiency Problem
Sivan Altinakar
;
Gilles Caporossi
;
Alain Hertz
p. 195-218
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
Bart Jansen
p. 219-243
Sommaire du
Fascicule no. 3
Guest Editors' Foreword
Mohammed Kaykobad
;
Rossella Petreschi
p. 245-246
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
Morito Oomine
;
Aleksandar Shurbevski
;
Hiroshi Nagamochi
p. 247-263
Generalized Bounded Tree Cover of a Graph
Barun Gorain
;
Partha Sarathi Mandal
;
Krishnendu Mukhopadhyaya
p. 265-280
On Aligned Bar 1-Visibility Graphs
Franz Brandenburg
;
Alexander Esch
;
Daniel Neuwirth
p. 281-312
Vertex-Coloring with Defects
Patrizio Angelini
;
Michael Bekos
;
Felice De Luca
;
Walter Didimo
;
Michael Kaufmann
;
Stephen Kobourov
;
Fabrizio Montecchiani
;
Chrysanthi Raftopoulou
;
Vincenzo Roselli
;
Antonios Symvonis
p. 313-340
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
Md. Iqbal Hossain
;
Sammi Abida Salma
;
Md. Saidur Rahman
;
Debajyoti Mondal
p. 341-352
Hamiltonian chromatic number of block graphs
Devsi Bantva
p. 353-369
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash
;
Sándor Fekete
;
Seoung Kyou Lee
;
Alejandro López-Ortiz
;
Daniela Maftuleac
;
James McLurkin
p. 371-387
Sommaire du
Fascicule no. 4
Essential Constraints of Edge-Constrained Proximity Graphs
Prosenjit Bose
;
Jean-Lou De Carufel
;
Alina Shaikhet
;
Michiel Smid
p. 389-415
Incremental Network Design with Minimum Spanning Trees
Konrad Engel
;
Thomas Kalinowski
;
Martin Savelsbergh
p. 417-432
Drawing Planar Graphs with Reduced Height
Stephane Durocher
;
Debajyoti Mondal
p. 433-453
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
Francisco Soulignac
p. 455-489
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms
Francisco Soulignac
p. 491-525
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
Ahmad Biniaz
;
Prosenjit Bose
;
Ingo van Duijn
;
Anil Maheshwari
;
Michiel Smid
p. 527-546
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints
Max Ward
;
Andrew Gozzard
;
Amitava Datta
p. 547-554
A Note on the Existence of All (g,f)-Factors
Radosław Cymer
p. 555-560
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms Experiments
Alexander Igamberdiev
;
Wouter Meulemans
;
André Schulz
p. 561-588
Topological Decomposition of Directed Graphs
Ala Abuthawabeh
;
Dirk Zeckzer
p. 589-630
Ideal Drawings of Rooted Trees With Approximately Optimal Width
Therese Biedl
p. 631-648
D-resolvability of vertices in planar graphs
James Tilley
p. 649-661
Rooted Cycle Bases
David Eppstein
;
J. Michael McCarthy
;
Brian Parrish
p. 663-686
Egalitarian Graph Orientations
Glencora Borradaile
;
Jennifer Iglesias
;
Theresa Migler
;
Antonio Ochoa
;
Gordon Wilfong
;
Lisa Zhang
p. 687-708
On the Total Number of Bends for Planar Octilinear Drawings
Michael Bekos
;
Michael Kaufmann
;
Robert Krug
p. 709-730
Intersection-Link Representations of Graphs
Patrizio Angelini
;
Giordano Da Lozzo
;
Giuseppe Di Battista
;
Fabrizio Frati
;
Maurizio Patrignani
;
Ignaz Rutter
p. 731-755
Progress on Partial Edge Drawings
Till Bruckdorfer
;
Sabine Cornelsen
;
Carsten Gutwenger
;
Michael Kaufmann
;
Fabrizio Montecchiani
;
Martin Nöllenburg
;
Alexander Wolff
p. 757-786
Sommaire du
Fascicule no. 5
Guest editors' foreword
Yifan Hu
;
Martin Nöllenburg
p. 787-789
A Sparse Stress Model
Mark Ortmann
;
Mirza Klimenta
;
Ulrik Brandes
p. 791-821
Generalized Layerings for Arbitrary and Fixed Drawing Areas
Ulf Rüegg
;
Thorsten Ehlers
;
Miro Spönemann
;
Reinhard von Hanxleden
p. 823-856
Node Overlap Removal by Growing a Tree
Lev Nachmanson
;
Arlind Nocaj
;
Sergey Bereg
;
Leishi Zhang
;
Alexander Holroyd
p. 857-872
Block Crossings in Storyline Visualizations
Thomas van Dijk
;
Martin Fink
;
Norbert Fischer
;
Fabian Lipp
;
Peter Markfelder
;
Alexander Ravsky
;
Subhash Suri
;
Alexander Wolff
p. 873-913
Non-aligned Drawings of Planar Graphs
Therese Biedl
;
Claire Pennarun
p. 915-937
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
Éric Colin de Verdière
;
Vojtěch Kaluža
;
Pavel Paták
;
Zuzana Patáková
;
Martin Tancer
p. 939-981
Sommaire du
Fascicule no. 6
Column planarity and partially-simultaneous geometric embedding
Luis Barba
;
William Evans
;
Michael Hoffmann
;
Vincent Kusters
;
Maria Saumell
;
Bettina Speckmann
p. 983-1002
Computing phylogenetic trees using topologically related minimum spanning trees
Prabhav Kalaghatgi
;
Thomas Lengauer
p. 1003-1025
Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
Daniel Summer Magruder
;
Stefan Bonn
p. 1027-1038
Parameterized and approximation complexity of the detection pair problem in graphs
Florent Foucaud
;
Ralf Klasing
p. 1039-1056
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Jan Christoph Athenstädt
;
Sabine Cornelsen
p. 1057-1089
Equitable colorings of
$K_4$
-minor-free graphs
Rémi de Joannis de Verclos
;
Jean-Sébastien Sereni
p. 1091-1105
Graphs with Obstacle Number Greater than One
Leah Wrenn Berman
;
Glenn Chappell
;
Jill Faudree
;
John Gimbel
;
Chris Hartman
;
Gordon Williams
p. 1107-1119