@article{Bodlaender/98,
AUTHOR = {Bodlaender, Hans L.},
TITLE = {A partial $k$-arboretum of graphs with bounded treewidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {1-45},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Allender-Jiao-Mahajan-Vinay/98,
AUTHOR = {Allender, Eric and Jiao, Jia and Mahajan, Meena and Vinay, V.},
TITLE = {Non-commutative arithmetic circuits: Depth reduction and size lower bunds},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {47-86},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Beguin-Cresti/98,
AUTHOR = {B{\'{e}}guin, Philippe and Cresti, Antonella},
TITLE = {General in formation dispersal algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {87-105},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Demange-Grisoni-Paschos/98,
AUTHOR = {Demange, Marc and Grisoni, Pascal and Paschos, Vangelis Th.},
TITLE = {Differential approximation algorithms for some combinatorial optimization problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {107-122},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Downey-Fellows/98,
AUTHOR = {Downey, Rodney G. and Fellows, Michael R.},
TITLE = {Threshold dominating sets and an improved characterization of $W[2]$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {123-140},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Apolloni-Gentile/98,
AUTHOR = {Apolloni, B. and Gentile, C.},
TITLE = {Sample size lower bounds in PAC learning by algorithmic complexity theory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {141-162},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Aceto-Fokkink-Ingolfsdottir/98,
AUTHOR = {Aceto, Luca and Fokkink, Wan and Ing{\'{o}}lfsd{\'{o}}ttir, Anna},
TITLE = {On a question of A. Salomaa --- The equational theory of regular expressions over a singleton alphabet is not finitely based},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {163-178},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Blanchard-Kurka/98,
AUTHOR = {Blanchard, Fran{\c{c}}ois and K{\r{u}}rka, Petr},
TITLE = {Language complexity of rotations and Sturmian sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {179-193},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gargano-Rescigno/98a,
AUTHOR = {Gargano, Luisa and Rescigno, Adele A.},
TITLE = {Communication complexity of fault-tolerant information diffusion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {195-211},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Csuhaj-Varju-Kelemenova/98,
AUTHOR = {Csuhaj-Varj{\'u}, Erzs{\'{e}}bet and Kelemenov{\'{a}}, Alica},
TITLE = {Team behaviour in eco-grammar systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {213-224},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Zimand/98b,
AUTHOR = {Zimand, Marius},
TITLE = {On the size of classes with weak membership properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {225-235},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Amaldi-Kann/98,
AUTHOR = {Amaldi, Edoardo and Kann, Viggo},
TITLE = {On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {237-260},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Vuillon/98,
AUTHOR = {Vuillon, Laurent},
TITLE = {Combinatoire des motifs d'une suite Sturmienne bidimensionnelle},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {261-285},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Rossner-Seifert/98,
AUTHOR = {R{\"o}ssner, Carsten and Seifert, Jean-Pierre},
TITLE = {On the hardness of approximating shortest integer relations among rational numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {287-297},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Beaudry/98,
AUTHOR = {Beaudry, Martin},
TITLE = {Languages recognized by finite aperiodic groupoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {299-317},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Vaszil/98,
AUTHOR = {Vaszil, Gy{\"o}rgy},
TITLE = {On simulating non-returning PC grammar systems with returning systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {319-329},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Colbourn-Xue/98,
AUTHOR = {Colbourn, Charles J. and Xue, Guoliang},
TITLE = {A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {331-345},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Malesinska-Panconesi/98,
AUTHOR = {Malesi{\'n}ska, Ewa and Panconesi, Alessandro},
TITLE = {On the hardness of allocating frequencies for hybrid networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {347-363},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Breslauer/98a,
AUTHOR = {Breslauer, Dany},
TITLE = {On competitive on-line paging with lookahead},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {365-375},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Downarowicz-Lacroix/98,
AUTHOR = {Downarowicz, T. and Lacroix, Y.},
TITLE = {Merit factors and Morse sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {377-387},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Sengupta-Venkateswaran/98,
AUTHOR = {Sengupta, Rimli and Venkateswaran, H.},
TITLE = {A lower bound for monotone arithmetic circuits computing 0-1 permanent},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {209},
NUMBER = {1-2},
PAGES = {389-398},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}