Citation graphs of interconnected communities

As a follow-up to my previous post about the citation graph of the Graph Drawing conference I computed a few more drawings with gephi. This time I have concentrated on visualizing connections between conferences with a similar scope. I improved my "springerlink-crawler". In the current version I first scan all the titles and then I scan for references where the matching is done by title. By this I will also detect references to journal versions if they have the same title. Again the citation graphs are very sparse, since they only reflect citations within the conferences. The data set is very likely not 100% accurate, but my impression is that it is good enough to illustrate a few interesting things.

Continue reading

Paper citation graph for GD

Here are a few pictures from the citation network of the Graph Drawing conference (GD). The nodes represent the papers that were published in GD. There are 821 papers in the data set. A edge is pointing from node a to node b, if the paper associated to node a cites the paper associated to node b. Of course this only encodes the citations within the GD conference. In particular, it ignores the fact that many papers were published subsequently as journal versions. However it is nice to expore this data. There are about 40% isolated nodes, and 20% of the nodes have only degree 1. The network has one big connected component and several very small components. I have generated a few pictures of the big component, listing only papers that have at least one GD citation. The size of the nodes reflect the in-degree (citations) of a paper.

Continue reading

SoCG14 call for videos/MM

I am part of the program committee of this years Video/Multimedia track for the Symposium of Computational Geometry (SoCG). The call for videos/MM presentations went out just a few days ago. Preparing a video means a lot of work, but it is also a lot of fun. I did a video by myself with Kevin Buchin (who is chairing the video PC) back in 2007. See here for the video and see the related animated gif below.

Continue reading

Graph Drawing 2013 in Bordeaux

Last week I attended the Graph Drawing conference in the wonderful city of Bordeaux, France. The conference was smoothly organized, they had sensational food and we had 30°C sunny weather. All lunches and the conference dinner were organized as buffets without seating. I enjoyed this very much, since I was able to meet much more people than in the usual setting. So thanks a lot for the organizers for hosting a great conference.

Continue reading

A Small Grid Embedding of the Dodecahedron

One of the main area of research are grid embeddings of convex 3d polytopes. By Steinitz' theorem every 3-connected planar graph can be embedded as a convex 3d polytope, even with integer coordinates. The question is, how large have the coordinates to be, in terms of the number of the vertices n. Although there were a series of improvements over the grid size of Steinitz' construction (of course he was not interested in getting integer or even small coordinates) the current best algorithm uses coordinates of size 2^{O(n)}. At least for triangulations (simplicial polytopes) I expect however that the necessary grid size is bounded by a polynomial. In fact, the current lower bound is only \Omega(n^{3/2}).

This post is about embedding a very special graph as a convex 3d polytope: the graph of the dodecahedron. In other words, what is the smallest grid in which one can embed a (nonregular) dodecahedron. The dodecahedron is interesting since it is the smallest example with no triangular and quadrilateral faces. This seems to be a more tricky case, at least for the current best algorithm that would embed the dodecahedron on the grid with z-coordinates ranging between zero and 11 083 163 098 782 678 334 820 352. Of course we can do better. Francisco Santos found an embedding that fits inside the 8 x 6 x 4 grid. Also, there is a very symmetric realization known as pyritohedron that needs a 12 x 12 x 12 grid.

Continue reading

Graph Drawing 2013 - Accepted Papers

I just saw that the accepted papers of this years Symposium of Graph Drawing have been posted (see here for titles and authors). I have one paper about grid embeddings of 3d polytopes via a realization of a dual polytope which is joint work with my student Alex.

I am looking forward to go to Bordeaux in September and will post my impressions.