0 | -- | 0 | David Avis. Preface |
1 | -- | 39 | Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia. Jin Akiyama: A Friend and His Mathematics |
41 | -- | 65 | David Avis, Adrian Bondy, William Cook, Bruce A. Reed. Vašek Chvátal: A Very Short Introduction |
67 | -- | 84 | Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber. On the Number of Plane Geometric Graphs |
85 | -- | 98 | Victor Alvarez, Toshinori Sakai, Jorge Urrutia. Bichromatic Quadrangulations with Steiner Points |
99 | -- | 115 | Kiyoshi Ando, Yoshimi Egawa. Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four |
117 | -- | 134 | David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa. Enumerating Non-crossing Minimally Rigid Frameworks |
135 | -- | 144 | Sheng Bau, Akira Saito. Reduction for 3-Connected Graphs of Minimum Degree at Least Four |
145 | -- | 152 | Hervé Brönnimann, Jonathan Lenchner, János Pach. Opposite-Quadrant Depth in the Plane |
153 | -- | 167 | Xiaomin Chen, Bin Tian, Lei Wang. Santa Claus' Towers of Hanoi |
169 | -- | 178 | Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint. Efficient Many-To-Many Point Matching in One Dimension |
179 | -- | 194 | Mirela Damian, Robin Y. Flatland, Joseph O'Rourke. Epsilon-Unfolding Orthogonal Polyhedra |
195 | -- | 208 | Erik D. Demaine, Martin L. Demaine. Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity |
209 | -- | 231 | Elaine M. Eschen, Chính T. Hoàng, R. Sritharan. 3)-Time Recognition Algorithm for hhds-free Graphs |
233 | -- | 243 | Matteo Fischetti, Andrea Lodi. MIPping Closures: An Instant Survey |
245 | -- | 258 | Greg N. Frederickson. Unexpected Twists in Geometric Dissections |
259 | -- | 267 | Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider. A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry |
269 | -- | 273 | Ryan B. Hayward. The Story of Perfectly Orderable Graphs |
275 | -- | 281 | Pavol Hell, Jarik Nesetril. On the Density of Trigraph Homomorphisms |
283 | -- | 290 | Hiro Ito, Midori Kobayashi, Gisaku Nakamura. Semi-Distance Codes and Steiner Systems |
291 | -- | 306 | Hiro Ito, Gisaku Nakamura, Satoshi Takata. Winning Ways of Weighted Poset Games |
307 | -- | 320 | Hiroshi Maehara. On Configurations of Solid Balls in 3-Space: Chromatic Numbers and Knotted Cycles |
321 | -- | 329 | David Rappaport. Maximal Area Sets and Harmony |
331 | -- | 341 | Sambuddha Roy, William Steiger. Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem |
343 | -- | 357 | Toshinori Sakai, Jorge Urrutia. Covering the Convex Quadrilaterals of Point Sets |
359 | -- | 378 | Takeshi Tokuyama. Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings |