Anders Dessmark (Former)
1 – 10 of 11
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
- 2006
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2004
-
Mark
Subexponential-time framework for optimal embeddings of graphs in integer lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Optimal graph exploration without good maps
(
- Contribution to journal › Article
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Distributed colouring and communication in rings with local knowledge
(
- Contribution to journal › Article
- 2003
-
Mark
Trade-offs between load and degree in virtual path layouts
(
- Contribution to journal › Article
-
Mark
Deterministic rendezvous in graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2002
-
Mark
Deterministic radio broadcasting at low cost
(
- Contribution to journal › Article
-
Mark
Optimal graph exploration without good maps
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding