Table of contents for issues of Combinatorica

Last update: Fri Sep 14 08:50:19 MDT 2018                Valid HTML 3.2!

Volume 12, Number 4, December, 1992
Volume 59, Number 2, July 22, 1996
Volume 104, Number 6, December 16, 2007
Volume 107, Number 5, August 16, 2008
Volume 110, Number 3, January 1, 2010
Volume 110, Number 4, January 16, 2010
Volume 110, Number 5, February 1, 2010
Volume 110, Number 6, February 15, 2010
Volume 110, Number 7, March 1, 2010
Volume 110, Number 8--9, April 1, 2010
Volume 110, Number 10, April 30, 2010
Volume 110, Number 11, May 16, 2010
Volume 110, Number 12--13, June 15, 2010
Volume 110, Number 14--15, July 1, 2010
Volume 110, Number 16, July 31, 2010
Volume 110, Number 17, August 15, 2010
Volume 110, Number 18--19, September 15, 2010
Volume 110, Number 20, September 30, 2010
Volume 110, Number 21, October 15, 2010
Volume 110, Number 22, October 31, 2010
Volume 110, Number 23, November 15, 2010
Volume 110, Number 24, November 30, 2010
Volume 111, Number 1, December 15, 2010
Volume 111, Number 2, December 31, 2010
Volume 111, Number 3, January 1, 2011
Volume 111, Number 4, January 15, 2011
Volume 111, Number 5, February 1, 2011
Volume 111, Number 6, February 15, 2011
Volume 111, Number 7, March 1, 2011
Volume 111, Number 8, March 15, 2011
Volume 111, Number 9, April 1, 2011
Volume 111, Number 10, April 30, 2011
Volume 111, Number 11, May 15, 2011
Volume 111, Number 12, June 15, 2011
Volume 111, Number 13, July 1, 2011
Volume 111, Number 14, July 31, 2011
Volume 111, Number 15, August 15, 2011
Volume 111, Number 16, August 30, 2011
Volume 111, Number 17, September 15, 2011
Volume 111, Number 18, September 30, 2011
Volume 111, Number 19, October 15, 2011
Volume 111, Number 20, October 31, 2011
Volume 111, Number 21--22, November 15, 2011
Volume 111, Number 23--24, December 15, 2011
Volume 112, Number 1--2, January 15, 2012
Volume 112, Number 3, January 31, 2012
Volume 112, Number 4, February 15, 2012
Volume 112, Number 5, February 28, 2012
Volume 112, Number 6, March 15, 2012
Volume 112, Number 7, March 31, 2012
Volume 112, Number 8--9, April 30, 2012
Volume 112, Number 10, May 31, 2012
Volume 112, Number 11, June 15, 2012
Volume 112, Number 12, June 30, 2012
Volume 112, Number 13, July 15, 2012
Volume 112, Number 14--15, August 15, 2012
Volume 112, Number 16, August 31, 2012
Volume 112, Number 17--18, September 30, 2012
Volume 112, Number 19, October 15, 2012
Volume 112, Number 20, October 31, 2012
Volume 112, Number 21, November 15, 2012
Volume 112, Number 23, December 15, 2012
Volume 112, Number 24, December 31, 2012
Volume 113, Number 1--2, January, 2013
Volume 113, Number 3, February 15, 2013
Volume 113, Number 4, February 28, 2013
Volume 113, Number 5--6, March 15, 2013
Volume 113, Number 7, April 15, 2013
Volume 113, Number 8, April 30, 2013
Volume 113, Number 9, May 15, 2013
Volume 113, Number 10--11, May / June, 2013
Volume 113, Number 12, June 30, 2013
Volume 113, Number 13, July 15, 2013
Volume 113, Number 14--16, July / August, 2013
Volume 113, Number 17, August 30, 2013
Volume 113, Number 18, September 15, 2013
Volume 113, Number 19--21, September / October, 2013
Volume 113, Number 22--24, November / December, 2013
Volume 114, Number 1--2, January / February, 2014
Volume 114, Number 3, March, 2014
Volume 114, Number 4, April, 2014
Volume 114, Number 5, May, 2014
Volume 114, Number 6, June, 2014
Volume 114, Number 7, July, 2014
Volume 114, Number 8, August, 2014
Volume 114, Number 9, September, 2014
Volume 114, Number 10, October, 2014
Volume 114, Number 11, November, 2014
Volume 114, Number 12, December, 2014
Volume 115, Number 1, January, 2015
Volume 115, Number 2, February, 2015
Volume 115, February, 2015
Volume 115, Number 2, February, 2015
Volume 115, Number 3, March, 2015
Volume 115, Number 4, April, 2015
Volume 115, Number 5, May, 2015
Volume 115, Number 6--8, June / August, 2015
Volume 115, Number 9, September, 2015
Volume 115, Number 10, October, 2015
Volume 115, Number 11, November, 2015
Volume 115, Number 12, December, 2015
Volume 116, Number 1, January, 2016
Volume 116, Number 2, February, 2016
Volume 116, Number 3, March, 2016
Volume 116, Number 4, April, 2016
Volume 116, Number 5, May, 2016
Volume 116, Number 6, June, 2016
Volume 116, Number 7, July, 2016
Volume 116, Number 8, August, 2016
Volume 116, Number 9, September, 2016
Volume 116, Number 10, October, 2016
Volume 116, Number 11, November, 2016
Volume 116, Number 12, December, 2016
Volume 117, Number ??, January, 2017
Volume 118, Number ??, February, 2017
Volume 119, Number ??, March, 2017
Volume 120, Number ??, April, 2017
Volume 121, Number ??, May, 2017
Volume 122, Number ??, June, 2017
Volume 123, Number ??, July, 2017
Volume 124, Number ??, August, 2017
Volume 125, Number ??, September, 2017
Volume 126, Number ??, October, 2017
Volume 127, Number ??, November, 2017
Volume 128, Number ??, December, 2017
Volume 129, Number ??, January, 2018
Volume 130, Number ??, February, 2017
Volume 131, Number ??, March, 2018
Volume 132, Number ??, April, 2018
Volume 133, Number ??, May, 2018
Volume 132, Number ??, April, 2018
Volume 133, Number ??, May, 2018
Volume 132, Number ??, April, 2018
Volume 133, Number ??, May, 2018
Volume 134, Number ??, June, 2018
Volume 135, Number ??, July, 2018
Volume 136, Number ??, August, 2018
Volume 137, Number ??, September, 2018
Volume 138, Number ??, October, 2018
Volume 139, Number ??, November, 2018
Volume 140, Number ??, December, 2018
Volume 27, Number 1, January, 2016


Combinatorica
Volume 12, Number 4, December, 1992

                       N. Nisan   Pseudorandom generators for
                                  space-bounded computation  . . . . . . . 449--461


Information Processing Letters
Volume 59, Number 2, July 22, 1996

                Ting-Yem Ho and   
                Yue-Li Wang and   
                 Ming-Tsan Juan   A linear time algorithm for finding all
                                  hinge vertices of a permutation graph    103--107


Information Processing Letters
Volume 104, Number 6, December 16, 2007

             Andrzej Lingas and   
       Agnieszka Wasylewicz and   
            Pawe\l \.Zyli\'nski   Note on covering monotone orthogonal
                                  polygons with star-shaped polygons . . . 220--227


Information Processing Letters
Volume 107, Number 5, August 16, 2008

               Hsin-Wen Wei and   
               Kwei-Jay Lin and   
                Wan-Chen Lu and   
                  Wei-Kuan Shih   Generalized rate monotonic
                                  schedulability bounds using relative
                                  period ratios  . . . . . . . . . . . . . 142--148


Information Processing Letters
Volume 110, Number 3, January 1, 2010

     Cristian Martín and   
                   Mikel Larrea   A simple and communication-efficient
                                  Omega algorithm in the crash-recovery
                                  model  . . . . . . . . . . . . . . . . . 83--87
               James Bailey and   
                   Elsa Loekito   Efficient incremental mining of contrast
                                  patterns in changing data  . . . . . . . 88--92
             Yuichi Asahiro and   
                Eiji Miyano and   
           Shuichi Miyazaki and   
               Takuro Yoshimuta   Weighted nearest neighbor algorithms for
                                  the graph exploration problem on cycles  93--98
            N. De Francesco and   
                G. Lettieri and   
                 L. Martini and   
                     G. Vaglini   Partial model checking via abstract
                                  interpretation . . . . . . . . . . . . . 99--103
                   S. Anand and   
                R. Chandramouli   A network flow based approach for
                                  network selection in dynamic spectrum
                                  access networks  . . . . . . . . . . . . 104--107
            Narad Rampersad and   
                Jeffrey Shallit   Detecting patterns in finite regular and
                                  context-free languages . . . . . . . . . 108--112
                Peter Brass and   
                   Hyeon-Suk Na   Finding the maximum bounded intersection
                                  of $k$ out of $n$ halfplanes . . . . . . 113--115
          Yannick Chevalier and   
       Michaël Rusinowitch   Compiling and securing cryptographic
                                  protocols  . . . . . . . . . . . . . . . 116--122
             Enno Ohlebusch and   
                      Simon Gog   Efficient algorithms for the all-pairs
                                  suffix-prefix problem and the all-pairs
                                  substring-prefix problem . . . . . . . . 123--128
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 4, January 16, 2010

              Nathan Keller and   
              Stephen D. Miller   Distinguishing attacks on stream ciphers
                                  based on arrays of pseudo-random words   129--132
                 Marc Bezem and   
         Robert Nieuwenhuis and   
Enric Rodríguez-Carbonell   Hard problems in max-algebra, control
                                  theory, hypergraphs and other areas  . . 133--138
                Michael B. Baer   Alphabetic coding with exponential costs 139--142
              Leonid Libkin and   
             Cristina Sirangelo   Disjoint pattern matching and
                                  implication in strings . . . . . . . . . 143--147
         Branislav \vDurian and   
                  Jan Holub and   
              Hannu Peltola and   
                   Jorma Tarhio   Improving practical exact string
                                  matching . . . . . . . . . . . . . . . . 148--152
     François Bonnet and   
                  Michel Raynal   A simple proof of the necessity of the
                                  failure detector $\Sigma$ to implement
                                  an atomic register in asynchronous
                                  message-passing systems  . . . . . . . . 153--157
            Guo-Qiang Zhang and   
                     Licong Cui   A set coverage problem . . . . . . . . . 158--159
                     Hui Li and   
               Chuan-Kun Wu and   
                        Jun Sun   A general compiler for
                                  password-authenticated group key
                                  exchange protocol  . . . . . . . . . . . 160--167
                 Sanjeev Saxena   On finding fundamental cut sets  . . . . 168--170
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 5, February 1, 2010

                   Juan Liu and   
              Xindong Zhang and   
                  Xing Chen and   
                   Jixiang Meng   On domination number of Cartesian
                                  product of directed cycles . . . . . . . 171--173
               Dhruv Mubayi and   
       György Turán   Finding bipartite subgraphs efficiently  174--177
             Santanu Sarkar and   
                Subhamoy Maitra   Cryptanalysis of RSA with two decryption
                                  exponents  . . . . . . . . . . . . . . . 178--181
                  Yi-Wei Ci and   
                 Zhan Zhang and   
               De-Cheng Zuo and   
                  Zhi-Bo Wu and   
                 Xiao-Zong Yang   Dependency mining-based causal message
                                  logging  . . . . . . . . . . . . . . . . 182--187
               Jianxin Wang and   
                   Dan Ning and   
                Qilong Feng and   
                    Jianer Chen   An improved kernelization for
                                  $P_2$-packing  . . . . . . . . . . . . . 188--192
                 Elad Cohen and   
    Martin Charles Golumbic and   
           Marina Lipshteyn and   
                   Michal Stern   On the bi-enhancement of
                                  chordal-bipartite probe graphs . . . . . 193--197
           Jonathan P. Sorenson   A randomized sublinear time parallel GCD
                                  algorithm for the EREW PRAM  . . . . . . 198--201
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 6, February 15, 2010

                   Xie-Bin Chen   Unpaired many-to-many vertex-disjoint
                                  path covers of a class of bipartite
                                  graphs . . . . . . . . . . . . . . . . . 203--205
               Huifang Miao and   
                    Guoping Lin   Strong orientations of complete
                                  $k$-partite graphs achieving the strong
                                  diameter . . . . . . . . . . . . . . . . 206--210
                Wenjun Xiao and   
            Behrooz Parhami and   
               Weidong Chen and   
                 Mingxin He and   
                    Wenhong Wei   Fully symmetric swapped networks based
                                  on bipartite cluster connectivity  . . . 211--215
                 Meng Zhang and   
                   Yi Zhang and   
                       Liang Hu   A faster algorithm for matching a set of
                                  patterns with variable length don't
                                  cares  . . . . . . . . . . . . . . . . . 216--220
                  Noga Alon and   
             Michal Feldman and   
         Ariel D. Procaccia and   
              Moshe Tennenholtz   A note on competitive diffusion through
                                  social networks  . . . . . . . . . . . . 221--225
                   Qiwen Xu and   
                    Naijun Zhan   Rate monotonic scheduling re-analysed    226--231
Manfred Schmidt-Schauß and   
                    David Sabel   Closures of may-, should- and
                                  must-convergences for contextual
                                  equivalence  . . . . . . . . . . . . . . 232--235
        Ale\vs \vZivkovi\vc and   
              Uro\vs Goljat and   
               Marjan Heri\vcko   Improving the usability of the source
                                  code quality index with interchangeable
                                  metrics sets . . . . . . . . . . . . . . 236--240
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 7, March 1, 2010

                   Feng Liu and   
                ChuanKun Wu and   
                      XiJun Lin   A new definition of the contrast of
                                  visual cryptography scheme . . . . . . . 241--246
            P. Szalachowski and   
            B. Ksiezopolski and   
                    Z. Kotulski   CMAC, CCM and GCM/GMAC: Advanced modes
                                  of operation of symmetric block ciphers
                                  in wireless sensor networks  . . . . . . 247--251
             Roman Kolpakov and   
           Gregory Kucherov and   
                   Pascal Ochem   On maximal repetitions of arbitrary
                                  exponent . . . . . . . . . . . . . . . . 252--256
          Regant Y. S. Hung and   
                Lap-Kei Lee and   
                     H. F. Ting   Finding frequent items over sliding
                                  windows with constant update time  . . . 257--260
              Michael D. Barrus   Antimagic labeling and canonical
                                  decomposition of graphs  . . . . . . . . 261--263
                E. Demenkov and   
              A. Kojevnikov and   
                 A. Kulikov and   
                G. Yaroslavtsev   New upper bounds on the Boolean circuit
                                  complexity of symmetric functions  . . . 264--267
                     Cui Yu and   
               James Bailey and   
          Julian Montefusco and   
                  Rui Zhang and   
                   Jiling Zhong   Enhancing the $B^+$-tree by dynamic node
                                  popularity caching . . . . . . . . . . . 268--273
              Sarmad Abbasi and   
              Patrick Healy and   
                   Aimal Rextin   Improving the running time of embedded
                                  upward planarity testing . . . . . . . . 274--278
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 8--9, April 1, 2010

                Stefan Hougardy   The Floyd--Warshall algorithm on graphs
                                  with negative cycles . . . . . . . . . . 279--281
             Sreyash Kenkre and   
            Sundar Vishwanathan   Approximation algorithms for the
                                  Bipartite Multicut problem . . . . . . . 282--287
                 Lingfei Yu and   
                    Kun She and   
               Haigang Gong and   
                   Changyuan Yu   Price of anarchy in parallel processing  288--293
            Byoung-Hoon Lee and   
               Sung-Hwa Lim and   
                   Jai-Hoon Kim   Scalable real-time monitoring system for
                                  ubiquitous smart space . . . . . . . . . 294--299
                     Yin Li and   
            Gong-liang Chen and   
               Yi-yang Chen and   
                    Jian-hua Li   An extension of TYT inversion algorithm
                                  in polynomial basis  . . . . . . . . . . 300--303
              Orr Dunkelman and   
                  Nathan Keller   The effects of the omission of last
                                  round's MixColumns on AES  . . . . . . . 304--308
      Jittat Fakcharoenphol and   
            Boonserm Kijsirikul   Short proofs for online multiclass
                                  prediction on graphs . . . . . . . . . . 309--311
            Pinar Heggernes and   
                 Daniel Meister   Hardness and approximation of minimum
                                  distortion embeddings  . . . . . . . . . 312--316
               Johannes Fischer   Wee LCP  . . . . . . . . . . . . . . . . 317--320
            Nicolas Roussel and   
                     Xuding Zhu   Total coloring of planar graphs of
                                  maximum degree eight . . . . . . . . . . 321--324
                 Jiping Tao and   
                Zhijun Chao and   
                  Yugeng Xi and   
                         Ye Tao   An optimal semi-online algorithm for a
                                  single machine scheduling problem with
                                  bounded processing time  . . . . . . . . 325--330
           Johannes Fischer and   
                Daniel H. Huson   New common ancestor problems in trees
                                  and directed acyclic graphs  . . . . . . 331--335
             Santanu Sarkar and   
                Subhamoy Maitra   Cryptanalysis of RSA with more than one
                                  decryption exponent  . . . . . . . . . . 336--340
          Hans Ulrich Simon and   
Balázs Szörényi   One-inclusion hypergraph density
                                  revisited  . . . . . . . . . . . . . . . 341--344
              Yen-Lin Huang and   
           Cheng-Chen Huang and   
              Chuan Yi Tang and   
                   Chin Lung Lu   An improved algorithm for sorting by
                                  block-interchanges based on permutation
                                  groups . . . . . . . . . . . . . . . . . 345--350
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 10, April 30, 2010

              Peter Jonsson and   
                  Johan Thapper   Approximating integer programs with
                                  positive right-hand sides  . . . . . . . 351--355
                 Gady Kozma and   
                 Zvi Lotker and   
                   Gideon Stupp   On the connectivity threshold for
                                  general uniform metric spaces  . . . . . 356--359
             Foto N. Afrati and   
            Matthew Damigos and   
           Manolis Gergatsoulis   Query containment under bag and bag-set
                                  semantics  . . . . . . . . . . . . . . . 360--369
Magnús M. Halldórsson   Online coloring of hypergraphs . . . . . 370--372
        Dur-e-Shahwar Kundi and   
                Arshad Aziz and   
                    Nasar Ikram   Resource efficient implementation of
                                  T-Boxes in AES on Virtex-5 FPGA  . . . . 373--377
                      Shuli Liu   On toughness and fractional $(g, f,
                                  n)$-critical graphs  . . . . . . . . . . 378--382
                   Hong Liu and   
                     Daming Zhu   Parameterized complexity of control
                                  problems in Maximin election . . . . . . 383--388
                   Andrzej Pelc   Fault-tolerant strategies in the
                                  Iterated Prisoner's Dilemma  . . . . . . 389--395
           Marcin Balcerzak and   
              Damian Niwi\'nski   Two-way deterministic automata with two
                                  reversals are exponentially more
                                  succinct than with one reversal  . . . . 396--398
      Liliana Cucu-Grosjean and   
             Joël Goossens   Predictability of Fixed-Job Priority
                                  schedulers on heterogeneous
                                  multiprocessor real-time systems . . . . 399--402
               Shuming Zhou and   
                    Wenjun Xiao   Conditional diagnosability of
                                  alternating group networks . . . . . . . 403--409
     R\=usi\cn\vs Freivalds and   
  Abuzer Yakaryìlmaz and   
                  A. C. Cem Say   A new family of nonstochastic languages  410--413
               Jia-Cian Lin and   
           Jinn-Shyong Yang and   
            Chiun-Chieh Hsu and   
                 Jou-Ming Chang   Independent spanning trees vs.
                                  edge-disjoint spanning trees in locally
                                  twisted cubes  . . . . . . . . . . . . . 414--419
             Dashiell Kolbe and   
                  Qiang Zhu and   
                 Sakti Pramanik   Reducing non-determinism of $k$-NN
                                  searching in non-ordered discrete data
                                  spaces . . . . . . . . . . . . . . . . . 420--423
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 11, May 16, 2010

   Wolfgang Dvo\vrák and   
                 Stefan Woltran   Complexity of semi-stable and stage
                                  semantics in argumentation frameworks    425--430
             Julien Clement and   
       Xavier Défago and   
