Fun with Algorithms6th International Conference, FUN 2012,

The proceedings contain 37 papers. The topics discussed include: distributed algorithms by forgetful mobile robots; stability and metastability of the logit dynamics of strategic games; the vulcan game of kal-toh: finding or making triconnected planar subgraphs; Scandinavian thins on top of cake: on the smallest one-size-fits-all box; the kissing problem: how to end a gathering when everyone kisses everyone else goodbye; train marshalling is fixed parameter tractable; conflict-free graph orientations with parity constraints; picture-hanging puzzles; optimal sensor networks for area monitoring using rotating and beam sensors; the Byzantine brides problem; lean programs, branch mispredictions, and sorting; on computer integrated rationalized crossword puzzle manufacturing; solving single-digit sudoku subproblems; to satisfy impatient web surfers is hard; and making life easier for firefighters.