Anders Dessmark

发表

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

Andrzej Lingas, Anders Dessmark, Andrzej Proskurowski, 2000, Theor. Comput. Sci..

Optimal Broadcasting in Almost Trees and Partial k-trees

Andrzej Lingas, Hiroaki Yamamoto, Hans Olsson, 1998, STACS.

Tradeoffs between knowledge and time of communication in geometric radio networks

Andrzej Pelc, Anders Dessmark, 2001, SPAA '01.

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

Andrzej Lingas, Anders Dessmark, Eva-Marta Lundell, 2004, SWAT.

On the Power of Nonconservative PRAM

Andrzej Lingas, Anders Dessmark, 1996, MFCS.

Deterministic Rendezvous in Graphs

Andrzej Pelc, Pierre Fraigniaud, Anders Dessmark, 2003 .

Trade-Offs Between Load and Degree in Virtual Path Layouts

Andrzej Pelc, Andrzej Lingas, Anders Dessmark, 2003, Parallel Process. Lett..

Deterministic radio broadcasting at low cost

Andrzej Pelc, Anders Dessmark, 2002, Networks.

The Maximum k-Dependent and f-Dependent Set Problem

Klaus Jansen, Andrzej Lingas, Anders Dessmark, 1993, ISAAC.

Multilist Layering: Complexity and Applications

Andrzej Lingas, Anil Maheshwari, Anders Dessmark, 1995, Theor. Comput. Sci..

Deterministic Rendezvous in Graphs

Andrzej Pelc, Pierre Fraigniaud, Dariusz R. Kowalski, 2003, Algorithmica.

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

Andrzej Lingas, Oscar Garrido, Anders Dessmark, 1994, MFCS.

Optimal graph exploration without good maps

Andrzej Pelc, Anders Dessmark, 2004, Theor. Comput. Sci..

Deterministic Radio Broadcasting at Low Cost

Andrzej Pelc, Anders Dessmark, 2001, STACS.

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

Andrzej Lingas, Anders Dessmark, Carsten Dorgerloh, 1997, IPPS/SPDP Workshops.

Approximation Algorithms for Maximum Two-Dimensional Pattern Matching

Madhav V. Marathe, Andrzej Lingas, Srinivasa Rao Arikati, 1996, CPM.

Multi-List Ranking: Complexity and Applications

Andrzej Lingas, Anil Maheshwari, Anders Dessmark, 1993, STACS.

Distributed coloring and communication in rings with local knowledge

Andrzej Pelc, Anders Dessmark, 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

Deterministic Rendezvous in Graphs

Andrzej Pelc, Pierre Fraigniaud, Anders Dessmark, 2003, ESA.

Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees

Andrzej Lingas, Anders Dessmark, Andrzej Proskurowski, 2000, Algorithmica.

Optimal graph exploration without good maps

Andrzej Pelc, Anders Dessmark, Andrzej Pelc, 2002, Theor. Comput. Sci..

Approximation algorithms for maximum two-dimensional pattern matching

Madhav V. Marathe, Andrzej Lingas, Srinivasa Rao Arikati, 2001, Theor. Comput. Sci..

Improved Bounds for Integer Sorting in the EREW PRAM Model

Andrzej Lingas, Anders Dessmark, 1998, J. Parallel Distributed Comput..

On the Approximability of Maximum and Minimum Edge Clique Partition Problems

Andrzej Lingas, Mia Persson, Jesper Jansson, 2006, CATS.

Distributed Colouring and Communication in Rings with Local Knowledge

Andrzej Pelc, Anders Dessmark, 2004, Comb. Probab. Comput..

A Note on Parallel Complexity of Maximum f-Matching

Andrzej Lingas, Anders Dessmark, Oscar Garrido, 1998, Inf. Process. Lett..

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

Andrzej Lingas, Jesper Jansson, Anders Dessmark, 2004, Algorithmica.

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

Andrzej Lingas, Jesper Jansson, Anders Dessmark, 2004, CPM.

Deterministic radio broadcasting at low cost A preliminary version of this paper appeared in the Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), February 2001, Dresden, Germany, LNCS 2010, pp. 158–156.

Andrzej Pelc, Anders Dessmark, 2002 .

Broadcasting in geometric radio networks

Andrzej Pelc, Anders Dessmark, Anders Dessmark, 2007, J. Discrete Algorithms.

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

Andrzej Lingas, Anders Dessmark, Andrzej Proskurowski, 1996, ESA.

Approximation algorithms for maximum two-dimensional pattern matching

Madhav V. Marathe, Andrzej Lingas, Srinivasa Rao Arikati, 1996 .