Anders Dessmark

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