Abstract is missing.
- Decomposing a Multigraph into Split ComponentsYung H. Tsin. 3-12 [doi]
- The Next-to-Shortest Path in Undirected Graphs with Nonnegative WeightsCong Zhang, Hiroshi Nagamochi. 13-20 [doi]
- Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge CostsTadao Takaoka. 21-26 [doi]
- On the Curve Complexity of Upward Planar DrawingsFranz-Josef Brandenburg. 27-36 [doi]
- Quickest Path Queries on Transportation NetworkRadwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos. 37-46 [doi]
- On empty pentagons and hexagons in planar point setsPavel Valtr. 47-48 [doi]
- Logic Programming: From Underspecification to UndefinednessLee Naish, Harald Søndergaard, Benjamin Horsfall. 49-58 [doi]
- Counting paths in planar width 2 branching programsMeena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah. 59-68 [doi]
- Computational Complexity of String PuzzlesChuzo Iwamoto, Kento Sasaki, Kenichi Morita. 69-74 [doi]
- Approximating the Reliable Resource Allocation Problem Using Inverse Dual FittingKewen Liao, Hong Shen. 75-82 [doi]
- Matching Problems with Delta-Matroid ConstraintsNaonori Kakimura, Mizuyo Takamatsu. 83-92 [doi]
- How to guard a graph against tree movementsToshihiro Fujito, Takayoshi Sakamaki. 93-96 [doi]
- On Defining and Computing CommunitiesMartin Oslen. 97-102 [doi]
- The Weak-Heap Family of Priority Queues in Theory and PraxisStefan Edelkamp, Amr Elmasry, Jyrki Katajainen. 103-112 [doi]
- Solving infinite games on trees with back-edgesAniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu. 113-122 [doi]
- Augmenting Outerplanar Graphs to Meet Diameter RequirementsToshimasa Ishii. 123-132 [doi]
- Cliques in Odd-Minor-Free GraphsKen-ichi Kawarabayashi, David R. Wood. 133-138 [doi]
- Upper and Lower Degree Bounded Graph Orientation with Minimum PenaltyYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono. 139-146 [doi]