Abstract is missing.
- Algorithms for Equilibrium Prices in Linear Market ModelsKurt Mehlhorn. 1-4 [doi]
- In as Few Comparisons as PossibleJ. Ian Munro. 5-6 [doi]
- The Happy End Theorem and Related ResultsPavel Valtr. 7 [doi]
- Generalized Class Cover Problem with Axis-Parallel StripsApurva Mudgal, Supantha Pandit. 8-21 [doi]
- Top-k Manhattan Spatial Skyline QueriesWanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn. 22-33 [doi]
- On Generalized Planar Skyline and Convex Hull Range QueriesNadeem Moidu, Jatin Agarwal, Sankalp Khare, Kishore Kothapalli, Kannan Srinathan. 34-43 [doi]
- Boundary Labeling with Flexible Label PositionsZhi-Dong Huang, Sheung-Hung Poon, Chun-Cheng Lin. 44-55 [doi]
- Approximating the Bipartite TSP and Its Biased GeneralizationAleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno. 56-67 [doi]
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute FlowJean-François Baffier, Vorapong Suppakitpaisarn. 68-79 [doi]
- Simple Linear Comparison of Strings in V-Order - (Extended Abstract)Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth. 80-89 [doi]
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor SearchNils Kriege, Petra Mutzel, Till Schäfer. 90-101 [doi]
- Optimal Serial Broadcast of Successive ChunksSatoshi Fujita. 102-113 [doi]
- The ${\mathcal{G}}$ -Packing with t-Overlap ProblemJazmín Romero, Alejandro López-Ortiz. 114-124 [doi]
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform CapacityYuya Higashikawa, Mordecai J. Golin, Naoki Katoh. 125-137 [doi]
- On a Class of Covering Problems with Variable Capacities in Wireless NetworksSelim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom. 138-150 [doi]
- Algorithm and Hardness Results for Outer-connected Dominating Set in GraphsB. S. Panda, Arti Pandey. 151-162 [doi]
- Some Results on Point Visibility GraphsSubir Kumar Ghosh, Bodhayan Roy. 163-175 [doi]
- Some Extensions of the Bottleneck Paths ProblemTong-Wook Shinn, Tadao Takaoka. 176-187 [doi]
- I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected GraphsAlka Bhushan, Sajith Gopalan. 188-199 [doi]
- On Some $\mathcal{NP}$ -complete SEFE ProblemsPatrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth. 200-212 [doi]
- On Dilworth k Graphs and Their Pairwise CompatibilityTiziana Calamoneri, Rossella Petreschi. 213-224 [doi]
- Efficient Algorithms for Sorting k-Sets in BinsAtsuki Nagao, Kazuhisa Seto, Junichi Teruyama. 225-236 [doi]
- Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination RatioWing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang. 237-248 [doi]
- Editing the Simplest GraphsPeter Damaschke, Olof Mogren. 249-260 [doi]
- Alignment with Non-overlapping Inversions on Two StringsDa-Jung Cho, Yo-Sub Han, Hwee Kim. 261-272 [doi]
- Collapsing Exact Arithmetic HierarchiesNikhil Balaji, Samir Datta. 273-285 [doi]
- Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden SubgraphsJiong Guo, Yash Raj Shrestha. 286-297 [doi]
- Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact MethodsCarla Binucci, Walter Didimo. 298-309 [doi]
- On Minimum Average Stretch Spanning Trees in Polygonal 2-TreesN. S. Narayanaswamy, G. Ramakrishna. 310-321 [doi]
- Linear Layouts of Weakly Triangulated GraphsAsish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli. 322-336 [doi]
- Bichromatic Point-Set Embeddings of Trees with Fewer Bends - (Extended Abstract)Khaled Mahmud Shahriar, Md. Saidur Rahman 0001. 337-348 [doi]
- ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic GraphsNorie Fu. 349-360 [doi]