Anders Dessmark

Publication Activity (10 Years)

Years Active: 1993-2007
Publications (10 Years): 0

Publications

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48 (3) (2007)
Anders Dessmark, Andrzej Pelc
Broadcasting in geometric radio networks. J. Discrete Algorithms 5 (1) (2007)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18 (2) (2007)
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
Deterministic Rendezvous in Graphs. Algorithmica 46 (1) (2006)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS (2006)
Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT (2004)
Anders Dessmark, Andrzej Pelc
Optimal graph exploration without good maps. Theor. Comput. Sci. 326 (1-3) (2004)
Anders Dessmark, Andrzej Pelc
Distributed Colouring and Communication in Rings with Local Knowledge. Comb. Probab. Comput. 13 (2) (2004)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM (2004)
Anders Dessmark, Andrzej Lingas, Andrzej Pelc
Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. 13 (3) (2003)
Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
Deterministic Rendezvous in Graphs. ESA (2003)
Anders Dessmark, Andrzej Pelc
Deterministic radio broadcasting at low cost. Networks 39 (2) (2002)
Anders Dessmark, Andrzej Pelc
Optimal Graph Exploration without Good Maps. ESA (2002)
Anders Dessmark, Andrzej Pelc
Distributed coloring and communication in rings with local knowledge. IPDPS (2001)
Anders Dessmark, Andrzej Pelc
Tradeoffs between knowledge and time of communication in geometric radio networks. SPAA (2001)
Anders Dessmark, Andrzej Pelc
Deterministic Radio Broadcasting at Low Cost. STACS (2001)
Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. 255 (1-2) (2001)
Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27 (3) (2000)
Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
Maximum packing for k-connected partial k-trees in polynomial time. Theor. Comput. Sci. 236 (1-2) (2000)
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs. IPPS/SPDP Workshops (1998)
Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
Optimal Broadcasting in Almost Trees and Partial k-trees. STACS (1998)
Anders Dessmark, Andrzej Lingas
Improved Bounds for Integer Sorting in the EREW PRAM Model. J. Parallel Distributed Comput. 48 (1) (1998)
Anders Dessmark, Oscar Garrido, Andrzej Lingas
-Matching. Inf. Process. Lett. 65 (2) (1998)
Anders Dessmark, Andrzej Lingas
On the Power of Nonconservative PRAM. MFCS (1996)
Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA (1996)
Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM (1996)
Anders Dessmark, Andrzej Lingas, Anil Maheshwari
Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141 (1&2) (1995)
Anders Dessmark, Andrzej Lingas, Oscar Garrido
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS (1994)
Anders Dessmark, Klaus Jansen, Andrzej Lingas
The Maximum k-Dependent and f-Dependent Set Problem. ISAAC (1993)
Anders Dessmark, Andrzej Lingas, Anil Maheshwari
Multi-List Ranking: Complexity and Applications. STACS (1993)