Mikael Hammar Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano: Degree-Optimal Routing for P2P Systems. Theory Comput. Syst. 45(1): 43-63 (2009)
2008
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar: F-Chord: Improved uniform routing on Chord. Networks 52(4): 325-332 (2008)
2006
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Mia Persson: The Online Freeze-Tag Problem. LATIN 2006: 569-579
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006)
2005
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano: Degree-Optimal Deterministic Routing for P2P Systems. ISCC 2005: 158-163
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRosario De Chiara, Mikael Hammar, Vittorio Scarano: A System for Virtual Directories Using Euler Diagrams. Electr. Notes Theor. Comput. Sci. 134: 33-53 (2005)
2004
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuisa Gargano, Mikael Hammar, Anna Pagh: Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. IPDPS 2004
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano: Brief announcement: degree: optimal deterministic routing for P2P systems. PODC 2004: 395
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano: F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). SIROCCO 2004: 89-98
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBjörn Brodén, Mikael Hammar, Bengt J. Nilsson: Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39(4): 299-319 (2004)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning spiders and light-splitting switches. Discrete Mathematics 285(1-3): 83-95 (2004)
2003
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuisa Gargano, Mikael Hammar: There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). ICALP 2003: 802-816
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003)
2002
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. Discrete & Computational Geometry 27(4): 635-651 (2002)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28(3): 291-312 (2002)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Sven Schuierer: Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9(1): 32-53 (2002)
2001
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBjörn Brodén, Mikael Hammar, Bengt J. Nilsson: Guarding lines and 2-link polygons is apx-hard. CCCG 2001: 45-48
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001: 124-133
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Sven Schuierer: Parallel searching on m rays. Comput. Geom. 18(3): 125-139 (2001)
2000
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars: On R-trees with Low Stabbing Number. ESA 2000: 167-178
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher Order Delaunay Triangulations. ESA 2000: 232-243
1999
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. ICALP 1999: 392-401
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson, Sven Schuierer: Parallel Searching on m Rays. STACS 1999: 132-142
1997
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikael Hammar, Bengt J. Nilsson: Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT 1997: 210-221

Coauthor Index

1Pankaj K. Agarwal [7] [10]
2Mark de Berg [5] [7] [10] [13]
3Björn Brodén [8] [17]
4Rosario De Chiara [21]
5Giovanni Chiola [26]
6Gennaro Cordasco [18] [19] [22] [25] [26]
7Luisa Gargano [14] [16] [18] [19] [20] [22] [25] [26]
8Joachim Gudmundsson [4] [5] [7] [10] [12] [13]
9Herman J. Haverkort [7] [10]
10Pavol Hell [16]
11Marc J. van Kreveld [4] [12]
12Alberto Negro [18] [25] [26]
13Bengt J. Nilsson [1] [2] [3] [6] [8] [9] [11] [15] [17] [23] [24]
14Mark H. Overmars [5] [13]
15Anna Pagh (Anna Östlin) [20]
16Mia Persson [15] [23] [24]
17Vittorio Scarano [18] [19] [21] [22] [25] [26]
18Sven Schuierer [2] [6] [9]
19Ladislav Stacho [16]
20Ugo Vaccaro [16]

Colors in the list of coauthors

Copyright © Tue Feb 9 14:55:32 2010 by Michael Ley (ley@uni-trier.de)