Anders Dessmark

According to our database, Anders Dessmark authored at least 24 papers between 1993 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Broadcasting in geometric radio networks.

Anders Dessmark, Andrzej Pelc

J. Discrete Algorithms, 2007

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson

Int. J. Found. Comput. Sci., 2007

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell

Algorithmica, 2007

2006

Deterministic Rendezvous in Graphs.

Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc

Algorithmica, 2006

2004

Optimal graph exploration without good maps.

Anders Dessmark, Andrzej Pelc

Theor. Comput. Sci., 2004

Distributed Colouring and Communication in Rings with Local Knowledge.

Anders Dessmark, Andrzej Pelc

Comb. Probab. Comput., 2004

Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.

Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell

Proceedings of the Algorithm Theory, 2004

2003

Trade-Offs Between Load and Degree in Virtual Path Layouts.

Anders Dessmark, Andrzej Lingas, Andrzej Pelc

Parallel Process. Lett., 2003

Deterministic Rendezvous in Graphs.

Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc

Proceedings of the Algorithms, 2003

2002

Deterministic radio broadcasting at low cost.

Anders Dessmark, Andrzej Pelc

Networks, 2002

2001

Approximation algorithms for maximum two-dimensional pattern matching.

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe

Theor. Comput. Sci., 2001

Tradeoffs between knowledge and time of communication in geometric radio networks.

Anders Dessmark, Andrzej Pelc

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Distributed coloring and communication in rings with local knowledge.

Anders Dessmark, Andrzej Pelc

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000

Maximum packing for k-connected partial k-trees in polynomial time.

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski

Theor. Comput. Sci., 2000

Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.

Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski

Algorithmica, 2000

1998

Improved Bounds for Integer Sorting in the EREW PRAM Model.

Anders Dessmark, Andrzej Lingas

J. Parallel Distributed Comput., 1998

A Note on Parallel Complexity of Maximum <i>f</i>-Matching.

Anders Dessmark, Oscar Garrido, Andrzej Lingas

Inf. Process. Lett., 1998

Optimal Broadcasting in Almost Trees and Partial k-trees.

Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto

Proceedings of the STACS 98, 1998

Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs.

Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen

Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1996

On the Power of Nonconservative PRAM.

Anders Dessmark, Andrzej Lingas

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Multilist Layering: Complexity and Applications.

Anders Dessmark, Andrzej Lingas, Anil Maheshwari

Theor. Comput. Sci., 1995

1994

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.

Anders Dessmark, Andrzej Lingas, Oscar Garrido

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

Multi-List Ranking: Complexity and Applications.

Anders Dessmark, Andrzej Lingas, Anil Maheshwari

Proceedings of the STACS 93, 1993

The Maximum k-Dependent and f-Dependent Set Problem.

Anders Dessmark, Klaus Jansen, Andrzej Lingas

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993