@article{Bjorklund-Kaski/13,
AUTHOR = {Bj{\"o}rklund, Andreas and Kaski, Petteri},
TITLE = {Counting closed trails},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {1-3},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {claw-free graph, closed trail, graph algorithms, hamiltonian path},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002633},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonifaci/13,
AUTHOR = {Bonifaci, Vincenzo},
TITLE = {Physarum can compute shortest paths: A short proof},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {4-7},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, natural algorithm, shortest path, thomson's principle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002621},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Li-Wu-Huang/13,
AUTHOR = {Liu, Yiguang and Li, Stan Z. and Wu, Wei and Huang, Ronggang},
TITLE = {Dynamics of a mean-shift-like algorithm and its applications on clustering},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {8-16},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, mean-shift algorithm, stability, exponential convergence, clustering},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002827},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baril/13,
AUTHOR = {Baril, Jean-Luc},
TITLE = {Statistics-preserving bijections between classical and cyclic permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {17-22},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, bijections, statistics on permutations, excedance, left-to-right maximum, descent, quasi-fixed point, cyclic permutation, derangement},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002839},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kasperski-Kurpisz-Zielinski/13,
AUTHOR = {Kasperski, Adam and Kurpisz, Adam and Zieli{\'n}ski, Pawe{\l}},
TITLE = {Approximating the min-max (regret) selecting items problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {23-29},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {robust optimization, combinatorial problems, approximation algorithms, computational complexity, min-max regret},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002815},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Yao-Chen/13,
AUTHOR = {Zhou, Xiangqian and Yao, Bing and Chen, Xiang'en},
TITLE = {Every lobster is odd-elegant},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {30-33},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, set-ordered odd-graceful, odd-elegant labelling, lobsters},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002797},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zawidzki-Schmidt-Tishkovsky/13,
AUTHOR = {Zawidzki, Micha{\l} and Schmidt, Renate A. and Tishkovsky, Dmitry},
TITLE = {Satisfiability problem for modal logic with global counting operators coded in binary is NE{\sc xp}TIME-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {34-38},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {modal logic, counting quantifiers, computational complexity, tiling problem, finite model property, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002645},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolliopoulos-Moysoglou/13,
AUTHOR = {Kolliopoulos, Stavros G. and Moysoglou, Yannis},
TITLE = {The 2-valued case of makespan minimization with assignment constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {39-43},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, scheduling, makespan minimization, graph balancing},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200261X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Xu-Zhan-Zhang/13,
AUTHOR = {Gao, Yang and Xu, Ming and Zhan, Naijun and Zhang, Lijun},
TITLE = {Model checking conditional CSL for continuous-time Markov chains},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {1-2},
PAGES = {44-50},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, probabilistic systems, continuous-time markov chains, continuous stochastic logic, conditional logic},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002803},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fournier-Vigneron/13,
AUTHOR = {Fournier, Herv{\'e} and Vigneron, Antoine},
TITLE = {A deterministic algorithm for fitting a step function to a weighted point-set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {51-54},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm design, optimization, computational geometry, shape fitting, k-center},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alevizos/13,
AUTHOR = {Alevizos, Panagiotis D.},
TITLE = {An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {55-59},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, circuit, contour, rectilinear polygons, optimal algorithm, sweep plane},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002992},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lamberger-Teufl/13,
AUTHOR = {Lamberger, Mario and Teufl, Elmar},
TITLE = {Memoryless near-collisions, revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {60-66},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hash functions, memoryless near-collisions, covering codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003018},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dutting-Henzinger-Weber/13,
AUTHOR = {D{\"u}tting, Paul and Henzinger, Monika and Weber, Ingmar},
TITLE = {Sponsored search, market equilibria, and the Hungarian Method},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {67-73},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, matching markets, budget limits, envy freeness, incentive compatibility},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003031},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Iliopoulos-Kociumaka-Kubica-Pachocki-Radoszewski-Rytter-Tyczynski-Walen/13,
AUTHOR = {Crochemore, M. and Iliopoulos, C.S. and Kociumaka, T. and Kubica, M. and Pachocki, J. and Radoszewski, J. and Rytter, W. and Tyczy{\'n}ski, W. and Wale{\'n}, T.},
TITLE = {A note on efficient computation of all Abelian periods in a string},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {74-77},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, abelian period, abelian square},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002943},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kapoor-Nayak/13,
AUTHOR = {Kapoor, Kalpesh and Nayak, Himadri},
TITLE = {On multiset of factors of a word},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {78-80},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, combinatorics on words, repeated factors},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002955},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avitabile-Mathieu-Parkinson/13,
AUTHOR = {Avitabile, T. and Mathieu, C. and Parkinson, L.},
TITLE = {Online constrained optimization with recourse},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {81-86},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, approximation algorithms, maximum cut, bipartite matching, ad-auctions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002980},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu/13a,
AUTHOR = {Wu, Yunjian},
TITLE = {An improvement on Vizing's conjecture},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {87-88},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {vizing's conjecture, domination number, roman domination number},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002979},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mosca/13,
AUTHOR = {Mosca, Raffaele},
TITLE = {Maximum weight independent sets in ($P_6,$ co-banner)-free graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {89-93},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, maximum weight independent set problem, polynomial algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002967},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duraj/13,
AUTHOR = {Duraj, Lech},
TITLE = {A linear algorithm for 3-letter longest common weakly increasing subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {3},
PAGES = {94-99},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, longest common weakly increasing subsequence},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003080},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kiefer/13,
AUTHOR = {Kiefer, Stefan},
TITLE = {BPA bisimilarity is EXPTIME-hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {101-106},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {basic process algebra, bisimilarity, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003079},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golovach-Heggernes-van_t_Hof-Paulusma/13,
AUTHOR = {Golovach, Petr A. and Heggernes, Pinar and van 't Hof, Pim and Paulusma, Dani{\"e}l},
TITLE = {Choosability on $H$-free graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {107-110},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, choosability, h-free graphs, linear forest},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003067},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Park-Chang-Hong/13,
AUTHOR = {Park, Sun-Mi and Chang, Ku-Young and Hong, Dowon},
TITLE = {Parallel $GF(3^m)$ multiplier for trinomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {111-115},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {finite field arithmetic, parallel multiplier, characteristic three, trinomial, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003055},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yamakami-Kato/13,
AUTHOR = {Yamakami, Tomoyuki and Kato, Yuichi},
TITLE = {The dissecting power of regular languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {116-122},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computing, formal languages, regular language, context-free language, bounded language, semi-linear, constantly growing, dissectible, i-separate},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003109},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutin-Muciaccia-Yeo/13,
AUTHOR = {Gutin, G. and Muciaccia, G. and Yeo, A.},
TITLE = {(Non-)existence of polynomial kernels for the Test Cover problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {123-126},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, fixed parameter tractability, kernel, test cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003183},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Xu-Dosa-Han-Jiang/13,
AUTHOR = {Chen, Xin and Xu, Zhenzhen and D{\'o}sa, Gy{\"o}rgy and Han, Xin and Jiang, He},
TITLE = {Semi-online hierarchical scheduling problems with buffer or rearrangements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {127-131},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, semi-online scheduling, competitive ratio, hierarchy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003171},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Tang/13,
AUTHOR = {Liu, Yong-Jin and Tang, Kai},
TITLE = {The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {132-136},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {voronoi diagram, triangulated surfaces, combinatorial complexity, computational geometry},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003201},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peng-Yi-Wei-Peng-Sang/13,
AUTHOR = {Peng, Xi and Yi, Zhang and Wei, Xiao-Yong and Peng, De-Zhong and Sang, Yong-Sheng},
TITLE = {Free-gram phrase identification for modeling Chinese text},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {137-144},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, document representation model, bag of phrase, text categorization, sparse coding, unfixed gram phrase identification},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200302X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Al-Bawani-Souza/13,
AUTHOR = {Al-Bawani, Kamal and Souza, Alexander},
TITLE = {Buffer overflow management with class segregation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {4},
PAGES = {145-150},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, competitive analysis, buffer management},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000057},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ateniese-De_Santis-Ferrara-Masucci/13,
AUTHOR = {Ateniese, Giuseppe and De Santis, Alfredo and Ferrara, Anna Lisa and Masucci, Barbara},
TITLE = {A note on time-bound hierarchical key assignment schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {151-155},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, distributed systems, safety/security in digital systems, access control},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000124},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Acerbi-Dennunzio-Formenti/13,
AUTHOR = {Acerbi, Luigi and Dennunzio, Alberto and Formenti, Enrico},
TITLE = {Surjective multidimensional cellular automata are non-wandering: A combinatorial proof},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {156-159},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, multidimensional cellular automata, symbolic dynamics, discrete dynamical systems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003195},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pae/13,
AUTHOR = {Pae, Sung-il},
TITLE = {Exact output rate of Peres's algorithm for random number generation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {160-164},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, random number generation, von neumann's method, peres's method, elias's method},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000033},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Jenkins-Sengupta/13,
AUTHOR = {Das, Sudipta and Jenkins, Lawrence and Sengupta, Debasis},
TITLE = {Loss ratio of the EDF scheduling policy with early discarding technique},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {165-170},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, scheduling, firm real-time system, earliest deadline first, loss ratio, approximate analysis, nonlinear regression},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000082},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barmpalias-Holzl-Lewis-Merkle/13,
AUTHOR = {Barmpalias, G. and H{\"o}lzl, R. and Lewis, A.E.M. and Merkle, W.},
TITLE = {Analogues of Chaitin's Omega in the computably enumerable sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {171-178},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, kolmogorov complexity, computably enumerable sets, completeness},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000136},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cygan-Pilipczuk/13,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin},
TITLE = {{\sc Split Vertex Deletion} meets {\sc Vertex Cover}: New fixed-parameter and exact exponential-time algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {179-182},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, fixed-parameter algorithms, split graphs, split vertex deletion, branching algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000069},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rizzi-Tomescu/13,
AUTHOR = {Rizzi, Romeo and Tomescu, Alexandru I.},
TITLE = {Ranking, unranking and random generation of extensional acyclic digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {183-187},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {directed acyclic graph, extensional digraph, hereditarily finite sets, random generation, graph algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000161},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Xu-Wu/13,
AUTHOR = {Yu, Haiyan and Xu, Yinfeng and Wu, Tengyu},
TITLE = {Online inventory replenishment scheduling of temporary orders},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {188-192},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {replenishment, scheduling, online algorithm, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grytczuk-Szafruga-Zmarz/13,
AUTHOR = {Grytczuk, Jaros{\l}aw and Szafruga, Piotr and Zmarz, Micha{\l}},
TITLE = {Online version of the theorem of Thue},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {193-195},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, nonrepetitive sequence, thue's theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003043},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Govorcin-Knor-Skrekovski/13,
AUTHOR = {Govor{\v{c}}in, Jelena and Knor, Martin and {\v{S}}krekovski, Riste},
TITLE = {Line graph operation and small worlds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {5-6},
PAGES = {196-200},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, large network, small world, line graph, diameter},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000045},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luccio-Pagli/13,
AUTHOR = {Luccio, Fabrizio and Pagli, Linda},
TITLE = {Chain rotations: A new look at tree distance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {201-204},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {binary tree, rotation distance, chain distance, upper and lower bounds, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000276},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ahmadian-Salmasizadeh-Aref/13,
AUTHOR = {Ahmadian, Zahra and Salmasizadeh, Mahmoud and Aref, Mohammad Reza},
TITLE = {Desynchronization attack on RAPP ultralightweight authentication protocol},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {205-209},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {crystography, rapp, rfid security, ultralightweight protocols, desynchronization attack},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000094},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Han-Kwiatkowska/13,
AUTHOR = {Chen, Taolue and Han, Tingting and Kwiatkowska, Marta},
TITLE = {On the complexity of model checking interval-valued discrete time Markov chains},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {210-216},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, discrete time markov chain, reachability, pctl, complexity, linear programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000100},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Small-Mason/13,
AUTHOR = {Small, Lucy and Mason, Oliver},
TITLE = {Nash Equilibria for competitive information diffusion on trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {217-219},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, competitive information diffusion, game theory, nash equilibrium, trees},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000173},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Zhang-Chen-Dong/13,
AUTHOR = {Chen, Yong and Zhang, An and Chen, Guangting and Dong, Jianming},
TITLE = {Approximation algorithms for parallel open shop scheduling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {220-224},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {open shop, approximation algorithm, worst-case analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300015X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Viderman/13,
AUTHOR = {Viderman, Michael},
TITLE = {LP decoding of codes with expansion parameter above 2/3},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {225-228},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, theory of computation, error-correcting codes, lp decoding, expander codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000240},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karaahmetoglu-Sakall-Bulus-Tutanescu/13,
AUTHOR = {Karaahmeto{\v{g}}lu, Osman and Sakall{\i}, Muharrem Tolga and Bulu{\c{s}}, Ercan and Tut{\v{a}}nescu, Ion},
TITLE = {A new method to determine algebraic expression of power mapping based S-boxes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {229-235},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, s-boxes, lagrange interpolation, finite fields, polynomial operation complexity, square-and-multiply technique},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000070},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Didimo/13,
AUTHOR = {Didimo, Walter},
TITLE = {Density of straight-line 1-planar graph drawings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {236-240},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, combinatorial problems, straight-line graph drawings, 1-planar graphs, edge density, layered drawings, circular drawings},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000252},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmidt/13,
AUTHOR = {Schmidt, Jens M.},
TITLE = {A simple test on 2-vertex- and 2-edge-connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {241-244},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, 2-connectivity, 2-edge-connectivity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000288},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barenghi-Reghizzi-Mandrioli-Pradella/13,
AUTHOR = {Barenghi, Alessandro and Reghizzi, Stefano Crespi and Mandrioli, Dino and Pradella, Matteo},
TITLE = {Parallel parsing of operator precedence grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {7},
PAGES = {245-249},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, parallel algorithms, operator precedence languages, local parsability, parallel parsing, incremental parsing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000148},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guan-Li/13,
AUTHOR = {Guan, Li and Li, Jianping},
TITLE = {Coordination mechanism for selfish scheduling under a grade of service provision},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {251-254},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, selfish scheduling, grade of service, coordination mechanism, makespan, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000264},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Sun-Ye/13,
AUTHOR = {Zhou, Sizhong and Sun, Zhiren and Ye, Hui},
TITLE = {A toughness condition for fractional $(k,m)$-deleted graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {255-259},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph, toughness, fractional k-factor, fractional ( k , m ) -deleted graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000392},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liang-Xu/13,
AUTHOR = {Liang, Hao and Xu, Jun-Ming},
TITLE = {Minimum feedback arc set of $m$-free digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {260-264},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, directed cycle, acyclic digraph, feedback arc set},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000379},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dutta-Hasan-Rahman/13,
AUTHOR = {Dutta, Amit Kumar and Hasan, Masud and Rahman, M. Sohel},
TITLE = {Prefix transpositions on binary and ternary strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {265-270},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, prefix transposition, ternary strings, binary strings, genome rearrangement},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300029X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Zhuang/13,
AUTHOR = {Cheng, Qi and Zhuang, Jincheng},
TITLE = {On certain computations of Pisot numbers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {271-275},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, pisot numbers, lattice reduction, tau functions, modular exponentiation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000367},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krzywkowski/13,
AUTHOR = {Krzywkowski, Marcin},
TITLE = {Trees having many minimal dominating sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {276-279},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, minimal dominating set, tree, combinatorial bound, exponential algorithm, listing algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000380},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Lin/13,
AUTHOR = {Lin, Lan and Lin, Yixun},
TITLE = {Machine scheduling with contiguous processing constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {280-284},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, contiguous processing, feasibility, optimality, polynomial-time algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000495},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carayol-Esik/13,
AUTHOR = {Carayol, Arnaud and {\'E}sik, Zolt{\'a}n},
TITLE = {The FC-rank of a context-free language},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {285-287},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, context-free language, linear ordering, condensation rank},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000112},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang/13,
AUTHOR = {Chang, Ching-Lueh},
TITLE = {Deterministic sublinear-time approximations for metric 1-median selection},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {288-292},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, metric 1-median selection, median selection, sublinear-time algorithm, nonevasive algorithm, query complexity, metric space},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000483},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chaim-de_Araujo/13,
AUTHOR = {Chaim, Marcos Lordello and de Araujo, Roberto Paulo Andrioli},
TITLE = {An efficient bitwise algorithm for intra-procedural data-flow testing coverage},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {293-300},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, data structures, design of algorithms, data-flow testing coverage, program instrumentation, run-time environments},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000537},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Shen/13,
AUTHOR = {Wang, Gaoli and Shen, Yanzhao},
TITLE = {Preimage and pseudo-collision attacks on step-reduced SM3 hash function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {8},
PAGES = {301-306},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, preimage attack, collision attack, differential meet-in-the-middle, sm3, hash function},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000513},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vaya/13,
AUTHOR = {Vaya, Shailesh},
TITLE = {Round complexity of leader election and gossiping in bidirectional radio networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {307-312},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {gossiping, polynomially large labels, bidirectional radio networks, leader election, distributed computing},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300046X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lozin-Purcell/13,
AUTHOR = {Lozin, Vadim and Purcell, Christopher},
TITLE = {Boundary properties of the satisfiability problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {313-317},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, np-completeness, satisfiability, boundary properties of graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000525},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Iersel-Linz/13,
AUTHOR = {van Iersel, Leo and Linz, Simone},
TITLE = {A quadratic kernel for computing the hybridization number of multiple trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {318-323},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, fixed-parameter tractability, generator, hybridization, kernel, phylogenetic network},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000562},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cariow-Cariowa/13,
AUTHOR = {Cariow, Aleksandr and Cariowa, Galina},
TITLE = {An algorithm for fast multiplication of sedenions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {324-331},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, sedenion, multiplication},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000653},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstatter-Meidl-Winterhof/13,
AUTHOR = {Brandst{\"a}tter, Nina and Meidl, Wilfried and Winterhof, Arne},
TITLE = {Addendum to Sidel'nikov sequences over nonprime fields},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {332-336},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {sidel'nikov sequence, linear complexity, sequences over finite fields, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000549},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmitt-Wanka/13,
AUTHOR = {Schmitt, Manuel and Wanka, Rolf},
TITLE = {Exploiting independent subformulas: A faster approximation scheme for \#$k$-SAT},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {337-344},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, randomized algorithms, \#$k$-sat, satisfiability},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000677},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dean-Mohan/13,
AUTHOR = {Dean, Brian C. and Mohan, Raghuveer},
TITLE = {Building Cartesian trees from free trees with $k$ leaves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {345-349},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cartesian tree, adaptive algorithms, range queries, data structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000689},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moszkowski/13,
AUTHOR = {Moszkowski, Ben},
TITLE = {Interconnections between classes of sequentially compositional temporal formulas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {350-353},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, interval temporal logic, compositionality},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000501},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang/13,
AUTHOR = {Zhang, Haihui},
TITLE = {Corrigendum to ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {9},
PAGES = {354-356},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, choosability, planar graph, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012003092},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Inf.~Process.~Lett., Vol. 110, 2010, No. 24, 1084-1087},
}
@article{Baek/13,
AUTHOR = {Baek, Yoo-Jin},
TITLE = {Scalar recoding and regular $2^w$-ary right-to-left EC scalar multiplication algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {357-360},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, simple power attack, elliptic curve cryptosystem, scalar recoding, differential power attack, countermeasure},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000471},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calamoneri/13,
AUTHOR = {Calamoneri, Tiziana},
TITLE = {Optimal $L(\delta_1,\delta_2,1)$-labeling of eight-regular grids},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {361-364},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {l ( 3 , 2 , 1 ) -labeling, l ( 2 , 1 , 1 ) -labeling, eight-regular grids (ergs), triangular grids, channel assignment problem, combinatorial problems, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300080X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yahiaoui-Belhoul-Haddad-Kheddouci/13,
AUTHOR = {Yahiaoui, Sa{\"{i}}d and Belhoul, Yacine and Haddad, Mohammed and Kheddouci, Hamamache},
TITLE = {Self-stabilizing algorithms for minimal global powerful alliance sets in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {365-370},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilizing algorithms, graph algorithms, global powerful alliance, distributed algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000720},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amir-Paryenty-Roditty/13,
AUTHOR = {Amir, Amihood and Paryenty, Haim and Roditty, Liam},
TITLE = {On the hardness of the Consensus String problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {371-374},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, computational complexity, consensus, hamming distance, swap, reversal},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000707},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meshram-Meshram/13,
AUTHOR = {Meshram, Chandrashekhar and Meshram, Suchitra A.},
TITLE = {An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {375-380},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {public key cryptosystem, identity-based cryptosystem, discrete logarithm (dl), integer factorization (if), cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000550},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esparza-Gaiser-Kiefer/13,
AUTHOR = {Esparza, Javier and Gaiser, Andreas and Kiefer, Stefan},
TITLE = {A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {381-385},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, branching processes, stochastic context-free grammars, exact matrix computations},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000690},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Ellis-Mamakani-Ruskey/13,
AUTHOR = {Yang, Qingxuan and Ellis, John and Mamakani, Khalegh and Ruskey, Frank},
TITLE = {In-place permuting and perfect shuffling using involutions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {386-391},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, combinatorial problems, parallel algorithms, perfect shuffle, permutation, involution},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000719},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morawiecki-Srebrny/13,
AUTHOR = {Morawiecki, Pawe{\l} and Srebrny, Marian},
TITLE = {A SAT-based preimage analysis of reduced {\sc Keccak} hash functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {392-397},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hash functions, keccak, algebraic cryptanalysis, logical cryptanalysis, sat solvers},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000811},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ilic/13,
AUTHOR = {Ili{\'c}, Aleksandar},
TITLE = {Efficient algorithm for the vertex connectivity of trapezoid graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {10-11},
PAGES = {398-404},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {trapezoid graphs, vertex connectivity, algorithms, binary indexed tree},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000665},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Wang-Sun/13,
AUTHOR = {Feng, Jun and Wang, Xueming and Sun, Hong},
TITLE = {Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {405-408},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, genus 3 hyperelliptic curves, efficiently computable endomorphism, scalar multiplication},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000914},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kantor-Nissim/13,
AUTHOR = {Kantor, Alexander and Nissim, Kobbi},
TITLE = {Attacks on statistical databases: The highly noisy case},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {409-413},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {privacy, statistical databases, databases, learning with noise},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000823},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shparlinski/13,
AUTHOR = {Shparlinski, Igor E.},
TITLE = {Correcting noisy exponentiation black-boxes modulo a prime},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {414-417},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, noisy exponentiation, congruences, concentration of solutions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000999},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maitra-Paul/13,
AUTHOR = {Maitra, Arpita and Paul, Goutam},
TITLE = {Eavesdropping in semiquantum key distribution protocol},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {418-422},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bb84 protocol, binary symmetric channel, cryptography, optimal eavesdropping, quantum cryptography, semiquantum key distribution},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000859},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karakoc-Demirci-Harmanc/13,
AUTHOR = {Karako{\c{c}}, F. and Demirci, H. and Harmanc, A.E.},
TITLE = {Biclique cryptanalysis of LBlock and TWINE},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {423-429},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, lblock, twine, block cipher, biclique cryptanalysis, meet-in-the-middle attack},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000884},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kubica-Kulczynski-Radoszewski-Rytter-Walen/13,
AUTHOR = {Kubica, M. and Kulczy{\'n}ski, T. and Radoszewski, J. and Rytter, W. and Wale{\'n}, T.},
TITLE = {A linear time algorithm for consecutive permutation pattern matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {430-433},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {permutation pattern matching, pattern matching, knuth-morris-pratt algorithm, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000926},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sun-Fan/13,
AUTHOR = {Sun, Hongyang and Fan, Rui},
TITLE = {Improved semi-online makespan scheduling with a reordering buffer},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {434-439},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, scheduling, reordering buffer, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000847},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsur/13,
AUTHOR = {Tsur, Dekel},
TITLE = {Top-$k$ document retrieval in optimal space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {440-443},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, document retrieval, text indexing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000896},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ghosh-Dey/13,
AUTHOR = {Ghosh, Debashis and Dey, Lakshmi Kanta},
TITLE = {A new upper bound on the parameters of quasi-symmetric designs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {444-446},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {quasi-symmetric design, block intersection numbers, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000872},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karpinski-Lingas-Sledneu/13,
AUTHOR = {Karpinski, Marek and Lingas, Andrzej and Sledneu, Dzmitry},
TITLE = {Optimal cuts and partitions in tree metrics in polynomial time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {447-451},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, optimal cut, optimal bisection, tree metric, geometric metric, polynomial time},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000860},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Liptak-Steffy/13,
AUTHOR = {Cheng, Eddie and Lipt{\'a}k, L{\'a}szl{\'o} and Steffy, Daniel E.},
TITLE = {Strong local diagnosability of $(n,k)$-star graphs and cayley graphs generated by 2-trees with missing edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {12},
PAGES = {452-456},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, ( n , k ) -star graphs, cayley graphs, 2-trees, local diagnosability},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000732},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Filmus/13,
AUTHOR = {Filmus, Yuval},
TITLE = {Inequalities on submodular functions via term rewriting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {457-464},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, inequalities, submodularity, local search},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001038},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wan-Deng-Tan/13,
AUTHOR = {Wan, Long and Deng, Xiaofang and Tan, Zhiyi},
TITLE = {Inefficiency of Nash equilibria with parallel processing policy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {465-469},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel processing, nash equilibrium, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000835},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alam-Rahman/13,
AUTHOR = {Alam, Muhammad Rashed and Rahman, M. Sohel},
TITLE = {A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {470-476},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parallel algorithms, longest increasing subsequence, divide and conquer},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013000902},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elkind-Orlin/13,
AUTHOR = {Elkind, Edith and Orlin, James B.},
TITLE = {On the hardness of finding subsets with equal average},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {477-480},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, expected utility theory, subset ranking},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300104X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tu-Yang/13,
AUTHOR = {Tu, Jianhua and Yang, Fengmei},
TITLE = {The vertex cover $P_3$ problem in cubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {481-485},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial optimization, vertex cover p 3 problem, approximation algorithm, cubic graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001130},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Zhang/13,
AUTHOR = {Feng, Yuan and Zhang, Lijun},
TITLE = {A tighter bound for the self-stabilization time in Herman's algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {486-488},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, self-stabilization algorithm, herman's algorithm, markov chains},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001178},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khennoufa-Seba-Kheddouci/13,
AUTHOR = {Khennoufa, Riadh and Seba, Hamida and Kheddouci, Hamamache},
TITLE = {Edge coloring total $k$-labeling of generalized Petersen graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {489-494},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, edge coloring, generalized petersen graphs, total labeling},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001026},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alonso-Reingold/13,
AUTHOR = {Alonso, Laurent and Reingold, Edward M.},
TITLE = {Analysis of Boyer and Moore's {\sc mjrty} algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {495-497},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, majority problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001166},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rotter-Vygen/13,
AUTHOR = {Rotter, Daniel and Vygen, Jens},
TITLE = {$d$-dimensional arrangement revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {13},
PAGES = {498-505},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {d-dimensional arrangement, linear arrangement, graph partitioning, space-filling curve, balanced hierarchical decomposition, geometric embedding, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001142},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sousa-Leite-Loques/13,
AUTHOR = {Sousa, L.S. and Leite, J.C.B. and Loques, Orlando},
TITLE = {Green data centers: Using hierarchies for scalable energy efficiency in large web clusters},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {507-515},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, green computing, server clusters, power-aware computing, energy economy, quality of service},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300121X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czap/13,
AUTHOR = {Czap, J{\'u}lius},
TITLE = {A note on total colorings of 1-planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {516-517},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, 1-planar graph, total coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001208},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Wang/13a,
AUTHOR = {Chen, Danny Z. and Wang, Haitao},
TITLE = {A note on searching line arrangements and applications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {518-521},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {line arrangement, vertex searching, points approximation, computational geometry, algorithm design},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001221},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gopalan-Ramasubramanian/13,
AUTHOR = {Gopalan, Abishek and Ramasubramanian, Srinivasan},
TITLE = {A counterexample for the proof of implication conjecture on independent spanning trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {522-526},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {independent trees, spanning trees, three connectivity, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001191},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Corrigendum in Inf.~Process.~Lett., Vol 114, 2014, No. 1-2, 84-84},
}
@article{Park-Ihm/13,
AUTHOR = {Park, Jung-Heum and Ihm, Insung},
TITLE = {Single-source three-disjoint path covers in cubes of connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {527-532},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {disjoint path cover, hamiltonicity, graph embedding, cube of a graph, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001294},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Xu/13a,
AUTHOR = {Li, Xiang-Jun and Xu, Jun-Ming},
TITLE = {Generalized measures of fault tolerance in exchanged hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {533-537},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, fault tolerance, interconnection networks, combinatorics, networks, fault-tolerant analysis, exchanged hypercube, connectivity, super connectivity},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300118X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giaquinta-Grabowski/13,
AUTHOR = {Giaquinta, Emanuele and Grabowski, Szymon},
TITLE = {New algorithms for binary jumbled pattern matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {538-542},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, string algorithms, jumbled pattern matching, parikh vectors, run-length encoding, word-level parallelism},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001300},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Civril/13,
AUTHOR = {{\c{C}}ivril, A.},
TITLE = {A note on the hardness of sparse approximation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {543-545},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, computational complexity, sparse approximation, subset selection, complexity, inapproximability},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001312},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hitchcock-Mayordomo/13,
AUTHOR = {Hitchcock, John M. and Mayordomo, Elvira},
TITLE = {Base invariance of feasible dimension},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {546-551},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, effective dimension, algorithmic information theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001154},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mark_Keil-Pradhan/13,
AUTHOR = {Mark Keil, J. and Pradhan, D.},
TITLE = {Computing a minimum outer-connected dominating set for the class of chordal graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {552-561},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, domination, outer-connected domination, proper interval graph, doubly chordal graph, undirected path graph, np-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300135X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Suttichaya-Bhattarakosol/13,
AUTHOR = {Suttichaya, Vasin and Bhattarakosol, Pattarasinee},
TITLE = {Solving the learning parity with noise's open question},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {562-566},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, cryptography, learning parity with noise, min-entropy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001336},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Tan/13,
AUTHOR = {Wang, Qichun and Tan, Chik How},
TITLE = {A new method to construct Boolean functions with good cryptographic properties},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {567-571},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bent function, algebraic immunity, nonlinearity, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001348},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Herranz-Ruiz-Saez/13,
AUTHOR = {Herranz, Javier and Ruiz, Alexandre and S{\'a}ez, Germ{\'a}n},
TITLE = {Sharing many secrets with computational provable security},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {572-579},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {multi-secret sharing schemes, provable security, symmetric encryption, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001373},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chin-Tan-Heng-Phan/13,
AUTHOR = {Chin, Ji-Jian and Tan, Syh-Yuan and Heng, Swee-Huay and Phan, Raphael C.-W.},
TITLE = {On the security of a modified Beth identity-based identification scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {580-583},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, identity-based identification, beth-ibi, cryptanalysis, proof of security},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001324},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bollig-Capelle/13,
AUTHOR = {Bollig, Beate and Capelle, Michael},
TITLE = {Priority functions for the approximation of the metric TSP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {14-16},
PAGES = {584-591},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, implicit graph algorithms, ordered binary decision diagrams, traveling salesperson problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001361},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ma-Yuan/13,
AUTHOR = {Ma, Ran and Yuan, Jinjiang},
TITLE = {Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {593-598},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, online algorithms, total completion time, rejection},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001403},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rangasamy-Akram-Thilagavathi/13,
AUTHOR = {Rangasamy, Parvathi and Akram, Muhammad and Thilagavathi, S.},
TITLE = {Intuitionistic fuzzy shortest hyperpath in a network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {599-603},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {intuitionistic fuzzy hypergraph, directed intuitionistic fuzzy hypergraph, intuitionistic fuzzy number, scores, accuracy, intuitionistic fuzzy shortest hyperpath, algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001385},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Badkobeh-Fici-Kroon-Liptak/13,
AUTHOR = {Badkobeh, Golnaz and Fici, Gabriele and Kroon, Steve and Lipt{\'a}k, Zsuzsanna},
TITLE = {Binary jumbled string matching for highly run-length compressible texts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {604-608},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {string algorithms, data structures, jumbled pattern matching, parikh vectors, prefix normal form, run-length encoding},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001415},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ren-Du-Xu/13,
AUTHOR = {Ren, Jianfeng and Du, Donglei and Xu, Dachuan},
TITLE = {The complexity of two supply chain scheduling problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {609-612},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, manufacturing and scheduling, supply chains, np-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001397},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mansour-Vajnovszki/13,
AUTHOR = {Mansour, Toufik and Vajnovszki, Vincent},
TITLE = {Efficient generation of restricted growth words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {613-616},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, restricted growth functions/words, gray codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001427},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klein/13,
AUTHOR = {Klein, Shmuel T.},
TITLE = {On the connection between Hamming codes, Heapsort and other methods},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {617-620},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, hamming codes, heapsort, binary search, subset sum problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001555},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Pei-Tang-Zhao/13,
AUTHOR = {Chen, Qi and Pei, Dingyi and Tang, Chunming and Zhao, Gansen},
TITLE = {Efficient integer span program for hierarchical threshold access structure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {621-627},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, secret sharing scheme, monotone span program, integer span program},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001518},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Simoes-Portugheis-da_Rocha/13,
AUTHOR = {Sim{\~o}es, D.R. and Portugheis, J. and da Rocha, V.C., Jr.},
TITLE = {Universal homophonic coding scheme using differential encoding and interleaving},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {628-633},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {homophonic coding, universal homophonic coding, source coding, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300152X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lu-Chen/13,
AUTHOR = {Lu, Linzhen and Chen, Shaozhen},
TITLE = {A compress slide attack on the full GOST block cipher},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {634-639},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block cipher, gost, cryptanalysis, slide attack, compress slide attack},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001543},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Oh-Kim-Moon/13,
AUTHOR = {Oh, Jinsoo and Kim, Jin and Moon, Byung-Ro},
TITLE = {On the inequivalence of bilinear algorithms for $3\times 3$ matrix multiplication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {640-645},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, matrix multiplication},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001531},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujita-Lesniak/13,
AUTHOR = {Fujita, Shinya and Lesniak, Linda},
TITLE = {Revisit of Erd{\H{o}}s-Gallai's theorem on the circumference of a graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {17},
PAGES = {646-648},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, circumference, cycle, maximum number of edges},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001579},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonomo-Giandomenico-Rossi/13,
AUTHOR = {Bonomo, Flavia and Giandomenico, Monia and Rossi, Fabrizio},
TITLE = {A note on the Cornaz-Jost transformation to solve the graph coloring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {649-652},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph coloring problem, graph operators, max-coloring problem, polynomial-time algorithm, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001567},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Hao-Xiang/13,
AUTHOR = {Zhang, Yan-Hong and Hao, Wei and Xiang, Tao},
TITLE = {Independent spanning trees in crossed cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {653-658},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, crossed cubes, independent spanning trees, algorithms, fault-tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001610},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Xu/13,
AUTHOR = {Wang, Yingqian and Xu, Jinghan},
TITLE = {Planar graphs with cycles of length neither 4 nor 6 are $(2,0,0)$-colorable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {659-663},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, cycle, improper coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001580},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Lin/13,
AUTHOR = {Feng, Yun and Lin, Wensong},
TITLE = {A concise proof for total coloring subcubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {664-665},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {total coloring, total chromatic number, subcubic graphs, cubic graphs, 3-regular graphs, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001609},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beyersdorff-Galesi-Lauria/13,
AUTHOR = {Beyersdorff, Olaf and Galesi, Nicola and Lauria, Massimo},
TITLE = {A characterization of tree-like Resolution size},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {666-671},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, proof complexity, prover-delayer games, resolution},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001592},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Phamila_Y-Amutha/13,
AUTHOR = {Phamila Y, Asnath Victy and Amutha, R},
TITLE = {Low complexity energy efficient very low bit-rate image compression scheme for wireless sensor network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {672-676},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, discrete cosine transform, image coding, computation complexity, real time systems, sensor network},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001750},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Yang-Zhang-He/13,
AUTHOR = {Yu, Cui and Yang, Xiaofan and Zhang, Jing and He, Li},
TITLE = {Routing and wavelength assignment for 3-ary $n$-cube communication patterns in linear array optical networks for $n$ communication rounds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {677-680},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, interconnection networks, wdm optical networks, linear array, 3-ary n-cube, routing and wavelength assignment, congestion about dimensions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001749},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Steyaert-Claeys-Bruneel/13,
AUTHOR = {Steyaert, Bart and Claeys, Dieter and Bruneel, Herwig},
TITLE = {The burst factor and its impact on buffer performance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {681-684},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, source burstiness, buffer dimensioning, traffic modelling},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001762},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feder-Subi/13,
AUTHOR = {Feder, Tom{\'a}s and Subi, Carlos},
TITLE = {Edge-coloring almost bipartite multigraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {685-689},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, chromatic index, edge coloring, list edge coloring, graph matching, stable marriage},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001737},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atallah-Grigorescu-Wu/13,
AUTHOR = {Atallah, Mikhail J. and Grigorescu, Elena and Wu, Yi},
TITLE = {A lower-variance randomized algorithm for approximate string matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {18},
PAGES = {690-692},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {convolution, fft, approximate string matching, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001622},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giaquinta-Grabowski-Fredriksson/13,
AUTHOR = {Giaquinta, Emanuele and Grabowski, Szymon and Fredriksson, Kimmo},
TITLE = {Approximate pattern matching with $k$-mismatches in packed text},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {693-697},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, string algorithms, k-mismatches, hamming distance, word-level parallelism},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001919},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cepek-Kucera-Kurik/13,
AUTHOR = {{\v{C}}epek, Ond{\v{r}}ej and Ku{\v{c}}era, Petr and Ku{\v{r}}{\'{i}}k, Stanislav},
TITLE = {Boolean functions with long prime implicants},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {698-703},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, approximation algorithms, boolean minimization, dnf, consensus method, set cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001804},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dai-Lin/13,
AUTHOR = {Dai, Benqiu and Lin, Wensong},
TITLE = {On $s,t$-relaxed $L(2,1)$-labelings of the square lattice},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {704-709},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, channel assignment, l ( 2 , 1 ) -labeling, ( s , t ) -relaxed l ( 2 , 1 ) -labeling, square lattice},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001798},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Li-Xu-Guo/13,
AUTHOR = {Guo, Qiaoping and Li, Shengjia and Xu, Gaokui and Guo, Yubao},
TITLE = {Notes on vertex pancyclicity of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {710-713},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, 2-connected graphs, pancyclicity, vertex-pancyclicity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001828},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lokshtanov-Misra-Saurabh/13,
AUTHOR = {Lokshtanov, Daniel and Misra, Neeldhara and Saurabh, Saket},
TITLE = {Imbalance is fixed parameter tractable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {714-718},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parameterized complexity, imbalance, fixed-parameter tractable algorithm, graph layout problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001774},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tyszka/13,
AUTHOR = {Tyszka, Apoloniusz},
TITLE = {Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {719-722},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, davis-putnam-robinson-matiyasevich theorem, diophantine equation with a finite number of solutions, matiyasevich's conjecture on finite-fold diophantine representations},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001932},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Wang-Wu-Zhu/13,
AUTHOR = {Wang, Lei and Wang, Xiaodong and Wu, Yingjie and Zhu, Daxin},
TITLE = {A dynamic programming solution to a generalized LCS problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {723-728},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, longest common subsequence, generalized lcs, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001944},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmid/13,
AUTHOR = {Schmid, Markus L.},
TITLE = {A note on the complexity of matching patterns with variables},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {729-733},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, formal languages, pattern matching with variables, parameterised pattern matching, np-complete problems, membership problem for pattern languages},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001786},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Ting/13,
AUTHOR = {Lin, Min-Sheng and Ting, Chao-Chun},
TITLE = {Computing $K$-terminal reliability of $d$-trapezoid graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {734-738},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, reliability, d-trapezoid graph, interval graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001956},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kocabas-Dincer/13,
AUTHOR = {Kocaba{\c{s}}, Ilker and Din{\c{c}}er, Bekir Taner},
TITLE = {A new statistical strategy for pooling: ELI},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {739-746},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, pooling, statistical, expected level of importance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001968},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doerr/13,
AUTHOR = {Doerr, Benjamin},
TITLE = {Improved approximation algorithms for the Min-Max Selecting Items problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {747-749},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithm, randomized rounding, derandomization, robust optimization},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nanongkai/13,
AUTHOR = {Nanongkai, Danupon},
TITLE = {Simple FPTAS for the subset-sums ratio problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {750-753},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fptas, approximation algorithms, subset sums},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001981},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gerstl-Mosheiov/13,
AUTHOR = {Gerstl, Enrique and Mosheiov, Gur},
TITLE = {An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {754-759},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, parallel machines, earliness-tardiness, due-window, assignment problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001816},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Xu/13b,
AUTHOR = {Li, Xiang-Jun and Xu, Jun-Ming},
TITLE = {Edge-fault tolerance of hypercube-like networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {760-763},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorics, networks, hypercube-like, fault tolerance, connectivity, super-connectivity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001993},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{AlTawy-Kircanski-Youssef/13,
AUTHOR = {AlTawy, Riham and Kircanski, Aleksandar and Youssef, Amr},
TITLE = {Second order collision for the 42-step reduced DHA-256 hash function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {764-770},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, cryptanalysis, hash functions, second order collisions, boomerang attack, dha-256},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002044},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Turau/13,
AUTHOR = {Turau, Volker},
TITLE = {Self-stabilizing algorithms for efficient sets of graphs and trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {771-776},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilizing algorithms, efficient domination, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300197X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sanyal-Gupta-Majumder/13,
AUTHOR = {Sanyal, Biswajit and Gupta, Prosenjit and Majumder, Subhashis},
TITLE = {Colored top-$K$ range-aggregate queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {777-784},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, range aggregation, transformation, persistence},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dudek-Frieze-Rucinski-Sileikis/13,
AUTHOR = {Dudek, Andrzej and Frieze, Alan and Ruci{\'n}ski, Andrzej and {\v{S}}ileikis, Matas},
TITLE = {Approximate counting of regular hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {785-788},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, hypergraphs, switching},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300207X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pang-Li-Pei-Wang/13,
AUTHOR = {Pang, Liaojun and Li, Huixian and Pei, Qingqi and Wang, Yumin},
TITLE = {Improvement on Meshram et al.'s ID-based cryptographic mechanism},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {789-792},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, id-based cryptosystem, deadlock, gdlp, ifp},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002081},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Farzanyar-Kangavari-Cercone/13,
AUTHOR = {Farzanyar, Zahra and Kangavari, Mohammadreza and Cercone, Nick},
TITLE = {P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {793-798},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data stream, on-line algorithms, p2p distributed systems, p2p data mining},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002056},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ahadi-Dehghan/13,
AUTHOR = {Ahadi, A. and Dehghan, A.},
TITLE = {The complexity of the proper orientation number},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {799-803},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, proper orientation, vertex coloring, np-completeness, planar 3-sat (type 2), graph orientation, polynomial algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002068},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Lin-Yu/13,
AUTHOR = {Zhang, Hailiang and Lin, Rongfei and Yu, Guanglong},
TITLE = {The largest matching root of unicyclic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {804-806},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, matching polynomial, spectral radius, the largest matching root},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013001920},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zunic-Zunic/13,
AUTHOR = {{\v{Z}}uni{\'c}, Dragi{\v{s}}a and {\v{Z}}uni{\'c}, Jovi{\v{s}}a},
TITLE = {Shape ellipticity based on the first Hu moment invariant},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {807-810},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, shape, moment invariants, shape descriptors, shape ellipticity, image processing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002093},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ke-Yu-Chang/13,
AUTHOR = {Ke, Pinhui and Yu, Wanghong and Chang, Zuling},
TITLE = {A note on binary sequence pairs with two-level correlation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {811-814},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, binary sequence pair, difference set pair, cyclotomy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002111},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Panda-Paul/13,
AUTHOR = {Panda, B.S. and Paul, S.},
TITLE = {A linear time algorithm for liar's domination problem in proper interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {815-822},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, liar's domination, proper interval graphs, undirected path graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ning/13,
AUTHOR = {Ning, Bo},
TITLE = {Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {823-826},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, hamilton cycle, fan-type degree condition, induced subgraph, claw},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002032},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kara/13,
AUTHOR = {Kara, Orhun},
TITLE = {Square reflection cryptanalysis of 5-round Feistel networks with permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {827-831},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block cipher, feistel network, square attack, reflection attack, deal, fixed point},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002172},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sokolov-Drac/13,
AUTHOR = {Sokolov, A.V. and Drac, A.V.},
TITLE = {The linked list representation of $n$ LIFO-stacks and/or FIFO-queues in the single-level memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {832-835},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, linked lists, fifo-stacks, lifo-queues, dynamic data structures, mathematical modeling},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300210X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hocquard-Ochem-Valicov/13,
AUTHOR = {Hocquard, Herv{\'e} and Ochem, Pascal and Valicov, Petru},
TITLE = {Strong edge-colouring and induced matchings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {836-843},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {strong edge-colouring, induced matching, computational complexity, planar graphs, outerplanar graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002159},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujito-Sakamaki/13,
AUTHOR = {Fujito, Toshihiro and Sakamaki, Takayoshi},
TITLE = {How to guard a graph against tree moves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {844-847},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, guarding game, set cover, greedy approximation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002147},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krithika-Narayanaswamy/13,
AUTHOR = {Krithika, R. and Narayanaswamy, N.S.},
TITLE = {Another disjoint compression algorithm for odd cycle transversal},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {849-851},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, parameterized complexity, odd cycle transversal, disjoint compression, above guarantee vertex cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002238},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Lin-Rossmanith/13,
AUTHOR = {Chang, Maw-Shang and Lin, Chuang-Chieh and Rossmanith, Peter},
TITLE = {Testing consistency of quartet topologies: A parameterized approach},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {852-857},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithm, property testing, evolutionary tree, quartet method},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002226},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cranston-O/13,
AUTHOR = {Cranston, Daniel W. and O, Suil},
TITLE = {Hamiltonicity in connected regular graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {858-860},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, hamiltonicity, regular graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002214},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jennhwa_Chang-Chang-Kuo-Poon/13,
AUTHOR = {Jennhwa Chang, Gerard and Chang, Chan-Wei and Kuo, David and Poon, Sheung-Hung},
TITLE = {Algorithmic aspect of stratified domination in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {861-865},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, graph algorithms, k-stratified graph, domination, f-domination, np-complete, bipartite graph, planar graph, chordal graph, tree},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300224X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Zhang-Qu-Fu/13,
AUTHOR = {Dong, Deshuai and Zhang, Xue and Qu, Longjiang and Fu, Shaojing},
TITLE = {A note on vectorial bent functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {866-870},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, boolean functions, nonlinearity, bent function, vectorial functions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002135},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shin/13,
AUTHOR = {Shin, Chan-Su},
TITLE = {A note on minimum-sum coverage by aligned disks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {871-875},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, geometric facility location, minimum-sum disk coverage},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002251},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Yi-Qiao/13,
AUTHOR = {Chen, Yuhuan and Yi, Chenfu and Qiao, Dengyu},
TITLE = {Improved neural solution for the Lyapunov matrix equation based on gradient search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {876-881},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, recurrent neural networks, gradient search, hierarchical identification principle, energy function, activation function},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300238X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasan/13,
AUTHOR = {Hasan, Masud},
TITLE = {On fixed size projection of simplicial polyhedra},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {882-887},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, characterization, convex polyhedra, equiprojective polyhedra, biprojective polyhedra, simplicial polyhedra},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002378},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vadlamudi-Aine-Chakrabarti/13,
AUTHOR = {Vadlamudi, S.G. and Aine, Sandip and Chakrabarti, P.P.},
TITLE = {Incremental Beam search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {888-893},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, beam search, monotonicity, heuristic search, anytime algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002391},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tutu/13,
AUTHOR = {{\c{T}}u{\c{t}}u, Ionu{\c{t}}},
TITLE = {Comorphisms of structured institutions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {894-900},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, specification languages, structured specifications, institution theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002408},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avni-Kupferman/13,
AUTHOR = {Avni, Guy and Kupferman, Orna},
TITLE = {When does abstraction help?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {901-905},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, abstraction, deterministic finite automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002445},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guillemot-Marx/13,
AUTHOR = {Guillemot, Sylvain and Marx, D{\'a}niel},
TITLE = {A faster FPT algorithm for Bipartite Contraction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {906-912},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, graph algorithms, randomized algorithms, fixed-parameter tractability, graph modification problems},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901300241X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Galindo/13,
AUTHOR = {Galindo, David},
TITLE = {A note on an IND-CCA2 secure Paillier-based cryptosystem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {913-914},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, public key encryption, paillier, ind-cca2, random oracle model},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002457},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kucherov-Tothmeresz-Vialette/13,
AUTHOR = {Kucherov, Gregory and T{\'o}thm{\'e}r{\'e}sz, Lilla and Vialette, St{\'e}phane},
TITLE = {On the combinatorics of suffix arrays},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {915-920},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, permutations, suffix array, burrows-wheeler transform},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002469},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Winzen/13,
AUTHOR = {Winzen, Carola},
TITLE = {Direction-reversing quasi-random rumor spreading with restarts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {22-24},
PAGES = {921-926},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, rumor spreading, broadcasting in networks, quasi-randomness, distributed computing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002433},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}