MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Mikael Hammar" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

9 documents found, showing 1 through 9.

ATOM

Approximation Results for Kinetic Variants of TSP
by Mikael Hammar And, Mikael Hammar, Bengt J. Nilsson — 1999 — in Proc. International Colloquium on Automata, Languages, and Programming
…Approximation Results for Kinetic Variants of TSP Mikael Hammar and Bengt J. Nilsson Department…
Add To MetaCart

Guarding lines and 2-link polygons is apx-hard
by Mikael Hammar, Bengt J. Nilsson — 2001 — in 13th Canadian Conf. on Computational Geometry
… Guarding Lines and 2-Link Polygons is APX-Hard Bjo"rn Brode'n* Mikael Hammar* Bengt J. Nilsson…
Cited by 6 (0 self) – Add To MetaCart

Limiting flooding expenses in on-demand source-initiated protocols for mobile wireless networks
by Luisa Gargano, Mikael Hammar, Anna Östlin — 2004 — in 18th International Parallel and Distributed Processing Symposium
… Luisa Gargano ∗ Mikael Hammar † Anna Östlin ‡ Abstract In this paper we study on-demand source initiated…
Cited by 2 (0 self) – Add To MetaCart

Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms
by Mikael Hammar, Bengt J. Nilsson — 1997 — In Proc. 11th International Symposium on Fundamentals of Computation Theory
…Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms Mikael Hammar…
Cited by 8 (2 self) – Add To MetaCart

Approximation Results for Kinetic Variants of TSP
by Mikael Hammar, Bengt J. Nilsson — 1999 — in Proc. International Colloquium on Automata, Languages, and Programming
… Approximation Results for Kinetic Variants of TSP Mikael Hammar1 and Bengt J. Nilsson2 1…
Cited by 3 (0 self) – Add To MetaCart

Parallel Searching on m Rays
by Mikael Hammar, Bengt J. Nilsson, Sven Schuierer — 2001
…Parallel Searching on m Rays ? Mikael Hammar 1 , Bengt J. Nilsson 1 , and Sven Schuierer 2 1…
Cited by 4 (1 self) – Add To MetaCart

Improved Exploration of Rectilinear Polygons
by Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
… Improved Exploration of Rectilinear Polygons \Lambda Mikael Hammar y Bengt J. Nilsson z…
Add To MetaCart

Non-uniform deterministic routing on FChord(α
by Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano — 2004 — In Proceedings of first International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P ’04) (in conjunction with MASCOTS 2004) Volendam, The Nederlands
…Non-uniform deterministic routing on F-Chord(α) Gennaro Cordasco, Luisa Gargano, Mikael Hammar…
Cited by 2 (1 self) – Add To MetaCart

On R-trees with low stabbing number
by Mark De Berg, Joachim Gudmundsson, Mikael Hammar, Mark Overmars, Mark — 2002 — In Proc. Annual European Symposium on Algorithms
…On R-trees with low stabbing number Mark de Berg 1 , Joachim Gudmundsson 2 , Mikael Hammar 2…
Cited by 7 (2 self) – Add To MetaCart

Showing 1 through 9.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB