| 2013 | SODA | Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. | Gerth Stlting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand |
| 2008 | WABI | Rapid Neighbour-Joining. | Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen |
| 2007 | APBC | Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stlting Brodal, Rolf Fagerberg |
| 2007 | APBC | Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. | Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stlting Brodal, Rolf Fagerberg |
| 2005 | WABI | Computing the Quartet Distance Between Trees of Arbitrary Degree. | Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers |
| 2004 | TACAS | Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method. | Thomas Mailund, Michael Westergaard |
| 2003 | ICFEM | Efficient Path Finding with the Sweep-Line Method Using External Storage. | Lars Michael Kristensen, Thomas Mailund |
| 2002 | FM | A Generalised Sweep-Line Method for Safety Properties. | Lars Michael Kristensen, Thomas Mailund |
| 2002 | FORTE | A Compositional Sweep-Line State Space Exploration Method. | Lars Michael Kristensen, Thomas Mailund |
| 2001 | TACAS | A Sweep-Line Method for State Space Exploration. | Sren Christensen, Lars Michael Kristensen, Thomas Mailund |