2007 |
30 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Algorithmica 48(3): 233-248 (2007) |
29 | EE | 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): 217-226 (2007) |
28 | EE | Anders Dessmark,
Andrzej Pelc:
Broadcasting in geometric radio networks.
J. Discrete Algorithms 5(1): 187-201 (2007) |
2006 |
27 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell,
Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
CATS 2006: 101-105 |
26 | EE | Anders Dessmark,
Pierre Fraigniaud,
Dariusz R. Kowalski,
Andrzej Pelc:
Deterministic Rendezvous in Graphs.
Algorithmica 46(1): 69-96 (2006) |
2004 |
25 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
CPM 2004: 220-229 |
24 | EE | Anders Dessmark,
Andrzej Lingas,
Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
SWAT 2004: 248-259 |
23 | | Anders Dessmark,
Andrzej Pelc:
Distributed Colouring and Communication in Rings with Local Knowledge.
Combinatorics, Probability & Computing 13(2): 123-136 (2004) |
22 | EE | Anders Dessmark,
Andrzej Pelc:
Optimal graph exploration without good maps.
Theor. Comput. Sci. 326(1-3): 343-362 (2004) |
2003 |
21 | EE | Anders Dessmark,
Pierre Fraigniaud,
Andrzej Pelc:
Deterministic Rendezvous in Graphs.
ESA 2003: 184-195 |
20 | EE | Anders Dessmark,
Andrzej Lingas,
Andrzej Pelc:
Trade-Offs Between Load and Degree in Virtual Path Layouts.
Parallel Processing Letters 13(3): 485-496 (2003) |
2002 |
19 | EE | Anders Dessmark,
Andrzej Pelc:
Optimal Graph Exploration without Good Maps.
ESA 2002: 374-386 |
18 | EE | Anders Dessmark,
Andrzej Pelc:
Deterministic radio broadcasting at low cost.
Networks 39(2): 88-97 (2002) |
2001 |
17 | | Anders Dessmark,
Andrzej Pelc:
Distributed coloring and communication in rings with local knowledge.
IPDPS 2001: 78 |
16 | EE | Anders Dessmark,
Andrzej Pelc:
Tradeoffs between knowledge and time of communication in geometric radio networks.
SPAA 2001: 59-66 |
15 | EE | Anders Dessmark,
Andrzej Pelc:
Deterministic Radio Broadcasting at Low Cost.
STACS 2001: 158-169 |
14 | EE | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation algorithms for maximum two-dimensional pattern matching.
Theor. Comput. Sci. 255(1-2): 51-62 (2001) |
2000 |
13 | EE | Anders Dessmark,
Andrzej Lingas,
Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
Algorithmica 27(3): 337-347 (2000) |
12 | EE | Anders Dessmark,
Andrzej Lingas,
Andrzej Proskurowski:
Maximum packing for k-connected partial k-trees in polynomial time.
Theor. Comput. Sci. 236(1-2): 179-191 (2000) |
1998 |
11 | | 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: 392-399 |
10 | | Anders Dessmark,
Andrzej Lingas,
Hans Olsson,
Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees.
STACS 1998: 432-443 |
9 | EE | Anders Dessmark,
Oscar Garrido,
Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching.
Inf. Process. Lett. 65(2): 107-109 (1998) |
8 | | Anders Dessmark,
Andrzej Lingas:
Improved Bounds for Integer Sorting in the EREW PRAM Model.
J. Parallel Distrib. Comput. 48(1): 64-70 (1998) |
1996 |
7 | | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
CPM 1996: 348-360 |
6 | | Anders Dessmark,
Andrzej Lingas,
Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
ESA 1996: 501-513 |
5 | | Anders Dessmark,
Andrzej Lingas:
On the Power of Nonconservative PRAM.
MFCS 1996: 303-311 |
1995 |
4 | EE | Anders Dessmark,
Andrzej Lingas,
Anil Maheshwari:
Multilist Layering: Complexity and Applications.
Theor. Comput. Sci. 141(1&2): 337-350 (1995) |
1994 |
3 | | Anders Dessmark,
Andrzej Lingas,
Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.
MFCS 1994: 316-325 |
1993 |
2 | | Anders Dessmark,
Klaus Jansen,
Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem.
ISAAC 1993: 88-98 |
1 | | Anders Dessmark,
Andrzej Lingas,
Anil Maheshwari:
Multi-List Ranking: Complexity and Applications.
STACS 1993: 306-316 |