Maria Gradinariu Potop-Butucaru and   
              Taisuke Izumi and   
               Stephane Messika   The cost of probabilistic agreement in
                                  oblivious robot networks . . . . . . . . 431--438
                  Jung-Sheng Fu   Edge-fault-tolerant vertex-pancyclicity
                                  of augmented cubes . . . . . . . . . . . 439--443
                   Ruyan Fu and   
             T. C. E. Cheng and   
                   C. T. Ng and   
                  Jinjiang Yuan   Online scheduling on two
                                  parallel-batching machines with limited
                                  restarts to minimize the makespan  . . . 444--450
            Robert Crowston and   
              Gregory Gutin and   
                     Mark Jones   Note on Max Lin-2 above Average  . . . . 451--454
               Peng-Jen Lai and   
                 Wen-Chiung Lee   Single-machine scheduling with a
                                  nonlinear deterioration function . . . . 455--459
                     Min Ji and   
                 T. C. E. Cheng   Scheduling with job-dependent learning
                                  effects and multiple rate-modifying
                                  activities . . . . . . . . . . . . . . . 460--463
                 Qiang Dong and   
                   Xiaofan Yang   Embedding a long fault-free cycle in a
                                  crossed cube with more faulty nodes  . . 464--468
                    Lan Lin and   
                      Yixun Lin   Two models of two-dimensional bandwidth
                                  problems . . . . . . . . . . . . . . . . 469--473
             Jean-Luc Baril and   
             Rémi Vernay   Whole mirror duplication-random loss
                                  model and pattern avoiding permutations  474--480
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 12--13, June 15, 2010

                  Joan M. Lucas   An improved kernel size for rotation
                                  distance in binary trees . . . . . . . . 481--484
                 Liqun Chen and   
                    Jiangtao Li   A note on the Chen--Morrissey--Smart DAA
                                  scheme . . . . . . . . . . . . . . . . . 485--488
               Jonghun Park and   
           Byung-Cheon Choi and   
                     Kwanho Kim   A vector space approach to tag cloud
                                  similarity ranking . . . . . . . . . . . 489--496
       Christophe Crespelle and   
              Philippe Gambette   Unrestricted and complete Breadth-First
                                  Search of trapezoid graphs in $O(n)$
                                  time . . . . . . . . . . . . . . . . . . 497--502
               Leah Epstein and   
                     Asaf Levin   Randomized algorithms for online bounded
                                  bidding  . . . . . . . . . . . . . . . . 503--506
                 Fabrizio Frati   A note on isosceles planar graph drawing 507--509
             Xiandong Zhang and   
             Steef van de Velde   On-line two-machine job shop scheduling
                                  with time lags . . . . . . . . . . . . . 510--513
             Akira Ichimura and   
                  Maiko Shigeno   A new parameter for a broadcast
                                  algorithm with locally bounded Byzantine
                                  faults . . . . . . . . . . . . . . . . . 514--517
        Aleksandar Radonjic and   
               Vladimir Vujicic   Integer SEC--DED codes for low power
                                  communications . . . . . . . . . . . . . 518--520
            Alireza Bagheri and   
           Mohammadreza Razzazi   Planar straight-line point-set embedding
                                  of trees with partial embeddings . . . . 521--523
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 14--15, July 1, 2010

            Ermeson Andrade and   
               Paulo Maciel and   
             Bruno Nogueira and   
       Carlos Araújo and   
                 Gustavo Callou   A COTS-based approach for estimating
                                  performance and energy consumption of
                                  embedded real-time systems . . . . . . . 525--534
            Tatsuya Iwasaki and   
                 Keiichi Kaneko   Fault-tolerant routing in burnt pancake
                                  graphs . . . . . . . . . . . . . . . . . 535--538
                  S. Gruner and   
                    T. J. Steyn   Deadlock-freeness of hexagonal systolic
                                  arrays . . . . . . . . . . . . . . . . . 539--543
                Shaojing Fu and   
                    Chao Li and   
             Kanta Matsuura and   
                   Longjiang Qu   Enumeration of balanced symmetric
                                  functions over $\mathrm{GF}(p)$  . . . . 544--548
                Shay Gueron and   
               Michael Kounavis   Efficient implementation of the Galois
                                  Counter Mode using a carry-less
                                  multiplier and a fast reduction
                                  algorithm  . . . . . . . . . . . . . . . 549--553
                    Mingyu Xiao   Finding minimum $3$-way cuts in
                                  hypergraphs  . . . . . . . . . . . . . . 554--558
               Xiaofan Yang and   
                 Qiang Dong and   
                  Yuan Yan Tang   Embedding meshes/tori in faulty crossed
                                  cubes  . . . . . . . . . . . . . . . . . 559--564
         Avraham A. Melkman and   
            Takeyuki Tamura and   
                 Tatsuya Akutsu   Determining a singleton attractor of an
                                  AND/OR Boolean network in $O(1.587^n)$
                                  time . . . . . . . . . . . . . . . . . . 565--569
         Nili Guttmann-Beck and   
                  Refael Hassin   On two restricted ancestors tree
                                  problems . . . . . . . . . . . . . . . . 570--575
                   Jae Moon Lee   An efficient algorithm to find
                                  $k$-nearest neighbors in flocking
                                  behavior . . . . . . . . . . . . . . . . 576--579
                     Di Liu and   
                        Jing Li   Many-to-many $n$-disjoint path covers in
                                  $n$-dimensional hypercubes . . . . . . . 580--584
             Jano\vs Vidali and   
                 Peter Nose and   
               Enes Pa\vsali\'c   Collisions for variants of the BLAKE
                                  hash function  . . . . . . . . . . . . . 585--590
                 Tero Harju and   
                   Dirk Nowotka   Cyclically repetition-free words on
                                  small alphabets  . . . . . . . . . . . . 591--595
                 Zong-Da Wu and   
                  Tao Jiang and   
                      Wu-Jie Su   Efficient computation of shortest absent
                                  words in a genomic sequence  . . . . . . 596--601
               Jooyoung Lee and   
                   Je Hong Park   Preimage resistance of LPmkr with $r = m
                                  - 1$ . . . . . . . . . . . . . . . . . . 602--608
            Valerio Freschi and   
            Alessandro Bogliolo   A faster algorithm for the computation
                                  of string convolutions using LZ78
                                  parsing  . . . . . . . . . . . . . . . . 609--613
               Hyun-Gul Roh and   
             Myeongjae Jeon and   
               Euiseong Seo and   
                 Jinsoo Kim and   
                    Joonwon Lee   Log' version vector: Logging version
                                  vectors concisely in dynamic replication 614--620
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 16, July 31, 2010

            Faisal N. Abu-Khzam   An improved kernelization algorithm for
                                  $r$-Set Packing  . . . . . . . . . . . . 621--624
                   Xie-Bin Chen   Cycles passing through a prescribed path
                                  in a hypercube with faulty edges . . . . 625--629
              Nicholas Nash and   
                    David Gregg   An output sensitive algorithm for
                                  computing a maximum independent set of a
                                  circle graph . . . . . . . . . . . . . . 630--634
            Jonathan Backer and   
                   J. Mark Keil   Constant factor approximation algorithms
                                  for the densest $k$-subgraph problem on
                                  proper interval graphs and bipartite
                                  permutation graphs . . . . . . . . . . . 635--638
              Wouter Gelade and   
                    Frank Neven   Optimizing the Region Algebra is
                                  PSPACE-complete  . . . . . . . . . . . . 639--643
      Alessandro Colantonio and   
              Roberto Di Pietro   Concise: Compressed `n' Composable
                                  Integer Set  . . . . . . . . . . . . . . 644--650
                     Ruijuan Li   A Fan-type result on $k$-ordered graphs  651--654
                    Amr Elmasry   The longest almost-increasing
                                  subsequence  . . . . . . . . . . . . . . 655--658
                  Litao Guo and   
                Chengfu Qin and   
                   Xiaofeng Guo   Super connectivity of Kronecker products
                                  of graphs  . . . . . . . . . . . . . . . 659--661
              Dejan Deli\'c and   
                 Changping Wang   Upper signed $k$-domination in a general
                                  graph  . . . . . . . . . . . . . . . . . 662--665
        Bhargav S. Gulavani and   
       Supratik Chakraborty and   
             Aditya V. Nori and   
             Sriram K. Rajamani   Refining abstract interpretations  . . . 666--671
               Sang Won Bae and   
               Chunseok Lee and   
                   Sunghee Choi   On exact solutions to the Euclidean
                                  bottleneck Steiner tree problem  . . . . 672--678
             Pietro Di Lena and   
                Luciano Margara   Optimal global alignment of signals by
                                  maximization of Pearson correlation  . . 679--686
              Walter Didimo and   
                Peter Eades and   
                Giuseppe Liotta   A characterization of complete bipartite
                                  RAC graphs . . . . . . . . . . . . . . . 687--691
              Guiguang Ding and   
               Jianmin Wang and   
                        Kai Qin   A visual word weighting scheme based on
                                  emerging itemsets for video annotation   692--696
          Thierry Vallée   Normal Eulerian clique-covering and
                                  Hamiltonicity  . . . . . . . . . . . . . 697--701
             Fedor V. Fomin and   
              Serge Gaspers and   
           Petr A. Golovach and   
             Dieter Kratsch and   
                  Saket Saurabh   Parameterized algorithm for eternal
                                  vertex cover . . . . . . . . . . . . . . 702--706
                Ariel Kulik and   
                 Hadas Shachnai   There is no EPTAS for two-dimensional
                                  knapsack . . . . . . . . . . . . . . . . 707--710
             Chan-Wei Chang and   
                  David Kuo and   
                Hsing-Ching Lin   Ranking numbers of graphs  . . . . . . . 711--716
            Henning Koehler and   
                 Sebastian Link   Armstrong axioms and Boyce--Codd--Heath
                                  Normal Form under bag semantics  . . . . 717--724
                   Marek Libura   A note on robustness tolerances for
                                  combinatorial optimization problems  . . 725--729
            Yung-Hsing Peng and   
            Chang-Biau Yang and   
               Kuo-Si Huang and   
                  Hsing-Yen Ann   Efficient indexing algorithms for
                                  one-dimensional discretely-scaled
                                  strings  . . . . . . . . . . . . . . . . 730--734
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 17, August 15, 2010

                    Tom Rackham   The complexity of changing colourings
                                  with bounded maximum degree  . . . . . . 735--739
                  Ranko Lazi\'c   The reachability problem for branching
                                  vector addition systems requires
                                  doubly-exponential space . . . . . . . . 740--745
            Subhas C. Nandy and   
   Krishnendu Mukhopadhyaya and   
        Bhargab B. Bhattacharya   Recognition of largest empty orthoconvex
                                  polygon in a point set . . . . . . . . . 746--752
                Shun'ichi Amano   On the coNP hardness of computing
                                  certain answers over locally specified
                                  incomplete DOM-trees . . . . . . . . . . 753--756
Konstanty Junosza-Szaniawski and   
                \Lukasz Ro\.zej   Game chromatic number of graphs with
                                  locally bounded number of cycles . . . . 757--760
            Armin Eftekhari and   
        Mohamad Forouzanfar and   
  Hamid Abrishami Moghaddam and   
                Javad Alirezaie   Block-wise 2D kernel PCA/LDA for face
                                  recognition  . . . . . . . . . . . . . . 761--766
            Luciano Bertini and   
         Julius C. B. Leite and   
            Daniel Mossé   Power and performance control of soft
                                  real-time Web server clusters  . . . . . 767--773
    Christopher C. Cipriano and   
            Teofilo F. Gonzalez   Multicasting in the hypercube, chord and
                                  binomial graphs  . . . . . . . . . . . . 774--777
               Ing-Ray Chen and   
                Yating Wang and   
                 Ding-Chau Wang   Reliability of wireless sensors with
                                  code attestation for intrusion detection 778--786
              Robert Glück   Self-generating program specializers . . 787--793
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 18--19, September 15, 2010

           Tanaeem M. Moosa and   
                M. Sohel Rahman   Indexing permutations for binary strings 795--798
              Dongyoung Roh and   
                 Sang Geun Hahn   On the bit security of the weak
                                  Diffie--Hellman problem  . . . . . . . . 799--802
         Katsuhisa Yamanaka and   
               Shin-ichi Nakano   A compact encoding of plane
                                  triangulations with efficient query
                                  supports . . . . . . . . . . . . . . . . 803--809
             Masahiko Sakai and   
                 Mizuhito Ogawa   Weakly-non-overlapping non-collapsing
                                  shallow term rewriting systems are
                                  confluent  . . . . . . . . . . . . . . . 810--814
                 Tatsuya Akutsu   A bisection algorithm for grammar-based
                                  compression of ordered trees . . . . . . 815--820
                   Deke Guo and   
                Hanhua Chen and   
                    Yuan He and   
                    Hai Jin and   
                  Chao Chen and   
               Honghui Chen and   
                   Zhen Shu and   
                  Guangqi Huang   KCube: a novel architecture for
                                  interconnection networks . . . . . . . . 821--825
                Iftah Gamzu and   
                    Danny Segev   A polylogarithmic approximation for
                                  computing non-metric terminal Steiner
                                  trees  . . . . . . . . . . . . . . . . . 826--829
              Jingwen Zhang and   
                  Yingqian Wang   $(\Delta + 1)$-total-colorability of
                                  plane graphs with maximum degree
                                  $\Delta$ at least $6$ and without
                                  adjacent short cycles  . . . . . . . . . 830--834
                    Esther Ezra   A note about weak $\epsilon$-nets for
                                  axis-parallel boxes in $d$-space . . . . 835--840
            Tibor Jordán   Generically globally rigid zeolites in
                                  the plane  . . . . . . . . . . . . . . . 841--844
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 20, September 30, 2010

            Maw-Shang Chang and   
            Hsiao-Han Chung and   
               Chuang-Chieh Lin   An improved algorithm for the red--blue
                                  hitting set problem with the consecutive
                                  ones property  . . . . . . . . . . . . . 845--848
       Gerard Jennhwa Chang and   
               Jianfeng Hou and   
                Nicolas Roussel   On the total choosability of planar
                                  graphs and of sparse graphs  . . . . . . 849--853
     Paulin Melatagia Yonta and   
           Maurice Tchuente and   
           René Ndoundam   Routing automorphisms of the hypercube   854--860
                Andrey Bogdanov   On the differential and linear
                                  efficiency of balanced Feistel networks  861--866
     Andreas Björklund and   
             Thore Husfeldt and   
              Petteri Kaski and   
                 Mikko Koivisto   Evaluation of permanents in rings and
                                  semirings  . . . . . . . . . . . . . . . 867--870
            Shuaiqiang Wang and   
                     Jun Ma and   
                 Jiming Liu and   
                    Xiaofei Niu   Evolving choice structures for genetic
                                  programming  . . . . . . . . . . . . . . 871--876
            Paola Bonizzoni and   
      Gianluca Della Vedova and   
             Riccardo Dondi and   
                    Yuri Pirola   Variants of constrained longest common
                                  subsequence  . . . . . . . . . . . . . . 877--881
                  Chong Hee Kim   New fault attacks using Jacobi symbol
                                  and application to regular right-to-left
                                  algorithms . . . . . . . . . . . . . . . 882--886
                   Wei Dong and   
                     Baogang Xu   Some results on acyclic edge coloring of
                                  plane graphs . . . . . . . . . . . . . . 887--892
                 Rahul Jain and   
             Hartmut Klauck and   
                  Miklos Santha   Optimal direct sum results for
                                  deterministic and randomized decision
                                  tree complexity  . . . . . . . . . . . . 893--897
           Elena Grigorescu and   
                Kyomin Jung and   
               Ronitt Rubinfeld   A local decision test for sparse
                                  polynomials  . . . . . . . . . . . . . . 898--901
Erzsébet Csuhaj-Varjú and   
             György Vaszil   Scattered context grammars generate any
                                  recursively enumerable language with two
                                  nonterminals . . . . . . . . . . . . . . 902--907
             Richard Groult and   
        Élise Prieur and   
   Gwénaël Richomme   Counting distinct palindromes in a word
                                  in linear time . . . . . . . . . . . . . 908--912
         Mickael Montassier and   
       André Raspaud and   
                     Xuding Zhu   Decomposition of sparse graphs into two
                                  forests, one having bounded maximum
                                  degree . . . . . . . . . . . . . . . . . 913--916
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 21, October 15, 2010

              Travis C. Service   A No Free Lunch theorem for
                                  multi-objective optimization . . . . . . 917--923
                   Beate Bollig   Exponential space complexity for
                                  OBDD-based reachability analysis . . . . 924--927
    Bernadette Charron-Bost and   
               Martin Hutle and   
                   Josef Widder   In search of lost time . . . . . . . . . 928--933
            Fabrizio Luccio and   
      Antonio Mesa Enriquez and   
                    Linda Pagli   Lower bounds on the rotation distance of
                                  binary trees . . . . . . . . . . . . . . 934--938
              Torben Amtoft and   
      Kelly Androutsopoulos and   
                David Clark and   
                Mark Harman and   
                       Zheng Li   An alternative characterization of weak
                                  order dependence . . . . . . . . . . . . 939--943
            Ken Christensen and   
             Allen Roginsky and   
                  Miguel Jimeno   A new analysis of the false positive
                                  rate of a Bloom filter . . . . . . . . . 944--949
                     Jef Wijsen   A remark on the complexity of consistent
                                  conjunctive query answering under
                                  primary key violations . . . . . . . . . 950--955
                Bartosz Walczak   A simple representation of subwords of
                                  the Fibonacci word . . . . . . . . . . . 956--960
                  Bassel Mannaa   Cluster editing problem for points on
                                  the real line: a polynomial time
                                  algorithm  . . . . . . . . . . . . . . . 961--965
              Gregory Gutin and   
                     Anders Yeo   Note on maximal bisection above tight
                                  lower bound  . . . . . . . . . . . . . . 966--969
              Tsung-Hao Liu and   
                     Hsueh-I Lu   Minimum cycle bases of weighted
                                  outerplanar graphs . . . . . . . . . . . 970--974
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 22, October 31, 2010

        Sebastian Dörn and   
                Thomas Thierauf   A note on the search for $k$ elements
                                  via quantum walk . . . . . . . . . . . . 975--978
               Andrew Zemke and   
               Sandra James and   
              Darren A. Narayan   Greedy algorithms for generalized
                                  $k$-rankings of paths  . . . . . . . . . 979--985
                 Xiuying Li and   
                     Zhao Zhang   Two algorithms for minimum $2$-connected
                                  $r$-hop dominating set . . . . . . . . . 986--991
              Xiaorong Wang and   
                     Hongbo Shi   A modified Guruswami--Sudan algorithm
                                  for decoding Reed--Solomon codes . . . . 992--997
                 Zhao Zhang and   
                  Wei Xiong and   
                    Weihua Yang   A kind of conditional fault tolerance of
                                  alternating group graphs . . . . . . . . 998--1002
              Zhenghua Zhou and   
                     Zhi Hu and   
                  Maozhi Xu and   
                    Wangan Song   Efficient $3$-dimensional GLV method for
                                  faster point multiplication on some GLS
                                  elliptic curves  . . . . . . . . . . . . 1003--1006
                Weihua Yang and   
                 Hengzhe Li and   
                   Xiaofeng Guo   A kind of conditional fault tolerance of
                                  $(n, k)$-star graphs . . . . . . . . . . 1007--1011
      Raphaël Clifford and   
                  Benjamin Sach   Permuted function matching . . . . . . . 1012--1015
                Kazuo Iwama and   
                 Guochuan Zhang   Online knapsack with resource
                                  augmentation . . . . . . . . . . . . . . 1016--1020
      Raphaël Clifford and   
                      Ely Porat   A filtering algorithm for $k$-mismatch
                                  with don't cares . . . . . . . . . . . . 1021--1025
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 23, November 15, 2010

                Weihua Yang and   
                 Hengzhe Li and   
                   Jixiang Meng   Conditional connectivity of Cayley
                                  graphs generated by transposition trees  1027--1030
             Giorgio Gnecco and   
            Marcello Sanguineti   On spectral windows in supervised
                                  learning from data . . . . . . . . . . . 1031--1036
             Leo van Iersel and   
             Charles Semple and   
                     Mike Steel   Locating a tree in a phylogenetic
                                  network  . . . . . . . . . . . . . . . . 1037--1043
                  Anita Das and   
          Mathew C. Francis and   
              Rogers Mathew and   
                   N. Sadagopan   Non-contractible non-edges in
                                  $2$-connected graphs . . . . . . . . . . 1044--1048
                    Xin Han and   
                  Chao Peng and   
                   Deshi Ye and   
                Dahai Zhang and   
                        Yan Lan   Dynamic bin packing with unit fraction
                                  items revisited  . . . . . . . . . . . . 1049--1054
                Alex A. Aravind   Highly-fair bakery algorithm using
                                  symmetric tokens . . . . . . . . . . . . 1055--1060
           Jyrki Katajainen and   
               S. Srinivasa Rao   A compact data structure for
                                  representing a dynamic multiset  . . . . 1061--1066
                B. S. Panda and   
                     D. Pradhan   Locally connected spanning trees in
                                  cographs, complements of bipartite
                                  graphs and doubly chordal graphs . . . . 1067--1073
           Olaf Beyersdorff and   
              Nicola Galesi and   
                 Massimo Lauria   A lower bound for the pigeonhole
                                  principle in tree-like Resolution by
                                  asymmetric Prover--Delayer games . . . . 1074--1077
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 110, Number 24, November 30, 2010

              C. Bartoschek and   
                    S. Held and   
           J. Maßberg and   
              D. Rautenbach and   
                       J. Vygen   The repeater tree construction problem   1079--1083
                   Haihui Zhang   RETRACTED ARTICLE: On $3$-choosability
                                  of planar graphs with neither adjacent
                                  triangles nor $5$-, $6$- and $9$-cycles  1084--1087
                   Xie-Bin Chen   Edge-fault-tolerant diameter and
                                  bipanconnectivity of hypercubes  . . . . 1088--1092
              Kimmo Fredriksson   On building minimal automaton for subset
                                  matching queries . . . . . . . . . . . . 1093--1098
                 Meng Zhang and   
                   Yi Zhang and   
                       Liang Hu   Pattern matching with wildcards using
                                  words of shorter length  . . . . . . . . 1099--1102
               Yunong Zhang and   
                  Zhende Ke and   
                    Peng Xu and   
                      Chenfu Yi   Time-varying square roots finding via
                                  Zhang dynamics versus gradient dynamics
                                  and the former's link and new
                                  explanation to Newton--Raphson iteration 1103--1109
               Ashley Montanaro   Nonadaptive quantum query complexity . . 1110--1113
                Sanjay Jain and   
               Yuh Shin Ong and   
                  Frank Stephan   Regular patterns, regular languages and
                                  context-free languages . . . . . . . . . 1114--1119
                 Yuval Emek and   
          Pierre Fraigniaud and   
                Amos Korman and   
               Adi Rosén   On the additive constant of the
                                  $k$-server Work Function Algorithm . . . 1120--1123
                  Yang Shen and   
                LiZhuang Ma and   
                    Hai Liu and   
                 Yanxia Bao and   
                    Zhihua Chen   Detecting and extracting natural snow
                                  from videos  . . . . . . . . . . . . . . 1124--1130


Information Processing Letters
Volume 111, Number 1, December 15, 2010

              Chin-Yang Lin and   
                   Ting-Wei Hou   An efficient approach to cyclic
                                  reference counting based on a
                                  coarse-grained search  . . . . . . . . . 1--10
          Pascal Schweitzer and   
             Patrick Schweitzer   Connecting face hitting sets in planar
                                  graphs . . . . . . . . . . . . . . . . . 11--15
              Harry Buhrman and   
David García-Soriano and   
                  Arie Matsliah   Learning parities in the mistake-bound
                                  model  . . . . . . . . . . . . . . . . . 16--21
               Jin-Xin Zhou and   
                  Yan-Quan Feng   Super-connected but not super
                                  edge-connected graphs  . . . . . . . . . 22--25
                   C. H. Li and   
                X. F. Zhang and   
                     H. Jin and   
                       W. Xiang   E-passport EAC scheme based on
                                  Identity-Based Cryptography  . . . . . . 26--30
               Jessen T. Havill   Online malleable job scheduling for $m
                                  \leq 3$  . . . . . . . . . . . . . . . . 31--35
              Xindong Zhang and   
                   Juan Liu and   
                  Xing Chen and   
                   Jixiang Meng   Domination number of Cartesian products
                                  of directed cycles . . . . . . . . . . . 36--39
                      Chi Zhang   An improved lower bound on query
                                  complexity for quantum PAC learning  . . 40--45
              Jean Marcel Pallo   Root-restricted Kleenean rotations . . . 46--50
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 2, December 31, 2010

                 J. B. Lima and   
                 D. Panario and   
        R. M. Campello de Souza   Public-key encryption based on Chebyshev
                                  polynomials over $\mathrm{GF}(q)$  . . . 51--56
                  Akash Lal and   
                  G. Ramalingam   Reference count analysis with shallow
                                  aliasing . . . . . . . . . . . . . . . . 57--63
      Daniel Binkele-Raible and   
             Henning Fernau and   
              Serge Gaspers and   
               Mathieu Liedloff   Exact exponential-time algorithms for
                                  finding bicliques  . . . . . . . . . . . 64--67
                 Luca Aceto and   
         Anna Ingolfsdottir and   
                    Joshua Sack   Resource bisimilarity and graded
                                  bisimilarity coincide  . . . . . . . . . 68--76
           Byung-Cheon Choi and   
         Joseph Y.-T. Leung and   
              Michael L. Pinedo   A note on makespan minimization in
                                  proportionate flow shops . . . . . . . . 77--81
               Haifeng Qian and   
                    Shouhuai Xu   Non-interactive multisignatures in the
                                  plain public-key model with efficient
                                  verification . . . . . . . . . . . . . . 82--89
                 Yiyuan Luo and   
                 Xuejia Lai and   
                     Zheng Gong   Pseudorandomness analysis of the
                                  (extended) Lai--Massey scheme  . . . . . 90--96
                   A. A. Farrag   Developing fault-tolerant distributed
                                  loops  . . . . . . . . . . . . . . . . . 97--101
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 3, January 1, 2011

            Matthew J. Katz and   
               Gila Morgenstern   Settling the bound on the rectilinear
                                  link radius of a simple rectilinear
                                  polygon  . . . . . . . . . . . . . . . . 103--106
                 Z. Ésik   An undecidable property of context-free
                                  linear orders  . . . . . . . . . . . . . 107--109
      Ján Katreni\vc and   
               Ingo Schiermeyer   Improved approximation bounds for the
                                  minimum rainbow subgraph problem . . . . 110--114
                  XueLin Xu and   
              ZongSheng Gao and   
                          Ke Xu   A tighter upper bound for random MAX
                                  $2$-SAT  . . . . . . . . . . . . . . . . 115--119
                Van Bang Le and   
                Ngoc Tuy Nguyen   A good characterization of squares of
                                  strongly chordal split graphs  . . . . . 120--123
                  Xin Zhang and   
                  Jian-Liang Wu   On edge colorings of $1$-planar graphs   124--128
              Rafael Duarte and   
             Alexandre Mota and   
                Augusto Sampaio   Introducing concurrency in sequential
                                  Java via laws  . . . . . . . . . . . . . 129--134
              Jae-Yoon Jung and   
              Chang-Ho Chin and   
                  Jorge Cardoso   An entropy-based uncertainty measure of
                                  process models . . . . . . . . . . . . . 135--141
             Fedor V. Fomin and   
           Petr A. Golovach and   
           Erik Jan van Leeuwen   Spanners of bounded degree graphs  . . . 142--144
                  Mariano Zelke   Intractability of min- and max-cut in
                                  streaming graphs . . . . . . . . . . . . 145--150
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 4, January 15, 2011

               Beate Bollig and   
              Marc Gillé   Randomized OBDDs for the most
                                  significant bit of multiplication need
                                  exponential space  . . . . . . . . . . . 151--155
                  Ruilin Li and   
                   Bing Sun and   
                    Chao Li and   
                  Jianxiong You   Differential Fault Analysis on SMS4
                                  using a single fault . . . . . . . . . . 156--163
              Martin Kochol and   
Nad'a Krivo\vnáková and   
      Silvia Smejová and   
Katarína \vSranková   Matrix reduction in a combinatorial
                                  computation  . . . . . . . . . . . . . . 164--168
         Tomás Feder and   
                    Carlos Subi   Maximum gap labelings of graphs  . . . . 169--173
                   Gur Mosheiov   Proportionate flowshops with general
                                  position-dependent processing times  . . 174--177
          Paul Dütting and   
           Monika Henzinger and   
                   Ingmar Weber   Offline file assignments for online load
                                  balancing  . . . . . . . . . . . . . . . 178--183
              Eyal Even-Dar and   
                   Asaf Shapira   A note on maximizing the spread of
                                  influence in social networks . . . . . . 184--187
                 Erjie Yang and   
               Xiaofan Yang and   
                 Qiang Dong and   
                        Jing Li   Conditional diagnosability of
                                  hypermeshes under the comparison model   188--193
      Sergio Arévalo and   
     Ernesto Jiménez and   
               Mikel Larrea and   
                   Luis Mengual   Communication-efficient and
                                  crash-quiescent Omega with unknown
                                  membership . . . . . . . . . . . . . . . 194--199
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 5, February 1, 2011

               Taehyung Lee and   
              Joong Chae Na and   
                    Kunsoo Park   On-line construction of parameterized
                                  suffix trees for large alphabets . . . . 201--207
         Bertrand M. T. Lin and   
                    F. J. Hwang   Total completion time minimization in a
                                  $2$-stage differentiation flowshop with
                                  fixed sequences per job type . . . . . . 208--212
            Anna Gál and   
                 Jing-Tang Jang   The size and depth of layered Boolean
                                  circuits . . . . . . . . . . . . . . . . 213--217
                Hiroki Morizumi   Improved approximation algorithms for
                                  minimum AND-circuits problem via $k$-set
                                  cover  . . . . . . . . . . . . . . . . . 218--221
   Stephan Dominique Andres and   
     Winfried Hochstättler   The game chromatic number and the game
                                  colouring number of classes of oriented
                                  cactuses . . . . . . . . . . . . . . . . 222--226
             Benjamin Doerr and   
                   Mahmoud Fouz   Quasi-random rumor spreading: Reducing
                                  randomness can be costly . . . . . . . . 227--230
    Francesco M. Malvestuto and   
              Mauro Mezzini and   
               Marina Moscarini   Computing simple-path convex hulls in
                                  hypergraphs  . . . . . . . . . . . . . . 231--234
                   Xie-Bin Chen   Parallel construction of optimal
                                  independent spanning trees on Cartesian
                                  product of complete graphs . . . . . . . 235--238
             Pilu Crescenzi and   
            Miriam Di Ianni and   
              Andrea Marino and   
          Donatella Merlini and   
             Gianluca Rossi and   
                    Paola Vocca   Smooth movement and Manhattan path based
                                  Random Waypoint mobility . . . . . . . . 239--246
         Kishan Chand Gupta and   
               Yassir Nawaz and   
                     Guang Gong   Upper bound for algebraic immunity on a
                                  subclass of Maiorana McFarland class of
                                  bent functions . . . . . . . . . . . . . 247--249
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 6, February 15, 2011

        N. S. Narayanaswamy and   
              C. R. Subramanian   Dominating set based exact algorithms
                                  for $3$-coloring . . . . . . . . . . . . 251--255
                 Yong Zhang and   
               Weiguo Zhang and   
                  Weijun Xu and   
                      Hongyi Li   A risk-reward model for the on-line
                                  leasing of depreciable equipment . . . . 256--261
            Iratxe Soraluze and   
    Roberto Cortiñas and   
           Alberto Lafuente and   
               Mikel Larrea and   
                 Felix Freiling   Communication-efficient failure
                                  detection and consensus in omission
                                  environments . . . . . . . . . . . . . . 262--268
                Guofeng Yan and   
               Jianxin Wang and   
                   Shuhong Chen   Performance analysis for $ (\mathcal
                                  {X}, \mathcal {S}) $-bottleneck cell in
                                  large-scale wireless networks  . . . . . 269--277
            Francisco Ortin and   
           Miguel García   Union and intersection types to support
                                  both dynamic and static typing . . . . . 278--286
               Anna Fiedorowicz   Acyclic edge colourings of graphs with
                                  the number of edges linearly bounded by
                                  the number of vertices . . . . . . . . . 287--290
          Maxime Crochemore and   
                German Tischler   Computing Longest Previous
                                  non-overlapping Factors  . . . . . . . . 291--295
                   Guy Even and   
               Guy Kortsarz and   
                     Zeev Nutov   A $ 1.5$-approximation algorithm for
                                  augmenting edge-connectivity of a graph
                                  from $1$ to $2$  . . . . . . . . . . . . 296--300
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 7, March 1, 2011

                Heeheon Kim and   
                     Yookun Cho   A new fair scheduling algorithm for
                                  periodic tasks on multiprocessors  . . . 301--309
                Paolo Boldi and   
               Sebastiano Vigna   $ E = I + T $ : The internal extent
                                  formula for compacted tries  . . . . . . 310--313
                   Dustin Moody   Using $5$-isogenies to quintuple points
                                  on elliptic curves . . . . . . . . . . . 314--317
            Yung-Hsing Peng and   
            Chang-Biau Yang and   
           Chiou-Ting Tseng and   
                   Chiou-Yi Hor   The indexing for one-dimensional
                                  proportionally-scaled strings  . . . . . 318--322
      Raphaël Clifford and   
                 Alexandru Popa   Maximum subset intersection  . . . . . . 323--325
              Therese Biedl and   
          Stephane Durocher and   
             Holger H. Hoos and   
                Shuang Luan and   
                 Jared Saia and   
                  Maxwell Young   A note on improving the performance of
                                  approximation algorithms for radiation
                                  therapy  . . . . . . . . . . . . . . . . 326--333
                    Moonju Park   Comments on ``Generalized rate monotonic
                                  schedulability bounds using relative
                                  period ratios''  . . . . . . . . . . . . 334--337
                   Martin Lange   $P$-hardness of the emptiness problem
                                  for visibly pushdown languages . . . . . 338--341
                     Adam Roman   The NP-completeness of the Road Coloring
                                  Problem  . . . . . . . . . . . . . . . . 342--347
                     Liyu Zhang   Proof system representations of degrees
                                  of disjoint NP-pairs . . . . . . . . . . 348--351
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 8, March 15, 2011

                 T. Shafiei and   
   M. R. Hoseiny-Farahabady and   
                A. Movaghar and   
                H. Sarbazi-Azad   On pancyclicity properties of OTIS-mesh  353--359
                  Meijie Ma and   
                     Liying Zhu   The super connectivity of exchanged
                                  hypercubes . . . . . . . . . . . . . . . 360--364
           Satoshi Hanamura and   
                  Shigeki Iwata   Posets with seven linear extensions
                                  sortable by three comparisons  . . . . . 365--369
                    Jing Li and   
               Shiying Wang and   
                         Di Liu   Pancyclicity of ternary $n$-cube
                                  networks under the conditional fault
                                  model  . . . . . . . . . . . . . . . . . 370--374
                 Ping-Ying Tsai   A note on an optimal result on
                                  fault-tolerant cycle-embedding in
                                  alternating group graphs . . . . . . . . 375--378
                Jehn-Ruey Jiang   Nondominated local coteries for resource
                                  allocation in grids and clouds . . . . . 379--384
             Petros Drineas and   
             Anastasios Zouzias   A note on element-wise matrix
                                  sparsification via a matrix-valued
                                  Bernstein inequality . . . . . . . . . . 385--389
                     Yin Li and   
            Gong-liang Chen and   
                    Jian-hua Li   Speedup of bit-parallel Karatsuba
                                  multiplier in $ \mathrm {GF}(2^m) $
                                  generated by trinomials  . . . . . . . . 390--394
                  Ha Quang Minh   The regularized least squares algorithm
                                  and the problem of learning halfspaces   395--401
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 9, April 1, 2011

               Sizhong Zhou and   
                 Jiashang Jiang   Toughness and $ (a, b, k)$-critical
                                  graphs . . . . . . . . . . . . . . . . . 403--407
                 Luca Aceto and   
     David de Frutos Escrig and   
Carlos Gregorio-Rodríguez and   
             Anna Ingolfsdottir   Complete and ready simulation semantics
                                  are not finitely based over BCCSP, even
                                  with a singleton alphabet  . . . . . . . 408--413
              Dragana Bajic and   
                   Alister Burr   Comments on ``Integer SEC--DED codes for
                                  low power communications'' [Inform.
                                  Process. Lett. \bf 110 (2010) 518--520]  414--415
                   Fan Yang and   
                    Xiangwen Li   Nowhere-zero $3$-flows in dihedral
                                  Cayley graphs  . . . . . . . . . . . . . 416--419
            Narad Rampersad and   
            Jeffrey Shallit and   
                  Ming-wei Wang   Inverse star, borders, and palstars  . . 420--422
                   Xiao Min and   
                   Jing Liu and   
                    Yuqing Wang   Optimal semi-online algorithms for
                                  scheduling problems with reassignment on
                                  two identical machines . . . . . . . . . 423--428
                 Philippe Moser   A zero-one SUBEXP-dimension law for BPP  429--432
                   Madars Virza   Sensitivity versus block sensitivity of
                                  Boolean functions  . . . . . . . . . . . 433--435
      Tomá\vs Kulich and   
    Miroslava Keme\vnová   On the paper of Pascal Schweitzer
                                  concerning similarities between
                                  incompressibility methods and the Lovász
                                  Local Lemma  . . . . . . . . . . . . . . 436--439
                    Min Gao and   
                 Zhongfu Wu and   
                     Feng Jiang   Userrank for item-based collaborative
                                  filtering recommendation . . . . . . . . 440--446
           Ajay D. Kshemkalyani   Repeated detection of conjunctive
                                  predicates in distributed executions . . 447--452
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 10, April 30, 2011

             Javier Herranz and   
        Fabien Laguillaumie and   
                 Carla R\`afols   Relations between semantic security and
                                  anonymity in identity-based encryption   453--460
                 Xu An Wang and   
                  Jian Weng and   
              Xiaoyuan Yang and   
                  Yanjiang Yang   Cryptanalysis of an identity based
                                  broadcast encryption scheme without
                                  random oracles . . . . . . . . . . . . . 461--464
           Yusuke Matsumoto and   
           Naoyuki Kamiyama and   
                     Keiko Imai   An approximation algorithm dependent on
                                  edge-coloring number for minimum maximal
                                  matching problem . . . . . . . . . . . . 465--468
                  Fanica Gavril   Algorithms for induced biclique
                                  optimization problems  . . . . . . . . . 469--473
                   Jaechul Sung   Differential cryptanalysis of
                                  eight-round SEED . . . . . . . . . . . . 474--478
               Klaus Jansen and   
              Roberto Solis-Oba   A simple OPT +1 algorithm for cutting
                                  stock under the modified integer
                                  round-up property assumption . . . . . . 479--482
Carles Martínez-García and   
  Guillermo Navarro-Arribas and   
                   Joan Borrell   Fuzzy Role-Based Access Control  . . . . 483--487
              Tiancheng Lou and   
               Xiaoming Sun and   
             Christophe Tartary   Bounds and trade-offs for Double-Base
                                  Number Systems . . . . . . . . . . . . . 488--493
              Chunming Tang and   
                  Maozhi Xu and   
                     Yanfeng Qi   Faster pairing computation on genus $2$
                                  hyperelliptic curves . . . . . . . . . . 494--499
                 D. Kirsten and   
                       K. Quaas   Recognizability of the support of
                                  recognizable series over the semiring of
                                  the integers is undecidable  . . . . . . 500--502
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 11, May 15, 2011

              Mei-jiao Duan and   
                        Jing Xu   An efficient location-based
                                  compromise-tolerant key management
                                  scheme for sensor networks . . . . . . . 503--507
                 Anne Berry and   
             Romain Pogorelcnik   A simple algorithm to generate the
                                  minimal separators and the maximal
                                  cliques of a chordal graph . . . . . . . 508--511
     Jean-Philippe Aumasson and   
             Raphael C.-W. Phan   On the cryptanalysis of the hash
                                  function Fugue: Partitioning and
                                  inside-out distinguishers  . . . . . . . 512--515
           Szymon Grabowski and   
                Simone Faro and   
             Emanuele Giaquinta   String matching with inversions and
                                  translocations in linear average time
                                  (most of the time) . . . . . . . . . . . 516--520
         Alberto Apostolico and   
            Manuel Barbares and   
                   Cinzia Pizzi   Speedup for a periodic subgraph miner    521--523
                 Xixian Han and   
               Jianzhong Li and   
                   Donghua Yang   Supporting early pruning in top-$k$
                                  query processing on massive data . . . . 524--532
             Sven O. Krumke and   
                Clemens Thielen   Minimum cost flows with minimum
                                  quantities . . . . . . . . . . . . . . . 533--537
                Xiaozhou Li and   
                 Atri Rudra and   
                Ram Swaminathan   Flexible coloring  . . . . . . . . . . . 538--540
             Toufik Mansour and   
              Ghalib Nassar and   
             Vincent Vajnovszki   Loop-free Gray code algorithm for the
                                  $e$-restricted growth functions  . . . . 541--544
                     Li Yan and   
                  Marek Chrobak   Approximation algorithms for the
                                  Fault-Tolerant Facility Placement
                                  problem  . . . . . . . . . . . . . . . . 545--549
Víctor Lavín Puente   Learning a subclass of $k$-quasi-Horn
                                  formulas with membership queries . . . . 550--555

Information Processing Letters
Volume 111, Number 12, June 15, 2011

             Zheng-Zhong Du and   
                    Jun-Ming Xu   A note on cycle embedding in hypercubes
                                  with faulty vertices . . . . . . . . . . 557--560
                 Wujun Zhou and   
                 Jianxi Fan and   
                Xiaohua Jia and   
                   Shukui Zhang   The spined cube: a new hypercube variant
                                  with smaller diameter  . . . . . . . . . 561--567
        Alexander Thomasian and   
                         Jun Xu   $X$-code double parity array operation
                                  with two disk failures . . . . . . . . . 568--574
                Shisheng Li and   
              Jinjiang Yuan and   
                   Baoqiang Fan   Unbounded parallel-batch scheduling with
                                  family jobs and delivery coordination    575--582
             Sajjad Mahmood and   
                     Azhar Khan   An industrial study on the importance of
                                  software component documentation: a
                                  system integrator's perspective  . . . . 583--590
          Ruy Fabila-Monroy and   
             Clemens Huemer and   
                   Dolores Lara   A combinatorial property on angular
                                  orders of plane point sets . . . . . . . 591--594
               Takashi Saso and   
           Kojiro Kobayashi and   
             Atsuyoshi Nakamura   On the possible patterns of inputs for
                                  block sorting in the Burrows--Wheeler
                                  transformation . . . . . . . . . . . . . 595--599
     Alan Joseph J. Caceres and   
             Samantha Daley and   
               John DeJesus and   
             Michael Hintze and   
               Diquan Moore and   
             Katherine St. John   Walks in phylogenetic treespace  . . . . 600--604
                Eugen Zalinescu   Shorter strings containing all
                                  $k$-element permutations . . . . . . . . 605--608
               Jianghan Zhu and   
                Xiaomin Zhu and   
                 Jianqing Jiang   Improving adaptivity and fairness of
                                  processing real-time tasks with QoS
                                  requirements on clusters through dynamic
                                  scheduling . . . . . . . . . . . . . . . 609--613
             Javier Esparza and   
               Pierre Ganty and   
              Stefan Kiefer and   
           Michael Luttenberger   Parikh's theorem: a simple and direct
                                  automaton construction . . . . . . . . . 614--619
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc

Information Processing Letters
Volume 111, Number 13, July 1, 2011

                  Feng Wang and   
                    Wensong Lin   Group path covering and distance two
                                  labeling of graphs . . . . . . . . . . . 621--625
        Rob J. van Glabbeek and   
               Ursula Goltz and   
          Jens-Wolfhard Schicke   Abstract processes of place/transition
                                  systems  . . . . . . . . . . . . . . . . 626--633
                Yongge Wang and   
                    Yvo Desmedt   Edge-colored graphs with applications to
                                  homogeneous faults . . . . . . . . . . . 634--641
                  Jeroen Ketema   Counterexamples in infinitary rewriting
                                  with non-fully-extended rules  . . . . . 642--646
                        Yian Xu   On acyclic edge coloring of toroidal
                                  graphs . . . . . . . . . . . . . . . . . 647--649
              V. Vajnovszki and   
                      R. Vernay   Restricted compositions and
                                  permutations: From old to new Gray codes 650--655
            Andrey Bogdanov and   
                Kyoji Shibutani   Analysis of $3$-line generalized Feistel
                                  networks with double SD-functions  . . . 656--660
                 Han-Yu Lin and   
             Chien-Lung Hsu and   
                 Shih-Kun Huang   Improved convertible authenticated
                                  encryption scheme with provable security 661--666
Katarína Cechlárová and   
    Eva Jelínková   An efficient implementation of the
                                  equilibrium algorithm for housing
                                  markets with duplicate houses  . . . . . 667--670
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 14, July 31, 2011

               Oren Weimann and   
                    David Peleg   A note on exact distance labeling  . . . 671--673
         Mikhail J. Atallah and   
               Timothy W. Duket   Pattern matching in the Hamming distance
                                  with thresholds  . . . . . . . . . . . . 674--677
              Wenming Zhang and   
                 Yinfeng Xu and   
              Feifeng Zheng and   
                       Ming Liu   Online algorithms for the general
                                  $k$-search problem . . . . . . . . . . . 678--682
                 Jianhua Tu and   
                     Wenli Zhou   A factor $2$ approximation algorithm for
                                  the vertex cover $ P_3$ problem  . . . . 683--686
                     Peter Nose   Security weaknesses of authenticated key
                                  agreement protocols  . . . . . . . . . . 687--696
Konstanty Junosza-Szaniawski and   
                Pawel Rzazewski   On the complexity of exact algorithm for
                                  $ L(2, 1) $-labeling of graphs . . . . . 697--701
              Jinshan Zhang and   
                 Heng Liang and   
                   Fengshan Bai   Approximating partition functions of the
                                  two-state spin system  . . . . . . . . . 702--710
Manfred Schmidt-Schauß and   
                David Sabel and   
               Elena Machkasova   Counterexamples to applicative
                                  simulation and extensionality in
                                  non-deterministic call-by-need
                                  lambda-calculi with letrec . . . . . . . 711--716
      Sebastian Böcker and   
                Peter Damaschke   Even faster parameterized cluster
                                  deletion and cluster editing . . . . . . 717--721
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 15, August 15, 2011

                 Debajyoti Bera   A lower bound method for quantum
                                  circuits . . . . . . . . . . . . . . . . 723--726
                Marek Cygan and   
                 Lukasz Kowalik   Channel assignment via fast zeta
                                  transform  . . . . . . . . . . . . . . . 727--730
                 Marek Adamczyk   Improved analysis of the greedy
                                  algorithm for stochastic matching  . . . 731--737
                   Olivia Oanea   Boundedness of adaptive nets is
                                  decidable  . . . . . . . . . . . . . . . 738--743
                 Qiang Tang and   
                     Liqun Chen   Extended KCI attack against two-party
                                  key establishment protocols  . . . . . . 744--747
          Hervé Hocquard   Graphs with maximum degree $6$ are
                                  acyclically $ 11$-colorable  . . . . . . 748--753
             Foto N. Afrati and   
                 Sara Cohen and   
                  Gabriel Kuper   On the complexity of tree pattern
                                  containment with arithmetic comparisons  754--760
                  Chen Yuan and   
                     Haibin Kan   Holographic reduction for some counting
                                  problems . . . . . . . . . . . . . . . . 761--766
                    Qian Wu and   
                   Qiuli Lu and   
                  Yingqian Wang   $ (\Delta + 1) $-total-colorability of
                                  plane graphs of maximum degree $ \Delta
                                  \geq 6 $ with neither chordal $5$-cycle
                                  nor chordal $6$-cycle  . . . . . . . . . 767--772
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 16, August 30, 2011

                 Yong Zhang and   
                 Zhuo Chang and   
         Francis Y. L. Chin and   
             Hing-Fung Ting and   
                   Yung H. Tsin   Uniformly inserting points on square
                                  grid . . . . . . . . . . . . . . . . . . 773--779
                  Chenfu Yi and   
                Yuhuan Chen and   
                  Zhongliang Lu   Improved gradient-based neural networks
                                  for online solution of Lyapunov matrix
                                  equation . . . . . . . . . . . . . . . . 780--786
          Alberto Policriti and   
           Alexandru I. Tomescu   Counting extensional acyclic digraphs    787--791
                  S. Geetha and   
                 V. Kabilan and   
         S. P. Chockalingam and   
                     N. Kamaraj   Varying radix numeral system based
                                  adaptive image steganography . . . . . . 792--797
                Cuixia Miao and   
              Yuzhong Zhang and   
                    Zhigang Cao   Bounded parallel-batch scheduling on
                                  single and multi machines for
                                  deteriorating jobs . . . . . . . . . . . 798--803
                Matei David and   
Periklis A. Papakonstantinou and   
        Anastasios Sidiropoulos   How strong is Nisan's pseudo-random
                                  generator? . . . . . . . . . . . . . . . 804--808
                   M. S. Li and   
                 W. J. Tang and   
                   Q. H. Wu and   
                 J. R. Saunders   Paired-bacteria optimiser --- a simple
                                  and fast algorithm . . . . . . . . . . . 809--813
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
            Venkatesh Raman and   
                  Saket Saurabh   Subexponential algorithms for partial
                                  cover problems . . . . . . . . . . . . . 814--818
          Giorgio Lucarelli and   
                  Ioannis Milis   Improved approximation algorithms for
                                  the Max Edge-Coloring problem  . . . . . 819--823
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 17, September 15, 2011

       Christos Koukouvinos and   
          Veronika Pillwein and   
          Dimitris E. Simos and   
     Zafeirakis Zafeirakopoulos   On the average complexity for the
                                  verification of compatible sequences . . 825--830
                 Haifeng Xu and   
                   Lin Chen and   
                   Deshi Ye and   
                 Guochuan Zhang   Scheduling on two identical machines
                                  with a speed-up resource . . . . . . . . 831--835
               Jianfeng Hou and   
            Nicolas Roussel and   
                   Jianliang Wu   Acyclic chromatic index of planar graphs
                                  with triangles . . . . . . . . . . . . . 836--840
                Hoda Taheri and   
        Peyman Neamatollahi and   
            Mahmoud Naghibzadeh   A hybrid token-based distributed mutual
                                  exclusion algorithm using wraparound
                                  two-dimensional array logical topology   841--847
                Alan Frieze and   
            Páll Melsted   Randomly coloring simple hypergraphs . . 848--853
       Domingo Gómez and   
            Jaime Gutierrez and   
             Álvar Ibeas   On the linear complexity of the
                                  Naor--Reingold sequence  . . . . . . . . 854--856
                    Yu Zong and   
                Guandong Xu and   
                   Ping Jin and   
              Yanchun Zhang and   
                    Enhong Chen   HC\_AB: a new heuristic clustering
                                  algorithm based on Approximate Backbone  857--863
               Rena Bakhshi and   
        Jörg Endrullis and   
                Wan Fokkink and   
                       Jun Pang   Fast leader election in anonymous rings
                                  with bounded expected delay  . . . . . . 864--870
                Weifeng Gao and   
                    Sanyang Liu   Improved artificial bee colony algorithm
                                  for global optimization  . . . . . . . . 871--882
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 18, September 30, 2011

                 Zhenfu Cao and   
              Ivan Visconti and   
                 Zongyang Zhang   On constant-round concurrent
                                  non-malleable proof systems  . . . . . . 883--890
            Hirotoshi Honma and   
                  Kodai Abe and   
               Shigeru Masuyama   Erratum and addendum to ``A linear time
                                  algorithm for finding all hinge vertices
                                  of a permutation graph'' [Information
                                  Processing Letters \bf 59 (2) (1996)
                                  103--107]  . . . . . . . . . . . . . . . 891--894
                   Yuval Filmus   Lower bounds for context-free grammars   895--898
              Xiang-Lan Cao and   
               Spela Brglez and   
             Simon Spacapan and   
                    Elkin Vumar   On edge connectivity of direct products
                                  of graphs  . . . . . . . . . . . . . . . 899--902
              Guiqing Zhang and   
           Chung Keung Poon and   
                     Yinfeng Xu   The ski-rental problem with multiple
                                  discount options . . . . . . . . . . . . 903--906
                  Wenhua Li and   
                  Jinjiang Yuan   Online scheduling on unbounded
                                  parallel-batch machines to minimize
                                  maximum flow-time  . . . . . . . . . . . 907--911
               Shlomi Dolev and   
                Swan Dubois and   
       Maria Potop-Butucaru and   
       Sébastien Tixeuil   Stabilizing data-link over non-FIFO
                                  channels with optimal fault-resilience   912--920
              M. Arockiaraj and   
                Paul Manuel and   
            Indra Rajasingh and   
                  Bharati Rajan   Wirelength of $1$-fault Hamiltonian
                                  graphs into wheels and fans  . . . . . . 921--925
              Hai-zhong Shi and   
               Pan-feng Niu and   
                     Jian-bo Lu   One conjecture of bubble-sort graphs . . 926--929
     Verónica Becher and   
             Pablo Ariel Heiber   On extending de Bruijn sequences . . . . 930--932
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 19, October 15, 2011

          Gerold Jäger and   
               Marcin Peczarski   The number of pessimistic guesses in
                                  Generalized Black-peg Mastermind . . . . 933--940
             Rafael Grimson and   
                Joos Heintz and   
                  Bart Kuijpers   Efficient evaluation of specific queries
                                  in constraint databases  . . . . . . . . 941--944
                  Palash Sarkar   Tweakable enciphering schemes using only
                                  the encryption function of a block
                                  cipher . . . . . . . . . . . . . . . . . 945--955
               Dae Hyun Yum and   
                  Pil Joong Lee   On the average cost of order-preserving
                                  encryption based on hypergeometric
                                  distribution . . . . . . . . . . . . . . 956--959
                  R. B. Sandeep   Perfectly colorable graphs . . . . . . . 960--961
                    Daniel Oron   Scheduling a batching machine with
                                  convex resource consumption functions    962--967
Víctor Lavín Puente and   
               Montserrat Hermo   Negative results on learning multivalued
                                  dependencies with queries  . . . . . . . 968--972
               Ching-Lueh Chang   Triggering cascades on undirected
                                  connected graphs . . . . . . . . . . . . 973--978
                Zhenpeng Xu and   
              Chaoguang Men and   
                  Weiwei Li and   
                       Xiang Li   Checkpoint scheduling model for
                                  optimality . . . . . . . . . . . . . . . 979--984
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 20, October 31, 2011

               Chunyan Zhao and   
                  Zhiming Zheng   Threshold behaviors of a random
                                  constraint satisfaction problem with
                                  exact phase transitions  . . . . . . . . 985--988
             Mnacho Echenim and   
                Nicolas Peltier   Modular instantiation schemes  . . . . . 989--993
             Manoj G. Dixit and   
                  S. Ramesh and   
                Pallab Dasgupta   Some results on Parametric Temporal
                                  Logic  . . . . . . . . . . . . . . . . . 994--998
                 Barnaby Martin   Low-level dichotomy for quantified
                                  constraint satisfaction problems . . . . 999--1003
                  Xia Zhang and   
                    Guizhen Liu   On edge covering colorings of graphs . . 1004--1006
               Helmut Seidl and   
             Andreas Reuß   Extending $ H_1 $-clauses with
                                  disequalities  . . . . . . . . . . . . . 1007--1013
                Chih-Jen Wu and   
                Yu-Wei Chen and   
                    Yue-Li Wang   The minimum bandwidth required at each
                                  time slot of the fast broadcasting
                                  scheme . . . . . . . . . . . . . . . . . 1014--1018
                  Bing Wang and   
                  Jian-Liang Wu   Total coloring of planar graphs with
                                  maximum degree $7$ . . . . . . . . . . . 1019--1021
                Kejia Zhang and   
                   Hong Gao and   
                   Jianzhong Li   Finding multiple induced disjoint paths
                                  in general graphs  . . . . . . . . . . . 1022--1026
            Paola Flocchini and   
             David Ilcinkas and   
               Andrzej Pelc and   
                 Nicola Santoro   How many oblivious robots can explore a
                                  line . . . . . . . . . . . . . . . . . . 1027--1031
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 21--22, November 15, 2011

     Andreas Björklund and   
             Thore Husfeldt and   
              Petteri Kaski and   
                 Mikko Koivisto   Covering and packing in linear space . . 1033--1036
               Shuming Zhou and   
                    Jun-Ming Xu   Conditional fault tolerance of
                                  arrangement graphs . . . . . . . . . . . 1037--1043
              Che Wun Chiou and   
              Chiou-Yng Lee and   
                    Yun-Chi Yeh   Multiplexer implementation of
                                  low-complexity polynomial basis
                                  multiplier in $ {\rm GF}(m^2) $ using
                                  all one polynomial . . . . . . . . . . . 1044--1047
                    Ji Tian and   
                   Ruyan Fu and   
                  Jinjiang Yuan   An on-line algorithm for the single
                                  machine unbounded parallel-batching
                                  scheduling with large delivery times . . 1048--1053
           Rudolf Fleischer and   
                    Xiaoming Xu   Computing minimum diameter
                                  color-spanning sets is hard  . . . . . . 1054--1056
                 Raphael Yuster   A shortest cycle for each vertex of a
                                  graph  . . . . . . . . . . . . . . . . . 1057--1061
                    Hao Fan and   
            H. A. Kierstead and   
                Guizhen Liu and   
             Theodore Molla and   
              Jian-Liang Wu and   
                      Xin Zhang   A note on relaxed equitable coloring of
                                  graphs . . . . . . . . . . . . . . . . . 1062--1066
                 Bo-Yi Wang and   
                     Hsueh-I Lu   Two-dimensional homing sort  . . . . . . 1067--1071
                Richard S. Bird   A simple division-free algorithm for
                                  computing determinants . . . . . . . . . 1072--1074
                     Jens Vygen   Faster algorithm for optimum Steiner
                                  trees  . . . . . . . . . . . . . . . . . 1075--1079
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 111, Number 23--24, December 15, 2011

                 Kazuyuki Amano   Minterm-transitive functions with
                                  asymptotically smallest block
                                  sensitivity  . . . . . . . . . . . . . . 1081--1084
              Hong-Jian Lai and   
                     Hao Li and   
                    Ping Li and   
              Yanting Liang and   
                     Senmei Yao   Mod $ (2 p + 1)$-orientations in line
                                  graphs . . . . . . . . . . . . . . . . . 1085--1088
                 Michael Lampis   A kernel of order $ 2 k - c \log k $ for
                                  vertex cover . . . . . . . . . . . . . . 1089--1091
                  Erlin Yao and   
                Yungang Bao and   
                    Mingyu Chen   What Hill--Marty model learn from and
                                  break through Amdahl's law?  . . . . . . 1092--1095
           Guillaume Chapuy and   
                   Ines Klimann   On the supports of recognizable series
                                  over a field and a single letter
                                  alphabet . . . . . . . . . . . . . . . . 1096--1098
                Marek Cygan and   
           Marcin Pilipczuk and   
       Jakub Onufry Wojtaszczyk   Capacitated domination faster than $
                                  O(n^2) $ . . . . . . . . . . . . . . . . 1099--1103
              Zuosong Liang and   
                    Erfang Shan   Approximation algorithms for
                                  clique-transversal sets and
                                  clique-independent sets in cubic graphs  1104--1107
               M. P. Dobson and   
                   V. Leoni and   
                      G. Nasini   The multiple domination and limited
                                  packing problems in graphs . . . . . . . 1108--1113
              M. Malekimajd and   
   M. R. Hoseiny-Farahabady and   
                A. Movaghar and   
                H. Sarbazi-azad   Pancyclicity of OTIS (swapped) networks
                                  based on properties of the factor graph  1114--1119
            Anil Maheshwari and   
               Michiel Smid and   
                    Norbert Zeh   Low-interference networks in metric
                                  spaces of bounded doubling dimension . . 1120--1123
                Xiaofeng Gu and   
              Hong-Jian Lai and   
                     Senmei Yao   Characterization of minimally $ (2,
                                  \ell)$-connected graphs  . . . . . . . . 1124--1129
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Information Processing Letters
Volume 112, Number 1--2, January 15, 2012

      Mieczyslaw Borowiecki and   
          Jaroslaw Grytczuk and   
              Monika Pil\'sniak   Coloring chip configurations on graphs
                                  and digraphs . . . . . . . . . . . . . . 1--4
                Mingyu Xiao and   
              Hiroshi Nagamochi   An FPT algorithm for edge subset
                                  feedback edge set  . . . . . . . . . . . 5--9
               Maxim Sviridenko   A note on the Kenyon--Remila
                                  strip-packing algorithm  . . . . . . . . 10--12
                Ilya Sergey and   
                    Dave Clarke   A correspondence between type checking
                                  via reduction and type checking via
                                  evaluation . . . . . . . . . . . . . . . 13--20
                 Yong Zhang and   
         Francis Y. L. Chin and   
             Hing-Fung Ting and   
        Joseph Wun-Tat Chan and   
                    Xin Han and   
                  Ka-Cheong Lam   Online call control in cellular networks
                                  revisited  . . . . . . . . . . . . . . . 21--25
          Robert E. Jamison and   
              Darren A. Narayan   Max-optimal and sum-optimal labelings of
                                  graphs . . . . . . . . . . . . . . . . . 26--31
             Benjamin Doerr and   
                  Carola Winzen   Memory-restricted black-box complexity
                                  of OneMax  . . . . . . . . . . . . . . . 32--34
             Tatsuya Akutsu and   
         Avraham A. Melkman and   
                Takeyuki Tamura   Singleton and $2$-periodic attractors of
                                  sign-definite Boolean networks . . . . . 35--38
                 Rani Izsak and   
                     Zeev Nutov   A note on labeling schemes for graph
                                  connectivity . . . . . . . . . . . . . . 39--43
              Michael D. Barrus   Havel--Hakimi residues of unigraphs  . . 44--48
            Pranjal Awasthi and   
                 Avrim Blum and   
                     Or Sheffet   Center-based clustering under
                                  perturbation stability . . . . . . . . . 49--54
                   Sheng Yu and   
            Prudence W. H. Wong   A note on ``An optimal online algorithm
                                  for single machine scheduling to
                                  minimize total general completion time'' 55--58
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 3, January 31, 2012

             Reiko Takehara and   
         Masahiro Hachimori and   
                  Maiko Shigeno   A comment on pure-strategy Nash
                                  equilibria in competitive diffusion
                                  games  . . . . . . . . . . . . . . . . . 59--60
                   Xie-Bin Chen   Paired many-to-many disjoint path covers
                                  of hypercubes with faulty edges  . . . . 61--66
    Andreas Brandstädt and   
           Vassilis Giakoumakis   Maximum Weight Independent Sets in hole-
                                  and co-chair-free graphs . . . . . . . . 67--71
          Evgeny R. Gafarov and   
       Alexander A. Lazarev and   
                   Frank Werner   A note on a single machine scheduling
                                  problem with generalized total tardiness
                                  objective function . . . . . . . . . . . 72--76
        Phokion G. Kolaitis and   
                     Enela Pema   A dichotomy in the complexity of
                                  consistent query answering for queries
                                  with two atoms . . . . . . . . . . . . . 77--85
               Adam O. Kalinich   Flipping the winner of a poset game  . . 86--89
                  Jin-Ghoo Choi   Analysis of total average queue length
                                  in multi-hop wireless networks . . . . . 90--94
               Shiying Wang and   
                  Lei Zhang and   
                   Shangwei Lin   A neighborhood condition for graphs to
                                  be maximally $k$-restricted edge
                                  connected  . . . . . . . . . . . . . . . 95--97
                   Bart Mennink   Increasing the flexibility of the
                                  herding attack . . . . . . . . . . . . . 98--105
              Robin Houston and   
               Joseph White and   
                    Martyn Amos   Zen Puzzle Garden is NP-complete . . . . 106--108
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 4, February 15, 2012

                   A. Ahadi and   
                 A. Dehghan and   
                  M. Kazemi and   
                 E. Mollaahmadi   Computation of lucky number of planar
                                  graphs is NP-hard  . . . . . . . . . . . 109--112
       Janusz Dybizba\'nski and   
                     Anna Nenca   Oriented chromatic number of grids is
                                  greater than $7$ . . . . . . . . . . . . 113--117
              Shayan Ehsani and   
            Mohammad Ghodsi and   
          Ahmad Khajenezhad and   
               Hamid Mahini and   
                  Afshin Nikzad   Optimal online pricing with network
                                  externalities  . . . . . . . . . . . . . 118--123
                  Feng Wang and   
                    Wensong Lin   Group path covering and $ L(j, k)
                                  $-labelings of diameter two graphs . . . 124--128
               Xiaofan Yang and   
                   Lei Wang and   
                    Luxing Yang   Optimal broadcasting for locally twisted
                                  cubes  . . . . . . . . . . . . . . . . . 129--134
         Michal Kotrbcík   A note on disjoint cycles  . . . . . . . 135--137
                  Xin Zhang and   
                    Guizhen Liu   On edge colorings of $1$-planar graphs
                                  without adjacent triangles . . . . . . . 138--142
                       Jiyou Li   On the average sensitivity of the
                                  weighted sum function  . . . . . . . . . 143--148
                 Laszlo Csirmaz   Complexity of universal access
                                  structures . . . . . . . . . . . . . . . 149--152
         Nili Guttmann-Beck and   
                  Refael Hassin   Series-parallel orientations preserving
                                  the cycle-radius . . . . . . . . . . . . 153--160
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 5, February 28, 2012

        B. M. Ábrego and   
                  M. Cetina and   
           J. Leaños and   
                     G. Salazar   Visibility-preserving convexifications
                                  using single-vertex moves  . . . . . . . 161--163
              Norichika Matsuki   An analytic criterion for CSAT . . . . . 164--165
           Edward A. Hirsch and   
                Dmitry Itsykson   On an optimal randomized acceptor for
                                  graph nonisomorphism . . . . . . . . . . 166--171
             Sonia L. Rueda and   
                   Juana Sendra   On the performance of the approximate
                                  parametrization algorithm for curves . . 172--178
                    Shay Gueron   Speeding up CRC32C computations with
                                  Intel CRC32 instruction  . . . . . . . . 179--185
        Dorothea Baumeister and   
                Jörg Rothe   Taking the final step to a full
                                  dichotomy of the possible winner problem
                                  in pure scoring rules  . . . . . . . . . 186--190
 Joanna Skowronek-Kaziów   Multiplicative vertex-colouring
                                  weightings of graphs . . . . . . . . . . 191--194
                  Fang Tian and   
                    Zi-Long Liu   Probabilistic single obnoxious facility
                                  location with fixed budget . . . . . . . 195--199
              Martin Kochol and   
               Riste Skrekovski   Brooks' Theorem for generalized dart
                                  graphs . . . . . . . . . . . . . . . . . 200--204
                   Deke Guo and   
                Guiming Zhu and   
                    Hai Jin and   
               Panlong Yang and   
               Yingwen Chen and   
                Xianqing Yi and   
                    Junxian Liu   Möbius--de Bruijn: The product of Möbius
                                  cube and de Bruijn digraph . . . . . . . 205--211
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 6, March 15, 2012

                  Antti Valmari   Fast brief practical DFA minimization    213--217
         Alexander Golynski and   
   Alejandro López-Ortiz   Optimal strategies for the list update
                                  problem under the MRM alternative cost
                                  model  . . . . . . . . . . . . . . . . . 218--222
                  Noga Alon and   
                 Amit Weinstein   Local correction of juntas . . . . . . . 223--226
               Jinsoo Hwang and   
              Jeankyung Kim and   
                    Kichang Kim   Analysis of the false-positive error
                                  rate of tagged fragment marking scheme   227--232
                  Xiaoni Du and   
             Andrew Klapper and   
                  Zhixiong Chen   Linear complexity of pseudorandom
                                  sequences generated by Fermat quotients
                                  and their generalizations  . . . . . . . 233--237
                 Lukas Moll and   
              Siamak Tazari and   
                   Marc Thurley   Computing hypergraph width measures
                                  exactly  . . . . . . . . . . . . . . . . 238--242
                Bogdan Aman and   
                Gabriel Ciobanu   Properties of enhanced mobile membranes
                                  via coloured Petri nets  . . . . . . . . 243--248
                R. Crowston and   
                   G. Gutin and   
                   M. Jones and   
                         A. Yeo   Parameterized Eulerian strong component
                                  arc deletion problem on tournaments  . . 249--251
                     Cui Yu and   
               Xiaofan Yang and   
                LuXing Yang and   
                     Jing Zhang   Routing and wavelength assignment for
                                  $3$-ary $n$-cube in array-based optical
                                  network  . . . . . . . . . . . . . . . . 252--256
                        Or Meir   On the rectangle method in proofs of
                                  robustness of tensor products  . . . . . 257--260
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 7, March 31, 2012

               Amit Chakrabarti   A note on randomized streaming space
                                  bounds for the longest increasing
                                  subsequence problem  . . . . . . . . . . 261--263
              Yun-Ping Deng and   
                Xiao-Dong Zhang   Automorphism groups of the Pancake
                                  graphs . . . . . . . . . . . . . . . . . 264--266
          Vladimir V. Podolskii   Exponential lower bound for bounded
                                  depth circuits with few threshold gates  267--271
             Guillaume Blin and   
            Paola Bonizzoni and   
             Riccardo Dondi and   
                 Florian Sikora   On the parameterized complexity of the
                                  repetition free longest common
                                  subsequence problem  . . . . . . . . . . 272--276
                Rasmus Pagh and   
     Charalampos E. Tsourakakis   Colorful triangle counting and a
                                  MapReduce implementation . . . . . . . . 277--281
                Xiaomin Zhu and   
                    Hao Guo and   
            Shaoshuai Liang and   
                  Xiaoling Yang   An improved security-aware packet
                                  scheduling algorithm in real-time
                                  wireless networks  . . . . . . . . . . . 282--288
            Andris Ambainis and   
             Abuzer Yakaryilmaz   Superiority of exact quantum automata
                                  for promise problems . . . . . . . . . . 289--291
                  Wenhua Li and   
              Zhenkun Zhang and   
                    Sufang Yang   Online algorithms for scheduling unit
                                  length jobs on parallel-batch machines
                                  with lookahead . . . . . . . . . . . . . 292--297
               Iksoon Hwang and   
           Nina Yevtushenko and   
                    Ana Cavalli   Tight bound on the length of
                                  distinguishing sequences for
                                  non-observable nondeterministic
                                  Finite-State Machines with a polynomial
                                  number of inputs and outputs . . . . . . 298--301
               Liting Zhang and   
                 Wenling Wu and   
                  Peng Wang and   
                       Bo Liang   TrCBC: Another look at CBC-MAC . . . . . 302--307
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 8--9, April 30, 2012

               James Aspnes and   
                     Yitong Yin   Randomized load balancing by joining and
                                  splitting bins . . . . . . . . . . . . . 309--313
         Fabiano C. Botelho and   
           Nicholas Wormald and   
                  Nivio Ziviani   Cores of random $r$-partite hypergraphs  314--319
           Clemens Dubslaff and   
             Christel Baier and   
                   Manuela Berg   Model checking probabilistic systems
                                  against pushdown specifications  . . . . 320--328
Jean-François Couturier and   
                 Dieter Kratsch   Bicolored independent sets and bicliques 329--334
                David Clark and   
              Robert M. Hierons   Squeeziness: an information theoretic
                                  measure for avoiding fault masking . . . 335--340
Manfred Schmidt-Schauß and   
                Georg Schnitger   Fast equality test for straight-line
                                  compressed strings . . . . . . . . . . . 341--345
        Mereke van Garderen and   
            Giuseppe Liotta and   
                    Henk Meijer   Universal point sets for $2$-coloured
                                  trees  . . . . . . . . . . . . . . . . . 346--350
             Oded Goldreich and   
                        Or Meir   The tensor product of two good codes is
                                  not necessarily robustly testable  . . . 351--355
            Tibor Jordán   Highly connected molecular graphs are
                                  rigid in three dimensions  . . . . . . . 356--359
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 10, May 31, 2012

                      Yu Li and   
                 Dachuan Xu and   
                 Donglei Du and   
                     Naihua Xiu   Improved approximation algorithms for
                                  the robust fault-tolerant facility
                                  location problem . . . . . . . . . . . . 361--364
             Masao Kumamoto and   
                    Eiji Miyano   Optimal distortion embedding of complete
                                  binary trees into lines  . . . . . . . . 365--370
 Vince Bárány and   
            Mikolaj Boja\'nczyk   Finite satisfiability for guarded
                                  fixpoint logic . . . . . . . . . . . . . 371--375
         Stanley P. Y. Fung and   
           Chung Keung Poon and   
              Duncan K. W. Yung   On-line scheduling of equal-length
                                  intervals on parallel machines . . . . . 376--379
        João Barreto and   
          Luís Veiga and   
                 Paulo Ferreira   Hash challenges: Stretching the limits
                                  of compare-by-hash in distributed data
                                  deduplication  . . . . . . . . . . . . . 380--385
                 Michael Thomas   On the applicability of Post's lattice   386--391
                  Beibei Ma and   
            Baoyindureng Wu and   
                  Wanping Zhang   Proximity and average eccentricity of a
                                  graph  . . . . . . . . . . . . . . . . . 392--395
                Gaocai Wang and   
                Guojun Wang and   
                  Zhiguang Shan   Fault tolerance analysis of mesh
                                  networks with uniform versus nonuniform
                                  node failure probability . . . . . . . . 396--401
                Hechao Wang and   
                Erfang Shan and   
                       Wei Wang   On the super connectivity of Kronecker
                                  products of graphs . . . . . . . . . . . 402--405
                    Jing He and   
                   Hongyu Liang   On rainbow-$k$-connectivity of random
                                  graphs . . . . . . . . . . . . . . . . . 406--410
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 11, June 15, 2012

   Anish Man Singh Shrestha and   
               Satoshi Tayu and   
                   Shuichi Ueno   Bandwidth of convex bipartite graphs and
                                  related graphs . . . . . . . . . . . . . 411--417
              Carla Binucci and   
              Ulrik Brandes and   
       Giuseppe Di Battista and   
              Walter Didimo and   
             Marco Gaertler and   
           Pietro Palladino and   
        Maurizio Patrignani and   
          Antonios Symvonis and   
                Katharina Zweig   Drawing trees in a streaming model . . . 418--422
            Sebastian Deorowicz   Quadratic-time algorithm for a string
                                  constrained LCS problem  . . . . . . . . 423--426
                Qingju Wang and   
                Andrey Bogdanov   The provable constructive effect of
                                  diffusion switching mechanism in
                                  CLEFIA-type block ciphers  . . . . . . . 427--432
                  Leena Salmela   Average complexity of backward $q$-gram
                                  string matching algorithms . . . . . . . 433--437
               Ashley Montanaro   The quantum query complexity of learning
                                  multilinear polynomials  . . . . . . . . 438--442
             Zongyang Zhang and   
                     Zhenfu Cao   Concurrent non-malleable statistically
                                  hiding commitment  . . . . . . . . . . . 443--448
                Qiang Cheng and   
                  Feng Chen and   
                   Wenli Xu and   
                      Song Wang   Recursive sum-product algorithm for
                                  generalized outer-planar graphs  . . . . 449--456
                   Pavel Hrubes   On the nonnegative rank of distance
                                  matrices . . . . . . . . . . . . . . . . 457--461
                 Qiping Lin and   
                  Fangguo Zhang   Efficient precomputation schemes of $ k
                                  P + I Q $  . . . . . . . . . . . . . . . 462--466
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 12, June 30, 2012

     Yoann Dieudonné and   
                   Andrzej Pelc   Deterministic network exploration by a
                                  single agent with Byzantine tokens . . . 467--470
              Eduardo C. Xavier   A note on a Maximum $k$-Subset
                                  Intersection problem . . . . . . . . . . 471--472
                  Jian Wang and   
                  Xirong Xu and   
                  Dejun Zhu and   
                 Liqing Gao and   
                    Jun-Ming Xu   On the bounds of feedback numbers of $
                                  (n, k) $-star graphs . . . . . . . . . . 473--478
               Wen-Hung Kuo and   
                    Dar-Li Yang   A short note on ``Proportionate
                                  flowshops with general
                                  position-dependent processing times''    479--480
              Noam Goldberg and   
              Jonathan Eckstein   Sparse weighted voting classifier
                                  selection and its linear programming
                                  relaxations  . . . . . . . . . . . . . . 481--486
                    Amr Elmasry   On the size of the subset partial order  487--489
            Jan Krajícek   A note on SAT algorithms and proof
                                  complexity . . . . . . . . . . . . . . . 490--493
                  Chen Yuan and   
                   Qian Guo and   
                     Haibin Kan   A novel elementary construction of
                                  matching vectors . . . . . . . . . . . . 494--496
                    Chen Su and   
                    Haining Fan   Impact of Intel's new instruction sets
                                  on software implementation of $ {\rm
                                  GF}(2)[x] $ multiplication . . . . . . . 497--502
                  Wenjie Li and   
              Zhenkun Zhang and   
                Hailing Liu and   
                  Jinjiang Yuan   Online scheduling of equal-length jobs
                                  with incompatible families on multiple
                                  batch machines to maximize the weighted
                                  number of early jobs . . . . . . . . . . 503--508
            Indra Rajasingh and   
              Bharati Rajan and   
               R. Sundara Rajan   Embedding of hypercubes into necklace,
                                  windmill and snake graphs  . . . . . . . 509--515
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 13, July 15, 2012

            Chia-Jung Chang and   
                   Kun-Mao Chao   Efficient algorithms for local ranking   517--522
             Sven O. Krumke and   
                Clemens Thielen   Erratum to ``Minimum cost flows with
                                  minimum quantities'' [Information
                                  Processing Letters \bf 111 (11) (2011)
                                  533--537]  . . . . . . . . . . . . . . . 523--524
                   Zhengnan Shi   A self-stabilizing algorithm to maximal
                                  $2$-packing with improved complexity . . 525--531
                   Sergey Bereg   Computing generalized ham-sandwich cuts  532--534
             Konstantin Kutzkov   An exact exponential time algorithm for
                                  counting bipartite cliques . . . . . . . 535--539
              Reza Dorrigiv and   
   Alejandro López-Ortiz   List update with probabilistic locality
                                  of reference . . . . . . . . . . . . . . 540--543
                Daniel Turetsky   A $K$-trivial set which is not jump
                                  traceable at certain orders  . . . . . . 544--547
                Xingyu Yang and   
               Weiguo Zhang and   
                 Yong Zhang and   
                      Weijun Xu   Optimal randomized algorithm for a
                                  generalized ski-rental with interest
                                  rate . . . . . . . . . . . . . . . . . . 548--551
                B. S. Panda and   
                    Preeti Goel   $ L(2, 1) $ -labeling of dually chordal
                                  graphs and strongly orderable graphs . . 552--556
           Anna Fiedorowicz and   
             Mariusz Haluszczak   Acyclic chromatic indices of fully
                                  subdivided graphs  . . . . . . . . . . . 557--561
              Effat Farhana and   
                M. Sohel Rahman   Doubly-Constrained LCS and
                                  Hybrid-Constrained LCS problems
                                  revisited  . . . . . . . . . . . . . . . 562--565
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 14--15, August 15, 2012

                Petra Sparl and   
            Rafal Witkowski and   
                 Janez Zerovnik   A linear time algorithm for $ 7 - [3] $
                                  coloring triangle-free hexagonal graphs  567--571
          Daniel Reidenbach and   
               Markus L. Schmid   On multi-head automata with restricted
                                  nondeterminism . . . . . . . . . . . . . 572--577
              Dimitri Isaak and   
           Christof Löding   Efficient inclusion testing for simple
                                  classes of unambiguous $ \omega
                                  $-automata . . . . . . . . . . . . . . . 578--582
            Indra Rajasingh and   
         Micheal Arockiaraj and   
              Bharati Rajan and   
                    Paul Manuel   Minimum wirelength of hypercubes into
                                  $n$-dimensional grid networks  . . . . . 583--586
                    Min Xie and   
                     Libin Wang   One-round identity-based key exchange
                                  with Perfect Forward Security  . . . . . 587--591
                  S. Akshay and   
              Blaise Genest and   
Lo\"\ic Hélouët and   
                    Shaofa Yang   Regular set of representatives for
                                  time-constrained MSC graphs  . . . . . . 592--598
                 Qiang Dong and   
                Junlin Zhou and   
                     Yan Fu and   
                   Xiaofan Yang   Embedding a mesh of trees in the crossed
                                  cube . . . . . . . . . . . . . . . . . . 599--603
                  Xiaoni Du and   
              Zhixiong Chen and   
                         Lei Hu   Linear complexity of binary sequences
                                  derived from Euler quotients with
                                  prime-power modulus  . . . . . . . . . . 604--609
            Pavel Pudlák   A lower bound on the size of resolution
                                  proofs of the Ramsey theorem . . . . . . 610--611
              B. Srivathsan and   
               Igor Walukiewicz   An alternate proof of Statman's finite
                                  completeness theorem . . . . . . . . . . 612--616
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 16, August 31, 2012

                    David Duris   Some characterizations of $ \gamma $ and
                                  $ \beta $-acyclicity of hypergraphs  . . 617--620
       Sandra M. Hedetniemi and   
      Stephen T. Hedetniemi and   
                  Hao Jiang and   
              K. E. Kennedy and   
                 Alice A. McRae   A self-stabilizing algorithm for
                                  optimally efficient sets in graphs . . . 621--623
              Marine Minier and   
    María Naya-Plasencia   A related key impossible differential
                                  attack against $ 22 $ rounds of the
                                  lightweight block cipher LBlock  . . . . 624--629
              Walter Didimo and   
           Michael Kaufmann and   
            Giuseppe Liotta and   
             Yoshio Okamoto and   
               Andreas Spillner   Vertex angle and crossing angle
                                  resolution of leveled tree drawings  . . 630--635
              Ryo Yoshinaka and   
               Jun Kawahara and   
             Shuhei Denzumi and   
             Hiroki Arimura and   
               Shin-ichi Minato   Counterexamples to the long-standing
                                  conjecture on the complexity of BDD
                                  binary operations  . . . . . . . . . . . 636--640
                 Yuxin Wang and   
               Attila Benko and   
                   Xin Chen and   
    György Dósa and   
                     He Guo and   
                    Xin Han and   
              Cecilia Sik Lanyi   Online scheduling with one rearrangement
                                  at the end: Revisited  . . . . . . . . . 641--645
                  Pinhui Ke and   
                Shengyuan Zhang   New classes of quaternary cyclotomic
                                  sequence of length $ 2 p^m $ with high
                                  linear complexity  . . . . . . . . . . . 646--650
               Max Dietrich and   
         Catherine McCartin and   
                 Charles Semple   Bounding the maximum size of a minimal
                                  definitive set of quartets . . . . . . . 651--655
José M. Cañete-Valdeón   Annotating problem diagrams with
                                  architectural tactics for reasoning on
                                  quality requirements . . . . . . . . . . 656--661
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 17--18, September 30, 2012

             Claire Mathieu and   
                 Olga Ohrimenko   Lower bounds for randomized algorithms
                                  for online chain partitioning  . . . . . 663--666
             Oriol Farr\`as and   
             Ignacio Gracia and   
   Sebasti\`a Martín and   
            Carles Padró   Linear threshold multisecret sharing
                                  schemes  . . . . . . . . . . . . . . . . 667--673
                   E. Cheng and   
           L. Lipták and   
                     K. Qiu and   
                        Z. Shen   On deriving conditional diagnosability
                                  of interconnection networks  . . . . . . 674--677
                   Yun Feng and   
                    Wensong Lin   A proof of a conjecture on multiset
                                  coloring the powers of cycles  . . . . . 678--682
                   Hong Lai and   
               Jinghua Xiao and   
                 Lixiang Li and   
                    Yixian Yang   Recursive hiding of biometrics-based
                                  secret sharing scheme using adversary
                                  structure  . . . . . . . . . . . . . . . 683--687
             Tongquan Zhang and   
                       Ying Yin   The minimum spanning tree problem with
                                  non-terminal set . . . . . . . . . . . . 688--690
                        Ning Xu   Complexity of minimum corridor guarding
                                  problems . . . . . . . . . . . . . . . . 691--696
             Olivier Baudon and   
             Jakub Przybylo and   
              Mariusz Wo\'zniak   On minimal arbitrarily partitionable
                                  graphs . . . . . . . . . . . . . . . . . 697--700
                  Xing Chen and   
                   Juan Liu and   
                   Jixiang Meng   $ \lambda ' $-Optimality of Bipartite
                                  Digraphs . . . . . . . . . . . . . . . . 701--705
               Sunil Mathew and   
                  M. S. Sunitha   A characterization of partial blocks in
                                  weighted graphs  . . . . . . . . . . . . 706--710
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 19, October 15, 2012

               Hideo Bannai and   
               Travis Gagie and   
                Tomohiro I. and   
           Shunsuke Inenaga and   
              Gad M. Landau and   
               Moshe Lewenstein   An efficient algorithm to test
                                  square-freeness of strings compressed by
                                  straight-line programs . . . . . . . . . 711--714
             Franck van Breugel   On behavioural pseudometrics and closure
                                  ordinals . . . . . . . . . . . . . . . . 715--718
             Janusz Januszewski   On-line algorithms for $2$-space bounded
                                  $2$-dimensional bin packing  . . . . . . 719--722
            Min-Zheng Shieh and   
              Shi-Chun Tsai and   
                Ming-Chuan Yang   On the inapproximability of maximum
                                  intersection problems  . . . . . . . . . 723--727
                     Hongli Zhu   A two stage scheduling with
                                  transportation and batching  . . . . . . 728--731
                     Y. Xie and   
                    S. Tang and   
                    C. Tang and   
                       X. Huang   An efficient algorithm for
                                  parameterizing HsMM with Gaussian and
                                  Gamma distributions  . . . . . . . . . . 732--737
             F. Della Croce and   
                    C. Koulamas   A note on minimizing the sum of
                                  quadratic completion times on two
                                  identical parallel machines  . . . . . . 738--742
             Enrique Gerstl and   
                   Gur Mosheiov   Scheduling on parallel identical
                                  machines with job-rejection and
                                  position-dependent processing times  . . 743--747
                  Matias Korman   Minimizing interference in ad hoc
                                  networks with bounded communication
                                  radius . . . . . . . . . . . . . . . . . 748--752
     Chandrashekhar Meshram and   
        Suchitra A. Meshram and   
                   Mingwu Zhang   An ID-based cryptographic mechanisms
                                  based on GDLP and IFP  . . . . . . . . . 753--758
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 20, October 31, 2012

               Qiaoping Guo and   
                Shengjia Li and   
                 Ruijuan Li and   
                      Gaokui Xu   Pancyclic out-arcs of a vertex in
                                  oriented graphs  . . . . . . . . . . . . 759--761
                 Baruch Mor and   
                   Gur Mosheiov   Batch scheduling of identical jobs on
                                  parallel identical machines  . . . . . . 762--766
               Hong-Yu Chen and   
                   Jian-Ming Qi   The linear arboricity of planar graphs
                                  with maximum degree at least $5$ . . . . 767--771
                   Stasys Jukna   Clique problem, cutting plane proofs and
                                  communication complexity . . . . . . . . 772--777
              Justin Iwerks and   
          Joseph S. B. Mitchell   The art gallery theorem for simple
                                  polygons in terms of the number of
                                  reflex and convex vertices . . . . . . . 778--782
               Jaeheung Lee and   
               Seokhyun Kim and   
                 Yookun Cho and   
               Yoojin Chung and   
                    Yongsu Park   HORSIC: an efficient one-time signature
                                  scheme for wireless sensor networks  . . 783--787
                  Yi-Wei Ci and   
                 Zhan Zhang and   
               De-Cheng Zuo and   
                  Zhi-Bo Wu and   
                 Xiao-Zong Yang   A multi-cycle checkpointing protocol
                                  that ensures strict $1$-rollback . . . . 788--793
            Seung Geol Choi and   
                    Hoeteck Wee   Lossy trapdoor functions from
                                  homomorphic reproducible encryption  . . 794--798
    Mehrnoush Malekesmaeili and   
              Cedric Chauve and   
                  Tamon Stephen   A tight bound on the length of odd
                                  cycles in the incompatibility graph of a
                                  non-C1P matrix . . . . . . . . . . . . . 799--803
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 21, November 15, 2012

    Miodrag J. Mihaljevi\'c and   
        Sugata Gangopadhyay and   
                Goutam Paul and   
                    Hideki Imai   Internal state recovery of keystream
                                  generator LILI-128 based on a novel
                                  weakness of the employed Boolean
                                  function . . . . . . . . . . . . . . . . 805--810
                 E. Pasalic and   
                    W. G. Zhang   On multiple output bent functions  . . . 811--815
                     D. Pradhan   Algorithmic aspects of $k$-tuple total
                                  domination in graphs . . . . . . . . . . 816--822
               GuiPing Wang and   
                 ShuYu Chen and   
              XiaoQin Zhang and   
                      Zhen Zhou   Topological ordering algorithm for LDAG  823--828
         Raquel S. F. Bravo and   
             Sulamita Klein and   
          Loana T. Nogueira and   
        Fábio Protti and   
              Rudini M. Sampaio   Partitioning extended $ P_4 $-laden
                                  graphs into cliques and stable sets  . . 829--834
                   Ming Liu and   
              Feifeng Zheng and   
               Chengbin Chu and   
                     Yinfeng Xu   Single-machine scheduling with
                                  past-sequence-dependent delivery times
                                  and release times  . . . . . . . . . . . 835--838
                    Hsun Su and   
             Yuan-Kang Shih and   
                  Shin-Shin Kao   On the $1$-fault hamiltonicity for
                                  graphs satisfying Ore's theorem  . . . . 839--843
             Radek Slíva   Antimagic labeling graphs with a regular
                                  dominating subgraph  . . . . . . . . . . 844--847
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 23, December 15, 2012

                      S. Pettie   A simple reduction from maximum weight
                                  matching to maximum cardinality matching 893--898
              Edyta Szyma\'nska   $ {H}$-colorings of dense hypergraphs    899--902
               Martin Olsen and   
        Lars Bækgaard and   
                   Torben Tambo   On non-trivial Nash stable partitions in
                                  additive hedonic games with symmetric $
                                  0 / 1$-utilities . . . . . . . . . . . . 903--907
              Xiaoguang Bao and   
                    Zhaohui Liu   An improved approximation algorithm for
                                  the clustered traveling salesman problem 908--910
           Hiroshi Fujiwara and   
            Yoshiyuki Sekiguchi   An improved analysis of SRPT scheduling
                                  algorithm on the basis of functional
                                  optimization . . . . . . . . . . . . . . 911--915
                  Shiwei Yu and   
                T.-Z. Huang and   
                Xiaoyun Liu and   
                     Wufan Chen   Information measures based on fractional
                                  calculus . . . . . . . . . . . . . . . . 916--921
               Apurv Nakade and   
                Somenath Biswas   Effect of increasing the energy gap
                                  between the two lowest energy states on
                                  the mixing time of the Metropolis
                                  algorithm  . . . . . . . . . . . . . . . 922--927
          Dietmar Berwanger and   
                  Olivier Serre   Parity games on undirected graphs  . . . 928--932
             D. I. Diochnos and   
                R. H. Sloan and   
               Gy. Turán   On multiple-instance learning of
                                  halfspaces . . . . . . . . . . . . . . . 933--936
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 112, Number 24, December 31, 2012

          Jakarin Chawachat and   
      Jittat Fakcharoenphol and   
             Wattana Jindaluang   The non-uniform Bounded Degree Minimum
                                  Diameter Spanning Tree problem with an
                                  application in P2P networking  . . . . . 937--941
                  Martin Kochol   Non-extendible latin parallelepipeds . . 942--943
           Peter Dankelmann and   
                David Erwin and   
              Wayne Goddard and   
             Simon Mukwembi and   
                 Henda C. Swart   Eccentric counts, connectivity and
                                  chordality . . . . . . . . . . . . . . . 944--947
           Mitre C. Dourado and   
          Dieter Rautenbach and   
Vinícius Fernandes dos Santos and   
           Jayme L. Szwarcfiter   Characterization and recognition of
                                  Radon-independent sets in split graphs   948--952
             Oliver Schaudt and   
                Rainer Schrader   The complexity of connected dominating
                                  sets and total dominating sets with
                                  specified induced subgraphs  . . . . . . 953--957
          Michalis Christou and   
          Maxime Crochemore and   
        Tomás Flouri and   
       Costas S. Iliopoulos and   
               Jan Janousek and   
           Borivoj Melichar and   
                Solon P. Pissis   Computing all subtree repeats in ordered
                                  trees  . . . . . . . . . . . . . . . . . 958--962
                Paul Gastin and   
              Nathalie Sznajder   Decidability of well-connectedness for
                                  distributed synthesis  . . . . . . . . . 963--968
                 Maurice Jansen   Towards a tight hardness-randomness
                                  connection between permanent and
                                  arithmetic circuit identity testing  . . 969--975
     Alexandros V. Gerbessiotis   An improved reliability bound of a
                                  probabilistic parallel integer sorting
                                  algorithm  . . . . . . . . . . . . . . . 976--979
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Information Processing Letters
Volume 113, Number 1--2, January, 2013

     Andreas Björklund and   
                  Petteri Kaski   Counting closed trails . . . . . . . . . 1--3
              Vincenzo Bonifaci   Physarum can compute shortest paths: a
                                  short proof  . . . . . . . . . . . . . . 4--7
                Yiguang Liu and   
                 Stan Z. Li and   
                     Wei Wu and   
                 Ronggang Huang   Dynamics of a mean-shift-like algorithm
                                  and its applications on clustering . . . 8--16
                 Jean-Luc Baril   Statistics-preserving bijections between
                                  classical and cyclic permutations  . . . 17--22
             Adam Kasperski and   
               Adam Kurpisz and   
              Pawel Zieli\'nski   Approximating the min-max (regret)
                                  selecting items problem  . . . . . . . . 23--29
             Xiangqian Zhou and   
                   Bing Yao and   
                  Xiang'en Chen   Every lobster is odd-elegant . . . . . . 30--33
            Michal Zawidzki and   
          Renate A. Schmidt and   
              Dmitry Tishkovsky   Satisfiability problem for modal logic
                                  with global counting operators coded in
                                  binary is NExpTime-complete  . . . . . . 34--38
    Stavros G. Kolliopoulos and   
               Yannis Moysoglou   The $2$-valued case of makespan
                                  minimization with assignment constraints 39--43
                   Yang Gao and   
                    Ming Xu and   
                Naijun Zhan and   
                    Lijun Zhang   Model checking conditional CSL for
                                  continuous-time Markov chains  . . . . . 44--50
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 3, February 15, 2013

      Hervé Fournier and   
               Antoine Vigneron   A deterministic algorithm for fitting a
                                  step function to a weighted point-set    51--54
         Panagiotis D. Alevizos   An optimal algorithm for computing the
                                  non-trivial circuits of a union of
                                  iso-oriented rectangles  . . . . . . . . 55--59
            Mario Lamberger and   
                    Elmar Teufl   Memoryless near-collisions, revisited    60--66
          Paul Dütting and   
           Monika Henzinger and   
                   Ingmar Weber   Sponsored search, market equilibria, and
                                  the Hungarian Method . . . . . . . . . . 67--73
              M. Crochemore and   
           C. S. Iliopoulos and   
               T. Kociumaka and   
                  M. Kubica and   
                J. Pachocki and   
             J. Radoszewski and   
                  W. Rytter and   
             W. Tyczy\'nski and   
                     T. Wale\'n   A note on efficient computation of all
                                  Abelian periods in a string  . . . . . . 74--77
             Kalpesh Kapoor and   
                  Himadri Nayak   On multiset of factors of a word . . . . 78--80
               T. Avitabile and   
                 C. Mathieu and   
                   L. Parkinson   Online constrained optimization with
                                  recourse . . . . . . . . . . . . . . . . 81--86
                     Yunjian Wu   An improvement on Vizing's conjecture    87--88
                 Raffaele Mosca   Maximum weight independent sets in ($
                                  P_6 $,co-banner)-free graphs . . . . . . 89--93
                     Lech Duraj   A linear algorithm for $3$-letter
                                  longest common weakly increasing
                                  subsequence  . . . . . . . . . . . . . . 94--99
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 4, February 28, 2013

                  Stefan Kiefer   BPA bisimilarity is EXPTIME-hard . . . . 101--106
           Petr A. Golovach and   
            Pinar Heggernes and   
             Pim van 't Hof and   
           Daniël Paulusma   Choosability on $H$-free graphs  . . . . 107--110
                Sun-Mi Park and   
             Ku-Young Chang and   
                     Dowon Hong   Parallel $ {\rm GF}(3^m) $ multiplier
                                  for trinomials . . . . . . . . . . . . . 111--115
          Tomoyuki Yamakami and   
                    Yuichi Kato   The dissecting power of regular
                                  languages  . . . . . . . . . . . . . . . 116--122
                   G. Gutin and   
               G. Muciaccia and   
                         A. Yeo   (Non-)existence of polynomial kernels
                                  for the Test Cover problem . . . . . . . 123--126
                   Xin Chen and   
                Zhenzhen Xu and   
    György Dósa and   
                    Xin Han and   
                       He Jiang   Semi-online hierarchical scheduling
                                  problems with buffer or rearrangements   127--131
               Yong-Jin Liu and   
                       Kai Tang   The complexity of geodesic Voronoi
                                  diagrams on triangulated $2$-manifold
                                  surfaces . . . . . . . . . . . . . . . . 132--136
                    Xi Peng and   
                   Zhang Yi and   
              Xiao-Yong Wei and   
              De-Zhong Peng and   
                Yong-Sheng Sang   Free-gram phrase identification for
                                  modeling Chinese text  . . . . . . . . . 137--144
            Kamal Al-Bawani and   
                Alexander Souza   Buffer overflow management with class
                                  segregation  . . . . . . . . . . . . . . 145--150
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 5--6, March 15, 2013

          Giuseppe Ateniese and   
          Alfredo De Santis and   
          Anna Lisa Ferrara and   
                Barbara Masucci   A note on time-bound hierarchical key
                                  assignment schemes . . . . . . . . . . . 151--155
               Luigi Acerbi and   
          Alberto Dennunzio and   
                Enrico Formenti   Surjective multidimensional cellular
                                  automata are non-wandering: a
                                  combinatorial proof  . . . . . . . . . . 156--159
                    Sung-il Pae   Exact output rate of Peres's algorithm
                                  for random number generation . . . . . . 160--164
                Sudipta Das and   
           Lawrence Jenkins and   
               Debasis Sengupta   Loss ratio of the EDF scheduling policy
                                  with early discarding technique  . . . . 165--170
              G. Barmpalias and   
              R. Hölzl and   
             A. E. M. Lewis and   
                      W. Merkle   Analogues of Chaitin's Omega in the
                                  computably enumerable sets . . . . . . . 171--178
                Marek Cygan and   
               Marcin Pilipczuk   Split Vertex Deletion meets Vertex
                                  Cover: New fixed-parameter and exact
                                  exponential-time algorithms  . . . . . . 179--182
                Romeo Rizzi and   
           Alexandru I. Tomescu   Ranking, unranking and random generation
                                  of extensional acyclic digraphs  . . . . 183--187
                  Haiyan Yu and   
                 Yinfeng Xu and   
                      Tengyu Wu   Online inventory replenishment
                                  scheduling of temporary orders . . . . . 188--192
          Jaroslaw Grytczuk and   
             Piotr Szafruga and   
                   Michal Zmarz   Online version of the theorem of Thue    193--195
            Jelena Govorcin and   
                Martin Knor and   
               Riste Skrekovski   Line graph operation and small worlds    196--200
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 7, April 15, 2013

            Fabrizio Luccio and   
                    Linda Pagli   Chain rotations: a new look at tree
                                  distance . . . . . . . . . . . . . . . . 201--204
             Zahra Ahmadian and   
       Mahmoud Salmasizadeh and   
             Mohammad Reza Aref   Desynchronization attack on RAPP
                                  ultralightweight authentication protocol 205--209
                Taolue Chen and   
               Tingting Han and   
              Marta Kwiatkowska   On the complexity of model checking
                                  interval-valued discrete time Markov
                                  chains . . . . . . . . . . . . . . . . . 210--216
                 Lucy Small and   
                   Oliver Mason   Nash Equilibria for competitive
                                  information diffusion on trees . . . . . 217--219
                  Yong Chen and   
                   An Zhang and   
             Guangting Chen and   
                  Jianming Dong   Approximation algorithms for parallel
                                  open shop scheduling . . . . . . . . . . 220--224
               Michael Viderman   LP decoding of codes with expansion
                                  parameter above $ 2 / 3 $  . . . . . . . 225--228
        Osman Karaahmetoglu and   
     Muharrem Tolga Sakalli and   
                Ercan Bulus and   
                  Ion Tutanescu   A new method to determine algebraic
                                  expression of power mapping based
                                  S-boxes  . . . . . . . . . . . . . . . . 229--235
                  Walter Didimo   Density of straight-line $1$-planar
                                  graph drawings . . . . . . . . . . . . . 236--240
                Jens M. Schmidt   A simple test on $2$-vertex- and
                                  $2$-edge-connectivity  . . . . . . . . . 241--244
        Alessandro Barenghi and   
    Stefano Crespi Reghizzi and   
             Dino Mandrioli and   
                Matteo Pradella   Parallel parsing of operator precedence
                                  grammars . . . . . . . . . . . . . . . . 245--249
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 8, April 30, 2013

                    Li Guan and   
                    Jianping Li   Coordination mechanism for selfish
                                  scheduling under a grade of service
                                  provision  . . . . . . . . . . . . . . . 251--254
               Sizhong Zhou and   
                 Zhiren Sun and   
                         Hui Ye   A toughness condition for fractional $
                                  (k, m)$-deleted graphs . . . . . . . . . 255--259
                  Hao Liang and   
                    Jun-Ming Xu   Minimum feedback arc set of $m$-free
                                  digraphs . . . . . . . . . . . . . . . . 260--264
           Amit Kumar Dutta and   
                Masud Hasan and   
                M. Sohel Rahman   Prefix transpositions on binary and
                                  ternary strings  . . . . . . . . . . . . 265--270
                   Qi Cheng and   
                Jincheng Zhuang   On certain computations of Pisot numbers 271--275
             Marcin Krzywkowski   Trees having many minimal dominating
                                  sets . . . . . . . . . . . . . . . . . . 276--279
                    Lan Lin and   
                      Yixun Lin   Machine scheduling with contiguous
                                  processing constraints . . . . . . . . . 280--284
             Arnaud Carayol and   
      Zoltán Ésik   The FC-rank of a context-free language   285--287
               Ching-Lueh Chang   Deterministic sublinear-time
                                  approximations for metric 1-median
                                  selection  . . . . . . . . . . . . . . . 288--292
      Marcos Lordello Chaim and   
Roberto Paulo Andrioli de Araujo   An efficient bitwise algorithm for
                                  intra-procedural data-flow testing
                                  coverage . . . . . . . . . . . . . . . . 293--300
                 Gaoli Wang and   
                   Yanzhao Shen   Preimage and pseudo-collision attacks on
                                  step-reduced SM3 hash function . . . . . 301--306
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 9, May 15, 2013

                  Shailesh Vaya   Round complexity of leader election and
                                  gossiping in bidirectional radio
                                  networks . . . . . . . . . . . . . . . . 307--312
                Vadim Lozin and   
            Christopher Purcell   Boundary properties of the
                                  satisfiability problems  . . . . . . . . 313--317
             Leo van Iersel and   
                    Simone Linz   A quadratic kernel for computing the
                                  hybridization number of multiple trees   318--323
           Aleksandr Cariow and   
                 Galina Cariowa   An algorithm for fast multiplication of
                                  sedenions  . . . . . . . . . . . . . . . 324--331
     Nina Brandstätter and   
             Wilfried Meidl and   
                 Arne Winterhof   Addendum to Sidel\'nikov sequences over
                                  nonprime fields  . . . . . . . . . . . . 332--336
             Manuel Schmitt and   
                     Rolf Wanka   Exploiting independent subformulas: a
                                  faster approximation scheme for #$k$-SAT 337--344
              Brian C. Dean and   
                Raghuveer Mohan   Building Cartesian trees from free trees
                                  with $k$ leaves  . . . . . . . . . . . . 345--349
                 Ben Moszkowski   Interconnections between classes of
                                  sequentially compositional temporal
                                  formulas . . . . . . . . . . . . . . . . 350--353
                   Haihui Zhang   Corrigendum to ``On 3-choosability of
                                  planar graphs with neither adjacent
                                  triangles nor 5-, 6- and 9-cycles'' [\em
                                  Information Processing Letters \bf 110
                                  (24) (2010) 1084--1087]  . . . . . . . . 354--356
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 10--11, May / June, 2013

                   Yoo-Jin Baek   Scalar recoding and regular $ 2^w $-ary
                                  right-to-left EC scalar multiplication
                                  algorithm  . . . . . . . . . . . . . . . 357--360
             Tiziana Calamoneri   Optimal $ L(\delta_1, \delta_2, 1)
                                  $-labeling of eight-regular grids  . . . 361--364
           Sa\"\id Yahiaoui and   
             Yacine Belhoul and   
            Mohammed Haddad and   
            Hamamache Kheddouci   Self-stabilizing algorithms for minimal
                                  global powerful alliance sets in graphs  365--370
               Amihood Amir and   
              Haim Paryenty and   
                   Liam Roditty   On the hardness of the Consensus String
                                  problem  . . . . . . . . . . . . . . . . 371--374
     Chandrashekhar Meshram and   
            Suchitra A. Meshram   An identity-based cryptographic model
                                  for discrete logarithm and integer
                                  factoring based cryptosystem . . . . . . 375--380
             Javier Esparza and   
             Andreas Gaiser and   
                  Stefan Kiefer   A strongly polynomial algorithm for
                                  criticality of branching processes and
                                  consistency of stochastic context-free
                                  grammars . . . . . . . . . . . . . . . . 381--385
              Qingxuan Yang and   
                 John Ellis and   
           Khalegh Mamakani and   
                   Frank Ruskey   In-place permuting and perfect shuffling
                                  using involutions  . . . . . . . . . . . 386--391
           Pawel Morawiecki and   
                 Marian Srebrny   A SAT-based preimage analysis of reduced
                                  Keccak hash functions  . . . . . . . . . 392--397
              Aleksandar Ili\'c   Efficient algorithm for the vertex
                                  connectivity of trapezoid graphs . . . . 398--404
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 12, June 30, 2013

                   Jun Feng and   
               Xueming Wang and   
                       Hong Sun   Efficiently computable endomorphism for
                                  genus $3$ hyperelliptic curve
                                  cryptosystems  . . . . . . . . . . . . . 405--408
           Alexander Kantor and   
                   Kobbi Nissim   Attacks on statistical databases: the
                                  highly noisy case  . . . . . . . . . . . 409--413
            Igor E. Shparlinski   Correcting noisy exponentiation
                                  black-boxes modulo a prime . . . . . . . 414--417
              Arpita Maitra and   
                    Goutam Paul   Eavesdropping in semiquantum key
                                  distribution protocol  . . . . . . . . . 418--422
          F. Karakoç and   
                 H. Demirci and   
                 A. E. Harmanci   Biclique cryptanalysis of LBlock and
                                  TWINE  . . . . . . . . . . . . . . . . . 423--429
                  M. Kubica and   
            T. Kulczy\'nski and   
             J. Radoszewski and   
                  W. Rytter and   
                     T. Wale\'n   A linear time algorithm for consecutive
                                  permutation pattern matching . . . . . . 430--433
               Hongyang Sun and   
                        Rui Fan   Improved semi-online makespan scheduling
                                  with a reordering buffer . . . . . . . . 434--439
                     Dekel Tsur   Top-$k$ document retrieval in optimal
                                  space  . . . . . . . . . . . . . . . . . 440--443
             Debashis Ghosh and   
              Lakshmi Kanta Dey   A new upper bound on the parameters of
                                  quasi-symmetric designs  . . . . . . . . 444--446
            Marek Karpinski and   
             Andrzej Lingas and   
                Dzmitry Sledneu   Optimal cuts and partitions in tree
                                  metrics in polynomial time . . . . . . . 447--451
                Eddie Cheng and   
László Lipták and   
               Daniel E. Steffy   Strong local diagnosability of $ (n, k)
                                  $-star graphs and Cayley graphs
                                  generated by $2$-trees with missing
                                  edges  . . . . . . . . . . . . . . . . . 452--456
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 13, July 15, 2013

                   Yuval Filmus   Inequalities on submodular functions via
                                  term rewriting . . . . . . . . . . . . . 457--464
                   Long Wan and   
              Xiaofang Deng and   
                      Zhiyi Tan   Inefficiency of Nash equilibria with
                                  parallel processing policy . . . . . . . 465--469
       Muhammad Rashed Alam and   
                M. Sohel Rahman   A divide and conquer approach and a
                                  work-optimal parallel algorithm for the
                                  LIS problem  . . . . . . . . . . . . . . 470--476
               Edith Elkind and   
                 James B. Orlin   On the hardness of finding subsets with
                                  equal average  . . . . . . . . . . . . . 477--480
                 Jianhua Tu and   
                   Fengmei Yang   The vertex cover $ P_3 $ problem in
                                  cubic graphs . . . . . . . . . . . . . . 481--485
                  Yuan Feng and   
                    Lijun Zhang   A tighter bound for the
                                  self-stabilization time in Herman's
                                  algorithm  . . . . . . . . . . . . . . . 486--488
            Riadh Khennoufa and   
                Hamida Seba and   
            Hamamache Kheddouci   Edge coloring total $k$-labeling of
                                  generalized Petersen graphs  . . . . . . 489--494
             Laurent Alonso and   
             Edward M. Reingold   Analysis of Boyer and Moore's MJRTY
                                  algorithm  . . . . . . . . . . . . . . . 495--497
              Daniel Rotter and   
                     Jens Vygen   $d$-dimensional arrangement revisited    498--505
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 14--16, July / August, 2013

                L. S. Sousa and   
             J. C. B. Leite and   
                 Orlando Loques   Green data centers: Using hierarchies
                                  for scalable energy efficiency in large
                                  Web clusters . . . . . . . . . . . . . . 507--515
             Július Czap   A note on total colorings of $1$-planar
                                  graphs . . . . . . . . . . . . . . . . . 516--517
              Danny Z. Chen and   
                    Haitao Wang   A note on searching line arrangements
                                  and applications . . . . . . . . . . . . 518--521
            Abishek Gopalan and   
     Srinivasan Ramasubramanian   A counterexample for the proof of
                                  implication conjecture on independent
                                  spanning trees . . . . . . . . . . . . . 522--526
             Jung-Heum Park and   
                     Insung Ihm   Single-source three-disjoint path covers
                                  in cubes of connected graphs . . . . . . 527--532
               Xiang-Jun Li and   
                    Jun-Ming Xu   Generalized measures of fault tolerance
                                  in exchanged hypercubes  . . . . . . . . 533--537
         Emanuele Giaquinta and   
               Szymon Grabowski   New algorithms for binary jumbled
                                  pattern matching . . . . . . . . . . . . 538--542
               A. Çivril   A note on the hardness of sparse
                                  approximation  . . . . . . . . . . . . . 543--545
          John M. Hitchcock and   
               Elvira Mayordomo   Base invariance of feasible dimension    546--551
               J. Mark Keil and   
                     D. Pradhan   Computing a minimum outer-connected
                                  dominating set for the class of chordal
                                  graphs . . . . . . . . . . . . . . . . . 552--561
           Vasin Suttichaya and   
     Pattarasinee Bhattarakosol   Solving the learning parity with noise's
                                  open question  . . . . . . . . . . . . . 562--566
                Qichun Wang and   
                   Chik How Tan   A new method to construct Boolean
                                  functions with good cryptographic
                                  properties . . . . . . . . . . . . . . . 567--571
             Javier Herranz and   
             Alexandre Ruiz and   
      Germán Sáez   Sharing many secrets with computational
                                  provable security  . . . . . . . . . . . 572--579
               Ji-Jian Chin and   
               Syh-Yuan Tan and   
             Swee-Huay Heng and   
             Raphael C.-W. Phan   On the security of a modified Beth
                                  identity-based identification scheme . . 580--583
               Beate Bollig and   
                Michael Capelle   Priority functions for the approximation
                                  of the metric TSP  . . . . . . . . . . . 584--591
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 17, August 30, 2013

                     Ran Ma and   
                  Jinjiang Yuan   Online scheduling on a single machine
                                  with rejection under an agreeable
                                  condition to minimize the total
                                  completion time plus the total rejection
                                  cost . . . . . . . . . . . . . . . . . . 593--598
         Parvathi Rangasamy and   
             Muhammad Akram and   
                S. Thilagavathi   Intuitionistic fuzzy shortest hyperpath
                                  in a network . . . . . . . . . . . . . . 599--603
            Golnaz Badkobeh and   
              Gabriele Fici and   
                Steve Kroon and   
        Zsuzsanna Lipták   Binary jumbled string matching for
                                  highly run-length compressible texts . . 604--608
               Jianfeng Ren and   
                 Donglei Du and   
                     Dachuan Xu   The complexity of two supply chain
                                  scheduling problems  . . . . . . . . . . 609--612
             Toufik Mansour and   
             Vincent Vajnovszki   Efficient generation of restricted
                                  growth words . . . . . . . . . . . . . . 613--616
                Shmuel T. Klein   On the connection between Hamming codes,
                                  Heapsort and other methods . . . . . . . 617--620
                    Qi Chen and   
                 Dingyi Pei and   
              Chunming Tang and   
                    Gansen Zhao   Efficient integer span program for
                                  hierarchical threshold access structure  621--627
        D. R. Simões and   
              J. Portugheis and   
            V. C. da Rocha, Jr.   Universal homophonic coding scheme using
                                  differential encoding and interleaving   628--633
                 Linzhen Lu and   
                  Shaozhen Chen   A compress slide attack on the full GOST
                                  block cipher . . . . . . . . . . . . . . 634--639
                  Jinsoo Oh and   
                    Jin Kim and   
                  Byung-Ro Moon   On the inequivalence of bilinear
                                  algorithms for $ 3 \times 3 $ matrix
                                  multiplication . . . . . . . . . . . . . 640--645
              Shinya Fujita and   
                  Linda Lesniak   Revisit of Erd\Hos--Gallai's theorem on
                                  the circumference of a graph . . . . . . 646--648
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 18, September 15, 2013

              Flavia Bonomo and   
         Monia Giandomenico and   
                 Fabrizio Rossi   A note on the Cornaz--Jost
                                  transformation to solve the graph
                                  coloring problem . . . . . . . . . . . . 649--652
             Yan-Hong Zhang and   
                    Wei Hao and   
                      Tao Xiang   Independent spanning trees in crossed
                                  cubes  . . . . . . . . . . . . . . . . . 653--658
              Yingqian Wang and   
                     Jinghan Xu   Planar graphs with cycles of length
                                  neither 4 nor 6 are $ (2, 0, 0)
                                  $-colorable  . . . . . . . . . . . . . . 659--663
                   Yun Feng and   
                    Wensong Lin   A concise proof for total coloring
                                  subcubic graphs  . . . . . . . . . . . . 664--665
           Olaf Beyersdorff and   
              Nicola Galesi and   
                 Massimo Lauria   A characterization of tree-like
                                  resolution size  . . . . . . . . . . . . 666--671
    Asnath Victy Phamila Y. and   
                      R. Amutha   Low complexity energy efficient very low
                                  bit-rate image compression scheme for
                                  wireless sensor network  . . . . . . . . 672--676
                     Cui Yu and   
               Xiaofan Yang and   
                 Jing Zhang and   
                          Li He   Routing and wavelength assignment for
                                  $3$-ary $n$-cube communication patterns
                                  in linear array optical networks for $n$
                                  communication rounds . . . . . . . . . . 677--680
              Bart Steyaert and   
              Dieter Claeys and   
                 Herwig Bruneel   The burst factor and its impact on
                                  buffer performance . . . . . . . . . . . 681--684
         Tomás Feder and   
                    Carlos Subi   Edge-coloring almost bipartite
                                  multigraphs  . . . . . . . . . . . . . . 685--689
         Mikhail J. Atallah and   
           Elena Grigorescu and   
                          Yi Wu   A lower-variance randomized algorithm
                                  for approximate string matching  . . . . 690--692
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 19--21, September / October, 2013

         Emanuele Giaquinta and   
           Szymon Grabowski and   
              Kimmo Fredriksson   Approximate pattern matching with
                                  $k$-mismatches in packed text  . . . . . 693--697
               Ondrej Cepek and   
                Petr Kucera and   
         Stanislav Kurík   Boolean functions with long prime
                                  implicants . . . . . . . . . . . . . . . 698--703
                 Benqiu Dai and   
                    Wensong Lin   On $ (s, t) $-relaxed $ L(2, 1)
                                  $-labelings of the square lattice  . . . 704--709
               Qiaoping Guo and   
                Shengjia Li and   
                  Gaokui Xu and   
                      Yubao Guo   Notes on vertex pancyclicity of graphs   710--713
          Daniel Lokshtanov and   
            Neeldhara Misra and   
                  Saket Saurabh   Imbalance is fixed parameter tractable   714--718
              Apoloniusz Tyszka   Conjecturally computable functions which
                                  unconditionally do not have any
                                  finite-fold Diophantine representation   719--722
                   Lei Wang and   
              Xiaodong Wang and   
                 Yingjie Wu and   
                      Daxin Zhu   A dynamic programming solution to a
                                  generalized LCS problem  . . . . . . . . 723--728
               Markus L. Schmid   A note on the complexity of matching
                                  patterns with variables  . . . . . . . . 729--733
              Min-Sheng Lin and   
                 Chao-Chun Ting   Computing $K$-terminal reliability of
                                  $d$-trapezoid graphs . . . . . . . . . . 734--738
              Ilker Kocabas and   
      Bekir Taner Dinçer   A new statistical strategy for pooling:
                                  ELI  . . . . . . . . . . . . . . . . . . 739--746
                 Benjamin Doerr   Improved approximation algorithms for
                                  the Min-Max Selecting Items problem  . . 747--749
              Danupon Nanongkai   Simple FPTAS for the subset-sums ratio
                                  problem  . . . . . . . . . . . . . . . . 750--753
             Enrique Gerstl and   
                   Gur Mosheiov   An improved algorithm for due-window
                                  assignment on parallel identical
                                  machines with unit-time jobs . . . . . . 754--759
               Xiang-Jun Li and   
                    Jun-Ming Xu   Edge-fault tolerance of hypercube-like
                                  networks . . . . . . . . . . . . . . . . 760--763
               Riham AlTawy and   
       Aleksandar Kircanski and   
                    Amr Youssef   Second order collision for the 42-step
                                  reduced DHA-256 hash function  . . . . . 764--770
                   Volker Turau   Self-stabilizing algorithms for
                                  efficient sets of graphs and trees . . . 771--776
            Biswajit Sanyal and   
            Prosenjit Gupta and   
             Subhashis Majumder   Colored top-$K$ range-aggregate queries  777--784
              Andrzej Dudek and   
                Alan Frieze and   
         Andrzej Ruci\'nski and   
                 Matas Sileikis   Approximate counting of regular
                                  hypergraphs  . . . . . . . . . . . . . . 785--788
               Liaojun Pang and   
                 Huixian Li and   
                 Qingqi Pei and   
                     Yumin Wang   Improvement on Meshram et al.'s ID-based
                                  cryptographic mechanism  . . . . . . . . 789--792
            Zahra Farzanyar and   
     Mohammadreza Kangavari and   
                   Nick Cercone   P2P-FISM: Mining (recently) frequent
                                  item sets from distributed data streams
                                  over P2P network . . . . . . . . . . . . 793--798
                   A. Ahadi and   
                     A. Dehghan   The complexity of the proper orientation
                                  number . . . . . . . . . . . . . . . . . 799--803
             Hailiang Zhang and   
                Rongfei Lin and   
                   Guanglong Yu   The largest matching root of unicyclic
                                  graphs . . . . . . . . . . . . . . . . . 804--806
            Dragisa Zuni\'c and   
                 Jovisa Zuni\'c   Shape ellipticity based on the first Hu
                                  moment invariant . . . . . . . . . . . . 807--810
                  Pinhui Ke and   
                Wanghong Yu and   
                   Zuling Chang   A note on binary sequence pairs with
                                  two-level correlation  . . . . . . . . . 811--814
                B. S. Panda and   
                        S. Paul   A linear time algorithm for liar's
                                  domination problem in proper interval
                                  graphs . . . . . . . . . . . . . . . . . 815--822
                        Bo Ning   Fan-type degree condition restricted to
                                  triples of induced subgraphs ensuring
                                  Hamiltonicity  . . . . . . . . . . . . . 823--826
                     Orhun Kara   Square reflection cryptanalysis of
                                  $5$-round Feistel networks with
                                  permutations . . . . . . . . . . . . . . 827--831
              A. V. Sokolov and   
                     A. V. Drac   The linked list representation of $n$
                                  LIFO-stacks and/or FIFO-queues in the
                                  single-level memory  . . . . . . . . . . 832--835
      Hervé Hocquard and   
               Pascal Ochem and   
                  Petru Valicov   Strong edge-colouring and induced
                                  matchings  . . . . . . . . . . . . . . . 836--843
           Toshihiro Fujito and   
             Takayoshi Sakamaki   How to guard a graph against tree moves  844--847
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Information Processing Letters
Volume 113, Number 22--24, November / December, 2013

                R. Krithika and   
            N. S. Narayanaswamy   Another disjoint compression algorithm
                                  for odd cycle transversal  . . . . . . . 849--851
            Maw-Shang Chang and   
           Chuang-Chieh Lin and   
               Peter Rossmanith   Testing consistency of quartet
                                  topologies: a parameterized approach . . 852--857
         Daniel W. Cranston and   
                         Suil O   Hamiltonicity in connected regular
                                  graphs . . . . . . . . . . . . . . . . . 858--860
       Gerard Jennhwa Chang and   
             Chan-Wei Chang and   
                  David Kuo and   
               Sheung-Hung Poon   Algorithmic aspect of stratified
                                  domination in graphs . . . . . . . . . . 861--865
               Deshuai Dong and   
                  Xue Zhang and   
               Longjiang Qu and   
                    Shaojing Fu   A note on vectorial bent functions . . . 866--870
                   Chan-Su Shin   A note on minimum-sum coverage by
                                  aligned disks  . . . . . . . . . . . . . 871--875
                Yuhuan Chen and   
                  Chenfu Yi and   
                    Dengyu Qiao   Improved neural solution for the
                                  Lyapunov matrix equation based on
                                  gradient search  . . . . . . . . . . . . 876--881
                    Masud Hasan   On fixed size projection of simplicial
                                  polyhedra  . . . . . . . . . . . . . . . 882--887
            S. G. Vadlamudi and   
                Sandip Aine and   
              P. P. Chakrabarti   Incremental Beam search  . . . . . . . . 888--893
                     Ionut Tutu   Comorphisms of structured institutions   894--900
                   Guy Avni and   
                 Orna Kupferman   When does abstraction help?  . . . . . . 901--905
          Sylvain Guillemot and   
             Dániel Marx   A faster FPT algorithm for Bipartite
                                  Contraction  . . . . . . . . . . . . . . 906--912
                  David Galindo   A note on an IND-CCA2 secure
                                  Paillier-based cryptosystem  . . . . . . 913--914
           Gregory Kucherov and   
Lilla Tóthmérész and   
       Stéphane Vialette   On the combinatorics of suffix arrays    915--920
                  Carola Winzen   Direction-reversing quasi-random rumor
                                  spreading with restarts  . . . . . . . . 921--926


Information Processing Letters
Volume 114, Number 1--2, January / February, 2014

                    Lei Nie and   
                Jingjie Liu and   
              Haicang Zhang and   
                      Zhiwei Xu   On the inapproximability of minimizing
                                  cascading failures under the
                                  deterministic threshold model  . . . . . 1--4
                    Yong Yu and   
                      Yi Mu and   
               Willy Susilo and   
                      Man Ho Au   Security pitfalls of an efficient
                                  threshold proxy signature scheme for
                                  mobile agents  . . . . . . . . . . . . . 5--8
                Mingjie Liu and   
               Xiaoyun Wang and   
                 Guangwu Xu and   
                   Xuexin Zheng   A note on BDD problems with $ \lambda_2
                                  $-gap  . . . . . . . . . . . . . . . . . 9--12
           Sarah Bastkowski and   
           Andreas Spillner and   
                Vincent Moulton   Fishing for minimum evolution trees with
                                  Neighbor-Nets  . . . . . . . . . . . . . 13--18
                  D. Garijo and   
              M. A. Garrido and   
                C. I. Grima and   
          A. Márquez and   
  A. Moreno-González and   
             J. R. Portillo and   
                   P. Reyes and   
                  R. Robles and   
                  J. Valenzuela   Monochromatic geometric $k$-factors for
                                  bicolored point sets with auxiliary
                                  points . . . . . . . . . . . . . . . . . 19--24
                Xin-Wei Yao and   
             Wan-Liang Wang and   
                Teng-cao Wu and   
               Xiao-min Yao and   
                Shuang-Hua Yang   A Novel Hybrid Slot Allocation Mechanism
                                  for 802.11e EDCA Protocol  . . . . . . . 25--30
                J.-L. Baril and   
                    J.-M. Pallo   Motzkin subposets and Motzkin geodesics
                                  in Tamari lattices . . . . . . . . . . . 31--37
                   Carsten Witt   Fitness levels with tail bounds for the
                                  analysis of randomized search heuristics 38--41
                Bruno Courcelle   Clique-width and edge contraction  . . . 42--44
       Janusz Dybizba\'nski and   
           Andrzej Szepietowski   The oriented chromatic number of Halin
                                  graphs . . . . . . . . . . . . . . . . . 45--49
               Nima Norouzi and   
                   Yung H. Tsin   A simple $3$-edge connected component
                                  algorithm revisited  . . . . . . . . . . 50--55
                 Weidong Li and   
                Jianping Li and   
                        Li Guan   Approximation algorithms for the ring
                                  loading problem with penalty cost  . . . 56--59
           Kazuya Yamashita and   
          Yasuaki Nishitani and   
              Sadaki Hirose and   
              Satoshi Okawa and   
                 Nobuyasu Osato   The firing squad synchronization problem
                                  with sub-generals  . . . . . . . . . . . 60--65
               Marc Demange and   
                     Tinaz Ekim   Efficient recognition of equimatchable
                                  graphs . . . . . . . . . . . . . . . . . 66--71
            Aleksy Schubert and   
                Ken-etsu Fujita   A note on subject reduction in $
                                  (\rightarrow, \exists) $-Curry with
                                  respect to complete developments . . . . 72--75
      Dmitry Krasnoshchekov and   
            Valentin Polishchuk   Order-$k$ $ \alpha $-hulls and $ \alpha
                                  $-shapes . . . . . . . . . . . . . . . . 76--83
            Abishek Gopalan and   
     Srinivasan Ramasubramanian   Corrigendum to: ``A counterexample for
                                  the proof of implication conjecture on
                                  independent spanning trees''
                                  [Information Processing Letters \bf 113
                                  (14--16) (2013) 522--526]  . . . . . . . 84--84

Information Processing Letters
Volume 114, Number 3, March, 2014

               Carles Creus and   
              Guillem Godoy and   
                   Lander Ramos   Excessively duplicating patterns
                                  represent non-regular languages  . . . . 85--93
            Wojciech Wawrzyniak   A strengthened analysis of a local
                                  algorithm for the minimum dominating set
                                  problem in planar graphs . . . . . . . . 94--98
            Faisal N. Abu-Khzam   Maximum common induced subgraph
                                  parameterized by vertex cover  . . . . . 99--103
                  Peter Lofgren   On the complexity of the Monte Carlo
                                  method for incremental PageRank  . . . . 104--106
                     Peter Nose   Security weaknesses of a signature
                                  scheme and authenticated key agreement
                                  protocols  . . . . . . . . . . . . . . . 107--115
                 Jiqiang Lu and   
                Wun-She Yap and   
            Matt Henricksen and   
                 Swee-Huay Heng   Differential attack on nine rounds of
                                  the SEED block cipher  . . . . . . . . . 116--123
                   Beate Bollig   A simpler counterexample to a
                                  long-standing conjecture on the
                                  complexity of Bryant's apply algorithm   124--129
                 Xuehou Tan and   
                       Bo Jiang   Optimum sweeps of simple polygons with
                                  two guards . . . . . . . . . . . . . . . 130--136
             Michael L. Fredman   An intuitive and simple bounding
                                  argument for Quicksort . . . . . . . . . 137--139
              Xiao-ning Xie and   
            Gong-liang Chen and   
                         Yin Li   Novel bit-parallel multiplier for $ {\rm
                                  GF}(2^m) $ defined by all-one polynomial
                                  using generalized Karatsuba algorithm    140--146
            Branislav Rovan and   
                    Marek Zeman   Modeling time criticality of information 147--151
    Debapriyay Mukhopadhyay and   
                Subhas C. Nandy   Efficient multiple-precision integer
                                  division algorithm . . . . . . . . . . . 152--157

Information Processing Letters
Volume 114, Number 4, April, 2014

              Sandi Klavzar and   
                      Meijie Ma   The domination number of exchanged
                                  hypercubes . . . . . . . . . . . . . . . 159--162
                     Bang Ye Wu   On approximating metric $1$-median in
                                  sublinear time . . . . . . . . . . . . . 163--166
                  Yixin Cao and   
                Jianer Chen and   
                      J.-H. Fan   An $ O^\ast (1.84^k) $ parameterized
                                  algorithm for the multiterminal cut
                                  problem  . . . . . . . . . . . . . . . . 167--173
                Jasbir Dhaliwal   Faster semi-external suffix sorting  . . 174--178
                   Ruyan Fu and   
                    Ji Tian and   
              Jinjiang Yuan and   
                          Ya Li   Online scheduling on an unbounded
                                  parallel-batch machine and a standard
                                  machine to minimize makespan . . . . . . 179--184
       Salvatore Pontarelli and   
            Pedro Reviriego and   
           Michael Mitzenmacher   Improving the performance of Invertible
                                  Bloom Lookup Tables  . . . . . . . . . . 185--191
              David Galindo and   
                 Srinivas Vivek   Limits of a conjecture on a
                                  leakage-resilient cryptosystem . . . . . 192--196
   Patrick Cégielski and   
           Serge Grigorieff and   
             Ir\`ene Guessarian   On lattices of regular sets of natural
                                  integers closed under decrementation . . 197--202
                    Sven Schewe   Distributed synthesis is simply
                                  undecidable  . . . . . . . . . . . . . . 203--207
            Lukasz Mikulski and   
                  Maciej Koutny   Folded Hasse diagrams of combined traces 208--216
                  Fang Yang and   
              Xiang-en Chen and   
                     Chunyan Ma   On the vertex-distinguishing proper edge
                                  coloring of composition of complete
                                  graph and star . . . . . . . . . . . . . 217--221
             Samed Bajri\'c and   
               Enes Pasalic and   
  Amela Ribi\'c-Muratovi\'c and   
            Gangopadhyay Sugata   On generalized bent functions with
                                  Dillon's exponents . . . . . . . . . . . 222--227

Information Processing Letters
Volume 114, Number 5, May, 2014

             Olivier Finkel and   
              Michal Skrzypczak   On the topological complexity of $
                                  \omega $-languages of non-deterministic
                                  Petri nets . . . . . . . . . . . . . . . 229--233
                 Santanu Sarkar   Proving empirical key-correlations in
                                  RC4  . . . . . . . . . . . . . . . . . . 234--238
                R. Hildenbrandt   A $k$-server problem with parallel
                                  requests and unit distances  . . . . . . 239--246
            Matthew Andrews and   
                     Lisa Zhang   Rate-adaptive weighted fair queueing for
                                  energy-aware scheduling  . . . . . . . . 247--251
             Mohsen Shakiba and   
       Mohammad Dakhilalian and   
                     Hamid Mala   On computational complexity of
                                  impossible differential cryptanalysis    252--255
          Ananda Swarup Das and   
            Prosenjit Gupta and   
         Kishore Kothapalli and   
               Kannan Srinathan   On reporting the $ L_1 $ metric closest
                                  pair in a query rectangle  . . . . . . . 256--263
              Petteri Kaski and   
             Mikko Koivisto and   
          Janne H. Korhonen and   
                Igor S. Sergeev   Fast monotone summation over disjoint
                                  sets . . . . . . . . . . . . . . . . . . 264--267
       Przemyslaw Dabrowski and   
           Grzegorz Labuzek and   
           Tomasz Rachwalik and   
                  Janusz Szmidt   Searching for nonlinear feedback shift
                                  registers with parallel computing  . . . 268--272
         Christos Boutsidis and   
            Malik Magdon-Ismail   A note on sparse least-squares
                                  regression . . . . . . . . . . . . . . . 273--276

Information Processing Letters
Volume 114, Number 6, June, 2014

                    M. Kiwi and   
P. Moisset de Espanés and   
                I. Rapaport and   
                    S. Rica and   
                   G. Theyssier   Strict Majority Bootstrap Percolation in
                                  the $r$-wheel  . . . . . . . . . . . . . 277--281
          Nabila Abdessaied and   
             Mathias Soeken and   
   Michael Kirkedal Thomsen and   
                 Rolf Drechsler   Upper bounds for reversible circuits
                                  based on Young subgroups . . . . . . . . 282--286
                Yangyang Li and   
                Shixia Feng and   
            Xiangrong Zhang and   
                   Licheng Jiao   SAR image segmentation based on
                                  quantum-inspired multiobjective
                                  evolutionary clustering algorithm  . . . 287--293
              Hunter R. Johnson   Some new maximum VC classes  . . . . . . 294--298
   Ferucio Laurentiu Tiplea and   
      Constantin Catalin Dragan   A necessary and sufficient condition for
                                  the asymptotic idealness of the GRS
                                  threshold secret sharing scheme  . . . . 299--303
                Ahmed S. Ghiduk   Automatic generation of basis test paths
                                  using variable length genetic algorithm  304--316
                Peter Damaschke   Enumerating maximal bicliques in
                                  bipartite graphs with favorable degree
                                  sequences  . . . . . . . . . . . . . . . 317--321
                   Long Wen and   
                Meiqin Wang and   
            Andrey Bogdanov and   
                  Huaifeng Chen   Multidimensional zero-correlation
                                  attacks on lightweight block cipher
                                  HIGHT: Improved cryptanalysis of an ISO
                                  standard . . . . . . . . . . . . . . . . 322--330
               Young In Cho and   
               Nam Su Chang and   
                   Seokhie Hong   Formulas for cube roots in $ \mathbb
                                  {F}_{3^m} $ using shifted polynomial
                                  basis  . . . . . . . . . . . . . . . . . 331--337

Information Processing Letters
Volume 114, Number 7, July, 2014

             Yacine Belhoul and   
           Sa\"\id Yahiaoui and   
            Hamamache Kheddouci   Efficient self-stabilizing algorithms
                                  for minimal total $k$-dominating sets in
                                  graphs . . . . . . . . . . . . . . . . . 339--343
                   Yongjie Yang   Towards optimal kernel for edge-disjoint
                                  triangle packing . . . . . . . . . . . . 344--348
           Bhaskar DasGupta and   
                 Devendra Desai   On a connection between small set
                                  expansions and modularity clustering . . 349--352
          Cyriac Grigorious and   
             Sudeep Stephen and   
              Bharati Rajan and   
               Mirka Miller and   
                 Albert William   On the partition dimension of a class of
                                  circulant graphs . . . . . . . . . . . . 353--356
    Andreas Brandstädt and   
                    Van Bang Le   A note on efficient domination in a
                                  superclass of $ P_5 $-free graphs  . . . 357--359
             Cosmin Bonchis and   
                Gabriel Istrate   Improved approximation algorithms for
                                  low-density instances of the Minimum
                                  Entropy Set Cover Problem  . . . . . . . 360--364
               Arindam Khan and   
             Prasad Raghavendra   On mimicking networks representing
                                  minimum terminal cuts  . . . . . . . . . 365--371
               Jooyoung Lee and   
                   Daesung Kwon   Security of permutation-based
                                  compression function lp231 . . . . . . . 372--381
            Raffaella Gentilini   A note on the approximation of
                                  mean-payoff games  . . . . . . . . . . . 382--386
                Pawel Rzazewski   Exact algorithm for graph homomorphism
                                  and locally injective graph homomorphism 387--391
          Kimmo Fredriksson and   
             Emanuele Giaquinta   On a compact encoding of the swap
                                  automaton  . . . . . . . . . . . . . . . 392--396

Information Processing Letters
Volume 114, Number 8, August, 2014

               Andrzej Tarlecki   W\ladyslaw Marek Turski (1938--2013) . . 397--398
                  Xianyu Yu and   
                Yulin Zhang and   
                      Kai Huang   Multi-machine scheduling with general
                                  position-based deterioration to minimize
                                  total load revisited . . . . . . . . . . 399--404
                Hans Raj Tiwary   On the largest convex subsets in
                                  Minkowski sums . . . . . . . . . . . . . 405--407
     Grgur Petric Mareti\'c and   
     Mohammad Torabi Dashti and   
                    David Basin   LTL is closed under topological closure  408--413
       Christos Levcopoulos and   
                 Andrzej Lingas   A note on a QPTAS for maximum weight
                                  triangulation of planar point sets . . . 414--416
                Pavol Duris and   
                    Marek Kosta   Flip-pushdown automata with $k$ pushdown
                                  reversals and E0L systems are
                                  incomparable . . . . . . . . . . . . . . 417--420
         Alexander Golovnev and   
       Alexander S. Kulikov and   
                  Ivan Mihajlin   Solving SCS for bounded length strings
                                  in fewer than $ 2^n $ steps  . . . . . . 421--425
               Riham AlTawy and   
                 Amr M. Youssef   Integral distinguishers for
                                  reduced-round Stribog  . . . . . . . . . 426--431
            Erwan Le Merrer and   
       Nicolas Le Scouarnec and   
           Gilles Trédan   Heuristical top-$k$: fast estimation of
                                  centralities in complex networks . . . . 432--436
Jérémy Barbay and   
            Timothy M. Chan and   
            Gonzalo Navarro and   
     Pablo Pérez-Lantero   Maximum-weight planar boxes in $ O(n^2)
                                  $ time (and better)  . . . . . . . . . . 437--445
              Gregory Gutin and   
                     Mark Jones   Parameterized algorithms for load
                                  coloring problem . . . . . . . . . . . . 446--449
               Zan-Bo Zhang and   
                  Xiaoyan Zhang   Triangle strings: Structures for
                                  augmentation of vertex-disjoint triangle
                                  sets . . . . . . . . . . . . . . . . . . 450--456

Information Processing Letters
Volume 114, Number 9, September, 2014

             Eduardo Canale and   
      Héctor Cancela and   
             Franco Robledo and   
                   Pablo Sartor   The complexity of computing the
                                  2-K-reliability in networks  . . . . . . 457--461
              Victor Lagerkvist   Weak bases of Boolean co-clones  . . . . 462--468
                    Ying Ma and   
                Shunzhi Zhu and   
                     Ke Qin and   
                  Guangchun Luo   Combining the requirement information
                                  for software defect estimation in design
                                  time . . . . . . . . . . . . . . . . . . 469--474
               Huijuan Wang and   
               Jianliang Wu and   
                    Bin Liu and   
                    Hongyu Chen   On the linear arboricity of graphs
                                  embeddable in surfaces . . . . . . . . . 475--479
             Xiaowang Zhang and   
            Jan Van den Bussche   On the primitivity of operators in
                                  SPARQL . . . . . . . . . . . . . . . . . 480--485
                 Mei-Mei Gu and   
                   Rong-Xia Hao   $3$-extra connectivity of $3$-ary
                                  $n$-cube networks  . . . . . . . . . . . 486--491
                 Yumin Yuan and   
                   Chenhui Wang   Certificateless signature scheme with
                                  security enhanced in the standard model  492--499
             Keramat Hasani and   
     Svetlana A. Kravchenko and   
                   Frank Werner   Minimizing total weighted completion
                                  time approximately for the parallel
                                  machine problem with a single server . . 500--503
                  Lein Harn and   
                     Miao Fuyou   Multilevel threshold secret sharing
                                  based on the Chinese Remainder Theorem   504--509
            Maw-Shang Chang and   
              Li-Hsuan Chen and   
               Ling-Ju Hung and   
           Peter Rossmanith and   
                    Guan-Han Wu   Exact algorithms for problems related to
                                  the densest $k$-set problem  . . . . . . 510--513

Information Processing Letters
Volume 114, Number 10, October, 2014

               Well Y. Chiu and   
              Chiuyuan Chen and   
                   Shih-Yu Tsai   A $ 4 n$-move self-stabilizing algorithm
                                  for the minimal dominating set problem
                                  using an unfair distributed daemon . . . 515--518
               Boris Aronov and   
              Muriel Dulieu and   
                 Ferran Hurtado   Mutual witness proximity graphs  . . . . 519--523
               Min Chih Lin and   
          Michel J. Mizrahi and   
           Jayme L. Szwarcfiter   Fast algorithms for some dominating
                                  induced matching problems  . . . . . . . 524--528
              Chen-Ming Fan and   
               Jen-Tse Wang and   
               Cheng-Chih Huang   Borderedness-preserving homomorphisms    529--534
          Franz Aurenhammer and   
            Günter Paulini   On shape Delaunay tessellations  . . . . 535--541
                 Felix Joos and   
  Christian Löwenstein and   
     Fabiano de S. Oliveira and   
          Dieter Rautenbach and   
           Jayme L. Szwarcfiter   Graphs of interval count two with a
                                  given partition  . . . . . . . . . . . . 542--546
  Mohammad Ali Orumiehchiha and   
             Josef Pieprzyk and   
                  Ron Steinfeld   Practical attack on NLM--MAC scheme  . . 547--550
                 Colette Johnen   Fast, silent self-stabilizing
                                  distance-$k$ independent dominating set
                                  construction . . . . . . . . . . . . . . 551--555
           Tomasz Kociumaka and   
               Marcin Pilipczuk   Faster deterministic Feedback Vertex Set 556--560
               Xiaoping Liu and   
                Zhilan Dang and   
                Baoyindureng Wu   The hub number, girth and Mycielski
                                  graphs . . . . . . . . . . . . . . . . . 561--563
                     Adi Akavia   Explicit small sets with $ \epsilon
                                  $-discrepancy on Bohr sets . . . . . . . 564--567
              Min-Sheng Lin and   
                 Sheng-Huang Su   Counting maximal independent sets in
                                  directed path graphs . . . . . . . . . . 568--572
                 Huibo Chen and   
                Wenge Zhang and   
                      Feng Ding   Data filtering based least squares
                                  iterative algorithm for parameter
                                  identification of output error
                                  autoregressive systems . . . . . . . . . 573--578
                   Tsuyoshi Ito   Parallelization of
                                  entanglement-resistant multi-prover
                                  interactive proofs . . . . . . . . . . . 579--583
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc

Information Processing Letters
Volume 114, Number 11, November, 2014

                  Zhiguo Fu and   
                   Fengqin Yang   Holographic algorithms on bases of rank
                                  $2$  . . . . . . . . . . . . . . . . . . 585--590
           Mike Holenderski and   
            Reinder J. Bril and   
               Johan J. Lukkien   Red-black trees with relative node keys  591--596
                Jianfeng Lu and   
                    Dewu Xu and   
                    Lei Jin and   
                Jianmin Han and   
                       Hao Peng   On the complexity of role updating
                                  feasibility problem in RBAC  . . . . . . 597--602
                Moonju Park and   
                   Xuefeng Piao   Enhanced utilization bound of
                                  rate-monotonic scheduling in Controller
                                  Area Networks  . . . . . . . . . . . . . 603--606
                Hedong Yang and   
                  Lijie Wen and   
               Jianmin Wang and   
                Raymond K. Wong   CPL+: an improved approach for
                                  evaluating the local completeness of
                                  event logs . . . . . . . . . . . . . . . 607--610
              Tomoyuki Yamakami   Constant-space quantum interactive
                                  proofs against multiple provers  . . . . 611--619
             Kwanghoon Choi and   
                Byeong-Mo Chang   A type and effect system for activation
                                  flow of components in Android programs   620--627
               Marc Gyssens and   
            Mathias Niepert and   
                 Dirk Van Gucht   On the completeness of the semigraphoid
                                  axioms for deriving arbitrary from
                                  saturated conditional independence
                                  statements . . . . . . . . . . . . . . . 628--633
        Sebastian Deorowicz and   
               Szymon Grabowski   Efficient algorithms for the longest
                                  common subsequence in $k$-length
                                  substrings . . . . . . . . . . . . . . . 634--638
           Petra Berenbrink and   
           Bruce Krayenhoff and   
        Frederik Mallmann-Trenn   Estimating the number of connected
                                  components in sublinear time . . . . . . 639--642
                   Jack H. Lutz   The frequent paucity of trivial strings  643--645
             Andrzej Lingas and   
            Leonidas Palios and   
       Agnieszka Wasylewicz and   
               Pawel Zyli\'nski   Corrigendum to ``Note on covering
                                  monotone orthogonal polygons'' [Inf.
                                  Process. Lett. \bf 104(6) (2007)
                                  220--227]  . . . . . . . . . . . . . . . 646--654
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 114, Number 12, December, 2014

               Zongyue Wang and   
                  Hongbo Yu and   
                   Xiaoyun Wang   Cryptanalysis of GOST R hash function    655--662
        Richard Müller and   
            Christian Stahl and   
                  Walter Vogler   Undecidability of accordance for open
                                  systems with unbounded message queues    663--669
           Zahra Moezkarimi and   
                Alireza Bagheri   A PTAS for geometric 2-FTP . . . . . . . 670--675
                     Xing Huang   Hamilton cycles in implicit claw-heavy
                                  graphs . . . . . . . . . . . . . . . . . 676--679
                David Basin and   
Carlos Cotrini Jiménez and   
             Felix Klaedtke and   
                Eugen Zalinescu   Deciding safety and liveness in TPTL . . 680--688
                Dezheng Xie and   
              Huanhuan Xiao and   
                   Zhihong Zhao   Star coloring of cubic graphs  . . . . . 689--691
               Song-Song Li and   
                 Yu-Zhong Zhang   Serial batch scheduling on uniform
                                  parallel machines to minimize total
                                  completion time  . . . . . . . . . . . . 692--695
              Alexander Gilbers   VC-dimension of perimeter visibility
                                  domains  . . . . . . . . . . . . . . . . 696--699
                  Yun-Ping Deng   Efficient dominating sets in circulant
                                  graphs with domination number prime  . . 700--702
             Chengfang Fang and   
                 Ee-Chien Chang   Optimal strategy of coupon subset
                                  collection when each package contains
                                  half of the coupons  . . . . . . . . . . 703--705
              Tomomi Matsui and   
         Noriyoshi Sukegawa and   
               Atsushi Miyauchi   Fractional programming formulation for
                                  the vertex coloring problem  . . . . . . 706--709
                 Jinfei Liu and   
                   Li Xiong and   
                    Xiaofeng Xu   Faster output-sensitive skyline
                                  computation algorithm  . . . . . . . . . 710--713
               Shuichi Miyazaki   On the advice complexity of online
                                  bipartite matching and online stable
                                  marriage . . . . . . . . . . . . . . . . 714--717
             Yung-Tsung Hou and   
                Dar-Li Yang and   
                   Wen-Hung Kuo   Lot scheduling on a single machine . . . 718--722
                  Lei Zhang and   
                     Wenling Wu   Differential analysis of the Extended
                                  Generalized Feistel Networks . . . . . . 723--727
                    C. Avin and   
             M. Borokhovich and   
                  Y. Haddad and   
                  E. Kantor and   
                  Z. Lotker and   
                  M. Parter and   
                       D. Peleg   Testing the irreducibility of nonsquare
                                  Perron--Frobenius systems  . . . . . . . 728--733
             Jou-Ming Chang and   
             Jhen-Ding Wang and   
           Jinn-Shyong Yang and   
                   Kung-Jui Pai   A comment on ``Independent spanning
                                  trees in crossed cubes'' . . . . . . . . 734--739
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC


Information Processing Letters
Volume 115, Number 1, January, 2015

            Laurent Bulteau and   
           Guillaume Fertin and   
                Romeo Rizzi and   
       Stéphane Vialette   Some algorithmic results for $
                                  [2]$-sumset covers . . . . . . . . . . . 1--5
                   Hao Yang and   
                Keming Tang and   
               Jianjiang Yu and   
                      Licai Zhu   A practical information coverage
                                  approach in wireless sensor network  . . 6--10
                Taolue Chen and   
                 Nengkun Yu and   
                   Tingting Han   Continuous-time orbit problems are
                                  decidable in polynomial-time . . . . . . 11--14
              Razvan Diaconescu   On the existence of translations of
                                  structured specifications  . . . . . . . 15--22
                 Oliver Schaudt   On disjoint maximal independent sets in
                                  graphs . . . . . . . . . . . . . . . . . 23--27
               Wenchang Luo and   
                         Min Ji   Scheduling a variable maintenance and
                                  linear deteriorating jobs on a single
                                  machine  . . . . . . . . . . . . . . . . 33--39
           Martin Roetteler and   
              Rainer Steinwandt   A note on quantum related-key attacks    40--44
            Wolfgang Aigner and   
          Franz Aurenhammer and   
              Bert Jüttler   On triangulation axes of polygons  . . . 45--51
Béatrice Bérard and   
      Krishnendu Chatterjee and   
              Nathalie Sznajder   Probabilistic opacity for Markov
                                  decision processes . . . . . . . . . . . 52--59
                Yerim Chung and   
                 Myoung-Ju Park   Notes on inverse bin-packing problems    60--68
                     Kilho Shin   Tree Edit Distance and Maximum Agreement
                                  Subtree  . . . . . . . . . . . . . . . . 69--73
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 115, Number 2, February, 2015

            Andrzej Indrzejczak   Eliminability of cut in hypersequent
                                  calculi for some modal logics of linear
                                  frames . . . . . . . . . . . . . . . . . 75--81
             Peter Floderus and   
             Andrzej Lingas and   
                Mia Persson and   
                Dzmitry Sledneu   Detecting monomials with $k$ distinct
                                  variables  . . . . . . . . . . . . . . . 82--86
                 Salvador Lucas   Completeness of context-sensitive
                                  rewriting  . . . . . . . . . . . . . . . 87--92
           Simina Brânzei   A note on envy-free cake cutting with
                                  polynomial valuations  . . . . . . . . . 93--95
                     Jianhua Tu   A fixed-parameter algorithm for the
                                  vertex cover $ P_3 $ problem . . . . . . 96--99
             Ragesh Jaiswal and   
                Mehul Kumar and   
                   Pulkit Yadav   Improved analysis of $ D^2 $-sampling
                                  based PTAS for $k$-means and other
                                  clustering problems  . . . . . . . . . . 100--103
                 Qiang Dong and   
                  Qian Zhao and   
                       Yahui An   The hamiltonicity of generalized
                                  honeycomb torus networks . . . . . . . . 104--111
             Michal Feldman and   
                     Tami Tamir   Convergence of best-response dynamics in
                                  games with conflicting congestion
                                  effects  . . . . . . . . . . . . . . . . 112--118
Sílvia Maria Santana Mapa and   
       Sebastián Urrutia   On the maximum acyclic subgraph problem
                                  under disjunctive constraints  . . . . . 119--124
              Tetsuya Ishiu and   
                Masashi Kikuchi   The termination of the
                                  higher-dimensional tarai functions . . . 125--127
                Graham Enos and   
                  Yuliang Zheng   An ID-based signcryption scheme with
                                  compartmented secret sharing for
                                  unsigncryption . . . . . . . . . . . . . 128--133
     Joachim von zur Gathen and   
            Igor E. Shparlinski   Circulant graphs and GCD and LCM of
                                  subsets  . . . . . . . . . . . . . . . . 134--138

Information Processing Letters
Volume 115, February, 2015

                     E. Pasalic   A note on nonexistence of vectorial bent
                                  functions with binomial trace
                                  representation in the $ {\cal PS}^- $
                                  class  . . . . . . . . . . . . . . . . . 139--140

Information Processing Letters
Volume 115, Number 2, February, 2015

            K. Ashik Mathew and   
Patric R. J. Östergård   On hypercube packings, blocking sets and
                                  a covering problem . . . . . . . . . . . 141--145
Péricles R. O. Alves and   
       Raphael E. Rodrigues and   
    Rafael Martins de Sousa and   
Fernando Magno Quintão Pereira   A case for a fast trip count predictor   146--150
              Chang-Hsiung Tsai   The pessimistic diagnosability of
                                  alternating group graphs under the PMC
                                  model  . . . . . . . . . . . . . . . . . 151--154
                  S. Akshay and   
         Timos Antonopoulos and   
         Joël Ouaknine and   
                  James Worrell   Reachability problems for Markov chains  155--158
             Enrique Gerstl and   
                 Baruch Mor and   
                   Gur Mosheiov   A note: Maximizing the weighted number
                                  of just-in-time jobs on a proportionate
                                  flowshop . . . . . . . . . . . . . . . . 159--162
                 Yinfeng Xu and   
                     Hongmei Li   Minimax regret $1$-sink location problem
                                  in dynamic cycle networks  . . . . . . . 163--169
                    Jagadish M.   An approximation algorithm for the
                                  cutting-sticks problem . . . . . . . . . 170--174
             Strahil Ristov and   
               Damir Korenci\'c   Using static suffix array in dynamic
                                  application: Case of text compression by
                                  longest first substitution . . . . . . . 175--181
          Fabrizio Grandoni and   
           Tomasz Kociumaka and   
              Michal Wlodarczyk   An LP-rounding $ 2 \sqrt
                                  {2}$-approximation for restricted
                                  maximum acyclic subgraph . . . . . . . . 182--185
                David Basin and   
             Felix Klaedtke and   
                Eugen Zalinescu   Greedily computing associative
                                  aggregations on sliding windows  . . . . 186--192
                  Michael Brand   Arbitrary sequence RAMs  . . . . . . . . 193--198
             Javier Marenco and   
            Marcelo Mydlarz and   
          Daniel Severín   Topological additive numbering of
                                  directed acyclic graphs  . . . . . . . . 199--202
                   Yu-Liang Liu   Routing and wavelength assignment for
                                  exchanged hypercubes in linear array
                                  optical networks . . . . . . . . . . . . 203--208
               Min-Yun Lien and   
                 Jyhmin Kuo and   
                    Hung-Lin Fu   On the decycling number of generalized
                                  Kautz digraphs . . . . . . . . . . . . . 209--211
                 Luca Aceto and   
          Eugen-Ioan Goriac and   
             Anna Ingolfsdottir   A ground-complete axiomatization of
                                  stateless bisimilarity over Linda  . . . 212--220
                        Bo Ning   Notes on a conjecture of Manoussakis
                                  concerning Hamilton cycles in digraphs   221--224
                    Junqing Cai   A sufficient condition involving
                                  implicit degree and neighborhood
                                  intersection for long cycles . . . . . . 225--227
               Yanning Wang and   
                Yanyan Wang and   
                  Xuguang Zhang   Note on property $ M(k) $ of some
                                  complete multipartite graphs . . . . . . 228--231
          Robert Janczewski and   
             Krzysztof Turowski   The computational complexity of the
                                  backbone coloring problem for
                                  bounded-degree graphs with connected
                                  backbones  . . . . . . . . . . . . . . . 232--236
               Chetan Dugar and   
                  Anuj Jain and   
               Amit Rajawat and   
            Swapan Bhattacharya   Dynamic pricing of call rates: Bayesian
                                  approach . . . . . . . . . . . . . . . . 237--242
                 Yafei Song and   
               Xiaodan Wang and   
                    Lei Lei and   
                   Yaqiong Xing   Credibility decay model in temporal
                                  evidence combination . . . . . . . . . . 248--252
                 Baruch Mor and   
                   Gur Mosheiov   A note: Minimizing maximum earliness on
                                  a proportionate flowshop . . . . . . . . 253--255
    Andreas Brandstädt and   
                Pavel Ficur and   
               Arne Leitert and   
                 Martin Milanic   Polynomial-time algorithms for weighted
                                  efficient domination problems in AT-free
                                  graphs and dually chordal graphs . . . . 256--262
              Xiang'en Chen and   
                      Zepeng Li   Adjacent-vertex-distinguishing proper
                                  edge colorings of planar bipartite
                                  graphs with $ \Delta = 9 $, $ 10 $, or $
                                  11 $ . . . . . . . . . . . . . . . . . . 263--268
                       Xue Zhou   A new lower bound for the number of
                                  perfect matchings of line graph  . . . . 269--274
              Dimitri Watel and   
       Marc-Antoine Weisser and   
        Cédric Bentz and   
                Dominique Barth   An FPT algorithm in polynomial space for
                                  the Directed Steiner Tree problem with
                                  Limited number of Diffusing nodes  . . . 275--279
             Shunichi Matsubara   An enumeration algorithm for all
                                  integers nonrepresentable by some
                                  positive integers  . . . . . . . . . . . 280--284
                   Tong Jia and   
                    Yan Shi and   
             ZhongXuan Zhou and   
                   DongYue Chen   $3$D depth information extraction with
                                  omni-directional camera  . . . . . . . . 285--291
            Giovanni Agosta and   
        Alessandro Barenghi and   
             Gerardo Pelosi and   
               Michele Scandale   Trace-based schedulability analysis to
                                  enhance passive side-channel attack
                                  resilience of embedded software  . . . . 292--297
                Chaoyi Pang and   
                 Junhu Wang and   
                   Yu Cheng and   
               Haolan Zhang and   
                   Tongliang Li   Topological sorts on DAGs  . . . . . . . 298--301
                  Zepeng Li and   
                 Zehui Shao and   
                Enqiang Zhu and   
                         Jin Xu   A note on local coloring of graphs . . . 302--305
             Thomas Lambert and   
              Loris Marchal and   
               Bora Uçar   Comments on the hierarchically
                                  structured bin packing problem . . . . . 306--309
              Yasuaki Kobayashi   Computing the pathwidth of directed
                                  graphs with small vertex cover . . . . . 310--312
           Damianos Gavalas and   
Charalampos Konstantopoulos and   
      Konstantinos Mastakas and   
          Grammati Pantziou and   
                Nikolaos Vathis   Approximation algorithms for the arc
                                  orienteering problem . . . . . . . . . . 313--315
                Ali Dehghan and   
          Mohammad-Reza Sadeghi   The complexity of the zero-sum $3$-flows 316--320
           Naoyuki Kamiyama and   
                 Yasushi Kawase   On packing arborescences in temporal
                                  networks . . . . . . . . . . . . . . . . 321--325
             Micha\l Debski and   
          Jaroslaw Grytczuk and   
Ma\lgorzata \'Sleszy\'nska-Nowak   The strong chromatic index of sparse
                                  graphs . . . . . . . . . . . . . . . . . 326--330
              Zuosong Liang and   
                    Erfang Shan   The clique-transversal set problem in
                                  claw-free graphs with degree at most $4$ 331--335
               Reuven Cohen and   
               Liran Katzir and   
                  Aviv Yehezkel   A unified scheme for generalizing
                                  cardinality estimators to sum
                                  aggregation  . . . . . . . . . . . . . . 336--342
                 Pranava K. Jha   A comment on ``The domination number of
                                  exchanged hypercubes'' . . . . . . . . . 343--344
    Andreas Brandstädt and   
           Vassilis Giakoumakis   Addendum to: Maximum Weight Independent
                                  Sets in hole- and co-chair-free graphs   345--350
         Chandrashekhar Meshram   An efficient ID-based cryptographic
                                  encryption based on discrete logarithm
                                  problem and integer factorization
                                  problem  . . . . . . . . . . . . . . . . 351--358
          F. Karakoç and   
                 H. Demirci and   
                 A. E. Harmanci   AKF: a key alternating Feistel scheme
                                  for lightweight cipher designs . . . . . 359--367
                Allan Scott and   
       Venkatesh Srinivasan and   
                   Ulrike Stege   $k$-Attribute-Anonymity is hard even for
                                  $ k = 2$ . . . . . . . . . . . . . . . . 368--370
              Min-Sheng Lin and   
                 Chao-Chun Ting   A polynomial-time algorithm for
                                  computing $K$-terminal residual
                                  reliability of $d$-trapezoid graphs  . . 371--376
               Yinglei Song and   
                    Menghong Yu   On finding the longest antisymmetric
                                  path in directed acyclic graphs  . . . . 377--381
                Divesh Aggarwal   Affine-evasive sets modulo a prime . . . 382--385
                   Jian Guo and   
                 Chunhua Su and   
                    Wun-She Yap   An improved preimage attack against
                                  HAVAL-3  . . . . . . . . . . . . . . . . 386--393
                Wantao Ning and   
                Xiaoli Feng and   
                      Ling Wang   The connectivity of exchanged crossed
                                  cube . . . . . . . . . . . . . . . . . . 394--396
               Sukhyeun Cho and   
              Joong Chae Na and   
                Kunsoo Park and   
                 Jeong Seop Sim   A fast algorithm for order-preserving
                                  pattern matching . . . . . . . . . . . . 397--402
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 115, Number 3, March, 2015

              Jing-Ming Guo and   
            Chih-Hsien Hsia and   
                 Chia-Hao Chang   JPEG false contour reduction using error
                                  diffusion  . . . . . . . . . . . . . . . 403--407
            Massimo Vecchio and   
  Roberto López-Valcarce   A greedy topology design to accelerate
                                  consensus in broadcast wireless sensor
                                  networks . . . . . . . . . . . . . . . . 408--413
         Eleni Constantinou and   
          Athanasios Naskos and   
         George Kakarontzas and   
               Ioannis Stamelos   Extracting reusable components: a
                                  semi-automated approach for complex
                                  structures . . . . . . . . . . . . . . . 414--417
              Margus Veanes and   
         Nikolaj Bjòrner   Symbolic tree automata . . . . . . . . . 418--424
                  Domagoj Vrgoc   Using variable automata for querying
                                  data graphs  . . . . . . . . . . . . . . 425--430
            Pradeesha Ashok and   
           Sathish Govindarajan   On strong centerpoints . . . . . . . . . 431--434
                  Jerome Monnot   A note on the traveling salesman
                                  reoptimization problem under vertex
                                  insertion  . . . . . . . . . . . . . . . 435--438
              Gautam K. Das and   
                  Minati De and   
             Sudeshna Kolay and   
            Subhas C. Nandy and   
              Susmita Sur-Kolay   Approximation algorithms for maximum
                                  independent set of a unit disk graph . . 439--446
            Pierre Courtieu and   
                Lionel Rieg and   
   Sébastien Tixeuil and   
                  Xavier Urbain   Impossibility of gathering, a
                                  certification  . . . . . . . . . . . . . 447--452
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 115, Number 4, April, 2015

          Stanislaw J. Piestrak   A note on RNS architectures for the
                                  implementation of the diagonal function  453--457
           Malte Darnstädt   The optimal PAC bound for
                                  intersection-closed concept classes  . . 458--461
                  Miaomiao Tian   Identity-based proxy re-signatures from
                                  lattices . . . . . . . . . . . . . . . . 462--467
                     Mengjun Li   Automatic proving or disproving equality
                                  loop invariants based on finite
                                  difference techniques  . . . . . . . . . 468--474
              Jianming Dong and   
                Yiwei Jiang and   
                   An Zhang and   
                Jueliang Hu and   
                        Hui Luo   An approximation algorithm for
                                  proportionate scheduling in the
                                  two-stage hybrid flow shop . . . . . . . 475--480
            Saeedeh Momtazi and   
                  Felix Naumann   Who wants a computer to be a
                                  millionaire? . . . . . . . . . . . . . . 481--485
                 Zaiping Lu and   
                     Yingbin Ma   Rainbow $2$-Connection Numbers of Cayley
                                  Graphs . . . . . . . . . . . . . . . . . 486--491
               Xiaofang Gao and   
                     Jiye Liang   An improved incremental nonlinear
                                  dimensionality reduction for isometric
                                  data embedding . . . . . . . . . . . . . 492--501
             Jens Maßberg   Generalized Huffman coding for binary
                                  trees with choosable edge lengths  . . . 502--506
Zoltán Király and   
         Erika R. Kovács   Randomized and deterministic algorithms
                                  for network coding problems in wireless
                                  networks . . . . . . . . . . . . . . . . 507--511
                Lewis Tseng and   
               Nitin Vaidya and   
               Vartika Bhandari   Broadcast using certified propagation
                                  algorithm in presence of Byzantine
                                  faults . . . . . . . . . . . . . . . . . 512--514
              P. Karandikar and   
              M. Kufleitner and   
                Ph. Schnoebelen   On the index of Simon's congruence for
                                  piecewise testability  . . . . . . . . . 515--519
                     E. Pasalic   Corrigendum to ``A note on nonexistence
                                  of vectorial bent functions with
                                  binomial trace representation in the $
                                  {\cal PS}^- $ class'' [Information
                                  Processing Letters 115 (2) (2015)
                                  139--140]  . . . . . . . . . . . . . . . 520
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 115, Number 5, May, 2015

             Hailiang Zhang and   
               Guanglong Yu and   
                     Shanlin Li   Graphs with six distinct matching roots  521--526
              Ivan Bliznets and   
                Marek Cygan and   
               Pawel Komosa and   
              Lukás Mach   Kernelization lower bound for
                                  Permutation Pattern Matching . . . . . . 527--531
        Guy-Vincent Jourdan and   
                 Hasan Ural and   
   Hüsnü Yenigün   Reduced checking sequences using
                                  unreliable reset . . . . . . . . . . . . 532--535
             Marco Magirius and   
            Martin Mundhenk and   
               Raphaela Palenta   The complexity of primal logic with
                                  disjunction  . . . . . . . . . . . . . . 536--542
            Golnaz Badkobeh and   
              Maxime Crochemore   Infinite binary words containing
                                  repetitions of odd period  . . . . . . . 543--547
                  Jayadev Misra   Mapping among the nodes of infinite
                                  trees: a variation of König's infinity
                                  lemma  . . . . . . . . . . . . . . . . . 548--549
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC

Information Processing Letters
Volume 115, Number 6--8, June / August, 2015

              Chun-Nan Hung and   
                Eddie Cheng and   
              Tao-Ming Wang and   
                  Lih-Hsing Hsu   On Hamiltonian properties of
                                  unidirectional hypercubes  . . . . . . . 551--555
         Gabriela Argiroffo and   
              Valeria Leoni and   
                   Pablo Torres   On the complexity of $ \{ k \}
                                  $-domination and $k$-tuple domination in
                                  graphs . . . . . . . . . . . . . . . . . 556--561
             Hirotsugu Kakugawa   Self-stabilizing distributed algorithm
                                  for local mutual inclusion . . . . . . . 562--569
               Marco Bender and   
            Clemens Thielen and   
               Stephan Westphal   Packing items into several bins
                                  facilitates approximating the separable
                                  assignment problem . . . . . . . . . . . 570--575
      Hervé Fournier and   
                Anas Ismail and   
               Antoine Vigneron   Computing the Gromov hyperbolicity of a
                                  discrete metric space  . . . . . . . . . 576--579
              Xue-gang Chen and   
                  Shinya Fujita   Downhill domination problem in graphs    580--581
               Andrei Braga and   
            Cid C. de Souza and   
                    Orlando Lee   The Eternal Dominating Set problem for
                                  proper interval graphs . . . . . . . . . 582--587
                 David Avis and   
                Hans Raj Tiwary   A generalization of extension complexity
                                  that captures P  . . . . . . . . . . . . 588--593
             Aline Saettler and   
              Eduardo Laber and   
            Ferdinando Cicalese   Approximating decision trees with value
                                  dependent testing costs  . . . . . . . . 594--599
              Flavia Bonomo and   
            Guillermo Duran and   
              Amedeo Napoli and   
           Mario Valencia-Pabon   A one-to-one correspondence between
                                  potential solutions of the cluster
                                  deletion problem and the minimum sum
                                  coloring problem, and its application to
                                  $ P_4 $-sparse graphs  . . . . . . . . . 600--603
      André Chassein and   
                   Marc Goerigk   Alternative formulations for the ordered
                                  weighted averaging objective . . . . . . 604--608
                 Olivier Finkel   The exact complexity of the infinite
                                  Post Correspondence Problem  . . . . . . 609--611
                 S. Haddadi and   
                 S. Chenche and   
               M. Cheraitia and   
                    F. Guessoum   Polynomial-time local-improvement
                                  algorithm for Consecutive Block
                                  Minimization . . . . . . . . . . . . . . 612--617
         Ehsan Najafi Yazdi and   
            Alireza Bagheri and   
           Zahra Moezkarimi and   
            Hamidreza Keshavarz   An $ O(1) $-approximation algorithm for
                                  the $2$-dimensional geometric freeze-tag
                                  problem  . . . . . . . . . . . . . . . . 618--622
               Hoda Jannati and   
              Abolfazl Falahati   Analysis of false-reject probability in
                                  distance bounding protocols with mixed
                                  challenges over RFID noisy communication
                                  channel  . . . . . . . . . . . . . . . . 623--629
            Shigeyoshi Imai and   
                 Kaoru Kurosawa   Improved reconstruction of RSA
                                  private-keys from their fraction . . . . 630--632
                 Vince Grolmusz   A note on the PageRank of undirected
                                  graphs . . . . . . . . . . . . . . . . . 633--634
Michal Nánási and   
         Tomás Vinar and   
           Brona Brejová   Sequence annotation with HMMs: New
                                  problems and their complexity  . . . . . 635--639
               Szymon Grabowski   A note on the longest common substring
                                  with $k$-mismatches problem  . . . . . . 640--642
               Tomas Flouri and   
         Emanuele Giaquinta and   
             Kassian Kobert and   
                   Esko Ukkonen   Longest common substrings with $k$
                                  mismatches . . . . . . . . . . . . . . . 643--647
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 115, Number 9, September, 2015

           Sharareh Alipour and   
            Mohammad Ghodsi and   
              Alireza Zarei and   
                Maryam Pourreza   Visibility testing and counting  . . . . 649--654
             Yuto Nakashima and   
                Tomohiro I. and   
           Shunsuke Inenaga and   
               Hideo Bannai and   
                Masayuki Takeda   Constructing LZ78 tries and position
                                  heaps in linear time for large alphabets 655--659
         Céline Blondeau   Impossible differential attack on $
                                  13$-round Camellia-192 . . . . . . . . . 660--666
               Min Chih Lin and   
               Saveliy Vasiliev   Approximation algorithms for clique
                                  transversals on some graph classes . . . 667--670
             Henning Fernau and   
            Pinar Heggernes and   
             Pim van 't Hof and   
             Daniel Meister and   
                      Reza Saei   Computing the metric dimension for chain
                                  graphs . . . . . . . . . . . . . . . . . 671--676
               Shuhuan Zhao and   
                  Zheng-ping Hu   A modular weighted sparse representation
                                  based on Fisher discriminant and sparse
                                  residual for face recognition with
                                  occlusion  . . . . . . . . . . . . . . . 677--683
      Martin Dietzfelbinger and   
                    Raed Jaberi   On testing single connectedness in
                                  directed graphs and some related
                                  problems . . . . . . . . . . . . . . . . 684--688
    François Queyroi and   
                Sergey Kirgizov   Suppression distance computation for
                                  hierarchical clusterings . . . . . . . . 689--693
                Jay Thakkar and   
                  Aditya Kanade   Non-deterministic transducer models of
                                  retransmission protocols over noisy
                                  channels . . . . . . . . . . . . . . . . 694--698
               Iiro Honkala and   
              Olivier Hudry and   
               Antoine Lobstein   On the ensemble of optimal dominating
                                  and locating-dominating codes in a graph 699--702
               Yunong Zhang and   
                 Binbin Qiu and   
                   Long Jin and   
              Dongsheng Guo and   
                       Zhi Yang   Infinitely many Zhang functions
                                  resulting in various ZNN models for
                                  time-varying matrix inversion with link
                                  to Drazin inverse  . . . . . . . . . . . 703--706
     Irena Hrastnik Ladinek and   
                 Janez Zerovnik   Perfect codes in direct graph bundles    707--711
               Barun Gorain and   
          Partha Sarathi Mandal   Approximation algorithm for sweep
                                  coverage on graph  . . . . . . . . . . . 712--718
               Yue-Feng Cen and   
             Wan-Liang Wang and   
                    Xin-Wei Yao   A fast CU depth decision mechanism for
                                  HEVC . . . . . . . . . . . . . . . . . . 719--724
           Edward A. Hirsch and   
                 Dmitry Sokolov   On the probabilistic closure of the
                                  loose unambiguous hierarchy  . . . . . . 725--730
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 115, Number 10, October, 2015

Thaís Bardini Idalino and   
                Lucia Moura and   
Ricardo Felipe Custódio and   
                 Daniel Panario   Locating modifications in signed data
                                  for partial data integrity . . . . . . . 731--737
         Nethanel Gelernter and   
                  Amir Herzberg   Gossip Latin square and the meet-all
                                  gossipers problem  . . . . . . . . . . . 738--743
     René van Bevern and   
                Jiehua Chen and   
          Falk Hüffner and   
             Stefan Kratsch and   
              Nimrod Talmon and   
           Gerhard J. Woeginger   Approximability and parameterized
                                  complexity of multicover by
                                  $c$-intervals  . . . . . . . . . . . . . 744--749
                 Dean Doron and   
                  Amnon Ta-Shma   On the de-randomization of space-bounded
                                  approximate counting problems  . . . . . 750--753
                Enqiang Zhu and   
                  Zepeng Li and   
                 Zehui Shao and   
                     Jin Xu and   
                   Chanjuan Liu   Tree-core and tree-coritivity of graphs  754--759
              Laurent Gourv\`es   Approximating the optimal sequence of
                                  acquisitions and sales with a capped
                                  budget . . . . . . . . . . . . . . . . . 760--764
      Alexander Chane Shiau and   
           Tzong-Huei Shiau and   
                    Yue-Li Wang   Incidence coloring of Cartesian product
                                  graphs . . . . . . . . . . . . . . . . . 765--768
                    Amr Elmasry   Counting inversions adaptively . . . . . 769--772
              Min-Sheng Lin and   
                 Chao-Chun Ting   Computing the $K$-terminal reliability
                                  of directed path graphs  . . . . . . . . 773--778
                   Mrinal Nandi   On commutativity of Discrete Fourier
                                  Transform  . . . . . . . . . . . . . . . 779--785
Houcine Boumediene Merouane and   
              Mustapha Chellali   On Secure Domination in Graphs . . . . . 786--790
  Jòrgen Bang-Jensen and   
Magnús M. Halldórsson   Vertex coloring edge-weighted digraphs   791--796
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 115, Number 11, November, 2015

                  Chen Yuan and   
                     Haibin Kan   A refined analysis on the jump number
                                  problem of interval orders . . . . . . . 797--800
         Joao M. M. Barguil and   
         Paulo S. L. M. Barreto   Security issues in Sarkar's e-cash
                                  protocol . . . . . . . . . . . . . . . . 801--803
                 Guanqun Ni and   
                     Li Luo and   
                 Yinfeng Xu and   
                     Jiuping Xu   Optimal online markdown and markup
                                  pricing policies with demand uncertainty 804--811
                Sheng Huang and   
                   Dan Yang and   
                 Ge Yongxin and   
                 Xiaohong Zhang   Combined supervised information with PCA
                                  via discriminative component selection   812--816
                Yuxing Yang and   
               Shiying Wang and   
                        Jing Li   Subnetwork preclusion for bubble-sort
                                  networks . . . . . . . . . . . . . . . . 817--821
                  Jing Chen and   
                   Xiuping Wang   Identification of Hammerstein systems
                                  with continuous nonlinearity . . . . . . 822--827
               Alak Kumar Datta   Approximate spanning cactus  . . . . . . 828--832
            Vahan Mkrtchyan and   
                   K. Subramani   On the approximability of the Largest
                                  Sphere Rule Ensemble Classification
                                  problem  . . . . . . . . . . . . . . . . 833--837
                    Yong Wu and   
             T. C. E. Cheng and   
                         Min Ji   Inefficiency of the Nash equilibrium for
                                  selfish machine covering on two
                                  hierarchical uniform machines  . . . . . 838--844
            Miriam Di Ianni and   
            Luciano Gual\`a and   
                 Gianluca Rossi   Reducing the diameter of a unit disk
                                  graph via node addition  . . . . . . . . 845--850
                  Lein Harn and   
                 Ching-Fang Hsu   Dynamic threshold secret reconstruction
                                  and its application to the threshold
                                  cryptography . . . . . . . . . . . . . . 851--857
              Xianmeng Meng and   
                   Xuexin Zheng   Cryptanalysis of RSA with a small
                                  parameter revisited  . . . . . . . . . . 858--862
               Cosmina Croitoru   A note on quasi-kernels in digraphs  . . 863--865
              Tobias Mömke   An improved approximation algorithm for
                                  the traveling salesman problem with
                                  relaxed triangle inequality  . . . . . . 866--871
          Paulina Grzegorek and   
             Janusz Januszewski   A note on one-space bounded square
                                  packing  . . . . . . . . . . . . . . . . 872--876
        Tomás Kaiser and   
              Maria Saumell and   
              Nico Van Cleemput   $ 10$-Gabriel graphs are Hamiltonian . . 877--881
               Fred Mesnard and   
           Étienne Payet   A second-order formulation of
                                  non-termination  . . . . . . . . . . . . 882--885
          Jarkko Peltomäki   Characterization of repetitions in
                                  Sturmian words: a new proof  . . . . . . 886--891
             Brahim Neggazi and   
            Mohammed Haddad and   
            Hamamache Kheddouci   A new self-stabilizing algorithm for
                                  maximal $p$-star decomposition of
                                  general graphs . . . . . . . . . . . . . 892--898
              T. Eisenbarth and   
              A. Meyerowitz and   
                  R. Steinwandt   On the security margin of MAC striping   899--902
                  Yan Zhang and   
                Zhaohui Zhu and   
                   Jinjin Zhang   On the greatest solution of equations in
                                  CLL$_R$  . . . . . . . . . . . . . . . . 903--907
                   S. Alves and   
                       S. Broda   A short note on type-inhabitation:
                                  Formula-trees vs. game semantics . . . . 908--911
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 115, Number 12, December, 2015

               Min Chih Lin and   
     Francisco J. Soulignac and   
           Jayme L. Szwarcfiter   A faster algorithm for the cluster
                                  editing problem on proper interval
                                  graphs . . . . . . . . . . . . . . . . . 913--916
             Chiou-Jiun Lin and   
                Jia-Jie Liu and   
                    Yue-Li Wang   Finding outer-connected dominating sets
                                  in interval graphs . . . . . . . . . . . 917--922
         Vladimir Braverman and   
           Rafail Ostrovsky and   
              Gregory Vorsanger   Weighted sampling without replacement
                                  from data streams  . . . . . . . . . . . 923--926
        Marios Mavronicolas and   
                Burkhard Monien   The complexity of pure equilibria in
                                  mix-weighted congestion games on
                                  parallel links . . . . . . . . . . . . . 927--931
Annamária Kovács and   
               Ulrich Meyer and   
              Gabriel Moruz and   
                Andrei Negoescu   The optimal structure of algorithms for
                                  $ \alpha $-paging  . . . . . . . . . . . 932--938
               Chuandong Xu and   
             Shenggui Zhang and   
                        Yi Wang   On the maximum arc-chromatic number of
                                  digraphs with bounded outdegrees or
                                  indegrees  . . . . . . . . . . . . . . . 939--944
              Dongqin Cheng and   
               Rong-Xia Hao and   
                  Yan-Quan Feng   Embedding even cycles on folded
                                  hypercubes with conditional faulty edges 945--949
               Huaming Xing and   
                 Moo Young Sohn   Bounds on locating total domination
                                  number of the Cartesian product of
                                  cycles and paths . . . . . . . . . . . . 950--956
                Zhi-Yi Shao and   
                        Bo Yang   On security against the server in
                                  designated tester public key encryption
                                  with keyword search  . . . . . . . . . . 957--961
                   Daniel L. Lu   Planar lower envelope of monotone
                                  polygonal chains . . . . . . . . . . . . 962--964
         Hans L. Bodlaender and   
               Marc van Kreveld   Google Scholar makes it hard --- the
                                  complexity of organizing one's
                                  publications . . . . . . . . . . . . . . 965--968
               Zhichao Geng and   
                  Jinjiang Yuan   A note on unbounded parallel-batch
                                  scheduling . . . . . . . . . . . . . . . 969--974
                Moshe Milshtein   A new binary code of length $ 16 $ and
                                  minimum distance $3$ . . . . . . . . . . 975--976
                 Zhiwei Guo and   
               Haixing Zhao and   
                     Yaping Mao   The equitable vertex arboricity of
                                  complete tripartite graphs . . . . . . . 977--982
 Cosme E. Santiesteban-Toca and   
   Jesús S. Aguilar-Ruiz   A new multiple classifier system for the
                                  prediction of protein's contacts map . . 983--990
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 116, Number 1, January, 2016

                   Rui Wang and   
              Yongquan Zhou and   
                Shilei Qiao and   
                     Kang Huang   Flower Pollination Algorithm with Bee
                                  Pollinator for cluster analysis  . . . . 1--14
                 Defu Zhang and   
                 Leyuan Shi and   
        Stephen C. H. Leung and   
                         Tao Wu   A priority heuristic for the guillotine
                                  rectangular packing problem  . . . . . . 15--21
         Najmeh Sadat Jaddi and   
           Salwani Abdullah and   
             Abdul Razak Hamdan   A solution representation of genetic
                                  algorithm for neural network weights and
                                  structure  . . . . . . . . . . . . . . . 22--25
          Robert Janczewski and   
             Krzysztof Turowski   On the hardness of computing span of
                                  subcubic graphs  . . . . . . . . . . . . 26--32
                 Zheng Yang and   
                  Shuangqing Li   On security analysis of an
                                  after-the-fact leakage resilient key
                                  exchange protocol  . . . . . . . . . . . 33--40
                     Zhi Hu and   
             Guoliang Zhang and   
                      Maozhi Xu   Some techniques for faster scalar
                                  multiplication on GLS curves . . . . . . 41--46
                David J. Pearce   A space-efficient algorithm for finding
                                  strongly connected components  . . . . . 47--52
            Minh Tan Nguyen and   
           Quang Hai Truong and   
                Tran Khanh Dang   Enhance fuzzy vault security using
                                  nonrandom chaff point generator  . . . . 53--64
                    Yan Lan and   
                    Xin Han and   
                 Zongtao Wu and   
                     He Guo and   
                       Xin Chen   Complexity of problem $ {\rm TF2}| \nu =
                                  1, c = 2 |C_{\rm max} $  . . . . . . . . 65--69
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 2, February, 2016

            Tamanna Chhabra and   
                   Jorma Tarhio   A filtration method for order-preserving
                                  matching . . . . . . . . . . . . . . . . 71--74
            Patricia Bouyer and   
              Patrick Gardy and   
                 Nicolas Markey   On the semantics of Strategy Logic . . . 75--79
                    Wantao Ning   The super connectivity of exchanged
                                  crossed cube . . . . . . . . . . . . . . 80--84
               Martin Manak and   
              Ivana Kolingerova   Extension of the edge tracing algorithm
                                  to disconnected Voronoi skeletons  . . . 85--92
                   Shuliang Sun   A novel edge based image steganography
                                  with $ 2^k $ correction and Huffman
                                  encoding . . . . . . . . . . . . . . . . 93--99
           Warut Suksompong and   
       Charles E. Leiserson and   
                 Tao B. Schardl   On the efficiency of localized work
                                  stealing . . . . . . . . . . . . . . . . 100--106
                   Xie-Bin Chen   Paired $2$-disjoint path covers of
                                  multidimensional torus networks with
                                  faulty edges . . . . . . . . . . . . . . 107--110
            Christoph Haase and   
                  Stefan Kiefer   The complexity of the $K$ th largest
                                  subset problem and related problems  . . 111--115
               Chik How Tan and   
       Theo Fanuela Prabowo and   
                   Duc-Phong Le   Breaking an ID-based encryption based on
                                  discrete logarithm and factorization
                                  problems . . . . . . . . . . . . . . . . 116--119
            Ilario Bonacina and   
              Navid Talebanfard   Improving resolution width lower bounds
                                  for $k$-CNFs with applications to the
                                  Strong Exponential Time Hypothesis . . . 120--124
                    Pawel Parys   Weak containment for partial words is
                                  coNP-complete  . . . . . . . . . . . . . 125--127
              Mohamed Tolba and   
                 Amr M. Youssef   Generalized MitM attacks on full TWINE   128--135
            Cihangir Tezcan and   
        Ali Aydin Selçuk   Improved improbable differential attacks
                                  on ISO standard CLEFIA: Expansion
                                  technique revisited  . . . . . . . . . . 136--143
              Jethro G. Beekman   A Denial of Service attack against fair
                                  computations using Bitcoin deposits  . . 144--146
           Robert Bredereck and   
                  Nimrod Talmon   NP-hardness of two edge cover
                                  generalizations with applications to
                                  control and bribery for approval voting  147--152
                V. Edemskiy and   
                  A. Palvinskiy   The linear complexity of binary
                                  sequences of length $ 2 p $ with optimal
                                  three-level autocorrelation  . . . . . . 153--156
              Sergey Kitaev and   
             Vincent Vajnovszki   Mahonian STAT on words . . . . . . . . . 157--162
                   Jun Yuan and   
                      Aixia Liu   Sufficient conditions for triangle-free
                                  graphs to be super $k$-restricted
                                  edge-connected . . . . . . . . . . . . . 163--167
                Mun-Kyu Lee and   
             Pierre Michaud and   
             Jeong Seop Sim and   
                   DaeHun Nyang   A simple proof of optimality for the MIN
                                  cache replacement policy . . . . . . . . 168--170
                     Gelin Zhou   Two-dimensional range successor in
                                  optimal time and almost linear space . . 171--174
             Yuki Kobayashi and   
           Yuya Higashikawa and   
                Naoki Katoh and   
                   Adnan Sljoka   Characterizing redundant rigidity and
                                  redundant global rigidity of body-hinge
                                  graphs . . . . . . . . . . . . . . . . . 175--178
              Meena Mahajan and   
              Nitin Saurabh and   
       Sébastien Tavenas   VNP = VP in the multilinear world  . . . 179--182
              Wen-Chung Kuo and   
            Chun-Cheng Wang and   
                 Hong-Ching Hou   Signed digit data hiding scheme  . . . . 183--191
            Oualid Benamara and   
             Fatiha Merazka and   
                   Kamel Betina   An improvement of a cryptanalysis
                                  algorithm  . . . . . . . . . . . . . . . 192--196
             Sukhamay Kundu and   
             Subhashis Majumder   A linear time algorithm for optimal
                                  $k$-hop dominating set of a tree . . . . 197--202
             Sheng-yi Jiang and   
                   Lian-xi Wang   Efficient feature selection based on
                                  correlation measure between continuous
                                  and discrete features  . . . . . . . . . 203--215
      Alexander Chane Shiau and   
           Tzong-Huei Shiau and   
                    Yue-Li Wang   Corrigendum to ``Incidence coloring of
                                  Cartesian product graphs'' [Inf.
                                  Process. Lett. \bf 115 (2015) 765--768]  216
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 3, March, 2016

            Giuseppe Liotta and   
          Fabrizio Montecchiani   $L$-visibility drawings of IC-planar
                                  graphs . . . . . . . . . . . . . . . . . 217--222
              Gregory Gutin and   
          Magnus Wahlström   Tight lower bounds for the Workflow
                                  Satisfiability Problem based on the
                                  Strong Exponential Time Hypothesis . . . 223--226
            Chien Chin Chen and   
                    Yu-Chun Sun   Exploring acquaintances of social
                                  network site users for effective social
                                  event recommendations  . . . . . . . . . 227--236
              Hans Ulrich Simon   Efficient computation of approximate
                                  isomorphisms between Boolean functions   237--240
               Dmitry Kosolobov   Computing runs on a general alphabet . . 241--244
              Gabriele Fici and   
           Tomasz Kociumaka and   
          Jakub Radoszewski and   
            Wojciech Rytter and   
                 Tomasz Wale\'n   On the greedy algorithm for the Shortest
                                  Common Superstring problem with
                                  reversals  . . . . . . . . . . . . . . . 245--251
               Leah Epstein and   
           Hanan Zebedat-Haider   Online scheduling of unit jobs on three
                                  machines with rejection: a tight result  252--255
              Meena Mahajan and   
                    Anil Shukla   Level-ordered $Q$-resolution and
                                  tree-like $Q$-resolution are
                                  incomparable . . . . . . . . . . . . . . 256--258
                     Yu Liu and   
                     Kai Fu and   
                   Wei Wang and   
                   Ling Sun and   
                    Meiqin Wang   Linear cryptanalysis of reduced-round
                                  SPECK  . . . . . . . . . . . . . . . . . 259--266
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 4, April, 2016

                Peter Damaschke   Sufficient conditions for edit-optimal
                                  clusters . . . . . . . . . . . . . . . . 267--272
            Ján Katrenic   A faster FPT algorithm for $3$-path
                                  vertex cover . . . . . . . . . . . . . . 273--278
                      Robin Fay   Introducing the counter mode of
                                  operation to Compressed Sensing based
                                  encryption . . . . . . . . . . . . . . . 279--283
                   Georg Struth   On the expressive power of Kleene
                                  algebra with domain  . . . . . . . . . . 284--288
                 Shaoquan Jiang   On message authentication with a
                                  correlated setup . . . . . . . . . . . . 289--293
              Simone Dantas and   
              Luerbio Faria and   
 Celina M. H. de Figueiredo and   
             Rafael B. Teixeira   The $ (k, l) $ unpartitioned probe
                                  problem NP-complete versus polynomial
                                  dichotomy  . . . . . . . . . . . . . . . 294--298
                  Cheng-Nan Lai   On the construction of all shortest
                                  node-disjoint paths in star networks . . 299--303
       Salvatore Pontarelli and   
            Pedro Reviriego and   
           Juan Antonio Maestro   Improving counting Bloom filter
                                  performance with fingerprints  . . . . . 304--309
                   Yahui Wu and   
                    Su Deng and   
                  Hongbin Huang   Capacity and delay analysis in delay
                                  tolerant network with multiple
                                  communities  . . . . . . . . . . . . . . 310--315
                   Fang Xie and   
              Yuzhong Zhang and   
                Qingguo Bai and   
                         Zhe Xu   Inefficiency analysis of the scheduling
                                  game on limited identical machines with
                                  activation costs . . . . . . . . . . . . 316--320
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 5, May, 2016

        Mansour J. Algefari and   
         Khalid A. Alsatami and   
              Hong-Jian Lai and   
                       Juan Liu   Supereulerian digraphs with given local
                                  structures . . . . . . . . . . . . . . . 321--326
                Mahdi Amani and   
               Kevin A. Lai and   
               Robert E. Tarjan   Amortized rotation cost in AVL trees . . 327--330
                   Jiyou Li and   
                        Chu Luo   The simplified weighted sum function and
                                  its average sensitivity  . . . . . . . . 331--336
               Pedro Hokama and   
  Flávio K. Miyazawa and   
          Rafael C. S. Schouery   A bounded space algorithm for online
                                  circle packing . . . . . . . . . . . . . 337--342
                   Xie-Bin Chen   Hamiltonicity of hypercubes with faulty
                                  vertices . . . . . . . . . . . . . . . . 343--346
               Xiaoqing Tan and   
             Xiaoqian Zhang and   
                    Junbin Fang   Perfect quantum teleportation by
                                  four-particle cluster state  . . . . . . 347--350
                Huawang Qin and   
                     Yuewei Dai   Verifiable $ (t, n) $ threshold quantum
                                  secret sharing using $d$-dimensional
                                  Bell state . . . . . . . . . . . . . . . 351--355
           Szabolcs Iván   Complexity of atoms, combinatorially . . 356--360
          Ananda Swarup Das and   
                Prosenjit Gupta   Linear space adaptive data structures
                                  for planar range reporting . . . . . . . 361--366
            Mohammad Ehdaie and   
              Nikos Alexiou and   
           Mahmoud Ahmadian and   
         Mohammad Reza Aref and   
           Panos Papadimitratos   $2$D Hash Chain robust Random Key
                                  Distribution scheme  . . . . . . . . . . 367--372
       Baraka Jacob Maiseli and   
                     Huijun Gao   Robust edge detector based on
                                  anisotropic diffusion-driven process . . 373--378
            Alberto Caprara and   
               Fabio Furini and   
            Enrico Malaguti and   
              Emiliano Traversi   Solving the Temporal Knapsack Problem
                                  via Recursive Dantzig--Wolfe
                                  Reformulation  . . . . . . . . . . . . . 379--386
           Ali Reza Ashrafi and   
             Jernej Azarija and   
                 Azam Babai and   
      Khadijeh Fathalikhani and   
                  Sandi Klavzar   The (non-)existence of perfect codes in
                                  Fibonacci cubes  . . . . . . . . . . . . 387--390
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 6, June, 2016

       Ekkehard Köhler and   
                Lalla Mouatadid   A linear time algorithm to compute a
                                  maximum weighted independent set on
                                  cocomparability graphs . . . . . . . . . 391--395
                  Chao Yang and   
                   Bing Yao and   
                        Han Ren   A note on graph proper total colorings
                                  with many distinguishing constraints . . 396--400
                Enqiang Zhu and   
                  Zepeng Li and   
                 Zehui Shao and   
                         Jin Xu   Acyclically $4$-colorable triangulations 401--408
        Cinzia Bernardeschi and   
                Andrea Domenici   Verifying safety properties of a
                                  nonlinear control by interactive theorem
                                  proving with the Prototype Verification
                                  System . . . . . . . . . . . . . . . . . 409--415
                   Zhen Qin and   
                  Chen Yuan and   
                 Yilei Wang and   
                       Hu Xiong   On the security of two identity-based
                                  signature schemes based on pairings  . . 416--418
                  Meirav Zehavi   A randomized algorithm for long directed
                                  cycle  . . . . . . . . . . . . . . . . . 419--422
                  Eike Best and   
                 Javier Esparza   Existence of home states in Petri nets
                                  is decidable . . . . . . . . . . . . . . 423--427
                  Tobias Storch   Black-box complexity: Advantages of
                                  memory usage . . . . . . . . . . . . . . 428--432
            Florian Barbero and   
              Gregory Gutin and   
                 Mark Jones and   
                  Bin Sheng and   
                     Anders Yeo   Linear-vertex kernel for the problem of
                                  packing $r$-stars into a graph without
                                  long induced paths . . . . . . . . . . . 433--436
            Xavier Molinero and   
               Martin Olsen and   
                    Maria Serna   On the complexity of exchanging  . . . . 437--441
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 7, July, 2016

               Frederik Harwath   A note on the size of prenex normal
                                  forms  . . . . . . . . . . . . . . . . . 443--446
                   Bin Yang and   
                    Jie Luo and   
                   Ling Guo and   
                     Fang Cheng   Simultaneous image fusion and
                                  demosaicing via compressive sensing  . . 447--454
                        Ke Chen   Improved neural dynamics for online
                                  Sylvester equations solving  . . . . . . 455--459
             Jou-Ming Chang and   
             Xiang-Rui Chen and   
           Jinn-Shyong Yang and   
                       Ro-Yu Wu   Locally exchanged twisted cubes:
                                  Connectivity and super connectivity  . . 460--466
           Egor V. Kostylev and   
            Juan L. Reutter and   
                  Domagoj Vrgoc   Static analysis of navigational XPath
                                  over graph databases . . . . . . . . . . 467--474
         Sourav Chakraborty and   
              Akshay Kamath and   
               Rameshwar Pratap   Testing whether the uniform distribution
                                  is a stationary distribution . . . . . . 475--480
           Khodakhast Bibak and   
            Bruce M. Kapron and   
           Venkatesh Srinivasan   MMH$^\ast $ with arbitrary modulus is
                                  always almost-universal  . . . . . . . . 481--483
          Yonah Cherniavsky and   
          Avraham Goldstein and   
             Vadim E. Levit and   
                 Robert Shwartz   Enumeration of balanced finite group
                                  valued functions on directed graphs  . . 484--488
              Peter Sanders and   
               Christian Schulz   Scalable generation of scale-free graphs 489--491
               Syh-Yuan Tan and   
                    Wun-She Yap   Cryptanalysis of a CP--ABE scheme with
                                  policy in normal forms . . . . . . . . . 492--495
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 8, August, 2016

               Xinyin Xiang and   
                     Hui Li and   
                Mingyu Wang and   
                   Xingwen Zhao   Efficient multi-party concurrent
                                  signature from lattices  . . . . . . . . 497--502
                  Jinwen Ou and   
              Xueling Zhong and   
                   Chung-Lun Li   Faster algorithms for single machine
                                  scheduling with release dates and
                                  rejection  . . . . . . . . . . . . . . . 503--507
                   Yao Chen and   
               Kang G. Shin and   
                  Huagang Xiong   Generalizing fixed-priority scheduling
                                  for better schedulability in
                                  mixed-criticality systems  . . . . . . . 508--512
         Eduardo Lalla-Ruiz and   
Christopher Expósito-Izquierdo and   
Belén Melián-Batista and   
          J. Marcos Moreno-Vega   A Hybrid Biased Random Key Genetic
                                  Algorithm for the Quadratic Assignment
                                  Problem  . . . . . . . . . . . . . . . . 513--520
                 Gillat Kol and   
                        Ran Raz   Bounds on $2$-query Locally Testable
                                  Codes with affine tests  . . . . . . . . 521--525
                  Yang Fang and   
                       Xiwen Lu   Online parallel-batch scheduling to
                                  minimize total weighted completion time
                                  on single unbounded machine  . . . . . . 526--531
                     Jin Xu and   
                  Zepeng Li and   
                    Enqiang Zhu   On purely tree-colorable planar graphs   532--536
               Shiteng Chen and   
   Periklis A. Papakonstantinou   Correlation lower bounds from
                                  correlation upper bounds . . . . . . . . 537--540
      Konstantinos A. Draziotis   (EC)DSA lattice attacks based on
                                  Coppersmith's method . . . . . . . . . . 541--545
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 9, September, 2016

          Yasuaki Kobayashi and   
                   Hisao Tamaki   A faster fixed parameter algorithm for
                                  two-layer crossing minimization  . . . . 547--549
               Kenjiro Takazawa   A $ 7 / 6$-approximation algorithm for
                                  the minimum $2$-edge connected subgraph
                                  problem in bipartite cubic graphs  . . . 550--553
               Haisheng Tan and   
               Hongyu Liang and   
                   Rui Wang and   
                    Jipeng Zhou   Computing Roman domatic number of graphs 554--559
               Omar Darwish and   
                  Kurt Mehlhorn   Improved balanced flow computation using
                                  parametric flow  . . . . . . . . . . . . 560--563
      Dániel Gerbner and   
      Balázs Keszegh and   
                Cory Palmer and   
Dömötör Pálvölgyi   Topological orderings of weighted
                                  directed acyclic graphs  . . . . . . . . 564--568
             Masashi Kiyomi and   
                    Yota Otachi   Finding a chain graph in a bipartite
                                  permutation graph  . . . . . . . . . . . 569--573
               Shiying Wang and   
                    Weiping Han   The $g$-good-neighbor conditional
                                  diagnosability of $n$-dimensional
                                  hypercubes under the MM$^\ast $ model    574--577
                    Kaito Fujii   Faster approximation algorithms for
                                  maximizing a monotone submodular
                                  function subject to a $b$-matching
                                  constraint . . . . . . . . . . . . . . . 578--584
              Y-Chuang Chen and   
                 Tsung-Han Tsai   Hamiltonian decomposition of generalized
                                  recursive circulant graphs . . . . . . . 585--589
              Mehdy Roayaei and   
           Mohammadreza Razzazi   An FPT-algorithm for modifying a graph
                                  of bounded treewidth to decrease the
                                  size of its dominating set using minimum
                                  modification . . . . . . . . . . . . . . 590--594
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 10, October, 2016

                    Fan Guo and   
                   Hui Peng and   
                       Jin Tang   Genetic algorithm-based parameter
                                  selection approach to single image
                                  defogging  . . . . . . . . . . . . . . . 595--602
                    Jia Sun and   
               Shiheng Wang and   
                        Ke Wang   Zhang neural networks for a set of
                                  linear matrix inequalities with
                                  time-varying coefficient matrix  . . . . 603--610
              Jong-Min Park and   
           Hyung-Jeong Yang and   
              Jae-Dong Yang and   
                 Dong-Hoon Choi   A technique for the concept-based
                                  detection of functional modules in an
                                  interaction network  . . . . . . . . . . 611--617
               Hoda Jannati and   
                  Behnam Bahrak   Security analysis of an RFID tag search
                                  protocol . . . . . . . . . . . . . . . . 618--622
                 Liang Yang and   
                   Bing Liu and   
                Hongfei Lin and   
                       Yuan Lin   Combining local and global information
                                  for product feature extraction in
                                  opinion documents  . . . . . . . . . . . 623--627
                Michele Borassi   A note on the complexity of computing
                                  the number of reachable vertices in a
                                  digraph  . . . . . . . . . . . . . . . . 628--630
            Divesh Aggarwal and   
                  Chandan Dubey   Improved hardness results for unique
                                  shortest vector problem  . . . . . . . . 631--637
             Arnaud Carayol and   
                  Olivier Serre   Marking shortest paths on pushdown
                                  graphs does not preserve MSO
                                  decidability . . . . . . . . . . . . . . 638--643
                   Xia Hong and   
                    Qinghai Liu   Degree condition for completely
                                  independent spanning trees . . . . . . . 644--648
               Gregory J. Puleo   Complexity of a disjoint matching
                                  problem on bipartite graphs  . . . . . . 649--652
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 11, November, 2016

                 Yalin Song and   
                  Yaoru Sun and   
                 Hong Zhang and   
                      Fang Wang   Activity testing model for automatic
                                  correction of hand pointing  . . . . . . 653--659
                Ali Dehghan and   
          Mohammad-Reza Sadeghi   On the algorithmic complexity of
                                  zero-sum edge-coloring . . . . . . . . . 660--667
                Junqing Cai and   
                  Yuzhong Zhang   Fan-type implicit-heavy subgraphs for
                                  hamiltonicity of implicit claw-heavy
                                  graphs . . . . . . . . . . . . . . . . . 668--673
               Lingfeng Liu and   
                Suoxia Miao and   
              Mengfan Cheng and   
                   Xiaojing Gao   A pseudorandom bit generator based on
                                  new multi-delayed Chebyshev map  . . . . 674--681
       Michael Mitzenmacher and   
                  Vikram Nathan   Hardness of peeling with stashes . . . . 682--688
               Kung-Jui Pai and   
             Jou-Ming Chang and   
               Jinn-Shyong Yang   Vertex-transitivity on folded crossed
                                  cubes  . . . . . . . . . . . . . . . . . 689--693
                  Tero Laihonen   The metric dimension for resolving
                                  several objects  . . . . . . . . . . . . 694--700
             Alexandre Mota and   
              Juliano Iyoda and   
         Heitor Maranhão   Program synthesis by model finding . . . 701--705
                     Ehab Morsy   An extension of Hall's theorem for
                                  partitioned bipartite graphs . . . . . . 706--709
              Rafal Kapelko and   
             Evangelos Kranakis   On the displacement for covering a unit
                                  interval with randomly placed sensors    710--717
            Anke van Zuylen and   
               James Bieron and   
           Frans Schalekamp and   
                       Gexin Yu   A tight upper bound on the number of
                                  cyclically adjacent transpositions to
                                  sort a permutation . . . . . . . . . . . 718--722
                  Chao Wang and   
            René Sitters   On some special cases of the restricted
                                  assignment problem . . . . . . . . . . . 723--728
           Christopher S. Henry   The (nested) word problem  . . . . . . . 729--734
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Information Processing Letters
Volume 116, Number 12, December, 2016

                  Chuan Guo and   
            Jeffrey Shallit and   
                 Arseny M. Shur   Palindromic rich words and run-length
                                  encodings  . . . . . . . . . . . . . . . 735--738
        Faisal N. Abu-Khzam and   
                Pinar Heggernes   Enumerating minimal dominating sets in
                                  chordal graphs . . . . . . . . . . . . . 739--743
              Toan Thang Ta and   
              Cheng-Yao Lin and   
                   Chin Lung Lu   An efficient algorithm for computing
                                  non-overlapping inversion and
                                  transposition distance . . . . . . . . . 744--749
                 Meng Zhang and   
                   Yi Zhang and   
                       Chen Hou   Compact representations of automata for
                                  regular expression matching  . . . . . . 750--756
               Zohir Bouzid and   
                Damien Imbs and   
                  Michel Raynal   A necessary condition for Byzantine
                                  $k$-set agreement  . . . . . . . . . . . 757--759
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 117, Number ??, January, 2017

 Georg von der Brüggen and   
              Jian-Jia Chen and   
            Robert I. Davis and   
                 Wen-Hung Huang   Exact speedup factors for linear-time
                                  schedulability tests for fixed-priority
                                  preemptive and non-preemptive scheduling 1--5
                 Wojciech Widel   Clique-heavy subgraphs and pancyclicity
                                  of $2$-connected graphs  . . . . . . . . 6--9
                 Dongjin Yu and   
                  Yunlei Mu and   
                       Yike Jin   Rating prediction using review texts
                                  with underlying sentiments . . . . . . . 10--18
                   Bo Zhang and   
                  Qianmu Li and   
                    Yuanyuan Ma   Research on dynamic heuristic scanning
                                  technique and the application of the
                                  malicious code detection model . . . . . 19--24
                S. Sasikala and   
S. Appavu alias Balamurugan and   
                      S. Geetha   A novel adaptive feature selector for
                                  supervised classification  . . . . . . . 25--34
              Benson Joeris and   
             Nathan Lindzey and   
          Ross M. McConnell and   
                   Nissa Osheim   Simple DFS on the complement of a graph
                                  and on partially complemented digraphs   35--39
Keaitsuda Maneeruk Nakprasit and   
            Kittikorn Nakprasit   The strong equitable vertex
                                  $2$-arboricity of complete bipartite and
                                  tripartite graphs  . . . . . . . . . . . 40--44
Félix Carvalho Rodrigues and   
         Eduardo Candido Xavier   Non-cooperative capacitated facility
                                  location games . . . . . . . . . . . . . 45--53
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 118, Number ??, February, 2017

               Yi-Jun Chang and   
                   Hsu-Chun Yen   Area-universal drawings of biconnected
                                  outerplane graphs  . . . . . . . . . . . 1--5
          P.-C. Héam and   
                   V. Hugot and   
                O. Kouchnarenko   The emptiness problem for tree automata
                                  with at least one global disequality
                                  constraint is NP-hard  . . . . . . . . . 6--9
          Khaled Elbassioni and   
             Trung Thanh Nguyen   A polynomial-time algorithm for
                                  computing low CP-rank decompositions . . 10--14
                Jesper Nederlof   A short note on Merlin--Arthur protocols
                                  for subset sum . . . . . . . . . . . . . 15--16
                Thorsten Ehlers   Merging almost sorted sequences yields a
                                  $ 24$-sorter . . . . . . . . . . . . . . 17--20
                 Minjia Shi and   
                 Liqin Qian and   
                    Yan Liu and   
            Patrick Solé   Good self-dual generalized quasi-cyclic
                                  codes exist  . . . . . . . . . . . . . . 21--24
            Shahram Khazaei and   
                 Siavash Ahmadi   Ciphertext-only attack on $ d \times d $
                                  Hill in $ O(d 13^d) $  . . . . . . . . . 25--29
            Felipe A. Louza and   
                  Simon Gog and   
            Guilherme P. Telles   Optimal suffix sorting and LCP array
                                  construction for constant alphabets  . . 30--34
    Stéphane Gaubert and   
                       Zheng Qu   Checking strict positivity of Kraus maps
                                  is NP-hard . . . . . . . . . . . . . . . 35--43
                Slawomir Lasota   Equivariant algorithms for constraint
                                  satisfaction problems over coset
                                  templates  . . . . . . . . . . . . . . . 44--52
              Yuri Grinberg and   
            Theodore J. Perkins   Fully polynomial-time computation of
                                  maximum likelihood trajectories in
                                  Markov chains  . . . . . . . . . . . . . 53--57
             Guilhem Gamard and   
      Gwenaël Richomme and   
            Jeffrey Shallit and   
                Taylor J. Smith   Periodicity in rectangular arrays  . . . 58--63
              Zuosong Liang and   
                Erfang Shan and   
                    Liying Kang   The clique-transversal set problem in
                                  claw, $ K_4 $-free planar graphs . . . . 64--68
             Fabio Gadducci and   
              Francesco Santini   Residuation for bipolar preferences in
                                  soft constraints . . . . . . . . . . . . 69--74
              Robert Mercas and   
                   Dirk Nowotka   A note on Thue games . . . . . . . . . . 75--77
             Marius Nicolae and   
        Sanguthevar Rajasekaran   On pattern matching with $k$ mismatches
                                  and few don't cares  . . . . . . . . . . 78--82
                     Sen Su and   
                   Sen Zhao and   
                Xiang Cheng and   
                    Rong Bi and   
                    Xin Cao and   
                       Jie Wang   Group-based collective keyword querying
                                  in road networks . . . . . . . . . . . . 83--90
      Guillermo A. Pérez   The fixed initial credit problem for
                                  partial-observation energy games is
                                  Ack-complete . . . . . . . . . . . . . . 91--99
Christian Fernández-Campusano and   
               Mikel Larrea and   
    Roberto Cortiñas and   
                  Michel Raynal   A distributed leader election algorithm
                                  in crash-recovery and omissive systems   100--104
          Chang-Hsiung Tsai and   
               Jheng-Cheng Chen   Diagnosable evaluation of enhanced
                                  optical transpose interconnection system
                                  networks . . . . . . . . . . . . . . . . 105--109
                      M. Li and   
                         Q. Liu   Inexact feasibility pump for mixed
                                  integer nonlinear programming  . . . . . 110--116
                Peter Damaschke   Refined algorithms for hitting many
                                  intervals  . . . . . . . . . . . . . . . 117--122
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 119, Number ??, March, 2017

 Mostafa Haghir Chehreghani and   
               Talel Abdessalem   Upper and lower bounds for the
                                  $q$-entropy of network models with
                                  application to network model selection   1--8
                 Zhao Zhang and   
                Xiaoting Li and   
                 Yishuo Shi and   
                Hongmei Nie and   
                     Yuqing Zhu   PTAS for minimum $k$-path vertex cover
                                  in ball graph  . . . . . . . . . . . . . 9--13
                  Zepeng Li and   
                         Jin Xu   A characterization of trees with equal
                                  independent domination and secure
                                  domination numbers . . . . . . . . . . . 14--18
                 Junhu Wang and   
              Jeffrey Xu Yu and   
                  Jixue Liu and   
                    Chaoyi Pang   A revised result on chasing tree
                                  patterns under schema graphs . . . . . . 19--24
      Satyanarayana Vollala and   
             Ramasubramanian N.   Energy efficient modular exponentiation
                                  for public-key cryptography based on bit
                                  forwarding techniques  . . . . . . . . . 25--38
                Rundan Xing and   
                        Bo Zhou   On the two largest distance eigenvalues
                                  of graph powers  . . . . . . . . . . . . 39--43
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 120, Number ??, April, 2017

            Sandip Banerjee and   
    Bhargab B. Bhattacharya and   
         Binay Bhattacharya and   
             Arindam Biswas and   
                 Sandip Das and   
            Ritankar Mandal and   
                    Sasanka Roy   On representing a simple polygon
                                  perceivable to a blind person  . . . . . 1--5
                   Cheng He and   
                        Hao Lin   Notes on a hierarchical scheduling
                                  problem on identical machines  . . . . . 6--10
            Alberto Giudici and   
           Pascal Halffmann and   
              Stefan Ruzika and   
                Clemens Thielen   Approximation schemes for the parametric
                                  knapsack problem . . . . . . . . . . . . 11--15
              Patrizio Angelini   Monotone drawings of graphs with few
                                  directions . . . . . . . . . . . . . . . 16--22
                     Kai Li and   
                 Daowen Qiu and   
                  Lvzhou Li and   
             Shenggen Zheng and   
                  Zhenbang Rong   Application of distributed semi-quantum
                                  computing model in phase estimation  . . 23--29
          Evgeny Sherkhonov and   
                   Maarten Marx   Containment of acyclic conjunctive
                                  queries with negated atoms or arithmetic
                                  comparisons  . . . . . . . . . . . . . . 30--39
               Euiwoong Lee and   
            Melanie Schmidt and   
                    John Wright   Improved and simplified
                                  inapproximability for $k$-means  . . . . 40--43
           Davood Bakhshesh and   
                Mohammad Farshi   Angle-constrained spanners with angle at
                                  least $ \pi / 3 $  . . . . . . . . . . . 44--46
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 121, Number ??, May, 2017

        Sugata Gangopadhyay and   
               Enes Pasalic and   
         Pantelimon Stanica and   
                    Saral Datta   A note on non-splitting $ \mathbb {Z}
                                  $-bent functions . . . . . . . . . . . . 1--5
          Akitoshi Kawamura and   
               Yuichi Tatsu and   
                  Yushi Uno and   
                Masahide Yamato   Morpion Solitaire 5D: a new upper bound
                                  of $ 121 $ on the maximum score  . . . . 6--10
            Adisak Supeesun and   
          Jittat Fakcharoenphol   Learning network structures from
                                  contagion  . . . . . . . . . . . . . . . 11--16
                  Karthik C. S.   Did the train reach its destination: the
                                  complexity of finding a witness  . . . . 17--21
          Luiz Emilio Allem and   
                  Carlos Hoppen   A pre-test for factoring bivariate
                                  polynomials with coefficients in $
                                  \mathbb {F}_2 $  . . . . . . . . . . . . 22--28
               Arman Boyaci and   
                 Tinaz Ekim and   
               Mordechai Shalom   A polynomial-time algorithm for the
                                  maximum cardinality cut problem in
                                  proper interval graphs . . . . . . . . . 29--33
              Hon-Chan Chen and   
                Yun-Hao Zou and   
                Yue-Li Wang and   
                   Kung-Jui Pai   A note on path embedding in crossed
                                  cubes with faulty vertices . . . . . . . 34--38
               Julien Baste and   
             Fairouz Beggas and   
        Hamamache Kheddouci and   
                     Ignasi Sau   On the parameterized complexity of the
                                  Edge Monitoring problem  . . . . . . . . 39--44
        Aleksandar Radonjic and   
               Vladimir Vujicic   Integer codes correcting single errors
                                  and burst asymmetric errors within a
                                  byte . . . . . . . . . . . . . . . . . . 45--50
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 122, Number ??, June, 2017

              Min-Sheng Lin and   
                 Chien-Min Chen   Linear-time algorithms for counting
                                  independent sets in bipartite
                                  permutation graphs . . . . . . . . . . . 1--7
               Toni Mancini and   
              Federico Mari and   
           Annalisa Massini and   
               Igor Melatti and   
                Ivano Salvo and   
                  Enrico Tronci   On minimising the maximum expected
                                  verification time  . . . . . . . . . . . 8--16
                   Euiwoong Lee   APX-hardness of maximizing Nash social
                                  welfare with indivisible items . . . . . 17--20
              Nikhil Bansal and   
            Seeun William Umboh   Tight approximation bounds for
                                  dominating set on graphs of bounded
                                  arboricity . . . . . . . . . . . . . . . 21--24
      Krishnendu Chatterjee and   
                    Georg Osang   Pushdown reachability with constant
                                  treewidth  . . . . . . . . . . . . . . . 25--29
                Izak Broere and   
              Gabriel Semanisin   Some bounds on the generalised total
                                  chromatic number of degenerate graphs    30--33
               Ertem Esiner and   
                Anwitaman Datta   On query result integrity over encrypted
                                  data . . . . . . . . . . . . . . . . . . 34--39
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 123, Number ??, July, 2017

J. M. Díaz-Báñez and   
           R. Fabila-Monroy and   
    P. Pérez-Lantero and   
                     I. Ventura   New results on the coarseness of
                                  bicolored point sets . . . . . . . . . . 1--7
                  Paul C. Attie   Finite-state concurrent programs can be
                                  expressed succinctly in triple normal
                                  form . . . . . . . . . . . . . . . . . . 8--13
                       Zhe Chen   Parametric runtime verification is
                                  NP-complete and coNP-complete  . . . . . 14--20
                 Peng Zhang and   
             Mikhail J. Atallah   On approximate pattern matching with
                                  thresholds . . . . . . . . . . . . . . . 21--26
                 Wanbin Son and   
               Fabian Stehn and   
           Christian Knauer and   
                    Hee-Kap Ahn   Top-$k$ Manhattan spatial skyline
                                  queries  . . . . . . . . . . . . . . . . 27--35
            Vincent Moulton and   
               James Oldman and   
                     Taoyang Wu   A cubic-time algorithm for computing the
                                  trinet distance between level-1 networks 36--41
               Pascal Ochem and   
              Nazanin Movarraei   Oriented, $2$-edge-colored, and
                                  $2$-vertex-colored homomorphisms . . . . 42--46
               Kfir Lev-Ari and   
           Edward Bortnikov and   
                Idit Keidar and   
               Alexander Shraer   Composing ordered sequential consistency 47--50
  Abdulrakeeb M. Al-Ssulami and   
                Hassan Mathkour   Faster string matching based on hashing
                                  and bit-parallelism  . . . . . . . . . . 51--55
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 124, Number ??, August, 2017

          Zbigniew Kokosi\'nski   On generation of permutations of $m$ out
                                  of $n$ items . . . . . . . . . . . . . . 1--5
                  Abhisek Kundu   Relaxed leverage sampling for low-rank
                                  matrix completion  . . . . . . . . . . . 6--9
               Yong-Jin Liu and   
                   Dian Fan and   
                  Chunxu Xu and   
                        Ying He   Space complexity of exact discrete
                                  geodesic algorithms on regular
                                  triangulations . . . . . . . . . . . . . 10--14
               Yong-Jin Han and   
             Seong-Bae Park and   
                  Se-Young Park   Personalized app recommendation using
                                  spatio-temporal app usage log  . . . . . 15--20
                   Louis Ibarra   Computing the clique-separator graph for
                                  an interval graph in linear time . . . . 21--25
       Carlos V. G. C. Lima and   
          Dieter Rautenbach and   
   Uéverton S. Souza and   
           Jayme L. Szwarcfiter   Decycling with a matching  . . . . . . . 26--29
               Yunong Zhang and   
               Yaqiong Ding and   
                 Binbin Qiu and   
               Yinyan Zhang and   
                    Xiaodong Li   Signum-function array activated ZNN with
                                  easier circuit implementation and
                                  finite-time convergence for linear
                                  systems solving  . . . . . . . . . . . . 30--34
           Oswin Aichholzer and   
               Thomas Hackl and   
              Matias Korman and   
           Marc van Kreveld and   
       Maarten Löffler and   
             Alexander Pilz and   
          Bettina Speckmann and   
                      Emo Welzl   Packing plane spanning trees and paths
                                  in complete geometric graphs . . . . . . 35--41
             Chun Jiang Zhu and   
                    Kam-Yiu Lam   Source-wise round-trip spanners  . . . . 42--45
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 125, Number ??, September, 2017

                   Kensuke Baba   An acceleration of FFT-based algorithms
                                  for the match-count problem  . . . . . . 1--4
Lukás Folwarczný and   
                     Dusan Knop   IV-matching is strongly NP-hard  . . . . 5--8
                 Martijn van Ee   Some notes on bounded starwidth graphs   9--14
                 Joe Sawada and   
                Patrick Hartman   Finding the largest fixed-density
                                  necklace and Lyndon word . . . . . . . . 15--19
     Andreas Björklund and   
             Thore Husfeldt and   
                  Isak Lyckberg   Computing the permanent modulo a prime
                                  power  . . . . . . . . . . . . . . . . . 20--25
               Dmitry Kosolobov   Tight lower bounds for the longest
                                  common extension problem . . . . . . . . 26--29
                Weihua Yang and   
                 Shuli Zhao and   
                  Shurong Zhang   Strong Menger connectivity with
                                  conditional faults of folded hypercubes  30--34
                    Ting Yu and   
                    Mengchi Liu   A linear time algorithm for maximal
                                  clique enumeration in large sparse
                                  graphs . . . . . . . . . . . . . . . . . 35--40
              Weiguang Peng and   
              NingNing Peng and   
                KengMeng Ng and   
            Kazuyuki Tanaka and   
                       Yue Yang   Optimal depth-first algorithms and
                                  equilibria of independent distributions
                                  on multi-branching trees . . . . . . . . 41--45
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 126, Number ??, October, 2017

               Moacir Ponti and   
                    Mateus Riva   An incremental linear-time learning
                                  algorithm for the Optimum-Path Forest
                                  classifier . . . . . . . . . . . . . . . 1--6
                   Alfredo Rial   Issuer-free oblivious transfer with
                                  access control revisited . . . . . . . . 7--11
             Bostjan Bresar and   
             Michael A. Henning   The game total domination problem is
                                  log-complete in PSPACE . . . . . . . . . 12--17
           Klaus Broelemann and   
               Xiaoyi Jiang and   
          Sudipto Mukherjee and   
            Ananda S. Chowdhury   Variants of $k$-regular nearest neighbor
                                  graph and their construction . . . . . . 18--23
         Michael Holzhauser and   
             Sven O. Krumke and   
                Clemens Thielen   On the complexity and approximability of
                                  budget-constrained minimum cost flows    24--29
                  Michael Brand   Small polyomino packing  . . . . . . . . 30--34
            Malik Magdon-Ismail   NP-hardness and inapproximability of
                                  sparse PCA . . . . . . . . . . . . . . . 35--38
                Alan Frieze and   
                Michael Anastos   Randomly coloring simple hypergraphs
                                  with fewer colors  . . . . . . . . . . . 39--42
         Michael Holzhauser and   
                 Sven O. Krumke   An FPTAS for the parametric knapsack
                                  problem  . . . . . . . . . . . . . . . . 43--47
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 127, Number ??, November, 2017

            Erik D. Demaine and   
              Varun Ganesan and   
        Vladislav Kontsevoi and   
                 Qipeng Liu and   
               Quanquan Liu and   
                   Fermi Ma and   
                Ofir Nachum and   
              Aaron Sidford and   
            Erik Waingarten and   
                 Daniel Ziegler   Arboral satisfaction: Recognition and LP
                                  approximation  . . . . . . . . . . . . . 1--5
                 Zhaowei Xu and   
                   Wenhui Zhang   Linear templates of ACTL formulas with
                                  an application to SAT-based verification 6--16
                 Artur Menc and   
              Dominik Pajak and   
          Przemyslaw Uzna\'nski   Time and space optimality of
                                  rotor-router graph exploration . . . . . 17--20
           Mmanu Chaturvedi and   
              Ross M. McConnell   A note on finding minimum mean cycle . . 21--22
                         Hao Qi   Bounds on partial online list colouring  23--26
             Aline Saettler and   
              Eduardo Laber and   
     Felipe de A. Mello Pereira   Decision tree classification with
                                  bounded number of errors . . . . . . . . 27--31
                  Lijun Tan and   
               Shiheng Wang and   
                        Ke Wang   A new adaptive network-based fuzzy
                                  inference system with adaptive
                                  adjustment rules for stock market
                                  volatility forecasting . . . . . . . . . 32--36
        Konrad K. Dabrowski and   
           Daniël Paulusma   Contracting bipartite graphs to paths
                                  and cycles . . . . . . . . . . . . . . . 37--42
               Samaneh Mashhadi   New multi-stage secret sharing in the
                                  standard model . . . . . . . . . . . . . 43--48
Hüsnü Yenigün and   
           Nina Yevtushenko and   
                 Natalia Kushik   The complexity of checking the existence
                                  and derivation of adaptive synchronizing
                                  experiments for deterministic FSMs . . . 49--53
              Xiaoguang Bao and   
                Zhaohui Liu and   
                     Wei Yu and   
                    Ganggang Li   A note on approximation algorithms of
                                  the clustered traveling salesman problem 54--57
            Subhas C. Nandy and   
            Supantha Pandit and   
                    Sasanka Roy   Faster approximation for maximum
                                  independent set on unit disk graph . . . 58--61
        Gadi Aleksandrowicz and   
           Andrei Asinowski and   
              Gill Barequet and   
                Ronnie Barequet   Recovering highly-complex linear
                                  recurrences of integer sequences . . . . 62--66
                   Hu Xiong and   
                 Qiang Wang and   
                    Jianfei Sun   Comments on ``Circuit ciphertext-policy
                                  attribute-based hybrid encryption with
                                  verifiable delegation''  . . . . . . . . 67--70
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 128, Number ??, December, 2017

                       M. Rudow   Discrete Logarithm and Minimum Circuit
                                  Size . . . . . . . . . . . . . . . . . . 1--4
                      Yijie Han   Construct a perfect word hash function
                                  in time independent of the size of
                                  integers . . . . . . . . . . . . . . . . 5--10
            Hans Raj Tiwary and   
              Stefan Weltge and   
                 Rico Zenklusen   Extension complexities of Cartesian
                                  products involving a pyramid . . . . . . 11--13
               Ming Che Lee and   
              Sheng Yu Chiu and   
                  Jia Wei Chang   A Deep Convolutional Neural Network
                                  based Chinese Menu Recognition App . . . 14--20
                   Arne Leitert   $3$-colouring for dually chordal graphs
                                  and generalisations  . . . . . . . . . . 21--26
                Shinil Kwon and   
                   Sungdeok Cha   CAPTCHA-based image annotation . . . . . 27--31
Kristóf Bérczi and   
Erika R. Bérczi-Kovács   Directed hypergraphs and Horn
                                  minimization . . . . . . . . . . . . . . 32--37
            Debanjan Sadhya and   
             Sanjay Kumar Singh   Privacy risks ensuing from
                                  cross-matching among databases: a case
                                  study for soft biometrics  . . . . . . . 38--45
                   Pascal Ochem   $2$-subcoloring is NP-complete for
                                  planar comparability graphs  . . . . . . 46--48
          Attila Bernáth   Covering symmetric supermodular
                                  functions with graph edges: a short
                                  proof of a theorem of Benczúr and Frank   49--53
               Amihood Amir and   
       Costas S. Iliopoulos and   
              Jakub Radoszewski   Two strings at Hamming distance $1$
                                  cannot be both quasiperiodic . . . . . . 54--57
                  Fanica Gavril   New insights on GA-H reduced graphs  . . 58--61
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 129, Number ??, January, 2018

           Francesco Ald\`a and   
              Hans Ulrich Simon   A lower bound on the release of
                                  differentially private integer
                                  partitions . . . . . . . . . . . . . . . 1--4
                Jungjoo Seo and   
                    Kunsoo Park   Fast batch modular exponentiation with
                                  common-multiplicand multiplication . . . 5--10
           Shunsuke Inenaga and   
              Heikki Hyyrö   A hardness result and new algorithm for
                                  the longest common palindromic
                                  subsequence problem  . . . . . . . . . . 11--15
                   Moussa Demba   Equivalence checking of two functional
                                  programs using inductive theorem provers 16--24
              Matias Korman and   
           Sheung-Hung Poon and   
              Marcel Roeloffzen   Line segment covering of cells in
                                  arrangements . . . . . . . . . . . . . . 25--30
               Rajiv Gandhi and   
  Mohammad Taghi Hajiaghayi and   
               Guy Kortsarz and   
             Manish Purohit and   
               Kanthi Sarpatwar   On maximum leaf trees and connections to
                                  connected maximum cut problems . . . . . 31--34
                   Fabio Grandi   On the analysis of Bloom filters . . . . 35--39
                     Xing Huang   An implicit degree sum condition for
                                  cycles through specified vertices  . . . 40--43
              Deepak Panday and   
  Renato Cordeiro de Amorim and   
                     Peter Lane   Feature weighting as a tool for
                                  unsupervised feature selection . . . . . 44--52
                Yiqiao Wang and   
                  Ping Wang and   
                    Weifan Wang   Strong chromatic index of $K_4$-minor
                                  free graphs  . . . . . . . . . . . . . . 53--56
             Chun Jiang Zhu and   
                    Kam-Yiu Lam   Deterministic improved round-trip
                                  spanners . . . . . . . . . . . . . . . . 57--60
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 130, Number ??, February, 2017

              Daniel Lemire and   
                Nathan Kurz and   
                 Christoph Rupp   Stream VByte: Faster byte-oriented
                                  integer compression  . . . . . . . . . . 1--6
        Christian Ikenmeyer and   
                  Stefan Mengel   On the relative power of reduction
                                  notions in arithmetic circuit complexity 7--10
               Min Chih Lin and   
       Julián Mestre and   
               Saveliy Vasiliev   Approximating weighted neighborhood
                                  independent sets . . . . . . . . . . . . 11--15
                Yanwei Zhou and   
                        Bo Yang   Leakage-resilient CCA2-secure
                                  certificateless public-key encryption
                                  scheme without bilinear pairing  . . . . 16--24
                  Zepeng Li and   
                Enqiang Zhu and   
                 Zehui Shao and   
                         Jin Xu   NP-completeness of local colorings of
                                  graphs . . . . . . . . . . . . . . . . . 25--29
                Ruicong Zhi and   
                 Lianyu Cao and   
                       Gang Cao   Translation and scale invariants of
                                  Krawtchouk moments . . . . . . . . . . . 30--35
                     Po-An Chen   Generalized mirror descents with
                                  non-convex potential functions in atomic
                                  congestion games: Continuous time and
                                  discrete time  . . . . . . . . . . . . . 36--39
             Vincent Vajnovszki   The equidistribution of some
                                  length-three vincular patterns on $
                                  S_n(132) $ . . . . . . . . . . . . . . . 40--45
              Toan Thang Ta and   
              Cheng-Yao Lin and   
                   Chin Lung Lu   Two-string consensus problem under
                                  non-overlapping inversion and
                                  transposition distance . . . . . . . . . 46--51
                  Luis A. Leiva   Responsive text summarization  . . . . . 52--57
                 Sukhamay Kundu   A generalized linear time algorithm for
                                  an optimal $k$-distance dominating set
                                  of a weighted tree . . . . . . . . . . . 58--62
           Karol Kosi\'nski and   
              Robert Mercas and   
                   Dirk Nowotka   Corrigendum to ``A note on Thue
                                  games" [Inf. Process. Lett. \bf 118
                                  (2017) 75--77] . . . . . . . . . . . . . 63--65
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Information Processing Letters
Volume 131, Number ??, March, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
               Ravi Kishore and   
       Chiranjeevi Vanarasa and   
               Srinathan Kannan   On minimal connectivity requirements for
                                  secure message transmission in directed
                                  networks . . . . . . . . . . . . . . . . 1--6
                Kitti Gelle and   
           Szabolcs Iván   Recognizing Union-Find trees is
                                  NP-complete  . . . . . . . . . . . . . . 7--14
               Pavel Hrubes and   
            Pavel Pudlák   A note on monotone real circuits . . . . 15--19
             Byungjin Chung and   
                  Changhoon Yim   Fast intra prediction method by adaptive
                                  number of candidate modes for RDO in
                                  HEVC . . . . . . . . . . . . . . . . . . 20--25
              Marthe Bonamy and   
        Konrad K. Dabrowski and   
               Carl Feghali and   
            Matthew Johnson and   
           Daniël Paulusma   Independent feedback vertex sets for
                                  graphs of bounded diameter . . . . . . . 26--32
             Ku-Young Chang and   
                Sun-Mi Park and   
                 Dowon Hong and   
                    Changho Seo   Efficient multiplier based on hybrid
                                  approach for Toeplitz matrix-vector
                                  product  . . . . . . . . . . . . . . . . 33--38
                Alan Frieze and   
                 Samantha Petti   Balanced allocation through random walk  39--43
         Pietro Cenciarelli and   
              Daniele Gorla and   
                    Ivano Salvo   Inefficiencies in network models: A
                                  graph-theoretic perspective  . . . . . . 44--50
                 Xuehou Tan and   
                       Bo Jiang   An improved algorithm for computing a
                                  shortest watchman route for lines  . . . 51--54
       Kleitos Papadopoulos and   
          Demetres Christofides   A fast algorithm for the gas station
                                  problem  . . . . . . . . . . . . . . . . 55--59


Information Processing Letters
Volume 132, Number ??, April, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii


Information Processing Letters
Volume 133, Number ??, May, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
                  Chen Avin and   
          Alexandr Hercules and   
             Andreas Loukas and   
                  Stefan Schmid   rDAN: Toward robust demand-aware network
                                  designs  . . . . . . . . . . . . . . . . 5--9
           Evangelos Bampas and   
       Christina Karousatou and   
            Aris Pagourtzis and   
                Katerina Potika   Path multicoloring in spider graphs with
                                  even color multiplicity  . . . . . . . . 1--4
  Sébastien Bouchard and   
     Yoann Dieudonné and   
               Andrzej Pelc and   
                   Franck Petit   On deterministic rendezvous at a node of
                                  agents with arbitrary velocities . . . . 39--43
             Karl Bringmann and   
           Sebastian Krinninger   A note on hardness of diameter
                                  approximation  . . . . . . . . . . . . . 10--15
              Guillaume Ducoffe   A short note on the complexity of
                                  computing strong pathbreadth . . . . . . 56--58


Information Processing Letters
Volume 132, Number ??, April, 2018

          Günther Eder and   
                    Martin Held   Computing positively weighted straight
                                  skeletons of simple polygons based on a
                                  bisector arrangement . . . . . . . . . . 28--32


Information Processing Letters
Volume 133, Number ??, May, 2018

       M. S. Conserva Filho and   
          M. V. M. Oliveira and   
                 A. Sampaio and   
                 Ana Cavalcanti   Compositional and local livelock
                                  analysis for CSP . . . . . . . . . . . . 21--25


Information Processing Letters
Volume 132, Number ??, April, 2018

                     Adam Polak   Why is it hard to beat $ O(n^2) $ for
                                  Longest Common Weakly Increasing
                                  Subsequence? . . . . . . . . . . . . . . 1--5
                     Dekel Tsur   Succinct data structures for nearest
                                  colored node in a tree . . . . . . . . . 6--10
            Kaveh Khoshkhah and   
              Dirk Oliver Theis   Fooling sets and the Spanning Tree
                                  polytope . . . . . . . . . . . . . . . . 11--13
                 Nicolas Gillis   Multiplicative updates for polynomial
                                  root finding . . . . . . . . . . . . . . 14--18
                   Serge Haddad   Memoryless determinacy of finite parity
                                  games: Another simple proof  . . . . . . 19--21
                  Omrit Filtser   Universal approximate simplification
                                  under the discrete Fréchet distance . . . 22--27
          L. Boppre Niehues and   
         R. Custódio and   
                     D. Panario   Fast modular reduction and squaring in $
                                  {\rm GF} (2^m) $ . . . . . . . . . . . . 33--38
               Shir Fiszman and   
                   Gur Mosheiov   Minimizing total load on a proportionate
                                  flowshop with position-dependent
                                  processing times and job-rejection . . . 39--43
                     Irena Rusu   Sorting signed permutations by reversals
                                  using link-cut trees . . . . . . . . . . 44--48
                 Zhiren Sun and   
                   Sizhong Zhou   A generalization of orthogonal
                                  factorizations in digraphs . . . . . . . 49--54
            Thiago Marcilon and   
                 Rudini Sampaio   The $ P_3 $ infection time is $ W[1]
                                  $-hard parameterized by the treewidth    55--61


Information Processing Letters
Volume 133, Number ??, May, 2018

                    Or Meir and   
                    Avishay Tal   The choice and agreement problems of a
                                  random function  . . . . . . . . . . . . 16--20
                  S. Maneth and   
                       H. Seidl   Balancedness of MSO transductions in
                                  polynomial time  . . . . . . . . . . . . 26--32
             Sattar Sattari and   
                 Mohammad Izadi   Upper bounds for minimum dilation
                                  triangulation in two special cases . . . 33--38
             Tiphaine Viard and   
    Clémence Magnien and   
                Matthieu Latapy   Enumerating maximal cliques in link
                                  streams with durations . . . . . . . . . 44--48
               Jacinto Reis and   
                 Alexandre Mota   Aiding exploratory testing with pruned
                                  GUI models . . . . . . . . . . . . . . . 49--55


Information Processing Letters
Volume 134, Number ??, June, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
                 Ting Jiang and   
                  XiaoJian Zhou   Gradient/Hessian-enhanced least square
                                  support vector regression  . . . . . . . 1--8
                Junqing Cai and   
                     Hao Li and   
                  Yuzhong Zhang   An implicit degree condition for
                                  $k$-connected $2$-heavy graphs to be
                                  Hamiltonian  . . . . . . . . . . . . . . 9--13
      Y. B. Venkatakrishnan and   
               B. Krishnakumari   An improved upper bound of edge-vertex
                                  domination number of a tree  . . . . . . 14--17
           Alexandre Dolgui and   
             Vladimir Kotov and   
    Aliaksandr Nekrashevich and   
                 Alain Quilliot   General parametric scheme for the online
                                  uniform machine scheduling problem with
                                  two different speeds . . . . . . . . . . 18--23
                   Hong Lai and   
               Mingxing Luo and   
             Josef Pieprzyk and   
                  Zhiguo Qu and   
                Mehmet A. Orgun   Efficient quantum key distribution using
                                  Fibonacci-number coding with a biased
                                  basis choice . . . . . . . . . . . . . . 24--30
               Xiujun Zhang and   
                  Zepeng Li and   
               Huiqin Jiang and   
                     Zehui Shao   Double Roman domination in trees . . . . 31--34
        Konrad K. Dabrowski and   
           Daniël Paulusma   On colouring $ (2 P_2, H) $-free and $
                                  (P_5, H) $-free graphs . . . . . . . . . 35--41
               Mingqiang An and   
                   Liming Xiong   Some results on the inverse sum indeg
                                  index of a graph . . . . . . . . . . . . 42--46
Sándor Vágvölgyi   Intersection of the reflexive transitive
                                  closures of two rewrite relations
                                  induced by term rewriting systems  . . . 47--51
                 Mei-Mei Gu and   
               Rong-Xia Hao and   
                  Jian-Bing Liu   The pessimistic diagnosability of data
                                  center networks  . . . . . . . . . . . . 52--56
           Miroslaw Kowaluk and   
                 Andrzej Lingas   Are unique subgraphs not easier to find? 57--61
         Stefan Dziembowski and   
              Tomasz Kazana and   
               Maciej Zdanowicz   Quasi chain rule for min-entropy . . . . 62--66
               Yuzhuo Zhang and   
                      Xia Zhang   On $f$-colorings of nearly bipartite
                                  graphs . . . . . . . . . . . . . . . . . 67--71
               Shangwei Lin and   
                 Ya'nan Jin and   
                    Chunfang Li   Cartesian product digraphs with optimal
                                  restricted arc connectivity  . . . . . . 72--75


Information Processing Letters
Volume 135, Number ??, July, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
                   Niek Tax and   
                    Xixi Lu and   
           Natalia Sidorova and   
               Dirk Fahland and   
        Wil M. P. van der Aalst   The imprecisions of precision measures
                                  in process mining  . . . . . . . . . . . 1--8
                Xiaoli Chen and   
                      Weijun Xu   A risk-reward model with compound
                                  interest rate for non-additive
                                  two-option ski rental  . . . . . . . . . 9--13
           Sihem Ben Jouida and   
               Saoussen Krichen   A DSS based on optimizer tools and MTS
                                  meta-heuristic for the Warehousing
                                  Problem with Conflicts . . . . . . . . . 14--21
    Letícia R. Bueno and   
             Lucia D. Penso and   
        Fábio Protti and   
            Victor R. Ramos and   
          Dieter Rautenbach and   
       Uéverton S. Souza   On the hardness of finding the geodetic
                                  number of a subcubic graph . . . . . . . 22--27
           Oswin Aichholzer and   
             Nieves Atienza and   
José M. Díaz-Báñez and   
          Ruy Fabila-Monroy and   
David Flores-Peñaloza and   
 Pablo Pérez-Lantero and   
         Birgit Vogtenhuber and   
                  Jorge Urrutia   Computing balanced islands in two
                                  colored point sets in the plane  . . . . 28--32
                  Martin Kochol   Three colorability characterized by
                                  shrinking of locally connected subgraphs
                                  into triangles . . . . . . . . . . . . . 33--35
             Philippe Moser and   
                  Frank Stephan   Limit-depth and DNR degrees  . . . . . . 36--40
            Alexander Thomasian   Vacationing server model for M/G/1
                                  queues for rebuild processing in RAID5
                                  and threshold scheduling for readers and
                                  writers  . . . . . . . . . . . . . . . . 41--46
               Simon Foster and   
             Ana Cavalcanti and   
               Jim Woodcock and   
                    Frank Zeyda   Unifying theories of time with
                                  generalised reactive processes . . . . . 47--52
       Mohammad Reza Kazemi and   
                Ali Mohades and   
             Payam Khanteimouri   Approximation algorithms for color
                                  spanning diameter  . . . . . . . . . . . 53--56
            M. Jonás and   
                    J. Strejcek   On the complexity of the quantified
                                  bit-vector arithmetic with binary
                                  encoding . . . . . . . . . . . . . . . . 57--61
                 Massimo Lauria   Cliques enumeration and tree-like
                                  resolution proofs  . . . . . . . . . . . 62--67
         Alexander Sakharov and   
               Timothy Sakharov   The Viterbi algorithm for subsets of
                                  stochastic context-free languages  . . . 68--72
        Martin Charles Golumbic   Total coloring of rooted path graphs . . 73--76
                  Minghui Jiang   Periodicity of identifying codes in
                                  strips . . . . . . . . . . . . . . . . . 77--84
                 Li-Dan Pei and   
             Xiang-Feng Pan and   
                      Fu-Tao Hu   Some improved inequalities related to
                                  Vizing's conjecture  . . . . . . . . . . 85--91
                Yaroslav Shitov   On the complexity of graph coloring with
                                  additional local conditions  . . . . . . 92--94


Information Processing Letters
Volume 136, Number ??, August, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
               Mengduo Yang and   
                Fanzhang Li and   
                   Li Zhang and   
                     Zhao Zhang   Deep learning algorithm with visual
                                  impression . . . . . . . . . . . . . . . 1--4
      Ashutosh Dhar Dwivedi and   
           Pawel Morawiecki and   
               Rajani Singh and   
                   Shalini Dhar   Differential-linear and related key
                                  cryptanalysis of round-reduced scream    5--8
               Lin-Zhi Shen and   
               Jie-Jing Wen and   
                    Fang-Wei Fu   A new class of zero-difference balanced
                                  functions  . . . . . . . . . . . . . . . 9--11
               Mengduo Yang and   
                Fanzhang Li and   
                   Li Zhang and   
                     Zhao Zhang   Lie group impression for deep learning   12--16
Étienne André and   
                  Shang-Wei Lin   The language preservation problem is
                                  undecidable for parametric
                                  event-recording automata . . . . . . . . 17--20
                   Hang Gao and   
                      Wenyu Gao   Maximum matching and kernelization of
                                  edge dominating set  . . . . . . . . . . 21--24
            Stefan Hoffmann and   
          Thomas Kampermann and   
                     Egon Wanke   Minimizing the number of max-power users
                                  in ad-hoc wireless networks with minimum
                                  node degree requirements . . . . . . . . 25--29
                 Mugang Lin and   
                Qilong Feng and   
               Jianxin Wang and   
                Jianer Chen and   
                     Bin Fu and   
                      Wenjun Li   An improved FPT algorithm for Almost
                                  Forest Deletion problem  . . . . . . . . 30--36
                 Xiaomin Li and   
                    Lan Lei and   
                  Hong-Jian Lai   The connectivity of generalized graph
                                  products . . . . . . . . . . . . . . . . 37--40
                 Hailiang Zhang   On the largest matching roots of graphs
                                  with cut edges . . . . . . . . . . . . . 41--43
             Chuangying Zhu and   
                     Junping Du   Background feature clustering and its
                                  application to social text . . . . . . . 44--48
                  Kejing Lu and   
                Hongya Wang and   
              Yingyuan Xiao and   
                       Hui Song   Why locality sensitive hashing works: A
                                  practical perspective  . . . . . . . . . 49--58
                Meirun Chen and   
                  Reza Naserasr   The optimal routing of augmented cubes   59--63
                     Fei Ma and   
                       Bing Yao   The number of spanning trees of a class
                                  of self-similar fractal models . . . . . 64--69
             Massimo Lauria and   
                    Neil Thapen   On semantic cutting planes with very
                                  small coefficients . . . . . . . . . . . 70--75
              Anastazia Zuni\'c   Shape diameter for object analysis . . . 76--79
                      Jing Chen   The pessimistic diagnosability of
                                  Split-Star Networks under the PMC model  80--82
                  Xin Zhang and   
                Jingfen Lan and   
                      Bi Li and   
                      Qiang Zhu   Light paths and edges in families of
                                  outer-$1$-planar graphs  . . . . . . . . 83--89
             Salvador Lucas and   
   Raúl Gutiérrez   Use of logical models for proving
                                  infeasibility in term rewriting  . . . . 90--95
         Katharina T. Huber and   
            Vincent Moulton and   
         Marie-France Sagot and   
              Blerina Sinaimeri   Geometric medians in reconciliation
                                  spaces of phylogenetic trees . . . . . . 96--101
          Alexander V. Smal and   
              Navid Talebanfard   Prediction from partial information and
                                  hindsight, an alternative proof  . . . . 102--104
                        Or Meir   The direct sum of universal relations    105--111


Information Processing Letters
Volume 137, Number ??, September, 2018

                      Anonymous   Editorial Board  . . . . . . . . . . . . ii--ii
            Andrea Visconti and   
   Chiara Valentina Schiavo and   
            René Peralta   Improved upper bounds for the expected
                                  circuit complexity of dense systems of
                                  linear equations over $ {\rm GF}(2) $    1--5
                  Minki Kim and   
     Bernard Lidický and   
Tomás Masarík and   
                Florian Pfender   Notes on complexity of packing coloring  6--10
              Junran Lichen and   
                Jianping Li and   
                     Ko-Wei Lih   Approximation algorithms for
                                  constructing specific subgraphs with
                                  minimum number of length-bounded stock
                                  pieces . . . . . . . . . . . . . . . . . 11--16
            Rob J. van Glabbeek   On the validity of encodings of the
                                  synchronous in the asynchronous $ \pi
                                  $-calculus . . . . . . . . . . . . . . . 17--25
             Baraka Maiseli and   
               Hubert Msuya and   
                Suzan Kessy and   
              Michael Kisangiri   Perona--Malik model with self-adjusting
                                  shape-defining constant  . . . . . . . . 26--32
                 Massimo Lauria   A note about $k$-DNF resolution  . . . . 33--39
                 K. Bhavani and   
                  Sudarson Jena   Exchanged folded crossed cube: a new
                                  interconnection network for parallel
                                  computation  . . . . . . . . . . . . . . 40--46
          Patrizio Angelini and   
              Giordano Da Lozzo   $3$-coloring arrangements of line
                                  segments with $4$ slopes is hard . . . . 47--50
             Adam S. Jobson and   
André E. Kézdy and   
                   Jen\Ho Lehel   Linkage on the infinite grid . . . . . . 51--56
            Golnaz Badkobeh and   
              Gabriele Fici and   
               Simon J. Puglisi   Algorithms for anti-powers in strings    57--60


Information Processing Letters
Volume 138, Number ??, October, 2018

               Judith Clymo and   
               Olaf Beyersdorff   Relating size and width in variants of
                                  $Q$-resolution . . . . . . . . . . . . . ii--ii
                    Jin Yan and   
              Shaohua Zhang and   
                 Yanyan Ren and   
                    Junqing Cai   Degree sum conditions on two disjoint
                                  cycles in graphs . . . . . . . . . . . . 1--6
                      Anonymous   Editorial Board  . . . . . . . . . . . . 1--88; 1--88
                Enqiang Zhu and   
                     Zehui Shao   Extremal problems on weak Roman
                                  domination number  . . . . . . . . . . . 7--11
           Cosmina Croitoru and   
                  Kurt Mehlhorn   On testing substitutability  . . . . . . 12--18
                   Jian Gao and   
              Yongkang Wang and   
                        Juan Li   Bounds on covering radius of linear
                                  codes with Chinese Euclidean distance
                                  over the finite non chain ring F2+vF2    19--21
                 Yunwen Liu and   
                 Vincent Rijmen   New observations on invariant subspace
                                  attack . . . . . . . . . . . . . . . . . 22--26
           Atsushi Morinaga and   
                 Kenji Hara and   
                Kohei Inoue and   
                 Kiichi Urahama   Classification between natural and
                                  graphics images based on generalized
                                  Gaussian distributions . . . . . . . . . 27--30
                 Masaaki Harada   New quantum codes constructed from some
                                  self-dual additive F4-codes  . . . . . . 31--34
            M. Anastasiadis and   
                 N. Chatzis and   
                K. A. Draziotis   Birthday type attacks to the
                                  Naccache--Stern knapsack cryptosystem    35--38
               Neha Agrawal and   
             Shashikala Tapaswi   Low rate cloud DDoS attack defense
                                  method based on power spectral density
                                  analysis . . . . . . . . . . . . . . . . 39--43
     Gergely Halácsy and   
Zoltán Ádám Mann   Optimal energy-efficient placement of
                                  virtual machines with divisible sizes    44--50
                    Hua Fan and   
                 Wojciech Golab   Analyzing linearizability violations in
                                  the presence of read--modify--write
                                  operations . . . . . . . . . . . . . . . 51--56
                    Chao Xu and   
                     Qian Zhang   The shortest kinship description problem 57--60
           Franz J. Brandenburg   On fan-crossing and fan-crossing free
                                  graphs . . . . . . . . . . . . . . . . . 61--66
            Timothy M. Chan and   
                  Zahed Rahmati   An improved approximation algorithm for
                                  the discrete Fréchet distance . . . . . . 67--71
               G. Argiroffo and   
                   V. Leoni and   
                      P. Torres   Complexity of $k$-tuple total and total
                                  $k$-dominations for some subclasses of
                                  bipartite graphs . . . . . . . . . . . . 72--74
           Yevgen Biletskiy and   
           J. Anthony Brown and   
      Girish R. Ranganathan and   
            Ebrahim Bagheri and   
                  Ismail Akbari   Building a business domain meta-ontology
                                  for information pre-processing . . . . . 75--80


Information Processing Letters
Volume 139, Number ??, November, 2018

                 A. Bijlsma and   
           H. J. M. Passier and   
              H. J. Pootjes and   
                    S. Stuurman   Template Method test pattern . . . . . . 1--7
                  Toshio Suzuki   Non-depth-first search against
                                  independent distributions on an AND--OR
                                  tree . . . . . . . . . . . . . . . . . . 8--12
              Florian Frohn and   
              Jürgen Giesl   Constant runtime complexity of term
                                  rewriting is semi-decidable  . . . . . . 13--17
       David Gérault and   
          Pascal Lafourcade and   
              Marine Minier and   
               Christine Solnon   Revisiting AES related-key differential
                                  attacks with constraint programming  . . 18--23
                  Pascal Giorgi   A probabilistic algorithm for verifying
                                  polynomial middle product in linear time 24--29
             Mathias Soeken and   
             Eleonora Testa and   
            Alan Mishchenko and   
            Giovanni De Micheli   Pairs of majority-decomposing functions  30--34
                 Yossi Azar and   
      Jaya Prakash Champati and   
                      Ben Liang   $2$-Approximation algorithm for a
                                  generalization of scheduling on
                                  unrelated parallel machines  . . . . . . 35--38
                  Adi Shraibman   A note on multiparty communication
                                  complexity and the Hales--Jewett theorem 39--43
             Abdullah N. Arslan   A fast algorithm for all-pairs Hamming
                                  distances  . . . . . . . . . . . . . . . 44--48
            Jonathan Stokes and   
                   Steven Weber   Common greedy wiring and rewiring
                                  heuristics do not guarantee maximum
                                  assortative graphs of given degree . . . 49--52
            Steven Chaplick and   
      Maximilian Fürst and   
Frédéric Maffray and   
              Dieter Rautenbach   On some graphs with a unique perfect
                                  matching . . . . . . . . . . . . . . . . 53--59
               Bireswar Das and   
           Anirban Dasgupta and   
      Murali Krishna Enduri and   
                 I. Vinod Reddy   On NC algorithms for problems on bounded
                                  rank-width graphs  . . . . . . . . . . . 60--63
            Oliver Keszocze and   
             Mathias Soeken and   
                 Rolf Drechsler   The complexity of error metrics  . . . . ??


Information Processing Letters
Volume 140, Number ??, December, 2018

                 Michel Mollard   The existence of perfect codes in a
                                  family of generalized Fibonacci cubes    ii--ii
              Manuel Kauers and   
                  Martina Seidl   Short proofs for some symmetric
                                  Quantified Boolean Formulas  . . . . . . 1--3
                      Anonymous   Editorial Board  . . . . . . . . . . . . 1--48; 1--48
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
              Fahad Panolan and   
              Saket Saurabh and   
                  Meirav Zehavi   Long directed $ (s, t)$-path: FPT
                                  algorithm  . . . . . . . . . . . . . . . 4--7
                   Andrzej Pelc   Reaching a target in the plane with no
                                  information  . . . . . . . . . . . . . . 8--12
                    Rui Fan and   
      Mohammud Junaid Bocus and   
                   Naim Dahnoun   A novel disparity transformation
                                  algorithm for road segmentation  . . . . 13--17
               G. Abrishami and   
                   F. Rahbarnia   Polynomial-time algorithm for weighted
                                  efficient domination problem on diameter
                                  three planar graphs  . . . . . . . . . . 18--24
                     Zeev Nutov   Improved approximation algorithms for
                                  $k$-connected $m$-dominating set
                                  problems . . . . . . . . . . . . . . . . 25--29
                 Qiang Wang and   
                  Hao Zhang and   
                Jianfei Sun and   
                   Hu Xiong and   
                   Zhiguang Qin   Comments on ``A secure anti-collusion
                                  data sharing scheme for dynamic groups
                                  in the cloud'' . . . . . . . . . . . . . 30--33
       Sergi Delgado-Segura and   
Cristina Pérez-Sol\`a and   
Jordi Herrera-Joancomartí and   
      Guillermo Navarro-Arribas   Bitcoin private key locked transactions  34--36
        Peter Kostolányi   On deterministic weighted automata . . . 37--41


IEEE Transactions on Parallel and Distributed Systems
Volume 27, Number 1, January, 2016

                     Jie Xu and   
                Qiaoyan Wen and   
                  Wenmin Li and   
                  Zhengping Jin   Circuit Ciphertext-Policy
                                  Attribute-Based Hybrid Encryption with
                                  Verifiable Delegation in Cloud Computing 119--129
                Zhongma Zhu and   
                      Rui Jiang   A Secure Anti-Collusion Data Sharing
                                  Scheme for Dynamic Groups in the Cloud   40--50