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 20 (2016)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Guest Editors' Foreword
M. Sohel Rahman
;
Etsuji Tomita
p. 1-2
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Christian Engels
p. 3-22
An Improved Algorithm for Parameterized Edge Dominating Set Problem
Ken Iwaide
;
Hiroshi Nagamochi
p. 23-58
An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks
Yuma Asada
;
Fukuhito Ooshita
;
Michiko Inoue
p. 59-78
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
Thim Strothmann
p. 79-100
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Yoshiaki Araki
;
Takashi Horiyama
;
Ryuhei Uehara
p. 101-114
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps
Kei Uchizawa
;
Daiki Yashima
;
Xiao Zhou
p. 115-131
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Michael Bekos
;
Thomas van Dijk
;
Philipp Kindermann
;
Alexander Wolff
p. 133-158
Sommaire du
Fascicule no. 2
Constructive algorithms for the partial directed weighted improper coloring problem
Alain Hertz
;
Romain Montagné
;
François Gagnon
p. 159-188
Phylogenetic incongruence through the lens of Monadic Second Order logic
Steven Kelk
;
Leo van Iersel
;
Celine Scornavacca
;
Mathias Weller
p. 189-215
Algorithms and Bounds for Overloaded Orthogonal Drawings
Evgenios Kornaropoulos
;
Ioannis Tollis
p. 217-246
A navigation system for tree space
Sarah Mark
;
Jeanette McLeod
;
Mike Steel
p. 247-268
The Unit Bar Visibility Number of a Graph
Emily Gaub
;
Michelle Rose
;
Paul Wenger
p. 269-297
Minimum Eccentricity Shortest Paths in some Structured Graph Classes
Feodor Dragan
;
Arne Leitert
p. 299-322
Simple Recognition of Halin Graphs and Their Generalizations
David Eppstein
p. 323-346
The (3,1)-ordering for 4-connected planar triangulations
Therese Biedl
;
Martin Derka
p. 347-362
Propagation Rules for Graph Partitioning Constraints
Radosław Cymer
p. 363-410
A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals
Yong Wang
;
Jeffrey Remmel
p. 411-434
Graph Layout with Versatile Boundary Constraints
Yani Zhang
;
Alex Pang
p. 435-459
Exponential vs. Subexponential Tower of Hanoi Variants
Daniel Berend
;
Amir Sapir
p. 461-479