| 2004 | CPM | Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. | Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell |
| 2003 | ESA | Deterministic Rendezvous in Graphs. | Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc |
| 2002 | ESA | Optimal Graph Exploration without Good Maps. | Anders Dessmark, Andrzej Pelc |
| 2001 | STACS | Deterministic Radio Broadcasting at Low Cost. | Anders Dessmark, Andrzej Pelc |
| 2001 | SPAA | Tradeoffs between knowledge and time of communication in geometric radio networks. | Anders Dessmark, Andrzej Pelc |
| 1998 | STACS | Optimal Broadcasting in Almost Trees and Partial k-trees. | Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto |
| 1996 | CPM | Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. | Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe |
| 1996 | ESA | Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. | Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski |
| 1996 | MFCS | On the Power of Nonconservative PRAM. | Anders Dessmark, Andrzej Lingas |
| 1994 | MFCS | On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. | Anders Dessmark, Andrzej Lingas, Oscar Garrido |
| 1993 | ISAAC | The Maximum k-Dependent and f-Dependent Set Problem. | Anders Dessmark, Klaus Jansen, Andrzej Lingas |
| 1993 | STACS | Multi-List Ranking: Complexity and Applications. | Anders Dessmark, Andrzej Lingas, Anil Maheshwari |