1. Preface

   • David Avis

   OriginalPaper Pages: iii - iv

2. Jin Akiyama: A Friend and His Mathematics

   • M. Kano
   • Mari-Jo P. Ruiz
   • Jorge Urrutia

   OriginalPaper Pages: 1 - 39

3. Vašek Chvátal: A Very Short Introduction

   • David Avis
   • Adrian Bondy
   • Bruce Reed

   OriginalPaper Pages: 41 - 65

4. On the Number of Plane Geometric Graphs

   • Oswin Aichholzer
   • Thomas Hackl
   • Birgit Vogtenhuber

   OriginalPaper Pages: 67 - 84

5. Bichromatic Quadrangulations with Steiner Points

   • Victor Alvarez
   • Toshinori Sakai
   • Jorge Urrutia

   OriginalPaper Pages: 85 - 98

6. Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four

   • Kiyoshi Ando
   • Yoshimi Egawa

   OriginalPaper Pages: 99 - 115

7. Enumerating Non-crossing Minimally Rigid Frameworks

   • David Avis
   • Naoki Katoh
   • Shin-ichi Tanigawa

   OriginalPaper Pages: 117 - 134

8. Reduction for 3-Connected Graphs of Minimum Degree at Least Four

   • Sheng Bau
   • Akira Saito

   OriginalPaper Pages: 135 - 144

9. Opposite-Quadrant Depth in the Plane

   • Hervé Brönnimann
   • Jonathan Lenchner
   • János Pach

   OriginalPaper Pages: 145 - 152

10. Santa Claus’ Towers of Hanoi

    • Xiaomin Chen
    • Bin Tian
    • Lei Wang

    OriginalPaper Pages: 153 - 167

11. Efficient Many-To-Many Point Matching in One Dimension

    • Justin Colannino
    • Mirela Damian
    • Godfried Toussaint

    OriginalPaper Pages: 169 - 178

12. Epsilon-Unfolding Orthogonal Polyhedra

    • Mirela Damian
    • Robin Flatland
    • Joseph O’Rourke

    OriginalPaper Pages: 179 - 194

13. Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

    • Erik D. Demaine
    • Martin L. Demaine

    OriginalPaper Pages: 195 - 208

14. An O(n³)-Time Recognition Algorithm for hhds-free Graphs

    • Elaine M. Eschen
    • Chính T. Hoàng
    • R. Sritharan

    OriginalPaper Pages: 209 - 231

15. MIPping Closures: An Instant Survey

    • Matteo Fischetti
    • Andrea Lodi

    OriginalPaper Pages: 233 - 243

16. Unexpected Twists in Geometric Dissections

    • Greg N. Frederickson

    OriginalPaper Pages: 245 - 258

17. A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry

    • Hiroshi Fukuda
    • Nobuaki Mutoh
    • Doris Schattschneider

    OriginalPaper Pages: 259 - 267

18. The Story of Perfectly Orderable Graphs

    • Ryan B. Hayward

    OriginalPaper Pages: 269 - 273

19. On the Density of Trigraph Homomorphisms

    • Pavol Hell
    • Jarik Nešetřil

    OriginalPaper Pages: 275 - 281

20. Semi-Distance Codes and Steiner Systems

    • Hiro Ito
    • Midori Kobayashi
    • Gisaku Nakamura

    OriginalPaper Pages: 283 - 290

21. Winning Ways of Weighted Poset Games

    • Hiro Ito
    • Gisaku Nakamura
    • Satoshi Takata

    OriginalPaper Pages: 291 - 306

22. On Configurations of Solid Balls in 3-Space: Chromatic Numbers and Knotted Cycles

    • Hiroshi Maehara

    OriginalPaper Pages: 307 - 320

23. Maximal Area Sets and Harmony

    • David Rappaport

    OriginalPaper Pages: 321 - 329

24. Some Combinatorial and Algorithmic Applications of the Borsuk–Ulam Theorem

    • Sambuddha Roy
    • William Steiger

    OriginalPaper Pages: 331 - 341

25. Covering the Convex Quadrilaterals of Point Sets

    • Toshinori Sakai
    • Jorge Urrutia

    OriginalPaper Pages: 343 - 357

26. Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings

    • Takeshi Tokuyama

    OriginalPaper Pages: 359 - 378