| 2023 | SiggraphA | GPU Programming Primitives for Computer Graphics. | Daniel Meister, Atsushi Yoshimura, Chih-Chen Kao |
| 2016 | IPIN | Analysis and evaluation of a particle filter for Wi-Fi azimuth and position tracking. | Christian Nickel, Jochen Seitz, Daniel Meister |
| 2015 | CIAC | End-Vertices of Graph Search Algorithms. | Dieter Kratsch, Mathieu Liedloff, Daniel Meister |
| 2012 | LATIN | Computing Minimum Geodetic Sets of Proper Interval Graphs. | Tnaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister |
| 2011 | COCOON | A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. | Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski |
| 2011 | CSR | Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2010 | ISAAC | Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. | Pinar Heggernes, Daniel Meister, Yngve Villanger |
| 2010 | TAMC | Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | IWOCA | Polar Permutation Graphs. | Tnaz Ekim, Pinar Heggernes, Daniel Meister |
| 2009 | TAMC | A Complete Characterisation of the Linear Clique-Width of Path Powers. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2009 | WG | Chordal Digraphs. | Daniel Meister, Jan Arne Telle |
| 2008 | ISAAC | Leaf Powers and Their Properties: Using the Trees. | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
| 2008 | LATIN | Bandwidth of Bipartite Permutation Graphs in Polynomial Time. | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
| 2008 | TAMC | Graphs of Linear Clique-Width at Most 3. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2007 | WG | A Characterisation of the Minimal Triangulations of Permutation Graphs. | Daniel Meister |
| 2007 | WG | Characterization and Recognition of Digraphs of Bounded Kelly-width. | Daniel Meister, Jan Arne Telle, Martin Vatshelle |
| 2005 | FCT | Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. | Daniel Meister |
| 2005 | WG | Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. | Daniel Meister |
| 2003 | MFCS | Error-Bounded Probabilistic Computations between MA and AM. | Elmar Bhler, Christian Glaer, Daniel Meister |