| Invited Talks |
| Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? / Peter Widmayer |
| Approximability of Stable Matching Problems / Kazuo Iwama |
| On Three-Dimensional Graph Drawing and Embedding / Sue Whitesides |
| Graph Algorithms I |
| Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression / Takeaki Uno ; Ryuhei Uehara ; Shin-ichi Nakano |
| Generalized Above Guarantee Vertex Cover and r-Partization / R. Krithika ; N.S. Narayanaswamy |
| Computational Geometry |
| Farthest Voronoi Diagrams under Travel Time Metrics / Sang Won Bae ; Kyung-Yong Chwa |
| Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments |
| Range Aggregate Maximal Points in the Plane / Ananda Swarup Das ; Prosenjit Gupta ; Anil Kishore Kalavagattu ; Jatin Agarwal ; Kannan Srinathan ; Kishore Kothapalli |
| Approximation Algorithms |
| Approximating the Multi-level Bottleneck Assignment Problem / Trivikram Dokka ; Anastasia Kouvela ; Frits C.R. Spieksma |
| Reoptimization of the Maximum Weighted Pk-Free Subgraph Problem under Vertex Insertion / Nicolas Boria ; Jérôme Monnot ; Vangelis Th. Paschos |
| Comparing and Aggregating Partial Orders with Kendall Tau Distances / Franz J. Brandenburg ; Andreas Gleiβner ; Andreas Hofmeier |
| Graph Algorithms II |
| On the Round-Trip 1-Center and 1-Median Problems / Biing-Feng Wang ; Jhih-Hong Ye ; Pei-Jung Chen |
| Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs / Sammi Abida Salma ; Md. Saidur Rahman |
| On Relaxing the Constraints in Pairwise Compatibility Graphs / Tiziana Calamoneri ; Rossella Petreschi ; Blerina Sinaimeri |
| Graph Drawing I |
| Universal Line-Sets for Drawing Planar 3-Trees / Md. Iqbal Hossain ; Debajyoti Mondal |
| On the Hardness of Point-Set Embeddability / Stephane Durocher |
| String and Data Structures |
| Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet / Tanaeem M. Moosa ; Sumaiya Nazeen ; M. Sohel Rahman ; Rezwana Reaz |
| Fat Heaps without Regular Counters / Amr Elmasry ; Jyrki Katajainen |
| Graph Drawing II |
| Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles / Martin Fink ; Jan-Henrik Haunert ; Tamara Mchedlidze ; Joachim Spoerhase ; Alexander Wolff |
| Drawing Unordered Trees on k-Grids / Christian Bachmaier ; Marco Matzeder |
| Heuristics for the Maximum 2-layer RAC Subgraph Problem / Emilio Di Giacomo ; Walter Didimo ; Luca Grilli ; Giuseppe Liotta ; Salvatore A. Romeo |
| Games and Cryptography |
| Nash Equilibria with Minimum Potential in Undirected Broadcast Games / Yasushi Kawase ; Kazuhisa Makino |
| Calculating Average Joint, Hamming Weight for Minimal Weight Conversion of d Integers / Vorapong Suppakitpaisarn ; Masato Edahiro ; Hiroshi Imai |
| Author Index |
| Invited Talks |
| Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? / Peter Widmayer |
| Approximability of Stable Matching Problems / Kazuo Iwama |
| On Three-Dimensional Graph Drawing and Embedding / Sue Whitesides |
| Graph Algorithms I |
| Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression / Takeaki Uno ; Ryuhei Uehara ; Shin-ichi Nakano |
