Volume 129,
Number 1,
15 June 2003
Algorithmic Aspects of Communication
- Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela:
Foreword.
1
Electronic Edition (link) BibTeX
- Amotz Bar-Noy, Juan A. Garay, Amir Herzberg:
Sharing Video on Demand.
3-30
Electronic Edition (link) BibTeX
- Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations.
31-47
Electronic Edition (link) BibTeX
- Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis:
Competitive Video on Demand Schedulers for Popular Movies.
49-61
Electronic Edition (link) BibTeX
- Shane Dye, Leen Stougie, Asgeir Tomasgard:
Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network.
63-81
Electronic Edition (link) BibTeX
- András Faragó, Áron Szentesi, Balázs Szviatovszki:
Inverse Optimization in High-speed Networks.
83-98
Electronic Edition (link) BibTeX
- Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick:
SONET/SDH Ring Assignment with Capacity Constraints.
99-128
Electronic Edition (link) BibTeX
- Janelle J. Harms, Chenjiang Hu:
Physical Network Design to Facilitate Capacity Reallocation.
129-153
Electronic Edition (link) BibTeX
- Carlo Mannino, Antonio Sassano:
An Enumerative Algorithm for the Frequency Assignment Problem.
155-169
Electronic Edition (link) BibTeX
- Weizhen Mao, David M. Nicol:
On k-ary n-cubes: Theory and Applications.
171-193
Electronic Edition (link) BibTeX
- Una-May O'Reilly, Nicola Santoro:
Tight Bounds for Synchronous Communication of Information Using Bits, Silence.
195-209
Electronic Edition (link) BibTeX
Volume 129,
Number 2-3,
1 August 2003
- Lali Barrière:
Symmetry properties of chordal rings of degree 3.
211-232
Electronic Edition (link) BibTeX
- András A. Benczúr:
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems.
233-262
Electronic Edition (link) BibTeX
- Martina Bosíková:
Minimum 3-geodetically connected graphs.
263-283
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Feodor F. Dragan:
On linear and circular structure of (claw, net)-free graphs.
285-303
Electronic Edition (link) BibTeX
- Peter Dankelmann, Ortrud Oellermann:
Bounds on the average connectivity of a graph.
305-318
Electronic Edition (link) BibTeX
- Italo J. Dejter, Oriol Serra:
Efficient dominating sets in Cayley graphs.
319-328
Electronic Edition (link) BibTeX
- Guoli Ding, Peter P. Chen:
Generating r-regular graphs.
329-343
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Petr A. Golovach:
Interval degree and bandwidth of a graph.
345-359
Electronic Edition (link) BibTeX
- Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree.
361-369
Electronic Edition (link) BibTeX
- Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti.
371-382
Electronic Edition (link) BibTeX
- Xiaofeng Guo, Fuji Zhang:
Planar k-cycle resonant graphs with k=1, 2.
383-397
Electronic Edition (link) BibTeX
- Harri Haanpää, Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players.
399-407
Electronic Edition (link) BibTeX
- Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
409-419
Electronic Edition (link) BibTeX
- Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma:
Using transforming matrices to generate DNA clone grids.
421-431
Electronic Edition (link) BibTeX
- Yoshiyuki Karuno, Hiroshi Nagamochi:
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
433-447
Electronic Edition (link) BibTeX
- Sandi Klavzar, Aleksander Vesel:
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers.
449-460
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Toshimasa Ishii:
On the minimum local-vertex-connectivity augmentation in graphs.
475-486
Electronic Edition (link) BibTeX
- M. Nakamura:
Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
487-498
Electronic Edition (link) BibTeX
- Eunseuk Oh, Jianer Chen:
On strong Menger-connectivity of star graphs.
499-511
Electronic Edition (link) BibTeX
- Gregory Gutin, Alek Vainshtein, Anders Yeo:
Domination analysis of combinatorial optimization problems.
513-520
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Raffaele Mosca:
On variations of P4-sparse graphs.
521-532
Electronic Edition (link) BibTeX
- Gregory Gutin, Anders Yeo:
Upper bounds on ATSP neighborhood size.
533-538
Electronic Edition (link) BibTeX
- Romeo Rizzi:
A simple minimum T-cut algorithm.
539-544
Electronic Edition (link) BibTeX
- John C. Wierman:
Pairs of graphs with site and bond percolation critical probabilities in opposite orders.
545-548
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:16 2009
by Michael Ley (ley@uni-trier.de)