Search dblp for Publications

export results for "toc:db/journals/tcs/tcs401.bht:"

 download as .bib file

@article{DBLP:journals/tcs/BachmatLM08,
  author    = {Eitan Bachmat and
               Tao{-}Kai Lam and
               Avner Magen},
  title     = {Analysis of set-up time models: {A} metric perspective},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {172--180},
  year      = {2008}
}
@article{DBLP:journals/tcs/BonifaciIL08,
  author    = {Vincenzo Bonifaci and
               Ugo Di Iorio and
               Luigi Laura},
  title     = {The complexity of uniform Nash equilibria and related regular subgraph
               problems},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {144--152},
  year      = {2008}
}
@article{DBLP:journals/tcs/BrennerS08,
  author    = {Janina A. Brenner and
               Guido Sch{\"{a}}fer},
  title     = {Group-strategyproof cost sharing mechanisms for makespan and other
               scheduling problems},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {96--106},
  year      = {2008}
}
@article{DBLP:journals/tcs/ChangLT08,
  author    = {Ching{-}Lueh Chang and
               Yuh{-}Dauh Lyuu and
               Yen{-}Wu Ti},
  title     = {The complexity of Tarski's fixed point theorem},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {228--235},
  year      = {2008}
}
@article{DBLP:journals/tcs/ChenFLY08,
  author    = {Zhi{-}Zhong Chen and
               Ze Feng and
               Minming Li and
               F. Frances Yao},
  title     = {Optimizing deletion cost for secure multicast key management},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {52--61},
  year      = {2008}
}
@article{DBLP:journals/tcs/ChepoiEV08,
  author    = {Victor Chepoi and
               Bertrand Estellon and
               Yann Vax{\`{e}}s},
  title     = {Approximation algorithms for forests augmentation ensuring two disjoint
               paths of bounded length},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {131--143},
  year      = {2008}
}
@article{DBLP:journals/tcs/CohenCJ08,
  author    = {David A. Cohen and
               Martin C. Cooper and
               Peter Jeavons},
  title     = {Generalising submodularity and horn clauses: Tractable optimization
               problems defined by tournament pair multimorphisms},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {36--51},
  year      = {2008}
}
@article{DBLP:journals/tcs/CostaN08,
  author    = {Jos{\'{e}} Carlos Costa and
               Concei{\c{c}}{\~{a}}o Nogueira},
  title     = {On bases of identities for the omega-variety generated by locally
               testable semigroups},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {206--216},
  year      = {2008}
}
@article{DBLP:journals/tcs/GiroudeauKMP08,
  author    = {Rodolphe Giroudeau and
               Jean{-}Claude K{\"{o}}nig and
               Farida Kamila Moulai and
               J{\'{e}}r{\^{o}}me Palaysi},
  title     = {Complexity and approximation for precedence constrained scheduling
               problems with large communication delays},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {107--119},
  year      = {2008}
}
@article{DBLP:journals/tcs/HemaspaandraRS08,
  author    = {Lane A. Hemaspaandra and
               J{\"{o}}rg Rothe and
               Amitabh Saxena},
  title     = {Enforcing and defying associativity, commutativity, totality, and
               strong noninvertibility for worst-case one-way functions},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {27--35},
  year      = {2008}
}
@article{DBLP:journals/tcs/HernichS08,
  author    = {Andr{\'{e}} Hernich and
               Nicole Schweikardt},
  title     = {Reversal complexity revisited},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {191--205},
  year      = {2008}
}
@article{DBLP:journals/tcs/HuoLW08,
  author    = {Yumei Huo and
               Joseph Y.{-}T. Leung and
               Xin Wang},
  title     = {Online scheduling of equal-processing-time task systems},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {85--95},
  year      = {2008}
}
@article{DBLP:journals/tcs/Ilcinkas08,
  author    = {David Ilcinkas},
  title     = {Setting port numbers for fast graph exploration},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {236--242},
  year      = {2008}
}
@article{DBLP:journals/tcs/KanjNTX08,
  author    = {Iyad A. Kanj and
               Luay Nakhleh and
               Cuong Than and
               Ge Xia},
  title     = {Seeing the trees and their branches in the network is hard},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {153--164},
  year      = {2008}
}
@article{DBLP:journals/tcs/KaragiorgosM08,
  author    = {Gregory Karagiorgos and
               Nikolaos M. Missirlis},
  title     = {Convergence of the diffusion method for weighted torus graphs using
               Fourier analysis},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {1--16},
  year      = {2008}
}
@article{DBLP:journals/tcs/Kauers08,
  author    = {Manuel Kauers},
  title     = {Solving difference equations whose coefficients are not transcendental},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {217--227},
  year      = {2008}
}
@article{DBLP:journals/tcs/Kuske08,
  author    = {Dietrich Kuske},
  title     = {Sch{\"{u}}tzenberger's theorem on formal power series follows
               from Kleene's theorem},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {243--248},
  year      = {2008}
}
@article{DBLP:journals/tcs/Laber08,
  author    = {Eduardo Sany Laber},
  title     = {A randomized competitive algorithm for evaluating priced {AND/OR}
               trees},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {120--130},
  year      = {2008}
}
@article{DBLP:journals/tcs/Marx08,
  author    = {D{\'{a}}niel Marx},
  title     = {Complexity of unique list colorability},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {62--76},
  year      = {2008}
}
@article{DBLP:journals/tcs/MichelPP08,
  author    = {Christian J. Michel and
               Giuseppe Pirillo and
               Mario A. Pirillo},
  title     = {A relation between trinucleotide comma-free codes and trinucleotide
               circular codes},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {17--26},
  year      = {2008}
}
@article{DBLP:journals/tcs/PuglisiSS08,
  author    = {Simon J. Puglisi and
               Jamie Simpson and
               William F. Smyth},
  title     = {How many runs can a string contain?},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {165--171},
  year      = {2008}
}
@article{DBLP:journals/tcs/Ting08,
  author    = {Hing{-}Fung Ting},
  title     = {A near optimal scheduler for on-demand data broadcasts},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {77--84},
  year      = {2008}
}
@article{DBLP:journals/tcs/Tsai08,
  author    = {Chang{-}Hsiung Tsai},
  title     = {Embedding of meshes in M{\"{o}}bius cubes},
  journal   = {Theor. Comput. Sci.},
  volume    = {401},
  number    = {1-3},
  pages     = {181--190},
  year      = {2008}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics