default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Dessmark
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j14]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)- [j13]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) - [j12]Anders Dessmark, Andrzej Pelc:
Broadcasting in geometric radio networks. J. Discrete Algorithms 5(1): 187-201 (2007) - 2006
- [j11]Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) - [c16]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 - 2004
- [j10]Anders Dessmark, Andrzej Pelc:
Distributed Colouring and Communication in Rings with Local Knowledge. Comb. Probab. Comput. 13(2): 123-136 (2004) - [j9]Anders Dessmark, Andrzej Pelc:
Optimal graph exploration without good maps. Theor. Comput. Sci. 326(1-3): 343-362 (2004) - [c15]Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229 - [c14]Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT 2004: 248-259 - 2003
- [j8]Anders Dessmark, Andrzej Lingas, Andrzej Pelc:
Trade-Offs Between Load and Degree in Virtual Path Layouts. Parallel Process. Lett. 13(3): 485-496 (2003) - [c13]Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Graphs. ESA 2003: 184-195 - 2002
- [j7]Anders Dessmark, Andrzej Pelc:
Deterministic radio broadcasting at low cost. Networks 39(2): 88-97 (2002) - [c12]Anders Dessmark, Andrzej Pelc:
Optimal Graph Exploration without Good Maps. ESA 2002: 374-386 - 2001
- [j6]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) - [c11]Anders Dessmark, Andrzej Pelc:
Distributed coloring and communication in rings with local knowledge. IPDPS 2001: 78 - [c10]Anders Dessmark, Andrzej Pelc:
Tradeoffs between knowledge and time of communication in geometric radio networks. SPAA 2001: 59-66 - [c9]Anders Dessmark, Andrzej Pelc:
Deterministic Radio Broadcasting at Low Cost. STACS 2001: 158-169 - 2000
- [j5]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. Algorithmica 27(3): 337-347 (2000) - [j4]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)
1990 – 1999
- 1998
- [j3]Anders Dessmark, Oscar Garrido, Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching. Inf. Process. Lett. 65(2): 107-109 (1998) - [j2]Anders Dessmark, Andrzej Lingas:
Improved Bounds for Integer Sorting in the EREW PRAM Model. J. Parallel Distributed Comput. 48(1): 64-70 (1998) - [c8]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 - [c7]Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees. STACS 1998: 432-443 - 1996
- [c6]Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360 - [c5]Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. ESA 1996: 501-513 - [c4]Anders Dessmark, Andrzej Lingas:
On the Power of Nonconservative PRAM. MFCS 1996: 303-311 - 1995
- [j1]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995) - 1994
- [c3]Anders Dessmark, Andrzej Lingas, Oscar Garrido:
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. MFCS 1994: 316-325 - 1993
- [c2]Anders Dessmark, Klaus Jansen, Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem. ISAAC 1993: 88-98 - [c1]Anders Dessmark, Andrzej Lingas, Anil Maheshwari:
Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
