The Maximum k-Dependent and f-Dependent Set Problem. - Anders Dessmark; Klaus Jansen; Andrzej Lingas (ISAAC, 1993)

Multi-List Ranking: Complexity and Applications. - Anders Dessmark; Andrzej Lingas; Anil Maheshwari (STACS, 1993)

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. - Anders Dessmark; Andrzej Lingas; Oscar Garrido (MFCS, 1994)

Multilist Layering: Complexity and Applications. - Anders Dessmark; Andrzej Lingas; Anil Maheshwari (Theor. Comput. Sci., 1995)

On the Power of Nonconservative PRAM. - Anders Dessmark; Andrzej Lingas (MFCS, 1996)

Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs. - Anders Dessmark; Carsten Dorgerloh; Andrzej Lingas; Juergen Wirtgen (IPPS/SPDP Workshops, 1998)

Optimal Broadcasting in Almost Trees and Partial k-trees. - Anders Dessmark; Andrzej Lingas; Hans Olsson; Hiroaki Yamamoto (STACS, 1998)

A Note on Parallel Complexity of Maximum f-Matching. - Anders Dessmark; Oscar Garrido; Andrzej Lingas (Inf. Process. Lett., 1998)

Improved Bounds for Integer Sorting in the EREW PRAM Model. - Anders Dessmark; Andrzej Lingas (J. Parallel Distributed Comput., 1998)

New Results on Combinatorial Algorithms. - Anders Dessmark (1998)

Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. - Anders Dessmark; Andrzej Lingas; Andrzej Proskurowski (Algorithmica, 2000)

Maximum packing for k-connected partial k-trees in polynomial time. - Anders Dessmark; Andrzej Lingas; Andrzej Proskurowski (Theor. Comput. Sci., 2000)

Distributed coloring and communication in rings with local knowledge. - Anders Dessmark; Andrzej Pelc (IPDPS, 2001)

Tradeoffs between knowledge and time of communication in geometric radio networks. - Anders Dessmark; Andrzej Pelc (SPAA, 2001)

Approximation algorithms for maximum two-dimensional pattern matching. - Srinivasa Rao Arikati; Anders Dessmark; Andrzej Lingas; Madhav V. Marathe (Theor. Comput. Sci., 2001)

Deterministic radio broadcasting at low cost. - Anders Dessmark; Andrzej Pelc (Networks, 2002)

Deterministic Rendezvous in Graphs. - Anders Dessmark; Pierre Fraigniaud; Andrzej Pelc (ESA, 2003)

Trade-Offs Between Load and Degree in Virtual Path Layouts. - Anders Dessmark; Andrzej Lingas; Andrzej Pelc (Parallel Process. Lett., 2003)

Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. - Anders Dessmark; Andrzej Lingas; Eva-Marta Lundell (SWAT, 2004)

Distributed Colouring and Communication in Rings with Local Knowledge. - Anders Dessmark; Andrzej Pelc (Comb. Probab. Comput., 2004)

Optimal graph exploration without good maps. - Anders Dessmark; Andrzej Pelc (Theor. Comput. Sci., 2004)

Deterministic Rendezvous in Graphs. - Anders Dessmark; Pierre Fraigniaud; Dariusz R. Kowalski; Andrzej Pelc (Algorithmica, 2006)

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (Algorithmica, 2007)

On the Approximability of Maximum and Minimum Edge Clique Partition Problems. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell; Mia Persson (Int. J. Found. Comput. Sci., 2007)

Broadcasting in geometric radio networks. - Anders Dessmark; Andrzej Pelc (J. Discrete Algorithms, 2007)