External Links

    Journal: Inf. Process. Lett.

    Volume 110, Issue 8-9

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

    Volume 110, Issue 7

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

    Volume 110, Issue 6

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

    Volume 110, Issue 5

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

    Volume 110, Issue 4

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

    Volume 110, Issue 3

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

    Volume 110, Issue 24

    1079 -- 1083Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen. The repeater tree construction problem
    1084 -- 1087Haihui Zhang. On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
    1088 -- 1092Xie-Bin Chen. Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
    1093 -- 1098Kimmo Fredriksson. On building minimal automaton for subset matching queries
    1099 -- 1102Meng Zhang, Yi Zhang, Liang Hu. Pattern matching with wildcards using words of shorter length
    1103 -- 1109Yunong Zhang, Zhende Ke, Peng Xu, 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
    1110 -- 1113Ashley Montanaro. Nonadaptive quantum query complexity
    1114 -- 1119Sanjay Jain, Yuh Shin Ong, Frank Stephan. Regular patterns, regular languages and context-free languages
    1120 -- 1123Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. On the additive constant of the k-server Work Function Algorithm
    1124 -- 1130Yang Shen, Lizhuang Ma, Hai Liu, Yanxia Bao, Zhihua Chen. Detecting and extracting natural snow from videos

    Volume 110, Issue 23

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

    Volume 110, Issue 22

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

    Volume 110, Issue 21

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

    Volume 110, Issue 20

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

    Volume 110, Issue 2

    41 -- 43Sun-Yuan Hsieh, Che-Nan Kuo, Hsin-Hung Chou. A further result on fault-free cycles in faulty folded hypercubes
    44 -- 45Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek. A note on t-complementing permutations for graphs
    46 -- 49Jyh-haw Yeh. Enforcing non-hierarchical access policies by hierarchical key assignment schemes
    50 -- 56Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang. Upper bounds on the queuenumber of k-ary n-cubes
    57 -- 61Ton van Deursen, Sasa Radomirovic. On a new formal proof model for RFID location privacy
    62 -- 70Mohamed Medhat Gaber, Uwe Röhm, Karel Herink. An analytical study of central and in-network data processing for wireless sensor networks
    71 -- 76Meijie Ma, Baodong Liu. Cycles embedding in exchanged hypercubes
    77 -- 82Xie-Bin Chen. Hamiltonian paths and cycles passing through a prescribed path in hypercubes

    Volume 110, Issue 18-19

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

    Volume 110, Issue 17

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

    Volume 110, Issue 16

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

    Volume 110, Issue 14-15

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

    Volume 110, Issue 12-13

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

    Volume 110, Issue 11

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

    Volume 110, Issue 10

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

    Volume 110, Issue 1

    1 -- 3Pavel Hrubes, Amir Yehudayoff. Monotone separations for constant degree polynomials
    4 -- 7Jorge Almeida, Ondrej Klíma. A counterexample to a conjecture concerning concatenation hierarchies
    8 -- 12Periklis A. Papakonstantinou. A note on width-parameterized SAT: An exact machine-model characterization
    13 -- 19Jialin Zhang, Wei Chen. Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
    20 -- 23Lei Chen, Changhong Lu, Zhenbing Zeng. A linear-time algorithm for paired-domination problem in strongly chordal graphs
    24 -- 29Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo. A note on graph balancing problems with restrictions
    30 -- 35Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek. Disjoint Hamilton cycles in the star graph
    36 -- 40Fumiya Okubo. A note on the descriptional complexity of semi-conditional grammars
    runs on