@article{Bu-Qi-Sun/08,
AUTHOR = {Bu, Tian-Ming and Qi, Qi and Sun, Aries Wei},
TITLE = {Unconditional competitive auctions with copy and budget constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {1-13},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {unconditional competitive auction, copy and budget constraints, auctioneer-advantaged mechanism, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R0KTDH-1/2/bd237499c675291a3ee6481e1f5366e6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bein-Correa-Han/08,
AUTHOR = {Bein, Wolfgang and Correa, Jos{\'e} R. and Han, Xin},
TITLE = {A fast asymptotic approximation scheme for bin packing with rejection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {14-22},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation scheme, bin packing, knapsack problem, rejection penalty},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R2H7YG-2/2/d31fc0b6286ad4643d47b234dc4c7a7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-de_Luca-De_Luca-Zamboni/08,
AUTHOR = {Bucci, Michelangelo and de Luca, Aldo and De Luca, Alessandro and Zamboni, Luca Q.},
TITLE = {On different generalizations of Episturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {23-36},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, sturmian words, episturmian words, palindromes, palindrome closure, involutory antimorphisms, pseudopalindromes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R2H7YG-3/2/14e539f76ae63f119704320549e85e21},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferrante-Parente/08,
AUTHOR = {Ferrante, Alessandro and Parente, Mimmo},
TITLE = {Mixed Nash equilibria in selfish routing problems with dynamic constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {37-53},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {non-cooperative games, selfish routing, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R8MDWX-1/2/85d8917d7366e08bd42979ec0b5eb58d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berman-DasGupta/08,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar},
TITLE = {Approximating the online set multicover problems via randomized winnowing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {54-71},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set multicover, online algorithms, randomized algorithms, reverse engineering of biological networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-1/2/0d38b9233cbcfded2f9d37d3ba046b01},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bui-Xuan-Habib-Paul/08,
AUTHOR = {Bui-Xuan, Binh-Minh and Habib, Michel and Paul, Christophe},
TITLE = {Competitive graph searches},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {72-80},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph search, divide-and-conquer algorithm, common connected graph component, sandwich graph problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-7/2/44ba054dcb0fa2f61d0ce6f8e520e3f1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Miao-Liu-Li-Zhang/08,
AUTHOR = {Li, Hao and Miao, Huifang and Liu, Li and Li, Lian and Zhang, Heping},
TITLE = {Energy conservation in wireless sensor networks and connectivity of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {81-89},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {wireless sensor network, graph, connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-8/2/cd582446ed4d006da0adacfbfced97fd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Suzuki-Izumi-Ooshita-Kakugawa-Masuzawa/08,
AUTHOR = {Suzuki, Tomoko and Izumi, Taisuke and Ooshita, Fukuhito and Kakugawa, Hirotsugu and Masuzawa, Toshimitsu},
TITLE = {Move-optimal gossiping among mobile agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {90-101},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mobile agent, gossip, leader election, move complexity, distributed algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-9/2/06897440da2534b6f277af3673b0e94e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lu-Yuan-Zhang/08,
AUTHOR = {Lu, Lingfa and Yuan, Jinjiang and Zhang, Liqi},
TITLE = {Single machine scheduling with release dates and job delivery to minimize the makespan},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {102-108},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, job delivery, approximation algorithm, approximation ratio},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-3/2/87fd32b65ecf18204e109174eb41d023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Buchholz/08,
AUTHOR = {Buchholz, Peter},
TITLE = {Bisimulation relations for weighted automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {109-123},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, weighted automata, equivalence, bisimulation, congruence, aggregation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R8NBGT-1/2/8ee6eb4794bf89a420a26e82a614e0b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nedev-Muthukrishnan/08,
AUTHOR = {Nedev, Z. and Muthukrishnan, S.},
TITLE = {The Magnus-Derek game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {124-132},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {two-person games, mobile agent, network with inconsistent global sense of direction, algorithmic strategies, discrete mathematics, combinatorial number theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R8H1XR-3/2/7135ea1212a7834b9a0eaa9025d61f84},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagamochi-Ohnishi/08,
AUTHOR = {Nagamochi, Hiroshi and Ohnishi, Takaharu},
TITLE = {Approximating a vehicle scheduling problem with time windows and handling times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {133-146},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, digraphs, dynamic programming, graphs, np-hard, vsp},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-6/2/6135c1a4f9abe1859fa7f63e02a85495},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bozapalidis-Kalampakas/08,
AUTHOR = {Bozapalidis, Symeon and Kalampakas, Antonios},
TITLE = {Graph automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {147-165},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, directed hypergraphs, magmoids},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDS1W7-1/2/4b92c71606974bc683b3e32ac1b1bcb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brlek-Jamet-Paquin/08,
AUTHOR = {Brlek, S. and Jamet, D. and Paquin, G.},
TITLE = {Smooth words on 2-letter alphabets having same parity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {166-181},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {smooth words, kolakoski word, lyndon factorization, letter frequency},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDPYSN-1/2/ec52793c45f3069210c42ed5bb649087},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Johnson-Paulusma-Stewart/08,
AUTHOR = {Broersma, Hajo and Johnson, Matthew and Paulusma, Dani{\"e}l and Stewart, Iain A.},
TITLE = {The computational complexity of the parallel knock-out problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {182-195},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel knock-out, graphs, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDR1HN-1/2/a49d8e591e3c04cedbcf74aad45fb6bd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berstel-Reutenauer/08,
AUTHOR = {Berstel, Jean and Reutenauer, Christophe},
TITLE = {Another proof of Soittola's theorem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {196-203},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal power series, rational series, poles of rational fractions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-2/2/42f3329596dc26f79959f7789e627837},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuo-Yang/08,
AUTHOR = {Kuo, Wen-Hung and Yang, Dar-Li},
TITLE = {Parallel-machine scheduling with time dependent processing times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {204-210},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel machine, scheduling, makespan, total completion time, total load},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-3/2/3794fd5bebb38bb3928560e50c46a6e2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Angelelli-Speranza-Tuza/08,
AUTHOR = {Angelelli, Enrico and Speranza, Maria Grazia and Tuza, Zsolt},
TITLE = {Semi-online scheduling on two uniform processors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {211-219},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semi-online scheduling, uniform processors, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-4/2/cb115305581067a415b164bf552b94aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferrante-Pandurangan-Park/08,
AUTHOR = {Ferrante, Alessandro and Pandurangan, Gopal and Park, Kihong},
TITLE = {On the hardness of optimization in power-law graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {220-230},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {power-law graphs, graph optimization problems, np-hardness, graph construction algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-7/2/adb3f69605e964ea988d085b930cad7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kujala-Elomaa/08,
AUTHOR = {Kujala, Jussi and Elomaa, Tapio},
TITLE = {The cost of offline binary search tree algorithms and the complexity of the request sequence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {231-239},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {offline binary search tree algorithms, kolmogorov complexity, splay trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RFJ4P3-1/2/9878b87f43e69ed9ca2d9ee41314b482},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xavier-Miyazawa/08,
AUTHOR = {Xavier, E.C. and Miyazawa, F.K.},
TITLE = {The class constrained bin packing problem with applications to video-on-demand},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {240-259},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bin packing, data placement},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RJK15H-1/2/5a7818976957aa1f81ff4c9e8472099d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Daude-Mezard-Mora-Zecchina/08,
AUTHOR = {Daud{\'e}, Herv{\'e} and M{\'e}zard, Marc and Mora, Thierry and Zecchina, Riccardo},
TITLE = {Pairs of SAT-assignments in random Boolean formulae},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {260-279},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {satisfiability, clustering},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RKTNG7-1/2/274e656e3199b95ea9a1424cce2870e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang/08a,
AUTHOR = {Huang, Y.B.},
TITLE = {About the number of $C^\infty$-words of form $\tilde{w}xw$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {280-286},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolakoski sequence, derivative, $C^\infty$-words, $\Delta$-operator, $C^\omega$-words, $C^{bw}$-words, palindrome},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-2/2/895d4ad2a6a3ca472b5074da6651ae27},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tian-Fu-Yuan/08,
AUTHOR = {Tian, Ji and Fu, Ruyan and Yuan, Jinjiang},
TITLE = {A best on-line algorithm for single machine scheduling with small delivery times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {287-293},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, on-line algorithm, single machine, delivery time},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R68NM0-5/2/fff4ca2204fdaf04bee3ed7c59e2f03e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Segal-Zeitlin/08,
AUTHOR = {Segal, Michael and Zeitlin, Eli},
TITLE = {Computing closest and farthest points for a query segment},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {393},
NUMBER = {1-3},
PAGES = {294-300},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational geometry, data structure, segment dragging problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R8H1XR-2/2/460e8591d082fbb5d19ee7cd980b5f40},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}