Stefan Funke

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alexander Kesselman

> Home > Persons > Stefan Funke

Publications

2007
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/winet/FunkeKKLS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/winet/FunkeKKLS07
Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal:
Improved approximation algorithms for connected sensor cover. Wirel. Networks 13(2): 153-164 (2007)
2006
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/tosn/FunkeKMS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tosn/FunkeKMS06
Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal:
A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Networks 2(3): 444-453 (2006)
2005
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/wimob/FunkeKMS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wimob/FunkeKMS05
Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal:
A simple improved distributed algorithm for minimum CDS in unit disk graphs. WiMob (2) 2005: 220-223
2004
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/adhoc-now/FunkeKLS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/adhoc-now/FunkeKLS04
Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal:
Improved Approximation Algorithms for Connected Sensor Cover. ADHOC-NOW 2004: 56-69

a service of

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.