Journal: Int. J. Found. Comput. Sci.

Volume 17, Issue 5

1003 -- 1004Seok-Hee Hong, Hsu-Chun Yen. Preface
1005 -- 1016Károly J. Börözky, János Pach, Géza Tóth. Planar Crossing Numbers of Graphs Embeddable in Another Surface
1017 -- 1030Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. Trémaux Trees and Planarity
1031 -- 1060Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki. Convex Grid Drawings of Four-connected Plane Graphs
1061 -- 1070Maurizio Patrignani. On Extending a Partial Straight-line Drawing
1071 -- 1094Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta. On Embedding a Graph on Two Sets of Points
1095 -- 1114Patrick Healy, Karol Lynch. Two Fixed-parameter Tractable Algorithms for Testing Upward Planarity
1115 -- 1128Kazuyuki Miura, Machiko Azuma, Takao Nishizeki. Convex Drawings of Plane Graphs of Minimum Outer Apices
1129 -- 1142Huaming Zhang, Xin He. An Application of Well-orderly Trees in Graph Drawing
1143 -- 1164Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk. Drawing with Fat Edges
1165 -- 1178Hiroshi Nagamochi. Packing Soft Rectangles
1179 -- 1204Predrag T. Tosic. On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs
1205 -- 1222Reihaneh Safavi-Naini, Huaxiong Wang, Duncan S. Wong. Resilient Lkh: Secure Multicast Key Distribution Schemes
1223 -- 1230Zbynek Krivka, Alexander Meduna, Rudolf Schönecker. Generation of Languages by Rewriting Systems that Resemble Automata
1231 -- 1232Janusz A. Brzozowski, Helmut Jürgensen. Errata: representation of Semiautomata by Canonical Words and Equivalences