Volume 137, Number 1, 27 February 2004
- Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Preface.
1-2
- Martin Aigner:
Variants of the majority problem.
3-25
- Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic complexity of protein identification: combinatorics of weighted strings.
27-46
- Peter Damaschke:
Approximate location of relevant variables under the crossover distribution.
47-67
- Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc:
Searching with mobile agents in networks with liars.
69-85
- Gyula O. H. Katona:
Strong qualitative independence.
87-95
- Anthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin:
Trivial two-stage group testing for complexes using almost disjunct matrices.
97-107
- Gábor Wiener:
Recognition problems and communication complexity.
109-123
Volume 137, Number 2, 1 March 2004
- Roger Labahn, Arthur L. Liestman, Erich Prisner:
Preface.
125-126
- Martin Dietzfelbinger:
Gossiping and broadcasting versus computing functions in networks.
127-153
- Stefan Dobrev, Imrich Vrto:
Dynamic faults have small effect on broadcasting in hypercubes.
155-158
- Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch:
Spanners and message distribution in networks.
159-171
- Guillaume Fertin, André Raspaud:
A survey on Knödel graphs.
173-195
- Paola Flocchini, Elena Lodi, Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Dynamic monopolies in tori.
197-212
- H. Brendan McMahan, Andrzej Proskurowski:
Multi-source spanning trees: algorithms for minimizing source eccentricities.
213-222
- Toshinori Yamada, Kumiko Nomura, Shuichi Ueno:
Sparse networks tolerating random faults.
223-235
Volume 137, Number 3, 15 March 2004
- Pilu Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks.
237-266
- Wen An Liu, Zan Kan Nie:
Optimal detection of two counterfeit coins with two-arms balance.
267-291
- Hiroyuki Nagashima, Koichi Yamazaki:
Hiroyuki Nagashima and Koichi Yamazaki.
293-309
- Maurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott:
Cardinality constrained minimum cut problems: complexity and algorithms.
311-341
- Refael Hassin, Asaf Levin:
Minimum restricted diameter spanning trees.
343-357
- Nalan Gülpinar, Gregory Gutin, Gautam Mitra, A. Zverovitch:
Extracting pure network submatrices in linear programs using signed graphs.
359-372
Last update Wed May 22 17:26:46 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
