Volume 393,
Numbers 1-3,
March 2008
- Tian-Ming Bu, Qi Qi, Aries Wei Sun:
Unconditional competitive auctions with copy and budget constraints.
1-13
- Wolfgang W. Bein, José R. Correa, Xin Han:
A fast asymptotic approximation scheme for bin packing with rejection.
14-22
- Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
On different generalizations of episturmian words.
23-36
- Alessandro Ferrante, Mimmo Parente:
Mixed Nash equilibria in selfish routing problems with dynamic constraints.
37-53
- Piotr Berman, Bhaskar DasGupta:
Approximating the online set multicover problems via randomized winnowing.
54-71
- Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Competitive graph searches.
72-80
- Hao Li, Huifang Miao, Li Liu, Lian Li, Heping Zhang:
Energy conservation in wireless sensor networks and connectivity of graphs.
81-89
- Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-optimal gossiping among mobile agents.
90-101
- Lingfa Lu, Jinjiang Yuan, Liqi Zhang:
Single machine scheduling with release dates and job delivery to minimize the makespan.
102-108
- Peter Buchholz:
Bisimulation relations for weighted automata.
109-123
- Zhivko Prodanov Nedev, S. Muthukrishnan:
The Magnus-Derek game.
124-132
- Hiroshi Nagamochi, Takaharu Ohnishi:
Approximating a vehicle scheduling problem with time windows and handling times.
133-146
- Symeon Bozapalidis, Antonios Kalampakas:
Graph automata.
147-165
- Srecko Brlek, Damien Jamet, Geneviève Paquin:
Smooth words on 2-letter alphabets having same parity.
166-181
- Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The computational complexity of the parallel knock-out problem.
182-195
- Jean Berstel, Christophe Reutenauer:
Another proof of Soittola's theorem.
196-203
- Wen-Hung Kuo, Dar-Li Yang:
Parallel-machine scheduling with time dependent processing times.
204-210
- Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
Semi-online scheduling on two uniform processors.
211-219
- Alessandro Ferrante, Gopal Pandurangan, Kihong Park:
On the hardness of optimization in power-law graphs.
220-230
- Jussi Kujala, Tapio Elomaa:
The cost of offline binary search tree algorithms and the complexity of the request sequence.
231-239
- E. C. Xavier, Flávio Keidi Miyazawa:
The class constrained bin packing problem with applications to video-on-demand.
240-259
- Hervé Daudé, Marc Mézard, Thierry Mora, Riccardo Zecchina:
Pairs of SAT-assignments in random Boolean formulæ.
260-279
Notes
Last update Fri May 25 09:44:48 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
