The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anders Dessmark: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  29. On the Approximability of Maximum and Minimum Edge Clique Partition Problems. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002