A note on the Kenyon-Remila strip-packing algorithmSVIRIDENKO, Maxim.Information processing letters. 2012, Vol 112, Num 1-2, pp 10-12, issn 0020-0190, 3 p.Article

Online call control in cellular networks revisitedYONG ZHANG; CHIN, Francis Y. L; TING, Hing-Fung et al.Information processing letters. 2012, Vol 112, Num 1-2, pp 21-25, issn 0020-0190, 5 p.Article

Singleton and 2-periodic attractors of sign-definite Boolean networksAKUTSU, Tatsuya; MELKMAN, Avraham A; TAMURA, Takeyuki et al.Information processing letters. 2012, Vol 112, Num 1-2, pp 35-38, issn 0020-0190, 4 p.Article

The NP-completeness of the Road Coloring ProblemROMAN, Adam.Information processing letters. 2011, Vol 111, Num 7, pp 342-347, issn 0020-0190, 6 p.Article

A simple division-free algorithm for computing determinantsBIRD, Richard S.Information processing letters. 2011, Vol 111, Num 21-22, pp 1072-1074, issn 0020-0190, 3 p.Article

Algorithms for induced biclique optimization problemsGAVRIL, Fanica.Information processing letters. 2011, Vol 111, Num 10, pp 469-473, issn 0020-0190, 5 p.Article

An industrial study on the importance of software component documentation: A system integrator's perspectiveMAHMOOD, Sajjad; KHAN, Azhar.Information processing letters. 2011, Vol 111, Num 12, pp 583-590, issn 0020-0190, 8 p.Article

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphsZUOSONG LIANG; ERFANG SHAN.Information processing letters. 2011, Vol 111, Num 23-24, pp 1104-1107, issn 0020-0190, 4 p.Article

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobsCUIXIA MIAO; YUZHONG ZHANG; ZHIGANG CAO et al.Information processing letters. 2011, Vol 111, Num 16, pp 798-803, issn 0020-0190, 6 p.Article

Channel assignment via fast zeta transformCYGAN, Marek; KOWALIK, Łukasz.Information processing letters. 2011, Vol 111, Num 15, pp 727-730, issn 0020-0190, 4 p.Article

Computing minimum diameter color-spanning sets is hardFLEISCHER, Rudolf; XIAOMING XU.Information processing letters. 2011, Vol 111, Num 21-22, pp 1054-1056, issn 0020-0190, 3 p.Article

Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrecSCHMIDT-SCHAUSS, Manfred; SABEL, David; MACHKASOVA, Elena et al.Information processing letters. 2011, Vol 111, Num 14, pp 711-716, issn 0020-0190, 6 p.Article

Fast leader election in anonymous rings with bounded expected delayBAKHSHI, Rena; ENDRULLIS, Jörg; FOKKINK, Wan et al.Information processing letters. 2011, Vol 111, Num 17, pp 864-870, issn 0020-0190, 7 p.Article

Improved approximation algorithms for the Max Edge-Coloring problemLUCARELLI, Giorgio; MILIS, Ioannis.Information processing letters. 2011, Vol 111, Num 16, pp 819-823, issn 0020-0190, 5 p.Article

Improved convertible authenticated encryption scheme with provable securityLIN, Han-Yu; HSU, Chien-Lung; HUANG, Shih-Kun et al.Information processing letters. 2011, Vol 111, Num 13, pp 661-666, issn 0020-0190, 6 p.Article

Inverse star, borders, and palstarsRAMPERSAD, Narad; SHALLIT, Jeffrey; WANG, Ming-Wei et al.Information processing letters. 2011, Vol 111, Num 9, pp 420-422, issn 0020-0190, 3 p.Article

Maximum subset intersectionCLIFFORD, Raphaël; POPA, Alexandru.Information processing letters. 2011, Vol 111, Num 7, pp 323-325, issn 0020-0190, 3 p.Article

Minterm-transitive functions with asymptotically smallest block sensitivityAMANO, Kazuyuki.Information processing letters. 2011, Vol 111, Num 23-24, pp 1081-1084, issn 0020-0190, 4 p.Article

Modular instantiation schemesECHENIM, Mnacho; PELTIER, Nicolas.Information processing letters. 2011, Vol 111, Num 20, pp 989-993, issn 0020-0190, 5 p.Article

Negative results on learning multivalued dependencies with queriesLAVIN PUENTE, Victor; HERMO, Montserrat.Information processing letters. 2011, Vol 111, Num 19, pp 968-972, issn 0020-0190, 5 p.Article

On edge covering colorings of graphsXIA ZHANG; GUIZHEN LIU.Information processing letters. 2011, Vol 111, Num 20, pp 1004-1006, issn 0020-0190, 3 p.Article

Online scheduling on unbounded parallel-batch machines to minimize maximum flow-timeWENHUA LI; JINJIANG YUAN.Information processing letters. 2011, Vol 111, Num 18, pp 907-911, issn 0020-0190, 5 p.Article

Optimal semi-online algorithms for scheduling problems with reassignment on two identical machinesXIAO MIN; JING LIU; YUQING WANG et al.Information processing letters. 2011, Vol 111, Num 9, pp 423-428, issn 0020-0190, 6 p.Article

Parallel construction of optimal independent spanning trees on Cartesian product of complete graphsCHEN, Xie-Bin.Information processing letters. 2011, Vol 111, Num 5, pp 235-238, issn 0020-0190, 4 p.Article

Perfectly colorable graphsSANDEEP, R. B.Information processing letters. 2011, Vol 111, Num 19, pp 960-961, issn 0020-0190, 2 p.Article