Mariusz A. Fecko

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 Ibrahim Hökelek

> Home > Persons > Mariusz A. Fecko

Publications

2008
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/winet/HokelekUF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/winet/HokelekUF08
Ibrahim Hökelek, M. Ümit Uyar, Mariusz A. Fecko:
On stability analysis of virtual backbone in mobile ad hoc networks. Wirel. Networks 14(1): 87-102 (2008)
2007
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/comsware/FeckoHSS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/comsware/FeckoHSS07
Mariusz A. Fecko, Ibrahim Hökelek, Sunil Samtani, Aristides Staikos:
Controlled Dissemination Filter (CDF) for Integrated Link Selection Agents. COMSWARE 2007
2005
[c10]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ccn/HokelekUF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccn/HokelekUF05
Ibrahim Hökelek, M. Ümit Uyar, Mariusz A. Fecko:
Random-walk based analysis of virtual backbone in manets. Communications and Computer Networks 2005: 132-137
2004
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/iscc/FeckoKSUH04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscc/FeckoKSUH04
Mariusz A. Fecko, Ulas C. Kozat, Sunil Samtani, M. Ümit Uyar, Ibrahim Hökelek:
Dynamic survivable resource pooling in mobile ad-hoc networks. ISCC 2004: 196-201

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.