Abstract is missing.
- Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?Peter Widmayer. 1 [doi]
- Approximability of Stable Matching ProblemsKazuo Iwama. 2 [doi]
- On Three-Dimensional Graph Drawing and EmbeddingSue Whitesides. 3-4 [doi]
- Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by CompressionTakeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano. 5-16 [doi]
- Generalized Above Guarantee Vertex Cover and r-PartizationR. Krithika, N. S. Narayanaswamy. 17-27 [doi]
- Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract)Sang Won Bae, Kyung-Yong Chwa. 28-39 [doi]
- Tight Bound for Farthest-Color Voronoi Diagrams of Line SegmentsSang Won Bae. 40-51 [doi]
- Range Aggregate Maximal Points in the PlaneAnanda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli. 52-63 [doi]
- Approximating the Multi-level Bottleneck Assignment ProblemTrivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma. 64-75 [doi]
- Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex InsertionNicolas Boria, Jérôme Monnot, Vangelis Th. Paschos. 76-87 [doi]
- Comparing and Aggregating Partial Orders with Kendall Tau DistancesFranz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier. 88-99 [doi]
- On the Round-Trip 1-Center and 1-Median ProblemsBiing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen. 100-111 [doi]
- Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility GraphsSammi Abida Salma, Md. Saidur Rahman 0001. 112-123 [doi]
- On Relaxing the Constraints in Pairwise Compatibility GraphsTiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri. 124-135 [doi]
- Universal Line-Sets for Drawing Planar 3-TreesMd. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman 0001, Sammi Abida Salma. 136-147 [doi]
- On the Hardness of Point-Set Embeddability - (Extended Abstract)Stephane Durocher, Debajyoti Mondal. 148-159 [doi]
- Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract)Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz. 160-172 [doi]
- Fat Heaps without Regular CountersAmr Elmasry, Jyrki Katajainen. 173-185 [doi]
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large AnglesMartin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff. 186-197 [doi]
- Drawing Unordered Trees on k-GridsChristian Bachmaier, Marco Matzeder. 198-210 [doi]
- Heuristics for the Maximum 2-layer RAC Subgraph ProblemEmilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo. 211-216 [doi]
- Nash Equilibria with Minimum Potential in Undirected Broadcast GamesYasushi Kawase, Kazuhisa Makino. 217-228 [doi]
- Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d IntegersVorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai. 229-240 [doi]