Table of contents for issues of Theoretical Computer Science

Last update: Thu Mar 22 12:00:55 MDT 2018                Valid HTML 3.2!

Volume 174, Number 1--2, March 15, 1997
Volume 218, Number 1, April 28, 1999
Volume 344, Number 2--3, November 17, 2005
Volume 380, Number 1--2, June 21, 2007
Volume 400, Number 1--3, June 9, 2008
Volume 410, Number 8--10, March 1, 2009
Volume 411, Number 1, January 1, 2010
Volume 411, Number 2, January 2, 2010
Volume 411, Number 3, January 6, 2010
Volume 411, Number 4--5, January 28, 2010
Volume 411, Number 6, February 6, 2010
Volume 411, Number 7--9, February 28, 2010
Volume 411, Number 10, March 4, 2010
Volume 411, Number 11--13, March 6, 2010
Volume 411, Number 14--15, March 17, 2010
Volume 411, Number 16--18, March 28, 2010
Volume 411, Number 19, April 6, 2010
Volume 411, Number 20, April 28, 2010
Volume 411, Number 21, May 6, 2010
Volume 411, Number 22--24, May 17, 2010
Volume 411, Number 25, May 28, 2010
Volume 411, Number 26--28, June 6, 2010
Volume 411, Number 29--30, June 17, 2010
Volume 411, Number 31--33, June 28, 2010
Volume 411, Number 34--36, July 17, 2010
Volume 411, Number 37, August 7, 2010
Volume 411, Number 38--39, August 28, 2010
Volume 411, Number 40--42, September 6, 2010
Volume 411, Number 43, October 9, 2010
Volume 411, Number 44--46, October 25, 2010
Volume 411, Number 47, October 29, 2010
Volume 411, Number 48, November 1, 2010
Volume 411, Number 49, November 5, 2010
Volume 411, Number 50, November 12, 2010
Volume 411, Number 51--52, December 4, 2010
Volume 412, Number 1--2, January 2, 2011
Volume 412, Number 3, January 21, 2011
Volume 412, Number 4--5, February 4, 2011
Volume 412, Number 6, February 16, 2011
Volume 412, Number 7, February 25, 2011
Volume 412, Number 8--10, March 4, 2011
Volume 412, Number 11, March 11, 2011
Volume 412, Number 12--14, March 18, 2011
Volume 412, Number 15, March 25, 2011
Volume 412, Number 16, April 1, 2011
Volume 412, Number 17, April 8, 2011
Volume 412, Number 18, April 15, 2011
Volume 412, Number 19, April 22, 2011
Volume 412, Number 20, April 29, 2011
Volume 412, Number 21, May 6, 2011
Volume 412, Number 22, May 13, 2011
Volume 412, Number 23, May 20, 2011
Volume 412, Number 24, May 27, 2011
Volume 412, Number 25, June 3, 2011
Volume 412, Number 26, June 10, 2011
Volume 412, Number 27, June 16, 2011
Volume 412, Number 28, June 20, 2011
Volume 412, Number 29, July 1, 2011
Volume 412, Number 30, July 8, 2011
Volume 412, Number 31, July 15, 2011
Volume 412, Number 32, July 22, 2011
Volume 412, Number 33, July 29, 2011
Volume 412, Number 34, August 5, 2011
Volume 412, Number 35, August 12, 2011
Volume 412, Number 36, August 19, 2011
Volume 412, Number 37, August 26, 2011
Volume 412, Number 38, September 2, 2011
Volume 412, Number 39, September 9, 2011
Volume 412, Number 40, September 16, 2011
Volume 412, Number 41, September 23, 2011
Volume 412, Number 42, September 30, 2011
Volume 412, Number 43, October 7, 2011
Volume 412, Number 44, October 14, 2011
Volume 412, Number 45, October 21, 2011
Volume 412, Number 46, October 28, 2011
Volume 412, Number 47, November 4, 2011
Volume 412, Number 48, November 11, 2011
Volume 412, Number 49, November 18, 2011
Volume 412, Number 50, November 25, 2011
Volume 412, Number 51, December 2, 2011
Volume 412, Number 52, December 9, 2011
Volume 413, Number 1, January 6, 2012
Volume 414, Number 1, January 13, 2012
Volume 415, Number 1, January 20, 2012
Volume 416, Number 1, January 27, 2012
Volume 417, Number 1, February 3, 2012
Volume 418, Number 1, February 10, 2012
Volume 419, Number 1, February 17, 2012
Volume 420, Number 1, February 24, 2012
Volume 421, Number 1, March 2, 2012
Volume 422, Number 1, March 9, 2012
Volume 423, Number 1, March 16, 2012
Volume 424, Number 1, March 23, 2012
Volume 425, Number 1, March 30, 2012
Volume 426--427, Number 1, April 6, 2012
Volume 428, Number 1, April 13, 2012
Volume 429, Number 1, April 20, 2012
Volume 430, Number 1, April 27, 2012
Volume 431, Number 1, May 4, 2012
Volume 432, Number 1, May 11, 2012
Volume 433, Number 1, May 18, 2012
Volume 434, Number 1, May 25, 2012
Volume 435, Number 1, June 1, 2012
Volume 436, Number 1, June 8, 2012
Volume 437, Number 1, June 15, 2012
Volume 438, Number 1, June 22, 2012
Volume 439, Number 1, June 29, 2012
Volume 440--441, 2012
Volume 442, Number 1, July 13, 2012
Volume 443, Number 1, July 20, 2012
Volume 444, Number 1, July 27, 2012
Volume 445, Number 1, August 3, 2012
Volume 446, Number 1, August 10, 2012
Volume 447, Number 1, August 17, 2012
Volume 448, Number 1, August 24, 2012
Volume 449, Number 1, August 31, 2012
Volume 450, Number 1, September 7, 2012
Volume 451, Number 1, September 14, 2012
Volume 452, Number 1, September 21, 2012
Volume 453, Number 1, September 28, 2012
Volume 454, Number 1, October 5, 2012
Volume 455, Number 1, October 12, 2012
Volume 456, Number 1, October 19, 2012
Volume 457, Number 1, October 26, 2012
Volume 458, Number 1, November 2, 2012
Volume 459, Number 1, November 9, 2012
Volume 460, Number 1, November 16, 2012
Volume 461, Number 1, November 23, 2012
Volume 462, Number 1, November 30, 2012
Volume 463, Number 1, December 7, 2012
Volume 464, Number 1, December 14, 2012
Volume 465, Number ??, December 21, 2012
Volume 466, Number ??, December 28, 2012
Volume 467, Number ??, January 7, 2013
Volume 468, Number ??, January 14, 2013
Volume 469, Number ??, January 21, 2013
Volume 470, Number ??, January 28, 2013
Volume 471, Number ??, February 3, 2013
Volume 472, Number ??, February 11, 2013
Volume 473, Number ??, February 18, 2013
Volume 474, Number ??, February 25, 2013
Volume 475, Number ??, March 4, 2013
Volume 476, Number ??, March 11, 2013
Volume 477, Number ??, March 18, 2013
Volume 478, Number ??, March 25, 2013
Volume 479, Number ??, April 1, 2013
Volume 480, Number ??, April 8, 2013
Volume 481, Number ??, April 15, 2013
Volume 482, Number ??, April 22, 2013
Volume 483, Number ??, April 29, 2013
Volume 484, Number ??, May 6, 2013
Volume 485, Number ??, May 13, 2013
Volume 486, Number ??, May 20, 2013
Volume 487, Number ??, May 27, 2013
Volume 488, Number ??, June 3, 2013
Volume 489--490, Number ??, June 10, 2013
Volume 491, Number ??, June 17, 2013
Volume 492, Number ??, June 24, 2013
Volume 493, Number ??, July 1, 2013
Volume 494, Number ??, July 8, 2013
Volume 495, Number ??, July 15, 2013
Volume 496, Number ??, July 22, 2013
Volume 497, Number ??, July 29, 2013
Volume 498, Number ??, August 5, 2013
Volume 499, Number ??, August 12, 2013
Volume 501, Number ??, August 27, 2013
Volume 502, Number ??, September 2, 2013
Volume 503, Number ??, September 9, 2013
Volume 500, Number ??, August 19, 2013
Volume 504, Number ??, September 16, 2013
Volume 505, Number ??, September 23, 2013
Volume 506, Number ??, September 30, 2013
Volume 507, Number ??, October 7, 2013
Volume 508, Number ??, October 14, 2013
Volume 509, Number ??, October 21, 2013
Volume 510, Number ??, October 28, 2013
Volume 511, Number ??, November 4, 2013
Volume 512, Number ??, November 11, 2013
Volume 513, Number ??, November 18, 2013
Volume 514, Number ??, November 25, 2013
Volume 515, Number ??, January 2, 2014
Volume 516, Number ??, January 9, 2014
Volume 517, Number ??, January 16, 2014
Volume 518, Number ??, January 23, 2014
Volume 519, Number ??, January 30, 2014
Volume 520, Number ??, February 6, 2014
Volume 521, Number ??, February 13, 2014
Volume 522, Number ??, February 20, 2014
Volume 523, Number ??, February 27, 2014
Volume 524, Number ??, March 6, 2014
Volume 525, Number ??, March 13, 2014
Volume 526, Number ??, March 20, 2014
Volume 527, Number ??, March 27, 2014
Volume 528, Number ??, April 3, 2014
Volume 529, Number ??, April 10, 2014
Volume 530, Number ??, April 17, 2014
Volume 531, Number ??, April 24, 2014
Volume 532, Number ??, May 1, 2014
Volume 533, Number ??, May 8, 2014
Volume 534, Number ??, May 15, 2014
Volume 535, Number ??, May 22, 2014
Volume 536, Number ??, May 29, 2014
Volume 537, Number ??, June 5, 2014
Volume 538, Number ??, June 12, 2014
Volume 539, Number ??, June 19, 2014
Volume 540--541, Number ??, June 26, 2014
Volume 542, Number ??, July 3, 2014
Volume 543, Number ??, July 10, 2014
Volume 544, Number ??, August 7, 2014
Volume 545, Number ??, August 14, 2014
Volume 546, Number ??, August 21, 2014
Volume 547, Number ??, August 28, 2014
Volume 548, Number ??, September 4, 2014
Volume 549, Number ??, September 11, 2014
Volume 550, Number ??, September 18, 2014
Volume 551, Number ??, September 25, 2014
Volume 552, Number ??, October 2, 2014
Volume 553, Number ??, October 9, 2014
Volume 554, Number ??, October 16, 2014
Volume 555, Number ??, October 23, 2014
Volume 556, Number ??, October 30, 2014
Volume 557, Number ??, November 6, 2014
Volume 558, Number ??, November 13, 2014
Volume 559, Number ??, November 20, 2014
Volume 560 (part 1), Number ??, December 4, 2014
Volume 560 (part 2), Number ??, December 4, 2014
Volume 560 (part 3), Number ??, December 4, 2014
Volume 560 (part 1), Number ??, December 4, 2014
Volume 560 (part 2), Number ??, December 4, 2014
Volume 560 (part 3), Number ??, December 4, 2014
Volume 562, Number ??, January 11, 2015
Volume 602, Number ??, October 18, 2015
Volume 618, Number ??, March 7, 2016
Volume 648, Number ??, October 4, 2016
Volume 651, Number ??, October 25, 2016
Volume 683, Number ??, June 30, 2017


Theoretical Computer Science
Volume 174, Number 1--2, March 15, 1997

               Petr K\ocircurka   On topological dynamics of Turing
                                  machines . . . . . . . . . . . . . . . . 203--216


Theoretical Computer Science
Volume 218, Number 1, April 28, 1999

        Aviezri S. Fraenkel and   
                  Jamie Simpson   The exact number of squares in Fibonacci
                                  words  . . . . . . . . . . . . . . . . . 95--106


Theoretical Computer Science
Volume 344, Number 2--3, November 17, 2005

          David Soloveichik and   
                   Erik Winfree   The computational power of Benenson
                                  automata . . . . . . . . . . . . . . . . 279--297


Theoretical Computer Science
Volume 380, Number 1--2, June 21, 2007

         Franck van Breugel and   
            Claudio Hermida and   
             Michael Makkai and   
                  James Worrell   Recursively defined metric spaces
                                  without contraction  . . . . . . . . . . 143--163


Theoretical Computer Science
Volume 400, Number 1--3, June 9, 2008

               Achim Blumensath   On the structure of graphs in the Caucal
                                  hierarchy  . . . . . . . . . . . . . . . 19--45


Theoretical Computer Science
Volume 410, Number 8--10, March 1, 2009

                 Zhao Zhang and   
               Xiaofeng Gao and   
                       Weili Wu   Algorithms for connected set cover
                                  problem and fault-tolerant connected set
                                  cover problem  . . . . . . . . . . . . . 812--817


Theoretical Computer Science
Volume 411, Number 1, January 1, 2010

                Laurent Lyaudet   NP-hard and linear variants of
                                  hypergraph partitioning  . . . . . . . . 10--21
             Kohtaro Tadaki and   
          Tomoyuki Yamakami and   
                 Jack C. H. Lin   Theory of one-tape linear-time Turing
                                  machines . . . . . . . . . . . . . . . . 22--43
               Leah Epstein and   
                   Rob van Stee   Maximizing the minimum load for selfish
                                  agents . . . . . . . . . . . . . . . . . 44--57
   Achour Mostéfaoui and   
              Michel Raynal and   
               Corentin Travers   Narrowing power vs efficiency in
                                  synchronous set agreement: Relationship,
                                  algorithms and lower bound . . . . . . . 58--69
               Aldo de Luca and   
                Luca Q. Zamboni   On graphs of central episturmian words   70--90
              Gem Stapleton and   
                 John Howse and   
                  Peter Rodgers   A graph theoretic approach to general
                                  Euler diagram drawing  . . . . . . . . . 91--112
             Markus Müller   Stationary algorithmic probability . . . 113--130
              Marek Chrobak and   
            Ji\vrí Sgall   Three results on frequency assignment in
                                  linear cellular networks . . . . . . . . 131--137
             Martin Anthony and   
                   Joel Ratsaby   Maximal width learning of binary
                                  functions  . . . . . . . . . . . . . . . 138--147
                 D. Merlini and   
                   R. Sprugnoli   The relevant prefixes of coloured
                                  Motzkin walks: an average case analysis  148--163
              Hartwig Bosse and   
             Jaroslaw Byrka and   
             Evangelos Markakis   New algorithms for approximate Nash
                                  equilibria in bimatrix games . . . . . . 164--173
              Xiang-Yang Li and   
                  Zheng Sun and   
               WeiZhao Wang and   
                Xiaowen Chu and   
               ShaoJie Tang and   
                        Ping Xu   Mechanism design for set cover games
                                  with selfish element agents  . . . . . . 174--187
               Ulrich Laube and   
                Markus E. Nebel   Maximum likelihood analysis of
                                  algorithms and data structures . . . . . 188--212
               Paolo D'Arco and   
          Alfredo De Santis and   
          Anna Lisa Ferrara and   
                Barbara Masucci   Variations on a theme by Akl and Taylor:
                                  Security and tradeoffs . . . . . . . . . 213--227
                        Yun Liu   Compositions of maximal codes  . . . . . 228--238
              Allan Borodin and   
                 Joan Boyar and   
              Kim S. Larsen and   
           Nazanin Mirmohammadi   Priority algorithms for graph
                                  optimization problems  . . . . . . . . . 239--258
             David Richeson and   
               Paul Winkler and   
                    Jim Wiseman   Itineraries of rigid rotations and
                                  diffeomorphisms of the circle  . . . . . 259--265
       Véronique Terrier   Simulation of one-way cellular automata
                                  by Boolean circuits  . . . . . . . . . . 266--276
                 Mingen Lin and   
                  Yang Yang and   
                      Jinhui Xu   On Lazy Bin Covering and Packing
                                  problems . . . . . . . . . . . . . . . . 277--284
           Md. Kamrul Hasan and   
          Mohammad Kaykobad and   
              Young-Koo Lee and   
                  Sungyoung Lee   A comprehensive analysis of degree based
                                  condition for Hamiltonian cycles . . . . 285--287
            Andrzej Chmielowiec   Fixed points of the RSA encryption
                                  algorithm  . . . . . . . . . . . . . . . 288--292
                      Ye Du and   
                 Rahul Sami and   
                     Yaoyun Shi   Path auctions with multiple edge
                                  ownership  . . . . . . . . . . . . . . . 293--300
          Dorit S. Hochbaum and   
                     Asaf Levin   Covering the edges of bipartite graphs
                                  using $K_{2,2}$ graphs . . . . . . . . . v--x

Theoretical Computer Science
Volume 411, Number 2, January 2, 2010

                Ken Kaneiwa and   
                      Ken Satoh   On the complexities of consistency
                                  checking for restricted UML class
                                  diagrams . . . . . . . . . . . . . . . . 301--323
                Ken-etsu Fujita   CPS-translation as adjoint . . . . . . . 324--340
                S. L. Bloom and   
                 Z. Ésik   A Mezei--Wright theorem for categorical
                                  algebras . . . . . . . . . . . . . . . . 341--359
                    Lan Lin and   
           Stacy J. Prowell and   
                 Jesse H. Poore   An axiom system for sequence-based
                                  specification  . . . . . . . . . . . . . 360--376
               Ugo Dal Lago and   
              Andrea Masini and   
               Margherita Zorzi   Quantum implicit computational
                                  complexity . . . . . . . . . . . . . . . 377--409
             Michele Pagani and   
       Lorenzo Tortora de Falco   Strong normalization property for second
                                  order linear logic . . . . . . . . . . . 410--444
            Manuel Bodirsky and   
                     Hubie Chen   Peek arc consistency . . . . . . . . . . 445--453
             Laura Bozzelli and   
                Ruggero Lanotte   Complexity and succinctness issues for
                                  linear-time hybrid logics  . . . . . . . 454--469
            Patrick Baillot and   
                  Damiano Mazza   Linear logic by levels and bounded time
                                  complexity . . . . . . . . . . . . . . . 470--503
                M. Alpuente and   
                 S. Escobar and   
                B. Gramlich and   
                       S. Lucas   On-demand strategy annotations
                                  revisited: an improved on-demand
                                  evaluation strategy  . . . . . . . . . . 504--541
         Alessandro Romanel and   
                 Corrado Priami   On the computational power of BlenX  . . 542--565
              Robert M. Hierons   Canonical finite state machines for
                                  distributed systems  . . . . . . . . . . 566--580

Theoretical Computer Science
Volume 411, Number 3, January 6, 2010

            Oscar H. Ibarra and   
      Juhani Karhumäki and   
              Alexander Okhotin   On stateless multihead automata:
                                  Hierarchies and the emptiness problem    581--593
          Phan Thi Ha Duong and   
             Tran Thi Thu Huong   On the stability of Sand Piles Model . . 594--601
            Bart Kastermans and   
                  Steffen Lempp   Comparing notions of randomness  . . . . 602--616
             Elena Czeizler and   
                  Lila Kari and   
                Shinnosuke Seki   On a special class of primitive words    617--630
            Christian Mathissen   Definable transductions and weighted
                                  logics for texts . . . . . . . . . . . . 631--659
            Vittorio Bil\`o and   
             Angelo Fanelli and   
           Michele Flammini and   
               Luca Moscardelli   When ignorance helps: Graphical
                                  multicast cost sharing games . . . . . . 660--671
               Wanyong Tian and   
                 Minming Li and   
                    Enhong Chen   Energy optimal schedules for jobs with
                                  multiple active intervals  . . . . . . . 672--676
Colm ÓDúnlaing and   
               Natalie Schluter   A shorter proof that palindromes are not
                                  a Church--Rosser language, with
                                  extensions to almost-confluent and
                                  preperfect Thue systems  . . . . . . . . 677--690
                Mario Boley and   
Tamás Horváth and   
         Axel Poigné and   
                  Stefan Wrobel   Listing closed sets of strongly
                                  accessible set systems with applications
                                  to data mining . . . . . . . . . . . . . 691--700
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 4--5, January 28, 2010

Erzsébet Csuhaj-Varjú and   
      Zoltán Ésik   Preface  . . . . . . . . . . . . . . . . 701--701
      Henrik Björklund and   
              Thomas Schwentick   On notions of regularity for data
                                  languages  . . . . . . . . . . . . . . . 702--715
        Gaëlle Brevier and   
                Romeo Rizzi and   
       Stéphane Vialette   Complexity issues in color-preserving
                                  graph embeddings . . . . . . . . . . . . 716--729
             Robert Brijder and   
             Miika Langille and   
                      Ion Petre   Extended strings and graphs for simple
                                  gene assembly  . . . . . . . . . . . . . 730--738
                 Jin-Yi Cai and   
                      Pinyan Lu   On blockwise symmetric signatures for
                                  matchgates . . . . . . . . . . . . . . . 739--750
               Thomas Colcombet   Factorization forests for infinite words
                                  and applications to countable scattered
                                  linear orderings . . . . . . . . . . . . 751--764
        Jörg Endrullis and   
          Clemens Grabmayer and   
           Dimitri Hendriks and   
              Ariya Isihara and   
                Jan Willem Klop   Productivity of stream definitions . . . 765--782
         Edith Hemaspaandra and   
       Lane A. Hemaspaandra and   
                Till Tantau and   
                 Osamu Watanabe   On the complexity of kings . . . . . . . 783--798
           Michael Hoffmann and   
              Richard M. Thomas   Notions of hyperbolicity in monoids  . . 799--811
              Martin Kutrib and   
                Andreas Malcher   Real-time reversible iterative arrays    812--822
           Andrea Sattler-Klein   Some complexity results for prefix
                                  Gröbner bases in free monoid rings  . . . 823--833
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 6, February 6, 2010

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 835--836
               Shlomi Dolev and   
                   Hen Fitoussi   Masking traveling beams: Optical
                                  solutions for NP-complete problems,
                                  trading space for time . . . . . . . . . 837--853
           Tobias Friedrich and   
           Nils Hebbinghaus and   
                  Frank Neumann   Plateaus can be harder in
                                  multi-objective optimization . . . . . . 854--864
                Paola Bonizzoni   Constants and label-equivalence: a
                                  decision procedure for reflexive regular
                                  splicing languages . . . . . . . . . . . 865--877
         Antonio E. Porreca and   
            Giancarlo Mauri and   
                Claudio Zandron   Non-confluence in divisionless P systems
                                  with active membranes  . . . . . . . . . 878--887
              Xingchang Liu and   
               Xiaofan Yang and   
                Shenglin Li and   
                      Yong Ding   Solving the minimum bisection problem
                                  using a biologically inspired
                                  computational model  . . . . . . . . . . 888--896
             Robert Brijder and   
          Hendrik Jan Hoogeboom   Combining overlap and containment for
                                  gene assembly in ciliates  . . . . . . . 897--905
               Linqiang Pan and   
                Gheorghe P\uaun   Spiking neural P systems: an improved
                                  normal form  . . . . . . . . . . . . . . 906--918
               J. Mark Keil and   
                   Jing Liu and   
                  Ian McQuillan   Algorithmic properties of ciliate
                                  sequence alignment . . . . . . . . . . . 919--925
               Tianshi Chen and   
                     Jun He and   
              Guoliang Chen and   
                        Xin Yao   Choosing selection pressure for wide-gap
                                  problems . . . . . . . . . . . . . . . . 926--934
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 7--9, February 28, 2010

           Reinhard Pichler and   
                 Vadim Savenkov   Towards practical feasibility of core
                                  computation in data exchange . . . . . . 935--957
              Mauro Mezzini and   
               Marina Moscarini   Simple algorithms for minimal
                                  triangulation of a graph and backward
                                  selection of a decomposable Markov
                                  network  . . . . . . . . . . . . . . . . 958--966
             Katerina Asdre and   
        Stavros D. Nikolopoulos   A polynomial solution to the
                                  $k$-fixed-endpoint path cover problem on
                                  proper interval graphs . . . . . . . . . 967--975
          Matthew de Brecht and   
               Akihiro Yamamoto   Mind change complexity of inferring
                                  unbounded unions of restricted pattern
                                  languages from positive data . . . . . . 976--985
             Tien-Ching Lin and   
                      D. T. Lee   Efficient algorithms for the sum
                                  selection problem and $k$ maximum sums
                                  problem  . . . . . . . . . . . . . . . . 986--994
           Sadish Sadasivam and   
                  Huaming Zhang   NP-Completeness of $s$ $t$-orientations
                                  for plane graphs . . . . . . . . . . . . 995--1003
              Elaine Render and   
                  Mark Kambites   Semigroup automata with rational initial
                                  and terminal sets  . . . . . . . . . . . 1004--1012
          Serafino Cicerone and   
       Gianlorenzo D'Angelo and   
        Gabriele Di Stefano and   
               Daniele Frigioni   Partially dynamic efficient algorithms
                                  for distributed shortest paths . . . . . 1013--1037
                Yukun Cheng and   
                Liying Kang and   
                   Changhong Lu   The pos/neg-weighted $1$-median problem
                                  on tree graphs with subtree-shaped
                                  customers  . . . . . . . . . . . . . . . 1038--1044
             Fedor V. Fomin and   
              Serge Gaspers and   
             Dieter Kratsch and   
           Mathieu Liedloff and   
                  Saket Saurabh   Iterative compression and exact
                                  algorithms . . . . . . . . . . . . . . . 1045--1053
           Petra Berenbrink and   
                 Oliver Schulte   Evolutionary equilibrium in Bayesian
                                  routing games: Specialization and niche
                                  formation  . . . . . . . . . . . . . . . 1054--1074
                 P. Di Lena and   
                     L. Margara   On the undecidability of the limit
                                  behavior of Cellular Automata  . . . . . 1075--1084
             C. Goodman-Strauss   A hierarchical strongly aperiodic set of
                                  tiles in the hyperbolic plane  . . . . . 1085--1093
                Zhenbo Wang and   
                Wenxun Xing and   
                Shu-Cherng Fang   Two-group knapsack game  . . . . . . . . 1094--1103
            Jeff Abrahamson and   
               Ali Shokoufandeh   Euclidean TSP on two polygons  . . . . . 1104--1114
         Pawel Gawrychowski and   
                Marin Gutan and   
            Andrzej Kisielewicz   On the problem of freeness of
                                  multiplicative matrix semigroups . . . . 1115--1120
Carlos Gómez-Rodríguez and   
           Miguel A. Alonso and   
                 Manuel Vilares   Error-repair parsing schemata  . . . . . 1121--1139
                Shenpeng Lu and   
                 Haodi Feng and   
                     Xiuqian Li   Minimizing the makespan on a single
                                  parallel batching machine  . . . . . . . 1140--1145
               Nicolas Gast and   
                   Bruno Gaujal   Infinite labeled trees: From rational to
                                  Sturmian trees . . . . . . . . . . . . . 1146--1166
             Fedor V. Fomin and   
           Petr A. Golovach and   
      Jan Kratochvíl and   
              Nicolas Nisse and   
                   Karol Suchan   Pursuing a fast robber on a graph  . . . 1167--1181
                Kazuo Iwama and   
              Kazuhisa Seto and   
                  Suguru Tamaki   The complexity of the Hajós calculus for
                                  planar graphs  . . . . . . . . . . . . . 1182--1191
            Oscar H. Ibarra and   
               Igor Potapov and   
                   Hsu-Chun Yen   On decision problems for parameterized
                                  machines . . . . . . . . . . . . . . . . 1192--1201
         Hans L. Bodlaender and   
         Michael R. Fellows and   
            Pinar Heggernes and   
           Federico Mancini and   
        Charis Papadopoulos and   
               Frances Rosamond   Clustering with partial information  . . 1202--1211
                  Mauro Mezzini   On the complexity of finding chordless
                                  paths in bipartite graphs and some
                                  interval operators in graphs and
                                  hypergraphs  . . . . . . . . . . . . . . 1212--1220
           R. C. S. Machado and   
     C. M. H. de Figueiredo and   
                  K. Vuskovi\'c   Chromatic index of graphs with no cycle
                                  with a unique chord  . . . . . . . . . . 1221--1234

Theoretical Computer Science
Volume 411, Number 10, March 4, 2010

                      Moti Yung   Preface  . . . . . . . . . . . . . . . . 1235--1235
                  Marius Zimand   Simple extractors via constructions of
                                  cryptographic pseudo-random generators   1236--1250
               Omer Horvitz and   
                  Jonathan Katz   Bounds on the efficiency of black-box
                                  commitment schemes . . . . . . . . . . . 1251--1260
          Yannick Chevalier and   
            Michael Rusinowitch   Symbolic protocol analysis in the union
                                  of disjoint intruder theories: Combining
                                  decision procedures  . . . . . . . . . . 1261--1282
                  Tal Moran and   
                      Moni Naor   Basing cryptographic protocols on
                                  tamper-evident seals . . . . . . . . . . 1283--1310
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 11--13, March 6, 2010

                  Jifeng He and   
                     Tony Hoare   CSP is a retract of CCS  . . . . . . . . 1311--1337
               Simona Orzan and   
             Tim A. C. Willemse   Invariants for Parameterised Boolean
                                  Equation Systems . . . . . . . . . . . . 1338--1371
     Richard W. Barraclough and   
              David Binkley and   
          Sebastian Danicic and   
                Mark Harman and   
          Robert M. Hierons and   
           Ákos Kiss and   
              Mike Laurence and   
                 Lahcen Ouarbya   A trajectory-based strict semantics for
                                  program slicing  . . . . . . . . . . . . 1372--1386
                    Yuxi Fu and   
                         Hao Lu   On the expressiveness of interaction . . 1387--1451
               Philippe Gaucher   Combinatorics of labelling in
                                  higher-dimensional automata  . . . . . . 1452--1483
               Sandra Alves and   
   Maribel Fernández and   
       Mário Florido and   
                     Ian Mackie   Gödel's system $\cal T$ revisited . . . . 1484--1500
                    Peter Hines   Quantum circuit oracles for Abstract
                                  Machine computations . . . . . . . . . . 1501--1520
Manfred Schmidt-Schauß and   
                    David Sabel   On generic context lemmas for
                                  higher-order calculi with sharing  . . . 1521--1541

Theoretical Computer Science
Volume 411, Number 14--15, March 17, 2010

       Alexander Shvartsman and   
                  Pascal Felber   Editors' preface . . . . . . . . . . . . 1543--1543
             David Ilcinkas and   
        Dariusz R. Kowalski and   
                   Andrzej Pelc   Fast radio broadcasting with advice  . . 1544--1557
             Florent Becker and   
            Sergio Rajsbaum and   
              Ivan Rapaport and   
             Eric Rémila   Average long-lived binary consensus:
                                  Quantifying the stabilizing role played
                                  by memory  . . . . . . . . . . . . . . . 1558--1566
        Toshimitsu Masuzawa and   
       Sébastien Tixeuil   Quiescence of self-stabilizing gossiping
                                  among mobile agents in graphs  . . . . . 1567--1582
            Paola Flocchini and   
             David Ilcinkas and   
               Andrzej Pelc and   
                 Nicola Santoro   Remembering without memory: Tree
                                  exploration by asynchronous oblivious
                                  robots . . . . . . . . . . . . . . . . . 1583--1598
           Thomas Sauerwald and   
                   Dirk Sudholt   A self-stabilizing algorithm for cut
                                  problems in synchronous networks . . . . 1599--1612
          Pierre Fraigniaud and   
          Emmanuelle Lebhar and   
                     Zvi Lotker   Recovering the long-range links in
                                  augmented graphs . . . . . . . . . . . . 1613--1625
              Davide Bil\`o and   
            Thomas Erlebach and   
Matú\vs Mihalák and   
                 Peter Widmayer   Discovery of network properties with
                                  all-shortest-paths queries . . . . . . . 1626--1637
               Colin Cooper and   
               Ralf Klasing and   
                  Tomasz Radzik   Locating and repairing faults in a
                                  network with mobile agents . . . . . . . 1638--1647
             D. Adjiashvili and   
                       D. Peleg   Equal-area locus-based convex polygon
                                  decomposition  . . . . . . . . . . . . . 1648--1667

Theoretical Computer Science
Volume 411, Number 16--18, March 28, 2010

               Well Y. Chou and   
                  Chiuyuan Chen   All-to-all personalized exchange in
                                  generalized shuffle-exchange networks    1669--1684
             Osamu Watanabe and   
                Masaki Yamamoto   Average-case analysis for the MAX-2SAT
                                  problem  . . . . . . . . . . . . . . . . 1685--1697
                 Henning Fernau   Parameterized algorithms for $d$-Hitting
                                  Set: The weighted case . . . . . . . . . 1698--1713
         Katsuhisa Yamanaka and   
           Shin-ichi Nakano and   
              Yasuko Matsui and   
              Ryuhei Uehara and   
                   Kento Nakada   Efficient enumeration of all ladder
                                  lotteries and its application  . . . . . 1714--1722
           Jose Gaintzarain and   
           Montserrat Hermo and   
                Paqui Lucio and   
                 Marisa Navarro   Translating propositional extended
                                  conjunctions of Horn clauses into
                                  Boolean circuits . . . . . . . . . . . . 1723--1733
           Martin R. Ehmsen and   
          Lene M. Favrholdt and   
              Jens S. Kohrt and   
                   Rodica Mihai   Comparing First-Fit and Next-Fit for
                                  online edge coloring . . . . . . . . . . 1734--1741
           Ching-Lueh Chang and   
                  Yuh-Dauh Lyuu   Optimal bounds on finding fixed points
                                  of contraction mappings  . . . . . . . . 1742--1749
    Viera Borbel'ová and   
Katarína Cechlárová   Rotations in the stable $b$-matching
                                  problem  . . . . . . . . . . . . . . . . 1750--1762
               Hosam M. Mahmoud   Distributional analysis of swaps in
                                  Quick Select . . . . . . . . . . . . . . 1763--1769
                Florentin Ipate   Bounded sequence testing from
                                  deterministic finite state machines  . . 1770--1784
            Laura Giambruno and   
                Sabrina Mantaci   Transducers for the bidirectional
                                  decoding of prefix codes . . . . . . . . 1785--1792
             Viliam Geffert and   
                 Jozef Gajdo\vs   Multiway in-place merging  . . . . . . . 1793--1808
                     Sujin Shin   Codes and maximal monoids  . . . . . . . 1809--1817
                   Arto Salomaa   Criteria for the matrix equivalence of
                                  words  . . . . . . . . . . . . . . . . . 1818--1827
   Péter Biró and   
           David F. Manlove and   
                 Shubham Mittal   Size versus stability in the marriage
                                  problem  . . . . . . . . . . . . . . . . 1828--1841
                P. Hrube\vs and   
                   S. Jukna and   
                 A. Kulikov and   
               P. Pudlák   On convex complexity measures  . . . . . 1842--1854
              Jean Cardinal and   
                  Martin Hoefer   Non-cooperative facility location and
                                  covering games . . . . . . . . . . . . . 1855--1876
                 Liqi Zhang and   
                  Lingfa Lu and   
                  Jinjiang Yuan   Single-machine scheduling under the job
                                  rejection constraint . . . . . . . . . . 1877--1882
                     Xin Li and   
                       Tian Liu   On exponential time lower bound of
                                  Knapsack under backtracking  . . . . . . 1883--1888
            Yoshiaki Nonaka and   
               Hirotaka Ono and   
          Kunihiko Sadakane and   
             Masafumi Yamashita   The hitting and cover times of
                                  Metropolis walks . . . . . . . . . . . . 1889--1894
                  Cheng W. Hong   The biased, distance-restricted
                                  $n$-in-a-row game for small $p$  . . . . 1895--1897

Theoretical Computer Science
Volume 411, Number 19, April 6, 2010

                Michael Mislove   Preface  . . . . . . . . . . . . . . . . 1899--1899
                Ingo Battenfeld   Comparing free algebras in Topological
                                  and Classical Domain Theory  . . . . . . 1900--1917
                Keye Martin and   
           Ira S. Moskowitz and   
                 Gerard Allwein   Algebraic information theory for binary
                                  channels . . . . . . . . . . . . . . . . 1918--1927
                Ivan Lanese and   
               Davide Sangiorgi   An operational semantics for a calculus
                                  for wireless systems . . . . . . . . . . 1928--1948
            Daniele Varacca and   
                 Nobuko Yoshida   Typed event structures and the linear
                                  $\pi$-calculus . . . . . . . . . . . . . 1949--1973
                    Peng Li and   
                Steve Zdancewic   Arrows for secure information flow . . . 1974--1994

Theoretical Computer Science
Volume 411, Number 20, April 28, 2010

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1995--1996
             Nicola Cannata and   
           Emanuela Merelli and   
                 Irek Ulidowski   Preface: Hybrid automata and oscillatory
                                  behaviour in biological systems  . . . . 1997--1998
              Ezio Bartocci and   
           Flavio Corradini and   
           Emanuela Merelli and   
                     Luca Tesei   Detecting synchronisation of biological
                                  oscillators by model checking  . . . . . 1999--2018
            Paolo Ballarini and   
          Maria Luisa Guerriero   Query-based verification of qualitative
                                  trends and oscillations in biochemical
                                  systems  . . . . . . . . . . . . . . . . 2019--2036
             Dario Campagna and   
                   Carla Piazza   Hybrid automata, reachability, and
                                  Systems Biology  . . . . . . . . . . . . 2037--2051
            Luca Bortolussi and   
              Alberto Policriti   Hybrid dynamics of stochastic programs   2052--2077
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi
                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1995--1996

Theoretical Computer Science
Volume 411, Number 21, May 6, 2010

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi
                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 2079--2080
              Eric Bonabeau and   
                David Corne and   
             Joshua Knowles and   
                  Riccardo Poli   Swarm intelligence theory: a snapshot of
                                  the state of the art . . . . . . . . . . 2081--2083
               Dirk Sudholt and   
                   Carsten Witt   Runtime analysis of a binary particle
                                  swarm optimizer  . . . . . . . . . . . . 2084--2100
             Ying-ping Chen and   
                      Pei Jiang   Analysis of particle interaction in
                                  particle swarm optimization  . . . . . . 2101--2115
               Peter Vrancx and   
             Katja Verbeeck and   
                Ann Nowé   Analyzing the dynamics of stigmergetic
                                  interactions through pheromone games . . 2116--2126
              Arijit Biswas and   
               Swagatam Das and   
              Ajith Abraham and   
              Sambarta Dasgupta   Stability analysis of the reproduction
                                  operator in bacterial foraging
                                  optimization . . . . . . . . . . . . . . 2127--2139
    Fatih Gökçe and   
                   Erol \cSahin   The pros and cons of flocking in the
                                  long-range ``migration'' of mobile robot
                                  swarms . . . . . . . . . . . . . . . . . 2140--2154

Theoretical Computer Science
Volume 411, Number 22--24, May 17, 2010

                  K. Bertet and   
                   B. Monjardet   The multiple facets of the canonical
                                  direct unit implicational basis  . . . . 2155--2166
             Dongsheng Zhao and   
                      Taihe Fan   Dcpo-completion of posets  . . . . . . . 2167--2173
     Nicoletta De Francesco and   
          Giuseppe Lettieri and   
                   Luca Martini   Using abstract interpretation to add
                                  type checking for interfaces in Java
                                  bytecode verification  . . . . . . . . . 2174--2201
                    Simone Tini   Non-expansive $\epsilon$ bisimulations
                                  for probabilistic processes  . . . . . . 2202--2222
                Kohei Honda and   
                Olivier Laurent   An exact correspondence between a typed
                                  pi-calculus and polarised proof-nets . . 2223--2238
               Ichiro Hasuo and   
           Yoshinobu Kawabe and   
                Hideki Sakurada   Probabilistic anonymity via coalgebraic
                                  simulations  . . . . . . . . . . . . . . 2239--2259
          Richard A. Hayden and   
              Jeremy T. Bradley   A fluid analysis framework for a
                                  Markovian process algebra  . . . . . . . 2260--2297
      Stéphane Demri and   
              Ranko Lazi\'c and   
                Arnaud Sangnier   Model checking memoryful linear-time
                                  logics over one-counter automata . . . . 2298--2316
               Wim H. Hesselink   Alternating states for dual
                                  nondeterminism in imperative programming 2317--2330
           Alexander Rabinovich   Complexity of metric temporal logics
                                  with counting and the Pnueli modalities  2331--2342

Theoretical Computer Science
Volume 411, Number 25, May 28, 2010

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi
                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 2343--2344
       Tseren-Onolt Ishdorj and   
           Alberto Leporati and   
               Linqiang Pan and   
            Xiangxiang Zeng and   
                   Xingyi Zhang   Deterministic solutions to QSAT  . . . . 2345--2358
             Artiom Alhazov and   
                   Chang Li and   
                      Ion Petre   Computing the graph-based parallel
                                  complexity of gene assembly  . . . . . . 2359--2367
            Christina Hayes and   
          Tomá\vs Gedeon   Hyperbolicity of the fixed point set for
                                  the simple genetic algorithm . . . . . . 2368--2383
             Bruno Apolloni and   
              Simone Bassis and   
              Sabrina Gaito and   
            Dario Malchiodi and   
                   Italo Zoppis   Playing monotone games to understand
                                  learning behaviors . . . . . . . . . . . 2384--2405
              Frank Neumann and   
                   Carsten Witt   Ant Colony Optimization and the minimum
                                  spanning tree problem  . . . . . . . . . 2406--2413
             Victor Mitrana and   
                  Ion Petre and   
               Vladimir Rogojin   Accepting splicing systems . . . . . . . 2414--2422
                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 26--28, June 6, 2010

            Claire Herrbach and   
               Alain Denise and   
                   Serge Dulucq   Average complexity of the
                                  Jiang--Wang--Zhang pairwise tree
                                  alignment algorithm and of a RNA
                                  secondary structure alignment algorithm  2423--2432
         Masafumi Yamashita and   
                  Ichiro Suzuki   Characterizing geometric patterns
                                  formable by oblivious anonymous mobile
                                  robots . . . . . . . . . . . . . . . . . 2433--2453
                     O. Shanker   Complex network dimension and path
                                  counts . . . . . . . . . . . . . . . . . 2454--2458
               Shlomi Dolev and   
           Elad M. Schiller and   
           Paul G. Spirakis and   
               Philippas Tsigas   Game authority for robust and scalable
                                  distributed selfish-computer systems . . 2459--2466
            Qiang-Sheng Hua and   
               Yuexuan Wang and   
                Dongxiao Yu and   
              Francis C. M. Lau   Dynamic programming based algorithms for
                                  set multicover and multiset multicover
                                  problems . . . . . . . . . . . . . . . . 2467--2474
           Guillaume Fertin and   
             Danny Hermelin and   
                Romeo Rizzi and   
       Stéphane Vialette   Finding common structured patterns in
                                  linear graphs  . . . . . . . . . . . . . 2475--2486
            Mathilde Bouvel and   
                  Elisa Pergola   Posets and permutations in the
                                  duplication--loss model: Minimal
                                  permutations with $d$ descents . . . . . 2487--2501
                     Zeev Nutov   Approximating minimum power covers of
                                  intersecting families and directed
                                  edge-connectivity problems . . . . . . . 2502--2512
                WenBin Chen and   
                Dengpan Yin and   
                Zhengzhang Chen   Inapproximability results for equations
                                  over infinite groups . . . . . . . . . . 2513--2519
            William Hendrix and   
         Matthew C. Schmidt and   
              Paul Breimyer and   
             Nagiza F. Samatova   Theoretical underpinnings for maximal
                                  clique enumeration on perturbed graphs   2520--2536
             Tongquan Zhang and   
                   Ying Yin and   
                    Jianping Li   An improved approximation algorithm for
                                  the maximum TSP  . . . . . . . . . . . . 2537--2541
        Spyros Angelopoulos and   
                  Allan Borodin   Randomized priority algorithms . . . . . 2542--2558
          Alexander Okhotin and   
    Christian Reitwießner   Conjunctive grammars with restricted
                                  disjunction  . . . . . . . . . . . . . . 2559--2571
                 Joan Boyar and   
               Leah Epstein and   
                     Asaf Levin   Tight results for Next Fit and Worst Fit
                                  with resource augmentation . . . . . . . 2572--2580
              Jean Cardinal and   
                    Eythan Levy   Connected vertex covers in dense graphs  2581--2590
               Shuji Kijima and   
             Masashi Kiyomi and   
             Yoshio Okamoto and   
                    Takeaki Uno   On listing, sampling, and counting the
                                  chordal graphs with edge constraints . . 2591--2601
        Luís Antunes and   
             André Souto   Information measures for infinite
                                  sequences  . . . . . . . . . . . . . . . 2602--2611
             Zhiqiang Zhang and   
                     Yaoyun Shi   On the parity complexity measures of
                                  Boolean functions  . . . . . . . . . . . 2612--2618
     Ken-ichi Kawarabayashi and   
                    Kenta Ozeki   A simple algorithm for $4$-coloring
                                  $3$-colorable planar graphs  . . . . . . 2619--2622
                      Jun Tarui   Smallest formulas for the parity of
                                  $2^k$ variables are essentially unique   2623--2627

Theoretical Computer Science
Volume 411, Number 29--30, June 17, 2010

László Györfi and   
   György Turán and   
                Thomas Zeugmann   Guest Editors' foreword  . . . . . . . . 2629--2631
              Vladimir Vovk and   
                 Alexander Shen   Prequential randomness and probability   2632--2646
             Alexey Chernov and   
            Yuri Kalnishkan and   
              Fedor Zhdanov and   
                  Vladimir Vovk   Supermartingales in prediction with
                                  expert advice  . . . . . . . . . . . . . 2647--2669
        Indraneel Mukherjee and   
             Robert E. Schapire   Learning with continuous experts using
                                  drifting games . . . . . . . . . . . . . 2670--2683
                  Ronald Ortner   Online regret bounds for Markov decision
                                  processes with deterministic transitions 2684--2695
                Ohad Shamir and   
               Sivan Sabato and   
                 Naftali Tishby   Learning and generalization with the
                                  information bottleneck . . . . . . . . . 2696--2711
        András Antos and   
               Varun Grover and   
        Csaba Szepesvári   Active learning in heteroscedastic noise 2712--2728
               Dana Angluin and   
               James Aspnes and   
                     Lev Reyzin   Optimally learning social networks with
                                  activations and suppressions . . . . . . 2729--2740
     Leonor Becerra-Bonache and   
                  John Case and   
                Sanjay Jain and   
                  Frank Stephan   Iterative learning of simple external
                                  contextual languages . . . . . . . . . . 2741--2756
                Sanjay Jain and   
              Steffen Lange and   
      Samuel E. Moelius III and   
                  Sandra Zilles   Incremental learning with temporary
                                  memory . . . . . . . . . . . . . . . . . 2757--2772

Theoretical Computer Science
Volume 411, Number 31--33, June 28, 2010

               Tomoko Izumi and   
              Taisuke Izumi and   
               Hirotaka Ono and   
                    Koichi Wada   Approximability and inapproximability of
                                  the minimum certificate dispersal
                                  problem  . . . . . . . . . . . . . . . . 2773--2783
Tamás Horváth and   
                      Jan Ramon   Efficient frequent connected subgraph
                                  mining in graphs of bounded tree-width   2784--2797
       Pavlos S. Efraimidis and   
          Lazaros Tsavlidis and   
             George B. Mertzios   Window-games between TCP flows . . . . . 2798--2817
                Jiao-fen Li and   
                  Xi-yan Hu and   
                      Lei Zhang   Dykstra's algorithm for constrained
                                  least-squares doubly symmetric matrix
                                  problems . . . . . . . . . . . . . . . . 2818--2826
             Wai-Fong Chuan and   
                    Hui-Ling Ho   Factors of characteristic words:
                                  Location and decompositions  . . . . . . 2827--2846
               Amitai Armon and   
                 Adi Avidor and   
                  Oded Schwartz   Cooperative TSP  . . . . . . . . . . . . 2847--2863
      H. Kleine Büning and   
                   A. Remshagen   An upper bound for the circuit
                                  complexity of existentially quantified
                                  Boolean formulas . . . . . . . . . . . . 2864--2870
                   Deshi Ye and   
                    Xin Han and   
                 Guochuan Zhang   Deterministic on-line call control in
                                  cellular networks  . . . . . . . . . . . 2871--2877
              Yen-Chiu Chen and   
               Hsin-Wen Wei and   
              Pei-Chi Huang and   
              Wei-Kuan Shih and   
                 Tsan-sheng Hsu   The bridge-connectivity augmentation
                                  problem with a partition constraint  . . 2878--2889
                   Qian Cao and   
                    Zhaohui Liu   Online scheduling with reassignment on
                                  two uniform machines . . . . . . . . . . 2890--2898
                   Leah Epstein   Two-dimensional online bin packing with
                                  rotation . . . . . . . . . . . . . . . . 2899--2911
               Pao-Lien Lai and   
              Hong-Chun Hsu and   
          Chang-Hsiung Tsai and   
                Iain A. Stewart   A class of hierarchical graphs as
                                  topologies for interconnection networks  2912--2924
               Travis Gagie and   
               Giovanni Manzini   Move-to-Front, Distance Coding, and
                                  Inversion Frequencies revisited  . . . . 2925--2944
         Samuel Alexandre Vidal   An optimal algorithm to generate rooted
                                  trivalent diagrams and rooted triangular
                                  maps . . . . . . . . . . . . . . . . . . 2945--2967
    Andreas Brandstädt and   
                Van Bang Le and   
              Dieter Rautenbach   Exact leaf powers  . . . . . . . . . . . 2968--2977
                 Q. Q. Nong and   
             T. C. E. Cheng and   
                       C. T. Ng   A polynomial-time algorithm for the
                                  weighted link ring loading problem with
                                  integer demand splitting . . . . . . . . 2978--2986
                  Wouter Gelade   Succinctness of regular expressions with
                                  interleaving, intersection and counting  2987--2998
               Petr K\ocircurka   Erratum to: Entropy of Turing machines
                                  with moving head . . . . . . . . . . . . 2999--3000

Theoretical Computer Science
Volume 411, Number 34--36, July 17, 2010

               Costas Busch and   
            Marios Mavronicolas   An efficient counting network  . . . . . 3001--3030
                Tal Mizrahi and   
                    Yoram Moses   Continuous consensus with ambiguous
                                  failures . . . . . . . . . . . . . . . . 3031--3041
                 Raphael Yuster   Single source shortest paths in
                                  $H$-minor free graphs  . . . . . . . . . 3042--3047
             Guy Feigenblat and   
               Ofra Itzhaki and   
                      Ely Porat   The frequent items problem, under
                                  polynomial decay, in the streaming model 3048--3054
               N. Bourgeois and   
               G. Lucarelli and   
                   I. Milis and   
                 V. Th. Paschos   Approximating the max-edge-coloring
                                  problem  . . . . . . . . . . . . . . . . 3055--3067
                  Romain Ravaux   Decomposing trees with large diameter    3068--3072
               Leah Epstein and   
        Csanád Imreh and   
                     Asaf Levin   Class constrained bin packing revisited  3073--3089
               Frank Drewes and   
          Berthold Hoffmann and   
              Dirk Janssens and   
                     Mark Minas   Adaptive star grammars and their
                                  languages  . . . . . . . . . . . . . . . 3090--3109
                  R. Groult and   
                    G. Richomme   Optimality of some algorithms to detect
                                  quasiperiodicities . . . . . . . . . . . 3110--3122
                 Adam Bains and   
                  Therese Biedl   Reconstructing $h$ $v$-convex
                                  multi-coloured polyominoes . . . . . . . 3123--3128
               Leah Epstein and   
                     Asaf Levin   Improved randomized results for the
                                  interval selection problem . . . . . . . 3129--3135
   Péter Biró and   
       Tamás Fleiner and   
           Robert W. Irving and   
               David F. Manlove   The College Admissions problem with
                                  lower and common quotas  . . . . . . . . 3136--3153
               Zohir Bouzid and   
Maria Gradinariu Potop-Butucaru and   
       Sébastien Tixeuil   Optimal Byzantine-resilient convergence
                                  in uni-dimensional robot networks  . . . 3154--3168
         Eric Duchêne and   
                    Michel Rigo   Invariant games  . . . . . . . . . . . . 3169--3180
                 Luke Mathieson   The parameterized complexity of editing
                                  graphs for bounded degeneracy  . . . . . 3181--3187
          Catarina Carvalho and   
       Víctor Dalmau and   
                 Andrei Krokhin   CSP duality and trees of bounded
                                  pathwidth  . . . . . . . . . . . . . . . 3188--3208
                 Arseny M. Shur   Growth rates of complexity of power-free
                                  languages  . . . . . . . . . . . . . . . 3209--3223
            Alessandro Cincotti   ${N}$-player partizan games  . . . . . . 3224--3234
               Ralf Klasing and   
            Adrian Kosowski and   
                Alfredo Navarra   Taking advantage of symmetries:
                                  Gathering of many asynchronous oblivious
                                  robots on a ring . . . . . . . . . . . . 3235--3246
                  Shan Zhou and   
                     Hao Li and   
                  Guanghui Wang   Algorithm for two disjoint long paths in
                                  $2$-connected graphs . . . . . . . . . . 3247--3254
                Markus Kuba and   
                Alois Panholzer   A combinatorial approach to the analysis
                                  of bucket recursive trees  . . . . . . . 3255--3273
   Dominik D. Freydenberger and   
              Daniel Reidenbach   Existence and nonexistence of
                                  descriptive patterns . . . . . . . . . . 3274--3286
              Zhendong Shao and   
              Roberto Solis-Oba   $L(2, 1)$-labelings on the composition
                                  of $n$ graphs  . . . . . . . . . . . . . 3287--3292
            Paolo Ferragina and   
                 Igor Nitto and   
              Rossano Venturini   On compact representations of
                                  All-Pairs-Shortest-Path-Distance
                                  matrices . . . . . . . . . . . . . . . . 3293--3300
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 411, Number 37, August 7, 2010

Frédéric Blanqui and   
            Claude Kirchner and   
                     Colin Riba   On the confluence of lambda-calculus
                                  with conditional rewriting . . . . . . . 3301--3327
                  Luca Padovani   Contract-based discovery of Web services
                                  modulo simple orchestrators  . . . . . . 3328--3347
                M. Alpuente and   
                  M. Comini and   
                 S. Escobar and   
                M. Falaschi and   
                      J. Iborra   A compact fixpoint semantics for term
                                  rewriting systems  . . . . . . . . . . . 3348--3371
              Robert M. Hierons   Checking experiments for stream
                                  X-machines . . . . . . . . . . . . . . . 3372--3385
           Russell O'Connor and   
                   Bas Spitters   A computer-verified monadic functional
                                  implementation of the integral . . . . . 3386--3402

Theoretical Computer Science
Volume 411, Number 38--39, August 28, 2010

               Sebastian Maneth   Preface  . . . . . . . . . . . . . . . . 3403--3403
              Markus Holzer and   
                Andreas Maletti   An $n \log n$ algorithm for
                                  hyper-minimizing a (minimized)
                                  deterministic automaton  . . . . . . . . 3404--3413
             G. Castiglione and   
                 A. Restivo and   
                   M. Sciortino   On extremal cases of Hopcroft's
                                  algorithm  . . . . . . . . . . . . . . . 3414--3422
               Pascal Caron and   
      Jean-Marc Champarnaud and   
                 Ludovic Mignot   Acyclic automata and small expressions
                                  using multi-tilde-bar operators  . . . . 3423--3435
               Rusins Freivalds   Amount of nonconstructivity in
                                  deterministic finite automata  . . . . . 3436--3443
               Pierre Ganty and   
             Nicolas Maquet and   
    Jean-François Raskin   Fixed point guided abstraction
                                  refinement for alternating automata  . . 3444--3459
             Tayssir Touili and   
            Mohamed Faouzi Atig   Verifying parallel programs with dynamic
                                  communication structures . . . . . . . . 3460--3468
 Pierre-Cyrille Héam and   
               Cyril Nicaud and   
                Sylvain Schmitz   Parametric random generation of
                                  deterministic tree automata  . . . . . . 3469--3480
             Kazuhiro Inaba and   
                   Haruo Hosoya   Compact representation for answer sets
                                  of $n$-ary regular queries . . . . . . . 3481--3492
                 Akio Fujiyoshi   Recognition of directed acyclic graphs
                                  by spanning tree automata  . . . . . . . 3493--3506
             Adam Clarridge and   
                    Kai Salomaa   Analysis of a cellular automaton model
                                  for car traffic with a slow-to-stop rule 3507--3515
              Martin Kutrib and   
                Andreas Malcher   Cellular automata with sparse
                                  communication  . . . . . . . . . . . . . 3516--3526

Theoretical Computer Science
Volume 411, Number 40--42, September 6, 2010

                  A. Denise and   
                   Y. Ponty and   
                     M. Termier   Controlled non-uniform random generation
                                  of decomposable structures . . . . . . . 3527--3552
           Michele Flammini and   
           Gianpiero Monaco and   
           Luca Moscardelli and   
             Hadas Shachnai and   
           Mordechai Shalom and   
                 Tami Tamir and   
                    Shmuel Zaks   Minimizing total busy time in parallel
                                  scheduling with application to optical
                                  networks . . . . . . . . . . . . . . . . 3553--3562
           Paolo Ciancarini and   
              Gian Piero Favini   Playing the perfect Kriegspiel endgame   3563--3577
                   C. T. Ng and   
                Shisheng Li and   
             T. C. E. Cheng and   
                  Jinjiang Yuan   Preemptive scheduling with simple linear
                                  deterioration on a single machine  . . . 3578--3586
                    Xin Han and   
                Tak-Wah Lam and   
                Lap-Kei Lee and   
             Isaac K. K. To and   
            Prudence W. H. Wong   Deadline scheduling and power management
                                  for speed bounded processors . . . . . . 3587--3600
             Pim van 't Hof and   
       Daniël Paulusma and   
          Johan M. M. van Rooij   Computing role assignments of chordal
                                  graphs . . . . . . . . . . . . . . . . . 3601--3613
                    Gang Yu and   
                Xiaoxiao Ma and   
                  Yong Shen and   
                     Wenbao Han   Provable secure identity based
                                  generalized signcryption scheme  . . . . 3614--3624
               Paul C. Bell and   
      Jean-Charles Delvenne and   
    Raphaël M. Jungers and   
             Vincent D. Blondel   The continuous Skolem--Pisot problem . . 3625--3634
              Yasuko Matsui and   
              Ryuhei Uehara and   
                    Takeaki Uno   Enumeration of the perfect sequences of
                                  a chordal graph  . . . . . . . . . . . . 3635--3641
                Shisheng Li and   
                  Jinjiang Yuan   Parallel-machine scheduling with
                                  deteriorating jobs and rejection . . . . 3642--3650
                Weifan Wang and   
             Stephen Finbow and   
                      Ping Wang   The surviving rate of an infected
                                  network  . . . . . . . . . . . . . . . . 3651--3660
             Filip Goldefus and   
      Tomás Masopust and   
               Alexander Meduna   Left-forbidding cooperating distributed
                                  grammar systems  . . . . . . . . . . . . 3661--3667
         Michelangelo Bucci and   
               Aldo de Luca and   
             Alessandro De Luca   On the number of episturmian palindromes 3668--3684
                 Daniel Meister   Treewidth and minimum fill-in on
                                  permutation graphs in linear time  . . . 3685--3700
                Marek Cygan and   
               Marcin Pilipczuk   Exact and approximate bandwidth  . . . . 3701--3713
        Charilaos Efthymiou and   
               Paul G. Spirakis   Sharp thresholds for Hamiltonicity in
                                  random intersection graphs . . . . . . . 3714--3730
              Yun Bao Huang and   
             William D. Weakley   A note on the complexity of
                                  $C^\infty$-words . . . . . . . . . . . . 3731--3735
                Jianer Chen and   
               Iyad A. Kanj and   
                         Ge Xia   Improved upper bounds for vertex cover   3736--3756
      András Csernenszky   The Picker--Chooser diameter game  . . . 3757--3762
               Pao-Lien Lai and   
              Chang-Hsiung Tsai   Embedding of tori and grids into twisted
                                  cubes  . . . . . . . . . . . . . . . . . 3763--3773
 Tomás Dvorák and   
           Václav Koubek   Computational complexity of long paths
                                  and cycles in faulty hypercubes  . . . . 3774--3786
                   Michael Okun   Strong order-preserving renaming in the
                                  synchronous message passing model  . . . 3787--3794
                Hagai Cohen and   
                      Ely Porat   Fast set intersection and two-patterns
                                  matching . . . . . . . . . . . . . . . . 3795--3800

Theoretical Computer Science
Volume 411, Number 43, October 9, 2010

             Vlady Ravelomanana   Birth and growth of multicyclic
                                  components in random hypergraphs . . . . 3801--3813
                 Yair Dombb and   
                Ohad Lipsky and   
                Benny Porat and   
                  Ely Porat and   
                      Asaf Tsur   The approximate swap and mismatch edit
                                  distance . . . . . . . . . . . . . . . . 3814--3822
               Costas Busch and   
            Srikanta Tirthapura   Concurrent counting is harder than
                                  queuing  . . . . . . . . . . . . . . . . 3823--3833
             Anthony Bonato and   
       Ehsan Chiniforooshan and   
                   Pawel Pralat   Cops and Robbers from a distance . . . . 3834--3844
                Allan Scott and   
                   Ulrike Stege   Parameterized pursuit-evasion games  . . 3845--3858
             Masashi Kiyomi and   
             Toshiki Saitoh and   
                  Ryuhei Uehara   Reconstruction of interval graphs  . . . 3859--3866
                Tomi A. Pasanen   Random binary search tree with equal
                                  elements . . . . . . . . . . . . . . . . 3867--3872
                 Junlei Zhu and   
                      Yuehua Bu   Equitable and equitable list colorings
                                  of graphs  . . . . . . . . . . . . . . . 3873--3876
          Gianluca Caterina and   
                Bruce Boghosian   An order-preserving property of additive
                                  invariants for Takesue-type reversible
                                  cellular automata  . . . . . . . . . . . 3877--3881

Theoretical Computer Science
Volume 411, Number 44--46, October 25, 2010

                Zhi-Han Gao and   
                    Fang-Wei Fu   The minimal polynomial of a sequence
                                  obtained from the componentwise linear
                                  transformation of a linear recurring
                                  sequence . . . . . . . . . . . . . . . . 3883--3893
María Isabel Herrero and   
          Gabriela Jeronimo and   
                     Juan Sabia   Computing isolated roots of sparse
                                  polynomial systems in affine space . . . 3894--3904
           Pierluigi Frisco and   
                Oscar H. Ibarra   On sets of numbers accepted by P/T
                                  systems composed by join . . . . . . . . 3905--3916
              Wilfried Huss and   
             Ecaterina Sava and   
                 Wolfgang Woess   Entropy sensitivity of languages defined
                                  by infinite automata, via Markov chains
                                  with forbidden transitions . . . . . . . 3917--3922
               Chan-Shuo Wu and   
              Guan-Shieng Huang   A metric for rooted trees with unlabeled
                                  vertices based on nested parentheses . . 3923--3931
               Arturo Carpi and   
               Valerio D'Alonzo   On factors of synchronized sequences . . 3932--3937
               Kei Uchizawa and   
            Takao Nishizeki and   
                  Eiji Takimoto   Energy and depth of threshold circuits   3938--3946
                  Yumei Huo and   
             Joseph Y.-T. Leung   Fast approximation algorithms for job
                                  scheduling with processing set
                                  restrictions . . . . . . . . . . . . . . 3947--3955
                    Xin Han and   
                Kazuhisa Makino   Online removable knapsack with limited
                                  cuts . . . . . . . . . . . . . . . . . . 3956--3964
              Linda Morales and   
                 Hal Sudborough   A quadratic lower bound for Topswops . . 3965--3970
            Dariusz Dereniowski   Phutball is PSPACE-hard  . . . . . . . . 3971--3978
               Shunsuke Ota and   
                 Ehab Morsy and   
              Hiroshi Nagamochi   A plane graph representation of
                                  triconnected graphs  . . . . . . . . . . 3979--3993
           Camil Demetrescu and   
            Bruno Escoffier and   
              Gabriel Moruz and   
               Andrea Ribichini   Adapting parallel algorithms to the
                                  W-Stream model, with applications to
                                  graph problems . . . . . . . . . . . . . 3994--4004
               Jianxin Wang and   
                  Wenjun Li and   
                    Jianer Chen   A parameterized algorithm for the
                                  hyperplane-cover problem . . . . . . . . 4005--4009
               Emmanuel Jeandel   The periodic domino problem revisited    4010--4016
              Eyal Ackerman and   
               Oren Ben-Zwi and   
                  Guy Wolfovitz   Combinatorial model and bounds for
                                  target set selection . . . . . . . . . . 4017--4022
                 Vadim V. Lozin   A decidability result for the dominating
                                  set problem  . . . . . . . . . . . . . . 4023--4027

Theoretical Computer Science
Volume 411, Number 47, October 29, 2010

            Olga Grinchtein and   
              Bengt Jonsson and   
                 Martin Leucker   Learning of event-recording automata . . 4029--4054
                M. Alpuente and   
                  D. Ballis and   
                  F. Correa and   
                    M. Falaschi   An integrated framework for the
                                  diagnosis and correction of rule-based
                                  programs . . . . . . . . . . . . . . . . 4055--4101
              Lars Birkedal and   
   Kristian Stòvring and   
                Jacob Thamsborg   The category-theoretic solution of
                                  recursive metric-space equations . . . . 4102--4122
         Ron van der Meyden and   
                   Chenyi Zhang   A comparison of semantic models for
                                  noninterference  . . . . . . . . . . . . 4123--4147

Theoretical Computer Science
Volume 411, Number 48, November 1, 2010

            Paola Bonizzoni and   
           Clelia De Felice and   
                  Rosalba Zizza   A characterization of (regular) circular
                                  languages generated by monotone complete
                                  splicing systems . . . . . . . . . . . . 4149--4161
                   Florin Manea   A series of algorithmic results related
                                  to the iterated hairpin completion . . . 4162--4178
               Neal G. Anderson   On the physical implementation of
                                  logical transformations: Generalized
                                  L-machines . . . . . . . . . . . . . . . 4179--4199
              Kok Kiong Tan and   
              Jian Cheng Lv and   
                   Zhang Yi and   
                    Sunan Huang   Adaptive multiple minor directions
                                  extraction in parallel using a PCA
                                  neural network . . . . . . . . . . . . . 4200--4215

Theoretical Computer Science
Volume 411, Number 49, November 5, 2010

            Andreas Darmann and   
            Ulrich Pferschy and   
                Joachim Schauer   Resource allocation with time intervals  4217--4234
                      J. J. Liu   Distinct squares in run-length encoded
                                  strings  . . . . . . . . . . . . . . . . 4235--4241
              Huaming Zhang and   
                         Xin He   A generalized greedy routing algorithm
                                  for $2$-connected graphs . . . . . . . . 4242--4252
                  Minghui Jiang   On the parameterized complexity of some
                                  optimization problems related to
                                  multiple-interval graphs . . . . . . . . 4253--4262
           Brandon Blakeley and   
          F. Blanchet-Sadri and   
                Josh Gunter and   
                Narad Rampersad   On the complexity of deciding
                                  avoidability of sets of partial words    4263--4271

Theoretical Computer Science
Volume 411, Number 50, November 12, 2010

        Giovanna D'Agostino and   
                  Giacomo Lenzi   On the $\mu$-calculus over transitive
                                  and finite transitive frames . . . . . . 4273--4290
            Ruggero Lanotte and   
  Andrea Maggiolo-Schettini and   
                  Angelo Troina   Weak bisimulation for Probabilistic
                                  Timed Automata . . . . . . . . . . . . . 4291--4322
               Vladimir Rybakov   Rules admissible in transitive temporal
                                  logic $T_{S4}$, sufficient condition . . 4323--4332
                  Filip Mari\'c   Formal verification of a modern SAT
                                  solver by shallow embedding into
                                  Isabelle/HOL . . . . . . . . . . . . . . 4333--4356

Theoretical Computer Science
Volume 411, Number 51--52, December 4, 2010

          John Tang Boyland and   
              Giuseppe Castagna   Preface  . . . . . . . . . . . . . . . . 4357--4357
                   Eijiro Sumii   A bisimulation-like proof method for
                                  contextual properties in untyped
                                  $\lambda$-calculus with references and
                                  deallocation . . . . . . . . . . . . . . 4358--4378
          Ivana Filipovi\'c and   
              Peter O'Hearn and   
              Noam Rinetzky and   
                  Hongseok Yang   Abstraction for concurrent objects . . . 4379--4398
         Luís Caires and   
             Hugo Torres Vieira   Conversation types . . . . . . . . . . . 4399--4440
           Mauro Jaskelioff and   
                  Eugenio Moggi   Monad transformers as monoid
                                  transformers . . . . . . . . . . . . . . 4441--4466


Theoretical Computer Science
Volume 412, Number 1--2, January 2, 2011

               Damien Woods and   
             Turlough Neary and   
                Anthony K. Seda   Preface  . . . . . . . . . . . . . . . . 1--1
                   E. Goles and   
              P.-E. Meunier and   
                I. Rapaport and   
                   G. Theyssier   Communication complexity and intrinsic
                                  universality in cellular automata  . . . 2--21
                N. Ollinger and   
                     G. Richard   Four states are enough!  . . . . . . . . 22--32
            Maurice Margenstern   A universal cellular automaton on the
                                  heptagrid of the hyperbolic plane with
                                  four states  . . . . . . . . . . . . . . 33--56
Jérôme Durand-Lose   Abstract geometrical computation 4:
                                  Small Turing universal signal machines   57--67
              Alexander Okhotin   A simple $P$-complete problem and its
                                  language-theoretic representations . . . 68--82
              Markus Holzer and   
              Martin Kutrib and   
                Andreas Malcher   Complexity of multi-head finite
                                  automata: Origins and directions . . . . 83--96
                Liesbeth De Mol   On the complex behavior of simple tag
                                  systems --- an experimental approach . . 97--112
           Matteo Cavaliere and   
                  Peter Leupold   Computing by observing: Simple systems
                                  and simple observers . . . . . . . . . . 113--123
Erzsébet Csuhaj-Varjú and   
                  Sergey Verlan   On generalized communicating $P$ systems
                                  with minimal interaction rules . . . . . 124--135
             Artiom Alhazov and   
    Alexander Krassovitskiy and   
             Yurii Rogozhin and   
                  Sergey Verlan   $P$ systems with minimal insertion and
                                  deletion . . . . . . . . . . . . . . . . 136--144
                 David Doty and   
          Matthew J. Patitz and   
               Scott M. Summers   Limitations of self-assembly at
                                  temperature 1  . . . . . . . . . . . . . 145--158
          Matthew J. Patitz and   
               Scott M. Summers   Self-assembly of infinite structures: a
                                  survey . . . . . . . . . . . . . . . . . 159--165
                   Jack H. Lutz   A divergence formula for randomness and
                                  dimension  . . . . . . . . . . . . . . . 166--177
             Cristian S. Calude   Simplicity via provability for universal
                                  prefix-free Turing machines  . . . . . . 178--182
                   Klaus Sutner   Computational processes, observers and
                                  Turing incompleteness  . . . . . . . . . 183--190
               Damien Woods and   
             Turlough Neary and   
                Anthony K. Seda   Preface  . . . . . . . . . . . . . . . . v--x

Theoretical Computer Science
Volume 412, Number 3, January 21, 2011

                Ding-Zhu Du and   
                Xiaodong Hu and   
              Panos M. Pardalos   Preface  . . . . . . . . . . . . . . . . 191--191
                 Yinfeng Xu and   
              Wenming Zhang and   
                  Feifeng Zheng   Optimal algorithms for the online time
                                  series search problem  . . . . . . . . . 192--197
                   Feng Zou and   
               Yuexuan Wang and   
                Xiao-Hua Xu and   
                 Xianyue Li and   
                 Hongwei Du and   
                Pengjun Wan and   
                       Weili Wu   New approximations for minimum-weighted
                                  dominating sets and minimum-weighted
                                  connected dominating sets on unit disk
                                  graphs . . . . . . . . . . . . . . . . . 198--208
                  Deying Li and   
               Yuexuan Wang and   
                Qinghua Zhu and   
                  Huiqiang Yang   Fault-tolerant routing: $k$-inconnected
                                  many-to-one routing in wireless networks 209--216
                Suogang Gao and   
                  Zengti Li and   
               Jiangchen Yu and   
               Xiaofeng Gao and   
                       Weili Wu   DNA library screening, pooling design
                                  and unitary spaces . . . . . . . . . . . 217--224
                   Wei Ding and   
                   Guoliang Xue   A linear time algorithm for computing a
                                  most reliable source on a tree network
                                  with faulty nodes  . . . . . . . . . . . 225--232
                   Deshi Ye and   
                    Xin Han and   
                 Guochuan Zhang   Online multiple-strip packing  . . . . . 233--239
                Zhipeng Cai and   
               Randy Goebel and   
                     Guohui Lin   Size-constrained tree partitioning:
                                  Approximating the multicast $k$-tree
                                  routing problem  . . . . . . . . . . . . 240--245
                  Zhiyi Tan and   
                       An Zhang   Online hierarchical scheduling: an
                                  approach using mathematical programming  246--256
Eduardo Álvarez-Miranda and   
                 Xujin Chen and   
                     Jie Hu and   
                Xiaodong Hu and   
    Alfredo Candia-Véjar   Deterministic risk control for
                                  cost-effective network connections . . . 257--264
                  Feng Wang and   
                 Hongwei Du and   
              Erika Camacho and   
                    Kuai Xu and   
                 Wonjun Lee and   
                    Yan Shi and   
                      Shan Shan   On positive influence dominating sets in
                                  social networks  . . . . . . . . . . . . 265--269
                 Peihai Liu and   
                       Xiwen Lu   An improved approximation algorithm for
                                  single machine scheduling with job
                                  delivery . . . . . . . . . . . . . . . . 270--274

Theoretical Computer Science
Volume 412, Number 4--5, February 4, 2011

               Baoqiang Fan and   
                Shisheng Li and   
                    Li Zhou and   
                     Liqi Zhang   Scheduling resumable deteriorating jobs
                                  on a single machine with
                                  non-availability constraints . . . . . . 275--280
                   Zhong Li and   
                     Guohui Lin   The three column Bandpass problem is
                                  solvable in linear time  . . . . . . . . 281--299
Tullio Ceccherini-Silberstein and   
               Michel Coornaert   On the reversibility and the closed
                                  image property of linear cellular
                                  automata . . . . . . . . . . . . . . . . 300--306
            Ryotaro Okazaki and   
               Hirotaka Ono and   
             Taizo Sadahiro and   
             Masafumi Yamashita   Broadcastings and digit tilings on
                                  three-dimensional torus networks . . . . 307--319
             Paola Alimonti and   
         Esteban Feuerstein and   
                Luigi Laura and   
                  Umberto Nanni   Linear time analysis of properties of
                                  conflict-free and general Petri nets . . 320--338
                Li-Jui Chen and   
                Jinn-Jy Lin and   
            Min-Zheng Shieh and   
                  Shi-Chun Tsai   More on the Magnus--Derek game . . . . . 339--344
            Clemens Thielen and   
               Stephan Westphal   Complexity of the traveling tournament
                                  problem  . . . . . . . . . . . . . . . . 345--351
             Tatsuya Akutsu and   
             Daiji Fukagawa and   
            Atsuhiro Takasu and   
                Takeyuki Tamura   Exact algorithms for computing the tree
                                  edit distance between unordered trees    352--364
             Adam Kasperski and   
             Pawe\l Zieli\'nski   On the approximability of robust
                                  spanning tree problems . . . . . . . . . 365--374
                  C. Knauer and   
                 K. Kriegel and   
                       F. Stehn   Minimizing the weighted directed
                                  Hausdorff distance between colored point
                                  sets under translations and rigid
                                  motions  . . . . . . . . . . . . . . . . 375--382
              Hiroshi Nagamochi   Cop--robber guarding game with cycle
                                  robber-region  . . . . . . . . . . . . . 383--390
       Franz J. Brandenburg and   
                  Mao-cheng Cai   Shortest path and maximum flow problems
                                  in networks with additive losses and
                                  gains  . . . . . . . . . . . . . . . . . 391--401
         Genevi\`eve Paquin and   
          Christophe Reutenauer   On the superimposition of Christoffel
                                  words  . . . . . . . . . . . . . . . . . 402--418
              Jinshan Zhang and   
                   Fengshan Bai   An improved fully polynomial randomized
                                  approximation scheme (FPRAS) for
                                  counting the number of Hamiltonian
                                  cycles in dense digraphs . . . . . . . . 419--429
             Chun-Cheng Lin and   
               Hsu-Chun Yen and   
           Sheung-Hung Poon and   
                    Jia-Hao Fan   Complexity analysis of balloon drawing
                                  for rooted trees . . . . . . . . . . . . 430--447
          Warren D. Nichols and   
            Robert G. Underwood   Algebraic Myhill--Nerode Theorems  . . . 448--457
      Dana Pardubská and   
       Martin Plátek and   
                 Friedrich Otto   Parallel communicating grammar systems
                                  with regular control and skeleton
                                  preserving FRR automata  . . . . . . . . 458--477
                  Hunter Monroe   Speedup for natural problems and
                                  noncomputability . . . . . . . . . . . . 478--481
            Mikhail Andreev and   
           Ilya Razenshteyn and   
                 Alexander Shen   Not every domain of a plain decompressor
                                  contains the domain of a prefix-free one 482--486
             Amir Ben-Amram and   
                    Simon Yoffe   A simple and efficient
                                  Union--Find--Delete algorithm  . . . . . 487--492
                   S. Brlek and   
                  C. Reutenauer   Complexity and palindromic defect of
                                  infinite words . . . . . . . . . . . . . 493--497

Theoretical Computer Science
Volume 412, Number 6, February 16, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 499--499
                 Jon Timmis and   
               Paul Andrews and   
                    Andrew Hone   Preface  . . . . . . . . . . . . . . . . 500--501
               Chris McEwan and   
                      Emma Hart   On clonal selection  . . . . . . . . . . 502--516
              Thomas Jansen and   
               Christine Zarges   Analyzing different variants of immune
                                  inspired somatic contiguous
                                  hypermutations . . . . . . . . . . . . . 517--533
          Michael Elberfeld and   
                Johannes Textor   Negative selection algorithms on strings
                                  with efficient training and linear-time
                                  classification . . . . . . . . . . . . . 534--542
              Thomas Jansen and   
               Christine Zarges   On benefits and drawbacks of aging
                                  strategies for randomized search
                                  heuristics . . . . . . . . . . . . . . . 543--559
                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi

Theoretical Computer Science
Volume 412, Number 7, February 25, 2011

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--vi
        Christos Kaklamanis and   
                Martin Skutella   Preface  . . . . . . . . . . . . . . . . 561--562
              Wolfgang Bein and   
                Kazuo Iwama and   
               Jun Kawahara and   
        Lawrence L. Larmore and   
                James A. Oravec   A randomized algorithm for two servers
                                  in cross polytope spaces . . . . . . . . 563--572
                   Amitai Armon   On min--max $r$-gatherings . . . . . . . 573--582
               J. L. Hurink and   
                   J. J. Paulus   Improved online algorithms for parallel
                                  job scheduling and strip packing . . . . 583--593
              Marek Chrobak and   
                Mathilde Hurand   Better bounds for incremental medians    594--601
         Robert Krauthgamer and   
              Aranyak Mehta and   
                     Atri Rudra   Pricing commodities  . . . . . . . . . . 602--613
       Nedialko B. Dimitrov and   
                C. Greg Plaxton   Buyer--supplier games: Optimization over
                                  the core . . . . . . . . . . . . . . . . 614--625
                    Iftah Gamzu   Improved lower bounds for
                                  non-utilitarian truthfulness . . . . . . 626--632

Theoretical Computer Science
Volume 412, Number 8--10, March 4, 2011

          Vincenzo Bonifaci and   
             Peter Korteweg and   
Alberto Marchetti-Spaccamela and   
                   Leen Stougie   The distributed wireless gathering
                                  problem  . . . . . . . . . . . . . . . . 633--641
    György Dósa and   
                 Yuxin Wang and   
                    Xin Han and   
                         He Guo   Online scheduling with rearrangement on
                                  two related machines . . . . . . . . . . 642--653
                    R. Gray and   
                    A. Malheiro   Finite complete rewriting systems for
                                  regular semigroups . . . . . . . . . . . 654--661
                Guomin Yang and   
                   Chik How Tan   Certificateless public key encryption: a
                                  new generic construction and two
                                  pairing-free schemes . . . . . . . . . . 662--674
               Felix Brandt and   
              Felix Fischer and   
                  Markus Holzer   Equilibria of graphical games with
                                  symmetries . . . . . . . . . . . . . . . 675--685
                 Sun-Yuan Hsieh   On parallel recognition of cographs  . . 686--694
            Anthony Labarre and   
                  Josef Cibulka   Polynomial-time sortable stacks of burnt
                                  pancakes . . . . . . . . . . . . . . . . 695--702
              Heather Betel and   
                Paola Flocchini   On the relationship between fuzzy and
                                  Boolean cellular automata  . . . . . . . 703--713
                     Bo Cui and   
                  Lila Kari and   
                Shinnosuke Seki   Block insertion and deletion on
                                  trajectories . . . . . . . . . . . . . . 714--728
              Urban Larsson and   
              Peter Hegarty and   
            Aviezri S. Fraenkel   Invariant and dual subtraction games
                                  resolving the Duchêne--Rigo conjecture    729--735
Zoltán Fülöp and   
                 Magnus Steinby   Varieties of recognizable tree series
                                  over fields  . . . . . . . . . . . . . . 736--752
         A\"\ida Ouangraoua and   
           Valentin Guignon and   
               Sylvie Hamel and   
                  Cedric Chauve   A new algorithm for aligning nested
                                  arc-annotated sequences under arbitrary
                                  weight schemes . . . . . . . . . . . . . 753--764
             Martin Beaudry and   
                  Markus Holzer   On the size of inverse semigroups given
                                  by generators  . . . . . . . . . . . . . 765--772
               Kei Uchizawa and   
              Eiji Takimoto and   
                Takao Nishizeki   Size--energy tradeoffs for unate
                                  circuits computing symmetric Boolean
                                  functions  . . . . . . . . . . . . . . . 773--782
                 Yotam Elor and   
           Alfred M. Bruckstein   Uniform multi-agent deployment on a ring 783--795
                Jung Yeon Hwang   A note on an identity-based ring
                                  signature scheme with signer
                                  verifiability  . . . . . . . . . . . . . 796--804
  Zoltán Ésik and   
           Szabolcs Iván   Büchi context-free languages  . . . . . . 805--821
                  Josef Cibulka   On average and highest number of flips
                                  in pancake sorting . . . . . . . . . . . 822--834
  Z. Masáková and   
        E. Pelantová and   
                T. Vávra   Arithmetics in number systems with a
                                  negative base  . . . . . . . . . . . . . 835--845
           Feodor F. Dragan and   
             Fedor V. Fomin and   
               Petr A. Golovach   Approximation of minimum weight spanners
                                  for sparse graphs  . . . . . . . . . . . 846--852
     Christian Glaßer and   
Christian Reitwießner and   
               Victor Selivanov   The shrinking property for NP and coNP   853--864
             Zhongzhi Zhang and   
              Francesc Comellas   Farey graphs as models for complex
                                  networks . . . . . . . . . . . . . . . . 865--875
             Wai-Fong Chuan and   
               Chun-Yu Chen and   
                Hui-Ling Ho and   
                   Fang-Yi Liao   $\alpha$-words and the radix order . . . 876--891
                Pascal Pons and   
                Matthieu Latapy   Post-processing hierarchical community
                                  structures: Quality improvements and
                                  multi-scale view . . . . . . . . . . . . 892--900
                     Zeev Nutov   Approximating directed weighted-degree
                                  constrained networks . . . . . . . . . . 901--912
                Weifan Wang and   
                  Xubin Yue and   
                     Xuding Zhu   The surviving rate of an outerplanar
                                  graph for the firefighter problem  . . . 913--921
               Tobias Marschall   Construction of minimal deterministic
                                  finite automata from biological motifs   922--930

Theoretical Computer Science
Volume 412, Number 11, March 11, 2011

      Joaquín Aguado and   
                Michael Mendler   Constructive semantics for instantaneous
                                  reactions  . . . . . . . . . . . . . . . 931--961
César Domínguez and   
                    Julio Rubio   Effective homology of bicomplexes,
                                  formalized in Coq  . . . . . . . . . . . 962--970
               Giorgi Japaridze   Toggling operators in computability
                                  logic  . . . . . . . . . . . . . . . . . 971--1004
                 Foto N. Afrati   Determinacy and query rewriting for
                                  conjunctive queries and views  . . . . . 1005--1021
              René David   A short proof that adding some
                                  permutation rules to $\beta$ preserves
                                  $S N$  . . . . . . . . . . . . . . . . . 1022--1026
José Espírito Santo   A note on preservation of strong
                                  normalisation in the $\lambda$-calculus  1027--1032

Theoretical Computer Science
Volume 412, Number 12--14, March 18, 2011

                 Asaf Levin and   
                      Uri Yovel   Uniform unweighted set cover: The power
                                  of non-oblivious local search  . . . . . 1033--1053
               Takehiro Ito and   
            Erik D. Demaine and   
      Nicholas J. A. Harvey and   
  Christos H. Papadimitriou and   
              Martha Sideri and   
              Ryuhei Uehara and   
                      Yushi Uno   On the complexity of reconfiguration
                                  problems . . . . . . . . . . . . . . . . 1054--1065
                 R. Baldoni and   
   A. Fernández Anta and   
               K. Ioannidou and   
                      A. Milani   The impact of mobility on the geocasting
                                  problem in mobile ad-hoc networks:
                                  Solvability and cost . . . . . . . . . . 1066--1080
                  Yumei Huo and   
                   Hairong Zhao   Bicriteria scheduling concerned with
                                  makespan and total completion time
                                  subject to machine availability
                                  constraints  . . . . . . . . . . . . . . 1081--1091
                Li-ying Hou and   
                    Liying Kang   Online and semi-online hierarchical
                                  scheduling for load balancing on uniform
                                  machines . . . . . . . . . . . . . . . . 1092--1098
                   Martin Bader   The transposition median problem is
                                  NP-complete  . . . . . . . . . . . . . . 1099--1110
     \vSt\vepán Starosta   On theta-palindromic richness  . . . . . 1111--1121
                  Weiwei Wu and   
                 Minming Li and   
                    Enhong Chen   Min-energy scheduling for aligned jobs
                                  in accelerate model  . . . . . . . . . . 1122--1139
             Manfred Droste and   
                    Karin Quaas   A Kleene--Schützenberger theorem for
                                  weighted timed automata  . . . . . . . . 1140--1153
                 Mathieu Tracol   Recurrence and transience for finite
                                  probabilistic tables . . . . . . . . . . 1154--1168
     Vassilis Kountouriotis and   
           Christos Nomikos and   
             Panos Rondogiannis   A game-theoretic characterization of
                                  Boolean grammars . . . . . . . . . . . . 1169--1183
             S. Böcker and   
               Q. B. A. Bui and   
                       A. Truss   Computing bond orders in molecule graphs 1184--1195
               Oren Ben-Zwi and   
                     Amir Ronen   Local and global price of anarchy of
                                  graphical games  . . . . . . . . . . . . 1196--1207
                    Boting Yang   Fast edge searching and fast searching
                                  on graphs  . . . . . . . . . . . . . . . 1208--1219
           Beno\^\it Libert and   
                      Moti Yung   Efficient traceable signatures in the
                                  standard model . . . . . . . . . . . . . 1220--1242
               Hagit Attiya and   
                  Eshcar Hillel   Highly concurrent multi-word
                                  synchronization  . . . . . . . . . . . . 1243--1262
        Telikepalli Kavitha and   
                  Meghana Nasre   Popular matchings with variable item
                                  copies . . . . . . . . . . . . . . . . . 1263--1274
            Pinar Heggernes and   
             Daniel Meister and   
           Andrzej Proskurowski   Computing minimum distortion embeddings
                                  into a path for bipartite permutation
                                  graphs and threshold graphs  . . . . . . 1275--1297

Theoretical Computer Science
Volume 412, Number 15, March 25, 2011

        Valentin E. Brimkov and   
          Reneta P. Barneva and   
               Petra Wiederhold   Preface  . . . . . . . . . . . . . . . . 1299--1300
        Feliú Sagols and   
       Raúl Marín   Two discrete versions of the Inscribed
                                  Square Conjecture and some related
                                  problems . . . . . . . . . . . . . . . . 1301--1312
        Valentin E. Brimkov and   
               Andrew Leach and   
        Michael Mastroianni and   
                       Jimmy Wu   Guarding a set of line segments in the
                                  plane  . . . . . . . . . . . . . . . . . 1313--1324
           Alexandre Borghi and   
 Jérôme Darbon and   
              Sylvain Peyronnet   Exact optimization for the
                                  $\ell^1$-Compressive Sensing problem
                                  using a modified Dantzig--Wolfe method   1325--1337
                F. Malmberg and   
                J. Lindblad and   
                 N. Sladoje and   
                I. Nyström   A graph-based framework for sub-pixel
                                  image segmentation . . . . . . . . . . . 1338--1349
               Robin Strand and   
               Benedek Nagy and   
              Gunilla Borgefors   Digital distance functions on
                                  three-dimensional grids  . . . . . . . . 1350--1363
            Benedek Nagyand and   
                   Robin Strand   Approximating Euclidean circles by
                                  neighbourhood sequences in a hexagonal
                                  grid . . . . . . . . . . . . . . . . . . 1364--1377
             Yohan Thibault and   
           Akihiro Sugimoto and   
                Yukiko Kenmochi   $3$D discrete rotations using hinge
                                  angles . . . . . . . . . . . . . . . . . 1378--1391
   Stéphane Gosselin and   
          Guillaume Damiand and   
               Christine Solnon   Efficient search of combinatorial maps
                                  using signatures . . . . . . . . . . . . 1392--1405
                 Phuc Q. Le and   
       Abdullahi M. Iliyasu and   
               Fangyan Dong and   
                   Kaoru Hirota   Strategies for designing geometric
                                  transformations on quantum images  . . . 1406--1418
                    Xie Xie and   
                Jiu-Lun Fan and   
                        Yin Zhu   The optimal All-Partial-Sums algorithm
                                  in commutative semigroups and its
                                  applications for image thresholding
                                  segmentation . . . . . . . . . . . . . . 1419--1433
               Oscar Dalmau and   
                 Mariano Rivera   Alpha Markov Measure Field model for
                                  probabilistic image segmentation . . . . 1434--1441

Theoretical Computer Science
Volume 412, Number 16, April 1, 2011

         Ilias S. Kotsireas and   
           Bernard Mourrain and   
                  Victor Y. Pan   Preface  . . . . . . . . . . . . . . . . 1443--1444
                 Annie Cuyt and   
                   Wen-shin Lee   Sparse interpolation of multivariate
                                  rational functions . . . . . . . . . . . 1445--1456
      Philippe Pébay and   
           J. Maurice Rojas and   
              David C. Thompson   Optimizing $n$-variate $(n + k)$-nomials
                                  for small $k$  . . . . . . . . . . . . . 1457--1469
 Gudmund Skovbjerg Frandsen and   
                Piotr Sankowski   Dynamic normal forms and dynamic
                                  characteristic polynomial  . . . . . . . 1470--1483
              M. Kourniotis and   
                M. Mitrouli and   
               D. Triantafyllou   Parallel $QR$ processing of Generalized
                                  Sylvester matrices . . . . . . . . . . . 1484--1491
       André Galligo and   
                 Adrien Poteaux   Computing monodromy via continuation
                                  methods on random Riemann surfaces . . . 1492--1507
              Carlos Hoppen and   
      Virginia M. Rodrigues and   
                Vilmar Trevisan   A note on Gao's algorithm for polynomial
                                  factorization  . . . . . . . . . . . . . 1508--1522
              S. Chevillard and   
                J. Harrison and   
                M. Jolde\cs and   
                     Ch. Lauter   Efficient and accurate computation of
                                  upper bounds of approximation errors . . 1523--1543

Theoretical Computer Science
Volume 412, Number 17, April 8, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1545--1545
           Tobias Friedrich and   
           Christian Horoba and   
                  Frank Neumann   Illustration of fairness in evolutionary
                                  multi-objective optimization . . . . . . 1546--1556
               Chris McCaig and   
              Rachel Norman and   
               Carron Shankland   From individuals to populations: a mean
                                  field semantics for process algebra  . . 1557--1580
             Artiom Alhazov and   
                  Sergey Verlan   Minimization strategies for maximally
                                  parallel multiset rewriting systems  . . 1581--1591
               John H. Reif and   
               Sudheer Sahu and   
                       Peng Yin   Complexity of graph self-assembly in
                                  accretive systems and self-destructible
                                  systems  . . . . . . . . . . . . . . . . 1592--1605
                 Guowu Yang and   
                    Fei Xie and   
         William N. N. Hung and   
                Xiaoyu Song and   
             Marek A. Perkowski   Realization and synthesis of reversible
                                  functions  . . . . . . . . . . . . . . . 1606--1613
                  Pei Jiang and   
                 Ying-ping Chen   Free lunches on the discrete Lipschitz
                                  class  . . . . . . . . . . . . . . . . . 1614--1628
             Benjamin Doerr and   
              Frank Neumann and   
               Dirk Sudholt and   
                   Carsten Witt   Runtime analysis of the $1$-ANT ant
                                  colony optimizer . . . . . . . . . . . . 1629--1644
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 18, April 15, 2011

           Manindra Agrawal and   
                    Angsheng Li   Theory and applications of models of
                                  computation (TAMC 2008)  . . . . . . . . 1645--1645
             Kazuyuki Amano and   
                      Jun Tarui   A well-mixed function with circuit
                                  complexity $5 n$: Tightness of the
                                  Lachish--Raz-type bounds . . . . . . . . 1646--1651
          Klaus Ambos-Spies and   
           Serikzhan Badaev and   
               Sergey Goncharov   Inductive inference and computable
                                  numberings . . . . . . . . . . . . . . . 1652--1668
             M. M. Arslanov and   
               S. B. Cooper and   
          I. Sh. Kalimullin and   
                  M. I. Soskova   Splitting and nonsplitting in the
                                  $\Sigma_2^0$ enumeration degrees . . . . 1669--1685
                   Beate Bollig   On the OBDD complexity of the most
                                  significant bit of integer
                                  multiplication . . . . . . . . . . . . . 1686--1695
               J. Czyzowicz and   
                  S. Dobrev and   
 H. González-Aguilar and   
                R. Kralovic and   
                E. Kranakis and   
                 J. Opatrny and   
                  L. Stacho and   
                     J. Urrutia   Local $7$-coloring for planar subgraphs
                                  of unit disk graphs  . . . . . . . . . . 1696--1704
                 Jiamou Liu and   
                     Mia Minnes   Deciding the isomorphism problem in
                                  classes of unary automatic structures    1705--1717
                   Linqing Tang   On the derandomization of the graph test
                                  for homomorphism over groups . . . . . . 1718--1728
                  Cong Tian and   
                   Zhenhua Duan   Expressiveness of propositional
                                  projection temporal logic with star  . . 1729--1744
               Jianxin Wang and   
                Qilong Feng and   
                    Jianer Chen   An $O*(3.53^{3k})$-time parameterized
                                  algorithm for the $3$-set packing
                                  problem  . . . . . . . . . . . . . . . . 1745--1753
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 19, April 22, 2011

        Gábor Lugosi and   
                  Sandra Zilles   Preface  . . . . . . . . . . . . . . . . 1755--1755
       Malte Darnstädt and   
              Hans Ulrich Simon   Smart PAC-learners . . . . . . . . . . . 1756--1766
                Sanjoy Dasgupta   Two faces of active learning . . . . . . 1767--1781
           Nader H. Bshouty and   
                  Hanna Mazzawi   Reconstructing weighted graphs with
                                  minimal query complexity . . . . . . . . 1782--1790
      Nicol\`o Cesa-Bianchi and   
            Claudio Gentile and   
                   Fabio Vitale   Predicting the labels of an unknown
                                  graph via adaptive exploration . . . . . 1791--1804
                Sanjay Jain and   
               Qinglong Luo and   
             Pavel Semukhin and   
                  Frank Stephan   Uncountable automatic classes and
                                  learning . . . . . . . . . . . . . . . . 1805--1820
                  Ryo Yoshinaka   Efficient learning of multiple
                                  context-free languages with
                                  multidimensional substitutability from
                                  positive data  . . . . . . . . . . . . . 1821--1831
    Sébastien Bubeck and   
          Rémi Munos and   
                  Gilles Stoltz   Pure exploration in finitely-armed and
                                  continuous-armed bandits . . . . . . . . 1832--1852
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 20, April 29, 2011

            Pierre-Louis Curien   Preface  . . . . . . . . . . . . . . . . 1853--1859
               Jean-Yves Girard   Geometry of Interaction V: Logic in the
                                  hyperfinite factor . . . . . . . . . . . 1860--1883
             D. de Carvalho and   
                  M. Pagani and   
            L. Tortora de Falco   A semantic measure of the execution time
                                  in linear logic  . . . . . . . . . . . . 1884--1902
               Luca Paolini and   
            Elaine Pimentel and   
      Simona Ronchi Della Rocca   Strong normalization from an unusual
                                  point of view  . . . . . . . . . . . . . 1903--1915
         Benno van den Berg and   
                  Ieke Moerdijk   Aspects of predicative algebraic set
                                  theory, II: Realizability  . . . . . . . 1916--1940
Paulin Jacobé de Naurois and   
                 Virgile Mogbil   Correctness of linear logic proof
                                  structures is NL-complete  . . . . . . . 1941--1957
               Stefano Guerrini   A linear algorithm for MLL proof net
                                  correctness and sequentialization  . . . 1958--1978
               Paolo Tranquilli   Intuitionistic differential nets and
                                  lambda-calculus  . . . . . . . . . . . . 1979--1997
          Jean Goubault-Larrecq   Musings around the geometry of
                                  interaction, and coherence . . . . . . . 1998--2014
            Esfandiar Haghverdi   Towards a geometry of recursion  . . . . 2015--2028
               Ugo Dal Lago and   
                 Martin Hofmann   Realizability models and implicit
                                  complexity . . . . . . . . . . . . . . . 2029--2047
                Kazushige Terui   Computational ludics . . . . . . . . . . 2048--2071
               Max Kanovich and   
          Jacqueline Vauzeilles   Linear logic as a tool for planning
                                  under temporal uncertainty . . . . . . . 2072--2092
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 21, May 6, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 2093--2093
               Pierpaolo Degano   Preface  . . . . . . . . . . . . . . . . 2094--2094
                  Thao Dang and   
           Colas Le Guernic and   
                     Oded Maler   Computing reachable states for nonlinear
                                  biological models  . . . . . . . . . . . 2095--2107
        Elisabetta De Maria and   
      François Fages and   
       Aurélien Rizk and   
                Sylvain Soliman   Design, optimization and predictions of
                                  a coupled model of the cell cycle,
                                  circadian clock, DNA repair system,
                                  irinotecan metabolism and exposure
                                  control under temporal logic constraints 2108--2127
Frédéric Didier and   
        Thomas A. Henzinger and   
             Maria Mateescu and   
                    Verena Wolf   Approximation of event probabilities in
                                  noisy cellular processes . . . . . . . . 2128--2141
              Vashti Galpin and   
                  Jane Hillston   A semantic equivalence for Bio-PEPA
                                  based on discretisation of continuous
                                  values . . . . . . . . . . . . . . . . . 2142--2161
            Sumit Kumar Jha and   
     Christopher James Langmead   Synthesis and infeasibility analysis for
                                  stochastic models of biochemical systems
                                  using statistical model checking and
                                  abstraction refinement . . . . . . . . . 2162--2187
                   Bing Liu and   
                  David Hsu and   
              P. S. Thiagarajan   Probabilistic approximations of ODEs
                                  based bio-pathway dynamics . . . . . . . 2188--2206
      Aurélien Naldi and   
             Elisabeth Remy and   
             Denis Thieffry and   
              Claudine Chaouiya   Dynamically consistent reduction of
                                  logical regulatory graphs  . . . . . . . 2207--2218
                      Anonymous   Preface  . . . . . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 22, May 13, 2011

 Charles-Éric Drevet and   
           Md. Nazrul Islam and   
             Éric Schost   Optimization techniques for small matrix
                                  multiplication . . . . . . . . . . . . . 2219--2236
                Yi-Jiun Liu and   
               James K. Lan and   
               Well Y. Chou and   
                  Chiuyuan Chen   Constructing independent spanning trees
                                  for locally twisted cubes  . . . . . . . 2237--2252
         Cristian S. Calude and   
          André Nies and   
             Ludwig Staiger and   
                  Frank Stephan   Universal recursively enumerable sets of
                                  strings  . . . . . . . . . . . . . . . . 2253--2261
             Guillaume Aupy and   
                Olivier Bournez   On the number of binary-minded
                                  individuals required to compute
                                  $\sqrt{1/2}$ . . . . . . . . . . . . . . 2262--2267
         Jean-Paul Allouche and   
     Laurence Maillard-Teyssier   Inconstancy of finite and infinite
                                  sequences  . . . . . . . . . . . . . . . 2268--2281
                 Tamir Levi and   
                     Ami Litman   Bitonic sorters of minimal depth . . . . 2282--2295
            Vittorio Bil\`o and   
               Michele Flammini   Extending the notion of rationality of
                                  selfish agents: Second Order Nash
                                  equilibria . . . . . . . . . . . . . . . 2296--2311
       Angelos Mantzaflaris and   
           Bernard Mourrain and   
               Elias Tsigaridas   On continued fraction expansion of real
                                  roots of polynomial systems, complexity
                                  and condition numbers  . . . . . . . . . 2312--2330
Víctor Lavín Puente   On learning multivalued dependencies
                                  with queries . . . . . . . . . . . . . . 2331--2339
             Petar Mitankin and   
               Stoyan Mihov and   
                Klaus U. Schulz   Deciding word neighborhood with
                                  universal neighborhood automata  . . . . 2340--2355
              Nicolas Bedon and   
            Chloé Rispal   Series-parallel languages on scattered
                                  and countable posets . . . . . . . . . . 2356--2369
Vinícius G. P. de Sá and   
    Guilherme D. da Fonseca and   
      Raphael C. S. Machado and   
     Celina M. H. de Figueiredo   Complexity dichotomy on partial grid
                                  recognition  . . . . . . . . . . . . . . 2370--2379
                    Ji Tian and   
             T. C. E. Cheng and   
                   C. T. Ng and   
                  Jinjiang Yuan   Online scheduling on unbounded
                                  parallel-batch machines with
                                  incompatible job families  . . . . . . . 2380--2386
                Yancai Zhao and   
                Liying Kang and   
                 Moo Young Sohn   The algorithmic complexity of mixed
                                  domination in graphs . . . . . . . . . . 2387--2392
                Ziming Duan and   
                  Pingli Lv and   
              Lianying Miao and   
               Zhengke Miao and   
                     Cuiqi Wang   New upper bounds on the
                                  $L(2,1)$-labeling of the skew and
                                  converse skew product graphs . . . . . . 2393--2397
                   Guy Even and   
                    Moti Medina   Parallel randomized load balancing: a
                                  lower bound for a more general model . . 2398--2408
               Xiaofan Yang and   
                 Qiang Dong and   
                 Erjie Yang and   
                    Jianqiu Cao   Hamiltonian properties of twisted
                                  hypercube-like networks with more faulty
                                  elements . . . . . . . . . . . . . . . . 2409--2417
               Tseng-Kui Li and   
               Chia-Jui Lai and   
              Chang-Hsiung Tsai   A novel algorithm to embed a
                                  multi-dimensional torus into a locally
                                  twisted cube . . . . . . . . . . . . . . 2418--2424
            Nicolas Catusse and   
              Victor Chepoi and   
                   Yann Vax\`es   Embedding into the rectilinear plane in
                                  optimal $O(n^2)$ time  . . . . . . . . . 2425--2433
              Othon Michail and   
    Ioannis Chatzigiannakis and   
               Paul G. Spirakis   Mediated population protocols  . . . . . 2434--2450
               Johannes Fischer   Combined data structure for previous-
                                  and next-smaller-values  . . . . . . . . 2451--2456
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 23, May 20, 2011

                Jianer Chen and   
                S. Barry Cooper   Algorithms, complexity and computational
                                  models . . . . . . . . . . . . . . . . . 2457--2458
               Sergey Bereg and   
              Minghui Jiang and   
                Boting Yang and   
                     Binhai Zhu   On the red/blue spanning tree problem    2459--2467
                 Jin-Yi Cai and   
                  Pinyan Lu and   
                     Mingji Xia   A computational proof of complexity of
                                  some restricted counting problems  . . . 2468--2485
                 A. Carbone and   
                         L. Dib   Co-evolution and information signals in
                                  biological sequences . . . . . . . . . . 2486--2495
            Maw-Shang Chang and   
               Ling-Ju Hung and   
                  Ton Kloks and   
                Sheng-Lung Peng   Block-graph width  . . . . . . . . . . . 2496--2502
                Jianer Chen and   
                Qilong Feng and   
                   Yang Liu and   
                Songjian Lu and   
                   Jianxin Wang   Improved deterministic algorithms for
                                  weighted matching and packing problems   2503--2512
          Jirí Fiala and   
           Petr A. Golovach and   
          Jan Kratochvíl   Parameterized complexity of coloring
                                  problems: Treewidth versus vertex cover  2513--2523
                Marc Kaplan and   
                Sophie Laplante   Kolmogorov complexity and combinatorial
                                  methods in communication complexity  . . 2524--2535
          Daniel Lokshtanov and   
             Matthias Mnich and   
                  Saket Saurabh   A linear kernel for a planar connected
                                  dominating set . . . . . . . . . . . . . 2536--2543
            Atish Das Sarma and   
          Richard J. Lipton and   
              Danupon Nanongkai   Best-order streaming model . . . . . . . 2544--2555
                Anke van Zuylen   Linear programming based approximation
                                  algorithms for feedback set problems in
                                  bipartite tournaments  . . . . . . . . . 2556--2561
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 24, May 27, 2011

             Susanne Albers and   
   Alberto Marchetti-Spaccamela   Preface  . . . . . . . . . . . . . . . . 2563--2563
       Aris Anagnostopoulos and   
                 Ravi Kumar and   
           Mohammad Mahdian and   
                      Eli Upfal   Sorting and selection on dynamic data    2564--2576
                 Yossi Azar and   
           Aleksander Madry and   
          Thomas Moscibroda and   
         Debmalya Panigrahi and   
             Aravind Srinivasan   Maximum bipartite flow in networks with
                                  adaptive channel width . . . . . . . . . 2577--2587
Gerth Stòlting Brodal and   
               Beat Gfeller and   
Allan Grònlund Jòrgensen and   
                  Peter Sanders   Towards optimal range medians  . . . . . 2588--2601
        Flavio Chierichetti and   
            Silvio Lattanzi and   
           Alessandro Panconesi   Rumor spreading in social networks . . . 2602--2610
                Jan Draisma and   
           Eyal Kushilevitz and   
                   Enav Weinreb   Partition arguments in multiparty
                                  communication complexity . . . . . . . . 2611--2622
       Robert Elsässer and   
               Thomas Sauerwald   Tight bounds for the cover time of
                                  multiple random walks  . . . . . . . . . 2623--2641
                 Yuval Emek and   
          Pierre Fraigniaud and   
                Amos Korman and   
               Adi Rosén   Online computation with advice . . . . . 2642--2656
   Alexander Fanghänel and   
          Thomas Kesselheim and   
          Berthold Vöcking   Improved algorithms for latency
                                  minimization in wireless networks  . . . 2657--2667
               Arash Farzan and   
                   J. Ian Munro   Succinct representation of dynamic trees 2668--2678
        Telikepalli Kavitha and   
       Julián Mestre and   
                  Meghana Nasre   Popular mixed matchings  . . . . . . . . 2679--2690
                       Li Zhang   Proportional response dynamics in the
                                  Fisher market  . . . . . . . . . . . . . 2691--2698
             Fedor V. Fomin and   
          Pierre Fraigniaud and   
           Stephan Kreutzer and   
          Dimitrios M. Thilikos   Special Issue on ``Theory and
                                  Applications of Graph Searching
                                  Problems'' . . . . . . . . . . . . . . . 2699--2699
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 25, June 3, 2011

                  K. Keimel and   
              A. Rosenbusch and   
                   T. Streicher   Relating direct and predicate
                                  transformer partial correctness
                                  semantics for an imperative
                                  probabilistic-nondeterministic language  2701--2713
                 Mai Gehrke and   
                  Jacob Vosmaer   Canonical extensions and canonicity via
                                  dcpo presentations . . . . . . . . . . . 2714--2723
                    Uri Abraham   Logical classification of distributed
                                  algorithms (Bakery algorithms as an
                                  example) . . . . . . . . . . . . . . . . 2724--2745
                Yongjian Li and   
         William N. N. Hung and   
                    Xiaoyu Song   A novel formalization of symbolic
                                  trajectory evaluation semantics in
                                  Isabelle/HOL . . . . . . . . . . . . . . 2746--2765
                 Wesley Calvert   Metric structures and probabilistic
                                  computation  . . . . . . . . . . . . . . 2766--2775
                G. Bonfante and   
               J.-Y. Marion and   
                    J.-Y. Moyen   Quasi-interpretations a way to control
                                  resources  . . . . . . . . . . . . . . . 2776--2796
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 26, June 10, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 2797--2797
              Monika Heiner and   
             Adelinde Uhrmacher   Foundations of formal reconstruction of
                                  biochemical networks . . . . . . . . . . 2798--2799
           Markus Durzinsky and   
            Annegret Wagler and   
              Robert Weismantel   An algorithmic framework for network
                                  reconstruction . . . . . . . . . . . . . 2800--2815
            Elena Dimitrova and   
Luis David García-Puente and   
       Franziska Hinkelmann and   
            Abdul S. Jarrah and   
      Reinhard Laubenbacher and   
          Brandilyn Stigler and   
           Michael Stillman and   
              Paola Vera-Licona   Parameter estimation for Boolean models
                                  of biological networks . . . . . . . . . 2816--2826
       Aurélien Rizk and   
        Grégory Batt and   
      François Fages and   
                Sylvain Soliman   Continuous valuations of temporal logic
                                  specifications with applications to
                                  parameter optimization and robustness
                                  measures . . . . . . . . . . . . . . . . 2827--2839
               Geoffrey Koh and   
                  David Hsu and   
              P. S. Thiagarajan   Component-based construction of
                                  bio-pathway models: The parameter
                                  estimation problem . . . . . . . . . . . 2840--2853
              Radu Mateescu and   
          Pedro T. Monteiro and   
              Estelle Dumas and   
                  Hidde de Jong   CTRL: Extension of CTL with regular
                                  expressions and fairness operators to
                                  verify genetic regulatory networks . . . 2854--2883
           Martin Schwarick and   
           Alexej Tovchigrechko   IDD-based model validation of
                                  biochemical networks . . . . . . . . . . 2884--2908
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 27, June 16, 2011

               Arturo Carpi and   
               Clelia De Felice   Combinatorics on words . . . . . . . . . 2909--2910
        S. V. Avgustinovich and   
                    A. Frid and   
                   T. Kamae and   
                     P. Salimov   Infinite permutations of lowest maximal
                                  pattern complexity . . . . . . . . . . . 2911--2921
    A. Blondin Massé and   
                   S. Brlek and   
                   A. Garon and   
                S. Labbé   Equations on palindromes and circular
                                  words  . . . . . . . . . . . . . . . . . 2922--2930
          Maxime Crochemore and   
                Lucian Ilie and   
                    Liviu Tinta   The ``runs'' conjecture  . . . . . . . . 2931--2941
    Manuel Domínguez and   
                Thomas Noll and   
        Marco Castrillón   An extension of Christoffel duality to a
                                  subset of Sturm numbers and their
                                  characteristic words . . . . . . . . . . 2942--2954
         Francesca Fiorenzi and   
               Pascal Ochem and   
                   Elise Vaslet   Bounds for the generalized repetition
                                  threshold  . . . . . . . . . . . . . . . 2955--2963
                 Roberto Grossi   A quick tour on suffix arrays and
                                  compressed suffix arrays . . . . . . . . 2964--2973
                   D. Jamet and   
                  G. Paquin and   
                G. Richomme and   
                     L. Vuillon   On the fixed points of the iterated
                                  pseudopalindromic closure operator . . . 2974--2987
                 D. Merlini and   
                   R. Sprugnoli   Algebraic aspects of some Riordan arrays
                                  related to binary words avoiding a
                                  pattern  . . . . . . . . . . . . . . . . 2988--3001
        Xavier Provençal   Minimal non-convex words . . . . . . . . 3002--3009
               Michaël Rao   Last cases of Dejean's conjecture  . . . 3010--3018
            Antonio Restivo and   
                Giovanna Rosone   Balancing and clustering of words in the
                                  Burrows--Wheeler transform . . . . . . . 3019--3032
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 28, June 20, 2011

                Inge Bethke and   
                Alban Ponse and   
              Piet H. Rodenburg   Preface: This issue is dedicated to Jan
                                  Bergstra on the occasion of his sixtieth
                                  birthday . . . . . . . . . . . . . . . . 3033--3034
                 Luca Aceto and   
                Taolue Chen and   
         Anna Ingolfsdottir and   
                 Bas Luttik and   
                Jaco van de Pol   On the axiomatizability of priority II   3035--3044
                 Luca Aceto and   
              Matteo Cimini and   
         Anna Ingolfsdottir and   
       MohammadReza Mousavi and   
              Michel A. Reniers   SOS rule formats for zero and unit
                                  elements . . . . . . . . . . . . . . . . 3045--3071
    Miguel E. Andrés and   
       Catuscia Palamidessi and   
           Peter van Rossum and   
                   Ana Sokolova   Information hiding in probabilistic
                                  concurrent systems . . . . . . . . . . . 3072--3089
           Jos C. M. Baeten and   
                     Bas Luttik   Unguardedness mostly means many
                                  solutions  . . . . . . . . . . . . . . . 3090--3100
         Sebastian S. Bauer and   
             Rolf Hennicker and   
                 Martin Wirsing   Interface theories for concurrency and
                                  data . . . . . . . . . . . . . . . . . . 3101--3121
            Jan A. Bergstra and   
                Jaco van de Pol   A calculus for four-valued sequential
                                  logic  . . . . . . . . . . . . . . . . . 3122--3128
              Sjoerd Cranen and   
           Jan Friso Groote and   
                 Michel Reniers   A linear translation from CTL* to the
                                  first-order modal $\mu$-calculus . . . . 3129--3139
                 Dirk van Dalen   Brouwer's $\epsilon$-fixed point and
                                  Sperner's lemma  . . . . . . . . . . . . 3140--3144
          Razvan Diaconescu and   
                     Ionut Tutu   On the algebra of structured
                                  specifications . . . . . . . . . . . . . 3145--3174
        Jörg Endrullis and   
          Clemens Grabmayer and   
            Jan Willem Klop and   
            Vincent van Oostrom   On equal $\mu$-terms . . . . . . . . . . 3175--3202
        Jörg Endrullis and   
               Dimitri Hendriks   Lazy productivity via termination  . . . 3203--3225
             Javier Esparza and   
              Stefan Kiefer and   
           Michael Luttenberger   Derivation tree analysis for accelerated
                                  fixed-point computation  . . . . . . . . 3226--3241
             Herman Geuvers and   
               Robbert Krebbers   The correctness of Newman's typability
                                  algorithm and some of its extensions . . 3242--3261
           Fatemeh Ghassemi and   
                Wan Fokkink and   
                   Ali Movaghar   Verification of mobile ad hoc networks:
                                  an algebraic approach  . . . . . . . . . 3262--3282
             R. J. van Glabbeek   On cool congruence formats for weak
                                  bisimulations  . . . . . . . . . . . . . 3283--3302
          Peter Höfner and   
           Bernhard Möller   Fixing Zeno gaps . . . . . . . . . . . . 3303--3322
                    Bart Jacobs   Probabilities, distribution monads, and
                                  convex categories  . . . . . . . . . . . 3323--3336
        Gerald Lüttgen and   
                  Walter Vogler   Safe reasoning with Logic LTS  . . . . . 3337--3357
              Kim G. Larsen and   
             Uli Fahrenberg and   
                   Claus Thrane   Metrics for weighted transition systems:
                                  Axiomatization and complexity  . . . . . 3358--3369
          Piet H. Rodenburg and   
            Jan Willem Klop and   
              Karst Koymans and   
                   Jos Vrancken   The free process algebra generated by
                                  $\delta$ and $\epsilon$  . . . . . . . . 3370--3377
               J. V. Tucker and   
                   J. I. Zucker   Continuity of operators on continuous
                                  and discrete time streams  . . . . . . . 3378--3403
                  Albert Visser   On the ambiguation of Polish notation    3404--3411
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 29, July 1, 2011

                   Dong Han Kim   Return time complexity of Sturmian
                                  sequences  . . . . . . . . . . . . . . . 3413--3417
                Swan Dubois and   
       Maria Potop-Butucaru and   
       Sébastien Tixeuil   Dynamic FTSS in asynchronous systems:
                                  The case of unison . . . . . . . . . . . 3418--3439
                 Jianxi Fan and   
                Xiaohua Jia and   
               Baolei Cheng and   
                         Jia Yu   An efficient fault-tolerant routing
                                  algorithm in bijective connection
                                  networks with restricted faulty edges    3440--3450
                 Murat Cenk and   
            Ferruh Özbudak   Multiplication of polynomials modulo
                                  $x^n$  . . . . . . . . . . . . . . . . . 3451--3462
               Achim Blumensath   Recognisability for algebras of infinite
                                  trees  . . . . . . . . . . . . . . . . . 3463--3486
             Dániel Marx   Complexity of clique coloring and
                                  related problems . . . . . . . . . . . . 3487--3500
                     Ge Xia and   
                     Yong Zhang   On the small cycle transversal of planar
                                  graphs . . . . . . . . . . . . . . . . . 3501--3509
          Daniel Reidenbach and   
          Johannes C. Schneider   Restricted ambiguity of erasing
                                  morphisms  . . . . . . . . . . . . . . . 3510--3523
                   Xiaoming Sun   An improved lower bound on the
                                  sensitivity complexity of graph
                                  properties . . . . . . . . . . . . . . . 3524--3529
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
                  Saket Saurabh   An exact algorithm for minimum
                                  distortion embedding . . . . . . . . . . 3530--3536
               Amihood Amir and   
         Estrella Eisenberg and   
               Orgad Keller and   
                Avivit Levy and   
                      Ely Porat   Approximate string matching with stuck
                                  address bits . . . . . . . . . . . . . . 3537--3544
       Nicholas Korpelainen and   
             Vadim V. Lozin and   
        Dmitriy S. Malyshev and   
               Alexander Tiskin   Boundary properties of graphs for
                                  algorithmic graph problems . . . . . . . 3545--3554
              Carlos Hoppen and   
       Yoshiharu Kohayakawa and   
     Carlos Gustavo Moreira and   
         Rudini Menezes Sampaio   Testing permutation properties through
                                  subpermutations  . . . . . . . . . . . . 3555--3567
         Carlos Fisch Brito and   
                  Shailesh Vaya   Improved lower bound for deterministic
                                  broadcasting in radio networks . . . . . 3568--3578
               Wing-Kai Hon and   
                Tak-Wah Lam and   
                 Rahul Shah and   
               Siu-Lung Tam and   
           Jeffrey Scott Vitter   Cache-oblivious index for approximate
                                  string matching  . . . . . . . . . . . . 3579--3588
             Dieter Mitsche and   
              Maria Saumell and   
            Rodrigo I. Silveira   On the number of higher order Delaunay
                                  triangulations . . . . . . . . . . . . . 3589--3597
                Daniel Turetsky   Connectedness properties of dimension
                                  level sets . . . . . . . . . . . . . . . 3598--3603
                  Gabriele Fici   Special factors and the combinatorics of
                                  suffix and factor automata . . . . . . . 3604--3615
                   E. Goles and   
                 A. Moreira and   
                    I. Rapaport   Communication complexity in
                                  number-conserving and monotone cellular
                                  automata . . . . . . . . . . . . . . . . 3616--3628
                Steffen Kopecki   On iterated hairpin completion . . . . . 3629--3638
       Madhusudan Manjunath and   
                  Vikram Sharma   Applications of dimensionality reduction
                                  and exponential sums to graph
                                  automorphism . . . . . . . . . . . . . . 3639--3649
           Enrico Angelelli and   
                  Carlo Filippi   On the complexity of interval scheduling
                                  with a resource constraint . . . . . . . 3650--3657
           Hsien-Jone Hsieh and   
                   Dyi-Rong Duh   $\omega$-wide diameters of enhanced
                                  pyramid networks . . . . . . . . . . . . 3658--3675
         Symeon Bozapalidis and   
Zoltán Fülöp and   
                 George Rahonis   Equational tree transformations  . . . . 3676--3692
          Carmen C. Centeno and   
           Mitre C. Dourado and   
         Lucia Draque Penso and   
          Dieter Rautenbach and   
           Jayme L. Szwarcfiter   Irreversible conversion of graphs  . . . 3693--3700
                 Nicolas Baudru   Compositional synthesis of asynchronous
                                  automata . . . . . . . . . . . . . . . . 3701--3716
           Boaz Patt-Shamir and   
                    Dror Rawitz   Video distribution under multiple
                                  constraints  . . . . . . . . . . . . . . 3717--3730
                   Qian Cao and   
                Zhaohui Liu and   
                 T. C. E. Cheng   Semi-online scheduling with known
                                  partial information about job sizes on
                                  two identical machines . . . . . . . . . 3731--3737
    Spyridon Antonakopoulos and   
                     Lisa Zhang   Approximation algorithms for grooming in
                                  optical network design . . . . . . . . . 3738--3751
          F. Blanchet-Sadri and   
                Ilkyoo Choi and   
                  Robert Mercas   Avoiding large squares in partial words  3752--3758
                  Minghui Jiang   Inapproximability of maximal strip
                                  recovery . . . . . . . . . . . . . . . . 3759--3774
                  Mauro Mezzini   Fast minimal triangulation algorithm
                                  using minimum degree criterion . . . . . 3775--3787
                Daniel Lenz and   
Zuzana Masáková and   
         Edita Pelantová   Note on powers in three interval
                                  exchange transformations . . . . . . . . 3788--3794
               Pascal Caron and   
      Jean-Marc Champarnaud and   
                 Ludovic Mignot   Erratum to ``Acyclic automata and small
                                  expressions using multi-tilde-bar
                                  operators'' [Theoret. Comput. Sci. 411
                                  (38--39) (2010) 3423--3435]  . . . . . . 3795--3796
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 30, July 8, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 3797--3797
                    Jarkko Kari   Preface  . . . . . . . . . . . . . . . . 3798--3799
               M. Delacourt and   
                  V. Poupet and   
                  M. Sablik and   
                   G. Theyssier   Directional dynamics along arbitrary
                                  curves in cellular automata  . . . . . . 3800--3821
              Silvio Capobianco   Generalized Besicovitch and Weyl spaces:
                                  Topology, patterns, and sliding block
                                  codes  . . . . . . . . . . . . . . . . . 3822--3837
                  Marcus Pivato   Positive expansiveness versus network
                                  dimension in symbolic dynamical systems  3838--3855
                 Kenichi Morita   Simulating reversible Turing machines
                                  and cyclic tag systems by
                                  one-dimensional reversible cellular
                                  automata . . . . . . . . . . . . . . . . 3856--3865
                 M. Delorme and   
                 J. Mazoyer and   
                N. Ollinger and   
                   G. Theyssier   Bulking I: an abstract theory of bulking 3866--3880
                 M. Delorme and   
                 J. Mazoyer and   
                N. Ollinger and   
                   G. Theyssier   Bulking II: Classifications of cellular
                                  automata . . . . . . . . . . . . . . . . 3881--3905
                 Eric Goles and   
             Pierre Guillon and   
                  Ivan Rapaport   Traced communication complexity of
                                  cellular automata  . . . . . . . . . . . 3906--3916
              Martin Kutrib and   
                Andreas Malcher   Cellular automata with limited
                                  inter-cell bandwidth . . . . . . . . . . 3917--3931
              Chris Barrett and   
          Harry B. Hunt III and   
          Madhav V. Marathe and   
                 S. S. Ravi and   
      Daniel J. Rosenkrantz and   
             Richard E. Stearns   Modeling and analyzing social network
                                  dynamics using stochastic discrete
                                  graphical dynamical systems  . . . . . . 3932--3946
     Jean-Baptiste Rouquier and   
            Damien Regnault and   
            Éric Thierry   Stochastic minority on graphs  . . . . . 3947--3963
             Carolina Mejia and   
              J. Andres Montoya   On the complexity of sandpile critical
                                  avalanches . . . . . . . . . . . . . . . 3964--3974
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 31, July 15, 2011

            Michal Krynicki and   
              Jerzy Tomasik and   
               Konrad Zdanowski   Theories of initial segments of standard
                                  models of arithmetics and their complete
                                  extensions . . . . . . . . . . . . . . . 3975--3991
    Rostislav Horcík and   
                Kazushige Terui   Disjunction property and complexity of
                                  substructural logics . . . . . . . . . . 3992--4006
                David Basin and   
             Carlos Caleiro and   
                Jaime Ramos and   
                  Luca Vigan\`o   Distributed temporal logic for the
                                  analysis of security protocol models . . 4007--4043
             Joachim Biskup and   
                     Lena Wiese   A sound and complete model-generation
                                  procedure for consistent and
                                  confidentiality-preserving databases . . 4044--4072
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 32, July 22, 2011

                Ding-Zhu Du and   
               Yingfei Dong and   
                     Zhao Zhang   Preface  . . . . . . . . . . . . . . . . 4073--4073
                     Minming Li   Approximation algorithms for variable
                                  voltage processors: Min energy, max
                                  throughput and online heuristics . . . . 4074--4080
            Cristina Bazgan and   
       Basile Couëtoux and   
                     Zsolt Tuza   Complexity and approximation of the
                                  Constrained Forest problem . . . . . . . 4081--4091
              Robert Franke and   
               Ignaz Rutter and   
                Dorothea Wagner   Computing large matchings in planar
                                  graphs with fixed minimum degree . . . . 4092--4099
               Qian-Ping Gu and   
                   Hisao Tamaki   Constant-factor approximations of
                                  branch-decomposition and largest grid
                                  minor of planar graphs in $O(n^{1 +
                                  \epsilon})$ time . . . . . . . . . . . . 4100--4109
                    Li Chen and   
                         Bin Fu   Linear and sublinear time algorithms for
                                  the basis of abelian groups  . . . . . . 4110--4122
            Jonathan Kelner and   
               Petar Maymounkov   Electric routing and concurrent flow
                                  cutting  . . . . . . . . . . . . . . . . 4123--4135
          Raphael Eidenbenz and   
              Roger Wattenhofer   Good programming in transactional
                                  memory: Game theory meets multicore
                                  architecture . . . . . . . . . . . . . . 4136--4150
         Johannes Schneider and   
              Roger Wattenhofer   Bounds on contention management
                                  algorithms . . . . . . . . . . . . . . . 4151--4160
              Therese Biedl and   
          Stephane Durocher and   
                  Jack Snoeyink   Reconstructing polygons from scanner
                                  data . . . . . . . . . . . . . . . . . . 4161--4172
           Christian Knauer and   
       Maarten Löffler and   
          Marc Scherfenberg and   
                   Thomas Wolle   The directed Hausdorff distance between
                                  imprecise point sets . . . . . . . . . . 4173--4186
             Shuai Cheng Li and   
                    Yen Kaow Ng   On protein structure alignment under
                                  distance constraint  . . . . . . . . . . 4187--4199
            Diego Arroyuelo and   
           Francisco Claude and   
              Reza Dorrigiv and   
          Stephane Durocher and   
                    Meng He and   
Alejandro López-Ortiz and   
               J. Ian Munro and   
       Patrick K. Nicholson and   
         Alejandro Salinger and   
                  Matthew Skala   Untangled monotonic chains and adaptive
                                  range search . . . . . . . . . . . . . . 4200--4211
               Ankur Narang and   
     Rudrapatna K. Shyamasundar   Performance driven distributed
                                  scheduling of parallel hybrid
                                  computations . . . . . . . . . . . . . . 4212--4225
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 33, July 29, 2011

              Ajoy K. Datta and   
               Franck Petit and   
               Rachid Guerraoui   Stabilization, Safety, and Security of
                                  Distributed Systems (SSS 2009) . . . . . 4227--4227
                F. Abujarad and   
                 S. S. Kulkarni   Automated constraint-based addition of
                                  nonmasking and stabilizing
                                  fault-tolerance  . . . . . . . . . . . . 4228--4246
          Joffroy Beauquier and   
               Janna Burman and   
                    Shay Kutten   A self-stabilizing transformer for
                                  population protocols with covering . . . 4247--4259
               Martin Biely and   
                   Martin Hutle   Consensus when all processes may be
                                  Byzantine for some time  . . . . . . . . 4260--4272
     François Bonnet and   
                  Michel Raynal   On the road to the weakest failure
                                  detector for $k$-set agreement in
                                  message-passing systems  . . . . . . . . 4273--4284
             Alain Cournier and   
                Swan Dubois and   
                Vincent Villain   How to improve snap-stabilizing
                                  point-to-point communication space
                                  complexity?  . . . . . . . . . . . . . . 4285--4296
            Anurag Dasgupta and   
              Sukumar Ghosh and   
                       Xin Xiao   Fault containment in weakly stabilizing
                                  systems  . . . . . . . . . . . . . . . . 4297--4311
           K. GhoshDastidar and   
                      T. Herman   Separation of circulating tokens . . . . 4312--4324
                M. G. Gouda and   
                  H. B. Acharya   Nash equilibria in stabilizing systems   4325--4335
         Hirotsugu Kakugawa and   
            Yukiko Yamauchi and   
               Sayaka Kamei and   
            Toshimitsu Masuzawa   Observations on non-silent
                                  self-stabilizing algorithms in sensor
                                  networks with probabilistically
                                  intermittent link failures . . . . . . . 4336--4349
              Samia Souissi and   
              Taisuke Izumi and   
                    Koichi Wada   Oracle-based flocking of mobile robots
                                  in crash-recovery model  . . . . . . . . 4350--4360
               Volker Turau and   
                    Bernd Hauck   A fault-containing self-stabilizing $(3
                                  - 2 / (\Delta + 1))$-approximation
                                  algorithm for vertex cover in anonymous
                                  networks . . . . . . . . . . . . . . . . 4361--4371
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 34, August 5, 2011

         Beno\^\it Caillaud and   
         Beno\^\it Delahaye and   
              Kim G. Larsen and   
                 Axel Legay and   
         Mikkel L. Pedersen and   
               Andrzej Wasowski   Constraint Markov Chains . . . . . . . . 4373--4404
           Isabelle Gnaedig and   
       Hél\`ene Kirchner   Proving weak properties of rewriting . . 4405--4438
      Fernando Rosa-Velardo and   
         David de Frutos-Escrig   Decidability and complexity of Petri
                                  nets with unordered data . . . . . . . . 4439--4451
                 John Stell and   
                Michael Worboys   Relations between adjacency trees  . . . 4452--4468
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 35, August 12, 2011

                Bruno Salvy and   
              Bob Sedgewick and   
            Mich\`ele Soria and   
       Wojciech Szpankowski and   
         Brigitte Vallée   Philippe Flajolet, the Father of
                                  Analytic Combinatorics . . . . . . . . . 4469--4470
         Sylvie Delaët and   
      Partha Sarathi Mandal and   
         Mariusz A. Rokicki and   
       Sébastien Tixeuil   Deterministic secure positioning in
                                  wireless sensor networks . . . . . . . . 4471--4481
               Guy Kortsarz and   
                     Zeev Nutov   Approximating some network design
                                  problems with node costs . . . . . . . . 4482--4492
          Guillaume Ch\`eze and   
       André Galligo and   
           Bernard Mourrain and   
         Jean-Claude Yakoubsohn   A subdivision method for computing
                                  nearest gcd with certification . . . . . 4493--4503
                   Ro-Yu Wu and   
             Jou-Ming Chang and   
               Kung-Jui Pai and   
                    Yue-Li Wang   Amortized efficiency of generating
                                  planar paths in convex position  . . . . 4504--4512
             Yuan-Kang Shih and   
                  Shin-Shin Kao   One-to-one disjoint path covers on
                                  $k$-ary $n$-cubes  . . . . . . . . . . . 4513--4530
                  Lily Chen and   
                Xueliang Li and   
                   Yongtang Shi   The complexity of determining the
                                  rainbow vertex-connection of a graph . . 4531--4535
      Sergey V. Sevastyanov and   
         Bertrand M. T. Lin and   
                Hsiao-Lan Huang   Tight complexity analysis of the
                                  relocation problem with arbitrary
                                  release dates  . . . . . . . . . . . . . 4536--4544
                 M. Shoaran and   
                       A. Thomo   Evolving schemas for streaming XML . . . 4545--4557
           Sheng-Hao Chiang and   
                  I-Chen Wu and   
                  Ping-Hung Lin   Drawn $k$-in-a-row games . . . . . . . . 4558--4569
         Hans L. Bodlaender and   
Stéphan Thomassé and   
                     Anders Yeo   Kernel bounds for disjoint cycles and
                                  disjoint paths . . . . . . . . . . . . . 4570--4578
                  Heidi Gebauer   Finding and enumerating Hamilton cycles
                                  in $4$-regular graphs  . . . . . . . . . 4579--4591
               Amir Hashemi and   
           Benyamin M.-Alizadeh   Applying IsRewritten criterion on
                                  Buchberger algorithm . . . . . . . . . . 4592--4603
           Alexander Meduna and   
                     Petr Zemek   Workspace theorems for
                                  regular-controlled grammars  . . . . . . 4604--4612
            Kazuhisa Makino and   
              Suguru Tamaki and   
                Masaki Yamamoto   An exact algorithm for the Boolean
                                  connectivity problem for $k$-CNF . . . . 4613--4618
           Ashley Montanaro and   
        Harumichi Nishimura and   
                   Rudy Raymond   Unbounded-error quantum query complexity 4619--4628
            S. Kanthi Kiran and   
            N. S. Narayanaswamy   Hardness of subgraph and supergraph
                                  problems in $c$-tournaments  . . . . . . 4629--4635
              Sook-Yeon Kim and   
                 Jae-Ha Lee and   
                 Jung-Heum Park   Disjoint path covers in recursive
                                  circulants $G(2^m, 4)$ with faulty
                                  elements . . . . . . . . . . . . . . . . 4636--4649
             Akinobu Miyata and   
                  Jun Tarui and   
                  Etsuji Tomita   Learning Boolean functions in $A C^0$ on
                                  attribute and classification noise ---
                                  Estimating an upper bound on attribute
                                  and classification noise . . . . . . . . 4650--4660
            Yaniv Altshuler and   
           Alfred M. Bruckstein   Static and expanding grid coverage with
                                  ant robots: Complexity results . . . . . 4661--4674
              Nathann Cohen and   
              David Coudert and   
            Dorian Mazauric and   
 Napoleão Nepomuceno and   
                  Nicolas Nisse   Tradeoffs in process strategy games with
                                  application in the WDM reconfiguration
                                  problem  . . . . . . . . . . . . . . . . 4675--4687
           Stephan Kreutzer and   
             Sebastian Ordyniak   Digraph decompositions and monotonicity
                                  in digraph searching . . . . . . . . . . 4688--4703
               Iyad A. Kanj and   
              Andreas Wiese and   
                  Fenghui Zhang   Local algorithms for edge colorings in
                                  UDGs . . . . . . . . . . . . . . . . . . 4704--4714
                Daniel Perrucci   Linear solving for sign determination    4715--4720
         Damian Bogdanowicz and   
            Krzysztof Giaro and   
              Robert Janczewski   Consensus models: Computational
                                  complexity aspects in modern approaches
                                  to the list coloring problem . . . . . . 4721--4728
                  Chae Hoon Lim   A note on the average number of RSA
                                  fixed points . . . . . . . . . . . . . . 4729--4737
           Thomas W. Cusick and   
          Lavinia Corina Ciungu   Sum of digits sequences modulo $m$ . . . 4738--4741
                   James Currie   Lexicographically least words in the
                                  orbit closure of the Rudin--Shapiro word 4742--4746
                   Ruo-Wei Hung   Embedding two edge-disjoint Hamiltonian
                                  cycles into locally twisted cubes  . . . 4747--4753
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 36, August 19, 2011

             Sre\vcko Brlek and   
        Xavier Provençal   Advances in discrete geometry  . . . . . 4755--4756
   Valérie Berthé   About thin arithmetic discrete planes    4757--4769
                    Anders Kock   Affine connections, midpoint formation,
                                  and point reflection . . . . . . . . . . 4770--4777
    A. Blondin Massé and   
                   S. Brlek and   
                   A. Garon and   
                S. Labbé   Two infinite families of polyominoes
                                  that tile the plane by translation in
                                  two distinct ways  . . . . . . . . . . . 4778--4786
             Olivier Bodini and   
            Thomas Fernique and   
                Michael Rao and   
      Éric Rémila   Distances on rhombus tilings . . . . . . 4787--4794
                 S. Brocchi and   
                 A. Frosini and   
                     S. Rinaldi   A reconstruction algorithm for a
                                  subclass of instances of the $2$-color
                                  problem  . . . . . . . . . . . . . . . . 4795--4804
         Henri-Alex Esbelin and   
     Rémy Malgouyres and   
                  Colin Cartade   Convergence of binomial-based derivative
                                  estimation for $C^2$ noisy discretized
                                  curves . . . . . . . . . . . . . . . . . 4805--4813
     Émilie Charrier and   
             Fabien Feschet and   
                   Lilian Buzer   Computing efficiently the lattice width
                                  in any dimension . . . . . . . . . . . . 4814--4823
             Mohamed Tajine and   
                   Alain Daurat   Patterns for multigrid equidistributed
                                  functions: Application to general
                                  parabolas and length estimation  . . . . 4824--4840
             Sre\vcko Brlek and   
              Michel Koskas and   
        Xavier Provençal   A linear time and space algorithm for
                                  detecting path intersection in
                                  $\mathbb{Z}^d$ . . . . . . . . . . . . . 4841--4850
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 37, August 26, 2011

Mauricio Ayala-Rincón and   
            Elaine Pimentel and   
            Fairouz Kamareddine   Preface  . . . . . . . . . . . . . . . . 4851--4852
               Camilo Rocha and   
  César Muñoz and   
                   Gilles Dowek   A formal library of set relations and
                                  its application to synchronous languages 4853--4866
               Delia Kesner and   
                  Fabien Renaud   A prismoid framework for languages with
                                  resources  . . . . . . . . . . . . . . . 4867--4892
Francicleber Martins Ferreira and   
             Ana Teresa Martins   Recursive definitions and fixed-points
                                  on well-founded structures . . . . . . . 4893--4904
             Jonathan P. Seldin   The search for a reduction in
                                  combinatory logic equivalent to
                                  $\lambda$-reduction  . . . . . . . . . . 4905--4918
              Fulya Horozal and   
                   Florian Rabe   Representing model theory in a
                                  type-theoretical logical framework . . . 4919--4945
      Mario R. F. Benevides and   
   L. Menasché Schechter   A study on multi-dimensional products of
                                  graphs and hybrid logics . . . . . . . . 4946--4966
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 38, September 2, 2011

                Bart Jacobs and   
                Milad Niqui and   
                 Jan Rutten and   
                Alexandra Silva   Preface  . . . . . . . . . . . . . . . . 4967--4968
  Jirí Adámek and   
              Stefan Milius and   
            Jirí Velebil   On second-order iterative monads . . . . 4969--4988
                   A. Balan and   
                        A. Kurz   On coalgebras over algebras  . . . . . . 4989--5005
              Venanzio Capretta   Coalgebras in functional programming and
                                  type theory  . . . . . . . . . . . . . . 5006--5024
              Corina C\^\irstea   Maximal traces and path-based
                                  coalgebraic temporal logics  . . . . . . 5025--5042
                    Bartek Klin   Bialgebras for structural operational
                                  semantics: an introduction . . . . . . . 5043--5069
              Clemens Kupke and   
                 Dirk Pattinson   Coalgebraic semantics of modal logics:
                                  an overview  . . . . . . . . . . . . . . 5070--5094
                   Ana Sokolova   Probabilistic systems coalgebraically: a
                                  survey . . . . . . . . . . . . . . . . . 5095--5110
                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--vii

Theoretical Computer Science
Volume 412, Number 39, September 9, 2011

               Pawel Pralat and   
                 Changping Wang   An edge deletion model for complex
                                  networks . . . . . . . . . . . . . . . . 5111--5120
          Marcin Bienkowski and   
              Marek Chrobak and   
                     Lukasz Jez   Randomized competitive algorithms for
                                  online buffer management in the adaptive
                                  adversary model  . . . . . . . . . . . . 5121--5131
              Alexander Okhotin   Expressive power of LL($k$) Boolean
                                  grammars . . . . . . . . . . . . . . . . 5132--5155
              Walter Didimo and   
                Peter Eades and   
                Giuseppe Liotta   Drawing graphs with right angle
                                  crossings  . . . . . . . . . . . . . . . 5156--5166
             Atsushi Murata and   
             Akira Matsubayashi   Minimum energy broadcast on rectangular
                                  grid wireless networks . . . . . . . . . 5167--5175
               Wing-Kai Hon and   
          Kunihiko Sadakane and   
                  Wing-Kin Sung   Succinct data structures for Searchable
                                  Partial Sums with optimal worst-case
                                  performance  . . . . . . . . . . . . . . 5176--5186
         Binh-Minh Bui-Xuan and   
             Jan Arne Telle and   
               Martin Vatshelle   Boolean-width of graphs  . . . . . . . . 5187--5204
          Marcin Kami\'nski and   
              Paul Medvedev and   
                 Martin Milanic   Shortest paths between shortest paths    5205--5210
               Kyungkuk Lim and   
                Kangbok Lee and   
                   Soo Y. Chang   Improved bounds for online scheduling
                                  with eligibility constraints . . . . . . 5211--5224
                   Ming Liu and   
              Feifeng Zheng and   
               Chengbin Chu and   
                     Yinfeng Xu   Optimal algorithms for online scheduling
                                  on parallel machines to minimize the
                                  makespan with a periodic availability
                                  constraint . . . . . . . . . . . . . . . 5225--5231
              N. Ghareghani and   
          M. Mohammad-Noori and   
                   P. Sharifani   On $z$-factorization and
                                  $c$-factorization of standard
                                  episturmian words  . . . . . . . . . . . 5232--5238
               Amihood Amir and   
              Gad M. Landau and   
              Joong Chae Na and   
                Heejin Park and   
                Kunsoo Park and   
                 Jeong Seop Sim   Efficient algorithms for consensus
                                  string problems minimizing both distance
                                  sum and radius . . . . . . . . . . . . . 5239--5246
                Haitao Wang and   
          Amitabh Chaudhary and   
                  Danny Z. Chen   Online rectangle filling . . . . . . . . 5247--5275
                 Tero Harju and   
                Tomi Kärki   On the number of frames in binary words  5276--5284
                   A. Thomo and   
                   S. Venkatesh   Rewriting of visibly pushdown languages
                                  for XML data integration . . . . . . . . 5285--5297
         Elliot Anshelevich and   
                 Bugra Caskurlu   Exact and approximate equilibria for
                                  optimal group network formation  . . . . 5298--5314
                   A. Monti and   
                   B. Sinaimeri   Rainbow graph splitting  . . . . . . . . 5315--5324
            Cédric Bentz   On the hardness of finding near-optimal
                                  multicuts in directed acyclic graphs . . 5325--5332
                  Yang Fang and   
                   Xiwen Lu and   
                     Peihai Liu   Online batch scheduling on parallel
                                  machines with delivery times . . . . . . 5333--5339
               Wen-Qi Zhang and   
                   Yong-Jin Liu   Approximating the longest paths in grid
                                  graphs . . . . . . . . . . . . . . . . . 5340--5350
               Ruo-Wei Hung and   
                Maw-Shang Chang   An efficient certifying algorithm for
                                  the Hamiltonian cycle problem on
                                  circular-arc graphs  . . . . . . . . . . 5351--5373
                Shenghui Su and   
            Shuwang Lü and   
                     Xiubin Fan   Asymptotic granularity reduction and its
                                  application  . . . . . . . . . . . . . . 5374--5386
                     Sujin Shin   Pseudo-cyclic renewal systems  . . . . . 5387--5399
     Émilie Charlier and   
                Narad Rampersad   The growth function of $S$-recognizable
                                  sets . . . . . . . . . . . . . . . . . . 5400--5408
                  Livio Colussi   The convergence classes of Collatz
                                  function . . . . . . . . . . . . . . . . 5409--5419
              Martin Hoefer and   
          Vahab S. Mirrokni and   
          Heiko Röglin and   
                 Shang-Hua Teng   Competitive routing over time  . . . . . 5420--5432
            Arnold Beckmann and   
                 Samuel R. Buss   Corrected upper bounds for free-cut
                                  elimination  . . . . . . . . . . . . . . 5433--5445
                Guomin Yang and   
                   Chik How Tan   Certificateless cryptography with KGC
                                  trust level $3$  . . . . . . . . . . . . 5446--5457
                   Qi Cheng and   
                     Yu-Hsin Li   On the minimum gap between sums of
                                  square roots of small integers . . . . . 5458--5465
            Pinar Heggernes and   
             Daniel Meister and   
            Charis Papadopoulos   Graphs of linear clique-width at most
                                  $3$  . . . . . . . . . . . . . . . . . . 5466--5486
             Benjamin Steinberg   The Cerný conjecture for one-cluster
                                  automata with prime length cycle . . . . 5487--5491
Gwénaël Richomme and   
  Patrice Séébold   On factorially balanced sets of words    5492--5497
              Xiaofeng Chen and   
               Willy Susilo and   
              Fangguo Zhang and   
                 Haibo Tian and   
                         Jin Li   Identity-based trapdoor mercurial
                                  commitments and applications . . . . . . 5498--5512
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 40, September 16, 2011

               Shlomi Dolev and   
           Sandeep Kulkarni and   
           André Schiper   Preface  . . . . . . . . . . . . . . . . 5513--5514
              Fredrik Manne and   
              Morten Mjelde and   
            Laurence Pilard and   
       Sébastien Tixeuil   A self-stabilizing $2/3$-approximation
                                  algorithm for the maximum matching
                                  problem  . . . . . . . . . . . . . . . . 5515--5526
               Volker Turau and   
                    Bernd Hauck   A new analysis of a self-stabilizing
                                  maximum weight matching algorithm with
                                  approximation ratio $2$  . . . . . . . . 5527--5540
              Ajoy K. Datta and   
        Lawrence L. Larmore and   
                Priyanka Vemula   Self-stabilizing leader election in
                                  optimal space under an arbitrary
                                  scheduler  . . . . . . . . . . . . . . . 5541--5561
              Jorge A. Cobb and   
               Mohamed G. Gouda   Stabilization of max-min fair networks
                                  without per-flow state . . . . . . . . . 5562--5579
             Peter Robinson and   
                  Ulrich Schmid   The Asynchronous Bounded-Cycle model . . 5580--5601
               Martin Biely and   
              Ulrich Schmid and   
                  Bettina Weiss   Synchronous consensus under hybrid
                                  process and link failures  . . . . . . . 5602--5630
          Jaap-Henk Hoepman and   
            Andreas Larsson and   
           Elad M. Schiller and   
               Philippas Tsigas   Secure and self-stabilizing clock
                                  synchronization in sensor networks . . . 5631--5647
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 41, September 23, 2011

         L'. Balková and   
        E. Pelantová and   
                    S. Starosta   On Brlek--Reutenauer conjecture  . . . . 5649--5655
          George Barmpalias and   
                     C. S. Vlek   Kolmogorov complexity of initial
                                  segments of sequences and arithmetical
                                  definability . . . . . . . . . . . . . . 5656--5667
         Cristian S. Calude and   
                Kai Salomaa and   
                Tania K. Roblot   Finite state complexity  . . . . . . . . 5668--5677
            Alessandro Cincotti   The game of $n$-player Cutcake . . . . . 5678--5683
          Alfredo De Santis and   
          Anna Lisa Ferrara and   
                Barbara Masucci   Efficient provably-secure hierarchical
                                  key assignment schemes . . . . . . . . . 5684--5699
            Dariusz Dereniowski   Connected searching of weighted trees    5700--5713
         Christiane Frougny and   
     Edita Pelantová and   
        Milena Svobodová   Parallel addition in non-standard
                                  numeration systems . . . . . . . . . . . 5714--5727
                 Ilya Goldstein   Subword complexity of uniform D0L words
                                  over finite groups . . . . . . . . . . . 5728--5743
                   G. Gutin and   
                   M. Jones and   
                         A. Yeo   Kernels for below-upper-bound
                                  parameterizations of the hitting set and
                                  directed dominating set problems . . . . 5744--5751
            Adrian Kosowski and   
            Alfredo Navarra and   
            Cristina M. Pinotti   Synchronous black hole search in
                                  directed graphs  . . . . . . . . . . . . 5752--5759
            Sergio Rajsbaum and   
                  Jorge Urrutia   Some problems in distributed
                                  computational geometry . . . . . . . . . 5760--5770
               Asaf Shiloni and   
                  Noa Agmon and   
                 Gal A. Kaminka   Of robot ants and elephants: a
                                  computational comparison . . . . . . . . 5771--5788
                  S. Turaev and   
                  J. Dassow and   
                     M. Selamat   Nonterminal complexity of tree
                                  controlled grammars  . . . . . . . . . . 5789--5795
                 Andrew Drucker   Block sensitivity of minterm-transitive
                                  functions  . . . . . . . . . . . . . . . 5796--5801
        Pedro García and   
 Damián López and   
           José Ruiz and   
       Gloria I. Álvarez   From regular expressions to smaller NFAs 5802--5807
              P.-C. Héam   On the complexity of computing the
                                  profinite closure of a rational language 5808--5813
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 42, September 30, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 5815--5815
            Hung Son Nguyen and   
              Sankar K. Pal and   
                Andrzej Skowron   Rough sets and fuzzy sets in natural
                                  computing  . . . . . . . . . . . . . . . 5816--5819
   Zoltán Csajbók   Approximation of sets based on partial
                                  covering . . . . . . . . . . . . . . . . 5820--5833
         Avatharam Ganivada and   
             Soumitra Dutta and   
                  Sankar K. Pal   Fuzzy rough granular neural networks,
                                  fuzzy granules, and classification . . . 5834--5853
               Danilo Horta and   
         Ivan C. de Andrade and   
      Ricardo J. G. B. Campello   Evolutionary fuzzy clustering of
                                  relational data  . . . . . . . . . . . . 5854--5870
             Richard Jensen and   
                 Chris Cornelis   Fuzzy-rough nearest neighbour
                                  classification and prediction  . . . . . 5871--5884
                 P. Lingras and   
                     C. J. Butz   Conservative and aggressive rough SVR
                                  modeling . . . . . . . . . . . . . . . . 5885--5901
                    Juan Lu and   
              Sheng-Gang Li and   
              Xiao-Fei Yang and   
                    Wen-Qing Fu   Categorical properties of
                                  $M$-indiscernibility spaces  . . . . . . 5902--5908
                  Nick J. Pizzi   Fuzzy quartile encoding as a
                                  preprocessing method for biomedical
                                  pattern classification . . . . . . . . . 5909--5925
             Sheela Ramanna and   
           Amir H. Meghdadi and   
                James F. Peters   Nature-inspired framework for measuring
                                  visual image resemblance: a near rough
                                  set approach . . . . . . . . . . . . . . 5926--5938
            Andrzej Skowron and   
               Piotr Wasilewski   Information systems in modeling
                                  interactive computations on granules . . 5939--5959
             Marcin Szczuka and   
               Dominik \'Slezak   Feedforward neural networks for compound
                                  signals  . . . . . . . . . . . . . . . . 5960--5973
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 43, October 7, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 5975--5975
            Roberto Barbuti and   
  Andrea Maggiolo-Schettini and   
              Paolo Milazzo and   
               Giovanni Pardini   Spatial Calculus of Looping Sequences    5976--6001
          Francisco Chicano and   
         L. Darrell Whitley and   
               Enrique Alba and   
                 Francisco Luna   Elementary landscape decomposition of
                                  the frequency assignment problem . . . . 6002--6019
             Benjamin Doerr and   
              Anton Eremeev and   
              Frank Neumann and   
           Madeleine Theile and   
              Christian Thyssen   Evolutionary algorithms and dynamic
                                  programming  . . . . . . . . . . . . . . 6020--6035
          Francesca Cordero and   
András Horváth and   
             Daniele Manini and   
              Lucia Napione and   
     Massimiliano De Pierro and   
               Simona Pavan and   
               Andrea Picco and   
              Andrea Veglio and   
              Matteo Sereno and   
         Federico Bussolino and   
               Gianfranco Balbo   Simplification of a complex signal
                                  transduction model using invariants and
                                  flow equivalent servers  . . . . . . . . 6036--6057
                  Vashti Galpin   Equivalences for a biological process
                                  algebra  . . . . . . . . . . . . . . . . 6058--6082
                  Lila Kari and   
               Beno\^\it Masson   Polyominoes simulating
                                  arbitrary-neighborhood zippers and
                                  tilings  . . . . . . . . . . . . . . . . 6083--6100
                Daniel Lobo and   
          Francisco J. Vico and   
             Jürgen Dassow   Graph grammars with string-regulated
                                  rewriting  . . . . . . . . . . . . . . . 6101--6111
          David Soloveichik and   
                   Erik Winfree   Erratum to ``The computational power of
                                  Benenson automata'' [Theoret. Comput.
                                  Sci. 344 (2005) 279--297]  . . . . . . . 6112--6113
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 44, October 14, 2011

           Natasha Alechina and   
              Mehdi Dastani and   
                Brian Logan and   
           John-Jules Ch. Meyer   Reasoning about plan revision in BDI
                                  agent programs . . . . . . . . . . . . . 6115--6134
             Patrick Cousot and   
                  Radhia Cousot   Grammar semantics, analysis and parsing
                                  by abstract interpretation . . . . . . . 6135--6192
              Koji Nakazawa and   
             Makoto Tatsuta and   
         Yukiyoshi Kameyama and   
                 Hiroshi Nakano   Type checking and typability in
                                  domain-free lambda calculi . . . . . . . 6193--6207
             Amit Sasturkar and   
                  Ping Yang and   
           Scott D. Stoller and   
             C. R. Ramakrishnan   Policy analysis for Administrative
                                  Role-Based Access Control  . . . . . . . 6208--6234
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 45, October 21, 2011

                    Yohji Akama   Set systems: Order types, continuous
                                  nondeterministic deformations, and
                                  quasi-orders . . . . . . . . . . . . . . 6235--6251
L'ubomíra Balková and   
               Karel Brinda and   
                   Ondrej Turek   Abelian complexity of infinite words
                                  associated with quadratic Parry numbers  6252--6260
              Flavia Bonomo and   
                Sara Mattia and   
               Gianpaolo Oriolo   Bounded coloring of co-comparability
                                  graphs and the pickup and delivery tour
                                  combination problem  . . . . . . . . . . 6261--6268
                   Xin Chen and   
                    Yan Lan and   
               Attila Benko and   
    György Dósa and   
                        Xin Han   Optimal algorithms for online scheduling
                                  with bounded rearrangement at the end    6269--6278
                Eddie Cheng and   
             Marc J. Lipman and   
László Lipták and   
                  David Sherman   Conditional matching preclusion for the
                                  arrangement graphs . . . . . . . . . . . 6279--6289
             Henning Fernau and   
              Joachim Kneis and   
             Dieter Kratsch and   
           Alexander Langer and   
           Mathieu Liedloff and   
              Daniel Raible and   
               Peter Rossmanith   An exact algorithm for the Maximum Leaf
                                  Spanning Tree problem  . . . . . . . . . 6290--6302
           Peter J. Grabner and   
               Wolfgang Steiner   Redundancy of minimal weight expansions
                                  in Pisot bases . . . . . . . . . . . . . 6303--6315
              Xiangquan Gui and   
               Xiaohong Hao and   
             Yuanping Zhang and   
                   Xuerong Yong   A volume first maxima-finding algorithm  6316--6326
                  Yun Bao Huang   The complexity of smooth words on
                                  $2$-letter alphabets . . . . . . . . . . 6327--6339
               Takehiro Ito and   
          Marcin Kami\'nski and   
       Daniël Paulusma and   
          Dimitrios M. Thilikos   Parameterizing cut sets in a graph by
                                  the number of their components . . . . . 6340--6350
               Stasys Jukna and   
                Georg Schnitger   Yet harder knapsack problems . . . . . . 6351--6358
                Marcos Kiwi and   
            Gonzalo Navarro and   
                  Claudio Telha   On-line approximate string matching with
                                  bounded errors . . . . . . . . . . . . . 6359--6370
            Tomás Kulich   Dynamic monopolies with randomized
                                  starting configuration . . . . . . . . . 6371--6381
           Prashant Kushwah and   
                     Sunder Lal   An efficient identity based generalized
                                  signcryption scheme  . . . . . . . . . . 6382--6389
            Yaron Orenstein and   
                       Dana Ron   Testing Eulerianity and connectivity in
                                  directed sparse graphs . . . . . . . . . 6390--6408
             Jung-Heum Park and   
                     Insung Ihm   Strong matching preclusion . . . . . . . 6409--6419
                    Adam Woryna   The concept of duality for automata over
                                  a changing alphabet and generation of a
                                  free group by such automata  . . . . . . 6420--6431
              Tomoyuki Yamakami   Immunity and pseudorandomness of
                                  context-free languages . . . . . . . . . 6432--6450
                    Wei Ren and   
                      Qing Zhao   A note on `Algorithms for connected set
                                  cover problem and fault-tolerant
                                  connected set cover problem' . . . . . . 6451--6454
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 46, October 28, 2011

    A. Blondin Massé and   
                   S. Brlek and   
            S. Labbé and   
                     L. Vuillon   Palindromic complexity of codings of
                                  rotations  . . . . . . . . . . . . . . . 6455--6463
                  Yuehua Bu and   
                       Yulin Li   Backbone coloring of planar graphs
                                  without special circles  . . . . . . . . 6464--6468
    Ioannis Chatzigiannakis and   
              Othon Michail and   
           Stavros Nikolaou and   
       Andreas Pavlogiannis and   
               Paul G. Spirakis   Passively mobile communicating machines
                                  that use restricted space  . . . . . . . 6469--6483
             Fedor V. Fomin and   
           Petr A. Golovach and   
              Daniel Lokshtanov   Guard games on graphs: Keep the intruder
                                  out! . . . . . . . . . . . . . . . . . . 6484--6497
                 Javier Herranz   Restricted adaptive oblivious transfer   6498--6506
             Roman Kolpakov and   
               Michaël Rao   On the number of Dejean words over
                                  alphabets of $5$, $6$, $7$, $8$, $9$ and
                                  $10$ letters . . . . . . . . . . . . . . 6507--6516
          Elizabeth Maltais and   
                    Lucia Moura   Hardness results for covering arrays
                                  avoiding forbidden edges and
                                  error-locating arrays  . . . . . . . . . 6517--6530
             Claudio Marini and   
                Giulia Simi and   
               Andrea Sorbi and   
            Marianna Sorrentino   A note on algebras of languages  . . . . 6531--6536
    Conrado Martínez and   
            Alois Panholzer and   
               Helmut Prodinger   The analysis of Range Quickselect and
                                  related problems . . . . . . . . . . . . 6537--6555
                       A. Moura   The word problem for $\omega$-terms over
                                  \sf DA . . . . . . . . . . . . . . . . . 6556--6569
               Shiying Wang and   
                  Shurong Zhang   Embedding Hamiltonian paths in $k$-ary
                                  $n$-cubes with conditional edge faults   6570--6584
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 47, November 4, 2011

              Massimo Merro and   
        Francesco Ballardin and   
               Eleonora Sibilio   A timed calculus for wireless systems    6585--6611
              Matthias Baaz and   
           Agata Ciabattoni and   
               Norbert Preining   First-order satisfiability in Gödel
                                  logics: an NP-complete fragment  . . . . 6612--6623
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 48, November 11, 2011

                Golnaz Badkobeh   Fewest repetitions versus
                                  maximal-exponent powers in infinite
                                  binary words . . . . . . . . . . . . . . 6625--6633
            Mukul S. Bansal and   
              Jianrong Dong and   
    David Fernández-Baca   Comparing and aggregating partially
                                  resolved trees . . . . . . . . . . . . . 6634--6652
                  D. Dombek and   
  Z. Masáková and   
            E. Pelantová   Number representation using generalized
                                  $-\beta$-transformation  . . . . . . . . 6653--6665
               Leah Epstein and   
           Hanan Zebedat-Haider   Online scheduling with rejection and
                                  withdrawal . . . . . . . . . . . . . . . 6666--6674
     Joaquim Gabarró and   
        Alina García and   
                    Maria Serna   The complexity of game isomorphism . . . 6675--6695
                Xiaoyang Gu and   
                   Jack H. Lutz   Effective dimensions and relative
                                  frequencies  . . . . . . . . . . . . . . 6696--6711
                Caixia Jing and   
              Wanzhen Huang and   
                   Guochun Tang   Minimizing total completion time for
                                  re-entrant flow shop scheduling problems 6712--6719
                  Changwook Kim   Quasi-rocking real-time pushdown
                                  automata . . . . . . . . . . . . . . . . 6720--6735
                Wonhong Nam and   
              Hyunyoung Kil and   
                    Dongwon Lee   On the computational complexity of
                                  behavioral description-based Web service
                                  composition  . . . . . . . . . . . . . . 6736--6749
             S. Nikoletseas and   
             C. Raptopoulos and   
                 P. G. Spirakis   On the independence number and
                                  Hamiltonicity of uniform random
                                  intersection graphs  . . . . . . . . . . 6750--6760
       Daniël Paulusma and   
          Johan M. M. van Rooij   On partitioning a graph into two
                                  connected subgraphs  . . . . . . . . . . 6761--6769
      Vladimeros Vladimerou and   
         Pavithra Prabhakar and   
         Mahesh Viswanathan and   
                  Geir Dullerud   Specifications for decidable hybrid
                                  games  . . . . . . . . . . . . . . . . . 6770--6785
               Chaoxia Yang and   
                      Guojun Li   A polynomial time approximation scheme
                                  for embedding hypergraph in a weighted
                                  cycle  . . . . . . . . . . . . . . . . . 6786--6793
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 49, November 18, 2011

             Laura Bozzelli and   
                 Axel Legay and   
               Sophie Pinchinat   Hardness of preorder checking for basic
                                  formalisms . . . . . . . . . . . . . . . 6795--6808
          Sebastian Danicic and   
     Richard W. Barraclough and   
                Mark Harman and   
            John D. Howroyd and   
           Ákos Kiss and   
            Michael R. Laurence   A unifying theory of control dependence
                                  and its application to arbitrary program
                                  structures . . . . . . . . . . . . . . . 6809--6842
                  Daniel Weller   On the elimination of quantifier-free
                                  cuts . . . . . . . . . . . . . . . . . . 6843--6854
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 50, November 25, 2011

            Carme \`Alvarez and   
                Maria Blesa and   
                    Maria Serna   The robustness of stability under link
                                  and node failures  . . . . . . . . . . . 6855--6878
        Ferdinando Cicalese and   
              Tobias Jacobs and   
              Eduardo Laber and   
                 Marco Molinaro   On the complexity of searching in trees
                                  and partially ordered structures . . . . 6879--6896
             Stuart MacLean and   
                Suprakash Datta   The minimum positional error incurred by
                                  any connectivity-based positioning
                                  algorithm for mobile wireless systems    6897--6912
               Haisheng Tan and   
              Tiancheng Lou and   
               Yuexuan Wang and   
            Qiang-Sheng Hua and   
              Francis C. M. Lau   Exact algorithms to minimize
                                  interference in wireless sensor networks 6913--6925
            Jurek Czyzowicz and   
             David Ilcinkas and   
            Arnaud Labourel and   
                   Andrzej Pelc   Asynchronous deterministic rendezvous in
                                  bounded terrains . . . . . . . . . . . . 6926--6937
             Chao-Wen Huang and   
             Hui-Ling Huang and   
                 Sun-Yuan Hsieh   Edge-bipancyclicity of star graphs with
                                  faulty elements  . . . . . . . . . . . . 6938--6947
         Jens Maßberg and   
                  Jan Schneider   Rectangle packing with additional
                                  restrictions . . . . . . . . . . . . . . 6948--6958
                Tomohiro I. and   
           Shunsuke Inenaga and   
               Hideo Bannai and   
                Masayuki Takeda   Verifying and enumerating parameterized
                                  border arrays  . . . . . . . . . . . . . 6959--6981
                Marek Cygan and   
         Geevarghese Philip and   
           Marcin Pilipczuk and   
           Michal Pilipczuk and   
       Jakub Onufry Wojtaszczyk   Dominating set is fixed parameter
                                  tractable in claw-free graphs  . . . . . 6982--7000
              Petr Golovach and   
            Pinar Heggernes and   
             Dieter Kratsch and   
          Daniel Lokshtanov and   
             Daniel Meister and   
                  Saket Saurabh   Bandwidth on AT-free graphs  . . . . . . 7001--7008
           Frantisek Kardos and   
        Ján Katrenic and   
               Ingo Schiermeyer   On computing the minimum $3$-path vertex
                                  cover and dissociation number of graphs  7009--7017
               Isolde Adler and   
              Frederic Dorn and   
             Fedor V. Fomin and   
                 Ignasi Sau and   
          Dimitrios M. Thilikos   Faster parameterized algorithms for
                                  minor containment  . . . . . . . . . . . 7018--7028
              Zhongxuan Luo and   
                   Wenyu Hu and   
                  Dongwoo Sheen   The nearest complex polynomial with a
                                  zero in a given complex domain . . . . . 7029--7043
                 Jianhua Tu and   
                     Wenli Zhou   A primal-dual approximation algorithm
                                  for the vertex cover $P_3$ problem . . . 7044--7048
                Zhigang Cao and   
                 Xiaoguang Yang   Selfish bin covering . . . . . . . . . . 7049--7058
       Tamás Fleiner and   
           Robert W. Irving and   
               David F. Manlove   An algorithm for a super-stable
                                  roommates problem  . . . . . . . . . . . 7059--7065
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 51, December 2, 2011

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 7067--7067
             David A. Meyer and   
              James Pommersheim   On the uselessness of quantum queries    7068--7074
            Daniel Manrique and   
Alfonso Rodríguez-Patón and   
              Petr Sosík   On the scalability of biocomputing
                                  algorithms: The case of the maximum
                                  clique problem . . . . . . . . . . . . . 7075--7086
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii

Theoretical Computer Science
Volume 412, Number 52, December 9, 2011

                Ariel Kulik and   
             Hadas Shachnai and   
               Oded Shmueli and   
                  Robert Sayegh   Approximation schemes for deal splitting
                                  and covering integer programs with
                                  multiplicity constraints . . . . . . . . 7087--7098
      Hajnal Andréka and   
    Szabolcs Mikulás and   
    István Németi   The equational theory of Kleene lattices 7099--7108
           Michele Flammini and   
           Gianpiero Monaco and   
           Luca Moscardelli and   
           Mordechai Shalom and   
                    Shmuel Zaks   Optimizing regenerator cost in traffic
                                  grooming . . . . . . . . . . . . . . . . 7109--7121
                  Neil A. McKay   Canonical forms of uptimals  . . . . . . 7122--7132
          George Barmpalias and   
              T. F. Sterkenburg   On the number of infinite sequences with
                                  trivial initial segment complexity . . . 7133--7146
                Xiaohui Bei and   
                   Wei Chen and   
             Shang-Hua Teng and   
               Jialin Zhang and   
                     Jiajie Zhu   Bounded budget betweenness centrality
                                  game for strategic network formations    7147--7168
                   E. Goles and   
              P.-E. Meunier and   
                I. Rapaport and   
                   G. Theyssier   Erratum to: ``Communication Complexity
                                  and Intrinsic Universality in Cellular
                                  Automata'' [Theor. Comput. Sci. 412
                                  (1--2) (2011) 2--21] . . . . . . . . . . 7169--7170
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 413, Number 1, January 6, 2012

       Alessandra Di Pierro and   
                  Gethin Norman   Editorial: Quantitative Aspects of
                                  Programming Languages  . . . . . . . . . 1--1
             Anna Philippou and   
                  Insup Lee and   
                  Oleg Sokolsky   PADS: an approach to modeling resource
                                  demand and supply for the formal
                                  analysis of hierarchical scheduling  . . 2--20
         Pavol Cerný and   
        Thomas A. Henzinger and   
             Arjun Radhakrishna   Simulation distances . . . . . . . . . . 21--35
        Joost-Pieter Katoen and   
            Jaco van de Pol and   
    Mariëlle Stoelinga and   
                    Mark Timmer   A linear process-algebraic format with
                                  data for probabilistic automata  . . . . 36--57
              Suzana Andova and   
          Sonja Georgievska and   
                   Nikola Trcka   Branching bisimulation congruence for
                                  probabilistic systems  . . . . . . . . . 58--72
              Alessandro Aldini   Approximating Markovian testing
                                  equivalence  . . . . . . . . . . . . . . 73--86
          Faranak Heidarian and   
            Julien Schmaltz and   
               Frits Vaandrager   Analysis of a clock synchronization
                                  protocol for wireless sensor networks    87--105
          Richard A. Hayden and   
             Anton Stefanek and   
              Jeremy T. Bradley   Fluid computation of passage-time
                                  distributions in large Markov models . . 106--141
              Elvira Albert and   
                Puri Arenas and   
               Samir Genaim and   
              German Puebla and   
              Damiano Zanardini   Cost analysis of object-oriented
                                  bytecode programs  . . . . . . . . . . . 142--159
          Alessandro Bianco and   
               Marco Faella and   
             Fabio Mogavero and   
                 Aniello Murano   Quantitatively fair scheduling . . . . . 160--175
                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--vii


Theoretical Computer Science
Volume 414, Number 1, January 13, 2012

                 Eric Angel and   
           Evripidis Bampis and   
               Nicolas Thibault   Randomized truthful algorithms for
                                  scheduling selfish tasks on parallel
                                  machines . . . . . . . . . . . . . . . . 1--8
              Hajo Broersma and   
           Petr A. Golovach and   
       Daniël Paulusma and   
                      Jian Song   Updating the complexity status of
                                  coloring graphs without a fixed induced
                                  linear forest  . . . . . . . . . . . . . 9--19
                 Michel Dekking   Paperfolding morphisms, planefilling
                                  curves, and fractal tiles  . . . . . . . 20--37
Katarzyna Jesse-Józefczyk   The possible cardinalities of global
                                  secure sets in cographs  . . . . . . . . 38--46
              Marion Le Gonidec   On the complexity of a family of
                                  $k$-context-free sequences . . . . . . . 47--54
                Angsheng Li and   
                    Yicheng Pan   Characterizations of locally testable
                                  linear- and affine-invariant families    55--75
  François Petitjean and   
        Pierre Gançarski   Summarizing a set of time series by
                                  averaging: From Steiner sequence to
                                  compact multiple alignment . . . . . . . 76--91
            Richard Schmied and   
                 Claus Viehmann   Approximating edge dominating set in
                                  dense graphs . . . . . . . . . . . . . . 92--99
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 415, Number 1, January 20, 2012

            Norihiro Kamide and   
               Heinrich Wansing   Proof theory of Nelson's paraconsistent
                                  logic: a uniform perspective . . . . . . 1--38
                  Marius Petria   Generic constructions for behavioral
                                  specifications . . . . . . . . . . . . . 39--59
                Yisong Wang and   
               Jia-Huai You and   
                Li Yan Yuan and   
               Yi-Dong Shen and   
                   Mingyi Zhang   The loop formula based semantics of
                                  description logic programs . . . . . . . 60--85


Theoretical Computer Science
Volume 416, Number 1, January 27, 2012

        Flavio D'Alessandro and   
        Benedetto Intrigila and   
             Stefano Varricchio   Quasi-polynomials, linear Diophantine
                                  equations and semi-linear sets . . . . . 1--16
  Zoltán Ésik and   
           Szabolcs Iván   On Müller context-free grammars . . . . . 17--32
                  Svante Janson   Renewal theory in the analysis of tries
                                  and strings  . . . . . . . . . . . . . . 33--54
            Rohit Khandekar and   
               Guy Kortsarz and   
                     Zeev Nutov   Approximating fault-tolerant
                                  group-Steiner problems . . . . . . . . . 55--64
               Jiangxu Kong and   
                Weifan Wang and   
                     Xuding Zhu   The surviving rate of planar graphs  . . 65--70
          Alexander Okhotin and   
                Oksana Yakimova   Language equations with complementation:
                                  Expressive power . . . . . . . . . . . . 71--86
               Marcus Poggi and   
                   David Sotelo   A linear time approximation algorithm
                                  for permutation flow shop scheduling . . 87--94
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 417, Number 1, February 3, 2012

        Petr Hlinený and   
          Antonín Kucera   Preface  . . . . . . . . . . . . . . . . 1--1
Ivona Bezáková and   
            Adam J. Friedlander   Counting and sampling minimum $(s,
                                  t)$-cuts in weighted planar graphs in
                                  polynomial time  . . . . . . . . . . . . 2--11
              Davide Bil\`o and   
            Luciano Gual\`a and   
                 Guido Proietti   Improved approximability and
                                  non-approximability results for graph
                                  diameter decreasing problems . . . . . . 12--22
           Nader H. Bshouty and   
                  Hanna Mazzawi   Toward a deterministic polynomial time
                                  algorithm with optimal additive query
                                  complexity . . . . . . . . . . . . . . . 23--35
                Samir Datta and   
              Meena Mahajan and   
      B. V. Raghavendra Rao and   
             Michael Thomas and   
               Heribert Vollmer   Counting classes and the fine structure
                                  between $NC^1$ and $L$ . . . . . . . . . 36--49
                   Julien David   Average complexity of Moore's and
                                  Hopcroft's algorithms  . . . . . . . . . 50--65
Subrahmanyam Kalyanasundaram and   
          Richard J. Lipton and   
           Kenneth W. Regan and   
                Farbod Shokrieh   Improved simulation of nondeterministic
                                  Turing machines  . . . . . . . . . . . . 66--73
          Giulio Manzonetto and   
               Paolo Tranquilli   Strong normalization of $ML^F$ via a
                                  calculus of coercions  . . . . . . . . . 74--94
                  Siamak Tazari   Faster approximation schemes and
                                  parameterized algorithms on (odd-)
                                  $H$-minor-free graphs  . . . . . . . . . 95--107
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 418, Number 1, February 10, 2012

              Allan Borodin and   
                 Ioana Ivan and   
                    Yuli Ye and   
                    Bryce Zimny   On sum coloring and sum multi-coloring
                                  for restricted families of graphs  . . . 1--13
             Manfred Droste and   
                   Heiko Vogler   Weighted automata and multi-valued
                                  logics over arbitrary bounded lattices   14--36
Antonio Fernández Anta and   
         Miguel A. Mosteiro and   
            Christopher Thraves   Deterministic recurrent communication in
                                  restricted sensor networks . . . . . . . 37--47
        Séverine Fratani   Regular sets over extended tree
                                  structures . . . . . . . . . . . . . . . 48--70
                 Roman Kolpakov   On primary and secondary repetitions in
                                  words  . . . . . . . . . . . . . . . . . 71--81
                  Cheng-Nan Lai   Two conditions for reducing the maximal
                                  length of node-disjoint paths in
                                  hypercubes . . . . . . . . . . . . . . . 82--91
                  Hongli Xu and   
             Liusheng Huang and   
                   Wang Liu and   
              Yindong Zhang and   
                    Yanjing Sun   Degree-bounded minimum spanning tree for
                                  unit disk graph  . . . . . . . . . . . . 92--105
              Zhifang Zhang and   
             Yeow Meng Chee and   
                   San Ling and   
                  Mulan Liu and   
                  Huaxiong Wang   Threshold changeable secret sharing
                                  schemes revisited  . . . . . . . . . . . 106--115
                Shinnosuke Seki   Absoluteness of subword inequality is
                                  undecidable  . . . . . . . . . . . . . . 116--120
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 419, Number 1, February 17, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
            Roberto Barbuti and   
             Francesca Levi and   
              Paolo Milazzo and   
                  Guido Scatena   Probabilistic model checking of
                                  biological systems with uncertain
                                  kinetic rates  . . . . . . . . . . . . . 2--16
          Avraham Ben-Aroya and   
                  Amnon Ta-Shma   Better short-seed quantum-proof
                                  extractors . . . . . . . . . . . . . . . 17--25
           Giulio Caravagna and   
                  Jane Hillston   Bio-PEPAd: a non-Markovian extension of
                                  Bio-PEPA . . . . . . . . . . . . . . . . 26--49
              Steffen Finck and   
               Hans-Georg Beyer   Performance analysis of the simultaneous
                                  perturbation stochastic approximation
                                  algorithm on the noisy sphere model  . . 50--72
                  Lvzhou Li and   
                 Daowen Qiu and   
                Xiangfu Zou and   
                   Lvjun Li and   
                   Lihua Wu and   
                   Paulo Mateus   Characterizations of one-way general
                                  quantum finite automata  . . . . . . . . 73--91
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 420, Number 1, February 24, 2012

                Samuele Giraudo   Intervals of balanced binary trees in
                                  the Tamari lattice . . . . . . . . . . . 1--27
           Petr A. Golovach and   
          Marcin Kami\'nski and   
       Daniël Paulusma and   
          Dimitrios M. Thilikos   Induced packing of odd cycles in planar
                                  graphs . . . . . . . . . . . . . . . . . 28--35
                   Teturo Kamae   Behavior of various complexity functions 36--47
            Telikepalli Kavitha   Properties of Gomory--Hu co-cycle bases  48--55
                 Daniel Kirsten   Decidability, undecidability, and
                                  PSPACE-completeness of the twins
                                  property in the tropical semiring  . . . 56--63
                   Dana Ron and   
                     Gilad Tsur   Testing computability by width-two OBDDs 64--79
   T. K. Subrahmonian Moothathu   Eulerian entropy and non-repetitive
                                  subword complexity . . . . . . . . . . . 80--88
                  Weiwei Wu and   
                 Minming Li and   
               Wanyong Tian and   
             Jason Chun Xue and   
                    Enhong Chen   Single and multiple device DSA problems,
                                  complexities and online algorithms . . . 89--98
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 421, Number 1, March 2, 2012

           A. Çivril and   
               M. Magdon-Ismail   Column subset selection via sparse
                                  approximation of SVD . . . . . . . . . . 1--14
      Bhadrachalam Chitturi and   
              I. Hal Sudborough   Bounding prefix transposition distance
                                  for strings and permutations . . . . . . 15--24
             Harold Connamacher   Exact thresholds for DPLL on random
                                  XOR-SAT and NP-complete extensions of
                                  XOR-SAT  . . . . . . . . . . . . . . . . 25--55
          Khaled Elbassioni and   
                Hans Raj Tiwary   Complexity of approximating the vertex
                                  centroid of a polyhedron . . . . . . . . 56--61
               Shiying Wang and   
                    Yuxing Yang   Fault tolerance in bubble-sort graph
                                  networks . . . . . . . . . . . . . . . . 62--69
                       Alan Guo   Winning strategies for aperiodic
                                  subtraction games  . . . . . . . . . . . 70--73
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 422, Number 1, March 9, 2012

               Amihood Amir and   
             Yonatan Aumann and   
                Avivit Levy and   
                    Yuri Roshko   Quasi-distinct parsing and optimal
                                  compression methods  . . . . . . . . . . 1--14
      Nuttapong Attrapadung and   
             Javier Herranz and   
        Fabien Laguillaumie and   
           Beno\^\it Libert and   
           Elie de Panafieu and   
                 Carla R\`afols   Attribute-based encryption schemes with
                                  constant-size ciphertexts  . . . . . . . 15--38
                     Bin Fu and   
                  Yumei Huo and   
                   Hairong Zhao   Coordinated scheduling of production and
                                  delivery with production window and
                                  delivery capacity constraints  . . . . . 39--51
                  Urban Larsson   The $\star$-operator and invariant
                                  subtraction games  . . . . . . . . . . . 52--58
              Mitja Lustrek and   
                Ivan Bratko and   
                    Matjaz Gams   Independent-valued minimax: Pathological
                                  or beneficial? . . . . . . . . . . . . . 59--77
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 423, Number 1, March 16, 2012

              Hajo Broersma and   
           Petr A. Golovach and   
       Daniël Paulusma and   
                      Jian Song   Determining the chromatic number of
                                  triangle-free $2 P_3$-free graphs in
                                  polynomial time  . . . . . . . . . . . . 1--10
              Ho-Leung Chan and   
               Nicole Megow and   
        René Sitters and   
                   Rob van Stee   A note on sorting buffers offline  . . . 11--18
             A. A. Gorbenko and   
                   V. Yu. Popov   The set of parameterized $k$-covers
                                  problem  . . . . . . . . . . . . . . . . 19--24
            Mathieu Lacroix and   
           A. Ridha Mahjoub and   
    Sébastien Martin and   
           Christophe Picouleau   On the NP-completeness of the perfect
                                  matching free subgraph problem . . . . . 25--29
        Luís M. S. Russo   Monge properties of sequence alignment   30--49
                    Tamir Tassa   Finding all maximally-matchable edges in
                                  a bipartite graph  . . . . . . . . . . . 50--58
                   Rob van Stee   An improved algorithm for online
                                  rectangle filling  . . . . . . . . . . . 59--74
          Amir M. Ben-Amram and   
                    Simon Yoffe   Corrigendum to ``A simple and efficient
                                  Union-Find-Delete algorithm'' [Theoret.
                                  Comput. Sci. \bf 412 (4--5) 487--492]    75--75
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 424, Number 1, March 23, 2012

         Nick Bezhanishvili and   
                  Ian Hodkinson   Sahlqvist theorem for modal fixed point
                                  logic  . . . . . . . . . . . . . . . . . 1--19
                 Thomas Ehrhard   The Scott model of linear logic is the
                                  extensional collapse of its relational
                                  model  . . . . . . . . . . . . . . . . . 20--45
               Ulrike Golas and   
               Leen Lambers and   
              Hartmut Ehrig and   
                Fernando Orejas   Attributed graph transformation with
                                  inheritance: Efficient conflict
                                  detection and local confluence analysis
                                  using abstract critical pairs  . . . . . 46--68
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 425, Number 1, March 30, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
         Per Kristian Lehre and   
              Frank Neumann and   
           Jonathan E. Rowe and   
                        Xin Yao   Editorial to the special issue on
                                  ``Theoretical Foundations of
                                  Evolutionary Computation'' . . . . . . . 2--3
                Yourim Yoon and   
              Yong-Hyuk Kim and   
           Alberto Moraglio and   
                  Byung-Ro Moon   Quotient geometric crossovers and
                                  redundant encodings  . . . . . . . . . . 4--16
             Benjamin Doerr and   
                  Edda Happ and   
                Christian Klein   Crossover can provably be useful in
                                  evolutionary computation . . . . . . . . 17--33
         Leonardo Vanneschi and   
                Yuri Pirola and   
            Giancarlo Mauri and   
            Marco Tomassini and   
           Philippe Collard and   
         Sébastien Verel   A study of the neutrality of Boolean
                                  function landscapes in genetic
                                  programming  . . . . . . . . . . . . . . 34--57
           Andrew M. Sutton and   
         L. Darrell Whitley and   
                  Adele E. Howe   Computing the moments of $k$-bounded
                                  pseudo-Boolean functions over Hamming
                                  spheres of arbitrary radius in
                                  polynomial time  . . . . . . . . . . . . 58--74
                 Anne Auger and   
             Johannes Bader and   
             Dimo Brockhoff and   
                 Eckart Zitzler   Hypervolume-based multiobjective
                                  optimization: Theoretical foundations
                                  and practical implications . . . . . . . 75--103
             Karl Bringmann and   
               Tobias Friedrich   Approximating the least hypervolume
                                  contributor: NP-hard in general, but
                                  fast in practice . . . . . . . . . . . . 104--116
                   Carsten Witt   Analysis of an iterated local search
                                  algorithm for vertex cover in sparse
                                  random graphs  . . . . . . . . . . . . . 117--125
          Patrick O. Stalph and   
             Xavier Llor\`a and   
          David E. Goldberg and   
                 Martin V. Butz   Resource management and scalability of
                                  the XCSF learning classifier system  . . 126--141
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 426--427, Number 1, April 6, 2012

               Ching-Lueh Chang   Some results on approximate $1$-median
                                  selection in metric spaces . . . . . . . 1--12
         William Chung-Kung Yen   The connected $p$-center problem on
                                  block graphs with forbidden vertices . . 13--24
               Travis Gagie and   
            Gonzalo Navarro and   
               Simon J. Puglisi   New algorithms on wavelet trees and
                                  applications to information retrieval    25--41
               Igor Grunsky and   
               Igor Potapov and   
           Elena Pryanichnikova   On algebra of languages representable by
                                  vertex-labeled graphs  . . . . . . . . . 42--48
              Harald Hempel and   
            Michael Krüger   Inverse Hamiltonian Cycle and inverse
                                  $3$ Dimensional Matching are
                                  coNP-complete  . . . . . . . . . . . . . 49--65
                Carmel Kent and   
           Moshe Lewenstein and   
                Dafna Sheinwald   On demand string sorting over unbounded
                                  alphabets  . . . . . . . . . . . . . . . 66--74
               Min Chih Lin and   
     Francisco J. Soulignac and   
           Jayme L. Szwarcfiter   Arboricity, $h$-index, and dynamic
                                  algorithms . . . . . . . . . . . . . . . 75--90
                Shenghui Su and   
                Shuwang Lü   A public key cryptosystem based on three
                                  new provable problems  . . . . . . . . . 91--117
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 428, Number 1, April 13, 2012

          F. Blanchet-Sadri and   
                  Robert Mercas   The three-squares lemma for partial
                                  words with one hole  . . . . . . . . . . 1--9
             Kathie Cameron and   
Benjamin Lévêque and   
 Frédéric Maffray   Coloring vertices of a graph or finding
                                  a Meyniel obstruction  . . . . . . . . . 10--17
             Thomas Clouser and   
         Mikhail Nesterenko and   
           Christian Scheideler   Tiara: a self-stabilizing deterministic
                                  skip list and skip graph . . . . . . . . 18--35
               Chris J. Conidis   Effectively approximating measurable
                                  sets by open sets  . . . . . . . . . . . 36--46
     Yoann Dieudonné and   
                   Franck Petit   Self-stabilizing gathering with strong
                                  multiplicity detection . . . . . . . . . 47--57
               R. Giancarlo and   
                        F. Utro   Algorithmic paradigms for
                                  stability-based cluster validity and
                                  model selection statistical methods,
                                  with applications to microarray data
                                  analysis . . . . . . . . . . . . . . . . 58--79
               Sayaka Kamei and   
             Hirotsugu Kakugawa   A self-stabilizing $6$-approximation for
                                  the minimum connected dominating set
                                  with safe convergence in unit disk
                                  graphs . . . . . . . . . . . . . . . . . 80--90
                  Victor Y. Pan   A note on the paper by Murat Cenk and
                                  Ferruh Ozbudak ``Multiplication of
                                  polynomials modulo $x^n$'', Theoret.
                                  Comput. Sci. 412 (2011) 3451--3462 . . . 91--91
Gwénaël Richomme and   
  Patrice Séébold   Completing a combinatorial proof of the
                                  rigidity of Sturmian words generated by
                                  morphisms  . . . . . . . . . . . . . . . 92--97
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 429, Number 1, April 20, 2012

           Giorgio Ausiello and   
      Hendrik Jan Hoogeboom and   
      Juhani Karhumäki and   
                  Ion Petre and   
                   Arto Salomaa   Preface  . . . . . . . . . . . . . . . . 1--20
        Maurice H. ter Beek and   
                   Jetty Kleijn   Vector team automata . . . . . . . . . . 21--29
         Hans L. Bodlaender and   
                  Jurriaan Hage   On switching classes, NLC-width,
                                  cliquewidth and treewidth  . . . . . . . 30--35
            Paola Bonizzoni and   
      Gianluca Della Vedova and   
                 Riccardo Dondi   A randomized PTAS for the minimum
                                  Consensus Clustering with a fixed number
                                  of clusters  . . . . . . . . . . . . . . 36--45
             Robert Brijder and   
         Joris J. M. Gillis and   
            Jan Van den Bussche   A comparison of graph-theoretic DNA
                                  hybridization models . . . . . . . . . . 46--53
                 Mark Daley and   
      Helmut Jürgensen and   
                  Lila Kari and   
             Kalpana Mahalingam   Relativized codes  . . . . . . . . . . . 54--64
             Volker Diekert and   
                Steffen Kopecki   Language theoretical properties of
                                  hairpin formations . . . . . . . . . . . 65--73
           Pierluigi Frisco and   
               Gordon Govan and   
               Alberto Leporati   Asynchronous $P$ systems with active
                                  membranes  . . . . . . . . . . . . . . . 74--86
            Karsten Gabriel and   
                  Hartmut Ehrig   Modelling evolution of communication
                                  platforms and scenarios based on
                                  transformations of high-level nets and
                                  processes  . . . . . . . . . . . . . . . 87--97
                   Yuan Gao and   
                  Lila Kari and   
                       Sheng Yu   State complexity of union and
                                  intersection of star on $k$ regular
                                  languages  . . . . . . . . . . . . . . . 98--107
             Daniela Genova and   
                 Natasa Jonoska   Forbidding and enforcing on graphs . . . 108--117
                David Harel and   
                    Amir Kantor   Multi-modal scenarios revisited: a
                                  net-based representation . . . . . . . . 118--127
                     Tero Harju   Square-free words obtained from prefixes
                                  by permutations  . . . . . . . . . . . . 128--133
                Mika Hirvensalo   On probabilistic and quantum reaction
                                  systems  . . . . . . . . . . . . . . . . 134--143
                 Jun Hosoda and   
            Juraj Hromkovic and   
              Taisuke Izumi and   
               Hirotaka Ono and   
     Monika Steinová and   
                    Koichi Wada   On the approximability and hardness of
                                  minimum topic connected overlay and its
                                  special instances  . . . . . . . . . . . 144--154
            Oscar H. Ibarra and   
                   Hsu-Chun Yen   On the containment and equivalence
                                  problems for two-way transducers . . . . 155--163
                     Masami Ito   Algebraic structures of automata . . . . 164--168
                Kurt Jensen and   
         Lars M. Kristensen and   
                 Thomas Mailund   The sweep-line state space exploration
                                  method . . . . . . . . . . . . . . . . . 169--179
                    Jarkko Kari   Universal pattern generation by cellular
                                  automata . . . . . . . . . . . . . . . . 180--184
               Jetty Kleijn and   
                  Maciej Koutny   Localities in systems with a/sync
                                  communication  . . . . . . . . . . . . . 185--192
    Hans-Jörg Kreowski and   
                   Sabine Kuske   Polynomial graph transformability  . . . 193--201
            Jan van Leeuwen and   
         Jirí Wiedermann   Computation as an unbounded process  . . 202--212
               Luca Manzoni and   
         Leonardo Vanneschi and   
                Giancarlo Mauri   A distance between populations for
                                  one-point crossover in genetic
                                  algorithms . . . . . . . . . . . . . . . 213--221
                      H. Maurer   A linear ordering of a multi-parameter
                                  universe is usually nonsense . . . . . . 222--226
            Antoni Mazurkiewicz   Petri net languages revisited  . . . . . 227--235
             Mogens Nielsen and   
                    Karl Krukow   Transfer of trust in event-based
                                  reputation systems . . . . . . . . . . . 236--246
               Fumiya Okubo and   
          Satoshi Kobayashi and   
               Takashi Yokomori   Reaction automata  . . . . . . . . . . . 247--257
            Gheorghe P\uaun and   
Mario J. Pérez-Jiménez   Towards bridging two cell-inspired
                                  models: $P$ systems and $R$ systems  . . 258--264
           Dominique Perrin and   
                Antonio Restivo   A note on Sturmian words . . . . . . . . 265--272
               Xiaoxue Piao and   
                    Kai Salomaa   State complexity of the concatenation of
                                  regular tree languages . . . . . . . . . 273--281
            Antonio Restivo and   
                Roberto Vaglica   A graph theoretic approach to automata
                                  minimality . . . . . . . . . . . . . . . 282--291
          P. S. Thiagarajan and   
                    Shaofa Yang   Modular discrete time approximations of
                                  distributed hybrid automata  . . . . . . 292--304
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 430, Number 1, April 27, 2012

            Samson Abramsky and   
            Michael Mislove and   
           Catuscia Palamidessi   Preface  . . . . . . . . . . . . . . . . 1--2
                 C. Hermida and   
                  R. D. Tennent   Monoidal indeterminates and categories
                                  of possible worlds . . . . . . . . . . . 3--22
               David A. Schmidt   Inverse-limit and topological aspects of
                                  abstract interpretation  . . . . . . . . 23--42
                   Andrej Bauer   On the failure of fixed-point theorems
                                  for chain-complete lattices in the
                                  effective topos  . . . . . . . . . . . . 43--50
                  J. Anders and   
               E. Andersson and   
               D. E. Browne and   
                 E. Kashefi and   
                    D. K. L. Oi   Ancilla-driven quantum computation with
                                  twisted graph states . . . . . . . . . . 51--72
               Klaus Keimel and   
               Jimmie D. Lawson   Extending algebraic operations to
                                  $D$-completions  . . . . . . . . . . . . 73--87
             Alexander Kurz and   
                      Raul Leal   Modalities in the Stone age: a
                                  comparison of coalgebraic logics . . . . 88--116
           Marco Lanzagorta and   
                    Keye Martin   Teleportation with an imperfect state    117--125
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 431, Number 1, May 4, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
            Gabriel Ciobanu and   
                  Maciej Koutny   Modelling and analysis of biological
                                  systems: Based on papers presented at
                                  the Workshop on Membrane Computing and
                                  Biologically Inspired Process Calculi
                                  (MeCBIC) held in 2008 (Iasi), 2009
                                  (Bologna) and 2010 (Jena)  . . . . . . . 2--3
            Gheorghe P\uaun and   
Mario J. Pérez-Jiménez   An infinite hierarchy of languages
                                  defined by dP systems  . . . . . . . . . 4--12
           G. Michele Pinna and   
                    Andrea Saba   Modeling dependencies and simultaneity
                                  in membrane system computations  . . . . 13--39
              Luca Cardelli and   
               Philippa Gardner   Processes in space . . . . . . . . . . . 40--55
           Giorgio Delzanno and   
            Gianluigi Zavattaro   Reachability problems in BioAmbients . . 56--74
                Mario Coppo and   
          Ferruccio Damiani and   
            Maurizio Drocco and   
               Elena Grassi and   
                Eva Sciacca and   
         Salvatore Spinella and   
                  Angelo Troina   Simulation techniques for the calculus
                                  of wrapped compartments  . . . . . . . . 75--95
            Roberto Barbuti and   
           Giulio Caravagna and   
  Andrea Maggiolo-Schettini and   
              Paolo Milazzo and   
                    Simone Tini   Foundational aspects of multiscale
                                  modeling of biological systems with
                                  process algebras . . . . . . . . . . . . 96--116
              Giorgio Bacci and   
                 Marino Miculan   Measurable stochastics for Brane
                                  Calculus . . . . . . . . . . . . . . . . 117--136
               Jerome Feret and   
           Thomas Henzinger and   
               Heinz Koeppl and   
                 Tatjana Petrov   Lumpability abstractions of rule-based
                                  systems  . . . . . . . . . . . . . . . . 137--164
              Livio Bioglio and   
Mariangiola Dezani-Ciancaglini and   
             Paola Giannini and   
                  Angelo Troina   Typed stochastic semantics for the
                                  calculus of looping sequences  . . . . . 165--180
           Matthew R. Lakin and   
     Lo\"\ic Paulevé and   
                Andrew Phillips   Stochastic simulation of multiple
                                  process calculi for biology  . . . . . . 181--206
              Richard Banks and   
                 L. J. Steggles   An abstraction theory for qualitative
                                  models of biological systems . . . . . . 207--218
        Jean-Louis Giavitto and   
              Hanna Klaudel and   
               Franck Pommereau   Integrated regulatory networks (IRNs):
                                  Spatially organized biochemical modules  219--234
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 432, Number 1, May 11, 2012

              Hsing-Yen Ann and   
            Chang-Biau Yang and   
           Chiou-Ting Tseng and   
                   Chiou-Yi Hor   Fast algorithms for computing the
                                  constrained LCS of run-length encoded
                                  strings  . . . . . . . . . . . . . . . . 1--9
   Péter Biró and   
           David F. Manlove and   
               Eric J. McDermid   ``Almost stable'' matchings in the
                                  Roommates problem with bounded
                                  preference lists . . . . . . . . . . . . 10--20
          F. Blanchet-Sadri and   
        Aleksandar Chakarov and   
             Lucas Manuelli and   
            Jarett Schwartz and   
                   Slater Stich   Constructing partial words with subword
                                  complexities not achievable by full
                                  words  . . . . . . . . . . . . . . . . . 21--27
               Kuan-Yu Chen and   
               Ping-Hui Hsu and   
                   Kun-Mao Chao   Efficient retrieval of approximate
                                  palindromes in a run-length encoded
                                  string . . . . . . . . . . . . . . . . . 28--37
          Michael Elberfeld and   
               Ilka Schnoor and   
                    Till Tantau   Influence of tree topology restrictions
                                  on the complexity of haplotyping with
                                  missing data . . . . . . . . . . . . . . 38--51
                 I. Gambini and   
                     L. Vuillon   Non-lattice-periodic tilings of
                                  $\mathbb{R}^3$ by single polycubes . . . 52--57
                Longkun Guo and   
                      Hong Shen   On the complexity of the edge-disjoint
                                  min-min problem in planar digraphs . . . 58--63
        Spyros Kontogiannis and   
                  Paul Spirakis   On mutual concavity and
                                  strategically-zero-sum bimatrix games    64--76
        Kaisa Matomäki and   
                    Kalle Saari   A new geometric approach to Sturmian
                                  words  . . . . . . . . . . . . . . . . . 77--84
                   Arto Salomaa   Subword occurrences, weighted automata
                                  and iterated morphisms, especially the
                                  Fibonacci morphism . . . . . . . . . . . 85--93
                   Juha Honkala   Marked D0L systems and the
                                  $2n$-conjecture  . . . . . . . . . . . . 94--97
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 433, Number 1, May 18, 2012

                   Roy L. Crole   Alpha equivalence equalities . . . . . . 1--19
              Razvan Diaconescu   An axiomatic approach to structuring
                                  specifications . . . . . . . . . . . . . 20--42
               Shuqin Huang and   
                Yongzhi Cao and   
                Hanpin Wang and   
                     Wanling Qu   Value-passing CCS with noisy channels    43--59
           David A. Naumann and   
            Augusto Sampaio and   
                    Leila Silva   Refactoring and representation
                                  independence for class hierarchies . . . 60--97
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 434, Number 1, May 25, 2012

              Xiaoguang Bao and   
                    Zhaohui Liu   Approximation algorithms for single
                                  vehicle scheduling problems with release
                                  and service times on a tree or cycle . . 1--10
             Anthony Bonato and   
   Margaret-Ellen Messinger and   
                   Pawel Pralat   Fighting constrained fires in graphs . . 11--22
          Maxime Crochemore and   
       Costas S. Iliopoulos and   
              Marcin Kubica and   
            M. Sohel Rahman and   
            German Tischler and   
                 Tomasz Wale\'n   Improved algorithms for the range next
                                  value problem and applications . . . . . 23--34
          George Karakostas and   
                 Jeff Kinne and   
           Dieter van Melkebeek   On derandomization and average-case
                                  complexity of monotone functions . . . . 35--44
            Ching-Jong Liao and   
              Hsin-Hui Tsou and   
                 Kuo-Ling Huang   Neighborhood search procedures for
                                  single machine tardiness scheduling with
                                  sequence-dependent setups  . . . . . . . 45--52
                  Yun Shang and   
                    Xian Lu and   
                      Ruqian Lu   A theory of computation based on unsharp
                                  quantum logic: Finite state automata and
                                  pushdown automata  . . . . . . . . . . . 53--86
                     Kenya Ueno   A stronger LP bound for formula size
                                  lower bounds via clique constraints  . . 87--97
             Yuichi Yoshida and   
               Yusuke Kobayashi   Testing the $(s, t)$-disconnectivity of
                                  graphs and digraphs  . . . . . . . . . . 98--113
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 435, Number 1, June 1, 2012

             Matthias Blume and   
            Germán Vidal   Preface  . . . . . . . . . . . . . . . . 1--2
            Stefano Berardi and   
                 Makoto Tatsuta   Internal models of system F for
                                  decompilation  . . . . . . . . . . . . . 3--20
              Olivier Danvy and   
             Kevin Millikin and   
                 Johan Munk and   
                      Ian Zerny   On inter-deriving small-step and
                                  big-step semantics: a case study for
                                  storeless call-by-need evaluation  . . . 21--42
              Jacob M. Howe and   
                      Andy King   A pearl on SAT and SMT solving in Prolog 43--55
                  Oleg Kiselyov   Delimited control in OCaml, abstractly
                                  and concretely . . . . . . . . . . . . . 56--76
         Didier Rémy and   
               Boris Yakobowski   A church-style intermediate language for
                                  MLF  . . . . . . . . . . . . . . . . . . 77--105
                  Alexis Saurin   Böhm theorem and Böhm trees for the
                                  $\Lambda \mu$-calculus . . . . . . . . . 106--138
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 436, Number 1, June 8, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
               Jean Berstel and   
                Luc Boasson and   
                Isabelle Fagnot   Splicing systems and the Chomsky
                                  hierarchy  . . . . . . . . . . . . . . . 2--22
Jérémie Cabessa and   
         Alessandro E. P. Villa   The expressive power of analog recurrent
                                  neural networks on infinite input
                                  streams  . . . . . . . . . . . . . . . . 23--34
                G. Cattaneo and   
                  M. Comito and   
                    D. Bianucci   Sand piles: From physics to cellular
                                  automata models  . . . . . . . . . . . . 35--53
               Tianshi Chen and   
                    Ke Tang and   
              Guoliang Chen and   
                        Xin Yao   A large population size can be unhelpful
                                  in evolutionary algorithms . . . . . . . 54--70
             Benjamin Doerr and   
           Daniel Johannsen and   
                  Carola Winzen   Non-existence of linear universal drift
                                  functions  . . . . . . . . . . . . . . . 71--86
              Giuseppe Lettieri   an abstract interpretation framework for
                                  genotype elimination algorithms  . . . . 87--105
                  Dong Zhou and   
                    Dan Luo and   
                  Ruqian Lu and   
                   Zhangang Han   The use of tail inequalities on the
                                  probable computational time of
                                  randomized search heuristics . . . . . . 106--117
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 437, Number 1, June 15, 2012

                Sibel Adali and   
                   Tina Liu and   
            Malik Magdon-Ismail   An analysis of optimal link bombs  . . . 1--20
               Richard Beal and   
                 Donald Adjeroh   Parameterized longest previous factor    21--34
             Prasad Chebolu and   
        Leslie Ann Goldberg and   
                 Russell Martin   The complexity of approximately counting
                                  stable matchings . . . . . . . . . . . . 35--68
             Wai-Fong Chuan and   
               Fang-Yi Liao and   
                Hui-Ling Ho and   
                         Fei Yu   Fibonacci word patterns in two-way
                                  infinite Fibonacci words . . . . . . . . 69--81
                     Bo Cui and   
                   Yuan Gao and   
                  Lila Kari and   
                       Sheng Yu   State complexity of combined operations
                                  with two basic operations  . . . . . . . 82--102
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 438, Number 1, June 22, 2012

                 Yuji Kobayashi   The derivational complexity of string
                                  rewriting systems  . . . . . . . . . . . 1--12
       George Christodoulou and   
          Vahab S. Mirrokni and   
        Anastasios Sidiropoulos   Convergence and approximation in
                                  potential games  . . . . . . . . . . . . 13--27
                  Changwook Kim   On the structure of linear apex NLC
                                  graph grammars . . . . . . . . . . . . . 28--33
             George B. Mertzios   The recognition of triangle graphs . . . 34--47
  Jòrgen Bang-Jensen and   
                     Anders Yeo   Arc-disjoint spanning sub(di)graphs in
                                  digraphs . . . . . . . . . . . . . . . . 48--54
                   Ming Liu and   
              Feifeng Zheng and   
               Chengbin Chu and   
                     Yinfeng Xu   New results on single-machine scheduling
                                  with past-sequence-dependent delivery
                                  times  . . . . . . . . . . . . . . . . . 55--61
     Verónica Becher and   
             Pablo Ariel Heiber   A linearly computable measure of string
                                  complexity . . . . . . . . . . . . . . . 62--73
               J. Ian Munro and   
               Rajeev Raman and   
            Venkatesh Raman and   
               Srinivasa Rao S.   Succinct representations of permutations
                                  and functions  . . . . . . . . . . . . . 74--88
              Marcin Kami\'nski   max-cut and containment relations in
                                  graphs . . . . . . . . . . . . . . . . . 89--95
          Khaled Elbassioni and   
           Slobodan Jeli\'c and   
            Domagoj Matijevi\'c   The relation of Connected Set Cover and
                                  Group Steiner Tree . . . . . . . . . . . 96--101
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 439, Number 1, June 29, 2012

               Haitao Jiang and   
                 Daming Zhu and   
                     Binhai Zhu   A $(1 + \epsilon)$-approximation
                                  algorithm for sorting by short
                                  block-moves  . . . . . . . . . . . . . . 1--8
          Marcin Kami\'nski and   
              Paul Medvedev and   
                 Martin Milanic   Complexity of independent set
                                  reconfigurability problems . . . . . . . 9--15
           H. L. M. Kerivin and   
                 M. Lacroix and   
                  A. R. Mahjoub   On the complexity of the Eulerian closed
                                  walk with precedence path constraints
                                  problem  . . . . . . . . . . . . . . . . 16--29
István Miklós and   
                   Eric Tannier   Approximating the number of Double
                                  Cut-and-Join scenarios . . . . . . . . . 30--40
    Stavros D. Nikolopoulos and   
            Leonidas Palios and   
            Charis Papadopoulos   A fully dynamic algorithm for the
                                  recognition of $P_4$-sparse graphs . . . 41--57
               Helmut Prodinger   Approximate counting with $m$ counters:
                                  a detailed analysis  . . . . . . . . . . 58--68
                    Qin Xin and   
              Fredrik Manne and   
                  Yan Zhang and   
                       Xin Wang   Almost optimal distributed M2M
                                  multicasting in wireless mesh networks   69--82
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 440--441, 2012

        János Balogh and   
József Békési and   
          Gábor Galambos   New lower bounds for certain classes of
                                  bin packing algorithms . . . . . . . . . 1--13
            Laurent Bulteau and   
           Guillaume Fertin and   
              Minghui Jiang and   
                     Irena Rusu   Tractability and approximability of
                                  maximal strip recovery . . . . . . . . . 14--28
                Khalil Challita   A semi-dynamical approach for solving
                                  qualitative spatial constraint
                                  satisfaction problems  . . . . . . . . . 29--38
             Wai-Fong Chuan and   
                    Hui-Ling Ho   Locating factors of a characteristic
                                  word via the generalized Zeckendorf
                                  representation of numbers  . . . . . . . 39--51
            Jurek Czyzowicz and   
           Leszek Gasieniec and   
                   Andrzej Pelc   Choosing the best among peers  . . . . . 52--59
          Paulo E. D. Pinto and   
        Fábio Protti and   
           Jayme L. Szwarcfiter   Exact and approximation algorithms for
                                  error-detecting even codes . . . . . . . 60--72
            Antonio Restivo and   
                Roberto Vaglica   Extremal minimality conditions on
                                  automata . . . . . . . . . . . . . . . . 73--84
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 442, Number 1, July 13, 2012

            Subhas C. Nandy and   
                    Sandeep Sen   Preface  . . . . . . . . . . . . . . . . 1--1
                 Helmut Alt and   
                 Ludmila Scharf   Shape matching by random sampling  . . . 2--12
              Meena Mahajan and   
        Prajakta Nimbhorkar and   
            Kasturi Varadarajan   The planar $k$-means problem is NP-hard  13--21
         Katsuhisa Yamanaka and   
                Yota Otachi and   
               Shin-ichi Nakano   Efficient enumeration of ordered trees
                                  with $k$ leaves  . . . . . . . . . . . . 22--27
                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--vii


Theoretical Computer Science
Volume 443, Number 1, July 20, 2012

             Susanne Albers and   
               Matthias Hellwig   Semi-online scheduling revisited . . . . 1--9
  Jòrgen Bang-Jensen and   
Frédéric Havet and   
              Nicolas Trotignon   Finding an induced subdivision of a
                                  digraph  . . . . . . . . . . . . . . . . 10--24
               Philip Bille and   
       Inge Li Gòrtz and   
Hjalte Wedel Vildhòj and   
              David Kofoed Wind   String matching with variable length
                                  gaps . . . . . . . . . . . . . . . . . . 25--34
          F. Blanchet-Sadri and   
              Robert Mercas and   
             Abraham Rashin and   
                  Elara Willett   Periodicity algorithms and a conjecture
                                  on overlaps in partial words . . . . . . 35--45
     Jean-Marc Fédou and   
                  Gabriele Fici   Automata and differentiable words  . . . 46--62
             Sun-Yuan Hsieh and   
               Ying-Hsuan Chang   Extraconnectivity of $k$-ary $n$-cube
                                  networks . . . . . . . . . . . . . . . . 63--69
                        Yun Liu   Groups and decompositions of codes . . . 70--81
                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--vii


Theoretical Computer Science
Volume 444, Number 1, July 27, 2012

                Shay Kutten and   
                 Janez Zerovnik   Preface  . . . . . . . . . . . . . . . . 1--2
        Jean-Claude Bermond and   
              David Coudert and   
           Joanna Moulierac and   
Stéphane Pérennes and   
                 Ignasi Sau and   
         Fernando Solano Donado   GMPLS label space minimization through
                                  hypergraph layouts . . . . . . . . . . . 3--16
              Nicolas Nisse and   
              Ivan Rapaport and   
                   Karol Suchan   Distributed computing of efficient
                                  routing schemes in generalized chordal
                                  graphs . . . . . . . . . . . . . . . . . 17--27
           Jean R. S. Blair and   
                  Fredrik Manne   An efficient self-stabilizing distance-2
                                  coloring algorithm . . . . . . . . . . . 28--39
              Amotz Bar-Noy and   
       Panagiotis Cheilaris and   
             Michael Lampis and   
               Valia Mitsou and   
                 Stathis Zachos   Ordered coloring of grids and related
                                  graphs . . . . . . . . . . . . . . . . . 40--51
                  D. Bil\`o and   
                  Y. Disser and   
          M. Mihalák and   
                    S. Suri and   
                  E. Vicari and   
                    P. Widmayer   Reconstructing visibility graphs with
                                  simple robots  . . . . . . . . . . . . . 52--59
            Jurek Czyzowicz and   
              Stefan Dobrev and   
           Leszek Gasieniec and   
             David Ilcinkas and   
             Jesper Jansson and   
               Ralf Klasing and   
             Ioannis Lignos and   
             Russell Martin and   
          Kunihiko Sadakane and   
                  Wing-Kin Sung   More efficient periodic traversal in
                                  anonymous undirected graphs  . . . . . . 60--76
             Kenta Yamamoto and   
              Taisuke Izumi and   
          Yoshiaki Katayama and   
           Nobuhiro Inuzuka and   
                    Koichi Wada   The optimal tolerance of uniform
                                  observation error for mobile robot
                                  convergence  . . . . . . . . . . . . . . 77--86
                   Guy Even and   
                    Moti Medina   Revisiting randomized parallel load
                                  balancing algorithms . . . . . . . . . . 87--99
                Yuichi Sudo and   
             Junya Nakamura and   
            Yukiko Yamauchi and   
           Fukuhito Ooshita and   
         Hirotsugu Kakugawa and   
            Toshimitsu Masuzawa   Loosely-stabilizing leader election in a
                                  population protocol model  . . . . . . . 100--112
                Damien Imbs and   
                  Michel Raynal   Virtual world consistency: a condition
                                  for STM systems (with a versatile
                                  protocol with invisible read operations) 113--127
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 445, Number 1, August 3, 2012

                 Viliam Geffert   An alternating hierarchy for finite
                                  automata . . . . . . . . . . . . . . . . 1--24
                Yanmei Hong and   
                    Liying Kang   Backup $2$-center on interval graphs . . 25--35
              Seok-Hee Hong and   
              Hiroshi Nagamochi   Minimum cost star-shaped drawings of
                                  plane graphs with a fixed embedding and
                                  concave corner constraints . . . . . . . 36--51
               Chunqiang Hu and   
              Xiaofeng Liao and   
                  Xiuzhen Cheng   Verifiable multi-secret sharing based on
                                  LFSR sequences . . . . . . . . . . . . . 52--62
                   Karel Klouda   Bispecial factors in circular non-pushy
                                  D0L languages  . . . . . . . . . . . . . 63--74
                   Ming Liu and   
              Feifeng Zheng and   
                Shijin Wang and   
                    Jiazhen Huo   Optimal algorithms for online single
                                  machine scheduling with deteriorating
                                  jobs . . . . . . . . . . . . . . . . . . 75--81
                  Mauro Mezzini   Fully dynamic algorithm for chordal
                                  graphs with $O(1)$ query-time and
                                  $O(n^2)$ update-time . . . . . . . . . . 82--92
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 446, Number 1, August 10, 2012

                     Zining Cao   More on bisimulations for higher order
                                  $\pi$-calculus . . . . . . . . . . . . . 1--19
                  U. Khadim and   
              P. J. L. Cuijpers   Repairing time-determinism in the
                                  process algebra for hybrid systems
                                  ACP$^{srt}_{hs}$ . . . . . . . . . . . . 20--47
           Hassan Motallebi and   
      Mohammad Abdollahi Azgomi   Modeling and verification of hybrid
                                  dynamic systems using multisingular
                                  hybrid Petri nets  . . . . . . . . . . . 48--74
               Chunlai Zhou and   
                 Mingsheng Ying   Approximating Markov processes through
                                  filtration . . . . . . . . . . . . . . . 75--97
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 447, Number 1, August 17, 2012

                   Weili Wu and   
                  Ovidiu Daescu   Preface  . . . . . . . . . . . . . . . . 1--1
                   Beate Bollig   On symbolic OBDD-based algorithms for
                                  the minimum spanning tree problem  . . . 2--12
              Danny Z. Chen and   
                   Ewa Misiolek   Computing feasible toolpaths for
                                  $5$-axis machines  . . . . . . . . . . . 13--25
                 Xujin Chen and   
                Xiaodong Hu and   
                     Weidong Ma   Pairwise cooperations in selfish ring
                                  routing for minimax linear latency . . . 26--37
                 Hongwei Du and   
                   Qiang Ye and   
              Jiaofei Zhong and   
               Yuexuan Wang and   
                 Wonjun Lee and   
                    Haesun Park   Polynomial-time approximation scheme for
                                  minimum connected dominating set under
                                  routing cost constraint in wireless
                                  sensor networks  . . . . . . . . . . . . 38--43
             David Eppstein and   
        Michael T. Goodrich and   
              Darren Strash and   
                   Lowell Trott   Extended dynamic subgraph statistics
                                  using $h$-index parameterized data
                                  structures . . . . . . . . . . . . . . . 44--52
                   Neng Fan and   
            Qipeng P. Zheng and   
              Panos M. Pardalos   Robust optimization of graph
                                  partitioning involving interval
                                  uncertainty  . . . . . . . . . . . . . . 53--61
                     Xin He and   
              Jiun-Jie Wang and   
                  Huaming Zhang   Compact visibility representation of
                                  $4$-connected plane graphs . . . . . . . 62--73
       Giuseppe F. Italiano and   
                Luigi Laura and   
             Federico Santaroni   Finding strong bridges and strong
                                  articulation points in linear time . . . 74--84
                Elmar Langetepe   Searching for an axis-parallel shoreline 85--99
                  Deying Li and   
                   Zheng Li and   
                  Wenkai Ma and   
                  Hong Chen and   
                   Wenping Chen   Constrained surface-level gateway
                                  placement for underwater acoustic
                                  wireless sensor networks . . . . . . . . 100--106
                 Yilin Shen and   
             Dung T. Nguyen and   
                  Ying Xuan and   
                     My T. Thai   New techniques for approximating optimal
                                  substructure problems in power-law
                                  graphs . . . . . . . . . . . . . . . . . 107--119
              Tomoyuki Yamakami   A dichotomy theorem for the approximate
                                  counting of complex-weighted
                                  bounded-degree Boolean CSPs  . . . . . . 120--135
               Guanglong Yu and   
               Zhengke Miao and   
                    Jinlong Shu   Bases of primitive nonpowerful sign
                                  patterns . . . . . . . . . . . . . . . . 136--143
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 448, Number 1, August 24, 2012

                   Lei Chen and   
               Weiming Zeng and   
                   Changhong Lu   NP-completeness and APX-completeness of
                                  restrained domination in graphs  . . . . 1--8
           Dimitris Fotakis and   
          Alexis C. Kaporis and   
               Paul G. Spirakis   Efficient methods for selfish network
                                  design . . . . . . . . . . . . . . . . . 9--20
   Dominik D. Freydenberger and   
             Hossein Nevisi and   
              Daniel Reidenbach   Weakly unambiguous morphisms . . . . . . 21--40
        Pedro García and   
 Damián López and   
 Manuel Vázquez de Parga   Polynomial characteristic sets for DFA
                                  identification . . . . . . . . . . . . . 41--46
               Mehdi Ghiyasvand   An $O(m(m + n \log n) \log(n C))$-time
                                  algorithm to solve the minimum cost
                                  tension problem  . . . . . . . . . . . . 47--55
                  Pascal Koiran   Arithmetic circuits: the chasm at depth
                                  four gets wider  . . . . . . . . . . . . 56--65
             Taishin Y. Nishida   An extended Earley's algorithm for Petri
                                  net controlled grammars without
                                  $\lambda$ rules and cyclic rules . . . . 66--79
               Robin Strand and   
                Nicolas Normand   Distance transform computation for
                                  digital distance functions . . . . . . . 80--93
                  Bojan Basi\'c   A note on the paper ``On
                                  Brlek--Reutenauer conjecture'' . . . . . 94--96
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 449, Number 1, August 31, 2012

              Markus Holzer and   
              Martin Kutrib and   
            Giovanni Pighizzini   Preface  . . . . . . . . . . . . . . . . 1--1
               Paolo Baldan and   
           Alessandro Bruni and   
           Andrea Corradini and   
         Barbara König and   
César Rodríguez and   
                 Stefan Schwoon   Efficient unfolding of contextual Petri
                                  nets . . . . . . . . . . . . . . . . . . 2--22
Zuzana Bednárová and   
             Viliam Geffert and   
           Carlo Mereghetti and   
                Beatrice Palano   The size-cost of Boolean operations on
                                  constant height deterministic pushdown
                                  automata . . . . . . . . . . . . . . . . 23--36
          Janusz Brzozowski and   
                   Baiyu Li and   
                        Yuli Ye   Syntactic complexity of prefix-,
                                  suffix-, bifix-, and factor-free regular
                                  languages  . . . . . . . . . . . . . . . 37--53
      Jean-Marc Champarnaud and   
    Jean-Philippe Dubernard and   
             Franck Guingne and   
                 Hadrien Jeanne   Geometrical regular languages and linear
                                  Diophantine equations: the strongly
                                  connected case . . . . . . . . . . . . . 54--63
         Jürgen Dassow and   
               Florin Manea and   
                  Bianca Truthe   On external contextual grammars with
                                  subregular selection languages . . . . . 64--73
            Oscar H. Ibarra and   
               Nicholas Q. Tran   On synchronized multi-tape and
                                  multi-head automata  . . . . . . . . . . 74--84
Galina Jirásková and   
                    Juraj Sebej   Reversal of binary regular languages . . 85--92
Galina Jirásková and   
          Tomás Masopust   On a structural property in the state
                                  complexity of projected regular
                                  languages  . . . . . . . . . . . . . . . 93--105
                Michal Kunc and   
              Alexander Okhotin   State complexity of operations on
                                  two-way finite automata over a unary
                                  alphabet . . . . . . . . . . . . . . . . 106--118
            Andreas Malcher and   
           Carlo Mereghetti and   
                Beatrice Palano   Descriptional complexity of two-way
                                  pushdown automata with restricted head
                                  reversals  . . . . . . . . . . . . . . . 119--133
             Sherzod Turaev and   
         Jürgen Dassow and   
               Florin Manea and   
             Mohd Hasan Selamat   Language classes generated by tree
                                  controlled grammars with bounded
                                  nonterminal complexity . . . . . . . . . 134--144
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 450, Number 1, September 7, 2012

Béatrice Bouchou-Markhoff and   
               Pascal Caron and   
      Jean-Marc Champarnaud and   
                   Denis Maurel   Obituary for Sheng Yu  . . . . . . . . . 1--1
        B. Bouchou-Markhoff and   
                   P. Caron and   
          J.-M. Champarnaud and   
                      D. Maurel   Preface  . . . . . . . . . . . . . . . . 2--2
                Pavel Martyugin   Complexity of problems concerning reset
                                  words for cyclic and Eulerian automata   3--9
                 Jan Daciuk and   
                    Dawid Weiss   Smaller representation of finite state
                                  automata . . . . . . . . . . . . . . . . 10--21
        Denis Béchet and   
         Alexandre Dikovsky and   
                    Annie Foret   Categorial grammars with iterated types
                                  form a strict hierarchy of $k$-valued
                                  languages  . . . . . . . . . . . . . . . 22--30
            Vincent Carnino and   
                 Sven De Felice   Sampling different kinds of acyclic
                                  automata using Markov chains . . . . . . 31--42
 Pierre-Cyrille Héam and   
              Vincent Hugot and   
              Olga Kouchnarenko   Loops and overloops for Tree-Walking
                                  Automata . . . . . . . . . . . . . . . . 43--53
                 Yo-Sub Han and   
                     Sang-Ki Ko   Analysis of a cellular automaton model
                                  for car traffic with a junction  . . . . 54--67
              Markus Holzer and   
              Martin Kutrib and   
                   Katja Meckel   Nondeterministic state complexity of
                                  star-free languages  . . . . . . . . . . 68--80
             G. Castiglione and   
                 A. Restivo and   
                   M. Sciortino   Nondeterministic Moore automata and
                                  Brzozowski's minimization algorithm  . . 81--91
José M. Castaño and   
         Rodrigo Castaño   A finite state intersection approach to
                                  propositional satisfiability . . . . . . 92--108
       Supaporn Chairungsee and   
              Maxime Crochemore   Using minimal absent words to build
                                  phylogeny  . . . . . . . . . . . . . . . 109--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 451, Number 1, September 14, 2012

       José Meseguer and   
      Peter Csaba Ölveczky   Formalization and correctness of the
                                  PALS architectural pattern for
                                  distributed real-time systems  . . . . . 1--37
               Gilles Dowek and   
              Murdoch J. Gabbay   PNL to HOL: From the logic of nominal
                                  sets to the logic of higher-order
                                  functions  . . . . . . . . . . . . . . . 38--69
              Robert M. Hierons   The complexity of asynchronous model
                                  based testing  . . . . . . . . . . . . . 70--82
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 452, Number 1, September 21, 2012

                  Noga Alon and   
                 Yuval Emek and   
             Michal Feldman and   
              Moshe Tennenholtz   Bayesian ignorance . . . . . . . . . . . 1--11
          Hind Castel-Taleb and   
               Lynda Mokdad and   
                 Nihal Pekergin   An algorithm approach to bounding
                                  aggregations of multidimensional Markov
                                  chains . . . . . . . . . . . . . . . . . 12--20
Christophe Costa Florêncio and   
                 Henning Fernau   On families of categorial grammars of
                                  bounded value, their learnability and
                                  related complexity questions . . . . . . 21--38
            Peter Damaschke and   
                 Leonid Molokov   Parameterized reductions and algorithms
                                  for a graph editing problem that
                                  generalizes vertex cover . . . . . . . . 39--46
                    Adam R. Day   Process and truth-table
                                  characterisations of randomness  . . . . 47--55
                 Yuval Emek and   
                 Michal Feldman   Computing optimal contracts in
                                  combinatorial agencies . . . . . . . . . 56--74
           Rudolf Fleischer and   
           Gerhard J. Woeginger   An algorithmic analysis of the Honey-Bee
                                  game . . . . . . . . . . . . . . . . . . 75--87
   MohammadTaghi Hajiaghayi and   
            Rohit Khandekar and   
               Guy Kortsarz and   
           Julián Mestre   The checkpoint problem . . . . . . . . . 88--99
          Aleksandar Ili\'c and   
              Sandi Klavzar and   
                      Yoomi Rho   The index of a binary word . . . . . . . 100--106
             Alex Kesselman and   
               Stefano Leonardi   Game-theoretic analysis of Internet
                                  switching with selfish users . . . . . . 107--116
    Stavros D. Nikolopoulos and   
                Leonidas Palios   An $O(n m)$-time certifying algorithm
                                  for recognizing HHD-free graphs  . . . . 117--131
                Iain A. Stewart   A general technique to establish the
                                  asymptotic conditional diagnosability of
                                  interconnection networks . . . . . . . . 132--147
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 453, Number 1, September 28, 2012

               Shlomi Dolev and   
           Christian Scheideler   Editorial for Algorithmic Aspects of
                                  Wireless Sensor Networks . . . . . . . . 1--1
                  Chen Avin and   
                 Zvi Lotker and   
         Francesco Pasquale and   
           Yvonne-Anne Pignolet   A note on uniform power connectivity in
                                  the physical signal to interference plus
                                  noise (SINR) model . . . . . . . . . . . 2--13
          Milan Bradonji\'c and   
               Eddie Kohler and   
               Rafail Ostrovsky   Near-optimal radio use for wireless
                                  network synchronization  . . . . . . . . 14--28
             Stephan Holzer and   
       Yvonne Anne Pignolet and   
               Jasmin Smula and   
              Roger Wattenhofer   Monitoring churn in wireless networks    29--43
                Florian Huc and   
                Aubin Jarry and   
               Pierre Leone and   
              José Rolim   Virtual raw anchor coordinates: a new
                                  localization paradigm  . . . . . . . . . 44--53
               Iyad A. Kanj and   
                         Ge Xia   Improved local algorithms for spanner
                                  construction . . . . . . . . . . . . . . 54--64
               M. Klonowski and   
              M. Kutylowski and   
               J. Zatopia\'nski   Energy efficient alert in single-hop
                                  networks of extremely weak devices . . . 65--74
             Jacek Cicho\'n and   
       Zbigniew Golebiewski and   
            Miroslaw Kutylowski   From key predistribution to key
                                  redistribution . . . . . . . . . . . . . 75--87
                 Zeev Nutov and   
                  Michael Segal   Improved approximation algorithms for
                                  maximum lifetime problems in wireless
                                  networks . . . . . . . . . . . . . . . . 88--97
         Johannes Wendeberg and   
              Thomas Janson and   
        Christian Schindelhauer   Self-Localization based on Ambient
                                  Signals  . . . . . . . . . . . . . . . . 98--109
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 454, Number 1, October 5, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
         Grzegorz Rozenberg and   
                   Arto Salomaa   Preface  . . . . . . . . . . . . . . . . 2--4
           Angela Angeleska and   
             Natasa Jonoska and   
                 Masahico Saito   Rewriting rule chains modeling DNA
                                  rearrangement pathways . . . . . . . . . 5--22
         Alberto Apostolico and   
    Péter L. Erd\Hos and   
      Alpár Jüttner   Parameterized searching with mismatches
                                  for run-length encoded strings . . . . . 23--29
             Sepinoud Azimi and   
                 Tero Harju and   
             Miika Langille and   
                      Ion Petre   Simple gene assembly as a rewriting of
                                  directed overlap-inclusion graphs  . . . 30--37
          Franziska Biegler and   
                 Mark Daley and   
                  Ian McQuillan   Algorithmic decomposition of shuffle on
                                  words  . . . . . . . . . . . . . . . . . 38--50
            Paola Bonizzoni and   
             Chiara Braghin and   
             Riccardo Dondi and   
               Gabriella Trucco   The binary perfect phylogeny with
                                  persistent characters  . . . . . . . . . 51--63
             Robert Brijder and   
                 Tero Harju and   
          Hendrik Jan Hoogeboom   Pivots, determinants, and perfect
                                  matchings of graphs  . . . . . . . . . . 64--71
         Cristian S. Calude and   
               Elena Calude and   
               Melissa S. Queen   The complexity of Euler's integer
                                  partition theorem  . . . . . . . . . . . 72--80
       Ehsan Chiniforooshan and   
                 Mark Daley and   
            Oscar H. Ibarra and   
                  Lila Kari and   
                Shinnosuke Seki   One-reversal counter machines and
                                  multihead automata: Revisited  . . . . . 81--87
         Christian Choffrut and   
               Serge Grigorieff   Rational relations having a rational
                                  trace on each finite intersection of
                                  rational relations . . . . . . . . . . . 88--94
               Luca Corolli and   
                  Carlo Maj and   
            Fabrizio Marini and   
            Daniela Besozzi and   
                Giancarlo Mauri   An excursion in reaction systems: From
                                  computer science to biology  . . . . . . 95--108
               Aldo de Luca and   
             Alessandro De Luca   A generalized palindromization map in
                                  free monoids . . . . . . . . . . . . . . 109--128
             Volker Diekert and   
         Manfred Kufleitner and   
                    Pascal Weil   Star-free languages are Church--Rosser
                                  congruential . . . . . . . . . . . . . . 129--135
                Harold N. Gabow   A combinatoric interpretation of dual
                                  variables for weighted matching and
                                  $f$-factors  . . . . . . . . . . . . . . 136--163
                   Yuan Gao and   
                  Lila Kari and   
                       Sheng Yu   State complexity of union and
                                  intersection of square and reversal on
                                  $k$ regular languages  . . . . . . . . . 164--171
                 Mari Huova and   
      Juhani Karhumäki and   
                 Aleksi Saarela   Problems in between words and abelian
                                  words: $k$-abelian avoidability  . . . . 172--177
               Timo Jolivet and   
                    Jarkko Kari   Consistency of multidimensional
                                  combinatorial substitutions  . . . . . . 178--188
               Jetty Kleijn and   
              Maciej Koutny and   
       Marta Pietkiewicz-Koutny   Regions of Petri nets with a/sync
                                  connections  . . . . . . . . . . . . . . 189--198
            Filippo Mignosi and   
                Antonio Restivo   Characteristic Sturmian words are
                                  extremal for the Critical Factorization
                                  Theorem  . . . . . . . . . . . . . . . . 199--205
               Fumiya Okubo and   
          Satoshi Kobayashi and   
               Takashi Yokomori   On the properties of language classes
                                  defined by bounded reaction automata . . 206--221
              Gheorghe Paun and   
Mario J. Pérez-Jiménez   $P$ automata revisited . . . . . . . . . 222--230
               Xiaoxue Piao and   
                    Kai Salomaa   Lower bounds for the size of
                                  deterministic unranked tree automata . . 231--239
            Andrzej Skowron and   
               Piotr Wasilewski   Interactive information systems: Toward
                                  perception based computing . . . . . . . 240--260
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 455, Number 1, October 12, 2012

             Ana Cavalcanti and   
           David Déharbe   Special issue: International Colloquium
                                  on Theoretical Aspects of Computing ---
                                  ICTAC 2010 . . . . . . . . . . . . . . . 1--1
                Paulo Borba and   
          Leopoldo Teixeira and   
                    Rohit Gheyi   A theory of software product line
                                  refinement . . . . . . . . . . . . . . . 2--30
              Zhenbang Chen and   
                Zhiming Liu and   
                        Ji Wang   Failure-divergence semantics and
                                  refinement of long running transactions  31--65
               Marc Aiguier and   
Frédéric Boulanger and   
                    Bilal Kanso   A formal abstract framework for
                                  modelling and testing complex software
                                  systems  . . . . . . . . . . . . . . . . 66--97
            Pablo F. Castro and   
           Thomas S. E. Maibaum   Encapsulating deontic and branching time
                                  specifications . . . . . . . . . . . . . 98--122
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 456, Number 1, October 19, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
          Rudolf Berghammer and   
           Tobias Friedrich and   
                  Frank Neumann   Convergence of set-based multi-objective
                                  optimization, indicators and
                                  deteriorative cycles . . . . . . . . . . 2--17
           Marcelino Campos and   
         José M. Sempere   Accepting Networks of Genetic Processors
                                  are computationally complete . . . . . . 18--29
            Robin Donaldson and   
                   Muffy Calder   Modular modelling of signalling pathways
                                  and their cross-talk . . . . . . . . . . 30--50
                Kazuo Iwama and   
        Harumichi Nishimura and   
               Rudy Raymond and   
               Junichi Teruyama   Quantum counterfeit coin problems  . . . 51--64
                   Florin Manea   Complexity results for deciding Networks
                                  of Evolutionary Processors . . . . . . . 65--79
                  Ion Petre and   
                  Sergey Verlan   Matrix insertion-deletion systems  . . . 80--88
                Zhengya Sun and   
                    Wei Jin and   
                       Jue Wang   Generic subset ranking using binary
                                  classifiers  . . . . . . . . . . . . . . 89--99
               Hongyan Xing and   
            Qiansheng Zhang and   
                 Kaisheng Huang   Analysis and control of fuzzy discrete
                                  event systems using bisimulation
                                  equivalence  . . . . . . . . . . . . . . 100--111
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 457, Number 1, October 26, 2012

       Vicente Acuña and   
     Etienne Birmelé and   
            Ludovic Cottret and   
        Pierluigi Crescenzi and   
             Fabien Jourdan and   
            Vincent Lacroix and   
Alberto Marchetti-Spaccamela and   
              Andrea Marino and   
        Paulo Vieira Milreu and   
         Marie-France Sagot and   
                   Leen Stougie   Telling stories: Enumerating maximal
                                  directed acyclic graphs with a
                                  constrained set of sources and targets   1--9
        Jean-Claude Bermond and   
               Joseph G. Peters   Optimal gathering in radio grids with
                                  interference . . . . . . . . . . . . . . 10--26
             Dany Breslauer and   
           Giuseppe F. Italiano   On suffix extensions in suffix trees . . 27--34
                   Qian Cao and   
             T. C. E. Cheng and   
                 Guohua Wan and   
                          Yi Li   Several semi-online scheduling problems
                                  on two identical machines with combined
                                  information  . . . . . . . . . . . . . . 35--44
                 Marco Comi and   
           Bhaskar DasGupta and   
           Michael Schapira and   
        Venkatakumar Srinivasan   On communication protocols that compute
                                  almost privately . . . . . . . . . . . . 45--58
                 Yotam Elor and   
           Alfred M. Bruckstein   A `thermodynamic' approach to
                                  multi-robot cooperative localization . . 59--75
                 Yotam Elor and   
           Alfred M. Bruckstein   Two-robot source seeking with point
                                  measurements . . . . . . . . . . . . . . 76--85
           Petr A. Golovach and   
       Daniël Paulusma and   
                      Jian Song   Computing vertex-surjective
                                  homomorphisms to partially reflexive
                                  trees  . . . . . . . . . . . . . . . . . 86--100
     Daniel S. Graça and   
                 Ning Zhong and   
                    H. S. Dumas   The connection between computability of
                                  a nonlinear problem and its
                                  linearization: the Hartman--Grobman
                                  theorem revisited  . . . . . . . . . . . 101--110
              Jeffrey Heinz and   
              Anna Kasprzik and   
              Timo Kötzing   Learning in the limit with
                                  lattice-structured hypothesis spaces . . 111--127
               Peter M. Higgins   Burrows--Wheeler transformations and de
                                  Bruijn words . . . . . . . . . . . . . . 128--136
                 Riko Jacob and   
           Stephan Ritscher and   
       Christian Scheideler and   
                  Stefan Schmid   Towards higher-dimensional topological
                                  self-stabilization: a distributed
                                  algorithm for Delaunay graphs  . . . . . 137--148
          Alexander Okhotin and   
    Christian Reitwießner   Parsing Boolean grammars over a
                                  one-letter alphabet using online
                                  convolution  . . . . . . . . . . . . . . 149--157
                Weifan Wang and   
               Jiangxu Kong and   
                  Lianzhu Zhang   The $2$-surviving rate of planar graphs
                                  without $4$-cycles . . . . . . . . . . . 158--165
                 Yu-Mei Xue and   
                   Teturo Kamae   Maximal pattern complexity, dual system
                                  and pattern recognition  . . . . . . . . 166--173
               Junling Yuan and   
                  Wenhua Li and   
                  Jinjiang Yuan   A best possible online algorithm for
                                  scheduling equal-length jobs on two
                                  machines with chain precedence
                                  constraints  . . . . . . . . . . . . . . 174--180
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 458, Number 1, November 2, 2012

                 Luca Aceto and   
              Matteo Cimini and   
         Anna Ingolfsdottir and   
       MohammadReza Mousavi and   
              Michel A. Reniers   Rule formats for distributivity  . . . . 1--28
                 Marc Bezem and   
                Dag Hovland and   
                   Hoang Truong   A type system for counting instances of
                                  software components  . . . . . . . . . . 29--48
      Krishnendu Chatterjee and   
                  Laurent Doyen   Energy parity games  . . . . . . . . . . 49--60
              Young-ri Choi and   
               Mohamed G. Gouda   A state-based model of sensor protocols  61--75
                    Jia Liu and   
                     Huimin Lin   A complete symbolic bisimulation for
                                  full applied pi calculus . . . . . . . . 76--112
          Jean-Vivien Millo and   
               Robert de Simone   Periodic scheduling of marked graphs
                                  using balanced binary words  . . . . . . 113--130
           Wim H. Hesselink and   
Gerard R. Renardel de Lavalette   Finite and infinite implementation of
                                  transition systems . . . . . . . . . . . 131--135
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 459, Number 1, November 9, 2012

       Prabhanjan V. Ananth and   
             Ambedkar Dukkipati   Complexity of Gröbner basis detection and
                                  border basis detection . . . . . . . . . 1--15
            Nathalie Aubrun and   
       Marie-Pierre Béal   Tree-shifts of finite type . . . . . . . 16--25
Jérémy Barbay and   
           Johannes Fischer and   
                Gonzalo Navarro   LRM-Trees: Compressed indices, adaptive
                                  sorting, and compressed permutations . . 26--41
          Marcin Bienkowski and   
            Jaroslaw Kutylowski   The $k$-resource problem in uniform
                                  metric spaces  . . . . . . . . . . . . . 42--54
           Laurent Bienvenu and   
             Christopher Porter   Strong reductions in effective
                                  randomness . . . . . . . . . . . . . . . 55--68
                  Jan Bouda and   
            Matej Pivoluska and   
                  Martin Plesch   Improving the Hadamard extractor . . . . 69--76
               N. Bourgeois and   
             F. Della Croce and   
               B. Escoffier and   
                 V. Th. Paschos   Algorithms for dominating clique
                                  problems . . . . . . . . . . . . . . . . 77--88
            Gerard J. Chang and   
                B. S. Panda and   
                     D. Pradhan   Complexity of distance paired-domination
                                  problem in graphs  . . . . . . . . . . . 89--99
        Ferdinando Cicalese and   
              Tobias Jacobs and   
              Eduardo Laber and   
                  Caio Valentim   The binary identification problem for
                                  weighted trees . . . . . . . . . . . . . 100--112
            Alessandro Cincotti   The lattice structure of $n$-player
                                  games  . . . . . . . . . . . . . . . . . 113--119
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 460, Number 1, November 16, 2012

                 Rod Downey and   
                   Keng Meng Ng   Lowness for bounded randomness . . . . . 1--9
                Zhenbo Wang and   
                    Zhenhua Cui   Combination of parallel machine
                                  scheduling and vertex cover  . . . . . . 10--15
           Mitre C. Dourado and   
         Lucia Draque Penso and   
          Dieter Rautenbach and   
           Jayme L. Szwarcfiter   Reversible iterative graph processes . . 16--25
             Vadim V. Lozin and   
                 Raffaele Mosca   Maximum regular induced subgraphs in
                                  $2P_3$-free graphs . . . . . . . . . . . 26--33
               Shiying Wang and   
              Guozhen Zhang and   
                       Kai Feng   Fault tolerance in $k$-ary $n$-cube
                                  networks . . . . . . . . . . . . . . . . 34--41
             Hadas Shachnai and   
                  Gal Tamir and   
                     Tami Tamir   Minimal cost reconfiguration of data
                                  placement in a storage area network  . . 42--53
                   Yongcheng Wu   Computability on random events and
                                  variables in a computable probability
                                  space  . . . . . . . . . . . . . . . . . 54--69
          Khaled Elbassioni and   
                Rajiv Raman and   
                Saurabh Ray and   
            René Sitters   On the complexity of the highway problem 70--77
                    Jia Lee and   
              Rui-Long Yang and   
                 Kenichi Morita   Design of 1-tape 2-symbol reversible
                                  Turing machines based on reversible
                                  logic elements . . . . . . . . . . . . . 78--88
                   Zhivko Nedev   Lower bound for balanced sets  . . . . . 89--93
                Simona E. Rombo   Extracting string motif bases for quorum
                                  higher than two  . . . . . . . . . . . . 94--103
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 461, Number 1, November 23, 2012

                Ding-Zhu Du and   
                         Bin Fu   Preface --- COCOON'2011  . . . . . . . . 1--1
                 Jin-Yi Cai and   
              Michael Kowalczyk   Spin systems on $k$-regular graphs with
                                  complex edge functions . . . . . . . . . 2--16
          Gianluca De Marco and   
         Evangelos Kranakis and   
            Gábor Wiener   Computing majority with triple queries   17--26
              Minghui Jiang and   
                     Yong Zhang   Parameterized complexity in
                                  multiple-interval graphs: Domination,
                                  partition, separation, irredundancy  . . 27--44
                Yunlong Liu and   
               Jianxin Wang and   
                  Jiong Guo and   
                    Jianer Chen   Complexity and parameterized algorithms
                                  for Cograph Editing  . . . . . . . . . . 45--54
             Jochen Messner and   
                Thomas Thierauf   A Kolmogorov complexity proof of the
                                  Lovász Local Lemma for satisfiability . . 55--64
            Neeldhara Misra and   
         Geevarghese Philip and   
            Venkatesh Raman and   
                  Saket Saurabh   On Parameterized Independent Feedback
                                  Vertex Set . . . . . . . . . . . . . . . 65--75
                  Cong Tian and   
               Zhenhua Duan and   
                      Nan Zhang   An efficient approach for
                                  abstraction-refinement in model checking 76--85
              Tomoyuki Yamakami   Approximation complexity of
                                  complex-weighted degree-two counting
                                  constraint satisfaction problems . . . . 86--105
               Shengke Zeng and   
             Shaoquan Jiang and   
                   Zhiguang Qin   An efficient conditionally anonymous
                                  ring signature in the random oracle
                                  model  . . . . . . . . . . . . . . . . . 106--114
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 462, Number 1, November 30, 2012

              Gilles Didier and   
              Eduardo Corel and   
            Ivan Laprevotte and   
             Alex Grossmann and   
  Claudine Land\`es-Devauchelle   Variable length local decoding and
                                  alignment-free sequence comparison . . . 1--11
                   Jeff Edmonds   On the competitiveness of AIMD--TCP
                                  within a general network . . . . . . . . 12--22
               Leah Epstein and   
                     Asaf Levin   On the max coloring problem  . . . . . . 23--38
                Liming Fang and   
               Willy Susilo and   
                Chunpeng Ge and   
                  Jiandong Wang   Chosen-ciphertext secure anonymous
                                  conditional proxy re-encryption with
                                  keyword search . . . . . . . . . . . . . 39--58
            Emil Jerábek   Root finding with threshold circuits . . 59--69
             Julien Lemoine and   
                  Simon Viennot   Nimbers are inevitable . . . . . . . . . 70--79
                Cuixia Miao and   
              Yuzhong Zhang and   
                     Cuilian Wu   Scheduling of deteriorating jobs with
                                  release dates to minimize the maximum
                                  lateness . . . . . . . . . . . . . . . . 80--87
                 Loizos Michael   Evolvability via the Fourier transform   88--98
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 463, Number 1, December 7, 2012

             Fedor V. Fomin and   
          Pierre Fraigniaud and   
           Stephan Kreutzer and   
          Dimitrios M. Thilikos   Foreword: Special Issue on Theory and
                                  Applications of Graph Searching Problems 1--1
          Dietmar Berwanger and   
          Erich Grädel and   
              Lukasz Kaiser and   
               Roman Rabinovich   Entanglement and the complexity of
                                  directed graphs  . . . . . . . . . . . . 2--25
             MohammadAli Safari   Hyper-T-width and hyper-D-width: Stable
                                  connectivity measures for hypergraphs    26--34
        Jane V. Butterfield and   
         Daniel W. Cranston and   
           Gregory J. Puleo and   
            Douglas B. West and   
                    Reza Zamani   Revolutionaries and spies: Spy-good and
                                  spy-bad graphs . . . . . . . . . . . . . 35--53
             James Carraher and   
                Ilkyoo Choi and   
          Michelle Delcourt and   
       Lawrence H. Erickson and   
                Douglas B. West   Locating a robber on a graph via
                                  distance queries . . . . . . . . . . . . 54--61
               Nicole Megow and   
              Kurt Mehlhorn and   
              Pascal Schweitzer   Online graph exploration: New results on
                                  old and new algorithms . . . . . . . . . 62--72
             Daniel Meister and   
                 Jan Arne Telle   Chordal digraphs . . . . . . . . . . . . 73--83
               Isolde Adler and   
     Tomás Gavenciak and   
        Tereza Klimosová   Hypertree-depth and minors in
                                  hypergraphs  . . . . . . . . . . . . . . 84--95
            Dariusz Dereniowski   Approximate search strategies for
                                  weighted trees . . . . . . . . . . . . . 96--113
               C. \`Alvarez and   
             J. Díaz and   
                 D. Mitsche and   
                       M. Serna   Continuous monitoring in the dynamic
                                  sensor field model . . . . . . . . . . . 114--122
     Przemyslaw Gordinowicz and   
      Richard J. Nowakowski and   
                   Pawel Pralat   \sc POLISH --- Let us play the cleaning
                                  game . . . . . . . . . . . . . . . . . . 123--132
        Athanasios Kehagias and   
                   Pawel Pralat   Some remarks on cops and drunk robbers   133--147
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 464, Number 1, December 14, 2012

              Takahito Aoto and   
                Aart Middeldorp   Preface  . . . . . . . . . . . . . . . . 1--2
              Bernhard Gramlich   Modularity in term rewriting revisited   3--19
      Jean-Pierre Jouannaud and   
                   Jiaxiang Liu   From diagrammatic confluence to
                                  modularity . . . . . . . . . . . . . . . 20--34
              Nachum Dershowitz   Jumping and escaping: Modular
                                  termination and the abstract path
                                  ordering . . . . . . . . . . . . . . . . 35--47
        Jörg Endrullis and   
           Dimitri Hendriks and   
                Jan Willem Klop   Highlights in infinitary rewriting and
                                  lambda calculus  . . . . . . . . . . . . 48--71
         Masanori Nagashima and   
             Masahiko Sakai and   
                 Toshiki Sakabe   Determinization of conditional term
                                  rewriting systems  . . . . . . . . . . . 72--89
          Kokichi Futatsugi and   
               Daniel Gaina and   
                 Kazuhiro Ogata   Principles of proof scores in CafeOBJ    90--112
Mariangiola Dezani-Ciancaglini and   
                 Ross Horne and   
              Vladimiro Sassone   Tracing where and who provenance in
                                  Linked Data: a calculus  . . . . . . . . 113--129
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 465, Number ??, December 21, 2012

                  Tobias Jacobs   Analytical aspects of tie breaking . . . 1--9
           Huazhong Lü and   
                 Xianyue Li and   
                   Heping Zhang   Matching preclusion for balanced
                                  hypercubes . . . . . . . . . . . . . . . 10--20
        Keaitsuda Nakprasit and   
            Kittikorn Nakprasit   Equitable colorings of planar graphs
                                  without short cycles . . . . . . . . . . 21--27
       Toshinori Takabatake and   
              Tomoki Nakamigawa   Node-disjoint paths in a level block of
                                  generalized hierarchical completely
                                  connected networks . . . . . . . . . . . 28--34
                 Torsten Tholey   Linear time algorithms for two disjoint
                                  paths problems on directed acyclic
                                  graphs . . . . . . . . . . . . . . . . . 35--48
                Nodari Vakhania   Branch less, cut more and minimize the
                                  number of late equal-length jobs on
                                  identical machines . . . . . . . . . . . 49--60
                   Yan Wang and   
                 Jianxi Fan and   
                Xiaohua Jia and   
                       He Huang   An algorithm to construct independent
                                  spanning trees on parity cubes . . . . . 61--72
         L'. Balková and   
        E. Pelantová and   
                    S. Starosta   Corrigendum: ``On Brlek--Reutenauer
                                  conjecture'' . . . . . . . . . . . . . . 73--74
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 466, Number ??, December 28, 2012

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
             Agathe Chollet and   
                 Guy Wallet and   
              Laurent Fuchs and   
                Eric Andres and   
   Gaëlle Largeteau-Skapin   Foundational aspects of multiscale
                                  digitization . . . . . . . . . . . . . . 2--19
              Niloy Ganguly and   
            Saptarshi Ghosh and   
               Tyll Krueger and   
             Ajitesh Srivastava   Degree distributions of evolving
                                  alphabetic bipartite networks and their
                                  projections  . . . . . . . . . . . . . . 20--36
         Avatharam Ganivada and   
         Shubhra Sankar Ray and   
                  Sankar K. Pal   Fuzzy rough granular self-organizing map
                                  and fuzzy rough entropy  . . . . . . . . 37--63
              Janko Gravner and   
                David Griffeath   Robust periodic solutions and evolution
                                  from seeds in one-dimensional edge
                                  cellular automata  . . . . . . . . . . . 64--86
                   Arto Salomaa   Functions and sequences generated by
                                  reaction systems . . . . . . . . . . . . 87--96
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 467, Number ??, January 7, 2013

                Simone Bova and   
                Franco Montagna   Polynomial space hardness without
                                  disjunction property . . . . . . . . . . 1--11
           Giorgio Delzanno and   
          Fernando Rosa-Velardo   On the coverability and reachability
                                  languages of monotonic extensions of
                                  Petri nets . . . . . . . . . . . . . . . 12--29
          Romain Péchoux   Synthesis of sup-interpretations: a
                                  survey . . . . . . . . . . . . . . . . . 30--52
             Markus N. Rabe and   
                    Sven Schewe   Optimal time-abstract schedulers for
                                  CTMDPs and continuous-time Markov games  53--67
         Ron van der Meyden and   
                   Chenyi Zhang   Information flow in systems with
                                  schedulers, Part I: Definitions  . . . . 68--88
                      Farn Wang   Efficient model-checking of dense-time
                                  systems with time-convexity analysis . . 89--108
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 468, Number ??, January 14, 2013

    Raimundo Briceño and   
                  Ivan Rapaport   Letting Alice and Bob choose which
                                  problem to solve: Implications to the
                                  study of cellular automata . . . . . . . 1--11
         Michelangelo Bucci and   
         Alessandro De Luca and   
                  Gabriele Fici   Enumeration and structure of trapezoidal
                                  words  . . . . . . . . . . . . . . . . . 12--22
              T. Calamoneri and   
              E. Montefusco and   
               R. Petreschi and   
                   B. Sinaimeri   Exploring pairwise compatibility graphs  23--36
           Ching-Lueh Chang and   
                  Yuh-Dauh Lyuu   Bounding the sizes of dynamic monopolies
                                  and convergent sets for threshold-based
                                  cascades . . . . . . . . . . . . . . . . 37--49
                 Yebin Chen and   
                    Ying Li and   
                       Tao Chen   Optimal fault-tolerant routing algorithm
                                  and fault-tolerant diameter in directed
                                  double-loop networks . . . . . . . . . . 50--58
                   J. David and   
                     L. Nourine   A parameterizable enumeration algorithm
                                  for sequence mining  . . . . . . . . . . 59--68
            Delalleau Guillaume   Ancestors graph and an upper bound for
                                  the subword complexity function  . . . . 69--82
                  Yihan Gao and   
                Jieming Mao and   
               Xiaoming Sun and   
                       Song Zuo   On the sensitivity complexity of
                                  bipartite graph properties . . . . . . . 83--91
               Taehyung Lee and   
              Joong Chae Na and   
                Heejin Park and   
                Kunsoo Park and   
                 Jeong Seop Sim   Finding consensus and optimal alignment
                                  of circular strings  . . . . . . . . . . 92--101
                 Chenqi Mou and   
              Dongming Wang and   
                   Xiaoliang Li   Decomposing polynomial sets into simple
                                  sets over finite fields: the
                                  positive-dimensional case  . . . . . . . 102--113
                 Kejun Zhao and   
                       Xiwen Lu   Approximation schemes for two-agent
                                  scheduling on parallel machines  . . . . 114--121
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 469, Number ??, January 21, 2013

                  Man Ho Au and   
              Joseph K. Liu and   
               Willy Susilo and   
                   Tsz Hon Yuen   Secure ID-based linkable and
                                  revocable-iff-linked ring signature with
                                  constant-size construction . . . . . . . 1--14
    Andreas Brandstädt and   
               Synara Brito and   
             Sulamita Klein and   
        Loana Tito Nogueira and   
            Fábio Protti   Cycle transversals in perfect graphs and
                                  cographs . . . . . . . . . . . . . . . . 15--23
            Dominic Dumrauf and   
                Burkhard Monien   On the ${\cal PLS}$-complexity of
                                  maximum constraint assignment  . . . . . 24--52
            Paola Flocchini and   
               Bernard Mans and   
                 Nicola Santoro   On the exploration of time-varying
                                  networks . . . . . . . . . . . . . . . . 53--68
                  Kaoru Fujioka   Morphic characterizations with insertion
                                  systems controlled by a context of
                                  length one . . . . . . . . . . . . . . . 69--76
                   Ondrej Turek   Abelian complexity and Abelian
                                  co-decomposition . . . . . . . . . . . . 77--91
                Mingyu Xiao and   
              Hiroshi Nagamochi   Confining sets and avoiding bottleneck
                                  cases: a simple maximum independent set
                                  algorithm in degree-$3$ graphs . . . . . 92--104
                Mingyu Xiao and   
            Takuro Fukunaga and   
              Hiroshi Nagamochi   FPTASs for trimming weighted trees . . . 105--118
                   Xiaojiang Yu   Certain discrete dynamical systems,
                                  number systems and related integral
                                  self-affine sets . . . . . . . . . . . . 119--126
                 Fuxiang Yu and   
                       Ker-I Ko   On logarithmic-space computable real
                                  numbers  . . . . . . . . . . . . . . . . 127--133
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 470, Number ??, January 28, 2013

             Geir Agnarsson and   
Magnús M. Halldórsson and   
              Elena Losievskaja   SDP-based algorithms for maximum
                                  independent set problems on hypergraphs  1--9
             Tatsuya Akutsu and   
             Daiji Fukagawa and   
Magnús M. Halldórsson and   
            Atsuhiro Takasu and   
                 Keisuke Tanaka   Approximation and parameterized
                                  algorithms for common subtrees and edit
                                  distance between unordered trees . . . . 10--22
              Amotz Bar-Noy and   
       Panagiotis Cheilaris and   
                    Yi Feng and   
              Mordecai J. Golin   Paging mobile users in cellular
                                  networks: Optimality versus complexity
                                  and simplicity . . . . . . . . . . . . . 23--35
          Janusz Brzozowski and   
Galina Jirásková and   
                       Baiyu Li   Quotient complexity of ideal languages   36--52
                Zhigang Cao and   
                 Xiaoguang Yang   Complementary cooperation, minimal
                                  winning coalitions, and power indices    53--92
              Sze-Hang Chan and   
                Tak-Wah Lam and   
                    Lap-Kei Lee   Scheduling for weighted flow time and
                                  energy with rejection penalty  . . . . . 93--104
                Jianer Chen and   
               Iyad A. Kanj and   
                   Jie Meng and   
                     Ge Xia and   
                  Fenghui Zhang   Parameterized top-$K$ algorithms . . . . 105--119
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 471, Number ??, February 3, 2013

               Jianguo Tang and   
                    Kun She and   
                    Fan Min and   
                    William Zhu   A matroidal approach to rough set theory 1--11
             Benjamin Doerr and   
           Daniel Johannsen and   
          Timo Kötzing and   
              Frank Neumann and   
               Madeleine Theile   More effective crossover operators for
                                  the all-pairs shortest path problem  . . 12--26
               Roberta Gori and   
                 Francesca Levi   An analysis for proving probabilistic
                                  termination of biological systems  . . . 27--73
                   Guifu Su and   
               Liming Xiong and   
                     Yi Sun and   
                      Daobin Li   Nordhaus--Gaddum-type inequality for the
                                  hyper-Wiener index of graphs when
                                  decomposing into three parts . . . . . . 74--83
             Benjamin Doerr and   
          Timo Kötzing and   
           Johannes Lengler and   
                  Carola Winzen   Black-box complexities of combinatorial
                                  problems . . . . . . . . . . . . . . . . 84--106
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 472, Number ??, February 11, 2013

             Ariana Angjeli and   
                Eddie Cheng and   
László Lipták   Linearly many faults in dual-cube-like
                                  networks . . . . . . . . . . . . . . . . 1--8
               Marc Demange and   
             Dominique De Werra   On some coloring problems in grids . . . 9--27
              Stefan Dobrev and   
            Paola Flocchini and   
  Rastislav Královic and   
                 Nicola Santoro   Exploring an unknown dangerous graph
                                  using tokens . . . . . . . . . . . . . . 28--45
                 Qiang Dong and   
                Junlin Zhou and   
                     Yan Fu and   
                        Hui Gao   Hamiltonian connectivity of restricted
                                  hypercube-like networks under the
                                  conditional fault model  . . . . . . . . 46--59
Martín Farach-Colton and   
Antonio Fernández Anta and   
             Miguel A. Mosteiro   Optimal memory-aware Sensor Network
                                  Gossiping (or how to break the Broadcast
                                  lower bound) . . . . . . . . . . . . . . 60--80
            Michael Fellows and   
           Tobias Friedrich and   
             Danny Hermelin and   
            Nina Narodytska and   
               Frances Rosamond   Constraint satisfaction problems:
                                  Convexity makes AllDifferent constraints
                                  tractable  . . . . . . . . . . . . . . . 81--89
           Dimitris Fotakis and   
                Christos Tzamos   Winner-imposing strategy-proof
                                  mechanisms for multiple Facility
                                  Location games . . . . . . . . . . . . . 90--103
                          Ye Du   On the complexity of deciding degeneracy
                                  in a bimatrix game with sparse payoff
                                  matrix . . . . . . . . . . . . . . . . . 104--109
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 473, Number ??, February 18, 2013

              Marcus Hutter and   
              Frank Stephan and   
              Vladimir Vovk and   
                Thomas Zeugmann   Guest Editors' foreword  . . . . . . . . 1--3
                  Guy Lever and   
 François Laviolette and   
              John Shawe-Taylor   Tighter PAC-Bayes bounds through
                                  distribution-dependent priors  . . . . . 4--28
                Vladimir Pestov   PAC learnability under non-atomic
                                  measures: a problem by Vidyasagar  . . . 29--45
                Borja Balle and   
               Jorge Castro and   
               Ricard Gavald\`a   Learning probabilistic automata: a study
                                  in state distinguishability  . . . . . . 46--60
           Wouter M. Koolen and   
                Steven de Rooij   Switching investments  . . . . . . . . . 61--76
        András Antos and   
 Gábor Bartók and   
    Dávid Pál and   
        Csaba Szepesvári   Toward a classification of finite
                                  partial-monitoring games . . . . . . . . 77--99
                  John Case and   
              Timo Kötzing   Memory-limited non-U-shaped learning
                                  with solved open problems  . . . . . . . 100--123
                Sanjay Jain and   
      Samuel E. Moelius III and   
                  Sandra Zilles   Learning without coding  . . . . . . . . 124--148
                 Laurent Orseau   Asymptotic non-learnability of universal
                                  agents with computable horizon functions 149--156
              Fedor Zhdanov and   
                Yuri Kalnishkan   An identity for kernel ridge regression  157--178
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 474, Number ??, February 25, 2013

           B. Bérard and   
                  F. Cassez and   
                  S. Haddad and   
                    D. Lime and   
                     O. H. Roux   The expressive power of time Petri nets  1--20
       Pablo Barceló and   
               Juan Reutter and   
                  Leonid Libkin   Parameterized regular expressions and
                                  their languages  . . . . . . . . . . . . 21--45
                   Daniel Gaina   Interpolation in logics with
                                  constructors . . . . . . . . . . . . . . 46--59
               Samir Genaim and   
              Damiano Zanardini   Reachability-based acyclicity analysis
                                  by Abstract Interpretation . . . . . . . 60--79
                Pierre Lescanne   On counting untyped lambda terms . . . . 80--97
                Dale Miller and   
                Elaine Pimentel   A formal framework for specifying
                                  sequent calculus proof systems . . . . . 98--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 475, Number ??, March 4, 2013

                  J. Araujo and   
                  V. Campos and   
                 F. Giroire and   
                   N. Nisse and   
                 L. Sampaio and   
                      R. Soares   On the hull number of some graph classes 1--12
  Jòrgen Bang-Jensen and   
    Daniel Gonçalves and   
                     Anders Yeo   Partitioning the arcs of a digraph into
                                  a star forest of the underlying graph
                                  with prescribed orientation properties   13--20
 Ma\lgorzata Bednarska-Bzd\kega   On weight function methods in
                                  Chooser--Picker games  . . . . . . . . . 21--33
          F. Blanchet-Sadri and   
                   Sean Simmons   Deciding representability of sets of
                                  words of equal length  . . . . . . . . . 34--46
               Alain Bretto and   
          Yannick Silvestre and   
          Thierry Vallée   Factorization of products of
                                  hypergraphs: Structure and algorithms    47--58
               Shlomi Dolev and   
              Limor Lahiani and   
                   Yinnon Haviv   Unique permutation hashing . . . . . . . 59--65
               Sigrid Ewert and   
           Andries van der Walt   Necessary conditions for subclasses of
                                  random context languages . . . . . . . . 66--72
                 S. Brocchi and   
                 A. Frosini and   
                 R. Pinzani and   
                     S. Rinaldi   A tiling system for the class of
                                  $L$-convex polyominoes . . . . . . . . . 73--81
                Che-Nan Kuo and   
             Hsin-Hung Chou and   
              Nai-Wen Chang and   
                 Sun-Yuan Hsieh   Fault-tolerant path embedding in folded
                                  hypercubes with both node and edge
                                  faults . . . . . . . . . . . . . . . . . 82--91
          Marcin Bienkowski and   
              Marek Chrobak and   
        Christoph Dürr and   
            Mathilde Hurand and   
                  Artur Jez and   
                 Lukasz Jez and   
            Grzegorz Stachowiak   A $\phi$-competitive algorithm for
                                  collecting items with increasing weights
                                  from a dynamic queue . . . . . . . . . . 92--102
                   S. Karim and   
                  J. Sawada and   
                 Z. Alamgir and   
                  S. M. Husnine   Generating bracelets with fixed content  103--112
               Wing-Kai Hon and   
               Tsung-Han Ku and   
                 Rahul Shah and   
       Sharma V. Thankachan and   
           Jeffrey Scott Vitter   Faster compressed dictionary matching    113--119
         L'. Balková and   
        E. Pelantová and   
                  \vS. Starosta   Proof of the Brlek--Reutenauer
                                  conjecture . . . . . . . . . . . . . . . 120--125
               Achim Blumensath   Erratum to ``On the structure of graphs
                                  in the Caucal hierarchy'' [Theoret.
                                  Comput. Sci. \bf 400 (2008) 19--45]  . . 126--127
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 476, Number ??, March 11, 2013

       Nima AhmadiPourAnari and   
              Shayan Ehsani and   
            Mohammad Ghodsi and   
             Nima Haghpanah and   
           Nicole Immorlica and   
               Hamid Mahini and   
                 Vahab Mirrokni   Equilibrium pricing with positive
                                  externalities  . . . . . . . . . . . . . 1--15
                 Jian Chang and   
              Hui-Juan Wang and   
              Jian-Liang Wu and   
                     Yong-Ga A.   Total colorings of planar graphs with
                                  maximum degree $8$ and without
                                  $5$-cycles with two chords . . . . . . . 16--23
        Leslie Ann Goldberg and   
           Paul W. Goldberg and   
               Piotr Krysta and   
                 Carmine Ventre   Ranking games that have
                                  competitiveness-based strategies . . . . 24--37
           Petr A. Golovach and   
             Pim van 't Hof and   
           Daniël Paulusma   Obtaining planarity by contracting few
                                  edges  . . . . . . . . . . . . . . . . . 38--46
               Michel Habib and   
                   Juraj Stacho   Unique perfect phylogeny is intractable  47--66
                Qiong Huang and   
                 Duncan S. Wong   Short and efficient convertible
                                  undeniable signature schemes without
                                  random oracles . . . . . . . . . . . . . 67--83
               James K. Lan and   
           Gerard Jennhwa Chang   On the mixed domination problem in
                                  graphs . . . . . . . . . . . . . . . . . 84--93
                      Si Li and   
              Kwok Pui Choi and   
                     Taoyang Wu   Degree distribution of large networks
                                  generated by the partial duplication
                                  model  . . . . . . . . . . . . . . . . . 94--108
                      Yu Li and   
                 Donglei Du and   
                 Naihua Xiu and   
                     Dachuan Xu   A combinatorial $2.375$-approximation
                                  algorithm for the facility location
                                  problem with submodular penalties  . . . 109--117
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 477, Number ??, March 18, 2013

             Yu-Chang Liang and   
                     Xuding Zhu   Anti-magic labelling of Cartesian
                                  product of graphs  . . . . . . . . . . . 1--5
                B. Loridant and   
               A. Messaoudi and   
                   P. Surer and   
              J. M. Thuswaldner   Tilings induced by a class of cubic
                                  Rauzy fractals . . . . . . . . . . . . . 6--31
          Gary MacGillivray and   
                 Jacobus Swarts   Weak near-unanimity functions and
                                  digraph homomorphism problems  . . . . . 32--47
                Marcello Mamino   On the computational complexity of a
                                  game of cops and robbers . . . . . . . . 48--56
        Monaldo Mastrolilli and   
          Nikolaus Mutsanas and   
                   Ola Svensson   Single machine scheduling with scenarios 57--66
           Alexander Meduna and   
                     Petr Zemek   On the generation of sentences with
                                  their parses by propagating
                                  regular-controlled grammars  . . . . . . 67--75
         George B. Mertzios and   
        Sotiris Nikoletseas and   
   Christoforos Raptopoulos and   
               Paul G. Spirakis   Natural models for evolution on networks 76--95
                 Philippe Moser   On the polynomial depth of various sets
                                  of random strings  . . . . . . . . . . . 96--108
     Verónica Becher and   
             Pablo Ariel Heiber   Normal numbers and finite automata . . . 109--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 478, Number ??, March 25, 2013

               Achim Blumensath   An algebraic proof of Rabin's Tree
                                  Theorem  . . . . . . . . . . . . . . . . 1--21
          Paul Dütting and   
           Monika Henzinger and   
                   Ingmar Weber   Bidder optimal assignments for general
                                  utilities  . . . . . . . . . . . . . . . 22--32
        Konrad K. Dabrowski and   
               Marc Demange and   
                 Vadim V. Lozin   New results on maximum induced matchings
                                  in bipartite graphs and beyond . . . . . 33--40
            Cristina Bazgan and   
          Laurent Gourv\`es and   
 Jérôme Monnot and   
                  Fanny Pascual   Single approximation for the biobjective
                                  Max TSP  . . . . . . . . . . . . . . . . 41--50
                  Iyad Kanj and   
                  Fenghui Zhang   On the independence number of graphs
                                  with maximum degree $3$  . . . . . . . . 51--75
           Beno\^\it Libert and   
                      Moti Yung   Adaptively secure non-interactive
                                  threshold cryptosystems  . . . . . . . . 76--100
             Hossein Nevisi and   
              Daniel Reidenbach   Unambiguous $1$-uniform morphisms  . . . 101--117
               Daisuke Baba and   
               Tomoko Izumi and   
           Fukuhito Ooshita and   
         Hirotsugu Kakugawa and   
            Toshimitsu Masuzawa   Linear time and space gathering of
                                  anonymous mobile agents in asynchronous
                                  trees  . . . . . . . . . . . . . . . . . 118--126
                Wenbin Chen and   
                Lingxi Peng and   
             Jianxiong Wang and   
                  Fufang Li and   
                Maobin Tang and   
                  Wei Xiong and   
                   Songtao Wang   Inapproximability results for the
                                  minimum integral solution problem with
                                  preprocessing over $ \ell_\infty $ norm  127--131
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 479, Number ??, April 1, 2013

         Ilias S. Kotsireas and   
           Bernard Mourrain and   
              Victor Y. Pan and   
                     Lihong Zhi   Preface  . . . . . . . . . . . . . . . . 1--3
        Jonathan M. Borwein and   
                   Armin Straub   Mahler measures, short walks and
                                  log-sine integrals . . . . . . . . . . . 4--21
               Gregory Nuel and   
           Jean-Guillaume Dumas   Sparse approaches for the exact
                                  distribution of patterns in long state
                                  sequences generated by a Markov source   22--42
              Hidenao Iwane and   
             Hitoshi Yanami and   
              Hirokazu Anai and   
              Kazuhiro Yokoyama   An effective implementation of
                                  symbolic-numeric cylindrical algebraic
                                  decomposition for quantifier elimination 43--69
              Robert M. Corless   Pseudospectra of exponential matrix
                                  polynomials  . . . . . . . . . . . . . . 70--80
          Ioannis Z. Emiris and   
            Tatjana Kalinka and   
           Christos Konaxis and   
                   Thang Luu Ba   Implicitization of curves and
                                  (hyper)surfaces using predicted support  81--98
           Madalina Hodorog and   
                  Josef Schicho   A regularization approach for estimating
                                  the type of a plane curve singularity    99--119
            Elias P. Tsigaridas   Improved bounds for the CF algorithm . . 120--126
                    Akira Terui   GPGCD: an iterative method for
                                  calculating approximate GCD of
                                  univariate polynomials . . . . . . . . . 127--149
                   Zijia Li and   
                     Lihong Zhi   Computing the nearest singular
                                  univariate polynomials with given root
                                  multiplicities . . . . . . . . . . . . . 150--162
                     Nan Li and   
                     Lihong Zhi   Verified error bounds for isolated
                                  singular solutions of polynomial
                                  systems: Case of breadth one . . . . . . 163--173
            Claudia Fassino and   
           Maria-Laura Torrente   Simple varieties for limited precision
                                  points . . . . . . . . . . . . . . . . . 174--186
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 480, Number ??, April 8, 2013

                 E. Badouel and   
               R. Tchougong and   
           C. Nkuimi-Jugnia and   
                     B. Fotsing   Attribute grammars as tree transducers
                                  over cyclic representations of infinite
                                  trees and their descriptional
                                  composition  . . . . . . . . . . . . . . 1--25
           Agata Ciabattoni and   
                Franco Montagna   Proof theory for locally finite
                                  many-valued logics: Semi-projective
                                  logics . . . . . . . . . . . . . . . . . 26--42
        Marcello D'Agostino and   
             Marcelo Finger and   
                     Dov Gabbay   Semantics and proof-theory of depth
                                  bounded Boolean logics . . . . . . . . . 43--68
               Dilian Gurov and   
                Marieke Huisman   Reducing behavioural to structural
                                  properties of programs with procedures   69--103
            Benjamin Aminof and   
             Orna Kupferman and   
                  Robby Lampert   Rigorous approximated determinization of
                                  weighted automata  . . . . . . . . . . . 104--117
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 481, Number ??, April 15, 2013

              Gabriele Fici and   
                Luca Q. Zamboni   On the least number of palindromes
                                  contained in an infinite word  . . . . . 1--8
                Chia Wei Lu and   
               Chin Lung Lu and   
                   R. C. T. Lee   A new filtration method and a hybrid
                                  strategy for approximate string matching 9--17
                  Lily Chen and   
                Xueliang Li and   
                    Huishu Lian   Further hardness results on the rainbow
                                  vertex-connection number of graphs . . . 18--23
                    Yuan Li and   
            John O. Adeyeye and   
           David Murrugarra and   
              Boris Aguilar and   
          Reinhard Laubenbacher   Boolean nested canalizing functions: a
                                  comprehensive analysis . . . . . . . . . 24--36
            Antoniy Ganchev and   
             Lata Narayanan and   
                   Sunil Shende   A tight characterization of strategic
                                  games with a unique equilibrium  . . . . 37--50
           Nick D. L. Owens and   
           Andrew Greensted and   
                 Jon Timmis and   
                   Andy Tyrrell   The Receptor Density Algorithm . . . . . 51--73
           Petr A. Golovach and   
          Marcin Kami\'nski and   
       Daniël Paulusma and   
          Dimitrios M. Thilikos   Increasing the minimum degree of a graph
                                  by contractions  . . . . . . . . . . . . 74--84
         Sebastian Ordyniak and   
            Daniel Paulusma and   
                 Stefan Szeider   Satisfiability of acyclic and almost
                                  acyclic CNF formulas . . . . . . . . . . 85--99
        Athanasios Kehagias and   
             Dieter Mitsche and   
                   Pawel Pralat   Cops and invisible robbers: the cost of
                                  drunkenness  . . . . . . . . . . . . . . 100--120
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 482, Number ??, April 22, 2013

                   James Currie   Infinite ternary square-free words
                                  concatenated from permutations of a
                                  single word  . . . . . . . . . . . . . . 1--8
                 Xujin Chen and   
               Leah Epstein and   
              Elena Kleiman and   
                   Rob van Stee   Maximizing the minimum load: the cost of
                                  selfishness  . . . . . . . . . . . . . . 9--19
           Petr A. Golovach and   
             Dieter Kratsch and   
           Daniël Paulusma   Detecting induced minors in AT-free
                                  graphs . . . . . . . . . . . . . . . . . 20--32
             Yasushi Kawase and   
                Kazuhisa Makino   Nash equilibria with minimum potential
                                  in undirected broadcast games  . . . . . 33--47
                 Salvador Roura   Fibonacci BSTs: a new balancing method
                                  for binary search trees  . . . . . . . . 48--59
            Gonzalo Navarro and   
              Yakov Nekrich and   
        Luís M. S. Russo   Space-efficient data-analysis queries on
                                  grids  . . . . . . . . . . . . . . . . . 60--72
                Sanjay Jain and   
                Eric Martin and   
                  Frank Stephan   Learning and classifying . . . . . . . . 73--85
               Nguyen Kim Thang   $ \cal N P $-hardness of pure Nash
                                  equilibrium in Scheduling and Network
                                  Design Games . . . . . . . . . . . . . . 86--95
                    Adam Woryna   The concept of self-similar automata
                                  over a changing alphabet and lamplighter
                                  groups generated by such automata  . . . 96--110
                Xiumei Wang and   
                      Yixun Lin   Three-matching intersection conjecture
                                  for perfect matching polytopes of small
                                  dimensions . . . . . . . . . . . . . . . 111--114
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 483, Number ??, April 29, 2013

         Raffaele Giancarlo and   
               Giovanni Manzini   Foreword . . . . . . . . . . . . . . . . 1--1
             Dany Breslauer and   
             Roberto Grossi and   
                Filippo Mignosi   Simple real-time constant-space string
                                  matching . . . . . . . . . . . . . . . . 2--9
             Riccardo Dondi and   
           Guillaume Fertin and   
       Stéphane Vialette   Finding approximate and constrained
                                  motifs in graphs . . . . . . . . . . . . 10--21
                  Chris Thachuk   Compressed indexes for text with
                                  wildcards  . . . . . . . . . . . . . . . 22--35
               Travis Gagie and   
  Juha Kärkkäinen and   
            Gonzalo Navarro and   
               Simon J. Puglisi   Colored range queries and document
                                  retrieval  . . . . . . . . . . . . . . . 36--50
          Stefanie Schirmer and   
               Robert Giegerich   Forest alignment with affine gaps and
                                  anchors, applied in RNA structure
                                  comparison . . . . . . . . . . . . . . . 51--67
      Raphaël Clifford and   
           Markus Jalsenius and   
                  Ely Porat and   
                  Benjamin Sach   Space lower bounds for online pattern
                                  matching . . . . . . . . . . . . . . . . 68--74
                Paolo Ferragina   On the weak prefix-search problem  . . . 75--84
           Domenico Cantone and   
       Salvatore Cristofaro and   
                    Simone Faro   Efficient string-matching allowing for
                                  non-overlapping inversions . . . . . . . 85--95
          Michael Elberfeld and   
                Danny Segev and   
          Colin R. Davidson and   
            Dana Silverbush and   
                   Roded Sharan   Approximation algorithms for orienting
                                  mixed graphs . . . . . . . . . . . . . . 96--103
            Daniel G. Brown and   
              Jakub Truszkowski   Fast error-tolerant quartet phylogeny
                                  algorithms . . . . . . . . . . . . . . . 104--114
            Sebastian Kreft and   
                Gonzalo Navarro   On compressing and indexing repetitive
                                  sequences  . . . . . . . . . . . . . . . 115--133
            Markus J. Bauer and   
             Anthony J. Cox and   
                Giovanna Rosone   Lightweight algorithms for constructing
                                  and inverting the BWT of string
                                  collections  . . . . . . . . . . . . . . 134--148
            David E. Daykin and   
       Jacqueline W. Daykin and   
                    W. F. Smyth   A linear partitioning algorithm for
                                  Hybrid Lyndons using $v$-order . . . . . 149--161
                 Tomohiro I and   
           Shunsuke Inenaga and   
                Masayuki Takeda   Palindrome pattern matching  . . . . . . 162--170
                M. Christou and   
              M. Crochemore and   
           C. S. Iliopoulos and   
                  M. Kubica and   
               S. P. Pissis and   
             J. Radoszewski and   
                  W. Rytter and   
                 B. Szreder and   
                     T. Wale\'n   Efficient seed computation revisited . . 171--181
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 484, Number ??, May 6, 2013

              Josep Carmona and   
                   Jetty Kleijn   Compatibility in a multi-component
                                  environment  . . . . . . . . . . . . . . 1--15
           Durica Nikoli\'c and   
                   Fausto Spoto   Inferring complete initialization of
                                  arrays . . . . . . . . . . . . . . . . . 16--40
                Kosta Dosen and   
                 Zoran Petri\'c   Graphs of plural cuts  . . . . . . . . . 41--55
                  M. F. Worboys   Using bigraphs to model topological
                                  graphs embedded in orientable surfaces   56--69
         Ron van der Meyden and   
                   Chenyi Zhang   Information flow in systems with
                                  schedulers, Part II: Refinement  . . . . 70--92
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 485, Number ??, May 13, 2013

     Johanna Björklund and   
         Lars-Daniel Öhman   Simulation relations for pattern
                                  matching in directed graphs  . . . . . . 1--15
          F. Blanchet-Sadri and   
                     Nathan Fox   Abelian-primitive partial words  . . . . 16--37
             Manfred Droste and   
                   Werner Kuich   Weighted finite automata over hemirings  38--48
                G. Beaulieu and   
                   K. Burke and   
               E. Duchêne   Impartial coloring games . . . . . . . . 49--60
          Andreas Emil Feldmann   Fast balanced partitioning is hard even
                                  on grids and trees . . . . . . . . . . . 61--68
              Hajo Broersma and   
           Petr A. Golovach and   
                   Viresh Patel   Tight complexity bounds for FPT subgraph
                                  problems parameterized by the
                                  clique-width . . . . . . . . . . . . . . 69--84
                  Anna Kasprzik   Four one-shot learners for regular tree
                                  languages and their polynomial
                                  characterizability . . . . . . . . . . . 85--106
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 486, Number ??, May 20, 2013

                    Tal Mor and   
                     Alain Tapp   Preface  . . . . . . . . . . . . . . . . 1--3
            Gilles Brassard and   
André Allan Méthot   Strict hierarchy among Bell Theorems . . 4--10
              Richard Cleve and   
                Wim van Dam and   
            Michael Nielsen and   
                     Alain Tapp   Quantum entanglement and the
                                  communication complexity of the inner
                                  product function . . . . . . . . . . . . 11--19
            Viktor Galliard and   
                 Alain Tapp and   
                    Stefan Wolf   Deterministic quantum non-locality and
                                  graph colorings  . . . . . . . . . . . . 20--26
         Esther Hänggi and   
              Renato Renner and   
                    Stefan Wolf   The impossibility of non-signaling
                                  privacy amplification  . . . . . . . . . 27--42
        François Le Gall   Quantum weakly nondeterministic
                                  communication complexity . . . . . . . . 43--49
              Renato Renner and   
                    Stefan Wolf   Towards characterizing the non-locality
                                  of entangled quantum states  . . . . . . 50--60
            Gilles Brassard and   
             Anne Broadbent and   
         Esther Hänggi and   
André Allan Méthot and   
                    Stefan Wolf   Classical, quantum and nonsignalling
                                  resources in bipartite games . . . . . . 61--72
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 487, Number ??, May 27, 2013

                 Dror Fried and   
       Solomon Eyal Shimony and   
             Amit Benbassat and   
                   Cenny Wenner   Complexity of Canadian traveler problem
                                  variants . . . . . . . . . . . . . . . . 1--16
Manuel Vázquez de Parga and   
        Pedro García and   
     Damián López   A polynomial double reversal
                                  minimization algorithm for deterministic
                                  finite automata  . . . . . . . . . . . . 17--22
    Nicolás Carrasco and   
         Jean-Marie Le Bars and   
                  Alfredo Viola   Enumerative encoding of
                                  correlation-immune Boolean functions . . 23--36
             Antoine Ndione and   
      Aurélien Lemay and   
                Joachim Niehren   Approximate membership for regular
                                  languages modulo the edit distance . . . 37--49
              Victor Campos and   
Frédéric Havet and   
             Rudini Sampaio and   
                      Ana Silva   Backbone colouring: Tree backbones with
                                  small diameter in planar graphs  . . . . 50--64
                   D. Early and   
                 M. Schellekens   Running time of the Treapsort algorithm  65--73
              Zhendong Shao and   
              Roberto Solis-Oba   $ L(2, 1) $-labelings on the modular
                                  product of two graphs  . . . . . . . . . 74--81
Jean-François Couturier and   
            Pinar Heggernes and   
             Pim van 't Hof and   
                 Dieter Kratsch   Minimal dominating sets in graph
                                  classes: Combinatorial bounds and
                                  enumeration  . . . . . . . . . . . . . . 82--94
                   Sheng Yu and   
            Prudence W. H. Wong   Online scheduling of simple linear
                                  deteriorating jobs to minimize the total
                                  general completion time  . . . . . . . . 95--102
    Andreas Brandstädt and   
               Synara Brito and   
             Sulamita Klein and   
        Loana Tito Nogueira and   
            Fábio Protti   Corrigendum to ``Cycle transversals in
                                  perfect graphs and cographs'' [Theoret.
                                  Comput. Sci. \bf 469 (2013) 15--23]  . . 103--105
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 488, Number ??, June 3, 2013

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
              Sankar K. Pal and   
                  Romi Banerjee   Context granulation and
                                  subjective-information quantification    2--14
               A. Degasperi and   
                      M. Calder   A process algebra framework for
                                  multi-scale modelling of biological
                                  systems  . . . . . . . . . . . . . . . . 15--45
                    Murat Diker   Categories of rough sets and textures    46--65
                 Achim Jung and   
               Jonathan E. Rowe   Convergence of preference functions  . . 66--77
          Petr Sosík and   
                Andrei Paun and   
Alfonso Rodríguez-Patón   $ P $ systems with proteins on membranes
                                  characterize PSPACE  . . . . . . . . . . 78--95
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 489--490, Number ??, June 10, 2013

            Martin Berglund and   
      Henrik Björklund and   
         Johanna Björklund   Shuffled languages --- Representation
                                  and recognition  . . . . . . . . . . . . 1--20
               Aldar C.-F. Chan   On optimal cryptographic key derivation  21--36
                Sanjay Jain and   
                    Efim Kinber   Mind change speed-up for learning
                                  languages from positive data . . . . . . 37--47
                 Fuxiang Yu and   
                       Ker-I Ko   On parallel complexity of analytic
                                  functions  . . . . . . . . . . . . . . . 48--57
                 Xinrong Lu and   
                    Zhaohui Liu   Semi-online scheduling problems on two
                                  uniform machines under a grade of
                                  service provision  . . . . . . . . . . . 58--66
             Nachshon Cohen and   
                     Zeev Nutov   A $ 1 + \ln 2 $-approximation algorithm
                                  for minimum-cost $2$-edge-connectivity
                                  augmentation of trees with constant
                                  radius . . . . . . . . . . . . . . . . . 67--74
             Alex Kesselman and   
           Boaz Patt-Shamir and   
               Gabriel Scalosub   Competitive buffer management with
                                  packet dependencies  . . . . . . . . . . 75--87
       George Christodoulou and   
Annamária Kovács and   
                   Rob van Stee   A truthful constant approximation for
                                  maximizing the minimum load on related
                                  machines . . . . . . . . . . . . . . . . 88--98
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 491, Number ??, June 17, 2013

             Eric Berberich and   
         Pavel Emeliyanenko and   
            Alexander Kobel and   
              Michael Sagraloff   Exact symbolic-numeric computation of
                                  planar algebraic curves  . . . . . . . . 1--32
             Anton Cerný   On Prouhet's solution to the equal
                                  powers problem . . . . . . . . . . . . . 33--46
                   Daniel Krenn   Analysis of the width-$w$ non-adjacent
                                  form in conjunction with hyperelliptic
                                  curve cryptography and with lattices . . 47--70
                Eddie Cheng and   
                Shalin Shah and   
                  Vyom Shah and   
               Daniel E. Steffy   Strong matching preclusion for augmented
                                  cubes  . . . . . . . . . . . . . . . . . 71--77
                Yuxing Yang and   
                   Shiying Wang   Fault-free Hamiltonian cycles passing
                                  through a linear forest in ternary
                                  $n$-cubes with faulty edges  . . . . . . 78--82
                Jae Woo Seo and   
               Dae Hyun Yum and   
                  Pil Joong Lee   Proxy-invisible CCA-secure type-based
                                  proxy re-encryption without random
                                  oracles  . . . . . . . . . . . . . . . . 83--93
              Jianming Dong and   
                   An Zhang and   
                  Yong Chen and   
                     Qifan Yang   Approximation algorithms for two-machine
                                  open shop scheduling with batch and
                                  delivery coordination  . . . . . . . . . 94--102
              Shurong Zhang and   
                   Shiying Wang   Many-to-many disjoint path covers in
                                  $k$-ary $n$-cubes  . . . . . . . . . . . 103--118
                   Jing Jin and   
                 Baogang Xu and   
                  Xiaoyan Zhang   On the complexity of injective colorings
                                  and its generalizations  . . . . . . . . 119--126
                   Xiao Yin and   
                     Daming Zhu   Sorting genomes by generalized
                                  translocations . . . . . . . . . . . . . 127--135
                    Tamir Tassa   Addendum to ``Finding all
                                  maximally-matchable edges in a bipartite
                                  graph'' [Theoret. Comput. Sci. \bf 423
                                  (2012) 50--58] . . . . . . . . . . . . . 136--136
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 492, Number ??, June 24, 2013

             Vincent Cheval and   
   Véronique Cortier and   
       Stéphanie Delaune   Deciding equivalence-based properties
                                  using constraint solving . . . . . . . . 1--39
                Norihiro Kamide   Temporal BI: Proof system, semantics and
                                  translations . . . . . . . . . . . . . . 40--69
            Oliver Kullmann and   
                    Xishun Zhao   On Davis--Putnam reductions for
                                  minimally unsatisfiable clause-sets  . . 70--87
                 D. Colazzo and   
                  G. Ghelli and   
                 L. Pardini and   
                    C. Sartiani   Efficient asymmetric inclusion of
                                  regular expressions with interleaving
                                  and counting for XML type-checking . . . 88--116
         Franck van Breugel and   
            Claudio Hermida and   
             Michael Makkai and   
                  James Worrell   Addendum to ``Recursively defined metric
                                  spaces without contraction'' [Theoret.
                                  Comput. Sci. \bf 380 (1/2) (2007)
                                  143--163]  . . . . . . . . . . . . . . . 117--122
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 493, Number ??, July 1, 2013

        Giovanna D'Agostino and   
             Salvatore La Torre   Games, Automata, Logic, and Formal
                                  Verification (GandALF 2011)  . . . . . . 1--1
              Erich Grädel   Model-checking games for logics of
                                  imperfect information  . . . . . . . . . 2--14
            Davide Bresolin and   
                Marta Capiluppi   A game-theoretic approach to fault
                                  diagnosis and identification of hybrid
                                  systems  . . . . . . . . . . . . . . . . 15--29
              Martin Zimmermann   Optimal bounds in parametric LTL games   30--45
           Sten Grüner and   
         Frank G. Radmacher and   
                Wolfgang Thomas   Connectivity games over dynamic networks 46--65
                Stefan Haar and   
             Christian Kern and   
                 Stefan Schwoon   Computing the reveals relation in
                                  occurrence nets  . . . . . . . . . . . . 66--79
           Václav Brozek   Determinacy and optimal strategies in
                                  infinite-state stochastic reachability
                                  games  . . . . . . . . . . . . . . . . . 80--97
            Davide Bresolin and   
           Angelo Montanari and   
                Pietro Sala and   
                Guido Sciavicco   Optimal decision procedures for MPNL
                                  over finite structures, the natural
                                  numbers, and the integers  . . . . . . . 98--115
        Massimo Benerecetti and   
               Marco Faella and   
               Stefano Minopoli   Automatic synthesis of switching
                                  controllers for linear hybrid systems:
                                  Safety control . . . . . . . . . . . . . 116--138
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 494, Number ??, July 8, 2013

        Ji\vrí Fiala and   
      Jan Kratochvíl and   
                    Angsheng Li   Preface  . . . . . . . . . . . . . . . . 1--1
          Klaus Ambos-Spies and   
                Timur Bakibayev   Nontriviality for exponential time
                                  w.r.t. weak reducibilities . . . . . . . 2--12
                 Ajesh Babu and   
               Nutan Limaye and   
     Jaikumar Radhakrishnan and   
                   Girish Varma   Streaming algorithms for language
                                  recognition problems . . . . . . . . . . 13--23
              Rongquan Feng and   
               Menglong Nie and   
                    Hongfeng Wu   Twisted Jacobi intersections curves  . . 24--35
            Andris Ambainis and   
          Dmitry Kravchenko and   
            Nikolay Nahimov and   
           Alexander Rivosh and   
                   Madars Virza   On symmetric nonlocal games  . . . . . . 36--48
              Josef Cibulka and   
                  Jan Kyncl and   
Viola Mészáros and   
              Rudolf Stolar and   
                    Pavel Valtr   Graph sharing games: Complexity and
                                  connectivity . . . . . . . . . . . . . . 49--62
                 Jin-Yi Cai and   
              Michael Kowalczyk   Partition functions on $k$-regular
                                  graphs with $ \{ 0, 1 \} $-vertex
                                  assignments and real edge functions  . . 63--74
       Christophe Crespelle and   
                   Ioan Todinca   An $ O(n^2) $-time algorithm for the
                                  minimal interval completion problem  . . 75--85
               Sepp Hartung and   
               Rolf Niedermeier   Incremental list coloring of graphs,
                                  parameterized by conservation  . . . . . 86--98
           Johannes Uhlmann and   
                 Mathias Weller   Two-Layer Planarization parameterized by
                                  feedback edge set  . . . . . . . . . . . 99--111
                     Xin He and   
                  Huaming Zhang   A simple routing algorithm based on
                                  Schnyder coordinates . . . . . . . . . . 112--121
            Laurent Bulteau and   
           Guillaume Fertin and   
                     Irena Rusu   Revisiting the Minimum Breakpoint
                                  Linearization Problem  . . . . . . . . . 122--133
          Sylvain Guillemot and   
                 Matthias Mnich   Kernel and fast algorithm for dense
                                  triplet inconsistency  . . . . . . . . . 134--143
              Ming-Yang Kao and   
          Henry C. M. Leung and   
                     He Sun and   
                     Yong Zhang   Deterministic polynomial-time algorithms
                                  for designing short DNA words  . . . . . 144--160
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 495, Number ??, July 15, 2013

           Domenico Cantone and   
                    Micha Hofri   Further analysis of the remedian
                                  algorithm  . . . . . . . . . . . . . . . 1--16
         Michelangelo Bucci and   
         Alessandro De Luca and   
                Luca Q. Zamboni   Reversible Christoffel factorizations    17--24
                Ali Dehghan and   
      Mohammad-Reza Sadeghi and   
                    Arash Ahadi   Algorithmic complexity of proper
                                  labeling problems  . . . . . . . . . . . 25--36
        Dariusz Dereniowski and   
                     Danny Dyer   On minimum cost edge searching . . . . . 37--49
            Cees H. Elzinga and   
                       Hui Wang   Versatile string kernels . . . . . . . . 50--65
                   Ron Adar and   
                   Leah Epstein   Selfish bin packing with cardinality
                                  constraints  . . . . . . . . . . . . . . 66--80
Andrés Cordón-Franco and   
         Hans van Ditmarsch and   
David Fernández-Duque and   
         Fernando Soler-Toscano   A colouring protocol for the generalized
                                  Russian cards problem  . . . . . . . . . 81--95
                 Manzhan Gu and   
                       Xiwen Lu   The expected asymptotical ratio for
                                  preemptive stochastic online problem . . 96--112
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 496, Number ??, July 22, 2013

              Ajoy K. Datta and   
       Stéphane Devismes   Preface  . . . . . . . . . . . . . . . . 1--1
              Abhinav Mehta and   
           Shashank Agrawal and   
               Kannan Srinathan   Interplay between (im)perfectness,
                                  synchrony and connectivity: the case of
                                  reliable message transmission  . . . . . 2--16
               Jingshu Chen and   
               Sandeep Kulkarni   MR4UM: a framework for adding fault
                                  tolerance to UML state diagrams  . . . . 17--33
     Carole Delporte-Gallet and   
          Hugues Fauconnier and   
                  Hung Tran-The   Byzantine agreement with homonyms in
                                  synchronous systems  . . . . . . . . . . 34--49
              Ali Ebnenasir and   
           Reza Hajisheykhi and   
            Sandeep S. Kulkarni   Facilitating the design of fault
                                  tolerance in transaction level SystemC
                                  programs . . . . . . . . . . . . . . . . 50--68
           Sotirios Kentros and   
                Aggelos Kiayias   Solving the at-most-once problem with
                                  nearly optimal effectiveness . . . . . . 69--88
             Alain Cournier and   
                Swan Dubois and   
              Anissa Lamani and   
               Franck Petit and   
                Vincent Villain   The snap-stabilizing message forwarding
                                  algorithm on tree topologies . . . . . . 89--112
                 Ranjan Pal and   
                        Pan Hui   Economic models for cloud service
                                  markets: Pricing and capacity planning   113--124
                Sathya Peri and   
                 K. Vidyasankar   Correctness of concurrent executions of
                                  closed nested transactions in
                                  transactional memory systems . . . . . . 125--153
                Tyler Crain and   
                Damien Imbs and   
                  Michel Raynal   Towards a universal construction for
                                  transaction-based multiprocess programs  154--169
                Nuno Santos and   
           André Schiper   Optimizing Paxos with batching and
                                  pipelining . . . . . . . . . . . . . . . 170--183
                   Guy Even and   
                Moti Medina and   
          Gregor Schaffrath and   
                  Stefan Schmid   Competitive and deterministic embeddings
                                  of virtual networks  . . . . . . . . . . 184--194
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 497, Number ??, July 29, 2013

                   Lin Chen and   
                 Guochuan Zhang   Approximation algorithms for a bi-level
                                  knapsack problem . . . . . . . . . . . . 1--12
             Takuya Umesato and   
             Toshiki Saitoh and   
              Ryuhei Uehara and   
                   Hiro Ito and   
                 Yoshio Okamoto   The complexity of the stamp folding
                                  problem  . . . . . . . . . . . . . . . . 13--19
               Yongding Zhu and   
                      Jinhui Xu   Improved algorithms for the farthest
                                  colored Voronoi diagram of segments  . . 20--30
                         Fei Li   A comprehensive study of an online
                                  packet scheduling algorithm  . . . . . . 31--38
              Zhixiang Chen and   
                     Bin Fu and   
                   Yang Liu and   
               Robert Schweller   On testing monomials in multivariate
                                  polynomials  . . . . . . . . . . . . . . 39--54
                    Boting Yang   Euclidean chains and their shortcuts . . 55--67
                  Nan Zhang and   
               Zhenhua Duan and   
                      Cong Tian   A cylinder computation model for
                                  many-core parallel computing . . . . . . 68--83
               Zhenhua Duan and   
                  Nan Zhang and   
                  Maciej Koutny   A complete proof system for
                                  propositional projection temporal logic  84--107
                   Ming Liu and   
              Feifeng Zheng and   
                Shijin Wang and   
                     Yinfeng Xu   Approximation algorithms for parallel
                                  machine scheduling with linear
                                  deterioration  . . . . . . . . . . . . . 108--111
             Radwa El Shawi and   
            Joachim Gudmundsson   Fast query structures in anisotropic
                                  media  . . . . . . . . . . . . . . . . . 112--122
               Xiaofeng Gao and   
                  Zaixin Lu and   
                   Weili Wu and   
                         Bin Fu   Algebraic data retrieval algorithms for
                                  multi-channel wireless data broadcast    123--130
                Qinghai Liu and   
              Xiaohui Huang and   
                     Zhao Zhang   Optimally restricted edge connected
                                  elementary Harary graphs . . . . . . . . 131--138
                    Hui Liu and   
                  Zewen Liu and   
                  Deying Li and   
                Xianling Lu and   
                     Hongwei Du   Approximation algorithms for minimum
                                  latency data aggregation in wireless
                                  sensor networks with directional antenna 139--153
                Yukun Cheng and   
                     Wei Yu and   
                 Guochuan Zhang   Strategy-proof approximation mechanisms
                                  for an obnoxious facility game on
                                  networks . . . . . . . . . . . . . . . . 154--163
                         Fei Li   A near-optimal memoryless online
                                  algorithm for FIFO buffering two packet
                                  classes  . . . . . . . . . . . . . . . . 164--172
                  Deying Li and   
                  Zewen Liu and   
                    Yi Hong and   
               Wenping Chen and   
                        Huan Ma   Minimum energy multicast/broadcast
                                  routing with reception cost in wireless
                                  sensor networks  . . . . . . . . . . . . 173--180
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 498, Number ??, August 5, 2013

  João Araújo and   
              Wolfram Bentz and   
               Peter J. Cameron   Groups synchronizing a transformation of
                                  non-uniform kernel . . . . . . . . . . . 1--9
   Stéphane Devismes and   
               Franck Petit and   
       Sébastien Tixeuil   Optimal probabilistic ring exploration
                                  by semi-synchronous oblivious robots . . 10--27
                   Ruo-Wei Hung   DVcube: a novel compound architecture of
                                  disc-ring graph and hypercube-like graph 28--45
               Min Kyung An and   
                Nhat X. Lam and   
              Dung T. Huynh and   
                 Trac N. Nguyen   Bounded-degree minimum-radius spanning
                                  trees in wireless sensor networks  . . . 46--57
                  Cewei Cui and   
                   Zhe Dang and   
          Thomas R. Fischer and   
                Oscar H. Ibarra   Similarity in languages and programs . . 58--75
        Colin de la Higuera and   
    Jean-Christophe Janodet and   
       Émilie Samuel and   
          Guillaume Damiand and   
               Christine Solnon   Polynomial algorithms for open plane
                                  graph and subgraph isomorphisms  . . . . 76--99
                 Ernst L. Leiss   The worst Hanoi graphs . . . . . . . . . 100--106
          Christina Boucher and   
              Gad M. Landau and   
                Avivit Levy and   
            David Pritchard and   
                   Oren Weimann   On approximating string selection
                                  problems with outliers . . . . . . . . . 107--114
                   Hong Liu and   
                     Daming Zhu   Parameterized complexity of control by
                                  voter selection in Maximin, Copeland,
                                  Borda, Bucklin, and Approval election
                                  systems  . . . . . . . . . . . . . . . . 115--123
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 499, Number ??, August 12, 2013

                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
José Félix Costa and   
                 Raimundo Leong   The ARNN model relativises P = NP and P
                                  $ \neq $ NP  . . . . . . . . . . . . . . 2--22
             Eugen Czeizler and   
                 Alexandru Popa   Synthesizing minimal tile sets for
                                  complex patterns in the framework of
                                  patterned DNA self-assembly  . . . . . . 23--37
                   Yuan Gao and   
                      Lila Kari   State complexity of star of union and
                                  square of union on $k$ regular languages 38--50
              Satoshi Kobayashi   Enumeration approach to computing
                                  chemical equilibria  . . . . . . . . . . 51--87
                Keqin Jiang and   
                   Tao Song and   
                   Linqiang Pan   Universality of sequential spiking
                                  neural P systems based on minimum spike
                                  number . . . . . . . . . . . . . . . . . 88--97
             Shenggen Zheng and   
                 Daowen Qiu and   
               Jozef Gruska and   
                  Lvzhou Li and   
                   Paulo Mateus   State succinctness of two-way finite
                                  automata with quantum and classical
                                  states . . . . . . . . . . . . . . . . . 98--112
                 Daniel Vaz and   
        Luís Paquete and   
            Aníbal Ponte   A note on the $ \epsilon $-indicator
                                  subset selection . . . . . . . . . . . . 113--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 501, Number ??, August 27, 2013

                Wenqi Huang and   
                         Kun He   On the weak computability of a four
                                  dimensional orthogonal packing and time
                                  scheduling problem . . . . . . . . . . . 1--10
            Oscar H. Ibarra and   
                Shinnosuke Seki   On the open problem of Ginsburg
                                  concerning semilinear sets and related
                                  problems . . . . . . . . . . . . . . . . 11--19
            Christoph Behle and   
              Andreas Krebs and   
                    Mark Mercer   Linear circuits, two-variable logic and
                                  weakly blocked monoids . . . . . . . . . 20--33
            Indra Rajasingh and   
                 R. Bharati and   
          Albert Muthumalai and   
                  A. S. Shanthi   On excessive index of certain networks   34--40
                   Amy Glen and   
                  Jamie Simpson   The total run length of a word . . . . . 41--48
               Lee Klingler and   
          Rainer Steinwandt and   
                Dominique Unruh   On using probabilistic Turing machines
                                  to model participants in cryptographic
                                  protocols  . . . . . . . . . . . . . . . 49--51
        Violeta Tomasevi\'c and   
               Milo Tomasevi\'c   An analysis of chain characteristics in
                                  the cryptanalytic TMTO method  . . . . . 52--61
          Chang-Hsiung Tsai and   
               Jheng-Cheng Chen   Fault isolation and identification in
                                  general biswapped networks under the PMC
                                  diagnostic model . . . . . . . . . . . . 62--71
            Nodari Vakhania and   
                   Frank Werner   Minimizing maximum lateness of jobs with
                                  naturally bounded job data on a single
                                  machine in polynomial time . . . . . . . 72--81
                C. J. van Alten   Partial algebras and complexity of
                                  satisfiability and universal theory for
                                  distributive lattices, boolean algebras
                                  and Heyting algebras . . . . . . . . . . 82--92
      Paul M. B. Vitányi   Conditional Kolmogorov complexity and
                                  universal probability  . . . . . . . . . 93--100
                Daniel Apon and   
              Jonathan Katz and   
             Alex J. Malozemoff   One-round multi-party communication
                                  complexity of distinguishing sums  . . . 101--108
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 502, Number ??, September 2, 2013

               Srecko Brlek and   
      Christophe Reutenauer and   
                Jean-Guy Penaud   Generation of Combinatorial Structures   1--3
               Timothy R. Walsh   Counting maps on doughnuts . . . . . . . 4--15
           Gunnar Brinkmann and   
          Nico Van Cleemput and   
                 Tomaz Pisanski   Generation of various classes of
                                  trivalent graphs . . . . . . . . . . . . 16--29
                   Mohamed Abdo   Efficient generation of the ideals of a
                                  poset in Gray code order, part II  . . . 30--45
                  J. Sawada and   
                    A. Williams   A Gray code for fixed-density necklaces
                                  and Lyndon words in constant amortized
                                  time . . . . . . . . . . . . . . . . . . 46--54
             Olivier Bodini and   
                  Alice Jacquot   Boltzmann samplers for $ \nu $-balanced
                                  cycles . . . . . . . . . . . . . . . . . 55--63
         Y. Métivier and   
               J. M. Robson and   
          N. Saheb-Djahromi and   
                     A. Zemmari   On the time and the bit complexity of
                                  distributed randomised anonymous ring
                                  colouring  . . . . . . . . . . . . . . . 64--75
Jérôme Fortier and   
               Alain Goupil and   
            Jonathan Lortie and   
   Jérôme Tremblay   Exhaustive generation of gominoes  . . . 76--87
                J. M. Fedou and   
                 A. Frosini and   
                     S. Rinaldi   Enumeration of $4$-stack polyominoes . . 88--97
    A. Blondin Massé and   
                   A. Garon and   
                S. Labbé   Combinatorial properties of double
                                  square tiles . . . . . . . . . . . . . . 98--117
Valérie Berthé and   
              Annie Lacasse and   
         Genevi\`eve Paquin and   
        Xavier Provençal   A study of Jacobi--Perron boundary words
                                  for the generation of discrete planes    118--142
       Jean-Christophe Aval and   
                Philippe Duchon   Half-turn symmetric FPLs with rare
                                  couplings and tilings of hexagons  . . . 143--152
                 R. Mantaci and   
                    P. Massazza   On the exhaustive generation of plane
                                  partitions . . . . . . . . . . . . . . . 153--164
              Johan Oudinet and   
               Alain Denise and   
            Marie-Claude Gaudel   A new dichotomic algorithm for the
                                  uniform random generation of words in
                                  regular languages  . . . . . . . . . . . 165--176
      William Andrew Lorenz and   
                     Yann Ponty   Non-redundant random generation
                                  algorithms for weighted context-free
                                  grammars . . . . . . . . . . . . . . . . 177--194
       Jean-Christophe Aval and   
         Adrien Boussicault and   
         Sandrine Dasse-Hartaut   Dyck tableaux  . . . . . . . . . . . . . 195--209
             Elena Barcucci and   
             Vincent Vajnovszki   Generalized Schröder permutations . . . . 210--216
               M. D'Adderio and   
                   A. M. Garsia   Explicit formulas for a sequence of
                                  binary tree polynomials  . . . . . . . . 217--226
                  O. Bodini and   
                   D. Gardy and   
                     A. Jacquot   Asymptotics and random sampling for BCI
                                  and BCK lambda terms . . . . . . . . . . 227--238
                 S. Bilotta and   
                 F. Disanto and   
                 R. Pinzani and   
                     S. Rinaldi   Catalan structures and Catalan pairs . . 239--248
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 503, Number ??, September 9, 2013

  José Luiz Fiadeiro and   
           Antónia Lopes   An interface theory for service-oriented
                                  design . . . . . . . . . . . . . . . . . 1--30
               Paul Howells and   
                 Mark d'Inverno   Specifying termination in CSP  . . . . . 31--60
                Savas Konur and   
             Michael Fisher and   
                    Sven Schewe   Combined model checking for temporal,
                                  probabilistic, and real-time logics  . . 61--88
                   Wei Chen and   
                 Guangda Hu and   
                   Jialin Zhang   On the power of breakable objects  . . . 89--108
          Siddharth Krishna and   
                  Anca Muscholl   A quadratic construction for Zielonka
                                  automata with acyclic communication
                                  structure  . . . . . . . . . . . . . . . 109--114
               Samir Genaim and   
              Damiano Zanardini   Corrigendum to ``Reachability-based
                                  acyclicity analysis by abstract
                                  interpretation'' [Theoretical Computer
                                  Science \bf 474 (2013) 60--79] . . . . . 115--115
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 500, Number ??, August 19, 2013

           Martin R. Ehmsen and   
                  Kim S. Larsen   Better bounds on online unit clustering  1--24
                Kitty Meeks and   
                Alexander Scott   The complexity of Free-Flood-It on $ 2
                                  \times n $ boards  . . . . . . . . . . . 25--43
                Yair Bartal and   
         Douglas E. Carroll and   
              Adam Meyerson and   
                    Ofer Neiman   Bandwidth and low dimensional embedding  44--56
          Jarkko Peltomäki   Introducing privileged words: Privileged
                                  complexity of Sturmian words . . . . . . 57--67
          Béla Csaba and   
            Thomas A. Plick and   
               Ali Shokoufandeh   Optimal random matchings, tours, and
                                  spanning trees in hierarchically
                                  separated trees  . . . . . . . . . . . . 68--89
          Lélia Blin and   
       Maria Potop-Butucaru and   
             Stephane Rovedakis   A super-stabilizing $ \log (n)
                                  $-approximation algorithm for dynamic
                                  Steiner trees  . . . . . . . . . . . . . 90--112
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 504, Number ??, September 16, 2013

                 Michel Cosnard   Celebrating the 60th birthday of Eric
                                  Goles  . . . . . . . . . . . . . . . . . 1--2
            Cristian Calude and   
               Bruno Durand and   
       Anahí Gajardo and   
           Dominique Perrin and   
              Ivan Rapaport and   
                    Sergio Rica   Discrete mathematical structures: From
                                  dynamics to complexity . . . . . . . . . 3--4
        Jean-Claude Bermond and   
             Michel Cosnard and   
Stéphane Pérennes   Directed acyclic graphs with the unique
                                  dipath property  . . . . . . . . . . . . 5--11
             Mathilde Noual and   
            Damien Regnault and   
            Sylvain Sené   About non-monotony in Boolean automata
                                  networks . . . . . . . . . . . . . . . . 12--25
                M. Macauley and   
                 H. S. Mortveit   An atlas of limit set dynamics for
                                  asynchronous elementary cellular
                                  automata . . . . . . . . . . . . . . . . 26--37
          Alberto Dennunzio and   
            Enrico Formenti and   
              Julien Provillard   Local rule distributions, language
                                  complexity and non-uniform cellular
                                  automata . . . . . . . . . . . . . . . . 38--51
        Kévin Perrot and   
      Éric Rémila   Kadanoff sand pile model. Avalanche
                                  structure and wave shape . . . . . . . . 52--72
                 Eric Goles and   
    Pedro Montealegre-Barba and   
                   Ioan Todinca   The complexity of the bootstraping
                                  percolation and other problems . . . . . 73--82
                   Bruno Martin   On Goles' universal machines: a
                                  computational point of view  . . . . . . 83--88
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 505, Number ??, September 23, 2013

          Mitusnori Ogihara and   
                      Jun Tarui   Theory and Applications of Models of
                                  Computation 2011 . . . . . . . . . . . . 1--1
              Ernst Althaus and   
            Joschka Kupilas and   
                 Rouven Naujoks   On the low-dimensional Steiner minimum
                                  tree problem in Hamming metric . . . . . 2--10
         Francis Y. L. Chin and   
          Henry C. M. Leung and   
                      S. M. Yiu   Non-adaptive complex group testing with
                                  multiple positive sets . . . . . . . . . 11--18
             Tobias Brunsch and   
              Heiko Röglin   A bad instance for $k$-means++ . . . . . 19--26
        Maciej Li\'skiewicz and   
      Rüdiger Reischuk and   
             Ulrich Wölfel   Grey-box steganography . . . . . . . . . 27--41
Konstanty Junosza-Szaniawski and   
      Jan Kratochvíl and   
           Mathieu Liedloff and   
           Peter Rossmanith and   
                Pawel Rzazewski   Fast exact algorithm for $ L(2, 1)
                                  $-labeling of graphs . . . . . . . . . . 42--54
                 Arne Meier and   
               Thomas Schneider   Generalized satisfiability for the
                                  description logic ALC  . . . . . . . . . 55--73
               Akira Suzuki and   
               Kei Uchizawa and   
                      Xiao Zhou   Energy and fan-in of logic circuits
                                  computing symmetric Boolean functions    74--80
           Emmanuel Jeandel and   
                  Pascal Vanier   Turing degrees of multidimensional SFTs  81--92
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 506, Number ??, September 30, 2013

               Sahadev Bera and   
            Partha Bhowmick and   
           Peer Stelldinger and   
        Bhargab B. Bhattacharya   On covering a digital disc with
                                  concentric circles in $ \mathbb {Z}^2 $  1--16
          F. Blanchet-Sadri and   
                Brent Woodhouse   Strict bounds for pattern avoidance  . . 17--28
       Liliana Alcón and   
              Luerbio Faria and   
 Celina M. H. de Figueiredo and   
               Marisa Gutierrez   Split clique graph complexity  . . . . . 29--42
     Yoann Dieudonné and   
       Florence Levé and   
               Franck Petit and   
                Vincent Villain   Deterministic geoleader election in
                                  disoriented anonymous systems  . . . . . 43--54
               Dyi-Rong Duh and   
              Yao-Chung Lin and   
              Cheng-Nan Lai and   
                    Yue-Li Wang   Two spanning disjoint paths with
                                  required length in generalized
                                  hypercubes . . . . . . . . . . . . . . . 55--78
Tullio Ceccherini-Silberstein and   
           Michel Coornaert and   
         Francesca Fiorenzi and   
                  Zoran Suni\'c   Cellular automata between sofic tree
                                  shifts . . . . . . . . . . . . . . . . . 79--101
        Tomás Flouri and   
       Costas S. Iliopoulos and   
           Tomasz Kociumaka and   
            Solon P. Pissis and   
           Simon J. Puglisi and   
                W. F. Smyth and   
           Wojciech Tyczy\'nski   Enhanced string covering . . . . . . . . 102--114
            Neeldhara Misra and   
        N. S. Narayanaswamy and   
            Venkatesh Raman and   
                Bal Sri Shankar   Solving min ones $2$-sat as fast as
                                  vertex cover . . . . . . . . . . . . . . 115--121
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 507, Number ??, October 7, 2013

                     Guohui Lin   Preface  . . . . . . . . . . . . . . . . 1--1
           Jing (Selena) He and   
                Shouling Ji and   
                     Yi Pan and   
                    Zhipeng Cai   Approximation algorithms for
                                  load-balanced virtual backbone
                                  construction in wireless sensor networks 2--16
                 Xujin Chen and   
                Xiaodong Hu and   
                 Weidong Ma and   
                  Changjun Wang   Reducing price of anarchy of selfish
                                  task allocation with more selfishness    17--33
                Qiang Zhang and   
                  Weiwei Wu and   
                     Minming Li   Minimizing the total weighted completion
                                  time of fully parallel jobs with integer
                                  parallel units . . . . . . . . . . . . . 34--40
                  Wei Jiang and   
                   Tian Liu and   
                Chaoyi Wang and   
                          Ke Xu   Feedback vertex sets on restricted
                                  bipartite graphs . . . . . . . . . . . . 41--51
            Adrian Kosowski and   
            Alfredo Navarra and   
              Dominik Pajak and   
            Cristina M. Pinotti   Maximum matching in multi-interface
                                  networks . . . . . . . . . . . . . . . . 52--60
        Luís Paquete and   
            Mathias Jaschob and   
           Kathrin Klamroth and   
                  Jochen Gorski   On a biobjective search problem in a
                                  line: Formulations and algorithms  . . . 61--71
           Chung Keung Poon and   
                     Binhai Zhu   Streaming with minimum space: an
                                  algorithm for covering by two congruent
                                  balls  . . . . . . . . . . . . . . . . . 72--82
               Yongding Zhu and   
                      Jinhui Xu   On the central path problem  . . . . . . 83--99
                    Boting Yang   Fast-mixed searching and related
                                  problems on graphs . . . . . . . . . . . 100--113
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 508, Number ??, October 14, 2013

                 Binhai Zhu and   
                        Jun Luo   Preface  . . . . . . . . . . . . . . . . 1--1
                Mingyu Xiao and   
              Hiroshi Nagamochi   Parameterized edge dominating set in
                                  graphs with degree bounded by $3$  . . . 2--15
               Jianxin Wang and   
               Weizhong Luo and   
                Qilong Feng and   
                      Jiong Guo   Parameterized complexity of Min-power
                                  multicast problems in wireless ad hoc
                                  networks . . . . . . . . . . . . . . . . 16--25
              Huaming Zhang and   
              Swetha Govindaiah   Greedy routing via embedding graphs onto
                                  semi-metric spaces . . . . . . . . . . . 26--34
                    Yan Lan and   
    György Dósa and   
                    Xin Han and   
              Chenyang Zhou and   
                   Attila Benko   $2$D knapsack: Packing squares . . . . . 35--40
              Danny Z. Chen and   
                   Ewa Misiolek   Algorithms for interval structures with
                                  applications . . . . . . . . . . . . . . 41--53
               Martin Birks and   
             Stanley P. Y. Fung   Temperature aware online algorithms for
                                  scheduling equal length jobs . . . . . . 54--65
                 Xuehou Tan and   
                    Gangshan Wu   Approximation algorithms for cutting a
                                  convex polyhedron out of a sphere  . . . 66--73
          Joydeep Mukherjee and   
Priya Ranjan Sinha Mahapatra and   
           Arindam Karmakar and   
                     Sandip Das   Minimum-width rectangular annulus  . . . 74--80
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 509, Number ??, October 21, 2013

            Adrian Kosowski and   
             Masafumi Yamashita   Preface  . . . . . . . . . . . . . . . . 1--2
            Maurice Herlihy and   
            Sergio Rajsbaum and   
                  Michel Raynal   Power and limits of distributed
                                  computing shared memory models . . . . . 3--24
               Thomas Nowak and   
       Matthias Függer and   
    Alexander Kößler   On the performance of a
                                  retransmission-based synchronizer  . . . 25--39
         Johannes Schneider and   
              Michael Elkin and   
              Roger Wattenhofer   Symmetry breaking depending on the
                                  chromatic number or the neighborhood
                                  growth . . . . . . . . . . . . . . . . . 40--50
               Colin Cooper and   
                Alan Frieze and   
                  Tomasz Radzik   The cover times of random walks on
                                  random uniform hypergraphs . . . . . . . 51--69
Jérémie Chalopin and   
               Shantanu Das and   
            Arnaud Labourel and   
               Euripides Markou   Tight bounds for black hole search with
                                  scattered agents in synchronous rings    70--85
           Samuel Guilbault and   
                   Andrzej Pelc   Gathering asynchronous oblivious agents
                                  with local vision in regular bipartite
                                  graphs . . . . . . . . . . . . . . . . . 86--96
            Philipp Brandes and   
            Bastian Degener and   
            Barbara Kempkes and   
  Friedhelm Meyer auf der Heide   Energy-efficient strategies for building
                                  short chains of mobile robots locally    97--112
       Brona Brejová and   
              Stefan Dobrev and   
  Rastislav Královic and   
             Tomás Vinar   Efficient routing in carrier-based
                                  mobile networks  . . . . . . . . . . . . 113--121
        Jean-Claude Bermond and   
              Luisa Gargano and   
   Stephane Perénnes and   
          Adele A. Rescigno and   
                    Ugo Vaccaro   Optimal time data gathering in wireless
                                  networks with multidirectional antennas  122--139
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 510, Number ??, October 28, 2013

                    Paul Bonsma   The complexity of rerouting shortest
                                  paths  . . . . . . . . . . . . . . . . . 1--12
    György Dósa and   
                Rongheng Li and   
                    Xin Han and   
                     Zsolt Tuza   Tight absolute bound for First Fit
                                  Decreasing bin-packing: $ {\rm FFD}(L)
                                  \leq (11 / 9) {\rm OPT}(L) + 6 / 9 $ . . 13--61
          Roberto De Prisco and   
              Alfredo De Santis   Color visual cryptography schemes for
                                  black and white secret images  . . . . . 62--86
               Hae-Sung Eom and   
                     Yo-Sub Han   State complexity of combined operations
                                  for suffix-free regular languages  . . . 87--93
              Dongqin Cheng and   
               Rong-Xia Hao and   
                  Yan-Quan Feng   Conditional edge-fault pancyclicity of
                                  augmented cubes  . . . . . . . . . . . . 94--101
    György Dósa and   
            Csanád Imreh   The generalization of scheduling with
                                  machine cost . . . . . . . . . . . . . . 102--110
                Endre Boros and   
               Ondrej Cepek and   
                    Petr Kucera   A decomposition method for CNF
                                  minimality proofs  . . . . . . . . . . . 111--126
           Mitre C. Dourado and   
          Dieter Rautenbach and   
Vinícius Fernandes dos Santos and   
    Philipp M. Schäfer and   
           Jayme L. Szwarcfiter   On the Carathéodory number of interval
                                  and graph convexities  . . . . . . . . . 127--135
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 511, Number ??, November 4, 2013

           Vangelis Th. Paschos   Preface  . . . . . . . . . . . . . . . . 1--1
               Weizhong Luo and   
               Jianxin Wang and   
                Qilong Feng and   
                  Jiong Guo and   
                    Jianer Chen   Improved linear problem kernel for
                                  planar connected dominating set  . . . . 2--12
           Ch. Lenté and   
                M. Liedloff and   
                 A. Soukhal and   
                     V. T'Kindt   On an extension of the Sort & Search
                                  method with application to scheduling
                                  theory . . . . . . . . . . . . . . . . . 13--22
          Martin Fürer and   
              Serge Gaspers and   
   Shiva Prasad Kasiviswanathan   An exponential time $2$-approximation
                                  algorithm for bandwidth  . . . . . . . . 23--31
             Marin Bougeret and   
Pierre-François Dutot and   
                 Denis Trystram   Moderately exponential approximation for
                                  makespan minimization on related
                                  machines . . . . . . . . . . . . . . . . 32--41
                 Michael Lampis   Parameterized maximum path coloring  . . 42--53
       Rémy Belmonte and   
               Martin Vatshelle   Graph classes with structured
                                  neighborhoods and algorithmic
                                  applications . . . . . . . . . . . . . . 54--65
         Binh-Minh Bui-Xuan and   
             Jan Arne Telle and   
               Martin Vatshelle   Fast dynamic programming for locally
                                  checkable vertex subset and vertex
                                  partitioning problems  . . . . . . . . . 66--76
            Robert Crowston and   
              Gregory Gutin and   
                 Mark Jones and   
            Venkatesh Raman and   
                  Saket Saurabh   Parameterized complexity of MaxSat Above
                                  Average  . . . . . . . . . . . . . . . . 77--84
         Ljiljana Brankovic and   
                 Henning Fernau   A novel parameterised approximation
                                  algorithm for minimum vertex cover . . . 85--108
               Eun Jung Kim and   
        Daniel Gonçalves   On exact algorithms for the permutation
                                  CSP  . . . . . . . . . . . . . . . . . . 109--116
         Hans L. Bodlaender and   
          Bart M. P. Jansen and   
                 Stefan Kratsch   Kernel bounds for path and cycle
                                  problems . . . . . . . . . . . . . . . . 117--136
                Peter Damaschke   Sparse solutions of sparse linear
                                  systems: Fixed-parameter tractability
                                  and an application of complex group
                                  testing  . . . . . . . . . . . . . . . . 137--146
                Mingyu Xiao and   
                  Ton Kloks and   
               Sheung-Hung Poon   New parameterized algorithms for the
                                  edge dominating set problem  . . . . . . 147--158
             Riccardo Dondi and   
            Giancarlo Mauri and   
                   Italo Zoppis   The $l$-Diversity problem: Tractability
                                  and approximability  . . . . . . . . . . 159--171
            Pinar Heggernes and   
             Pim van 't Hof and   
          Bart M. P. Jansen and   
             Stefan Kratsch and   
                Yngve Villanger   Parameterized complexity of vertex
                                  deletion into perfect graph classes  . . 172--180
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 512, Number ??, November 11, 2013

       Xavier Défago and   
               Franck Petit and   
                Vincent Villain   Preface  . . . . . . . . . . . . . . . . 1--1
               Andrew Berns and   
              Sukumar Ghosh and   
            Sriram V. Pemmaraju   Building self-stabilizing overlay
                                  networks with the transitive closure
                                  framework  . . . . . . . . . . . . . . . 2--14
               J. Beauquier and   
               P. Blanchard and   
                  J. Burman and   
                 S. Delaët   Tight complexity analysis of population
                                  protocols with cover times --- The
                                  ZebraNet example . . . . . . . . . . . . 15--27
            Roberto Baldoni and   
              Silvia Bonomi and   
            Amir Soltani Nezhad   A protocol for implementing Byzantine
                                  storage in churn-prone distributed
                                  systems  . . . . . . . . . . . . . . . . 28--40
               Hagit Attiya and   
       Armando Castañeda   A non-topological proof for the
                                  impossibility of $k$-set agreement . . . 41--48
              Ajoy K. Datta and   
   Stéphane Devismes and   
        Lawrence L. Larmore and   
                  Yvan Rivierre   Self-stabilizing labeling and ranking in
                                  ordered trees  . . . . . . . . . . . . . 49--66
                Davide Frey and   
        Arnaud Jégou and   
       Anne-Marie Kermarrec and   
              Michel Raynal and   
                 Julien Stainer   Trust-aware peer sampling: Performance
                                  and privacy tradeoffs  . . . . . . . . . 67--83
       Andreas Klappenecker and   
              Hyunyoung Lee and   
              Jennifer L. Welch   Dynamic regular registers in systems
                                  with churn . . . . . . . . . . . . . . . 84--97
    Ioannis Chatzigiannakis and   
              Othon Michail and   
           Stavros Nikolaou and   
               Paul G. Spirakis   The computational power of simple
                                  protocols for self-awareness on graphs   98--118
             Rizal Mohd Nor and   
         Mikhail Nesterenko and   
           Christian Scheideler   Corona: a stabilizing deterministic
                                  message-passing skip list  . . . . . . . 119--129
                Damien Imbs and   
                  Michel Raynal   The weakest failure detector to
                                  implement a register in asynchronous
                                  systems with hybrid communication  . . . 130--142
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 513, Number ??, November 18, 2013

               Shinhaeng Jo and   
             Jung-Heum Park and   
                Kyung-Yong Chwa   Paired many-to-many disjoint path covers
                                  in faulty hypercubes . . . . . . . . . . 1--24
         Santanu Kumar Dash and   
           Sven-Bodo Scholz and   
             Stephan Herhut and   
             Bruce Christianson   A scalable approach to computing
                                  representative lowest common ancestor in
                                  directed acyclic graphs  . . . . . . . . 25--37
               Arash Farzan and   
                   J. Ian Munro   Succinct encoding of arbitrary graphs    38--52
                R. Crowston and   
                   G. Gutin and   
                   M. Jones and   
                   G. Muciaccia   Maximum balanced subgraph problem
                                  parameterized above lower bound  . . . . 53--64
                Peter Eades and   
              Seok-Hee Hong and   
                Naoki Katoh and   
            Giuseppe Liotta and   
          Pascal Schweitzer and   
                  Yusuke Suzuki   A linear time algorithm for testing
                                  maximal $1$-planarity of graphs with a
                                  rotation system  . . . . . . . . . . . . 65--76
         Przemyslaw Krysztowiak   An improved approximation ratio for the
                                  jump number problem on interval orders   77--84
                   Jian Liu and   
                   Lusheng Chen   On the relationships between perfect
                                  nonlinear functions and universal hash
                                  families . . . . . . . . . . . . . . . . 85--95
                   Angelo Monti   Deciding the winner in $k$ rounds for
                                  DISJOINT ARROWS, a new combinatorial
                                  partizan game  . . . . . . . . . . . . . 96--108
Jérémy Barbay and   
                Gonzalo Navarro   On compressing permutations and adaptive
                                  sorting  . . . . . . . . . . . . . . . . 109--123
              Gregory Gutin and   
         Gabriele Muciaccia and   
                     Anders Yeo   Parameterized complexity of $k$-Chinese
                                  Postman Problem  . . . . . . . . . . . . 124--128
                Simone Linz and   
         Katherine St. John and   
                 Charles Semple   Optimizing tree and character
                                  compatibility across several
                                  phylogenetic trees . . . . . . . . . . . 129--136
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 514, Number ??, November 25, 2013

           Camil Demetrescu and   
           Stefano Leonardi and   
   Alberto Marchetti-Spaccamela   Preface  . . . . . . . . . . . . . . . . 1--1
          Patrizio Angelini and   
     Pier Francesco Cortese and   
       Giuseppe Di Battista and   
            Maurizio Patrignani   Topological morphing of planar graphs    2--20
            Vittorio Bil\`o and   
            Alessandro Celi and   
           Michele Flammini and   
                 Vasco Gallotti   Social context congestion games  . . . . 21--35
         Gianfranco Bilardi and   
              Francesco Versaci   Optimal eviction policies for stochastic
                                  address traces . . . . . . . . . . . . . 36--60
              Nicolas Boria and   
 Jérôme Monnot and   
           Vangelis Th. Paschos   Reoptimization of maximum weight induced
                                  hereditary subgraph problems . . . . . . 61--74
              Marek Chrobak and   
                 Lukasz Jez and   
              Jirí Sgall   Better bounds for incremental frequency
                                  allocation in bipartite graphs . . . . . 75--83
             Pilu Crescenzi and   
             Roberto Grossi and   
               Michel Habib and   
             Leonardo Lanzi and   
                  Andrea Marino   On computing the diameter of real-world
                                  undirected graphs  . . . . . . . . . . . 84--95
             David Eppstein and   
        Michael T. Goodrich and   
       Maarten Löffler and   
              Darren Strash and   
                   Lowell Trott   Category-based routing in social
                                  networks: Membership dimension and the
                                  small-world phenomenon . . . . . . . . . 96--104
                     Zeev Nutov   Survivable network activation problems   105--115
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 515, Number ??, January 2, 2014

               Ilya Tkachev and   
               Alessandro Abate   Characterization and computation of
                                  infinite-horizon specifications over
                                  Markov processes . . . . . . . . . . . . 1--18
               Mike Burrell and   
              Robin Cockett and   
                  Brian Redmond   Safe recursion revisited I: Categorical
                                  semantics for lower complexity . . . . . 19--45
               Marco Faella and   
         Salvatore La Torre and   
                 Aniello Murano   Automata-theoretic decision of timed
                                  games  . . . . . . . . . . . . . . . . . 46--63
                   Shuai Ma and   
                 Wenfei Fan and   
                   Loreto Bravo   Extending inclusion dependencies with
                                  conditions . . . . . . . . . . . . . . . 64--95
              Kim G. Larsen and   
                 Axel Legay and   
      Louis-Marie Traonouez and   
               Andrzej Wasowski   Robust synthesis for real-time systems   96--122
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 516, Number ??, January 9, 2014

       Gianlorenzo D'Angelo and   
            Mattia D'Emidio and   
               Daniele Frigioni   A loop-free shortest-path routing
                                  algorithm for dynamic networks . . . . . 1--19
         Eric Duchêne and   
                Gabriel Renault   Vertex Nim played on graphs  . . . . . . 20--27
               Dyi-Rong Duh and   
              Tzu-Lung Chen and   
                    Yue-Li Wang   $ n - 3 $-edge-fault-tolerant
                                  weak-pancyclicity of $ (n, k) $-star
                                  graphs . . . . . . . . . . . . . . . . . 28--39
          Alberto Dennunzio and   
            Enrico Formenti and   
                  Michael Weiss   Multidimensional cellular automata:
                                  closing property, quasi-expansivity, and
                                  (un)decidability issues  . . . . . . . . 40--59
                Mikael Gast and   
              Mathias Hauptmann   Approximability of the vertex cover
                                  problem in power-law graphs  . . . . . . 60--70
                   F. Abbes and   
                   M. Hbaib and   
                      M. Merkhi   $ \beta $-expansion and transcendence in
                                  $ F_q((x^{-1})) $  . . . . . . . . . . . 71--77
                    T. Karthick   On atomic structure of $ P_5 $-free
                                  subclasses and Maximum Weight
                                  Independent Set problem  . . . . . . . . 78--85
             Lukasz Kowalik and   
                   Marcin Mucha   A $ 9 k $ kernel for nonseparating
                                  independent set in planar graphs . . . . 86--95
 Frédéric Maffray   Fast recognition of doubled graphs . . . 96--100
              Alexander Okhotin   Parsing by matrix multiplication
                                  generalized to Boolean grammars  . . . . 101--120
                 Asaf Levin and   
              Aleksander Vainer   Adaptivity in the stochastic blackjack
                                  knapsack problem . . . . . . . . . . . . 121--126
           Alexander Meduna and   
                     Petr Zemek   One-sided random context grammars with a
                                  limited number of right random context
                                  rules  . . . . . . . . . . . . . . . . . 127--132
                Wei-Ping Ni and   
                  Jian-Liang Wu   Edge coloring of planar graphs which any
                                  two short cycles are adjacent at most
                                  once . . . . . . . . . . . . . . . . . . 133--138
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 517, Number ??, January 16, 2014

           Max Tschaikowski and   
               Mirco Tribastone   Tackling continuous state-space
                                  explosion in a Markovian process algebra 1--33
          Reuben N. S. Rowe and   
                S. J. van Bakel   Semantic Types and Approximation for
                                  Featherweight Java . . . . . . . . . . . 34--74
                Kohei Honda and   
             Nobuko Yoshida and   
                  Martin Berger   An observationally complete program
                                  logic for imperative higher-order
                                  functions  . . . . . . . . . . . . . . . 75--101
                     Ionut Tutu   Parameterisation for abstract structured
                                  specifications . . . . . . . . . . . . . 102--142
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 518, Number ??, January 23, 2014

               Huijuan Wang and   
                    Bin Liu and   
               Jianliang Wu and   
                    Guizhen Liu   Total coloring of embedded graphs with
                                  maximum degree at least seven  . . . . . 1--9
                 Yong Zhang and   
         Francis Y. L. Chin and   
                 Hing-Fung Ting   Constant-competitive tree node
                                  assignment . . . . . . . . . . . . . . . 10--21
                Weifan Wang and   
             Stephen Finbow and   
                   Jiangxu Kong   The $2$-surviving rate of planar graphs
                                  without $6$-cycles . . . . . . . . . . . 22--31
               Weizhong Luo and   
               Jianxin Wang and   
                  Jiong Guo and   
                    Jianer Chen   Parameterized complexity of Max-lifetime
                                  Target Coverage in wireless sensor
                                  networks . . . . . . . . . . . . . . . . 32--41
     Edita Pelantová and   
         Stepán Starosta   Palindromic richness for languages
                                  invariant under more symmetries  . . . . 42--63
                 Carmine Ventre   Truthful optimization using mechanisms
                                  with verification  . . . . . . . . . . . 64--79
          Daniel Reidenbach and   
               Markus L. Schmid   Regular and context-free pattern
                                  languages over small alphabets . . . . . 80--95
               Martin Olsen and   
              Anastasios Viglas   On the approximability of the link
                                  building problem . . . . . . . . . . . . 96--116
                   Long Wan and   
                     Ran Ma and   
                  Jinjiang Yuan   Primary-secondary bicriteria scheduling
                                  on identical machines to minimize the
                                  total completion time of all jobs and
                                  the maximum $T$-time of all machines . . 117--123
              Jian-Liang Wu and   
                       Ling Xue   Edge colorings of planar graphs without
                                  $5$-cycles with two chords . . . . . . . 124--127
         Salvatore Ruggieri and   
           Pavlos Eirinakis and   
               K. Subramani and   
            Piotr Wojciechowski   On the complexity of quantified linear
                                  systems  . . . . . . . . . . . . . . . . 128--134
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 519, Number ??, January 30, 2014

              Jyrki Kivinen and   
    Csaba Szepesvári and   
                Thomas Zeugmann   Guest Editors' introduction  . . . . . . 1--3
Sébastien Gerchinovitz and   
                    Jia Yuan Yu   Adaptive and optimal online linear
                                  regression on $ \ell^1 $-balls . . . . . 4--28
         Manfred K. Warmuth and   
           Wouter M. Koolen and   
              David P. Helmbold   Combining initial segments of lists  . . 29--45
            Antoine Salomon and   
             Jean-Yves Audibert   Robustness of stochastic bandit policies 46--67
       Malte Darnstädt and   
          Hans Ulrich Simon and   
Balázs Szörényi   Supervised learning and co-training  . . 68--87
               Xinhua Zhang and   
                 Ankan Saha and   
          S. V. N. Vishwanathan   Accelerated training of max-margin
                                  Markov networks with kernels . . . . . . 88--102
             Corinna Cortes and   
                  Mehryar Mohri   Domain adaptation and sample bias
                                  correction theory and algorithm for
                                  regression . . . . . . . . . . . . . . . 103--126
                 Laurent Orseau   Universal knowledge-seeking agents . . . 127--139
              Tor Lattimore and   
                  Marcus Hutter   General time consistent discounting  . . 140--154
              Timo Kötzing   Iterative learning from positive data
                                  and counters . . . . . . . . . . . . . . 155--169
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 520, Number ??, February 6, 2014

                     Hui Xu and   
                  Jing Tian and   
                 Xianzhong Zhao   Monoid-matrix type automata  . . . . . . 1--10
                  Shailesh Vaya   Information dissemination in unknown
                                  radio networks with large labels . . . . 11--26
           Petra Berenbrink and   
       Robert Elsässer and   
               Thomas Sauerwald   Randomised broadcasting: Memory vs.
                                  randomness . . . . . . . . . . . . . . . 27--42
                  Tadao Takaoka   Sharing information for the all pairs
                                  shortest path problem  . . . . . . . . . 43--50
                Guomin Yang and   
               Chik How Tan and   
                      Yi Mu and   
               Willy Susilo and   
                 Duncan S. Wong   Identity based identification from
                                  algebraic coding theory  . . . . . . . . 51--61
                 Urs Wagner and   
             Gérard Maze   Improvements in closest point search
                                  based on dual HKZ-bases  . . . . . . . . 62--74
               Zhen-Mu Hong and   
                    Jun-Ming Xu   Vulnerability of super edge-connected
                                  networks . . . . . . . . . . . . . . . . 75--86
  Jòrgen Bang-Jensen and   
                     Anders Yeo   The complexity of multicut and mixed
                                  multicut problems in (di)graphs  . . . . 87--96
               Shiying Wang and   
                       Kai Feng   Strong matching preclusion for torus
                                  networks . . . . . . . . . . . . . . . . 97--110
        Ferruh Özbudak and   
                     Oguz Yayla   Improved probabilistic decoding of
                                  interleaved Reed--Solomon codes and
                                  folded Hermitian codes . . . . . . . . . 111--123
                   Renyu Xu and   
                  Jian-Liang Wu   Total coloring of planar graphs with
                                  $7$-cycles containing at most two chords 124--129
                Zeljko Vrba and   
        Pål Halvorsen and   
                Carsten Griwodz   A correction to Andersson's fusion tree
                                  construction . . . . . . . . . . . . . . 130--132
             Olivier Baudon and   
            Julien Bensmail and   
             Jakub Przybylo and   
              Mariusz Wo\'zniak   Partitioning powers of traceable or
                                  Hamiltonian graphs . . . . . . . . . . . 133--137
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 521, Number ??, February 13, 2014

  Márcia R. Cappelle and   
                Lucia Penso and   
              Dieter Rautenbach   Recognizing some complementary products  1--7
Sándor Vágvölgyi   Tree shuffle . . . . . . . . . . . . . . 8--28
              M. Crochemore and   
           C. S. Iliopoulos and   
                  M. Kubica and   
             J. Radoszewski and   
                  W. Rytter and   
                     T. Wale\'n   Extracting powers and periods in a word
                                  from its runs structure  . . . . . . . . 29--41
             Hung-Lung Wang and   
                   Kuan-Yu Chen   One-dimensional approximate point set
                                  pattern matching with $ L_p $-norm . . . 42--50
            Erik D. Demaine and   
          Martin L. Demaine and   
      Nicholas J. A. Harvey and   
              Ryuhei Uehara and   
                Takeaki Uno and   
                      Yushi Uno   UNO is hard, even for a single player    51--61
                  Taibo Luo and   
                 Yinfeng Xu and   
                     Li Luo and   
                  Changzheng He   Semi-online scheduling with two GoS
                                  levels and unit processing time  . . . . 62--72
           Andrey Grinshpun and   
      Pakawat Phalitnonkiat and   
                Sasha Rubin and   
                Andrei Tarfulea   Alternating traps in Muller and parity
                                  games  . . . . . . . . . . . . . . . . . 73--91
            R. Sámal and   
                       T. Valla   The guarding game is E-complete  . . . . 92--106
           Dimitris Fotakis and   
          Alexis C. Kaporis and   
           Thanasis Lianeas and   
               Paul G. Spirakis   On the hardness of network design for
                                  bottleneck routing games . . . . . . . . 107--122
                   Ling Lin and   
                      Zhiyi Tan   Inefficiency of Nash Equilibrium for
                                  scheduling games with constrained jobs:
                                  a parametric analysis  . . . . . . . . . 123--134
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 522, Number ??, February 20, 2014

       Christophe Crespelle and   
              Philippe Gambette   (Nearly-)tight bounds on the contiguity
                                  and linearity of cographs  . . . . . . . 1--12
      Shaunak D. Bopardikar and   
                   Subhash Suri   $k$-Capture in multiagent pursuit
                                  evasion, or the lion and the hyenas  . . 13--23
               Yi-Hao Zhang and   
              Yue-Hong Shen and   
                   Min Dong and   
                   Yi-Min Jiang   A method of batching conflict routings
                                  in shuffle-exchange networks . . . . . . 24--33
        Konrad K. Dabrowski and   
           Petr A. Golovach and   
                Daniel Paulusma   Colouring of graphs with Ramsey-type
                                  forbidden subgraphs  . . . . . . . . . . 34--43
                 Kai Plociennik   A probabilistic PTAS for shortest common
                                  superstring  . . . . . . . . . . . . . . 44--53
               Huijuan Wang and   
                  Lidong Wu and   
                   Jianliang Wu   Total coloring of planar graphs with
                                  maximum degree 8 . . . . . . . . . . . . 54--61
              Lavinia Egidi and   
               Giovanni Manzini   Design and analysis of periodic multiple
                                  seeds  . . . . . . . . . . . . . . . . . 62--76
                J.-P. Duval and   
                  T. Lecroq and   
                    A. Lefebvre   Linear computation of unbordered
                                  conjugate on unordered alphabet  . . . . 77--84
                Qilong Feng and   
               Jianxin Wang and   
                    Jianer Chen   Matching and Weighted $ P_2 $-Packing:
                                  Algorithms and Kernels . . . . . . . . . 85--94
            Gianluigi Greco and   
            Francesco Scarcello   Tree projections and structural
                                  decomposition methods: Minimality and
                                  game-theoretic characterization  . . . . 95--114
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 523, Number ??, February 27, 2014

             Laura Bozzelli and   
               Sophie Pinchinat   Verification of gap-order constraint
                                  abstractions of counter systems  . . . . 1--36
              Robin Cockett and   
                 Richard Garner   Restriction categories as enriched
                                  categories . . . . . . . . . . . . . . . 37--55
  Jirí Adámek and   
              Stefan Milius and   
            Jirí Velebil   Base modules for parametrized
                                  iterativity  . . . . . . . . . . . . . . 56--85
          Valeriy Balabanov and   
    Hui-Ju Katherine Chiang and   
              Jie-Hong R. Jiang   Henkin quantifiers and Boolean formulae:
                                  a certification perspective of DQBF  . . 86--100
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 524, Number ??, March 6, 2014

        Kathrin Ballerstein and   
              Dirk Oliver Theis   An algorithm for random signed 3-SAT
                                  with intervals . . . . . . . . . . . . . 1--26
                Van Bang Le and   
                Florian Pfender   Complexity results for rainbow matchings 27--33
              T. Calamoneri and   
                   R. Petreschi   On pairwise compatibility graphs having
                                  Dilworth number two  . . . . . . . . . . 34--40
          F. Blanchet-Sadri and   
                   Bob Chen and   
              Sinziana Munteanu   Recurrence in infinite partial words . . 41--47
             Kassian Kobert and   
           Jörg Hauser and   
          Alexandros Stamatakis   Is the Protein Model Assignment problem
                                  under linked branch lengths NP-hard? . . 48--58
     Yoann Dieudonné and   
                   Andrzej Pelc   Price of asynchrony in mobile agents
                                  computing  . . . . . . . . . . . . . . . 59--67
                     Cui Yu and   
               Xiaofan Yang and   
                      Li He and   
                     Jing Zhang   Optimal wavelength assignment in the
                                  implementation of parallel algorithms
                                  with ternary $n$-cube communication
                                  pattern on mesh optical network  . . . . 68--77
                     Qi Wei and   
                Erfang Shan and   
                    Liying Kang   A FPTAS for a two-stage hybrid flow shop
                                  problem and optimal algorithms for
                                  identical jobs . . . . . . . . . . . . . 78--89
              Meena Mahajan and   
      B. V. Raghavendra Rao and   
          Karteek Sreenivasaiah   Monomials, multilinearity and identity
                                  testing in simple read-restricted
                                  circuits . . . . . . . . . . . . . . . . 90--102
            Katarzyna Rybarczyk   Constructions of independent sets in
                                  random intersection graphs . . . . . . . 103--125
           Pavlos Eirinakis and   
            Dimitrios Magos and   
                Ioannis Mourtos   Blockers and antiblockers of stable
                                  matchings  . . . . . . . . . . . . . . . 126--133
                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii


Theoretical Computer Science
Volume 525, Number ??, March 13, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii
    Manolis Christodoulakis and   
          Michalis Christou and   
          Maxime Crochemore and   
           Costas S. Iliopoulos   On the average number of regularities in
                                  a word . . . . . . . . . . . . . . . . . 3--9
           James A. Edwards and   
                    Uzi Vishkin   Parallel algorithms for Burrows--Wheeler
                                  compression and decompression  . . . . . 10--22
         Alberto Apostolico and   
    Péter L. Erd\Hos and   
István Miklós and   
               Johannes Siemons   Modulated string searching . . . . . . . 23--29
                  Jiong Guo and   
             Danny Hermelin and   
          Christian Komusiewicz   Local search for string problems:
                                  Brute-force is essentially optimal . . . 30--41
               Orgad Keller and   
            Tsvi Kopelowitz and   
        Shir Landau Feibish and   
               Moshe Lewenstein   Generalized substring compression  . . . 42--54
          Maxime Crochemore and   
             Alessio Langiu and   
                Filippo Mignosi   Note on the greedy parsing optimality
                                  for dictionary-based text compression    55--59
               Amihood Amir and   
         Alberto Apostolico and   
         Estrella Eisenberg and   
              Gad M. Landau and   
                Avivit Levy and   
                 Noa Lewenstein   Detecting approximate periodic patterns  60--67
                  Jinil Kim and   
                Peter Eades and   
           Rudolf Fleischer and   
              Seok-Hee Hong and   
       Costas S. Iliopoulos and   
                Kunsoo Park and   
           Simon J. Puglisi and   
               Takeshi Tokuyama   Order-preserving matching  . . . . . . . 68--79
                Carl Barton and   
       Costas S. Iliopoulos and   
                  Inbok Lee and   
           Laurent Mouchard and   
                Kunsoo Park and   
                Solon P. Pissis   Extending alignments with $k$-mismatches
                                  and $l$-gaps . . . . . . . . . . . . . . 80--88
               Laxmi Parida and   
               Cinzia Pizzi and   
                Simona E. Rombo   Irredundant tandem motifs  . . . . . . . 89--102
                 Dina Sokol and   
                 Justin Tojeira   Speeding up the detection of tandem
                                  repeats over the edit distance . . . . . 103--110
              Oren Ben-Kiki and   
               Philip Bille and   
             Dany Breslauer and   
         Leszek G\kasieniec and   
             Roberto Grossi and   
                   Oren Weimann   Towards optimal packed string matching   111--129
        Ferdinando Cicalese and   
              Eduardo Laber and   
               Oren Weimann and   
                 Raphael Yuster   Approximating the maximum consecutive
                                  subsums of a sequence  . . . . . . . . . 130--137
              Ury Matarazzo and   
                 Dekel Tsur and   
             Michal Ziv-Ukelson   Efficient all path score computations on
                                  grid graphs  . . . . . . . . . . . . . . 138--149


Theoretical Computer Science
Volume 526, Number ??, March 20, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii
             Fedor V. Fomin and   
Frédéric Giroire and   
           Alain Jean-Marie and   
            Dorian Mazauric and   
                  Nicolas Nisse   To satisfy impatient Web surfers is hard 1--17
         Alexander Golovnev and   
             Konstantin Kutzkov   New exact algorithms for the
                                  $2$-constraint satisfaction problem  . . 18--27
  Jòrgen Bang-Jensen and   
          Stéphane Bessy   (Arc-)disjoint flows in networks . . . . 28--40
    Stavros D. Nikolopoulos and   
            Leonidas Palios and   
            Charis Papadopoulos   Counting spanning trees using modular
                                  decomposition  . . . . . . . . . . . . . 41--57
Gerth Stòlting Brodal and   
          Alexis C. Kaporis and   
  Apostolos N. Papadopoulos and   
             Spyros Sioutas and   
    Konstantinos Tsakalidis and   
                Kostas Tsichlas   Dynamic $3$-sided planar range queries
                                  with expected doubly-logarithmic time    58--74
              Carla Binucci and   
              Walter Didimo and   
            Maurizio Patrignani   Upward and quasi-upward planarity
                                  testing of embedded mixed graphs . . . . 75--89
               Mrinal Kumar and   
             Sounaka Mishra and   
             N. Safina Devi and   
                  Saket Saurabh   Approximation algorithms for node
                                  deletion problems on bipartite graphs
                                  with finite forbidden subgraph
                                  characterization . . . . . . . . . . . . 90--96
              Daniel Genkin and   
           Michael Kaminski and   
               Liat Peterfreund   A note on the emptiness problem for
                                  alternating finite-memory automata . . . 97--107
               Takahiro Ota and   
             Hirotada Fukae and   
               Hiroyoshi Morita   Dynamic construction of an
                                  antidictionary with linear complexity    108--119
                 Jian Chang and   
              Jian-Liang Wu and   
                     Yong-Ga A.   Total colorings of planar graphs with
                                  sparse triangles . . . . . . . . . . . . 120--129


Theoretical Computer Science
Volume 527, Number ??, March 27, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii
              Michael Fuchs and   
           Hsien-Kuei Hwang and   
               Vytas Zacharovas   An analytic approach to the asymptotic
                                  variance of trie statistics and related
                                  structures . . . . . . . . . . . . . . . 1--36
              Alda Carvalho and   
  Carlos Pereira dos Santos and   
          Cátia Dias and   
           Francisco Coelho and   
     João Pedro Neto and   
         Richard Nowakowski and   
                 Sandra Vinagre   On lattices from combinatorial game
                                  theory modularity and a representation
                                  theorem: Finite case . . . . . . . . . . 37--49
               Taha Ghasemi and   
           Mohammadreza Razzazi   A PTAS for the cardinality constrained
                                  covering with unit balls . . . . . . . . 50--60
Hans-Joachim Böckenhauer and   
                Dennis Komm and   
    Richard Královic and   
               Peter Rossmanith   The online knapsack problem: Advice and
                                  randomization  . . . . . . . . . . . . . 61--72
                 Javier Herranz   Attribute-based signatures from RSA  . . 73--82
                  Yang Wang and   
                  Man Ho Au and   
                   Willy Susilo   Attribute-based optimistic fair
                                  exchange: How to restrict brokers with
                                  policies . . . . . . . . . . . . . . . . 83--96
                Fenggen Lin and   
              Lianzhu Zhang and   
                     Fuliang Lu   Pfaffian orientations for a type of
                                  bipartite graph  . . . . . . . . . . . . 97--101
                 Jiqiang Lu and   
             Yongzhuang Wei and   
               Jongsung Kim and   
                   Enes Pasalic   The higher-order meet-in-the-middle
                                  attack and its application to the
                                  Camellia block cipher  . . . . . . . . . 102--122


Theoretical Computer Science
Volume 528, Number ??, April 3, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--viii
                Van Bang Le and   
                 Ragnar Nevries   Complexity and algorithms for
                                  recognizing polar and monopolar graphs   1--11
                 Olivier Ly and   
                      Zhilin Wu   On effective construction of the
                                  greatest solution of language inequality
                                  $ X A \subseteq B X $  . . . . . . . . . 12--31
                 Mihai Prunescu   A two-valued recurrent double sequence
                                  that is not automatic  . . . . . . . . . 32--39
José L. Ramírez and   
         Gustavo N. Rubiano and   
              Rodrigo De Castro   A generalization of the Fibonacci word
                                  fractal and the Fibonacci snowflake  . . 40--56
                      Hiromi Ei   Stepped surfaces and Rauzy fractals
                                  induced from automorphisms on the free
                                  group of rank $2$  . . . . . . . . . . . 57--78
                    Qin Xin and   
              Fredrik Manne and   
                    Xiaolan Yao   Latency-optimal communication in
                                  wireless mesh networks . . . . . . . . . 79--84
               Sabine Broda and   
  António Machiavelo and   
              Nelma Moreira and   
            Rogério Reis   A Hitchhiker's Guide to descriptional
                                  complexity through analytic
                                  combinatorics  . . . . . . . . . . . . . 85--100
            Narad Rampersad and   
                Michel Rigo and   
                  Pavel Salimov   A note on abelian returns in rotation
                                  words  . . . . . . . . . . . . . . . . . 101--107


Theoretical Computer Science
Volume 529, Number ??, April 10, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                   G. Rozenberg   Preface  . . . . . . . . . . . . . . . . 1--1
             Martin Anthony and   
                   Joel Ratsaby   Learning bounds via sample width for
                                  classifiers on finite metric spaces  . . 2--10
            Roberto Barbuti and   
  Andrea Maggiolo-Schettini and   
              Paolo Milazzo and   
               Giovanni Pardini   Simulation of Spatial P system models    11--45
            Simona Caraiman and   
                Vasile I. Manta   Histogram-based segmentation of quantum
                                  images . . . . . . . . . . . . . . . . . 46--60
                   Tao Song and   
Luis F. Macías-Ramos and   
               Linqiang Pan and   
Mario J. Pérez-Jiménez   Time-free solution to SAT problem using
                                  P systems with active membranes  . . . . 61--68
             Artiom Alhazov and   
           Alberto Leporati and   
            Giancarlo Mauri and   
         Antonio E. Porreca and   
                Claudio Zandron   Space complexity equivalence of P
                                  systems with active membranes and Turing
                                  machines . . . . . . . . . . . . . . . . 69--81
                   Tao Song and   
               Linqiang Pan and   
                  Gheorghe Paun   Spiking neural P systems with rules on
                                  synapses . . . . . . . . . . . . . . . . 82--95
                 Tariq Shah and   
                 Nasreen Kausar   Characterizations of non-associative
                                  ordered semigroups by their fuzzy
                                  bi-ideals  . . . . . . . . . . . . . . . 96--110


Theoretical Computer Science
Volume 530, Number ??, April 17, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                Wenbin Chen and   
            Zhengzhang Chen and   
         Nagiza F. Samatova and   
                Lingxi Peng and   
             Jianxiong Wang and   
                    Maobin Tang   Solving the maximum duo-preservation
                                  string mapping problem with linear
                                  programming  . . . . . . . . . . . . . . 1--11
             Yishay Mansour and   
           Boaz Patt-Shamir and   
                    Dror Rawitz   Competitive router scheduling with
                                  structured data  . . . . . . . . . . . . 12--22
            Hiroyuki Hanada and   
              Mineichi Kudo and   
             Atsuyoshi Nakamura   Average-case linear-time similar
                                  substring searching by the $q$-gram
                                  distance . . . . . . . . . . . . . . . . 23--41
          F. Blanchet-Sadri and   
                  Yang Jiao and   
           John M. Machacek and   
              J. D. Quigley and   
                    Xufan Zhang   Squares in partial words . . . . . . . . 42--57
             Cheng-Kuan Lin and   
               Yuan-Hsiang Teng   The diagnosability of triangle-free
                                  graphs . . . . . . . . . . . . . . . . . 58--65
             Guillaume Blin and   
            Paola Bonizzoni and   
             Riccardo Dondi and   
                Romeo Rizzi and   
                 Florian Sikora   Complexity insights of the Minimum
                                  Duplication problem  . . . . . . . . . . 66--79
            Chung-Shou Liao and   
                  Yamming Huang   The Covering Canadian Traveller Problem  80--88
        Flavio Chierichetti and   
                 Ravi Kumar and   
               Mohammad Mahdian   The complexity of LSH feasibility  . . . 89--101


Theoretical Computer Science
Volume 531, Number ??, April 24, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                Suna Bensch and   
               Frank Drewes and   
      Helmut Jürgensen and   
            Brink van der Merwe   Graph transformation for incremental
                                  natural language analysis  . . . . . . . 1--25
              Sook-Yeon Kim and   
                 Jung-Heum Park   Many-to-many two-disjoint path covers in
                                  restricted hypercube-like graphs . . . . 26--36
                    Yong Wu and   
             T. C. E. Cheng and   
                         Min Ji   Optimal algorithms for semi-online
                                  machine covering on two hierarchical
                                  machines . . . . . . . . . . . . . . . . 37--46
                Xianyong Li and   
               Xiaofan Yang and   
                      Li He and   
                 Jing Zhang and   
                         Cui Yu   Conditional diagnosability of optical
                                  multi-mesh hypercube networks under the
                                  comparison diagnosis model . . . . . . . 47--53
           Enrico Angelelli and   
            Cristina Bazgan and   
         M. Grazia Speranza and   
                     Zsolt Tuza   Complexity and approximation for
                                  Traveling Salesman Problems with profits 54--65
            Masanobu Furuse and   
                Koichi Yamazaki   A revisit of the scheme for computing
                                  treewidth and minimum fill-in  . . . . . 66--76
       Jacqueline W. Daykin and   
                    W. F. Smyth   A bijective variant of the
                                  Burrows--Wheeler Transform using
                                  $V$-order  . . . . . . . . . . . . . . . 77--89


Theoretical Computer Science
Volume 532, Number ??, May 1, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                  Pinyan Lu and   
                  Jack Snoeyink   Frontiers in algorithmics  . . . . . . . 1--1
                 Joan Boyar and   
              Kim S. Larsen and   
              Abyayananda Maiti   A comparison of performance measures via
                                  online search  . . . . . . . . . . . . . 2--13
               Huy Hoang Do and   
             Jesper Jansson and   
          Kunihiko Sadakane and   
                  Wing-Kin Sung   Fast relative Lempel--Ziv self-index for
                                  similar sequences  . . . . . . . . . . . 14--30
               Chenglin Fan and   
                    Jun Luo and   
              Wencheng Wang and   
                     Binhai Zhu   Voronoi diagram with visual restriction  31--39
                 Bryan Dawei He   A simple optimal binary representation
                                  of mosaic floorplans and Baxter
                                  permutations . . . . . . . . . . . . . . 40--50
                  Ton Kloks and   
           Sheung-Hung Poon and   
              Feng-Ren Tsai and   
                    Yue-Li Wang   On the complexity of the black-and-white
                                  coloring problem on some classes of
                                  perfect graphs . . . . . . . . . . . . . 51--63
         Kazuhide Nishikawa and   
            Takao Nishizeki and   
                      Xiao Zhou   Bandwidth consecutive multicolorings of
                                  graphs . . . . . . . . . . . . . . . . . 64--72
                 Xuehou Tan and   
                       Bo Jiang   Minimization of the maximum distance
                                  between the two guards patrolling a
                                  polygonal region . . . . . . . . . . . . 73--79
              Jiun-Jie Wang and   
                         Xin He   Succinct strictly convex greedy drawing
                                  of $3$-connected plane graphs  . . . . . 80--90


Theoretical Computer Science
Volume 533, Number ??, May 8, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
            Enrico Formenti and   
             Trung Van Pham and   
          Thi Ha Duong Phan and   
             Thi Thu Huong Tran   Fixed-point forms of the parallel
                                  symmetric sandpile model . . . . . . . . 1--14
       Manoel Campêlo and   
           Cristiana Huiban and   
          Rudini M. Sampaio and   
            Yoshiko Wakabayashi   Hardness and inapproximability of convex
                                  recoloring problems  . . . . . . . . . . 15--25
               Amihood Amir and   
         Estrella Eisenberg and   
                Avivit Levy and   
                 Noa Lewenstein   Closest periodic vectors in $ L_p $
                                  spaces . . . . . . . . . . . . . . . . . 26--36
   Tatiana Jajcayová and   
     Edita Pelantová and   
         Stepán Starosta   Palindromic closures using multiple
                                  antimorphisms  . . . . . . . . . . . . . 37--45
                 Dietrich Kuske   Isomorphisms of scattered automatic
                                  linear orders  . . . . . . . . . . . . . 46--63
               Shiying Wang and   
                       Kai Feng   Fault tolerance in the arrangement
                                  graphs . . . . . . . . . . . . . . . . . 64--71


Theoretical Computer Science
Volume 534, Number ??, May 15, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
             Manfred Droste and   
                   Heiko Vogler   Preface  . . . . . . . . . . . . . . . . 1--1
                 Z. Ésik   Axiomatizing weighted synchronization
                                  trees and weighted bisimilarity  . . . . 2--23
                Paul Gastin and   
               Benjamin Monmege   Adding pebbles to weighted automata:
                                  Easy specification & efficient evaluation 24--44
                 Daniel Kirsten   An algebraic characterization of
                                  semirings for which the support of every
                                  recognizable series is recognizable  . . 45--52
            Karsten Lehmann and   
         Rafael Peñaloza   The complexity of computing the
                                  behaviour of lattice automata on
                                  infinite trees . . . . . . . . . . . . . 53--68
            Ingmar Meinecke and   
                    Karin Quaas   Parameterized model checking of weighted
                                  networks . . . . . . . . . . . . . . . . 69--85
         Nada Damljanovi\'c and   
          Miroslav 'Ciri\'c and   
            Jelena Ignjatovi\'c   Bisimulations for weighted automata over
                                  an additively idempotent semiring  . . . 86--100


Theoretical Computer Science
Volume 535, Number ??, May 22, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
        Ferdinando Cicalese and   
           Gennaro Cordasco and   
              Luisa Gargano and   
             Martin Milanic and   
                    Ugo Vaccaro   Latency-bounded target set selection in
                                  social networks  . . . . . . . . . . . . 1--15
                Sang-il Oum and   
 Sigve Hortemo Sæther and   
               Martin Vatshelle   Faster algorithms for vertex
                                  partitioning problems parameterized by
                                  clique-width . . . . . . . . . . . . . . 16--24
                   Yinglei Song   An improved parameterized algorithm for
                                  the independent feedback vertex set
                                  problem  . . . . . . . . . . . . . . . . 25--30
              Lowell Abrams and   
           Dena S. Cowen-Morton   A family of Nim-like arrays: the Locator
                                  Theorem  . . . . . . . . . . . . . . . . 31--37
                Lunzhi Deng and   
                     Jiwen Zeng   Two new identity-based threshold ring
                                  signature schemes  . . . . . . . . . . . 38--45
                  Fu-Tao Hu and   
                 Moo Young Sohn   The algorithmic complexity of bondage
                                  and reinforcement problems in bipartite
                                  graphs . . . . . . . . . . . . . . . . . 46--53
               Yaping Zhang and   
                 Yishuo Shi and   
                     Zhao Zhang   Approximation algorithm for the minimum
                                  weight connected $k$-subgraph cover
                                  problem  . . . . . . . . . . . . . . . . 54--58
             Mahsa Allahbakhshi   Computing degree and class degree  . . . 59--64


Theoretical Computer Science
Volume 536, Number ??, May 29, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
     A. Ballester-Bolinches and   
     E. Cosme-Llópez and   
              R. Esteban-Romero   A description based on languages of the
                                  final non-deterministic automaton  . . . 1--20
                    Vivek Nigam   A framework for linear authorization
                                  logics . . . . . . . . . . . . . . . . . 21--41
                    Thomas Kahl   Weak morphisms of higher dimensional
                                  automata . . . . . . . . . . . . . . . . 42--61
              Hugo Tremblay and   
            Gilbert Labelle and   
               Srecko Brlek and   
 Alexandre Blondin Massé   Exhaustive generation of atomic
                                  combinatorial differential operators . . 62--69


Theoretical Computer Science
Volume 537, Number ??, June 5, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
             Antonio Cerone and   
             Pekka Pihlajasaari   Theoretical Aspects of Computing (ICTAC
                                  2011)  . . . . . . . . . . . . . . . . . 1--2
                 Joakim Byg and   
            Morten Jacobsen and   
             Lasse Jacobsen and   
Kenneth Yrke Jòrgensen and   
Mikael Harkjær Mòller and   
               Jirí Srba   TCTL-preserving translations from
                                  timed-arc Petri nets to networks of
                                  timed automata . . . . . . . . . . . . . 3--28
             Volker Diekert and   
                 Martin Leucker   Topology, monitorable properties and
                                  runtime verification . . . . . . . . . . 29--41
                 Luca Aceto and   
     David de Frutos Escrig and   
Carlos Gregorio-Rodríguez and   
             Anna Ingolfsdottir   Axiomatizing weak simulation semantics
                                  over BCCSP . . . . . . . . . . . . . . . 42--71
              Carlos Areces and   
           Facundo Carreiro and   
              Santiago Figueira   Characterization, definability and
                                  separation via saturated models  . . . . 72--86
           Liliana Cojocaru and   
             Erkki Mäkinen   On some derivation mechanisms and the
                                  complexity of their Szilard languages    87--96
        A. B. van der Merwe and   
                L. van Zijl and   
                  J. Geldenhuys   Ambiguity and structural ambiguity of
                                  symmetric difference NFAs  . . . . . . . 97--104
                     Paul Tarau   Towards a generic view of primality
                                  through multiset decompositions of
                                  natural numbers  . . . . . . . . . . . . 105--124


Theoretical Computer Science
Volume 538, Number ??, June 12, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
              Mieke Massink and   
              Gethin Norman and   
               Herbert Wiklicky   Quantitative Aspects of Programming
                                  Languages and Systems (2011--12) . . . . 1--1
          Pedro Adão and   
               Paulo Mateus and   
                  Luca Vigan\`o   Protocol insecurity with a finite number
                                  of sessions and a cost-sensitive
                                  guessing intruder is NP-complete . . . . 2--15
                 Yuxin Deng and   
           Rob van Glabbeek and   
           Matthew Hennessy and   
                 Carroll Morgan   Real-reward testing for probabilistic
                                  processes  . . . . . . . . . . . . . . . 16--36
          Klaus Dräger and   
          Marta Kwiatkowska and   
               David Parker and   
                    Hongyang Qu   Local abstraction refinement for
                                  probabilistic timed programs . . . . . . 37--53
             Uli Fahrenberg and   
                     Axel Legay   The quantitative
                                  linear-time-branching-time spectrum  . . 54--69
                    Sergio Giro   Optimal schedulers vs optimal bases: An
                                  approach for efficient exact solving of
                                  Markov decision processes  . . . . . . . 70--83
                Sergio Giro and   
         Pedro R. D'Argenio and   
Luis María Ferrer Fioriti   Distributed probabilistic input/output
                                  automata: Expressiveness,
                                  (un)decidability and algorithms  . . . . 84--102
               Henri Hansen and   
                    Mark Timmer   A comparison of confluence and ample
                                  sets in probabilistic and
                                  non-probabilistic branching time . . . . 103--123
              Vladimir Klebanov   Precise quantitative information flow
                                  analysis --- a symbolic approach . . . . 124--139
           Max Tschaikowski and   
               Mirco Tribastone   Exact fluid lumpability in Markovian
                                  process algebra  . . . . . . . . . . . . 140--166
          Hirotoshi Yasuoka and   
                Tachio Terauchi   Quantitative information flow as safety
                                  and liveness hyperproperties . . . . . . 167--182


Theoretical Computer Science
Volume 539, Number ??, June 19, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
               Xiaotie Deng and   
              Paul Goldberg and   
                    Bo Tang and   
                  Jinshan Zhang   Revenue maximization in a Bayesian
                                  double auction market  . . . . . . . . . 1--12
          Janusz Brzozowski and   
                    Hellis Tamm   Theory of átomata . . . . . . . . . . . . 13--27
                 Suzanne Seager   Locating a backtracking robber on a tree 28--37
           Michael Benedikt and   
            Gabriele Puppis and   
               Cristian Riveros   The per-character cost of repairing word
                                  languages  . . . . . . . . . . . . . . . 38--67
           Dimitris Fotakis and   
              Paris Siminelakis   On the efficiency of
                                  Influence-and-Exploit strategies for
                                  revenue maximization under positive
                                  externalities  . . . . . . . . . . . . . 68--86
               Kaitai Liang and   
             Cheng-Kang Chu and   
                   Xiao Tan and   
             Duncan S. Wong and   
              Chunming Tang and   
                  Jianying Zhou   Chosen-ciphertext secure multi-hop
                                  identity-based conditional proxy
                                  re-encryption with constant-size
                                  ciphertexts  . . . . . . . . . . . . . . 87--105
       Andrzej M. Borzyszkowski   Computing majority via multiple queries  106--111


Theoretical Computer Science
Volume 540--541, Number ??, June 26, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
          Vangelis Markakis and   
              Ioannis Milis and   
           Vangelis Th. Paschos   Special Issue: ``Combinatorial
                                  Optimization: Theory of Algorithms and
                                  Complexity'' . . . . . . . . . . . . . . 1--1
        Spyros Angelopoulos and   
Alejandro López-Ortiz and   
        Konstantinos Panagiotou   Multi-target ray searching problems  . . 2--12
              Nicolas Boria and   
           Federico Della Croce   Reoptimization in machine scheduling . . 13--26
           Dimitris Fotakis and   
              Paraschos Koutris   Online Sum-Radii Clustering  . . . . . . 27--39
    Didem Gözüpek and   
           Mordechai Shalom and   
           Ariella Voloshin and   
                    Shmuel Zaks   On the complexity of constructing
                                  minimum changeover cost arborescences    40--52
   Péter Biró and   
           Matthijs Bomhoff and   
           Petr A. Golovach and   
                Walter Kern and   
           Daniël Paulusma   Solutions for the stable roommates
                                  problem with payments  . . . . . . . . . 53--61
                    Xin Han and   
             Yasushi Kawase and   
            Kazuhisa Makino and   
                         He Guo   Online removable knapsack problem under
                                  convex function  . . . . . . . . . . . . 62--69
    Guilherme D. da Fonseca and   
 Celina M. H. de Figueiredo and   
Vinícius G. Pereira de Sá and   
          Raphael C. S. Machado   Efficient sub-$5$ approximations for
                                  minimum dominating sets in unit disk
                                  graphs . . . . . . . . . . . . . . . . . 70--81
                 Eric Angel and   
           Evripidis Bampis and   
      Gerasimos G. Pollatos and   
         Vassilis Zissimopoulos   Optimal data placement on networks with
                                  a constant number of clients . . . . . . 82--88
               Marc Demange and   
 Jérôme Monnot and   
                Petrica Pop and   
                   Bernard Ries   On the complexity of the selective graph
                                  coloring problem in some special classes
                                  of graphs  . . . . . . . . . . . . . . . 89--102
      Cristina G. Fernandes and   
          Rafael C. S. Schouery   Second-Price Ad Auctions with Binary
                                  Bids and markets with good competition   103--114
        Monaldo Mastrolilli and   
             Georgios Stamoulis   Bi-criteria and approximation algorithms
                                  for restricted matchings . . . . . . . . 115--132
             Van Du T. Tran and   
        Philippe Chassignet and   
             Jean-Marc Steyaert   On permuted super-secondary structures
                                  of transmembrane $ \beta $-barrel
                                  proteins . . . . . . . . . . . . . . . . 133--142
      Rémi Watrigant and   
             Marin Bougeret and   
         Rodolphe Giroudeau and   
         Jean-Claude König   On the sum-max graph partitioning
                                  problem  . . . . . . . . . . . . . . . . 143--155
                     D. Weyland   On the computational complexity of the
                                  Probabilistic Traveling Salesman Problem
                                  with Deadlines . . . . . . . . . . . . . 156--168
                Zhigang Cao and   
                 Xiaoguang Yang   The fashion game: Network extension of
                                  Matching Pennies . . . . . . . . . . . . 169--181


Theoretical Computer Science
Volume 542, Number ??, July 3, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                Jiang Zhang and   
             Zhenfeng Zhang and   
                        Yu Chen   PRE: Stronger security notions and
                                  efficient construction with
                                  non-interactive opening  . . . . . . . . 1--16
             Florent Bouchy and   
               Alain Finkel and   
           Pierluigi San Pietro   Dense-choice Counter Machines revisited  17--31
                   Petr K\rurka   Exact real arithmetic for interval
                                  number systems . . . . . . . . . . . . . 32--43
               Jae Hong Seo and   
                    Keita Emura   Revocable hierarchical identity-based
                                  encryption . . . . . . . . . . . . . . . 44--62
                 Ming-Yi Ju and   
             Jeng-Jung Wang and   
                  Shu-Hao Chang   Diameter variability of hypercubes . . . 63--70
     Martin Dörnfelder and   
                  Jiong Guo and   
      Christian Komusiewicz and   
                 Mathias Weller   On the parameterized complexity of
                                  consensus clustering . . . . . . . . . . 71--82
            Gonzalo Navarro and   
           Sharma V. Thankachan   New space/time tradeoffs for top-$k$
                                  document retrieval on sequences  . . . . 83--97
            Isaac Goldstein and   
               Moshe Lewenstein   Quick greedy computation for minimum
                                  common string partition  . . . . . . . . 98--107
           Sundara Rajan R. and   
            Indra Rajasingh and   
               Parthiban N. and   
                Rajalaxmi T. M.   A linear time algorithm for embedding
                                  hypercube into cylinder and torus  . . . 108--115


Theoretical Computer Science
Volume 543, Number ??, July 10, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                 Alexandru Popa   Better lower and upper bounds for the
                                  minimum rainbow subgraph problem . . . . 1--8
              Shiri Chechik and   
                    David Peleg   Robust fault tolerant uncapacitated
                                  facility location  . . . . . . . . . . . 9--23
                Hailing Liu and   
                  Jinjiang Yuan   Online scheduling of equal length jobs
                                  on a bounded parallel batch machine with
                                  restart or limited restart . . . . . . . 24--36
           Byung-Cheon Choi and   
                    Jibok Chung   Two-agent single-machine scheduling
                                  problem with just-in-time jobs . . . . . 37--45
                   Kenli Li and   
                  Chubo Liu and   
                       Keqin Li   An approximation algorithm based on game
                                  theory for scheduling simple linear
                                  deteriorating jobs . . . . . . . . . . . 46--51
         Christiane Frougny and   
               Pavel Heller and   
     Edita Pelantová and   
        Milena Svobodová   $k$-Block parallel addition versus
                                  $1$-block parallel addition in
                                  non-standard numeration systems  . . . . 52--67
              Pierre Arnoux and   
          Masahiro Mizutani and   
                  Tarek Sellami   Random product of substitutions with the
                                  same incidence matrix  . . . . . . . . . 68--78
                   Jie Chen and   
                    Hoeteck Wee   Doubly spatial encryption from DBDH  . . 79--89
                     Irena Rusu   MinMax-profiles: a unifying view of
                                  common intervals, nested common
                                  intervals and conserved intervals of $K$
                                  permutations . . . . . . . . . . . . . . 90--111
                   David Howard   Determining membership with $2$
                                  simultaneous queries . . . . . . . . . . 112--119
                  Wenhua Li and   
              Jinjiang Yuan and   
                    Sufang Yang   Online scheduling of incompatible
                                  unit-length job families with lookahead  120--125


Theoretical Computer Science
Volume 544, Number ??, August 7, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
               Kun-Mao Chao and   
             Tsan-sheng Hsu and   
                      D. T. Lee   Algorithms and Computation (ISAAC 2012)  1--2
               Katarzyna Paluch   Popular and clan-popular $b$-matchings   3--13
               Takehiro Ito and   
           Shin-ichi Nakano and   
             Yoshio Okamoto and   
                Yota Otachi and   
              Ryuhei Uehara and   
                Takeaki Uno and   
                      Yushi Uno   A $ 4.31$-approximation for the
                                  geometric unique coverage problem on
                                  unit disks . . . . . . . . . . . . . . . 14--31
             Fabrizio Frati and   
        Joachim Gudmundsson and   
                      Emo Welzl   On the number of upward planar
                                  orientations of maximal planar graphs    32--59
           Tomasz Kociumaka and   
             Jakub Pachocki and   
          Jakub Radoszewski and   
            Wojciech Rytter and   
                 Tomasz Wale\'n   Efficient counting of square substrings
                                  in a tree  . . . . . . . . . . . . . . . 60--73
   Jan-Philipp W. Kappmeier and   
           Jannik Matuschke and   
                    Britta Peis   Abstract flows over time: a first step
                                  towards solving dynamic packing problems 74--83
               Takehiro Ito and   
            Kazuto Kawamura and   
               Hirotaka Ono and   
                      Xiao Zhou   Reconfiguration of list $ L(2, 1)
                                  $-labelings in a graph . . . . . . . . . 84--97


Theoretical Computer Science
Volume 545, Number ??, August 14, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
           Tobias Friedrich and   
                  Jonathan Rowe   Genetic and Evolutionary Computation . . 1--1
          Pietro S. Oliveto and   
                   Carsten Witt   On the runtime analysis of the Simple
                                  Genetic Algorithm  . . . . . . . . . . . 2--19
           Jonathan E. Rowe and   
                   Dirk Sudholt   The choice of the offspring population
                                  size in the $ (1, \lambda) $
                                  evolutionary algorithm . . . . . . . . . 20--38
              Thomas Jansen and   
               Christine Zarges   Performance analysis of randomised
                                  search heuristics operating with a fixed
                                  budget . . . . . . . . . . . . . . . . . 39--58
            Darrell Whitley and   
           Andrew M. Sutton and   
             Gabriela Ochoa and   
              Francisco Chicano   The component model for elementary
                                  landscapes and partial neighborhoods . . 59--75
          Francisco Chicano and   
            Darrell Whitley and   
                   Enrique Alba   Exact computation of the expectation
                                  surfaces for uniform crossover along
                                  with bit-flip mutation . . . . . . . . . 76--93
          Timo Kötzing and   
           Andrew M. Sutton and   
              Frank Neumann and   
               Una-May O'Reilly   The Max problem revisited: the
                                  importance of mutation in genetic
                                  programming  . . . . . . . . . . . . . . 94--107
             Benjamin Doerr and   
                  Carola Winzen   Reducing the arity in unbiased black-box
                                  complexity . . . . . . . . . . . . . . . 108--121


Theoretical Computer Science
Volume 546, Number ??, August 21, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
          Gian Luca Cattani and   
      Thomas T. Hildebrandt and   
                Daniele Varacca   Preface  . . . . . . . . . . . . . . . . 1--2
                 Mogens Nielsen   Trust in event structures  . . . . . . . 3--6
                Samson Abramsky   Events in context  . . . . . . . . . . . 7--9
             Prakash Panangaden   Causality in physics and computation . . 10--16
               Andrej Bauer and   
          Gordon D. Plotkin and   
                  Dana S. Scott   Cartesian closed categories of separable
                                  Scott domains  . . . . . . . . . . . . . 17--29
          Albert Benveniste and   
                Claude Jard and   
                     Samy Abbes   Foreword in honor of Glynn Winskel . . . 30--31
                     Samy Abbes   Branching cells for asymmetric event
                                  structures . . . . . . . . . . . . . . . 32--51
          Albert Benveniste and   
                Claude Jard and   
                     Samy Abbes   Application of branching cells to QoS
                                  aware service orchestrations . . . . . . 52--62
             Marco Bernardo and   
            Rocco De Nicola and   
                 Michele Loreti   Relating strong behavioral equivalences
                                  for processes with nondeterminism and
                                  probabilities  . . . . . . . . . . . . . 63--92
                Anna Bucalo and   
              Giuseppe Rosolini   Sobriety for equilogical spaces  . . . . 93--98
        Pierre-Louis Curien and   
             Richard Garner and   
                 Martin Hofmann   Revisiting the categorical
                                  interpretation of dependent type theory  99--119
                  Marcelo Fiore   Analytic functors between presheaf
                                  categories over groupoids  . . . . . . . 120--131
                J. M. E. Hyland   Elements of a theory of algebraic
                                  theories . . . . . . . . . . . . . . . . 132--144
          Yoshiki Kinoshita and   
                     John Power   Category theoretic structure of setoids  145--163
              Kim G. Larsen and   
                   Radu Mardare   Complete proof systems for weighted
                                  modal logic  . . . . . . . . . . . . . . 164--175
                Michael Mislove   Anatomy of a domain of continuous random
                                  variables I  . . . . . . . . . . . . . . 176--187
              Ugo Montanari and   
              Matteo Sammartino   A network-conscious $ \pi $-calculus and
                                  its coalgebraic semantics  . . . . . . . 188--224
          P. S. Thiagarajan and   
                    Shaofa Yang   Rabin's theorem in the concurrency
                                  setting: a conjecture  . . . . . . . . . 225--236
                Jaap van Oosten   Realizability with a local operator of
                                  A. M. Pitts  . . . . . . . . . . . . . . 237--243
          Christian Clausen and   
              Olivier Danvy and   
                     Moe Masuko   A characterization of Moessner's sieve   244--256


Theoretical Computer Science
Volume 547, Number ??, August 28, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
           Feodor F. Dragan and   
                   Muad Abu-Ata   Collective additive tree spanners of
                                  bounded tree-breadth graphs with
                                  generalizations and consequences . . . . 1--17
          Clemens Heuberger and   
                Michela Mazzoli   Symmetric digit sets for elliptic curve
                                  scalar multiplication without
                                  precomputation . . . . . . . . . . . . . 18--33
             Hung-Hsun Chen and   
                Wen-Guei Hu and   
                 De-Jan Lai and   
                   Song-Sun Lin   Nonemptiness problems of Wang tiles with
                                  three colors . . . . . . . . . . . . . . 34--45
               Kojiro Kobayashi   The minimum firing time of the
                                  generalized firing squad synchronization
                                  problem for squares  . . . . . . . . . . 46--69
             Martin Milanic and   
                Romeo Rizzi and   
           Alexandru I. Tomescu   Set graphs. II. Complexity of set graph
                                  recognition and similar problems . . . . 70--81
         Tiziana Calamoneri and   
             Rossella Petreschi   On pairwise compatibility graphs having
                                  Dilworth number $k$  . . . . . . . . . . 82--89
                 Yotam Elor and   
           Alfred M. Bruckstein   ``Robot Cloud'' gradient climbing with
                                  point measurements . . . . . . . . . . . 90--103
      Krishnendu Chatterjee and   
           Monika Henzinger and   
       Sebastian Krinninger and   
      Veronika Loitzenbauer and   
              Michael A. Raskin   Approximating the minimum cycle mean . . 104--116
            Igor E. Shparlinski   Evasive properties of sparse graphs and
                                  some linear equations in primes  . . . . 117--121
        Aviezri S. Fraenkel and   
                  Jamie Simpson   Corrigendum to ``The exact number of
                                  squares in Fibonacci words'' [Theoret.
                                  Comput. Sci. \bf 218 (1) (1999) 95--106] 122


Theoretical Computer Science
Volume 548, Number ??, September 4, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
         Emanuele Giaquinta and   
          Kimmo Fredriksson and   
           Szymon Grabowski and   
       Alexandru I. Tomescu and   
                   Esko Ukkonen   Motif matching using gapped patterns . . 1--13
                    Jetro Vesti   Extensions of rich words . . . . . . . . 14--24
                 Philippe Dumas   Asymptotic expansions for linear
                                  homogeneous divide-and-conquer
                                  recurrences: Algebraic and analytic
                                  approaches collated  . . . . . . . . . . 25--53
                   Xiao Tan and   
                Qiong Huang and   
                 Duncan S. Wong   Extending concurrent signature to
                                  multiple parties . . . . . . . . . . . . 54--67
               Marc Lelarge and   
                      Hang Zhou   Sublinear-time algorithms for
                                  monomer-dimer systems on bounded degree
                                  graphs . . . . . . . . . . . . . . . . . 68--78
                  Limei Lin and   
               Shuming Zhou and   
                      Li Xu and   
                     Dajin Wang   Conditional diagnosability of
                                  arrangement graphs under the PMC model   79--97
               Hee-Chul Kim and   
            Hyeong-Seok Lim and   
                 Jung-Heum Park   An approach to conditional
                                  diagnosability analysis under the PMC
                                  model and its application to torus
                                  networks . . . . . . . . . . . . . . . . 98--116
          Gwenaël Richomme   Minimal critical exponent of
                                  quasiperiodic words  . . . . . . . . . . 117--122


Theoretical Computer Science
Volume 549, Number ??, September 11, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
               Stefan Hetzl and   
          Alexander Leitsch and   
               Giselle Reis and   
                  Daniel Weller   Algorithmic introduction of quantified
                                  cuts . . . . . . . . . . . . . . . . . . 1--16
            Ken-etsu Fujita and   
                Aleksy Schubert   Existential type systems between Church
                                  and Curry style (type-free style)  . . . 17--35
Marta Bílková and   
      Alessandra Palmigiano and   
                     Yde Venema   Proof systems for Moss' coalgebraic
                                  logic  . . . . . . . . . . . . . . . . . 36--60
                Ralf Wimmer and   
                Nils Jansen and   
Erika Ábrahám and   
        Joost-Pieter Katoen and   
                   Bernd Becker   Minimal counterexamples for linear-time
                                  probabilistic verification . . . . . . . 61--100
        Klaus-Dieter Schewe and   
                      Qing Wang   A theoretical framework for
                                  knowledge-based entity resolution  . . . 101--126
                    Fu Song and   
                 Tayssir Touili   Efficient CTL model-checking for
                                  pushdown systems . . . . . . . . . . . . 127--145
              Chris Chilton and   
              Bengt Jonsson and   
              Marta Kwiatkowska   An algebraic theory of interface
                                  automata . . . . . . . . . . . . . . . . 146--174


Theoretical Computer Science
Volume 550, Number ??, September 18, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
               Hongyang Sun and   
                 Yuxiong He and   
               Wen-Jing Hsu and   
                        Rui Fan   Energy-efficient multiprocessor
                                  scheduling for flow time and makespan    1--20
             Yuichi Asahiro and   
                Hiroshi Eto and   
               Takehiro Ito and   
                    Eiji Miyano   Complexity of finding maximum regular
                                  induced subgraphs with prescribed degree 21--35
         MohammadAmin Fazli and   
            Mohammad Ghodsi and   
               Jafar Habibi and   
               Pooya Jalaly and   
             Vahab Mirrokni and   
                 Sina Sadeghian   On non-progressive spread of influence
                                  through social networks  . . . . . . . . 36--50
               Philip Bille and   
      Patrick Hagge Cording and   
           Inge Li Gòrtz   Compact $q$-gram profiling of compressed
                                  strings  . . . . . . . . . . . . . . . . 51--58
              Zhixiang Chen and   
                     Bin Fu and   
               Randy Goebel and   
                 Guohui Lin and   
               Weitian Tong and   
                  Jinhui Xu and   
                Boting Yang and   
                 Zhiyu Zhao and   
                     Binhai Zhu   On the approximability of the exemplar
                                  adjacency number problem for genomes
                                  with gene repetitions  . . . . . . . . . 59--65
                  Jamie Simpson   Palindromes in circular words  . . . . . 66--78
                  Lila Kari and   
     Stavros Konstantinidis and   
                Steffen Kopecki   On the maximality of languages with
                                  combined types of code properties  . . . 79--89
                Da-Jung Cho and   
                 Yo-Sub Han and   
                     Sang-Ki Ko   Decidability of involution hypercodes    90--99
                John Haslegrave   Bounds on Herman's algorithm . . . . . . 100--106
                 Michel Dekking   On the structure of Thue--Morse
                                  subwords, with an application to
                                  dynamical systems  . . . . . . . . . . . 107--112


Theoretical Computer Science
Volume 551, Number ??, September 25, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
           Giovanni Pardini and   
            Roberto Barbuti and   
  Andrea Maggiolo-Schettini and   
              Paolo Milazzo and   
                    Simone Tini   Compositional semantics and behavioural
                                  equivalences for reaction systems with
                                  restriction  . . . . . . . . . . . . . . 1--21
       Swarup Chattopadhyay and   
               C. A. Murthy and   
                  Sankar K. Pal   Fitting truncated geometric
                                  distributions in large scale real world
                                  networks . . . . . . . . . . . . . . . . 22--38
                Ali Maroosi and   
       Ravie Chandren Muniyandi   Accelerated execution of $P$ systems
                                  with active membranes to solve the
                                  $N$-queens problem . . . . . . . . . . . 39--54
               Chengyong Si and   
                    Jing An and   
                   Tian Lan and   
 Thomas Ußmüller and   
                   Lei Wang and   
                        Qidi Wu   On the equality constraints tolerance of
                                  Constrained Optimization Problems  . . . 55--65
      Jörg Lässig and   
                   Dirk Sudholt   Analysis of speedups in parallel
                                  evolutionary algorithms and $ (1 +
                                  \lambda) $ EAs for combinatorial
                                  optimization . . . . . . . . . . . . . . 66--83
                 Blai Bonet and   
              Patrik Haslum and   
            Victor Khomenko and   
     Sylvie Thiébaux and   
                  Walter Vogler   Recent advances in unfolding technique   84--101
        Maria Paola Bianchi and   
           Carlo Mereghetti and   
                Beatrice Palano   Size lower bounds for quantum automata   102--115
             Nabarun Mondal and   
            Partha Pratim Ghosh   Universal computation is `almost surely'
                                  chaotic  . . . . . . . . . . . . . . . . 116--131


Theoretical Computer Science
Volume 552, Number ??, October 2, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
               Ying-Jun Guo and   
                  Zhi-Xiong Wen   Automaticity of the Hankel determinants
                                  of difference sequences of the
                                  Thue--Morse sequence . . . . . . . . . . 1--12
                   Fei Chen and   
               Kwok-wo Wong and   
              Xiaofeng Liao and   
                      Tao Xiang   Period distribution of generalized
                                  discrete Arnold cat map  . . . . . . . . 13--25
        Parosh Aziz Abdulla and   
               Yu-Fang Chen and   
  Lukás Holík and   
            Tomás Vojnar   Mediating for reduction (on minimizing
                                  alternating Büchi automata) . . . . . . . 26--43
             Graham Cormode and   
                Hossein Jowhari   A second look at counting triangles in
                                  graph streams  . . . . . . . . . . . . . 44--51
                Zevi Miller and   
               Dan Pritikin and   
               I. H. Sudborough   Embedding multidimensional grids into
                                  optimal hypercubes . . . . . . . . . . . 52--82
István Miklós and   
      Sándor Z. Kiss and   
                   Eric Tannier   Counting and sampling SCJ small
                                  parsimony solutions  . . . . . . . . . . 83--98
               Tomoko Izumi and   
              Keigo Kinpara and   
              Taisuke Izumi and   
                    Koichi Wada   Space-efficient self-stabilizing
                                  counting population protocols on mobile
                                  sensor networks  . . . . . . . . . . . . 99--108
                  Chen Yuan and   
                     Haibin Kan   A note on sparse solutions of sparse
                                  linear systems . . . . . . . . . . . . . 109--111


Theoretical Computer Science
Volume 553, Number ??, October 9, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
              Amotz Bar-Noy and   
            Thomas Erlebach and   
Magnús M. Halldórsson and   
        Sotiris Nikoletseas and   
                  Pekka Orponen   Editorial for Algorithms for Sensor
                                  Systems, Wireless Ad Hoc Networks and
                                  Autonomous Mobile Entities . . . . . . . 1--1
                 Asaf Cohen and   
               Shlomi Dolev and   
                     Guy Leshem   Sensor networks: From dependence
                                  analysis via matroid bases to online
                                  synthesis  . . . . . . . . . . . . . . . 2--17
                    Meng Li and   
                Yota Otachi and   
               Takeshi Tokuyama   Efficient algorithms for network
                                  localization using cores of underlying
                                  graphs . . . . . . . . . . . . . . . . . 18--26
         Johannes Wendeberg and   
        Christian Schindelhauer   Polynomial-time approximation algorithms
                                  for anchor-free TDoA localization  . . . 27--36
                Dongxiao Yu and   
               Yuexuan Wang and   
            Qiang-Sheng Hua and   
              Francis C. M. Lau   Distributed $(\Delta + 1)$-coloring in
                                  the physical model . . . . . . . . . . . 37--56
Magnús M. Halldórsson and   
                 Pradipta Mitra   Wireless capacity with arbitrary gain
                                  matrix . . . . . . . . . . . . . . . . . 57--63
                Lukas Belke and   
          Thomas Kesselheim and   
       Arie M. C. A. Koster and   
          Berthold Vöcking   Comparative study of approximation
                                  algorithms and heuristics for SINR
                                  scheduling with power control  . . . . . 64--73
        David Yu Cheng Chan and   
              David Kirkpatrick   Multi-Path algorithms for minimum-colour
                                  path problems with applications to
                                  approximating barrier resilience . . . . 74--90
          Sivan Albagli-Kim and   
               Leah Epstein and   
             Hadas Shachnai and   
                     Tami Tamir   Packing resizable items with application
                                  to video delivery over wireless networks 91--105
                Yann Disser and   
          Subir Kumar Ghosh and   
Matús Mihalák and   
                 Peter Widmayer   Mapping a polygon with holes using a
                                  compass  . . . . . . . . . . . . . . . . 106--113


Theoretical Computer Science
Volume 554, Number ??, October 16, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                Ding-Zhu Du and   
                 Guochuan Zhang   Computing and Combinatorics  . . . . . . 1--1
               Hongbiao Gao and   
                Yuichi Goto and   
                   Jingde Cheng   A systematic methodology for automated
                                  theorem finding  . . . . . . . . . . . . 2--21
        Maria Paola Bianchi and   
Hans-Joachim Böckenhauer and   
            Juraj Hromkovic and   
                 Sacha Krug and   
             Björn Steffen   On the advice complexity of the online $
                                  L(2, 1) $-coloring problem on paths and
                                  cycles . . . . . . . . . . . . . . . . . 22--39
                 Pavol Hell and   
                Aurosish Mishra   $H$-coloring degree-bounded (acyclic)
                                  digraphs . . . . . . . . . . . . . . . . 40--49
               Joshua Baron and   
                Yuval Ishai and   
               Rafail Ostrovsky   On linear-size pseudorandom generators
                                  and hardcore functions . . . . . . . . . 50--63
                Amr Elmasry and   
           Daniel Dahl Juhl and   
           Jyrki Katajainen and   
            Srinivasa Rao Satti   Selection from read-only memory with
                                  limited workspace  . . . . . . . . . . . 64--73
          Yasuaki Kobayashi and   
            Hirokazu Maruta and   
               Yusuke Nakae and   
                   Hisao Tamaki   A linear edge kernel for two-layer
                                  crossing minimization  . . . . . . . . . 74--81
         Vladimir Braverman and   
                 Ran Gelles and   
               Rafail Ostrovsky   How to catch $ L_2 $-heavy-hitters on
                                  sliding windows  . . . . . . . . . . . . 82--94
Hans-Joachim Böckenhauer and   
            Juraj Hromkovic and   
                Dennis Komm and   
                 Sacha Krug and   
               Jasmin Smula and   
                 Andreas Sprock   The string guessing problem as a method
                                  to prove lower bounds on the advice
                                  complexity . . . . . . . . . . . . . . . 95--108
    Miroslav Chlebík and   
 Janka Chlebíková   Connection between conjunctive capacity
                                  and structural properties of graphs  . . 109--118
                Jasine Babu and   
            Manu Basavaraju and   
          L. Sunil Chandran and   
          Deepak Rajendraprasad   $2$-Connecting outerplanar graphs
                                  without blowing up the pathwidth . . . . 119--134
                 Yong Zhang and   
         Francis Y. L. Chin and   
             Hing-Fung Ting and   
                    Xin Han and   
           Chung Keung Poon and   
               Yung H. Tsin and   
                       Deshi Ye   Online algorithms for $1$-space bounded
                                  $2$-dimensional bin packing and square
                                  packing  . . . . . . . . . . . . . . . . 135--149
                  Yu-An Lin and   
               Sheung-Hung Poon   Non-planar square-orthogonal drawing
                                  with few-bend edges  . . . . . . . . . . 150--168
               Zhenhua Duan and   
                      Cong Tian   A practical decision procedure for
                                  Propositional Projection Temporal Logic
                                  with infinite models . . . . . . . . . . 169--190
                Zhigang Cao and   
                 Xujin Chen and   
                  Changjun Wang   Schedules for marketing products with
                                  negative externalities . . . . . . . . . 191--206
                   Feng Shi and   
               Jianxin Wang and   
                Jianer Chen and   
                Qilong Feng and   
                      Jiong Guo   Algorithms for parameterized maximum
                                  agreement forest problem on multiple
                                  trees  . . . . . . . . . . . . . . . . . 207--216
               Bernard Mans and   
                 Luke Mathieson   On the treewidth of dynamic graphs . . . 217--228
                  Nan Zhang and   
               Zhenhua Duan and   
                  Cong Tian and   
                     Dingzhu Du   A formal proof of the deadline driven
                                  scheduler in PPTL axiomatic system . . . 229--253
                  O. Cheong and   
                R. El Shawi and   
                 J. Gudmundsson   A fast algorithm for data collection
                                  along a fixed track  . . . . . . . . . . 254--262
      Konstantinos Georgiou and   
          George Karakostas and   
       Jochen Könemann and   
            Zuzanna Stamirowska   Social exchange networks with distant
                                  bargaining . . . . . . . . . . . . . . . 263--274
               Weitian Tong and   
               Randy Goebel and   
                     Guohui Lin   Approximating the minimum independent
                                  dominating set in perturbed graphs . . . 275--282


Theoretical Computer Science
Volume 555, Number ??, October 23, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
          Subir Kumar Ghosh and   
               Takeshi Tokuyama   Guest Editors' foreword  . . . . . . . . 1--1
              Suman K. Bera and   
             Shalmoli Gupta and   
                 Amit Kumar and   
                  Sambuddha Roy   Approximation algorithms for the
                                  partition vertex cover problem . . . . . 2--8
         Binay Bhattacharya and   
       Soudipta Chakraborty and   
           Ehsan Iranmanesh and   
            Ramesh Krishnamurti   The cyclical scheduling problem  . . . . 9--22
            Mourad El Ouali and   
              Helena Fohlin and   
                Anand Srivastav   A randomised approximation algorithm for
                                  the hitting set problem  . . . . . . . . 23--34
               Kei Uchizawa and   
              Takanori Aoki and   
               Takehiro Ito and   
                      Xiao Zhou   Generalized rainbow connectivity of
                                  graphs . . . . . . . . . . . . . . . . . 35--42
    Sándor P. Fekete and   
         Jan-Marc Reinhardt and   
                   Nils Schweer   A competitive strategy for
                                  distance-aware online shape allocation   43--54
                Jasine Babu and   
               Ahmad Biniaz and   
            Anil Maheshwari and   
                   Michiel Smid   Fixed-orientation equilateral triangle
                                  matching of point sets . . . . . . . . . 55--70
                Jinhee Chun and   
           Takashi Horiyama and   
               Takehiro Ito and   
       Natsuda Kaothanthong and   
               Hirotaka Ono and   
                Yota Otachi and   
           Takeshi Tokuyama and   
              Ryuhei Uehara and   
                    Takeaki Uno   Base-object location problems for
                                  base-monotone regions  . . . . . . . . . 71--84


Theoretical Computer Science
Volume 556, Number ??, October 30, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
             Peter Widmayer and   
                 Yinfeng Xu and   
                     Binhai Zhu   Combinatorial Optimization and
                                  Applications . . . . . . . . . . . . . . 1--1
             Yuki Kobayashi and   
           Yuya Higashikawa and   
                Naoki Katoh and   
               Naoyuki Kamiyama   An inductive construction of minimally
                                  rigid body-hinge simple graphs . . . . . 2--12
                    Huan Ma and   
                  Zaixin Lu and   
                  Deying Li and   
                 Yuqing Zhu and   
                  Lidan Fan and   
                       Weili Wu   Mining hidden links in social networks
                                  to achieve equilibrium . . . . . . . . . 13--24
                   Ro-Yu Wu and   
             Jou-Ming Chang and   
            Hung-Chang Chan and   
                   Kung-Jui Pai   A loopless algorithm for generating
                                  multiple binary tree sequences
                                  simultaneously . . . . . . . . . . . . . 25--33
                  Tim Wylie and   
                     Binhai Zhu   Following a curve with the discrete
                                  Fréchet distance  . . . . . . . . . . . . 34--44
                Arash Ahadi and   
       Amirhossein Mozafari and   
                  Alireza Zarei   Touring a sequence of disjoint polygons:
                                  Complexity and extension . . . . . . . . 45--54
                   Tian Liu and   
                     Min Lu and   
                    Zhao Lu and   
                          Ke Xu   Circular convex bipartite graphs:
                                  Feedback vertex sets . . . . . . . . . . 55--62
               Weitian Tong and   
               Randy Goebel and   
                   Tian Liu and   
                     Guohui Lin   Approximating the maximum multiple RNA
                                  interaction problem  . . . . . . . . . . 63--70
            Marie G. Christ and   
          Lene M. Favrholdt and   
                  Kim S. Larsen   Online bin covering: Expectations vs.
                                  guarantees . . . . . . . . . . . . . . . 71--84
             Zhi-Zhong Chen and   
                   Ying Fan and   
                   Lusheng Wang   Parameterized and approximation
                                  algorithms for finding two disjoint
                                  matchings  . . . . . . . . . . . . . . . 85--93


Theoretical Computer Science
Volume 557, Number ??, November 6, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
            Anthony Honorat and   
       Maria Potop-Butucaru and   
       Sébastien Tixeuil   Gathering fat mobile robots with slim
                                  omnidirectional cameras  . . . . . . . . 1--27
                Yancai Zhao and   
                 Zuhua Liao and   
                  Lianying Miao   On the algorithmic complexity of edge
                                  total domination . . . . . . . . . . . . 28--33
               Pritom Ahmed and   
       Costas S. Iliopoulos and   
    A. S. M. Sohidull Islam and   
                M. Sohel Rahman   The swap matching problem revisited  . . 34--49
      Mieczyslaw Borowiecki and   
        Ewa Drgas-Burchardt and   
            Elzbieta Sidorowicz   A feedback vertex set of $2$-degenerate
                                  graphs . . . . . . . . . . . . . . . . . 50--58
               Kung-Jui Pai and   
             Jou-Ming Chang and   
           Jinn-Shyong Yang and   
                       Ro-Yu Wu   Incidence coloring on hypercubes . . . . 59--65
               Shiying Wang and   
                      Lei Zhang   Sufficient conditions for $k$-restricted
                                  edge connected graphs  . . . . . . . . . 66--75
           Piotr Borowiecki and   
        Dariusz Dereniowski and   
                   Pawel Pralat   Brushing with additional cleaning
                                  restrictions . . . . . . . . . . . . . . 76--86
      Henrik Björklund and   
     Johanna Björklund and   
                 Niklas Zechner   Compression of finite-state automata
                                  through failure transitions  . . . . . . 87--100
                Eddie Cheng and   
                     Ke Qiu and   
                  Zhizhang Shen   On the conditional diagnosability of
                                  matching composition networks  . . . . . 101--114
                   Juha Honkala   Remarks concerning the freeness problem
                                  over morphism and matrix semigroups  . . 115--119
           Moshe Lewenstein and   
               J. Ian Munro and   
            Venkatesh Raman and   
           Sharma V. Thankachan   Less space: Indexing for queries with
                                  wildcards  . . . . . . . . . . . . . . . 120--127


Theoretical Computer Science
Volume 558, Number ??, November 13, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
           Nader H. Bshouty and   
              Gilles Stoltz and   
            Nicolas Vayatis and   
                Thomas Zeugmann   Guest Editors' foreword  . . . . . . . . 1--4
                 Ziyuan Gao and   
                  Frank Stephan   Confident and consistent partial
                                  learning of recursive functions  . . . . 5--17
Christophe Costa Florêncio and   
                   Sicco Verwer   Regular inference as vertex coloring . . 18--34
                Rahim Samei and   
             Pavel Semukhin and   
                Boting Yang and   
                  Sandra Zilles   Algebraic methods proving Sauer's bound
                                  for teaching complexity  . . . . . . . . 35--50
           Shalev Ben-David and   
                     Lev Reyzin   Data stability in clustering: a closer
                                  look . . . . . . . . . . . . . . . . . . 51--61
              Ronald Ortner and   
              Daniil Ryabko and   
                 Peter Auer and   
              Rémi Munos   Regret bounds for restless Markov
                                  bandits  . . . . . . . . . . . . . . . . 62--76
       Alexandra Carpentier and   
              Rémi Munos   Minimax number of strata for online
                                  stratified sampling: the case of noisy
                                  samples  . . . . . . . . . . . . . . . . 77--106
            Edward Moroshko and   
                   Koby Crammer   Weighted last-step min-max algorithm
                                  with improved sub-logarithmic regret . . 107--124
              Tor Lattimore and   
                  Marcus Hutter   Near-optimal PAC bounds for discounted
                                  MDPs . . . . . . . . . . . . . . . . . . 125--143
           Wouter M. Koolen and   
                  Vladimir Vovk   Buy low, sell high . . . . . . . . . . . 144--158
         Manfred K. Warmuth and   
         Wojciech Kotlowski and   
                 Shuisheng Zhou   Kernelization of matrix updates, when
                                  and how? . . . . . . . . . . . . . . . . 159--178


Theoretical Computer Science
Volume 559, Number ??, November 20, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix
                Sukanta Das and   
            Enrico Formenti and   
                    Jarkko Kari   Non-uniform Cellular Automata  . . . . . 1--2
                 Eric Goles and   
              Pedro Montealegre   Computational complexity of threshold
                                  automata networks under different
                                  updating schemes . . . . . . . . . . . . 3--19
           Chris J. Kuhlman and   
            Henning S. Mortveit   Attractor stability in nonuniform
                                  Boolean networks . . . . . . . . . . . . 20--33
                  Sichao Wu and   
              Abhijin Adiga and   
            Henning S. Mortveit   Limit cycle structure for dynamic
                                  bi-threshold systems . . . . . . . . . . 34--41
              Jean Mairesse and   
              Ir\`ene Marcovici   Around probabilistic cellular automata   42--72
          Alberto Dennunzio and   
            Enrico Formenti and   
              Julien Provillard   Three research directions in non-uniform
                                  cellular automata  . . . . . . . . . . . 73--90
                     Ville Salo   Realization problems for nonuniform
                                  cellular automata  . . . . . . . . . . . 91--107
               Luca Manzoni and   
                   Hiroshi Umeo   The firing squad synchronization problem
                                  on CA with multiple updating cycles  . . 108--117


Theoretical Computer Science
Volume 560 (part 1), Number ??, December 4, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix


Theoretical Computer Science
Volume 560 (part 2), Number ??, December 4, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix


Theoretical Computer Science
Volume 560 (part 3), Number ??, December 4, 2014

                      Anonymous   Editorial Board  . . . . . . . . . . . . iii--ix


Theoretical Computer Science
Volume 560 (part 1), Number ??, December 4, 2014

                    Tal Mor and   
                  Renato Renner   Preface  . . . . . . . . . . . . . . . . 1--6
         Charles H. Bennett and   
                Gilles Brassard   Quantum cryptography: Public key
                                  distribution and coin tossing  . . . . . 7--11
         Ivan Damgård and   
                 Serge Fehr and   
              Louis Salvail and   
            Christian Schaffner   Secure identification and QKD in the
                                  bounded-quantum-storage model  . . . . . 12--26
            Valerio Scarani and   
           Christian Kurtsiefer   The black paper of quantum cryptography:
                                  Real implementation problems . . . . . . 27--32
        Lawrence M. Ioannou and   
                  Michele Mosca   Public-key cryptography based on bounded
                                  quantum reference frames . . . . . . . . 33--45
           Marco Lucamarini and   
                Stefano Mancini   Quantum key distribution using a two-way
                                  quantum channel  . . . . . . . . . . . . 46--61
         R. Alléaume and   
               C. Branciard and   
                   J. Bouda and   
            T. Debuisschert and   
                 M. Dianati and   
                   N. Gisin and   
                 M. Godfrey and   
                P. Grangier and   
             T. Länger and   
         N. Lütkenhaus and   
                   C. Monyk and   
              P. Painchault and   
                    M. Peev and   
                   A. Poppe and   
                  T. Pornin and   
                  J. Rarity and   
                  R. Renner and   
                 G. Ribordy and   
                M. Riguidel and   
                 L. Salvail and   
                 A. Shields and   
                         et al.   Using quantum key distribution for
                                  cryptographic purposes: a survey . . . . 62--81
                    Karl Svozil   Non-contextual chocolate balls versus
                                  value indefinite quantum cryptography    82--90
              Shun Watanabe and   
         Ryutaroh Matsumoto and   
              Tomohiko Uyematsu   Optimal axis compensation in quantum key
                                  distribution protocols over unital
                                  channels . . . . . . . . . . . . . . . . 91--106


Theoretical Computer Science
Volume 560 (part 2), Number ??, December 4, 2014

          George Barmpalias and   
           Manindra Agrawal and   
                S. Barry Cooper   Theory and Applications of Models of
                                  Computation at the Turing Centenary in
                                  China  . . . . . . . . . . . . . . . . . 107--107
       Hervé Baumann and   
          Pierre Fraigniaud and   
   Hovhannes A. Harutyunyan and   
         Rémi de Verclos   The worst case behavior of randomized
                                  gossip protocols . . . . . . . . . . . . 108--120
                 Jingguo Bi and   
                       Qi Cheng   Lower bounds of shortest vector lengths
                                  in random NTRU lattices  . . . . . . . . 121--130
               Beate Bollig and   
          Marc Gillé and   
             Tobias Pröger   Implicit computation of maximum
                                  bipartite matchings by sublinear
                                  functional operations  . . . . . . . . . 131--146
            Bruno Escoffier and   
       Vangelis Th. Paschos and   
              Emeric Tourniaire   Approximating MAX SAT by moderately
                                  exponential and parameterized algorithms 147--157
                Qilong Feng and   
               Jianxin Wang and   
                    Chao Xu and   
                  Jinyi Yao and   
                    Jianer Chen   Improved parameterized algorithms for
                                  minimum link-length rectilinear spanning
                                  path problem . . . . . . . . . . . . . . 158--171
                 Shaoquan Jiang   Timed encryption with application to
                                  deniable key exchange  . . . . . . . . . 172--189
           Mordechai Shalom and   
           Ariella Voloshin and   
        Prudence W. H. Wong and   
          Fencol C. C. Yung and   
                    Shmuel Zaks   Online optimization of busy time on
                                  parallel machines  . . . . . . . . . . . 190--206
                Mingyu Xiao and   
              Hiroshi Nagamochi   A refined exact algorithm for Edge
                                  Dominating Set . . . . . . . . . . . . . 207--216


Theoretical Computer Science
Volume 560 (part 3), Number ??, December 4, 2014

               Marco Faella and   
                 Aniello Murano   Preface to the special issue on GandALF
                                  2012 . . . . . . . . . . . . . . . . . . 217--218
              Daniel Neider and   
           Roman Rabinovich and   
              Martin Zimmermann   Down the Borel hierarchy: Solving Muller
                                  games via safety games . . . . . . . . . 219--234
              Felix Canavoi and   
          Erich Grädel and   
               Roman Rabinovich   The discrete strategy improvement
                                  algorithm for parity games and
                                  complexity measures for directed graphs  235--250
       Alessandro Solimando and   
           Giorgio Delzanno and   
              Giovanna Guerrini   Validating XML document adaptations via
                                  Hedge Automata transformations . . . . . 251--268
            Davide Bresolin and   
         Dario Della Monica and   
           Angelo Montanari and   
                Pietro Sala and   
                Guido Sciavicco   Interval temporal logics over strongly
                                  discrete linear orders: Expressiveness
                                  and complexity . . . . . . . . . . . . . 269--291
           Julian Gutierrez and   
             Felix Klaedtke and   
                   Martin Lange   The $ \mu $-calculus alternation
                                  hierarchy collapses over structures with
                                  restricted connectivity  . . . . . . . . 292--306
           Domenico Cantone and   
                Cristiano Longo   A decidable two-sorted quantified
                                  fragment of set theory with ordered
                                  pairs and some undecidable extensions    307--325
               Martin Lange and   
              Etienne Lozes and   
    Manuel Vargas Guzmán   Model-checking process equivalences  . . 326--347
         Pavol Cerný and   
      Martin Chmelík and   
        Thomas A. Henzinger and   
             Arjun Radhakrishna   Interface simulation distances . . . . . 348--363
         Aleksandar S. Dimovski   Program verification using symbolic game
                                  semantics  . . . . . . . . . . . . . . . 364--379


Theoretical Computer Science
Volume 562, Number ??, January 11, 2015

                 Jun Hosoda and   
            Juraj Hromkovic and   
              Taisuke Izumi and   
               Hirotaka Ono and   
     Monika Steinová and   
                    Koichi Wada   Corrigendum to ``On the approximability
                                  and hardness of minimum topic connected
                                  overlay and its special instances''
                                  [Theoret. Comput. Sci. \bf 429 (2012)
                                  144--154]  . . . . . . . . . . . . . . . 660--661


Theoretical Computer Science
Volume 602, Number ??, October 18, 2015

              T. Calamoneri and   
                   R. Petreschi   Corrigendum to ``On pairwise
                                  compatibility graphs having Dilworth
                                  number two'' [Theoret. Comput. Sci. \bf
                                  524 (2014) 34--40] . . . . . . . . . . . 158--159


Theoretical Computer Science
Volume 618, Number ??, March 7, 2016

             Patrick Chisan Hew   Working in binary protects the repetends
                                  of $ 1 / 3^h $: Comment on Colussi's
                                  `The convergence classes of Collatz
                                  function'  . . . . . . . . . . . . . . . 135--141


Theoretical Computer Science
Volume 648, Number ??, October 4, 2016

             Guy Feigenblat and   
               Ofra Itzhaki and   
                      Ely Porat   Corrigendum to ``The frequent items
                                  problem, under polynomial decay, in the
                                  streaming model'' [Theoret. Comput. Sci.
                                  \bf 411(34-36) (2010) 3048--3054]  . . . 116


Theoretical Computer Science
Volume 651, Number ??, October 25, 2016

               Kung-Jui Pai and   
             Jou-Ming Chang and   
           Jinn-Shyong Yang and   
                       Ro-Yu Wu   Corrigendum to ``Incidence coloring on
                                  hypercubes'' [Theoret. Comput. Sci. \bf
                                  557 (2014) 59--65] . . . . . . . . . . . 87--88


Theoretical Computer Science
Volume 683, Number ??, June 30, 2017

             Graham Cormode and   
                Hossein Jowhari   Corrigendum to ``A second look at
                                  counting triangles in graph streams''
                                  [Theoret. Comput. Sci. \bf 552 (2014)
                                  44--51]  . . . . . . . . . . . . . . . . 31--32