Last week I was attending the 43rd (!) International Workshop on Graph-Theoretic Concepts in Computer Science. The workshop took place in Heeze, NL which is a small town not far away from Eindhoven. The conference venue was a more remote hotel. 31 papers were presented in the workshop and we had 3 invited lectures. I will give you a short report on a few things that I found interesting.
Last week I was in Athens attending the 24th Symposium on Graph Drawing and Network Visualization. I will give a short report on what happened in Greece.
We are currently conducting an online user study. It would be a great help if you could support us by participating in this study. I can't say too much about the study here without influencing the results, but I promise I will write about the outcome and the design of our experiments when we are finished.
Almost a year ago I had a post about citation networks of interconnected communities. Simply speaking, I displayed a citation network (which paper cites which) of two related conferences. As conferences pairs I picked GD/WG, ICALP/ESA, and SWAT/WADS. All these conferences had their proceedings published by Springer, which made it easier to get the data via crawling through the springerlink portal.
Although the pictures were really nice (rendered in gephi) I wanted to have a more dynamic visualization. This weekend I finally found the time to prepare something. I picked the biggest component (82 nodes) in the SWAT/WADS network, since it was the smallest interesting (sub)graph I found. My goal was to let the user filter the data by year and get a dynamically increasing citation graph over time.
Today I stumbled upon a puzzle game where the goal is to layout a metro map. The game is called MiniMetro see here for the official webpage. It is currently under development in some sort of beta version - but it can already purchased. It runs on Windows, Mac, Ubuntu and Steam. Hey, a metro network drawing game, how cool is that. Of course, I had to give it a try (bought via the Humble Store).