External Links

    Journal: Inf. Process. Lett.

    Volume 111, Issue 9

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

    Volume 111, Issue 8

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

    Volume 111, Issue 7

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

    Volume 111, Issue 6

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

    Volume 111, Issue 5

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

    Volume 111, Issue 4

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

    Volume 111, Issue 3

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

    Volume 111, Issue 23-24

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

    Volume 111, Issue 21-22

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

    Volume 111, Issue 20

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

    Volume 111, Issue 2

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

    Volume 111, Issue 19

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

    Volume 111, Issue 18

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

    Volume 111, Issue 17

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

    Volume 111, Issue 16

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

    Volume 111, Issue 15

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

    Volume 111, Issue 14

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

    Volume 111, Issue 13

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

    Volume 111, Issue 12

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

    Volume 111, Issue 11

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

    Volume 111, Issue 10

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

    Volume 111, Issue 1

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