Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephane Durocher

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 Lata Narayanan

> Home > Persons > Stephane Durocher

Publications

2015
[j25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DobrevDHGKKNOSU15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DobrevDHGKKNOSU15
Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579: 64-73 (2015)
2013
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/ciac/DobrevDHGKKNOSU13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/DobrevDHGKKNOSU13
Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia:
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182
2011
[j13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/DurocherJLN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/DurocherJLN11
Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. Comput. Geom. 44(5): 286-302 (2011)
2010
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/winet/DurocherKN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/winet/DurocherKN10
Stephane Durocher, David G. Kirkpatrick, Lata Narayanan:
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wirel. Networks 16(1): 227-235 (2010)
2009
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/join/DurocherKKN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/join/DurocherKKN09
Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan:
Balancing Traffic Load Using One-Turn Rectilinear Routing. J. Interconnect. Networks 10(1-2): 93-120 (2009)
2008
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/dialm/DurocherJLN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dialm/DurocherJLN08
Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. DIALM-POMC 2008: 79-86
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icdcn/DurocherKN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdcn/DurocherKN08
Stephane Durocher, David G. Kirkpatrick, Lata Narayanan:
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. ICDCN 2008: 546-557
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/DurocherKKN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/DurocherKKN08
Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan:
Balancing Traffic Load Using One-Turn Rectilinear Routing. TAMC 2008: 467-478

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.