Theoretical Computer Science, Volume 393

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

• Y. B. Huang:
  About the number of C^infinity-words of form w~ × w. 280-286
  Electronic Edition (link) BibTeX
• Ji Tian, Ruyan Fu, Jinjiang Yuan:
  A best on-line algorithm for single machine scheduling with small delivery times. 287-293
  Electronic Edition (link) BibTeX
• Michael Segal, Eli Zeitlin:
  Computing closest and farthest points for a query segment. 294-300
  Electronic Edition (link) BibTeX